Chandler Carruth 95f263eb86 [LCG] Add the concept of a "dead" node and use it to avoid a complex ... walk over the parent set. When removing a single function from the call graph, we previously would walk the entire RefSCC's parent set and then walk every outgoing edge just to find the ones to remove. In addition to this being quite high complexity in theory, it is also the last fundamental use of the parent sets. With this change, when we remove a function we transform the node containing it to be recognizably "dead" and then teach the edge iterators to recognize edges to such nodes and skip them the same way they skip null edges. We can't move fully to using "dead" nodes -- when disconnecting two live nodes we need to null out the edge. But the complexity this adds to the edge sequence isn't too bad and the simplification of lazily handling this seems like a significant win. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@310169 91177308-0d34-0410-b5e6-96231b3b80d8		2017-08-05 05:47:37 +00:00
..
llvm	[LCG] Add the concept of a "dead" node and use it to avoid a complex	2017-08-05 05:47:37 +00:00
llvm-c	[ORC] Errorize the ORC APIs.	2017-07-07 02:59:13 +00:00