summaryrefslogtreecommitdiffstats
path: root/clang/test/Sema/exprs.c
diff options
context:
space:
mode:
authorJordan Rose <jordan_rose@apple.com>2013-03-18 23:34:37 +0000
committerJordan Rose <jordan_rose@apple.com>2013-03-18 23:34:37 +0000
commit2d0edec994ebf22ba0dc9dccac215b1a9948e307 (patch)
tree3347c6100f137124a62ab4372e7ff4595c6a0dc8 /clang/test/Sema/exprs.c
parentee47a5bd92be1f8d0ef6dda5c2f2d31b3cd27505 (diff)
downloadbcm5719-llvm-2d0edec994ebf22ba0dc9dccac215b1a9948e307.tar.gz
bcm5719-llvm-2d0edec994ebf22ba0dc9dccac215b1a9948e307.zip
[analyzer] Do part of the work to find shortest bug paths up front.
Splitting the graph trimming and the path-finding (r177216) already recovered quite a bit of performance lost to increased suppression. We can still do better by also performing the reverse BFS up front (needed for shortest-path-finding) and only walking the shortest path for each report. This does mean we have to walk back up the path and invalidate all the BFS numbers if the report turns out to be invalid, but it's probably still faster than redoing the full BFS every time. More performance work for <rdar://problem/13433687> llvm-svn: 177353
Diffstat (limited to 'clang/test/Sema/exprs.c')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud