| /external/clang/include/clang/Rewrite/Core/ |
| DeltaTree.h | 29 void *Root; // "DeltaTreeNode *"
|
| RewriteRope.h | 156 void /*RopePieceBTreeNode*/ *Root;
164 iterator begin() const { return iterator(Root); }
|
| /external/chromium_org/net/quic/congestion_control/ |
| 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/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/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/clang/test/CodeGenCXX/ |
| derived-to-base-conv.cpp | 46 struct Root {
52 struct Base : Root {
|
| /external/clang/lib/CodeGen/ |
| CodeGenTBAA.h | 71 llvm::MDNode *Root;
74 /// getRoot - This is the mdnode for the root of the metadata type graph
|
| /external/llvm/include/llvm/IR/ |
| MDBuilder.h | 99 /// \brief Return metadata appropriate for a TBAA root node. Each returned
103 // To ensure uniqueness the root node is self-referential.
105 MDNode *Root = MDNode::get(Context, Dummy);
108 // !1 = metadata !{metadata !0} <- root
109 // Replace the dummy operand with the root node itself and delete the dummy.
110 Root->replaceOperandWith(0, Root);
113 // !1 = metadata !{metadata !1} <- self-referential root
114 return Root;
117 /// \brief Return metadata appropriate for a TBAA root node with the give
[all...] |
| /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...] |
| /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/tools/preload/ |
| Root.java | 36 * Root of our data model.
38 public class Root implements Serializable {
149 * Reads Root from a file.
151 static Root fromFile(String fileName)
157 Root root = (Root) oin.readObject(); local
161 return root;
|
| /external/clang/include/clang/Analysis/ |
| CallGraph.h | 13 // current translation unit. The graph has a "virtual" root node that contains
42 /// This is a virtual root node that has edges to all the functions.
43 CallGraphNode *Root;
79 /// \ brief Get the virtual root of the graph, all the functions available
81 CallGraphNode *getRoot() const { return Root; }
96 /// declarations to collect the root functions.
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| LLVMConventionsChecker.cpp | 217 const CXXRecordDecl *Root;
220 ASTFieldVisitor(const CXXRecordDecl *root, BugReporter &br)
221 : Root(root), BR(br) {}
261 os << "AST class '" << Root->getName() << "' has a field '"
287 BR.EmitBasicReport(Root, "AST node allocates heap memory", "LLVM Conventions",
|
| /external/clang/lib/Tooling/ |
| JSONCompilationDatabase.cpp | 237 llvm::yaml::Node *Root = I->getRoot();
238 if (Root == NULL) {
242 llvm::yaml::SequenceNode *Array = dyn_cast<llvm::yaml::SequenceNode>(Root);
|
| /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/llvm/include/llvm/Support/ |
| YAMLParser.h | 458 /// @brief A YAML Stream is a sequence of Documents. A document contains a root
462 /// @brief Root for parsing a node. Returns a single node.
471 /// @brief Parse and return the root level node.
473 if (Root)
474 return Root;
475 return Root = parseBlockNode();
489 /// @brief The root node. Used to support skipping a partially parsed
491 Node *Root;
|
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAG.h | 141 /// Root - The root of the entire DAG.
142 SDValue Root;
280 /// getRoot - Return the root tag of the SelectionDAG.
282 const SDValue &getRoot() const { return Root; }
290 /// setRoot - Set the current root tag of the SelectionDAG.
294 "DAG root value is not a chain!");
297 Root = N;
300 return Root;
431 SDValue getEHLabel(SDLoc dl, SDValue Root, MCSymbol *Label)
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherGen.cpp | 203 // If this is the root of the dag we're matching, we emit a redundant opcode
298 // If this is at the root of the pattern, we emit a redundant
342 // If this node is not the root and the subtree underneath it produces a
344 // Beyond that, this means that we're also folding (at least) the root node
363 const TreePatternNode *Root = Pattern.getSrcPattern();
364 if (N != Root) { // Not the root of the pattern.
365 // If there is a node between the root and this node, then we definitely
367 bool NeedCheck = !Root->hasChild(N);
369 // If it *is* an immediate child of the root, we can still need a check i
[all...] |
| AsmMatcherEmitter.cpp | 231 const ClassInfo *Root = this;
232 while (!Root->SuperClasses.empty())
233 Root = Root->SuperClasses.front();
239 return Root == RHSRoot;
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 648 DomTreeNode *Root = DT.getRootNode();
649 DomLevels[Root] = 0;
650 Worklist.push_back(Root);
[all...] |
| /frameworks/base/core/java/android/provider/ |
| DocumentsContract.java | 66 // content://com.example/root/
67 // content://com.example/root/sdcard/
68 // content://com.example/root/sdcard/recent/
69 // content://com.example/root/sdcard/search/?query=pony
300 * Constants related to a root of documents, including {@link Cursor} column
301 * names and flags. A root is the start of a tree of documents, such as a
302 * physical storage device, or an account. Each root starts at the directory
303 * referenced by {@link Root#COLUMN_DOCUMENT_ID}, which can recursively
308 public final static class Root {
309 private Root() {
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| TimelineModel.js | 50 Root: "Root",
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXISelLowering.cpp | [all...] |
