/external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
SkPdfFDFTrailerDictionary_autogen.cpp | 11 SkPdfDictionary* SkPdfFDFTrailerDictionary::Root(SkPdfNativeDoc* doc) { 12 SkPdfNativeObject* ret = get("Root", ""); 20 return get("Root", "") != NULL;
|
SkPdfFileTrailerDictionary_autogen.cpp | 35 SkPdfDictionary* SkPdfFileTrailerDictionary::Root(SkPdfNativeDoc* doc) { 36 SkPdfNativeObject* ret = get("Root", ""); 44 return get("Root", "") != NULL;
|
/external/clang/include/clang/Rewrite/Core/ |
DeltaTree.h | 29 void *Root; // "DeltaTreeNode *"
|
RewriteRope.h | 162 void /*RopePieceBTreeNode*/ *Root; 170 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/lib/IR/ |
MDBuilder.cpp | 64 // To ensure uniqueness the root node is self-referential. 66 MDNode *Root = MDNode::get(Context, Dummy); 69 // !1 = metadata !{metadata !0} <- root 70 // Replace the dummy operand with the root node itself and delete the dummy. 71 Root->replaceOperandWith(0, Root); 74 // !1 = metadata !{metadata !1} <- self-referential root 75 return Root; 82 /// \brief Return metadata for a non-root TBAA node with the given name,
|
/external/chromium_org/build/android/pylib/device/ |
adb_wrapper.py | 377 def Root(self, timeout=_DEFAULT_TIMEOUT, retries=_DEFAULT_RETRIES): 378 """Restarts the adbd daemon with root permissions, if possible. 384 output = self._DeviceAdbCmd(['root'], timeout, retries) 386 raise device_errors.AdbCommandFailedError(['root'], output)
|
/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 | 24 : 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";
|
/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 | 219 const CXXRecordDecl *Root; 224 ASTFieldVisitor(const CXXRecordDecl *root, BugReporter &br, 226 : Root(root), BR(br), Checker(checker) {} 265 os << "AST class '" << Root->getName() << "' has a field '" 291 BR.EmitBasicReport(Root, Checker, "AST node allocates heap memory",
|
/external/clang/lib/Tooling/ |
JSONCompilationDatabase.cpp | 236 llvm::yaml::Node *Root = I->getRoot(); 237 if (!Root) { 241 llvm::yaml::SequenceNode *Array = dyn_cast<llvm::yaml::SequenceNode>(Root);
|
/external/llvm/include/llvm/Analysis/ |
CallGraph.h | 44 /// The CallGraph class also attempts to figure out what the root of the 83 /// \brief Root is root of the call graph, or the external node if a 'main' 85 CallGraphNode *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)); 765 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) { 766 if (Root) operator++(); // Advance to first element [all...] |
/external/llvm/include/llvm/Support/ |
YAMLParser.h | 460 /// \brief A YAML Stream is a sequence of Documents. A document contains a root 464 /// \brief Root for parsing a node. Returns a single node. 473 /// \brief Parse and return the root level node. 475 if (Root) 476 return Root; 477 return Root = parseBlockNode(); 493 /// \brief The root node. Used to support skipping a partially parsed 495 Node *Root;
|
/external/llvm/include/llvm/CodeGen/ |
SelectionDAG.h | 178 /// Root - The root of the entire DAG. 179 SDValue Root; 321 /// getRoot - Return the root tag of the SelectionDAG. 323 const SDValue &getRoot() const { return Root; } 331 /// setRoot - Set the current root tag of the SelectionDAG. 335 "DAG root value is not a chain!"); 338 Root = N; 341 return Root; 476 SDValue getEHLabel(SDLoc dl, SDValue Root, MCSymbol *Label) [all...] |
/external/llvm/lib/Transforms/Utils/ |
PromoteMemoryToRegister.cpp | 579 DomTreeNode *Root = DT.getRootNode(); 580 DomLevels[Root] = 0; 581 Worklist.push_back(Root); [all...] |
/external/llvm/utils/TableGen/ |
DAGISelMatcherGen.cpp | 213 // If this is the root of the dag we're matching, we emit a redundant opcode 328 // If this is at the root of the pattern, we emit a redundant 372 // If this node is not the root and the subtree underneath it produces a 374 // Beyond that, this means that we're also folding (at least) the root node 393 const TreePatternNode *Root = Pattern.getSrcPattern(); 394 if (N != Root) { // Not the root of the pattern. 395 // If there is a node between the root and this node, then we definitely 397 bool NeedCheck = !Root->hasChild(N); 399 // If it *is* an immediate child of the root, we can still need a check i [all...] |
AsmMatcherEmitter.cpp | 240 const ClassInfo *Root = this; 241 while (!Root->SuperClasses.empty()) 242 Root = Root->SuperClasses.front(); 248 return Root == RHSRoot; [all...] |
/external/clang/lib/Basic/ |
VirtualFileSystem.cpp | 478 std::vector<Entry *> Roots; ///< The root(s) of the virtual file system. 741 // Remove trailing slash(es), being careful not to remove the root path 782 bool parse(yaml::Node *Root, VFSFromYAML *FS) { 783 yaml::MappingNode *Top = dyn_cast<yaml::MappingNode>(Root); 785 error(Root, "expected mapping node"); 878 yaml::Node *Root = DI->getRoot(); 879 if (DI == Stream.end() || !Root) { 880 SM.PrintMessage(SMLoc(), SourceMgr::DK_Error, "expected root node"); 887 if (!P.parse(Root, FS.get())) [all...] |