HomeSort by: relevance | last modified time | path
    Searched defs:Heads (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Automaton.h 78 /// Heads of each tracked path. These are not ordered.
79 std::deque<PathSegment *> Heads;
94 // Iterate over all existing heads. We will mutate the Heads deque during
96 unsigned NumHeads = Heads.size();
98 PathSegment *Head = Heads[I];
107 Heads.push_back(makePathSegment(PI->ToDfaState, Head));
109 // Now we've iterated over all the initial heads and added new ones,
110 // dispose of the original heads.
111 Heads.erase(Heads.begin(), std::next(Heads.begin(), NumHeads))
    [all...]
  /src/sbin/fsck_msdos/
dosfs.h 50 u_int Heads; /* number of heads */
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoadStoreVectorizer.cpp 923 SmallVector<int, 16> Heads, Tails;
943 Heads.push_back(i);
952 for (int Head : Heads) {
958 !InstructionsProcessed.count(Instrs[Heads[TIt]])) {
969 while (I != -1 && (is_contained(Tails, I) || is_contained(Heads, I))) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 660 SetVector<StoreInst *> Heads, Tails;
678 Heads.insert(SL[i]);
739 Heads.insert(SL[i]);
752 for (SetVector<StoreInst *>::iterator it = Heads.begin(), e = Heads.end();
766 while (Tails.count(I) || Heads.count(I)) {

Completed in 95 milliseconds