Searched refs:CurNode (Results 1 – 10 of 10) sorted by relevance
680 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()
229 PointerRec *CurNode; variable238 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function241 return CurNode == x.CurNode;246 assert(CurNode && "Dereferencing AliasSet.end()!");247 return *CurNode;251 Value *getPointer() const { return CurNode->getValue(); } in getPointer()252 LocationSize getSize() const { return CurNode->getSize(); } in getSize()253 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()256 assert(CurNode && "Advancing past AliasSet.end()!");257 CurNode = CurNode->getNext();
173 for (const SelectionTree::Node *CurNode = getExprNode(); in computeInsertionPoint() local174 CurNode->Parent && CanExtractOutside(CurNode); in computeInsertionPoint()175 CurNode = CurNode->Parent) { in computeInsertionPoint()176 const clang::Stmt *CurInsertionPoint = CurNode->ASTNode.get<Stmt>(); in computeInsertionPoint()180 if (const clang::Stmt *CurParent = CurNode->Parent->ASTNode.get<Stmt>()) { in computeInsertionPoint()
243 for (const Node *CurNode = CommonAnc; CurNode; CurNode = CurNode->Parent) { in findEnclosingFunction() local245 if (CurNode->ASTNode.get<LambdaExpr>()) in findEnclosingFunction()247 if (const FunctionDecl *Func = CurNode->ASTNode.get<FunctionDecl>()) { in findEnclosingFunction()
73 ContextTrieNode *CurNode = &RootContext; in addInstructionForContext() local78 CurNode = CurNode->getOrCreateChildContext(CallsiteLoc, CallerName); in addInstructionForContext()82 CurNode->addFunctionSize(InstrSize); in addInstructionForContext()
88 const void /*RopePieceBTreeLeaf*/ *CurNode = nullptr; variable
7994 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local7996 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()8000 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()8006 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()8044 const auto &CurNode = Stack.back(); in AST_MATCHER_P() local8046 if (const auto *FuncDeclNode = CurNode.get<FunctionDecl>()) { in AST_MATCHER_P()8050 } else if (const auto *LambdaExprNode = CurNode.get<LambdaExpr>()) { in AST_MATCHER_P()8055 } else if (const auto *ObjCMethodDeclNode = CurNode.get<ObjCMethodDecl>()) { in AST_MATCHER_P()8059 } else if (const auto *BlockDeclNode = CurNode.get<BlockDecl>()) { in AST_MATCHER_P()8064 llvm::append_range(Stack, Finder->getASTContext().getParents(CurNode)); in AST_MATCHER_P()
1292 if (DeclListNode *CurNode = Ptr.dyn_cast<DeclListNode*>())1293 return CurNode->D;1302 if (DeclListNode *CurNode = Ptr.dyn_cast<DeclListNode*>())1303 Ptr = CurNode->Rest;
860 DefPath &CurNode = *Iter; in tryOptimizePhi() local861 assert(CurNode.Last == Current); in tryOptimizePhi()888 TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)}; in tryOptimizePhi()
2035 auto CurNode = Worklist[i].first; in visitTokenFactor() local2039 switch (CurNode->getOpcode()) { in visitTokenFactor()2048 for (const SDValue &Op : CurNode->op_values()) in visitTokenFactor()2055 AddToWorklist(i, CurNode->getOperand(0).getNode(), CurOpNumber); in visitTokenFactor()2058 if (auto *MemNode = dyn_cast<MemSDNode>(CurNode)) in visitTokenFactor()