Home
last modified time | relevance | path

Searched refs:CurNode (Results 1 – 19 of 19) sorted by relevance

/external/clang/lib/Rewrite/
DRewriteRope.cpp676 CurNode = cast<RopePieceBTreeLeaf>(N); in RopePieceBTreeIterator()
680 while (CurNode && getCN(CurNode)->getNumPieces() == 0) in RopePieceBTreeIterator()
681 CurNode = getCN(CurNode)->getNextLeafInOrder(); in RopePieceBTreeIterator()
683 if (CurNode) in RopePieceBTreeIterator()
684 CurPiece = &getCN(CurNode)->getPiece(0); in RopePieceBTreeIterator()
691 if (CurPiece != &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces()-1)) { in MoveToNextPiece()
699 CurNode = getCN(CurNode)->getNextLeafInOrder(); in MoveToNextPiece()
700 while (CurNode && getCN(CurNode)->getNumPieces() == 0); in MoveToNextPiece()
702 if (CurNode) in MoveToNextPiece()
703 CurPiece = &getCN(CurNode)->getPiece(0); in MoveToNextPiece()
/external/llvm-project/clang/lib/Rewrite/
DRewriteRope.cpp680 CurNode = cast<RopePieceBTreeLeaf>(N); in RopePieceBTreeIterator()
684 while (CurNode && getCN(CurNode)->getNumPieces() == 0) in RopePieceBTreeIterator()
685 CurNode = getCN(CurNode)->getNextLeafInOrder(); in RopePieceBTreeIterator()
687 if (CurNode) in RopePieceBTreeIterator()
688 CurPiece = &getCN(CurNode)->getPiece(0); in RopePieceBTreeIterator()
695 if (CurPiece != &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces()-1)) { in MoveToNextPiece()
703 CurNode = getCN(CurNode)->getNextLeafInOrder(); in MoveToNextPiece()
704 while (CurNode && getCN(CurNode)->getNumPieces() == 0); in MoveToNextPiece()
706 if (CurNode) in MoveToNextPiece()
707 CurPiece = &getCN(CurNode)->getPiece(0); in MoveToNextPiece()
/external/llvm-project/llvm/include/llvm/Analysis/
DAliasSetTracker.h240 PointerRec *CurNode; variable
243 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function
246 return CurNode == x.CurNode;
251 assert(CurNode && "Dereferencing AliasSet.end()!");
252 return *CurNode;
256 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
257 LocationSize getSize() const { return CurNode->getSize(); } in getSize()
258 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()
261 assert(CurNode && "Advancing past AliasSet.end()!");
262 CurNode = CurNode->getNext();
/external/llvm/include/llvm/Analysis/
DAliasSetTracker.h198 PointerRec *CurNode; variable
201 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function
204 return CurNode == x.CurNode;
209 assert(CurNode && "Dereferencing AliasSet.end()!");
210 return *CurNode;
214 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
215 uint64_t getSize() const { return CurNode->getSize(); } in getSize()
216 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()
219 assert(CurNode && "Advancing past AliasSet.end()!");
220 CurNode = CurNode->getNext();
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DAliasSetTracker.h241 PointerRec *CurNode; variable
244 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function
247 return CurNode == x.CurNode;
252 assert(CurNode && "Dereferencing AliasSet.end()!");
253 return *CurNode;
257 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
258 LocationSize getSize() const { return CurNode->getSize(); } in getSize()
259 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()
262 assert(CurNode && "Advancing past AliasSet.end()!");
263 CurNode = CurNode->getNext();
/external/llvm-project/clang-tools-extra/clangd/refactor/tweaks/
DExtractVariable.cpp142 for (const SelectionTree::Node *CurNode = getExprNode(); in computeInsertionPoint() local
143 CurNode->Parent && CanExtractOutside(CurNode); in computeInsertionPoint()
144 CurNode = CurNode->Parent) { in computeInsertionPoint()
145 const clang::Stmt *CurInsertionPoint = CurNode->ASTNode.get<Stmt>(); in computeInsertionPoint()
149 if (const clang::Stmt *CurParent = CurNode->Parent->ASTNode.get<Stmt>()) { in computeInsertionPoint()
DExtractFunction.cpp233 for (const Node *CurNode = CommonAnc; CurNode; CurNode = CurNode->Parent) { in findEnclosingFunction() local
235 if (CurNode->ASTNode.get<LambdaExpr>()) in findEnclosingFunction()
237 if (const FunctionDecl *Func = CurNode->ASTNode.get<FunctionDecl>()) { in findEnclosingFunction()
/external/swiftshader/third_party/subzero/src/
DIceASanInstrumentation.h40 ICE_TLS_INIT_FIELD(CurNode); in ASanInstrumentation()
61 ICE_TLS_DECLARE_FIELD(CfgNode *, CurNode);
DIceVariableSplitting.cpp76 void reset(const CfgNode *CurNode) { in reset() argument
77 Node = CurNode; in reset()
171 void setNode(CfgNode *CurNode) { in setNode() argument
172 Node = CurNode; in setNode()
DIceASanInstrumentation.cpp73 ICE_TLS_DEFINE_FIELD(CfgNode *, ASanInstrumentation, CurNode);
416 if (ICE_TLS_GET_FIELD(CurNode) != Context.getNode()) { in instrumentAccess()
417 ICE_TLS_SET_FIELD(CurNode, Context.getNode()); in instrumentAccess()
/external/clang/include/clang/Rewrite/Core/
DRewriteRope.h91 const void /*RopePieceBTreeLeaf*/ *CurNode; variable
102 : CurNode(nullptr), CurPiece(nullptr), CurChar(0) {} in RopePieceBTreeIterator()
/external/llvm/include/llvm/ADT/
Dilist.h410 NodeTy *CurNode = where.getNodePtrUnchecked();
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);
/external/llvm-project/clang/include/clang/Rewrite/Core/
DRewriteRope.h89 const void /*RopePieceBTreeLeaf*/ *CurNode = nullptr; variable
/external/clang/include/clang/ASTMatchers/
DASTMatchers.h5374 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
5376 if(const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
5380 } else if(const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
5386 for(const auto &Parent: Finder->getASTContext().getParents(CurNode)) in AST_MATCHER_P()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DMemorySSA.cpp819 DefPath &CurNode = *Iter; in tryOptimizePhi() local
820 assert(CurNode.Last == Current); in tryOptimizePhi()
847 TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)}; in tryOptimizePhi()
/external/llvm-project/llvm/lib/Analysis/
DMemorySSA.cpp844 DefPath &CurNode = *Iter; in tryOptimizePhi() local
845 assert(CurNode.Last == Current); in tryOptimizePhi()
872 TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)}; in tryOptimizePhi()
/external/llvm-project/clang/include/clang/ASTMatchers/
DASTMatchers.h7198 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
7200 if(const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
7204 } else if(const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
7210 for(const auto &Parent: Finder->getASTContext().getParents(CurNode)) in AST_MATCHER_P()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp1841 auto CurNode = Worklist[i].first; in visitTokenFactor() local
1845 switch (CurNode->getOpcode()) { in visitTokenFactor()
1854 for (const SDValue &Op : CurNode->op_values()) in visitTokenFactor()
1861 AddToWorklist(i, CurNode->getOperand(0).getNode(), CurOpNumber); in visitTokenFactor()
1864 if (auto *MemNode = dyn_cast<MemSDNode>(CurNode)) in visitTokenFactor()
/external/llvm-project/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp1970 auto CurNode = Worklist[i].first; in visitTokenFactor() local
1974 switch (CurNode->getOpcode()) { in visitTokenFactor()
1983 for (const SDValue &Op : CurNode->op_values()) in visitTokenFactor()
1990 AddToWorklist(i, CurNode->getOperand(0).getNode(), CurOpNumber); in visitTokenFactor()
1993 if (auto *MemNode = dyn_cast<MemSDNode>(CurNode)) in visitTokenFactor()