HomeSort by relevance Sort by last modified time
    Searched refs:Parent (Results 26 - 50 of 272) sorted by null

12 3 4 5 6 7 8 91011

  /external/llvm/lib/Target/Mips/
Mips16ISelDAGToDAG.h 33 void getMips16SPRefReg(SDNode *Parent, SDValue &AliasReg);
35 bool selectAddr16(SDNode *Parent, SDValue N, SDValue &Base,
Mips16ISelDAGToDAG.cpp 127 void Mips16DAGToDAGISel::getMips16SPRefReg(SDNode *Parent, SDValue &AliasReg) {
130 if (Parent) {
131 switch (Parent->getOpcode()) {
133 LoadSDNode *SD = dyn_cast<LoadSDNode>(Parent);
144 StoreSDNode *SD = dyn_cast<StoreSDNode>(Parent);
162 SDNode *Parent, SDValue Addr, SDValue &Base, SDValue &Offset,
172 getMips16SPRefReg(Parent, Alias);
195 getMips16SPRefReg(Parent, Alias);
226 const LSBaseSDNode *LS = dyn_cast<LSBaseSDNode>(Parent);
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
TreeExtensions.cs 41 return tree.Parent.GetChild( tree.ChildIndex + 1 );
  /external/llvm/lib/Object/
MachOUniversal.cpp 54 const MachOUniversalBinary *Parent, uint32_t Index)
55 : Parent(Parent), Index(Index) {
56 if (!Parent || Index >= Parent->getNumberOfObjects()) {
60 StringRef ParentData = Parent->getData();
72 if (Parent) {
73 StringRef ParentData = Parent->getData();
75 std::string ObjectName = Parent->getFileName().str();
85 if (Parent) {
    [all...]
  /external/llvm/include/llvm/MC/MCAnalysis/
MCFunction.h 38 MCFunction *Parent;
40 MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent);
55 const MCFunction *getParent() const { return Parent; }
56 MCFunction *getParent() { return Parent; }
97 MCFunction(StringRef Name, MCModule *Parent);
  /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...]
ITree.cs 58 // Tree tracks parent and child index now > 3.0
60 ITree Parent {
73 * list is the root and the last is the parent of this node.
84 /** <summary>Set the parent and child index values for all children</summary> */
  /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...]
ITree.cs 61 // Tree tracks parent and child index now > 3.0
63 ITree Parent
77 * list is the root and the last is the parent of this node.
89 /** <summary>Set the parent and child index values for all children</summary> */
  /external/llvm/include/llvm/IR/
BasicBlock.h 79 Function *Parent;
81 void setParent(Function *parent);
93 Function *Parent = nullptr,
107 /// If the Parent parameter is specified, the basic block is automatically
111 Function *Parent = nullptr,
113 return new BasicBlock(Context, Name, Parent, InsertBefore);
118 const Function *getParent() const { return Parent; }
119 Function *getParent() { return Parent; }
GlobalAlias.h 34 void setParent(Module *parent);
37 const Twine &Name, Constant *Aliasee, Module *Parent);
45 /// If a parent module is specified, the alias is automatically inserted into
49 Constant *Aliasee, Module *Parent);
54 Module *Parent);
61 // Type, Parent and AddressSpace taken from the Aliasee.
65 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
MDBuilder.h 80 /// parent in the TBAA tree, and value for 'pointsToConstantMemory'.
81 MDNode *createTBAANode(StringRef Name, MDNode *Parent,
103 /// given name, an offset and a parent in the TBAA type DAG.
104 MDNode *createTBAAScalarTypeNode(StringRef Name, MDNode *Parent,
  /external/llvm/include/llvm/Support/
GenericDomTreeConstruction.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...]
  /external/lzma/CPP/Common/
Wildcard.h 30 CCensorNode *Parent;
35 CCensorNode(): Parent(0) { };
36 CCensorNode(const UString &name, CCensorNode *parent): Name(name), Parent(parent) { };
  /external/pdfium/core/src/fpdfdoc/
doc_bookmark.cpp 8 CPDF_Bookmark CPDF_BookmarkTree::GetFirstChild(CPDF_Bookmark Parent)
10 if (Parent.m_pDict == NULL) {
17 return Parent.m_pDict->GetDict("First");
  /external/clang/lib/ARCMigrate/
TransProtectedScope.cpp 67 Stmt *Parent = getCaseParent(Curr);
71 if (getCaseParent(Curr) != Parent)
88 Stmt *Parent = PMap.getParent(S);
89 while (Parent && (isa<SwitchCase>(Parent) || isa<LabelStmt>(Parent)))
90 Parent = PMap.getParent(Parent);
91 return Parent;
  /external/clang/lib/Basic/
Module.cpp 27 Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent,
29 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), ModuleMap(File),
36 if (Parent) {
37 if (!Parent->isAvailable())
39 if (Parent->IsSystem)
41 if (Parent->IsExternC)
43 IsMissingRequirement = Parent->IsMissingRequirement;
45 Parent->SubModuleIndex[Name] = Parent->SubModules.size()
    [all...]
  /external/llvm/lib/CodeGen/
LexicalScopes.cpp 166 LexicalScope *Parent = nullptr;
168 Parent = getOrCreateLexicalScope(DebugLoc::getFromDILexicalBlock(Scope));
172 std::make_tuple(Parent, DIDescriptor(Scope),
175 if (!Parent && DIDescriptor(Scope).isSubprogram() &&
190 LexicalScope *Parent;
193 Parent = getOrCreateLexicalScope(DebugLoc::getFromDILocation(InlinedAt));
195 Parent = getOrCreateInlinedScope(Scope.getContext(), InlinedAt);
201 std::make_tuple(Parent, Scope, InlinedAt,
217 LexicalScope *Parent = nullptr;
221 Parent = getOrCreateAbstractScope(ParentDesc)
    [all...]
  /external/chromium_org/third_party/skia/src/animator/
SkDisplayXMLParser.h 72 struct Parent {
76 SkTDArray<Parent> fParents;
  /external/skia/src/animator/
SkDisplayXMLParser.h 72 struct Parent {
76 SkTDArray<Parent> fParents;
  /external/llvm/unittests/ADT/
SCCIteratorTest.cpp 222 static ChildIterator child_begin(NodeType *Parent) {
223 return ChildIterator(Parent - Parent->first, Parent->second);
227 static ChildIterator child_end(NodeType *Parent) {
228 return ChildIterator(Parent - Parent->first, NodeSubset());
  /external/clang/include/clang/AST/
DependentDiagnostic.h 39 DeclContext *Parent,
48 DependentDiagnostic *DD = Create(Context, Parent, PDiag);
102 DeclContext *Parent,
ParentMap.h 27 /// \brief Adds and/or updates the parent/child-relations of the complete
32 /// Manually sets the parent of \p S to \p Parent.
35 void setParent(const Stmt *S, const Stmt *Parent);
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
heap.h 76 // to calculate the parent and child positions.
79 if (comp_(val, A_[Parent(i)])) {
117 // compute left child of parent
122 // compute right child of parent
127 // given a child compute parent
128 int Parent(int i) {
132 // swap a child, parent. Use to move element up/down tree
172 while (i > 0 && !comp_(A_[p = Parent(i)], val)) {
  /external/clang/include/clang/Sema/
Initialization.h 99 /// \brief If non-NULL, the parent entity in which this
101 const InitializedEntity *Parent;
165 : Kind(EK_Variable), Parent(nullptr), Type(Var->getType()),
173 : Kind(Kind), Parent(nullptr), Type(Type), ManglingNumber(0)
180 InitializedEntity(FieldDecl *Member, const InitializedEntity *Parent)
181 : Kind(EK_Member), Parent(Parent), Type(Member->getType()),
186 const InitializedEntity &Parent);
190 : Kind(EK_LambdaCapture), Parent(nullptr), Type(FieldType),
221 Entity.Parent = nullptr
    [all...]

Completed in 248 milliseconds

12 3 4 5 6 7 8 91011