Home
last modified time | relevance | path

Searched refs:NewNode (Results 1 – 25 of 40) sorted by relevance

12

/llvm-project-15.0.7/clang/lib/Rewrite/
H A DRewriteRope.cpp313 &NewNode->Pieces[0]); in insert()
318 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
321 NewNode->FullRecomputeSizeLocally(); in insert()
325 NewNode->insertAfterLeafInOrder(this); in insert()
331 NewNode->insert(Offset - this->size(), R); in insert()
332 return NewNode; in insert()
551 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
555 NewNode->NumChildren = NumChildren = WidthFactor; in HandleChildPiece()
562 NewNode->HandleChildPiece(i-WidthFactor, RHS); in HandleChildPiece()
565 NewNode->FullRecomputeSizeLocally(); in HandleChildPiece()
[all …]
H A DDeltaTree.cpp307 DeltaTreeNode *NewNode; in DoSplit() local
314 NewNode = New; in DoSplit()
317 NewNode = new DeltaTreeNode(); in DoSplit()
321 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
325 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
328 NewNode->RecomputeFullDeltaLocally(); in DoSplit()
332 InsertRes.RHS = NewNode; in DoSplit()
/llvm-project-15.0.7/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h406 auto* NewNode = Nodes.AppendEmplace( in enterFunction() local
408 if (UNLIKELY(NewNode == nullptr)) in enterFunction()
410 DCHECK_NE(NewNode, nullptr); in enterFunction()
411 TopNode->Callees.AppendEmplace(NewNode, FId); in enterFunction()
412 if (ShadowStack.AppendEmplace(TSC, NewNode, CPU) == nullptr) in enterFunction()
487 FunctionCallTrie::Node *NewNode; in deepCopyInto() member
515 DCHECK_NE(NP.NewNode, nullptr); in deepCopyInto()
518 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto() local
519 NP.NewNode, NodeIdPairArray(*O.NodeIdPairAllocator), in deepCopyInto()
522 if (UNLIKELY(NewNode == nullptr)) in deepCopyInto()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/CSKY/
H A DCSKYISelDAGToDAG.cpp293 MachineSDNode *NewNode = nullptr; in selectAddCarry() local
305 NewNode = CurDAG->getMachineNode( in selectAddCarry()
311 NewNode = CurDAG->getMachineNode( in selectAddCarry()
315 NewNode = CurDAG->getMachineNode(Subtarget->has2E3() ? CSKY::ADDC32 in selectAddCarry()
319 ReplaceNode(N, NewNode); in selectAddCarry()
336 MachineSDNode *NewNode = nullptr; in selectSubCarry() local
348 NewNode = CurDAG->getMachineNode( in selectSubCarry()
354 NewNode = CurDAG->getMachineNode( in selectSubCarry()
359 NewNode = CurDAG->getMachineNode(Subtarget->has2E3() ? CSKY::SUBC32 in selectSubCarry()
363 auto CarryOut = InvertCarryFlag(Subtarget, CurDAG, Dl, SDValue(NewNode, 1)); in selectSubCarry()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp76 if (Node.getNodeId() == NewNode) in PerformExpensiveChecks()
94 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks()
134 if ((Node.getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
135 (Node.getNodeId() != NewNode && Mapped != 0)) { in PerformExpensiveChecks()
371 N->setNodeId(NewNode); in run()
422 if (NodeId == NewNode) in run()
476 if (Node.getNodeId() == NewNode) in run()
547 N->setNodeId(NewNode); in AnalyzeNewNode()
628 if (E->getNodeId() == DAGTypeLegalizer::NewNode) in NodeDeleted()
639 N->setNodeId(DAGTypeLegalizer::NewNode); in NodeUpdated()
[all …]
H A DScheduleDAGRRList.cpp279 SUnit *NewNode = newSUnit(N); in CreateNewSUnit() local
281 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
282 Topo.AddSUnitWithoutPredecessors(NewNode); in CreateNewSUnit()
283 return NewNode; in CreateNewSUnit()
289 SUnit *NewNode = Clone(N); in CreateClone() local
291 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
292 Topo.AddSUnitWithoutPredecessors(NewNode); in CreateClone()
293 return NewNode; in CreateClone()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCallGraph.cpp261 CallGraphNode *NewNode) { in replaceCallEdge() argument
267 I->second = NewNode; in replaceCallEdge()
268 NewNode->AddRef(); in replaceCallEdge()
283 CallGraphNode *NewNode = NewCBs[N]; in replaceCallEdge() local
288 J->second = NewNode; in replaceCallEdge()
290 NewNode->AddRef(); in replaceCallEdge()
H A DDependenceGraphBuilder.cpp56 auto &NewNode = createFineGrainedNode(I); in createFineGrainedNodes() local
57 IMap.insert(std::make_pair(&I, &NewNode)); in createFineGrainedNodes()
58 NodeOrdinalMap.insert(std::make_pair(&NewNode, getOrdinal(I))); in createFineGrainedNodes()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DSampleContextTracker.cpp76 ContextTrieNode &NewNode = AllChildContext[Hash]; in moveContextSamples() local
77 NewNode.setCallSiteLoc(CallSite); in moveContextSamples()
83 NewNode.setParentContext(&ToNodeParent); in moveContextSamples()
84 NodeToUpdate.push(&NewNode); in moveContextSamples()
103 return NewNode; in moveContextSamples()
205 ContextTrieNode *NewNode = getOrCreateContextPath(Context, true); in SampleContextTracker() local
206 assert(!NewNode->getFunctionSamples() && in SampleContextTracker()
208 NewNode->setFunctionSamples(FSamples); in SampleContextTracker()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp291 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in SwitchConvert() local
298 NewNode, OrigBlock, Default, UnreachableRanges); in SwitchConvert()
301 NewNode, OrigBlock, Default, UnreachableRanges); in SwitchConvert()
303 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); in SwitchConvert()
304 NewNode->getInstList().push_back(Comp); in SwitchConvert()
306 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in SwitchConvert()
307 return NewNode; in SwitchConvert()
H A DBasicBlockUtils.cpp824 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlockImpl() local
826 DT->changeImmediateDominator(I, NewNode); in SplitBlockImpl()
1422 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThenImpl() local
1424 DT->changeImmediateDominator(Child, NewNode); in SplitBlockAndInsertIfThenImpl()
/llvm-project-15.0.7/polly/lib/Transform/
H A DScheduleTreeTransform.cpp253 NewNode = NewNode.sequence(NewChildNode); in visitSequence()
256 return NewNode; in visitSequence()
263 isl::schedule NewNode = visit(Set.first_child(), Domain, Extensions); in visitSet() local
268 NewNode = isl::manage( in visitSet()
269 isl_schedule_set(NewNode.release(), NewChildNode.release())); in visitSet()
272 return NewNode; in visitSet()
314 isl::schedule_node NewNode = in visitBand() local
320 NewNode = isl::manage(isl_schedule_node_band_set_permutable( in visitBand()
321 NewNode.release(), in visitBand()
324 NewNode = applyBandMemberAttributes(NewNode.as<isl::schedule_node_band>(), in visitBand()
[all …]
H A DMatmulOptimizer.cpp697 auto NewNode = isl::schedule_node::from_extension(Extension); in createExtensionNode() local
698 return Node.graft_before(NewNode); in createExtensionNode()
/llvm-project-15.0.7/llvm/lib/XRay/
H A DProfile.cpp174 auto NewNode = &NodeStorage.back(); in internPath() local
175 NewNode->Func = NodeFuncID; in internPath()
176 NewNode->Caller = Node; in internPath()
177 Node->Callees.push_back(NewNode); in internPath()
178 Node = NewNode; in internPath()
/llvm-project-15.0.7/llvm/lib/Target/Mips/
H A DMipsISelDAGToDAG.cpp258 SDValue NewNode = CurDAG->getNode(ISD::SUB, DL, VT, X, NegC); in selectVecAddAsVecSubIfProfitable() local
260 ReplaceNode(Node, NewNode.getNode()); in selectVecAddAsVecSubIfProfitable()
261 SelectCode(NewNode.getNode()); in selectVecAddAsVecSubIfProfitable()
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DDAGISelMatcherGen.cpp109 void AddMatcher(Matcher *NewNode);
189 void MatcherGen::AddMatcher(Matcher *NewNode) { in AddMatcher() argument
191 CurPredicate->setNext(NewNode); in AddMatcher()
193 TheMatcher = NewNode; in AddMatcher()
194 CurPredicate = NewNode; in AddMatcher()
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp950 GepNode *C = nullptr, *NewNode = nullptr; in separateChainForNode() local
958 NewNode = NewN; in separateChainForNode()
965 if (!NewNode) in separateChainForNode()
986 NewNode->Flags |= GepNode::Used; in separateChainForNode()
987 LLVM_DEBUG(dbgs() << "new node: " << NewNode << " " << *NewNode << '\n'); in separateChainForNode()
989 Uses[NewNode] = NewUs; in separateChainForNode()
H A DHexagonISelDAGToDAG.cpp2183 SDValue NewNode; in balanceSubTree() local
2197 NewNode = CurDAG->getNode( in balanceSubTree()
2203 NewNode = CurDAG->getNode(NOpcode, SDLoc(N), VT, V0, V1); in balanceSubTree()
2205 NodeHeights[NewNode] = Height; in balanceSubTree()
2208 Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder)); in balanceSubTree()
2212 LLVM_DEBUG(NewNode.dump()); in balanceSubTree()
/llvm-project-15.0.7/llvm/lib/ProfileData/
H A DSampleProf.cpp483 auto *NewNode = getOrCreateContextPath(FSamples->getContext()); in CSProfileConverter() local
484 assert(!NewNode->FuncSamples && "New node cannot have sample profile"); in CSProfileConverter()
485 NewNode->FuncSamples = FSamples; in CSProfileConverter()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h637 DomTreeNodeBase<NodeT> *NewNode = createNode(BB);
644 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
645 OldNode->IDom = NewNode;
649 return RootNode = NewNode;
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp3875 MachineSDNode *NewNode; in matchBEXTRFromAndImm() local
3895 NewNode = in matchBEXTRFromAndImm()
3899 return NewNode; in matchBEXTRFromAndImm()
5590 SDValue BEXTR = SDValue(NewNode, 0); in Select()
5743 MachineSDNode *NewNode; in Select() local
5761 CurDAG->setNodeMemRefs(NewNode, in Select()
5771 ReplaceNode(Node, NewNode); in Select()
5991 MachineSDNode *NewNode; in Select() local
6002 ReplaceUses(SDValue(Node, 0), SDValue(NewNode, 0)); in Select()
6003 ReplaceUses(SDValue(Node, 1), SDValue(NewNode, 2)); in Select()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DIntervalMap.h2006 unsigned NewNode = 0; in overflow() local
2009 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow()
2010 CurSize[Nodes] = CurSize[NewNode]; in overflow()
2011 Node[Nodes] = Node[NewNode]; in overflow()
2012 CurSize[NewNode] = 0; in overflow()
2013 Node[NewNode] = this->map->template newNode<NodeT>(); in overflow()
2032 if (NewNode && Pos == NewNode) { in overflow()
/llvm-project-15.0.7/llvm/lib/IR/
H A DDebugInfo.cpp745 auto *NewNode = Mapper.mapNode(Node); in stripNonLineTableDebugInfo() local
746 Changed |= Node != NewNode; in stripNonLineTableDebugInfo()
747 Node = NewNode; in stripNonLineTableDebugInfo()
748 return NewNode; in stripNonLineTableDebugInfo()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DCallGraph.h278 CallGraphNode *NewNode);
H A DBlockFrequencyInfoImpl.h1159 BlockNode NewNode(Freqs.size());
1160 Nodes[BB] = {NewNode, BFICallbackVH(BB, this)};
1162 BlockFrequencyInfoImplBase::setBlockFreq(NewNode, Freq);

12