| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfFile.cpp | 113 for (auto &Child : Die.children())
114 Offset = computeSizeAndOffset(Child, Offset);
|
| AsmPrinterDwarf.cpp | 276 for (auto &Child : Die.children())
277 emitDwarfDIE(Child);
|
| /external/llvm/lib/DebugInfo/PDB/ |
| PDBSymbol.cpp | 146 while (auto Child = Result->getNext()) {
147 ++Stats[Child->getSymTag()];
|
| /external/llvm/lib/Support/ |
| Twine.cpp | 51 void Twine::printOneChild(raw_ostream &OS, Child Ptr,
98 void Twine::printOneChildRepr(raw_ostream &OS, Child Ptr,
|
| /external/llvm/tools/llvm-pdbdump/ |
| CompilandDumper.cpp | 57 while (auto Child = ChildrenEnum->getNext())
58 Child->dump(*this);
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| ANTLRBaseTreeAdaptor.h | 79 /** Add a child to the tree t. If child is a flat tree (a list), make all
80 * in list children of t. Warning: if t has no children, but child does
81 * and child isNil then you can decide it is ok to move children to t via
82 * t.children = child.children; i.e., without copying the array. Just
89 * If not a nil root, make oldRoot a child of newRoot.
94 * If newRoot is a nil-rooted single child tree, use the single
95 * child as the new root node.
106 * simple node or nil root with a single child node--it must be a root
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRCommonTreeAdaptor.h | 53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRCommonTreeAdaptor.h | 56 - (void) setChild:(ANTLRCommonTree *)t At:(NSInteger)i Child:(ANTLRCommonTree *)child;
|
| ANTLRTreeAdaptor.h | 66 /** Is tree considered a nil node used to make lists of child nodes? */
70 - (void) addChild:(id)child toTree:(id)aTree;
73 * If not a nil root, make oldRoot a child of newRoot.
78 * If newRoot is a nil-rooted single child tree, use the single
79 * child as the new root node.
90 * simple node or nil root with a single child node--it must be a root
130 /** Get a child 0..n-1 node */
132 /** Set ith child (0..n-1) to t; t must be non-null and non-nil node */
133 - (void) setChild:(id)aTree At:(NSInteger)index Child:(id)child;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| microsoft-abi-member-pointers.cpp | 687 struct Child : Base {};
688 void use(void (Child::*const &)());
689 void f() { use(&Child::Method); }
692 static_assert(sizeof(int Child::*) == 4, "");
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| LLVMConventionsChecker.cpp | 127 for (Stmt *Child : S->children())
128 if (Child)
129 Visit(Child);
|
| MallocSizeofChecker.cpp | 68 for (const Stmt *Child : S->children())
69 if (Child)
70 VisitChild(S, Child);
|
| CheckSecuritySyntaxOnly.cpp | 111 for (Stmt *Child : S->children())
112 if (Child)
113 Visit(Child);
164 for (Stmt *Child : S->children())
165 if (Child) {
166 if (CallExpr *CE = dyn_cast<CallExpr>(Child))
168 Visit(Child);
|
| /external/tinyxml/ |
| xmltest.cpp | 160 // It is a child of the document, and can be selected by name.
182 // a particular child.
222 // And add the node to the existing list after the first child.
261 XmlTest( "First child exists & is a comment.", true, ( node != 0 && node->ToComment() ) );
267 XmlTest ( "First child exists.", true, ( node != 0 && node->ToText() ) );
522 TiXmlText* text = docH.FirstChildElement( "document" ).FirstChildElement( (const char*) russianElementName ).Child( 0 ).Text();
530 TiXmlDeclaration* dec = docH.Child( 0 ).Node()->ToDeclaration();
879 TiXmlUnknown* unknown = docH.Child( 1 ).Unknown();
882 TiXmlNode* node = docH.Child( 2 ).Node();
898 TiXmlComment* comment = docH.Child( 0 ).Node()->ToComment()
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 720 /// Find dependent variables within child patterns
843 TreePatternNode *Child = P->getChild(i);
844 if (!Child->isLeaf() && Child->getNumTypes() &&
845 Child->getType(0) != MVT::Other)
846 Size += getPatternSize(Child, CGP);
847 else if (Child->isLeaf()) {
848 if (isa<IntInit>(Child->getLeafValue()))
850 else if (Child->getComplexPatternInfo(CGP))
851 Size += getPatternSize(Child, CGP)
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_foreach_lowering.cpp | 377 for (clang::Stmt* Child : S->children()) {
378 if (Child) {
379 Visit(Child);
|
| /external/llvm/include/llvm/ADT/ |
| SCCIterator.h | 52 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min)
56 : Node(Node), NextChild(Child), MinVisited(Min) {}
79 /// node, the next child to visit, and the minimum uplink value of all child
157 // TOS has at least one more child so continue DFS
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_mutants.py | 165 class Child:
182 self.a = Child(self)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_mutants.py | 165 class Child:
182 self.a = Child(self)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_mutants.py | 165 class Child:
182 self.a = Child(self)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_mutants.py | 165 class Child:
182 self.a = Child(self)
|
| /external/llvm/lib/Object/ |
| ArchiveWriter.cpp | 37 NewArchiveIterator::NewArchiveIterator(const object::Archive::Child &OldMember,
48 const object::Archive::Child &NewArchiveIterator::getOld() const {
349 const object::Archive::Child &OldMember = Member.getOld();
400 const object::Archive::Child &OldMember = I.getOld();
414 const object::Archive::Child &OldMember = I.getOld();
|
| /external/llvm/include/llvm/Analysis/ |
| RegionInfoImpl.h | 48 // Only clean the cache for this Region. Caches of child Regions will be
49 // cleaned when the child Regions are deleted.
361 if (RegionT *Child = getSubRegionNode(BB))
362 return Child->getNode();
419 typename Tr::RegionT *RegionBase<Tr>::removeSubRegion(RegionT *Child) {
420 assert(Child->parent == this && "Child is not a child of this region!");
421 Child->parent = nullptr;
424 [&](const std::unique_ptr<RegionT> &R) { return R.get() == Child; });
[all...] |
