Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DAliasSetTracker.h224 PointerRec *CurNode; variable
233 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function
236 return CurNode == x.CurNode;
241 assert(CurNode && "Dereferencing AliasSet.end()!");
242 return *CurNode;
246 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
247 LocationSize getSize() const { return CurNode->getSize(); } in getSize()
248 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()
251 assert(CurNode && "Advancing past AliasSet.end()!");
252 CurNode = CurNode->getNext();
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/clang/include/clang/Rewrite/Core/
H A DRewriteRope.h88 const void /*RopePieceBTreeLeaf*/ *CurNode = nullptr; variable
/openbsd-src/gnu/llvm/llvm/tools/llvm-profgen/
H A DProfiledBinary.cpp77 ContextTrieNode *CurNode = &RootContext; in addInstructionForContext() local
82 CurNode = CurNode->getOrCreateChildContext(CallsiteLoc, CallerName); in addInstructionForContext()
86 CurNode->addFunctionSize(InstrSize); in addInstructionForContext()
/openbsd-src/gnu/llvm/clang/include/clang/ASTMatchers/
H A DASTMatchers.h8015 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
8017 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
8021 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
8027 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
8065 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local
8067 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()
8071 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()
8076 } else if (const auto *ObjCMethodDeclNode = CurNode.get<ObjCMethodDecl>()) { in AST_MATCHER_P()
8080 } else if (const auto *BlockDeclNode = CurNode.get<BlockDecl>()) { in AST_MATCHER_P()
8085 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
/openbsd-src/gnu/llvm/clang/include/clang/AST/
H A DDeclBase.h1303 if (DeclListNode *CurNode = Ptr.dyn_cast<DeclListNode*>())
1304 return CurNode->D;
1313 if (DeclListNode *CurNode = Ptr.dyn_cast<DeclListNode*>())
1314 Ptr = CurNode->Rest;
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DMemorySSA.cpp821 DefPath &CurNode = *Iter; in tryOptimizePhi() local
822 assert(CurNode.Last == Current); in tryOptimizePhi()
849 TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)}; in tryOptimizePhi()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGISel.cpp1020 SDNode *CurNode = &*ISelPosition; in NodeInserted() local
1021 if (MDNode *MD = DAG.getPCSections(CurNode)) in NodeInserted()
H A DDAGCombiner.cpp2051 auto CurNode = Worklist[i].first; in visitTokenFactor() local
2055 switch (CurNode->getOpcode()) { in visitTokenFactor()
2064 for (const SDValue &Op : CurNode->op_values()) in visitTokenFactor()
2071 AddToWorklist(i, CurNode->getOperand(0).getNode(), CurOpNumber); in visitTokenFactor()
2074 if (auto *MemNode = dyn_cast<MemSDNode>(CurNode)) in visitTokenFactor()