| /frameworks/compile/mclinker/unittests/ |
| GCFactoryListTraitsTest.cpp | 93 Node* NewNode = m_NodeFactory.produce(11);
94 m_pNodeList.push_back(NewNode);
|
| /external/v8/src/compiler/ |
| graph.cc | 46 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs,
|
| graph.h | 62 Node* NewNode(const Operator* op, int input_count, Node* const* inputs,
66 Node* NewNode(const Operator* op) {
67 return NewNode(op, 0, static_cast<Node* const*>(nullptr));
69 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
70 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
72 return NewNode(op, arraysize(nodes), nodes);
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
76 return NewNode(op, arraysize(nodes), nodes);
78 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4)
[all...] |
| bytecode-graph-builder.h | 63 Node* NewNode(const Operator* op, bool incomplete = false) {
67 Node* NewNode(const Operator* op, Node* n1) {
72 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
77 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
88 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
89 Node* NewIfFalse() { return NewNode(common()->IfFalse()); }
90 Node* NewMerge() { return NewNode(common()->Merge(1), true); }
91 Node* NewLoop() { return NewNode(common()->Loop(1), true); }
93 return NewNode(common()->Branch(hint), condition)
[all...] |
| ast-graph-builder.h | 48 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
49 Node* NewIfFalse() { return NewNode(common()->IfFalse()); }
50 Node* NewMerge() { return NewNode(common()->Merge(1), true); }
51 Node* NewLoop() { return NewNode(common()->Loop(1), true); }
53 return NewNode(common()->Branch(hint), condition);
167 Node* NewNode(const Operator* op, bool incomplete = false) {
171 Node* NewNode(const Operator* op, Node* n1) {
175 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
180 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
185 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4)
[all...] |
| /device/linaro/bootloader/edk2/ArmVirtPkg/FdtClientDxe/ |
| FdtClientDxe.c | 275 INT32 NewNode;
280 NewNode = fdt_path_offset (mDeviceTreeBase, "/chosen");
281 if (NewNode < 0) {
282 NewNode = fdt_add_subnode (mDeviceTreeBase, 0, "/chosen");
285 if (NewNode < 0) {
289 *Node = NewNode;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.h | 46 /// NewNode - This is a new node, not before seen, that was created in the
48 NewNode = -1,
[all...] |
| /device/linaro/bootloader/edk2/ArmPkg/Library/DebugUncachedMemoryAllocationLib/ |
| DebugUncachedMemoryAllocationLib.c | 77 FREE_PAGE_NODE *NewNode;
79 NewNode = AllocatePool (sizeof (LIST_ENTRY));
80 if (NewNode == NULL) {
85 NewNode->Buffer = Buffer;
86 NewNode->Allocation = Allocation;
87 NewNode->Pages = Pages;
89 InsertTailList (&mPageList, &NewNode->Link);
|
| /device/linaro/bootloader/edk2/ArmPkg/Library/UncachedMemoryAllocationLib/ |
| UncachedMemoryAllocationLib.c | 89 FREE_PAGE_NODE *NewNode;
101 NewNode = NULL;
117 if (NewNode == NULL) {
119 NewNode = Node;
120 } else if (NewNode->Pages > Node->Pages) {
122 NewNode = Node;
129 if (NewNode != NULL) {
130 NewNode->Allocated = TRUE;
131 NewNode->Allocation = (VOID*)(UINTN)NewNode->Base;
[all...] |
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Bus/Pci/IdeBusDxe/ |
| IdeBus.c | 309 EFI_DEV_PATH NewNode;
671 ZeroMem (&NewNode, sizeof (NewNode));
672 NewNode.DevPath.Type = MESSAGING_DEVICE_PATH;
673 NewNode.DevPath.SubType = MSG_ATAPI_DP;
674 SetDevicePathNodeLength (&NewNode.DevPath, sizeof (ATAPI_DEVICE_PATH));
676 NewNode.Atapi.PrimarySecondary = (UINT8) IdeBlkIoDevicePtr->Channel;
677 NewNode.Atapi.SlaveMaster = (UINT8) IdeBlkIoDevicePtr->Device;
678 NewNode.Atapi.Lun = IdeBlkIoDevicePtr->Lun;
681 &NewNode.DevPath
[all...] |
| /external/clang/lib/Rewrite/ |
| DeltaTree.cpp | 302 DeltaTreeNode *NewNode;
309 NewNode = New;
312 NewNode = new DeltaTreeNode();
315 // Move over the last 'WidthFactor-1' values from here to NewNode.
316 memcpy(&NewNode->Values[0], &Values[WidthFactor],
320 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1;
323 NewNode->RecomputeFullDeltaLocally();
327 InsertRes.RHS = NewNode;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.h | 44 NewNode = -1,
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 308 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
311 DT->changeImmediateDominator(*I, NewNode);
|
| LowerSwitch.cpp | 158 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock");
160 F->getBasicBlockList().insert(++FI, NewNode);
164 NewNode->getInstList().push_back(Comp);
165 BranchInst::Create(LBranch, RBranch, Comp, NewNode);
166 return NewNode;
|
| CodeExtractor.cpp | 197 DomTreeNode *NewNode = DT->addNewBlock(New, *I);
201 DT->changeImmediateDominator(*I, NewNode);
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| graphcycles.cc | 107 int32 GraphCycles::NewNode() {
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 269 DomTreeNode *NewNode = DT->addNewBlock(New, Old);
271 DT->changeImmediateDominator(I, NewNode);
639 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head);
641 DT->changeImmediateDominator(Child, NewNode);
|
| CodeExtractor.cpp | 272 DomTreeNode *NewNode = DT->addNewBlock(New, Block);
275 DT->changeImmediateDominator(I, NewNode);
|
| LowerSwitch.cpp | 272 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock");
278 NewUpperBound, Val, NewNode, OrigBlock,
281 UpperBound, Val, NewNode, OrigBlock,
284 F->getBasicBlockList().insert(++OrigBlock->getIterator(), NewNode);
285 NewNode->getInstList().push_back(Comp);
287 BranchInst::Create(LBranch, RBranch, Comp, NewNode);
288 return NewNode;
|
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellCommandLib/ |
| UefiShellCommandLib.c | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| RegionInfoImpl.h | 352 RegionNodeT *NewNode = new RegionNodeT(static_cast<RegionT *>(Deconst), BB);
353 BBNodeMap.insert(std::make_pair(BB, NewNode));
354 return NewNode;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 612 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =
620 NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
623 return RootNode = NewNode;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/ |
| GenericDomTree.h | 605 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =
613 NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
616 return RootNode = NewNode;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/ |
| GenericDomTree.h | 605 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =
613 NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
616 return RootNode = NewNode;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTree.h | 604 DomTreeNodeBase<NodeT> *NewNode = (DomTreeNodes[BB] =
612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
613 OldNode->IDom = NewNode;
617 return RootNode = NewNode;
|
