projects / platform / upstream / llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 2c58e1a) | patch
[LCG] Rather than walking the directed graph structure to update graph
authorChandler Carruth <chandlerc@gmail.com>
Sat, 5 Aug 2017 03:37:39 +0000 (03:37 +0000)
committerChandler Carruth <chandlerc@gmail.com>
Sat, 5 Aug 2017 03:37:39 +0000 (03:37 +0000)
commit7cb23e705f72e7143a9804980eafcae75f76d757
tree7557893dc55ebc3cb61ecbb14dd06c2ba1a9a49btree | snapshot
parent2c58e1a45c6d71b256cba2dc9df726d855d1ad1ecommit | diff
[LCG] Rather than walking the directed graph structure to update graph
pointers in node objects, just walk the map from function to node.

It doesn't have stable ordering, but works just as well and is much
simpler. We don't need ordering when just updating internal pointers.

llvm-svn: 310163
llvm/lib/Analysis/LazyCallGraph.cpp diff | blob | history
Domain: System / Toolchain;