/device/linaro/bootloader/edk2/ArmPkg/Library/DebugUncachedMemoryAllocationLib/ |
DebugUncachedMemoryAllocationLib.c | 101 FREE_PAGE_NODE *OldNode;
107 OldNode = BASE_CR (Link, FREE_PAGE_NODE, Link);
108 if (OldNode->Buffer == Buffer) {
109 *Allocation = OldNode->Allocation;
110 *Pages = OldNode->Pages;
112 RemoveEntryList (&OldNode->Link);
113 FreePool (OldNode);
|
/device/linaro/bootloader/edk2/ArmPkg/Library/UncachedMemoryAllocationLib/ |
UncachedMemoryAllocationLib.c | 252 FREE_PAGE_NODE *OldNode;
262 OldNode = BASE_CR (Link, FREE_PAGE_NODE, Link);
267 if (OldNode->Allocated == FALSE) {
268 gBS->FreePages ((EFI_PHYSICAL_ADDRESS)(UINTN)OldNode->Base, OldNode->Pages);
269 RemoveEntryList (&OldNode->Link);
270 FreePool (OldNode);
|
/external/swiftshader/third_party/subzero/src/ |
IceInst.cpp | 344 bool InstBr::repointEdges(CfgNode *OldNode, CfgNode *NewNode) { 346 if (TargetFalse == OldNode) { 350 if (TargetTrue == OldNode) { 544 bool InstSwitch::repointEdges(CfgNode *OldNode, CfgNode *NewNode) { 546 if (LabelDefault == OldNode) { 551 if (Labels[I] == OldNode) { 617 bool InstJumpTable::repointEdges(CfgNode *OldNode, CfgNode *NewNode) { 620 if (Targets[I] == OldNode) { [all...] |
IceInst.h | 132 /// If the instruction is a branch-type instruction with OldNode as a target, 134 /// instances of OldNode as a target. 135 virtual bool repointEdges(CfgNode *OldNode, CfgNode *NewNode) { 136 (void)OldNode; 397 bool repointEdges(CfgNode *OldNode, CfgNode *NewNode) override; 792 bool repointEdges(CfgNode *OldNode, CfgNode *NewNode) override; [all...] |
/external/llvm/lib/Transforms/Utils/ |
BasicBlockUtils.cpp | 266 if (DomTreeNode *OldNode = DT->getNode(Old)) { 267 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); 636 if (DomTreeNode *OldNode = DT->getNode(Head)) { 637 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end());
|
CodeExtractor.cpp | 268 DomTreeNode *OldNode = DT->getNode(Block); 269 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), 270 OldNode->end());
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
BasicBlockUtils.cpp | 302 if (DomTreeNode *OldNode = DT->getNode(Old)) { 304 for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end();
|
CodeExtractor.cpp | 191 DomTreeNode *OldNode = DT->getNode(*I); 193 for (DomTreeNode::iterator DI = OldNode->begin(), DE = OldNode->end();
|
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
GenericDomTree.h | 611 auto &OldNode = DomTreeNodes[OldRoot]; 612 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot])); 613 OldNode->IDom = NewNode; 614 OldNode->UpdateLevel();
|
/external/llvm/include/llvm/ADT/ |
ImmutableSet.h | 580 TreeTy* OldNode; 581 TreeTy* newRight = removeMinBinding(R,OldNode); 582 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/external/llvm/lib/Transforms/IPO/ |
ArgumentPromotion.cpp | 128 for (CallGraphNode *OldNode : SCC) { 130 PromoteArguments(OldNode, CG, AARGetter, MaxElements)) { 132 SCC.ReplaceNode(OldNode, NewNode); [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
ImmutableSet.h | 577 TreeTy* OldNode; 578 TreeTy* newRight = removeMinBinding(R,OldNode); 579 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
ImmutableSet.h | 585 TreeTy* OldNode; 586 TreeTy* newRight = removeMinBinding(R,OldNode); 587 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
ImmutableSet.h | 582 TreeTy* OldNode; 583 TreeTy* newRight = removeMinBinding(R,OldNode); 584 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
ImmutableSet.h | 582 TreeTy* OldNode; 583 TreeTy* newRight = removeMinBinding(R,OldNode); 584 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
ImmutableSet.h | 582 TreeTy* OldNode; 583 TreeTy* newRight = removeMinBinding(R,OldNode); 584 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
ImmutableSet.h | 582 TreeTy* OldNode; 583 TreeTy* newRight = removeMinBinding(R,OldNode); 584 return balanceTree(L, getValue(OldNode), newRight); [all...] |
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
ImmutableSet.h | 582 TreeTy* OldNode; 583 TreeTy* newRight = removeMinBinding(R,OldNode); 584 return balanceTree(L, getValue(OldNode), newRight); [all...] |