| /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 | 655 inline ImutAVLTreeGenericIterator(const TreeTy* Root) { in ImutAVLTreeGenericIterator() argument
656 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root)); in ImutAVLTreeGenericIterator()
765 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) { in ImutAVLTreeInOrderIterator() argument
766 if (Root) operator++(); // Advance to first element. in ImutAVLTreeInOrderIterator()
933 TreeTy *Root;
940 explicit ImmutableSet(TreeTy* R) : Root(R) {
941 if (Root) { Root->retain(); }
943 ImmutableSet(const ImmutableSet &X) : Root(X.Root) {
944 if (Root) { Root->retain(); }
947 if (Root != X.Root) {
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | ClangASTNodesEmitter.cpp | 49 OS << "ABSTRACT_" << macroName(Root.getName()) << "(" << NodeName << "(" in EmitNode()
76 if (Base == &Root) in EmitNode()
77 OS << "LAST_" << macroName(Root.getName()) << "_RANGE("; in EmitNode()
79 OS << macroName(Root.getName()) << "_RANGE("; in EmitNode()
89 OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n"; in run()
90 OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n"; in run()
93 OS << "#ifndef " << macroName(Root.getName()) << "_RANGE\n"; in run()
95 << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; in run()
98 OS << "#ifndef LAST_" << macroName(Root.getName()) << "_RANGE\n"; in run()
100 << macroName(Root.getName()) << "_RANGE(Base, First, Last) " in run()
[all …]
|
| D | ClangASTNodesEmitter.h | 34 Record Root; variable
49 if (&R == &Root && !BaseSuffix.empty()) in baseName()
60 : Records(R), Root(N, SMLoc(), R), BaseSuffix(S) in ClangASTNodesEmitter()
|
| /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/clang/lib/Rewrite/ |
| D | RewriteRope.cpp | 717 Root = new RopePieceBTreeLeaf(); in RopePieceBTree()
721 Root = new RopePieceBTreeLeaf(); in RopePieceBTree()
724 getRoot(Root)->Destroy(); in ~RopePieceBTree()
728 return getRoot(Root)->size(); in size()
732 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root))) in clear()
735 getRoot(Root)->Destroy(); in clear()
736 Root = new RopePieceBTreeLeaf(); in clear()
742 if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset)) in insert()
743 Root = new RopePieceBTreeInterior(getRoot(Root), RHS); in insert()
746 if (RopePieceBTreeNode *RHS = getRoot(Root)->insert(Offset, R)) in insert()
[all …]
|
| D | DeltaTree.cpp | 388 static DeltaTreeNode *getRoot(void *Root) { in getRoot() argument
389 return (DeltaTreeNode*)Root; in getRoot()
393 Root = new DeltaTreeNode(); in DeltaTree()
397 assert(getRoot(RHS.Root)->getNumValuesUsed() == 0 && in DeltaTree()
399 Root = new DeltaTreeNode(); in DeltaTree()
403 getRoot(Root)->Destroy(); in ~DeltaTree()
410 const DeltaTreeNode *Node = getRoot(Root); in getDeltaAt()
458 DeltaTreeNode *MyRoot = getRoot(Root); in AddDelta()
462 Root = MyRoot = new DeltaTreeInteriorNode(InsertRes); in AddDelta()
|
| /external/llvm/lib/Analysis/IPA/ |
| D | CallGraph.cpp | 33 CallGraphNode *Root; member in __anon555996df0111::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/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
|
| D | link-errors.m | 8 @interface Root interface
15 @interface A : Root
|
| D | protocols.m | 5 @interface Root interface
54 typedef Root<P1> P1Object;
|
| /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 | no-protocol-option-tests.m | 30 @interface Root @end interface
31 @interface L : Root<P> @end
|
| D | method-undefined-warn-1.m | 45 @interface Root @end interface
47 @interface Foo : Root @end
|
| D | property-user-setter.m | 64 @interface Root interface
69 @interface Subclass : Root
|
| /external/clang/lib/CodeGen/ |
| D | CodeGenTBAA.cpp | 31 Root(0), Char(0) { in CodeGenTBAA()
42 if (!Root) in getRoot()
43 Root = getTBAAInfoForNamedType("Simple C/C++ TBAA", 0); in getRoot()
45 return Root; in getRoot()
|
| /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 | 56 struct Root { struct
62 struct Base : Root { argument
|
| /external/e2fsprogs/tests/f_badroot/ |
| D | expect.1 | 4 Root inode is not a directory. Clear? yes
10 Root inode not allocated. Allocate? yes
|
| /external/llvm/include/llvm/Analysis/ |
| D | DominatorInternals.h | 231 typename GraphT::NodeType* Root = DT.Vertex[1]; in Calculate() local
234 DT.IDoms[V] = Root; in Calculate()
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : 0; in Calculate() local
254 DT.DomTreeNodes[Root] = DT.RootNode = in Calculate()
255 new DomTreeNodeBase<typename GraphT::NodeType>(Root, 0); in Calculate()
|
| /external/clang/test/Coverage/ |
| D | objc-language-features.inc | 11 @interface Root
14 @interface A : Root <P1> {
|
| /external/llvm/lib/CompilerDriver/ |
| D | CompilationGraph.cpp | 319 Node* Root = getNode("root"); in TopologicalSort() local
320 if (Root == 0) in TopologicalSort()
323 Q.push(Root); in TopologicalSort()
517 Node* Root = getNode("root"); in CheckCycles() local
518 if (Root == 0) in CheckCycles()
521 Q.push(Root); in CheckCycles()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | SelectionDAGISel.h | 91 virtual bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const;
97 static bool IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
253 virtual bool CheckComplexPattern(SDNode *Root, SDNode *Parent, SDValue N, in CheckComplexPattern() argument
|
| /external/e2fsprogs/tests/f_illitable/ |
| D | expect.1 | 17 Root inode is not a directory. Clear? yes
21 Root inode not allocated. Allocate? yes
|