summaryrefslogtreecommitdiffstats
path: root/clang
diff options
context:
space:
mode:
authorChandler Carruth <chandlerc@gmail.com>2014-05-04 09:38:32 +0000
committerChandler Carruth <chandlerc@gmail.com>2014-05-04 09:38:32 +0000
commit312dddfb81500e05f7d22264f95ab4162d237f82 (patch)
tree76e1b5f5f252f5b280016fc014285d0fb0dd5c55 /clang
parentcc6e1877d79878630f88775621b9f40e656a02e7 (diff)
downloadbcm5719-llvm-312dddfb81500e05f7d22264f95ab4162d237f82.tar.gz
bcm5719-llvm-312dddfb81500e05f7d22264f95ab4162d237f82.zip
[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
Diffstat (limited to 'clang')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud