Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/clang/lib/Rewrite/
H A 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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp1183 assert(CurNode); in assignStackNodesPostOrder()
1184 assert(!CurNode->Recursive); in assignStackNodesPostOrder()
1186 PrevNode = CurNode; in assignStackNodesPostOrder()
1194 PrevNode = CurNode; in assignStackNodesPostOrder()
1229 assert(CurNode); in assignStackNodesPostOrder()
1243 PrevNode = CurNode; in assignStackNodesPostOrder()
1333 ContextNode *CurNode = LastNode; in updateStackNodes() local
1340 CurNode = getNodeForStackId(Id); in updateStackNodes()
1342 assert(CurNode); in updateStackNodes()
1344 if (CurNode->Recursive) { in updateStackNodes()
[all …]
/freebsd-14.2/contrib/llvm-project/clang/include/clang/Rewrite/Core/
H A DRewriteRope.h88 const void /*RopePieceBTreeLeaf*/ *CurNode = nullptr; variable
/freebsd-14.2/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchers.h8291 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
8293 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
8297 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
8303 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
8341 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
8343 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
8347 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
8352 } else if (const auto *ObjCMethodDeclNode = CurNode.get<ObjCMethodDecl>()) { in AST_MATCHER_P()
8356 } else if (const auto *BlockDeclNode = CurNode.get<BlockDecl>()) { in AST_MATCHER_P()
8361 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
/freebsd-14.2/contrib/llvm-project/clang/include/clang/AST/
H A DDeclBase.h1348 if (DeclListNode *CurNode = Ptr.dyn_cast<DeclListNode*>())
1349 return CurNode->D;
1358 if (DeclListNode *CurNode = Ptr.dyn_cast<DeclListNode*>())
1359 Ptr = CurNode->Rest;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DMemorySSA.cpp815 DefPath &CurNode = *Iter; in tryOptimizePhi() local
816 assert(CurNode.Last == Current); in tryOptimizePhi()
843 TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)}; in tryOptimizePhi()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGISel.cpp1059 SDNode *CurNode = &*ISelPosition; in NodeInserted() local
1060 if (MDNode *MD = DAG.getPCSections(CurNode)) in NodeInserted()
H A DDAGCombiner.cpp2301 auto CurNode = Worklist[i].first; in visitTokenFactor() local
2305 switch (CurNode->getOpcode()) { in visitTokenFactor()
2314 for (const SDValue &Op : CurNode->op_values()) in visitTokenFactor()
2321 AddToWorklist(i, CurNode->getOperand(0).getNode(), CurOpNumber); in visitTokenFactor()
2324 if (auto *MemNode = dyn_cast<MemSDNode>(CurNode)) in visitTokenFactor()