Home
last modified time | relevance | path

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

12

/freebsd-12.1/sys/contrib/dev/acpica/components/namespace/
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()
H A Dnsaccess.c186 ACPI_NAMESPACE_NODE *NewNode; in AcpiNsRootInitialize() local
232 NULL, &NewNode); in AcpiNsRootInitialize()
287 NewNode->Value = ObjDesc->Method.ParamCount; in AcpiNsRootInitialize()
312 ObjDesc->Mutex.Node = NewNode; in AcpiNsRootInitialize()
353 Status = AcpiNsAttachObject (NewNode, ObjDesc, in AcpiNsRootInitialize()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Rewrite/
H A DRewriteRope.cpp314 &NewNode->Pieces[0]); in insert()
319 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
322 NewNode->FullRecomputeSizeLocally(); in insert()
326 NewNode->insertAfterLeafInOrder(this); in insert()
332 NewNode->insert(Offset - this->size(), R); in insert()
333 return NewNode; in insert()
552 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
556 NewNode->NumChildren = NumChildren = WidthFactor; in HandleChildPiece()
563 NewNode->HandleChildPiece(i-WidthFactor, RHS); in HandleChildPiece()
566 NewNode->FullRecomputeSizeLocally(); in HandleChildPiece()
[all …]
H A DDeltaTree.cpp308 DeltaTreeNode *NewNode; in DoSplit() local
315 NewNode = New; in DoSplit()
318 NewNode = new DeltaTreeNode(); in DoSplit()
322 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
326 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
329 NewNode->RecomputeFullDeltaLocally(); in DoSplit()
333 InsertRes.RHS = NewNode; in DoSplit()
/freebsd-12.1/contrib/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h407 auto* NewNode = Nodes.AppendEmplace( in enterFunction() local
409 if (UNLIKELY(NewNode == nullptr)) in enterFunction()
411 DCHECK_NE(NewNode, nullptr); in enterFunction()
412 TopNode->Callees.AppendEmplace(NewNode, FId); in enterFunction()
413 if (ShadowStack.AppendEmplace(TSC, NewNode, CPU) == nullptr) in enterFunction()
488 FunctionCallTrie::Node *NewNode; in deepCopyInto() member
516 DCHECK_NE(NP.NewNode, nullptr); in deepCopyInto()
519 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto() local
520 NP.NewNode, NodeIdPairArray(*O.NodeIdPairAllocator), in deepCopyInto()
523 if (UNLIKELY(NewNode == nullptr)) in deepCopyInto()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp80 if (Node.getNodeId() == NewNode) in PerformExpensiveChecks()
97 assert(UI->getNodeId() == NewNode && in PerformExpensiveChecks()
110 assert(NewVal.getNode()->getNodeId() != NewNode && in PerformExpensiveChecks()
134 if ((Node.getNodeId() == NewNode && Mapped > 1) || in PerformExpensiveChecks()
354 N->setNodeId(NewNode); in run()
407 if (NodeId == NewNode) in run()
468 if (Node.getNodeId() == NewNode) in run()
538 N->setNodeId(NewNode); in AnalyzeNewNode()
619 if (E->getNodeId() == DAGTypeLegalizer::NewNode) in NodeDeleted()
630 N->setNodeId(DAGTypeLegalizer::NewNode); in NodeUpdated()
[all …]
H A DScheduleDAGRRList.cpp273 SUnit *NewNode = newSUnit(N); in CreateNewSUnit() local
275 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
277 return NewNode; in CreateNewSUnit()
284 SUnit *NewNode = Clone(N); in CreateClone() local
286 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
288 return NewNode; in CreateClone()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp285 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
291 NewUpperBound, Val, NewNode, OrigBlock, in switchConvert()
294 UpperBound, Val, NewNode, OrigBlock, in switchConvert()
297 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode); in switchConvert()
298 NewNode->getInstList().push_back(Comp); in switchConvert()
300 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert()
301 return NewNode; in switchConvert()
H A DBasicBlockUtils.cpp340 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock() local
342 DT->changeImmediateDominator(I, NewNode); in SplitBlock()
744 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen() local
746 DT->changeImmediateDominator(Child, NewNode); in SplitBlockAndInsertIfThen()
H A DCodeExtractor.cpp670 DomTreeNode *NewNode = DT->addNewBlock(New, Block); in splitReturnBlocks() local
673 DT->changeImmediateDominator(I, NewNode); in splitReturnBlocks()
/freebsd-12.1/contrib/llvm/lib/XRay/
H A DProfile.cpp175 auto NewNode = &NodeStorage.back(); in internPath() local
176 NewNode->Func = NodeFuncID; in internPath()
177 NewNode->Caller = Node; in internPath()
178 Node->Callees.push_back(NewNode); in internPath()
179 Node = NewNode; in internPath()
/freebsd-12.1/sys/contrib/dev/acpica/components/dispatcher/
H A Ddswload2.c531 ACPI_NAMESPACE_NODE *NewNode; in AcpiDsLoad2EndOp() local
832 WalkState, &(NewNode)); in AcpiDsLoad2EndOp()
840 if (NewNode->Type != ACPI_TYPE_METHOD) in AcpiDsLoad2EndOp()
849 Op->Common.Node = NewNode; in AcpiDsLoad2EndOp()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DCallGraph.cpp232 CallSite NewCS, CallGraphNode *NewNode){ in replaceCallEdge() argument
238 I->second = NewNode; in replaceCallEdge()
239 NewNode->AddRef(); in replaceCallEdge()
/freebsd-12.1/contrib/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()
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGenericDomTree.h588 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =
596 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
597 OldNode->IDom = NewNode;
601 return RootNode = NewNode;
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp960 GepNode *C = nullptr, *NewNode = nullptr; in separateChainForNode() local
968 NewNode = NewN; in separateChainForNode()
975 if (!NewNode) in separateChainForNode()
998 NewNode->Flags |= GepNode::Used; in separateChainForNode()
999 LLVM_DEBUG(dbgs() << "new node: " << NewNode << " " << *NewNode << '\n'); in separateChainForNode()
1001 Uses[NewNode] = NewUs; in separateChainForNode()
H A DHexagonISelDAGToDAG.cpp2158 SDValue NewNode; in balanceSubTree() local
2172 NewNode = CurDAG->getNode( in balanceSubTree()
2178 NewNode = CurDAG->getNode(NOpcode, SDLoc(N), VT, V0, V1); in balanceSubTree()
2180 NodeHeights[NewNode] = Height; in balanceSubTree()
2183 Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder)); in balanceSubTree()
2187 LLVM_DEBUG(NewNode.dump()); in balanceSubTree()
/freebsd-12.1/contrib/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp3104 MachineSDNode *NewNode; in matchBEXTRFromAndImm() local
3110 NewNode = CurDAG->getMachineNode(MOpc, dl, VTs, Ops); in matchBEXTRFromAndImm()
3112 ReplaceUses(Input.getValue(1), SDValue(NewNode, 1)); in matchBEXTRFromAndImm()
3119 return NewNode; in matchBEXTRFromAndImm()
3415 ReplaceUses(SDValue(Node, 0), SDValue(NewNode, 0)); in Select()
3875 SDValue BEXTR = SDValue(NewNode, 0); in Select()
3877 ReplaceUses(SDValue(Node, 0), SDValue(NewNode, 0)); in Select()
3981 MachineSDNode *NewNode; in Select() local
3988 ReplaceUses(Reg.getValue(1), SDValue(NewNode, 1)); in Select()
3990 CurDAG->setNodeMemRefs(NewNode, in Select()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h1994 unsigned NewNode = 0; in overflow() local
1997 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow()
1998 CurSize[Nodes] = CurSize[NewNode]; in overflow()
1999 Node[Nodes] = Node[NewNode]; in overflow()
2000 CurSize[NewNode] = 0; in overflow()
2001 Node[NewNode] = this->map->template newNode<NodeT>(); in overflow()
2020 if (NewNode && Pos == NewNode) { in overflow()
/freebsd-12.1/contrib/llvm/lib/Transforms/IPO/
H A DArgumentPromotion.cpp1114 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF); in runOnSCC() local
1115 NewNode->stealCalledFunctionsFrom(OldNode); in runOnSCC()
1122 SCC.ReplaceNode(OldNode, NewNode); in runOnSCC()
/freebsd-12.1/contrib/llvm/lib/IR/
H A DDebugInfo.cpp623 auto *NewNode = Mapper.mapNode(Node); in stripNonLineTableDebugInfo() local
624 Changed |= Node != NewNode; in stripNonLineTableDebugInfo()
625 Node = NewNode; in stripNonLineTableDebugInfo()
626 return NewNode; in stripNonLineTableDebugInfo()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h1055 BlockNode NewNode(Freqs.size());
1056 Nodes[BB] = NewNode;
1058 BlockFrequencyInfoImplBase::setBlockFreq(NewNode, Freq);
H A DCallGraph.h267 void replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode);
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DBugReporter.cpp2345 if (const ExplodedNode *NewNode = ForwardMap.lookup(Nodes[i])) { in TrimmedGraph() local
2346 ReportNodes.push_back(std::make_pair(NewNode, i)); in TrimmedGraph()
2347 RemainingNodes.insert(NewNode); in TrimmedGraph()
H A DExprEngine.cpp1837 ExplodedNode *NewNode = G.getNode(NewNodeLoc, NewNodeState, false, &IsNew); in replayWithoutInlining() local
1843 NewNode->addPredecessor(BeforeProcessingCall, G); in replayWithoutInlining()
1846 Engine.enqueueStmtNode(NewNode, CalleeSF->getCallSiteBlock(), in replayWithoutInlining()

12