Home
last modified time | relevance | path

Searched refs:VisitOrder (Results 1 – 4 of 4) sorted by relevance

/src/contrib/llvm-project/clang/lib/Serialization/
H A DModuleManager.cpp247 VisitOrder.clear(); in removeModules()
336 if (VisitOrder.size() != Chain.size()) { in visit()
338 VisitOrder.clear(); in visit()
339 VisitOrder.reserve(N); in visit()
359 VisitOrder.push_back(CurrentModule); in visit()
374 assert(VisitOrder.size() == N && "Visitation order is wrong?"); in visit()
394 for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) { in visit()
395 ModuleFile *CurrentModule = VisitOrder[I]; in visit()
/src/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DConsumed.h212 std::vector<unsigned int> VisitOrder; variable
218 : StateMapsArray(NumBlocks), VisitOrder(NumBlocks, 0) { in ConsumedBlockInfo()
221 VisitOrder[BI->getBlockID()] = VisitOrderCounter++; in ConsumedBlockInfo()
/src/contrib/llvm-project/clang/lib/Analysis/
H A DConsumed.cpp1008 unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()]; in allBackEdgesVisited()
1011 if (*PI && CurrBlockOrder < VisitOrder[(*PI)->getBlockID()] ) in allBackEdgesVisited()
1069 return VisitOrder[From->getBlockID()] > VisitOrder[To->getBlockID()]; in isBackEdge()
1080 unsigned int BlockVisitOrder = VisitOrder[Block->getBlockID()]; in isBackEdgeTarget()
1083 if (*PI && BlockVisitOrder < VisitOrder[(*PI)->getBlockID()]) in isBackEdgeTarget()
/src/contrib/llvm-project/clang/include/clang/Serialization/
H A DModuleManager.h81 SmallVector<ModuleFile *, 4> VisitOrder; variable