HomeSort by relevance Sort by last modified time
    Searched refs:CurNode (Results 1 - 4 of 4) sorted by null

  /external/llvm/include/llvm/Analysis/
AliasSetTracker.h 185 PointerRec *CurNode;
187 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {}
190 return CurNode == x.CurNode;
195 CurNode = I.CurNode;
200 assert(CurNode && "Dereferencing AliasSet.end()!");
201 return *CurNode;
205 Value *getPointer() const { return CurNode->getValue(); }
206 uint64_t getSize() const { return CurNode->getSize();
    [all...]
  /external/clang/lib/Rewrite/Core/
RewriteRope.cpp 674 CurNode = cast<RopePieceBTreeLeaf>(N);
678 while (CurNode && getCN(CurNode)->getNumPieces() == 0)
679 CurNode = getCN(CurNode)->getNextLeafInOrder();
681 if (CurNode)
682 CurPiece = &getCN(CurNode)->getPiece(0);
689 if (CurPiece != &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces()-1)) {
697 CurNode = getCN(CurNode)->getNextLeafInOrder()
    [all...]
  /external/clang/include/clang/Rewrite/Core/
RewriteRope.h 114 /// CurNode - The current B+Tree node that we are inspecting.
115 const void /*RopePieceBTreeLeaf*/ *CurNode;
126 : CurNode(nullptr), CurPiece(nullptr), CurChar(0) {}
  /external/llvm/include/llvm/ADT/
ilist.h 413 NodeTy *CurNode = where.getNodePtrUnchecked();
414 NodeTy *PrevNode = this->getPrev(CurNode);
415 this->setNext(New, CurNode);
418 if (CurNode != Head) // Is PrevNode off the beginning of the list?
422 this->setPrev(CurNode, New);

Completed in 137 milliseconds