forked from OSchip/llvm-project
ca70ed53da
BFS should give slightly better performance. Ex: Suppose, we have two roots R1 and R2. A callee function C is reachable through both. However, C is not inlined when analyzing R1 due to inline stack depth limit. With DFS, C will be analyzed as top level even though it would be analyzed as inlined through R2. On the other hand, BFS could avoid analyzing C as top level. llvm-svn: 152652 |
||
---|---|---|
.. | ||
ARCMigrate | ||
AST | ||
Analysis | ||
Basic | ||
CodeGen | ||
Driver | ||
Edit | ||
Frontend | ||
FrontendTool | ||
Headers | ||
Index | ||
Lex | ||
Parse | ||
Rewrite | ||
Sema | ||
Serialization | ||
StaticAnalyzer | ||
CMakeLists.txt | ||
Makefile |