Searched refs:Root (Results 1 - 25 of 89) sorted by relevance

1234

/external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/namespace.qual/
H A Dp3.cpp6 namespace Root { namespace
12 using namespace Root;
16 using namespace Root;
30 using Root::i;
31 using Root::f;
/external/llvm/include/llvm/ADT/
H A DImmutableMap.h72 TreeTy* Root; member in class:llvm::ImmutableMap
79 explicit ImmutableMap(const TreeTy* R) : Root(const_cast<TreeTy*>(R)) {
80 if (Root) { Root->retain(); }
82 ImmutableMap(const ImmutableMap &X) : Root(X.Root) {
83 if (Root) { Root->retain(); }
86 if (Root != X.Root) {
284 TreeTy *Root; member in class:llvm::ImmutableMapRef
[all...]
H A DImmutableSet.h660 inline ImutAVLTreeGenericIterator(const TreeTy* Root) { argument
661 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
765 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) { argument
766 if (Root) operator++(); // Advance to first element.
945 TreeTy *Root; member in class:llvm::ImmutableSet
952 explicit ImmutableSet(TreeTy* R) : Root(R) {
953 if (Root) { Root
1122 TreeTy *Root; member in class:llvm::ImmutableSetRef
[all...]
/external/chromium_org/net/quic/congestion_control/
H A Dcube_root.h17 static uint32 Root(uint64 a);
H A Dcube_root_test.cc21 uint8 cube_root = CubeRoot::Root(cube);
31 uint32 cube_root = CubeRoot::Root(cube);
39 uint32 cube_root = CubeRoot::Root(cube);
H A Dcube_root.cc61 uint32 CubeRoot::Root(uint64 a) { function in class:net::CubeRoot
/external/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp32 Record Root; member in class:__anon19554::ClangASTNodesEmitter
47 if (&R == &Root && !BaseSuffix.empty())
58 : Records(R), Root(N, SMLoc(), R), BaseSuffix(S)
97 OS << "ABSTRACT_" << macroName(Root.getName()) << "(" << NodeName << "("
124 if (Base == &Root)
125 OS << "LAST_" << macroName(Root.getName()) << "_RANGE(";
127 OS << macroName(Root.getName()) << "_RANGE(";
139 OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n";
140 OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n";
143 OS << "#ifndef " << macroName(Root
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/
H A DAST.stg99 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[<enclosingTreeLeve
[all...]
H A DASTParser.stg60 Adaptor.AddChild(Root[0], <label>_tree);
77 Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>;
115 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <createNodeFromToken(...)>);})>
131 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<createNodeFromToken(...)>, Root[0]) as I<ASTLabelType>;})>
139 <if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <label>.Tree);
148 <if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<label>.Tree, Root[0]) as I<ASTLabelType>;
178 Adaptor.AddChild(Root[
[all...]
H A DASTTreeParser.stg82 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[<treeLeve
[all...]
/external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/pdfapi/
H A DSkPdfFDFTrailerDictionary_autogen.cpp11 SkPdfDictionary* SkPdfFDFTrailerDictionary::Root(SkPdfNativeDoc* doc) { function in class:SkPdfFDFTrailerDictionary
12 SkPdfNativeObject* ret = get("Root", "");
20 return get("Root", "") != NULL;
/external/clang/include/clang/Rewrite/Core/
H A DDeltaTree.h29 void *Root; // "DeltaTreeNode *" member in class:clang::DeltaTree
H A DRewriteRope.h162 void /*RopePieceBTreeNode*/ *Root; member in class:clang::RopePieceBTree
170 iterator begin() const { return iterator(Root); }
/external/skia/experimental/PdfViewer/pdfparser/native/pdfapi/
H A DSkPdfFDFTrailerDictionary_autogen.cpp11 SkPdfDictionary* SkPdfFDFTrailerDictionary::Root(SkPdfNativeDoc* doc) { function in class:SkPdfFDFTrailerDictionary
12 SkPdfNativeObject* ret = get("Root", "");
20 return get("Root", "") != NULL;
/external/clang/test/CodeGenCXX/
H A Dderived-to-base-conv.cpp46 struct Root { struct
52 struct Base : Root {
/external/clang/include/clang/Tooling/
H A DFileMatchTrie.h81 FileMatchTrieNode *Root; member in class:clang::tooling::FileMatchTrie
/external/llvm/lib/Analysis/IPA/
H A DCallGraph.cpp24 : M(M), Root(nullptr), ExternalCallingNode(getOrInsertFunction(nullptr)),
31 if (!Root)
32 Root = ExternalCallingNode;
61 if (Root) // Found multiple external mains? Don't pick one.
62 Root = ExternalCallingNode;
64 Root = Node; // Found a main, keep track of it!
94 OS << "CallGraph Root is: ";
95 if (Function *F = Root->getFunction())
98 OS << "<<null function: 0x" << Root << ">>\n"; local
/external/clang/lib/Tooling/
H A DFileMatchTrie.cpp161 : Root(new FileMatchTrieNode), Comparator(new DefaultPathComparator()) {}
164 : Root(new FileMatchTrieNode), Comparator(Comparator) {}
167 delete Root;
171 Root->insert(NewPath);
181 StringRef Result = Root->findEquivalent(*Comparator, FileName, IsAmbiguous);
/external/clang/lib/Rewrite/Core/
H A DDeltaTree.cpp383 static DeltaTreeNode *getRoot(void *Root) { argument
384 return (DeltaTreeNode*)Root;
388 Root = new DeltaTreeNode();
392 assert(getRoot(RHS.Root)->getNumValuesUsed() == 0 &&
394 Root = new DeltaTreeNode();
398 getRoot(Root)->Destroy();
405 const DeltaTreeNode *Node = getRoot(Root);
453 DeltaTreeNode *MyRoot = getRoot(Root);
457 Root = MyRoot = new DeltaTreeInteriorNode(InsertRes);
H A DRewriteRope.cpp716 Root = new RopePieceBTreeLeaf();
720 Root = new RopePieceBTreeLeaf();
723 getRoot(Root)->Destroy();
727 return getRoot(Root)->size();
731 if (RopePieceBTreeLeaf *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root)))
734 getRoot(Root)->Destroy();
735 Root = new RopePieceBTreeLeaf();
741 if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset))
742 Root = new RopePieceBTreeInterior(getRoot(Root), RH
[all...]
/external/chromium_org/tools/findit/common/
H A Dcacert.pem2 ## ca-bundle.crt -- Bundle of CA Root Certificates
54 GTE CyberTrust Global Root
204 GlobalSign Root CA
225 GlobalSign Root CA - R2
285 RSA Root Certificate 1
404 Baltimore CyberTrust Root
479 AddTrust Low-Value Services Root
503 AddTrust External Root
527 AddTrust Public Services Root
551 AddTrust Qualified Certificates Root
[all...]
/external/clang/lib/Analysis/
H A DCallGraph.cpp104 Root = getOrInsertNode(nullptr);
160 // Make Root node a parent of all functions to make sure all are reachable.
162 Root->addCallee(Node, this);
177 if (N == Root)
185 assert(*CI != Root && "No one can call the root node.");
/external/llvm/lib/IR/
H A DMDBuilder.cpp66 MDNode *Root = MDNode::get(Context, Dummy); local
71 Root->replaceOperandWith(0, Root);
75 return Root;
/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h231 typename GraphT::NodeType* Root = DT.Vertex[1];
234 DT.IDoms[V] = Root;
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : nullptr;
254 DT.DomTreeNodes[Root] = DT.RootNode =
255 new DomTreeNodeBase<typename GraphT::NodeType>(Root, nullptr);
/external/llvm/lib/Support/
H A DIntervalMap.cpp19 void Path::replaceRoot(void *Root, unsigned Size, IdxPair Offsets) { argument
21 path.front() = Entry(Root, Size, Offsets.first);

Completed in 612 milliseconds

1234