| /external/llvm/include/llvm/ADT/ |
| D | ImmutableMap.h | 72 TreeTy* Root;
79 explicit ImmutableMap(const TreeTy* R) : Root(const_cast<TreeTy*>(R)) { in ImmutableMap()
80 if (Root) { Root->retain(); } in ImmutableMap()
82 ImmutableMap(const ImmutableMap &X) : Root(X.Root) { in ImmutableMap()
83 if (Root) { Root->retain(); } in ImmutableMap()
86 if (Root != X.Root) {
87 if (X.Root) { X.Root->retain(); }
88 if (Root) { Root->release(); }
89 Root = X.Root;
94 if (Root) { Root->release(); } in ~ImmutableMap()
[all …]
|
| D | ImmutableSet.h | 661 inline ImutAVLTreeGenericIterator(const TreeTy* Root) { in ImutAVLTreeGenericIterator() argument
662 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root)); in ImutAVLTreeGenericIterator()
771 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) { in ImutAVLTreeInOrderIterator() argument
772 if (Root) operator++(); // Advance to first element. in ImutAVLTreeInOrderIterator()
939 TreeTy *Root;
946 explicit ImmutableSet(TreeTy* R) : Root(R) {
947 if (Root) { Root->retain(); }
949 ImmutableSet(const ImmutableSet &X) : Root(X.Root) {
950 if (Root) { Root->retain(); }
953 if (Root != X.Root) {
[all …]
|
| /external/clang/utils/TableGen/ |
| D | ClangASTNodesEmitter.cpp | 32 Record Root; member in __anone2704d2d0111::ClangASTNodesEmitter
47 if (&R == &Root && !BaseSuffix.empty()) in baseName()
58 : Records(R), Root(N, SMLoc(), R), BaseSuffix(S) in ClangASTNodesEmitter()
97 OS << "ABSTRACT_" << macroName(Root.getName()) << "(" << NodeName << "(" in EmitNode()
124 if (Base == &Root) in EmitNode()
125 OS << "LAST_" << macroName(Root.getName()) << "_RANGE("; in EmitNode()
127 OS << macroName(Root.getName()) << "_RANGE("; in EmitNode()
137 OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n"; in run()
138 OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n"; in run()
141 OS << "#ifndef " << macroName(Root.getName()) << "_RANGE\n"; in run()
[all …]
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/namespace.qual/ |
| D | p3.cpp | 5 namespace Root { namespace
11 using namespace Root;
15 using namespace Root;
29 using Root::i;
30 using Root::f;
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| D | AST.stg | 99 Root[0] := nil;<\n>
104 Root: array [0..63] of I<ASTLabelType>;
129 Root[0] := Adaptor.GetNilNode as I<ASTLabelType>;
215 <prevRuleRootRef()>.Tree := Root[0];
217 Root[0] := Adaptor.GetNilNode as I<ASTLabelType>;
231 <prevRuleRootRef()>.Tree := Root[0];<\n>
234 <prevRuleRootRef()>.Tree := Root[0];<\n>
323 rewriteEmptyAlt() ::= "Root[0] = null;"
328 Root[<treeLevel>] := Adaptor.GetNilNode as I<ASTLabelType>;
331 Adaptor.AddChild(Root[<enclosingTreeLevel>], Root[<treeLevel>]);
[all …]
|
| D | ASTParser.stg | 60 Adaptor.AddChild(Root[0], <label>_tree);
77 Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>;
115 …if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <createNodeFrom…
131 …ing)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<createNodeFromToken(..…
139 <if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <label>.Tree);
148 …cktracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<label>.Tree, Ro…
178 Adaptor.AddChild(Root[0], <label>_tree);
193 Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>;
213 RetVal.Tree := Adaptor.RulePostProcessing(Root[0]) as I<ASTLabelType>;
|
| D | ASTTreeParser.stg | 82 Root[<treeLevel>] := Adaptor.GetNilNode as I<ASTLabelType>;<\n>
107 Adaptor.AddChild(Root[<enclosingTreeLevel>], Root[<treeLevel>]);
137 Adaptor.AddChild(Root[<treeLevel>], <label>_tree);
167 Root[<treeLevel>] := Adaptor.BecomeRoot(<label>_tree, Root[<treeLevel>]) as I<ASTLabelType>;
192 Adaptor.AddChild(Root[<treeLevel>], <label>_tree);
218 Root[<treeLevel>] := Adaptor.BecomeRoot(<label>_tree, Root[<treeLevel>]) as I<ASTLabelType>;
233 Adaptor.AddChild(Root[<treeLevel>], <label>.Tree);
250 …cking)>if (State.Backtracking = 0) then <endif>Root[<treeLevel>] := Adaptor.BecomeRoot(<label>.Tre…
302 RetVal.Tree := Adaptor.RulePostProcessing(Root[0]) as I<ASTLabelType>;
|
| /external/clang/test/Rewriter/ |
| D | objc-modern-class-init.mm | 5 @interface Root @end interface
7 @interface Super : Root
15 @implementation Root @end implementation
17 @interface Root(Cat) @end interface in Cat
21 @implementation Root(Cat) @end implementation in Cat
|
| D | objc-modern-class-init-hooks.mm | 5 @interface Root @end interface
7 @interface Super : Root
15 @implementation Root @end implementation
17 @interface Root(Cat) @end interface in Cat
21 @implementation Root(Cat) @end implementation in Cat
|
| D | instancetype-test.mm | 8 @interface Root interface
14 @property (assign) Root *selfProp;
29 @interface Subclass1 : Root
35 @interface Subclass2 : Root
42 Root *r1 = [[Root alloc] init];
|
| /external/clang/lib/Rewrite/Core/ |
| D | RewriteRope.cpp | 720 Root = new RopePieceBTreeLeaf(); in RopePieceBTree()
724 Root = new RopePieceBTreeLeaf(); in RopePieceBTree()
727 getRoot(Root)->Destroy(); in ~RopePieceBTree()
731 return getRoot(Root)->size(); in size()
735 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root))) in clear()
738 getRoot(Root)->Destroy(); in clear()
739 Root = new RopePieceBTreeLeaf(); in clear()
745 if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset)) in insert()
746 Root = new RopePieceBTreeInterior(getRoot(Root), RHS); in insert()
749 if (RopePieceBTreeNode *RHS = getRoot(Root)->insert(Offset, R)) in insert()
[all …]
|
| D | DeltaTree.cpp | 386 static DeltaTreeNode *getRoot(void *Root) { in getRoot() argument
387 return (DeltaTreeNode*)Root; in getRoot()
391 Root = new DeltaTreeNode(); in DeltaTree()
395 assert(getRoot(RHS.Root)->getNumValuesUsed() == 0 && in DeltaTree()
397 Root = new DeltaTreeNode(); in DeltaTree()
401 getRoot(Root)->Destroy(); in ~DeltaTree()
408 const DeltaTreeNode *Node = getRoot(Root); in getDeltaAt()
456 DeltaTreeNode *MyRoot = getRoot(Root); in AddDelta()
460 Root = MyRoot = new DeltaTreeInteriorNode(InsertRes); in AddDelta()
|
| /external/llvm/lib/Analysis/IPA/ |
| D | CallGraph.cpp | 33 CallGraphNode *Root; member in __anonb8a991620111::BasicCallGraph
45 BasicCallGraph() : ModulePass(ID), Root(0), in BasicCallGraph()
56 Root = 0; in runOnModule()
63 if (Root == 0) Root = ExternalCallingNode; in runOnModule()
103 CallGraphNode *getRoot() { return Root; } in getRoot()
104 const CallGraphNode *getRoot() const { return Root; } in getRoot()
123 if (Root) // Found multiple external mains? Don't pick one. in addToCallGraph()
124 Root = ExternalCallingNode; in addToCallGraph()
126 Root = Node; // Found a main, keep track of it! in addToCallGraph()
|
| /external/llvm/test/YAMLParser/ |
| D | spec-07-10.data | 3 "Root flow
6 Root block
9 # Root collection:
|
| /external/clang/test/CodeGenObjC/ |
| D | dot-syntax-1.m | 5 @interface Root interface
12 @interface Top0 : Root
43 @interface Top1 : Root
74 @interface Top2 : Root
105 @interface Top3 : Root
136 @interface Top4 : Root
167 @interface Top5 : Root
198 @interface Top6 : Root
221 @interface Top7 : Root
|
| D | objc2-weak-import-attribute.m | 37 // Root is being implemented here. No extern_weak.
38 __attribute__((weak_import)) @interface Root @end interface
40 @interface Super : Root @end
46 @implementation Root @end implementation
|
| /external/clang/test/SemaObjC/ |
| D | duplicate-ivar-in-class-extension.m | 3 @interface Root @end interface
5 @interface SuperClass : Root
23 @interface Root () { interface in int
|
| D | instancetype.m | 7 @interface Root interface
13 @property (assign) Root *selfProp;
28 @interface Subclass1 : Root
34 @interface Subclass2 : Root
41 Root *r1 = [[Root alloc] init];
130 @interface Subclass4 : Root
178 @interface MyClass : Root
|
| D | dealloc.m | 12 @interface Root <Foo> interface
15 @interface Baz : Root {
|
| /external/llvm/include/llvm/ |
| D | MDBuilder.h | 104 MDNode *Root = MDNode::get(Context, Dummy); in createAnonymousTBAARoot() local
109 Root->replaceOperandWith(0, Root); in createAnonymousTBAARoot()
113 return Root; in createAnonymousTBAARoot()
|
| /external/clang/lib/CodeGen/ |
| D | CodeGenTBAA.cpp | 33 MDHelper(VMContext), Root(0), Char(0) { in CodeGenTBAA()
44 if (!Root) in getRoot()
45 Root = MDHelper.createTBAARoot("Simple C/C++ TBAA"); in getRoot()
47 return Root; in getRoot()
|
| /external/clang/lib/Analysis/ |
| D | CallGraph.cpp | 55 Root = getOrInsertNode(0); in CallGraph()
98 Root->addCallee(Node, this); in addNodeForDecl()
128 if (I->second == Root) in print()
135 assert(*CI != Root && "No one can call the root node."); in print()
|
| /external/llvm/test/CodeGen/X86/GC/ |
| D | lower_gcroot.ll | 6 %Root = alloca %Env
7 call void @llvm.gcroot( %Env* %Root, %Env null )
|
| /external/clang/test/CodeGenCXX/ |
| D | derived-to-base-conv.cpp | 46 struct Root { struct
52 struct Base : Root {
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| D | Antlr.Runtime.Tree.Tests.pas | 221 Root, R0, C0, C1, C2: ICommonTree;
225 Root := TCommonTree.Create(TCommonToken.Create(5));
226 Root.AddChild(TCommonTree.Create(TCommonToken.Create(6)));
237 Root.AddChild(R0);
239 CheckNull(Root.Parent);
240 CheckEquals(Root.ChildIndex, -1);
243 Check(C0.Parent = Root);
245 Check(C1.Parent = Root);
247 Check(C2.Parent = Root);
380 Root, R0, C0, C1, C2: ICommonTree;
[all …]
|