Searched refs:CurNode (Results 1 - 4 of 4) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DAliasSetTracker.h187 PointerRec *CurNode;
189 explicit iterator(PointerRec *CN = 0) : CurNode(CN) {}
192 return CurNode == x.CurNode;
197 CurNode = I.CurNode;
202 assert(CurNode && "Dereferencing AliasSet.end()!");
203 return *CurNode;
207 Value *getPointer() const { return CurNode->getValue(); }
208 uint64_t getSize() const { return CurNode
[all...]
/external/clang/lib/Rewrite/
H A DRewriteRope.cpp678 CurNode = cast<RopePieceBTreeLeaf>(N);
682 while (CurNode && getCN(CurNode)->getNumPieces() == 0)
683 CurNode = getCN(CurNode)->getNextLeafInOrder();
685 if (CurNode != 0)
686 CurPiece = &getCN(CurNode)->getPiece(0);
693 if (CurPiece != &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces()-1)) {
701 CurNode
[all...]
/external/clang/include/clang/Rewrite/
H A DRewriteRope.h107 /// CurNode - The current B+Tree node that we are inspecting.
108 const void /*RopePieceBTreeLeaf*/ *CurNode; member in class:clang::RopePieceBTreeIterator
118 RopePieceBTreeIterator() : CurNode(0), CurPiece(0), CurChar(0) {}
/external/llvm/include/llvm/ADT/
H A Dilist.h410 NodeTy *CurNode = where.getNodePtrUnchecked(); local
411 NodeTy *PrevNode = this->getPrev(CurNode);
412 this->setNext(New, CurNode);
415 if (CurNode != Head) // Is PrevNode off the beginning of the list?
419 this->setPrev(CurNode, New);

Completed in 885 milliseconds