<div dir="ltr"><div dir="ltr"><div>Maybe this project can help you:</div><div><a href="https://github.com/demontiejr/asymptus">https://github.com/demontiejr/asymptus</a></div><div><br></div><div>Regards,</div><div>Victor.<br></div></div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Thu, Mar 7, 2019 at 2:29 PM hameeza ahmed via llvm-dev <<a href="mailto:llvm-dev@lists.llvm.org">llvm-dev@lists.llvm.org</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr"><div>Hello,</div><div>I want to find complexity of code in IR...Like if we have 2 nested loops</div><div><br></div><div>for(i=0;i<N1;i++)</div><div>for(j=0;j<N1;j++)</div><div>{</div><div>......</div><div><br></div><div>}</div><div><br></div><div>Here N1 is unknown at compile time.</div><div><br></div><div>So complexity will be N1^2...How can I find this by doing LLVM IR analysis?<br></div></div>
_______________________________________________<br>
LLVM Developers mailing list<br>
<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a><br>
<a href="https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" rel="noreferrer" target="_blank">https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev</a><br>
</blockquote></div>