HomeSort by: relevance | last modified time | path
    Searched refs:NewNode (Results 1 - 25 of 38) sorted by relevancy

1 2

  /src/sys/external/bsd/acpica/dist/namespace/
nssearch.c 304 ACPI_NAMESPACE_NODE *NewNode;
426 NewNode = AcpiNsCreateNode (TargetName);
427 if (!NewNode)
439 NewNode->Flags |= ANOBJ_IS_EXTERNAL;
445 NewNode->Flags |= ANOBJ_TEMPORARY;
450 AcpiNsInstallNode (WalkState, Node, NewNode, Type);
451 *ReturnNode = NewNode;
nsaccess.c 78 ACPI_NAMESPACE_NODE *NewNode;
148 NewNode = AcpiNsCreateNode (Name);
149 if (!NewNode)
155 NewNode->DescriptorType = ACPI_DESC_TYPE_NAMED;
156 NewNode->Type = InitVal->Type;
160 AcpiGbl_RootNodeStruct.Child = NewNode;
164 PrevNode->Peer = NewNode;
167 NewNode->Parent = &AcpiGbl_RootNodeStruct;
168 PrevNode = NewNode;
216 NewNode->Value = ObjDesc->Method.ParamCount
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Rewrite/
RewriteRope.cpp 309 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf();
311 // Move over the last 'WidthFactor' values from here to NewNode.
313 &NewNode->Pieces[0]);
318 NewNode->NumPieces = NumPieces = WidthFactor;
321 NewNode->FullRecomputeSizeLocally();
325 NewNode->insertAfterLeafInOrder(this);
331 NewNode->insert(Offset - this->size(), R);
332 return NewNode;
548 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior();
550 // Move over the last 'WidthFactor' values from here to NewNode
    [all...]
