| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/namespace.qual/ |
| p3.cpp | 6 namespace Root {
12 using namespace Root;
16 using namespace Root;
30 using Root::i;
31 using Root::f;
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableMap.h | 72 TreeTy* Root;
75 /// Constructs a map from a pointer to a tree root. In general one
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)
[all...] |
| ImmutableSet.h | 266 // Mutating operations. A tree root can be manipulated as
456 // in an existing root if that root is still marked mutable.
597 /// markImmutable - Clears the mutable bits of a root and all of its
660 inline ImutAVLTreeGenericIterator(const TreeTy* Root) {
661 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
770 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) {
771 if (Root) operator++(); // Advance to first element
[all...] |
| /external/chromium_org/net/quic/congestion_control/ |
| cube_root.h | 15 // Calculates the cube root using a table lookup followed by one Newton-
17 static uint32 Root(uint64 a);
|
| cube_root_test.cc | 21 uint8 cube_root = CubeRoot::Root(cube);
31 uint32 cube_root = CubeRoot::Root(cube);
39 uint32 cube_root = CubeRoot::Root(cube);
|
| cube_root.cc | 59 // Calculate the cube root using a table lookup followed by one Newton-Raphson
61 uint32 CubeRoot::Root(uint64 a) {
76 uint64 root = ((cube_root_table[down_shifted_to_6bit] + 10) << cubic_shift) local
82 root = 2 * root + (a / (root * (root - 1)));
83 root = ((root * 341) >> 10); // Div by 3, biased low.
84 return static_cast<uint32>(root);
[all...] |
| /external/clang/include/clang/Rewrite/Core/ |
| DeltaTree.h | 29 void *Root; // "DeltaTreeNode *"
|
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 32 Record Root;
44 // the record's name plus the base suffix, but if it is the root node and
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"
[all...] |
| /frameworks/base/tools/preload/ |
| PrintPsTree.java | 38 Root root = (Root) oin.readObject(); local
40 for (Proc proc : root.processes.values()) {
|
| Android.mk | 16 Root.java \
|
| Compile.java | 39 Root root = new Root(); local
62 root.indexProcess(record);
66 root.indexClassOperation(record);
71 root.toFile(args[1]);
|
| WritePreloadedClassFile.java | 49 Root root = Root.fromFile(rootFile); local
52 for (LoadedClass loadedClass : root.loadedClasses.values()) {
80 for (LoadedClass loadedClass : root.loadedClasses.values()) {
98 for (Proc proc : root.processes.values()) {
118 addAllClassesFrom("zygote", root, toPreload);
130 root.toFile(rootFile);
133 private static void addAllClassesFrom(String processName, Root root,
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| 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>;
222 <prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.rulePostProcessing(root[0]);
231 <prevRuleRootRef()>.Tree := Root[0];<\n>
234 <prevRuleRootRef()>.Tree := Root[0];<\n>
323 rewriteEmptyAlt() ::= "Root[0] = null;"
325 rewriteTree(root,children,description,enclosingTreeLevel,treeLevel) ::= <
[all...] |
| ASTParser.stg | 37 * child, root
60 Adaptor.AddChild(Root[0], <label>_tree);
77 Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>;
109 // the code generator call matchSet then add root code or ruleroot code
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>
[all...] |
| ASTTreeParser.stg | 37 * child, root
72 /** match ^(root children) in tree parser; override here to
75 tree(root, actionsAfterRoot, children, nullableChildList,
82 Root[<treeLevel>] := Adaptor.GetNilNode as I<ASTLabelType>;<\n>
84 <root:element()>
87 <if(root.el.rule)>
88 if (_First[<enclosingTreeLevel>] = nil) then _First[<enclosingTreeLevel>] := <root.el.label>.Tree;
90 if (_First[<enclosingTreeLevel>] = nil) then _First[<enclosingTreeLevel>] := <root.el.label>;
107 Adaptor.AddChild(Root[<enclosingTreeLevel>], Root[<treeLevel>])
[all...] |
| /external/clang/test/CodeGenCXX/ |
| derived-to-base-conv.cpp | 46 struct Root {
52 struct Base : Root {
|
| /external/clang/include/clang/Tooling/ |
| FileMatchTrie.h | 41 /// /<project-root>/src/<path>/<somefile>.cc (used as input for the tool)
42 /// /<project-root>/build/<symlink-to-src>/<path>/<somefile>.cc (stored in DB)
81 FileMatchTrieNode *Root;
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraph.cpp | 30 // Root is root of the call graph, or the external node if a 'main' function
33 CallGraphNode *Root;
45 BasicCallGraph() : ModulePass(ID), Root(0),
56 Root = 0;
63 if (Root == 0) Root = ExternalCallingNode;
73 OS << "CallGraph Root is: ";
100 // getRoot - Return the root of the call graph, which is either main, or if
103 CallGraphNode *getRoot() { return Root; }
[all...] |
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/model/ |
| RootInfo.java | 28 import android.provider.DocumentsContract.Root;
41 * Representation of a {@link Root}.
131 final RootInfo root = new RootInfo();
132 DurableUtils.readFromParcel(in, root);
133 return root;
143 final RootInfo root = new RootInfo(); local
144 root.authority = authority;
145 root.rootId = getCursorString(cursor, Root.COLUMN_ROOT_ID);
146 root.flags = getCursorInt(cursor, Root.COLUMN_FLAGS)
217 final RootInfo root = (RootInfo) o; local
[all...] |
| /frameworks/base/packages/ExternalStorageProvider/src/com/android/externalstorage/ |
| ExternalStorageProvider.java | 29 import android.provider.DocumentsContract.Root;
48 // docId format: root:path/to/file
51 Root.COLUMN_ROOT_ID, Root.COLUMN_FLAGS, Root.COLUMN_ICON, Root.COLUMN_TITLE,
52 Root.COLUMN_DOCUMENT_ID, Root.COLUMN_AVAILABLE_BYTES,
88 final RootInfo root = new RootInfo(); local
89 root.rootId = rootId
203 final RootInfo root = mIdToRoot.get(rootId); local
[all...] |
| TestDocumentsProvider.java | 40 import android.provider.DocumentsContract.Root;
78 Root.COLUMN_ROOT_ID, Root.COLUMN_FLAGS, Root.COLUMN_ICON,
79 Root.COLUMN_TITLE, Root.COLUMN_SUMMARY, Root.COLUMN_DOCUMENT_ID,
80 Root.COLUMN_AVAILABLE_BYTES,
127 row.add(Root.COLUMN_ROOT_ID, MY_ROOT_ID);
128 row.add(Root.COLUMN_FLAGS, Root.FLAG_SUPPORTS_RECENTS)
[all...] |
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| DownloadStorageProvider.java | 35 import android.provider.DocumentsContract.Root;
55 Root.COLUMN_ROOT_ID, Root.COLUMN_FLAGS, Root.COLUMN_ICON,
56 Root.COLUMN_TITLE, Root.COLUMN_DOCUMENT_ID,
95 row.add(Root.COLUMN_ROOT_ID, DOC_ID_ROOT);
96 row.add(Root.COLUMN_FLAGS,
97 Root.FLAG_LOCAL_ONLY | Root.FLAG_SUPPORTS_RECENTS | Root.FLAG_SUPPORTS_CREATE)
[all...] |
| /external/clang/lib/Tooling/ |
| FileMatchTrie.cpp | 35 /// child nodes. The trie starts with an empty root node.
43 /// 'p'starts at the root node and does the following:
161 : 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/ |
| DeltaTree.cpp | 65 /// WidthFactor-1 K/V pairs (except the root) and may have at most
383 static DeltaTreeNode *getRoot(void *Root) {
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)
[all...] |
| RewriteRope.cpp | 79 /// the root, which may have less) and may have at most 2*WidthFactor
716 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), RHS)
[all...] |
