forked from OSchip/llvm-project
fd905fcc14
The class DataflowWorklist internally maintains a sorted list of pointers to CFGBlock and the method enqueuePredecessors has to call sortWorklist to maintain the invariant. The implementation based on vector + sort works well for small sizes but gets infeasible for relatively large sizes. In particular the issue takes place for some cryptographic libraries which use code generation. The diff replaces vector + sort with priority queue. For one of the implementations of AES this patch reduces the time for analysis from 204 seconds to 8 seconds. Test plan: make -j8 check-clang Differential revision: https://reviews.llvm.org/D25503 llvm-svn: 284166 |
||
---|---|---|
.. | ||
AnalysisDeclContext.cpp | ||
BodyFarm.cpp | ||
BodyFarm.h | ||
CFG.cpp | ||
CFGReachabilityAnalysis.cpp | ||
CFGStmtMap.cpp | ||
CMakeLists.txt | ||
CallGraph.cpp | ||
CloneDetection.cpp | ||
CocoaConventions.cpp | ||
CodeInjector.cpp | ||
Consumed.cpp | ||
Dominators.cpp | ||
FormatString.cpp | ||
FormatStringParsing.h | ||
LiveVariables.cpp | ||
ObjCNoReturn.cpp | ||
PostOrderCFGView.cpp | ||
PrintfFormatString.cpp | ||
ProgramPoint.cpp | ||
PseudoConstantAnalysis.cpp | ||
ReachableCode.cpp | ||
ScanfFormatString.cpp | ||
ThreadSafety.cpp | ||
ThreadSafetyCommon.cpp | ||
ThreadSafetyLogical.cpp | ||
ThreadSafetyTIL.cpp | ||
UninitializedValues.cpp |