llvm dev - Mar 2019 - Time Complexity of LLVM IR Code

Hello,
I want to find complexity of code in IR...Like if we have 2 nested loops

for(i=0;i<N1;i++)
for(j=0;j<N1;j++)
{
......

}

Here N1 is unknown at compile time.

So complexity will be N1^2...How can I find this by doing LLVM IR analysis?
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20190307/f5697215/attachment.html>

Maybe this project can help you:
https://github.com/demontiejr/asymptus

Regards,
Victor.

On Thu, Mar 7, 2019 at 2:29 PM hameeza ahmed via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> Hello,
> I want to find complexity of code in IR...Like if we have 2 nested loops
>
> for(i=0;i<N1;i++)
> for(j=0;j<N1;j++)
> {
> ......
>
> }
>
> Here N1 is unknown at compile time.
>
> So complexity will be N1^2...How can I find this by doing LLVM IR analysis?
> _______________________________________________
> LLVM Developers mailing list
> llvm-dev at lists.llvm.org
> https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20190307/bfb640e6/attachment.html>