<div dir="ltr"><div><div><div>Ok.<br></div>Thanks for the confirmation.<br></div><br><br></div>Rekha<br></div><div class="gmail_extra"><br><div class="gmail_quote">On Tue, Sep 23, 2014 at 7:25 PM, John Criswell <span dir="ltr"><<a href="mailto:jtcriswel@gmail.com" target="_blank">jtcriswel@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div bgcolor="#FFFFFF" text="#000000">
<div>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<div><div class="h5"><br>
<br>
On 9/23/14, 12:33 AM, Rekha R wrote:<br>
</div></div></div>
<blockquote type="cite"><div><div class="h5">
<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></fieldset>
<br>
</div></div><pre>_______________________________________________
LLVM Developers mailing list
<a href="mailto:LLVMdev@cs.uiuc.edu" target="_blank">LLVMdev@cs.uiuc.edu</a> <a href="http://llvm.cs.uiuc.edu" target="_blank">http://llvm.cs.uiuc.edu</a>
<a href="http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev" target="_blank">http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev</a>
</pre>
</blockquote>
<br>
</div>
</blockquote></div><br><br clear="all"><br>-- <br>Rekha
</div>