Chandler Carruth 312dddfb81 [LCG] Add the last (and most complex) of the edge insertion mutation ...

operations on the call graph. This one forms a cycle, and while not as
complex as removing an internal edge from an SCC, it involves
a reasonable amount of work to find all of the nodes newly connected in
a cycle.

Also somewhat alarming is the worst case complexity here: it might have
to walk roughly the entire SCC inverse DAG to insert a single edge. This
is carefully documented in the API (I hope).

llvm-svn: 207935

2014-05-04 09:38:32 +00:00

22 KiB

Raw Blame History

View Raw