Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/Support/
H A 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()
692 &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces() - 1)) { in MoveToNextPiece()
700 CurNode = getCN(CurNode)->getNextLeafInOrder(); in MoveToNextPiece()
701 while (CurNode && getCN(CurNode)->getNumPieces() == 0); in MoveToNextPiece()
703 if (CurNode) in MoveToNextPiece()
704 CurPiece = &getCN(CurNode)->getPiece(0); in MoveToNextPiece()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp1696 ContextNode *CurNode = getNodeForStackId(Id); in assignStackNodesPostOrder() local
1699 assert(CurNode); in assignStackNodesPostOrder()
1700 assert(!CurNode->Recursive); in assignStackNodesPostOrder()
1702 auto *Edge = CurNode->findEdgeFromCaller(PrevNode); in assignStackNodesPostOrder()
1707 PrevNode = CurNode; in assignStackNodesPostOrder()
1745 ContextNode *CurNode = getNodeForStackId(Id); in assignStackNodesPostOrder() local
1747 assert(CurNode); in assignStackNodesPostOrder()
1752 auto *PrevEdge = CurNode->findEdgeFromCallee(PrevNode); in assignStackNodesPostOrder()
1756 PrevNode = CurNode; in assignStackNodesPostOrder()
1766 CurNode->AllocTypes = CurNode->CalleeEdges.empty() in assignStackNodesPostOrder()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DRewriteRope.h89 const void /*RopePieceBTreeLeaf*/ *CurNode = nullptr; variable
/freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchers.h8392 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
8394 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
8398 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
8404 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
8442 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
8444 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
8450 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
8457 } else if (const auto *ObjCMethodDeclNode = CurNode.get<ObjCMethodDecl>()) { in AST_MATCHER_P()
8463 } else if (const auto *BlockDeclNode = CurNode.get<BlockDecl>()) { in AST_MATCHER_P()
8470 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DDeclBase.h1348 if (DeclListNode *CurNode = dyn_cast<DeclListNode *>(Ptr))
1349 return CurNode->D;
1358 if (DeclListNode *CurNode = dyn_cast<DeclListNode *>(Ptr))
1359 Ptr = CurNode->Rest;
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DMemorySSA.cpp818 DefPath &CurNode = *Iter; in tryOptimizePhi() local
819 assert(CurNode.Last == Current); in tryOptimizePhi()
846 TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)}; in tryOptimizePhi()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGISel.cpp1184 SDNode *CurNode = &*ISelPosition; in NodeInserted() local
1185 if (MDNode *MD = DAG.getPCSections(CurNode)) in NodeInserted()
1187 if (MDNode *MMRA = DAG.getMMRAMetadata(CurNode)) in NodeInserted()
H A DDAGCombiner.cpp2299 auto CurNode = Worklist[i].first; in visitTokenFactor() local
2303 switch (CurNode->getOpcode()) { in visitTokenFactor()
2312 for (const SDValue &Op : CurNode->op_values()) in visitTokenFactor()
2319 AddToWorklist(i, CurNode->getOperand(0).getNode(), CurOpNumber); in visitTokenFactor()
2322 if (auto *MemNode = dyn_cast<MemSDNode>(CurNode)) in visitTokenFactor()