HomeSort by: relevance | last modified time | path
    Searched refs:VisitOrder (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
Consumed.h 209 std::vector<unsigned int> VisitOrder;
215 : StateMapsArray(NumBlocks), VisitOrder(NumBlocks, 0) {
218 VisitOrder[BI->getBlockID()] = VisitOrderCounter++;
  /src/external/apache2/llvm/dist/clang/lib/Serialization/
ModuleManager.cpp 257 // Explicitly clear VisitOrder since we might not notice it is stale.
258 VisitOrder.clear();
360 if (VisitOrder.size() != Chain.size()) {
362 VisitOrder.clear();
363 VisitOrder.reserve(N);
383 VisitOrder.push_back(CurrentModule);
400 assert(VisitOrder.size() == N && "Visitation order is wrong?");
421 for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) {
422 ModuleFile *CurrentModule = VisitOrder[I];
  /src/external/apache2/llvm/dist/clang/include/clang/Serialization/
ModuleManager.h 83 SmallVector<ModuleFile *, 4> VisitOrder;
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
Consumed.cpp 1008 unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()];
1011 if (*PI && CurrBlockOrder < VisitOrder[(*PI)->getBlockID()] )
1069 return VisitOrder[From->getBlockID()] > VisitOrder[To->getBlockID()];
1080 unsigned int BlockVisitOrder = VisitOrder[Block->getBlockID()];
1083 if (*PI && BlockVisitOrder < VisitOrder[(*PI)->getBlockID()])
  /src/external/apache2/llvm/dist/clang/tools/libclang/
CIndex.cpp 529 int VisitOrder[2] = {VisitPreprocessorLast, !VisitPreprocessorLast};
531 if (VisitOrder[I]) {

Completed in 45 milliseconds