/external/clang/lib/StaticAnalyzer/Checkers/ |
TraversalChecker.cpp | 39 const Stmt *Parent = dyn_cast<ObjCForCollectionStmt>(Condition); 40 if (!Parent) { 42 Parent = Parents.getParent(Condition); 48 SourceLocation Loc = Parent->getLocStart(); 50 << Parent->getStmtClassName() << "\n";
|
/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); 145 StoreSDNode *SD = dyn_cast<StoreSDNode>(Parent); 164 SDNode *Parent, SDValue Addr, SDValue &Base, SDValue &Offset, 175 getMips16SPRefReg(Parent, Alias); 198 getMips16SPRefReg(Parent, Alias); 229 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/ |
Archive.cpp | 85 Archive::Child::Child(const Archive *Parent, StringRef Data, 87 : Parent(Parent), Data(Data), StartOfFile(StartOfFile) {} 89 Archive::Child::Child(const Archive *Parent, const char *Start, 91 : Parent(Parent) { 118 if (Parent->IsThin) { 136 return Parent->IsThin && Name != "/" && Name != "//"; 150 Parent->getMemoryBufferRef().getBufferIdentifier()); 155 Parent->ThinBuffers.push_back(std::move(*Buf)) [all...] |
/external/clang/lib/Analysis/ |
ThreadSafetyTIL.cpp | 196 if (DominatorNode.Parent) 197 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); 224 Candidate = Candidate->DominatorNode.Parent; 226 Alternate = Alternate->DominatorNode.Parent; 229 DominatorNode.Parent = Candidate; 251 Candidate = Candidate->PostDominatorNode.Parent; 253 Alternate = Alternate->PostDominatorNode.Parent; 256 PostDominatorNode.Parent = Candidate; 272 if (N->Parent) { 273 BasicBlock::TopologyNode *P = &(N->Parent->*TN) [all...] |
/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. 174 /// Inserts an unlinked basic block into \c Parent. If \c InsertBefore i [all...] |
GlobalAlias.h | 33 void setParent(Module *parent); 36 const Twine &Name, Constant *Aliasee, Module *Parent); 44 /// If a parent module is specified, the alias is automatically inserted into 48 Constant *Aliasee, Module *Parent); 53 Module *Parent); 60 // Type, Parent and AddressSpace taken from the Aliasee. 64 // Linkage, Type, Parent and AddressSpace taken from the Aliasee.
|
/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/clang/lib/AST/ |
ASTTypeTraits.cpp | 74 NodeKindId Parent = Kind1.KindId; 75 while (!isBaseOf(Parent, Kind2.KindId, nullptr) && Parent != NKI_None) { 76 Parent = AllKindInfo[Parent].ParentId; 78 return ASTNodeKind(Parent); 94 #define STMT(CLASS, 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/clang/include/clang/Sema/ |
DelayedDiagnostic.h | 240 const DelayedDiagnosticPool *Parent; 246 DelayedDiagnosticPool(const DelayedDiagnosticPool *parent) : Parent(parent) {} 254 : Parent(Other.Parent), Diagnostics(std::move(Other.Diagnostics)) { 258 Parent = Other.Parent; 264 const DelayedDiagnosticPool *getParent() const { return Parent; } 268 return (Diagnostics.empty() && (!Parent || Parent->empty())) [all...] |
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...] |
/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/llvm/lib/CodeGen/ |
LexicalScopes.cpp | 151 LexicalScope *Parent = nullptr; 153 Parent = getOrCreateLexicalScope(Block->getScope()); 156 std::forward_as_tuple(Parent, Scope, nullptr, 159 if (!Parent) { 177 LexicalScope *Parent; 179 Parent = getOrCreateInlinedScope(Block->getScope(), InlinedAt); 181 Parent = getOrCreateLexicalScope(InlinedAt); 185 std::forward_as_tuple(Parent, Scope, 203 LexicalScope *Parent = nullptr; 205 Parent = getOrCreateAbstractScope(Block->getScope()) [all...] |
/external/skia/src/animator/ |
SkDisplayXMLParser.h | 72 struct Parent { 76 SkTDArray<Parent> fParents;
|
/external/clang/lib/Frontend/ |
DependencyFile.cpp | 204 DFGImpl &Parent; 206 DFGMMCallback(DFGImpl &Parent) : Parent(Parent) {} 209 if (!IsSystem || Parent.includeSystemHeaders()) 210 Parent.AddFilename(Entry.getName()); 215 DFGImpl &Parent; 217 DFGASTReaderListener(DFGImpl &Parent) 218 : Parent(Parent) { } [all...] |
/external/llvm/unittests/ADT/ |
SCCIteratorTest.cpp | 220 static ChildIterator child_begin(NodeType *Parent) { 221 return ChildIterator(Parent - Parent->first, Parent->second); 225 static ChildIterator child_end(NodeType *Parent) { 226 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/clang/lib/Basic/ |
Module.cpp | 27 Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent, 29 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), Directory(), 37 if (Parent) { 38 if (!Parent->isAvailable()) 40 if (Parent->IsSystem) 42 if (Parent->IsExternC) 44 IsMissingRequirement = Parent->IsMissingRequirement; 46 Parent->SubModuleIndex[Name] = Parent->SubModules.size() [all...] |
/external/llvm/include/llvm/CodeGen/ |
LiveRangeEdit.h | 13 // The parent register is never changed. Instead, a number of new virtual 61 LiveInterval *Parent; 83 /// scanRemattable - Identify the Parent values that may rematerialize. 110 /// Create a LiveRangeEdit for breaking down parent into smaller pieces. 111 /// @param parent The register being spilled or split. 119 LiveRangeEdit(LiveInterval *parent, SmallVectorImpl<unsigned> &newRegs, 122 : Parent(parent), NewRegs(newRegs), MRI(MF.getRegInfo()), LIS(lis), 132 assert(Parent && "No parent LiveInterval") [all...] |