<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-cite-prefix">Dear Rekha,<br>
<br>
I don't think LLVM has a pass that does this. If you need such a
pass, I think you will need to write it yourself.<br>
<br>
Regards,<br>
<br>
John Criswell<br>
<br>
On 9/23/14, 12:33 AM, Rekha R wrote:<br>
</div>
<blockquote
cite="mid:CADFTssnPy0UXLmq0ZfJhnpV2GfnH43-kActRvZBqQMybT1m=nw@mail.gmail.com"
type="cite">
<div dir="ltr">
<div>
<div>Hi,<br>
<br>
</div>
I plan to implement an algorithm which requires BasicBlocks
to have at most two predecessors. simplifycfg pass is not a
choice since it doesn't do what I want, going by its
description.<br>
<br>
</div>
Could someone point me to an existing pass which does this job?<br
clear="all">
<div>
<div>
<div><br>
</div>
<div>Thanks,<br>
</div>
<div>-- <br>
Rekha
</div>
</div>
</div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
LLVM Developers mailing list
<a class="moz-txt-link-abbreviated" href="mailto:LLVMdev@cs.uiuc.edu">LLVMdev@cs.uiuc.edu</a> <a class="moz-txt-link-freetext" href="http://llvm.cs.uiuc.edu">http://llvm.cs.uiuc.edu</a>
<a class="moz-txt-link-freetext" href="http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev">http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev</a>
</pre>
</blockquote>
<br>
</body>
</html>