DeltaTree.cpp 307 DeltaTreeNode *NewNode;
314 NewNode = New;
317 NewNode = new DeltaTreeNode();
320 // Move over the last 'WidthFactor-1' values from here to NewNode.
321 memcpy(&NewNode->Values[0], &Values[WidthFactor],
325 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1;
328 NewNode->RecomputeFullDeltaLocally();
332 InsertRes.RHS = NewNode;
  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_function_call_trie.h 407 auto* NewNode = Nodes.AppendEmplace(
409 if (UNLIKELY(NewNode == nullptr))
411 DCHECK_NE(NewNode, nullptr);
412 TopNode->Callees.AppendEmplace(NewNode, FId);
413 if (ShadowStack.AppendEmplace(TSC, NewNode, CPU) == nullptr)
488 FunctionCallTrie::Node *NewNode;
516 DCHECK_NE(NP.NewNode, nullptr);
519 auto NewNode = O.Nodes.AppendEmplace(
520 NP.NewNode, NodeIdPairArray(*O.NodeIdPairAllocator),
523 if (UNLIKELY(NewNode == nullptr)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CallGraph.cpp 263 CallGraphNode *NewNode) {
269 I->second = NewNode;
270 NewNode->AddRef();
285 CallGraphNode *NewNode = NewCBs[N];
290 J->second = NewNode;
292 NewNode->AddRef();
DependenceGraphBuilder.cpp 55 auto &NewNode = createFineGrainedNode(I);
56 IMap.insert(std::make_pair(&I, &NewNode));
57 NodeOrdinalMap.insert(std::make_pair(&NewNode, getOrdinal(I)));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
LegalizeTypes.cpp 44 // Note that it is possible to have nodes marked NewNode in the DAG. This can
49 // into a different node, leaving the original node as a NewNode in the DAG.
59 // The conclusion is that though there may be nodes marked NewNode in the DAG,
60 // all uses of such nodes are also marked NewNode: the result is a fungus of
65 // by nodes marked NewNode (see above).
67 // The final node obtained by mapping by ReplacedValues is not marked NewNode.
72 // also map nodes marked NewNode if the deallocated memory was reallocated as
78 // Remember nodes marked NewNode - they are subject to extra checking below.
79 if (Node.getNodeId() == NewNode)
91 // Check that remapped values are only used by nodes marked NewNode
    [all...]
ScheduleDAGRRList.cpp 279 SUnit *NewNode = newSUnit(N);
281 if (NewNode->NodeNum >= NumSUnits)
282 Topo.AddSUnitWithoutPredecessors(NewNode);
283 return NewNode;
289 SUnit *NewNode = Clone(N);
291 if (NewNode->NodeNum >= NumSUnits)
292 Topo.AddSUnitWithoutPredecessors(NewNode);
293 return NewNode;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
SampleContextTracker.cpp 73 ContextTrieNode &NewNode = AllChildContext[Hash];
74 NewNode.CallSiteLoc = CallSite;
80 NewNode.setParentContext(this);
81 NodeToUpdate.push(&NewNode);
104 OldParentContext.removeChildContext(OldCallSite, NewNode.getFuncName());
106 return NewNode;
187 ContextTrieNode *NewNode = getOrCreateContextPath(Context, true);
188 assert(!NewNode->getFunctionSamples() &&
190 NewNode->setFunctionSamples(FSamples);
ArgumentPromotion.cpp 1146 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF);
1147 NewNode->stealCalledFunctionsFrom(OldNode);
1154 SCC.ReplaceNode(OldNode, NewNode);
  /src/sys/external/bsd/acpica/dist/dispatcher/
dswload2.c 426 ACPI_NAMESPACE_NODE *NewNode;
761 WalkState, &(NewNode));
769 if (NewNode->Type != ACPI_TYPE_METHOD)
778 Op->Common.Node = NewNode;
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsISelDAGToDAG.cpp 258 SDValue NewNode = CurDAG->getNode(ISD::SUB, DL, VT, X, NegC);
260 ReplaceNode(Node, NewNode.getNode());
261 SelectCode(NewNode.getNode());
  /src/external/apache2/llvm/dist/llvm/lib/XRay/
Profile.cpp 174 auto NewNode = &NodeStorage.back();
175 NewNode->Func = NodeFuncID;
176 NewNode->Caller = Node;
177 Node->Callees.push_back(NewNode);
178 Node = NewNode;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 282 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock");
289 NewNode, OrigBlock, Default, UnreachableRanges);
292 NewNode, OrigBlock, Default, UnreachableRanges);
294 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode);
295 NewNode->getInstList().push_back(Comp);
297 BranchInst::Create(LBranch, RBranch, Comp, NewNode);
298 return NewNode;
BasicBlockUtils.cpp 801 DomTreeNode *NewNode = DT->addNewBlock(New, Old);
803 DT->changeImmediateDominator(I, NewNode);
1396 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head);
1398 DT->changeImmediateDominator(Child, NewNode);
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
DAGISelMatcherGen.cpp 108 void AddMatcher(Matcher *NewNode);
188 void MatcherGen::AddMatcher(Matcher *NewNode) {
190 CurPredicate->setNext(NewNode);
192 TheMatcher = NewNode;
193 CurPredicate = NewNode;
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86ISelDAGToDAG.cpp 3731 MachineSDNode *NewNode;
3738 NewNode = CurDAG->getMachineNode(MOpc, dl, VTs, Ops);
3740 ReplaceUses(Input.getValue(1), SDValue(NewNode, 2));
3742 CurDAG->setNodeMemRefs(NewNode, {cast<LoadSDNode>(Input)->getMemOperand()});
3744 NewNode = CurDAG->getMachineNode(ROpc, dl, NVT, MVT::i32, Input, Control);
3751 NewNode =
3752 CurDAG->getMachineNode(NewOpc, dl, NVT, SDValue(NewNode, 0), ShAmt);
3755 return NewNode;
4827 if (MachineSDNode *NewNode = matchBEXTRFromAndImm(Node)) {
4828 ReplaceUses(SDValue(Node, 0), SDValue(NewNode, 0))
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
GenericDomTree.h 637 DomTreeNodeBase<NodeT> *NewNode = createNode(BB);
644 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
645 OldNode->IDom = NewNode;
649 return RootNode = NewNode;
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp 951 GepNode *C = nullptr, *NewNode = nullptr;
959 NewNode = NewN;
966 if (!NewNode)
969 // Move over all uses that share the same user as U from Node to NewNode.
987 NewNode->Flags |= GepNode::Used;
988 LLVM_DEBUG(dbgs() << "new node: " << NewNode << " " << *NewNode << '\n');
990 Uses[NewNode] = NewUs;
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
IntervalMap.h 1011 template <typename NodeT> NodeT *newNode() {
1189 Leaf *L = newNode<Leaf>();
1230 Branch *B = newNode<Branch>();
1999 unsigned NewNode = 0;
2001 // Insert NewNode at the penultimate position, or after a single node.
2002 NewNode = Nodes == 1 ? 1 : Nodes - 1;
2003 CurSize[Nodes] = CurSize[NewNode];
2004 Node[Nodes] = Node[NewNode];
2005 CurSize[NewNode] = 0;
2006 Node[NewNode] = this->map->template newNode<NodeT>()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 1116 BlockNode NewNode(Freqs.size());
1117 Nodes[BB] = {NewNode, BFICallbackVH(BB, this)};
1119 BlockFrequencyInfoImplBase::setBlockFreq(NewNode, Freq);
CallGraph.h 279 CallGraphNode *NewNode);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
DebugInfo.cpp 713 auto *NewNode = Mapper.mapNode(Node);
714 Changed |= Node != NewNode;
715 Node = NewNode;
716 return NewNode;
  /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/
RISCVISelDAGToDAG.cpp 1086 SDNode *NewNode = CurDAG->getMachineNode(TargetOpcode::COPY_TO_REGCLASS,
1088 ReplaceNode(Node, NewNode);
1130 SDNode *NewNode =
1132 ReplaceNode(Node, NewNode);

Completed in 70 milliseconds

1 2