Home
last modified time | relevance | path

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

12

/freebsd-13.1/sys/contrib/dev/acpica/components/namespace/
H A Dnsaccess.c186 ACPI_NAMESPACE_NODE *NewNode; in AcpiNsRootInitialize() local
255 if (!NewNode) in AcpiNsRootInitialize()
262 NewNode->DescriptorType = ACPI_DESC_TYPE_NAMED; in AcpiNsRootInitialize()
263 NewNode->Type = InitVal->Type; in AcpiNsRootInitialize()
267 AcpiGbl_RootNodeStruct.Child = NewNode; in AcpiNsRootInitialize()
271 PrevNode->Peer = NewNode; in AcpiNsRootInitialize()
274 NewNode->Parent = &AcpiGbl_RootNodeStruct; in AcpiNsRootInitialize()
275 PrevNode = NewNode; in AcpiNsRootInitialize()
323 NewNode->Value = ObjDesc->Method.ParamCount; in AcpiNsRootInitialize()
348 ObjDesc->Mutex.Node = NewNode; in AcpiNsRootInitialize()
[all …]
H A Dnssearch.c412 ACPI_NAMESPACE_NODE *NewNode; in AcpiNsSearchAndEnter() local
534 NewNode = AcpiNsCreateNode (TargetName); in AcpiNsSearchAndEnter()
535 if (!NewNode) in AcpiNsSearchAndEnter()
547 NewNode->Flags |= ANOBJ_IS_EXTERNAL; in AcpiNsSearchAndEnter()
553 NewNode->Flags |= ANOBJ_TEMPORARY; in AcpiNsSearchAndEnter()
558 AcpiNsInstallNode (WalkState, Node, NewNode, Type); in AcpiNsSearchAndEnter()
559 *ReturnNode = NewNode; in AcpiNsSearchAndEnter()
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/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 …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp79 if (Node.getNodeId() == NewNode) in PerformExpensiveChecks()
95 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks()
108 assert(NewVal.getNode()->getNodeId() != NewNode && in PerformExpensiveChecks()
134 if ((Node.getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
364 N->setNodeId(NewNode); in run()
415 if (NodeId == NewNode) in run()
469 if (Node.getNodeId() == NewNode) in run()
539 N->setNodeId(NewNode); in AnalyzeNewNode()
620 if (E->getNodeId() == DAGTypeLegalizer::NewNode) in NodeDeleted()
631 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleContextTracker.cpp73 ContextTrieNode &NewNode = AllChildContext[Hash]; in moveToChildContext() local
74 NewNode.CallSiteLoc = CallSite; in moveToChildContext()
80 NewNode.setParentContext(this); in moveToChildContext()
81 NodeToUpdate.push(&NewNode); in moveToChildContext()
104 OldParentContext.removeChildContext(OldCallSite, NewNode.getFuncName()); in moveToChildContext()
106 return NewNode; in moveToChildContext()
187 ContextTrieNode *NewNode = getOrCreateContextPath(Context, true); in SampleContextTracker() local
188 assert(!NewNode->getFunctionSamples() && in SampleContextTracker()
190 NewNode->setFunctionSamples(FSamples); in SampleContextTracker()
H A DArgumentPromotion.cpp1145 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF); in runOnSCC() local
1146 NewNode->stealCalledFunctionsFrom(OldNode); in runOnSCC()
1153 SCC.ReplaceNode(OldNode, NewNode); in runOnSCC()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp263 CallGraphNode *NewNode) { in replaceCallEdge() argument
269 I->second = NewNode; in replaceCallEdge()
270 NewNode->AddRef(); in replaceCallEdge()
285 CallGraphNode *NewNode = NewCBs[N]; in replaceCallEdge() local
290 J->second = NewNode; in replaceCallEdge()
292 NewNode->AddRef(); in replaceCallEdge()
H A DDependenceGraphBuilder.cpp55 auto &NewNode = createFineGrainedNode(I); in createFineGrainedNodes() local
56 IMap.insert(std::make_pair(&I, &NewNode)); in createFineGrainedNodes()
57 NodeOrdinalMap.insert(std::make_pair(&NewNode, getOrdinal(I))); in createFineGrainedNodes()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp282 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in SwitchConvert() local
289 NewNode, OrigBlock, Default, UnreachableRanges); in SwitchConvert()
292 NewNode, OrigBlock, Default, UnreachableRanges); in SwitchConvert()
294 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); in SwitchConvert()
295 NewNode->getInstList().push_back(Comp); in SwitchConvert()
297 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in SwitchConvert()
298 return NewNode; in SwitchConvert()
H A DBasicBlockUtils.cpp801 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlockImpl() local
803 DT->changeImmediateDominator(I, NewNode); in SplitBlockImpl()
1396 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThenImpl() local
1398 DT->changeImmediateDominator(Child, NewNode); in SplitBlockAndInsertIfThenImpl()
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/sys/contrib/dev/acpica/components/dispatcher/
H A Ddswload2.c534 ACPI_NAMESPACE_NODE *NewNode; in AcpiDsLoad2EndOp() local
869 WalkState, &(NewNode)); in AcpiDsLoad2EndOp()
877 if (NewNode->Type != ACPI_TYPE_METHOD) in AcpiDsLoad2EndOp()
886 Op->Common.Node = NewNode; in AcpiDsLoad2EndOp()
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelMatcherGen.cpp108 void AddMatcher(Matcher *NewNode);
188 void MatcherGen::AddMatcher(Matcher *NewNode) { in AddMatcher() argument
190 CurPredicate->setNext(NewNode); in AddMatcher()
192 TheMatcher = NewNode; in AddMatcher()
193 CurPredicate = NewNode; in AddMatcher()
/freebsd-13.1/contrib/llvm-project/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;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp3731 MachineSDNode *NewNode; in matchBEXTRFromAndImm() local
3751 NewNode = in matchBEXTRFromAndImm()
3755 return NewNode; in matchBEXTRFromAndImm()
5428 SDValue BEXTR = SDValue(NewNode, 0); in Select()
5535 MachineSDNode *NewNode; in Select() local
5553 CurDAG->setNodeMemRefs(NewNode, in Select()
5563 ReplaceNode(Node, NewNode); in Select()
5803 MachineSDNode *NewNode; in Select() local
5814 ReplaceUses(SDValue(Node, 0), SDValue(NewNode, 0)); in Select()
5815 ReplaceUses(SDValue(Node, 1), SDValue(NewNode, 2)); in Select()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp970 GepNode *C = nullptr, *NewNode = nullptr; in separateChainForNode() local
978 NewNode = NewN; in separateChainForNode()
985 if (!NewNode) in separateChainForNode()
1006 NewNode->Flags |= GepNode::Used; in separateChainForNode()
1007 LLVM_DEBUG(dbgs() << "new node: " << NewNode << " " << *NewNode << '\n'); in separateChainForNode()
1009 Uses[NewNode] = NewUs; in separateChainForNode()
H A DHexagonISelDAGToDAG.cpp2179 SDValue NewNode; in balanceSubTree() local
2193 NewNode = CurDAG->getNode( in balanceSubTree()
2199 NewNode = CurDAG->getNode(NOpcode, SDLoc(N), VT, V0, V1); in balanceSubTree()
2201 NodeHeights[NewNode] = Height; in balanceSubTree()
2204 Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder)); in balanceSubTree()
2208 LLVM_DEBUG(NewNode.dump()); in balanceSubTree()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1999 unsigned NewNode = 0; in overflow() local
2002 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow()
2003 CurSize[Nodes] = CurSize[NewNode]; in overflow()
2004 Node[Nodes] = Node[NewNode]; in overflow()
2005 CurSize[NewNode] = 0; in overflow()
2006 Node[NewNode] = this->map->template newNode<NodeT>(); in overflow()
2025 if (NewNode && Pos == NewNode) { in overflow()
/freebsd-13.1/contrib/llvm-project/llvm/lib/IR/
H A DDebugInfo.cpp747 auto *NewNode = Mapper.mapNode(Node); in stripNonLineTableDebugInfo() local
748 Changed |= Node != NewNode; in stripNonLineTableDebugInfo()
749 Node = NewNode; in stripNonLineTableDebugInfo()
750 return NewNode; in stripNonLineTableDebugInfo()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h279 CallGraphNode *NewNode);
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.cpp1301 SDNode *NewNode = CurDAG->getMachineNode(TargetOpcode::COPY_TO_REGCLASS, in Select() local
1303 ReplaceNode(Node, NewNode); in Select()
1345 SDNode *NewNode = in Select() local
1347 ReplaceNode(Node, NewNode); in Select()

12