[PATCH] Allow tail call optimization through multiple/nested struct extractions/insertions

Stephen Lin swlin at post.harvard.edu
Fri Apr 19 07:42:11 PDT 2013


On Fri, Apr 19, 2013 at 3:09 AM, Stephen Lin <swlin at post.harvard.edu> wrote:
> No problem, I managed to get rid of most of the recursion, actually
> (see updated patch); it was an interesting exercise. The only
> recursion left is to handle extractions and insertions...I could
> probably do something with that too but it requires a lot more book
> keeping. Do you think it's worth it?
>
> I've added tests to CodeGen/X86/tailcall-64.ll to test for the new
> positive cases. I thought of adding cases to verify that there aren't
> any false positives because I had a hard time thinking of meaningful
> false positive cases, but I can try harder to think of some. I also
> didn't add tests for other targets since this is all
> target-independent, but I don't mind doing that if you think it's
> worthwhile.
>
> The entire LNT nightly test suite passes, except for an execution time
> limit on one test, which was already failing for me before this. Is
> there anything else I should test?
>
> Stephen
>

I've cleaned up the code a bit more.
- Stephen



More information about the llvm-commits mailing list