[PATCH] D53706: [RecursionStackElimination]: Pass to eliminate recursions

[Martin Elshuber via Phabricator via llvm-commits]

marels added a comment.

I also did some measurements on a use-case to compare the marker algorithm (AArch64): Physics-Simulation int the hot loop the application traverses a full octree.

The resulting performance was: PassDisabled < Chunked < Field < Compare = Tagged A < Tagged B.
Note: I do not have an llvm implementation for the Chunked Marker do I tested it on modified C code.

Because the Tagged B marker I am tending to redo this part of the code generation and drop all other markers besides the always true and maybe the always false marker algorithm.

What do you think about it?


Repository:
  rL LLVM

https://reviews.llvm.org/D53706