/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
GlobalAlias.h | 33 const Twine &Name, Constant *Aliasee, Module *Parent); 39 /// If a parent module is specified, the alias is automatically inserted into 43 Constant *Aliasee, Module *Parent); 48 Module *Parent); 55 // Type, Parent and AddressSpace taken from the Aliasee. 59 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/IR/ |
GlobalAlias.h | 33 const Twine &Name, Constant *Aliasee, Module *Parent); 39 /// If a parent module is specified, the alias is automatically inserted into 43 Constant *Aliasee, Module *Parent); 48 Module *Parent); 55 // Type, Parent and AddressSpace taken from the Aliasee. 59 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/IR/ |
GlobalAlias.h | 33 const Twine &Name, Constant *Aliasee, Module *Parent); 39 /// If a parent module is specified, the alias is automatically inserted into 43 Constant *Aliasee, Module *Parent); 48 Module *Parent); 55 // Type, Parent and AddressSpace taken from the Aliasee. 59 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
|
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/IR/ |
GlobalAlias.h | 33 const Twine &Name, Constant *Aliasee, Module *Parent); 39 /// If a parent module is specified, the alias is automatically inserted into 43 Constant *Aliasee, Module *Parent); 48 Module *Parent); 55 // Type, Parent and AddressSpace taken from the Aliasee. 59 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
GlobalAlias.h | 33 const Twine &Name, Constant *Aliasee, Module *Parent); 39 /// If a parent module is specified, the alias is automatically inserted into 43 Constant *Aliasee, Module *Parent); 48 Module *Parent); 55 // Type, Parent and AddressSpace taken from the Aliasee. 59 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
|
/external/swiftshader/third_party/LLVM/lib/MC/ |
MCAtom.cpp | 22 Parent->remap(this, Begin, End+Size); 29 Parent->remap(this, Begin, End+1); 45 Parent->remap(this, LeftBegin, LeftEnd); 48 MCAtom *RightAtom = Parent->createAtom(Type, RightBegin, RightEnd); 80 Parent->remap(this, Begin, TruncPt);
|
/external/llvm/include/llvm/IR/ |
BasicBlock.h | 60 Function *Parent; 62 void setParent(Function *parent); 74 Function *Parent = nullptr, 88 /// If the Parent parameter is specified, the basic block is automatically 92 Function *Parent = nullptr, 94 return new BasicBlock(Context, Name, Parent, InsertBefore); 99 const Function *getParent() const { return Parent; } 100 Function *getParent() { return Parent; } 105 /// Note: this is undefined behavior if the block does not have a parent. 182 /// Inserts an unlinked basic block into \c Parent. If \c InsertBefore i [all...] |
/external/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
BasicBlock.h | 61 Function *Parent; 63 void setParent(Function *parent); 71 Function *Parent = nullptr, 90 /// If the Parent parameter is specified, the basic block is automatically 94 Function *Parent = nullptr, 96 return new BasicBlock(Context, Name, Parent, InsertBefore); 100 const Function *getParent() const { return Parent; } 101 Function *getParent() { return Parent; } 106 /// Note: this is undefined behavior if the block does not have a parent. 183 /// Inserts an unlinked basic block into \c Parent. If \c InsertBefore i [all...] |
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/Acpi/AcpiTableDxe/ |
AmlString.c | 124 // Parse root or parent prefix
276 @param[out] Parent On return, points to Parent char number.
285 OUT UINTN *Parent,
293 *Parent = 0;
303 (*Parent) ++;
333 TotalLength = *Root + *Parent + (*SegCount) * AML_NAME_SEG_SIZE;
387 UINTN Parent;
395 TotalLength = AmlGetAslNameStringSize (AslPath, &Root, &Parent, &SegCount);
407 // Handle Root and Parent
[all...] |
/external/llvm/include/llvm/Object/ |
Archive.h | 57 const Archive *Parent; 70 Child(const Archive *Parent, const char *Start, std::error_code *EC); 71 Child(const Archive *Parent, StringRef Data, uint16_t StartOfFile); 74 assert(Parent == other.Parent); 78 const Archive *getParent() const { return Parent; } 147 const Archive *Parent; 153 return (Parent == other.Parent) && (SymbolIndex == other.SymbolIndex); 157 : Parent(p [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
BaseTree.cs | 85 /** <summary>BaseTree doesn't track parent pointers.</summary> */ 86 public virtual ITree Parent { 192 c.Parent = this; 208 t.Parent = this; 237 t.Parent = this; 310 child.Parent = this; 346 /** <summary>Set the parent and child index values for all child of t</summary> */ 356 child.Parent = this; 364 public virtual void SanityCheckParentAndChildIndexes(ITree parent, int i) { 365 if (parent != this.Parent) [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
BaseTree.cs | 99 /** <summary>BaseTree doesn't track parent pointers.</summary> */ 100 public virtual ITree Parent 230 c.Parent = this; 251 t.Parent = this; 285 t.Parent = this; 369 child.Parent = this; 414 /** <summary>Set the parent and child index values for all child of t</summary> */ 427 child.Parent = this; 436 public virtual void SanityCheckParentAndChildIndexes( ITree parent, int i ) 438 if ( parent != this.Parent [all...] |
/external/clang/lib/AST/ |
ASTTypeTraits.cpp | 70 NodeKindId Parent = Kind1.KindId; 71 while (!isBaseOf(Parent, Kind2.KindId, nullptr) && Parent != NKI_None) { 72 Parent = AllKindInfo[Parent].ParentId; 74 return ASTNodeKind(Parent); 90 #define STMT(CLASS, PARENT) \
|
/external/swiftshader/third_party/LLVM/include/llvm/ |
BasicBlock.h | 77 Function *Parent; 79 void setParent(Function *parent); 90 Function *Parent = 0, BasicBlock *InsertBefore = 0); 99 /// Create - Creates a new BasicBlock. If the Parent parameter is specified, 103 Function *Parent = 0,BasicBlock *InsertBefore = 0) { 104 return new BasicBlock(Context, Name, Parent, InsertBefore); 110 const Function *getParent() const { return Parent; } 111 Function *getParent() { return Parent; }
|
/external/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 48 SuccVInfo.Parent = V; 73 BBInfo.Parent = 1; 97 SuccVInfo.Parent = BBDFSNum; 117 if (VInInfo.Parent >= LastLinked) 124 typename GraphT::NodeType* VAncestor = DT.Vertex[VInfo.Parent]; 127 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 134 if (VInfo.Parent < LastLinked) 143 VInfo.Parent = VAInfo.Parent; 204 // initialize the semi dominator to point to the parent nod [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
DominatorInternals.h | 49 SuccVInfo.Parent = V; 74 BBInfo.Parent = 1; 98 SuccVInfo.Parent = BBDFSNum; 118 if (VInInfo.Parent >= LastLinked) 125 typename GraphT::NodeType* VAncestor = DT.Vertex[VInfo.Parent]; 128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) { 135 if (VInfo.Parent < LastLinked) 144 VInfo.Parent = VAInfo.Parent; 205 // initialize the semi dominator to point to the parent nod [all...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 65 // Set the parent to the top of the visited stack. The stack includes us, 68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 72 BBInfo.Parent = 1; 91 // Set the parent to the top of the visited stack. The stack includes us, 94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum; 111 if (VInInfo.Parent >= LastLinked) 117 typename GraphT::NodeRef VAncestor = DT.Vertex[VInfo.Parent]; 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) { 127 if (VInfo.Parent < LastLinked) 135 VInfo.Parent = VAInfo.Parent [all...] |
/device/linaro/bootloader/edk2/StdLibPrivateInternalFiles/Include/Device/ |
Console.h | 30 DeviceNode *Parent; ///< Points to the parent Device Node.
|