/external/clang/include/clang/Rewrite/Core/ |
H A D | DeltaTree.h | 27 void *Root; // "DeltaTreeNode *" member in class:clang::DeltaTree
|
H A D | RewriteRope.h | 155 void /*RopePieceBTreeNode*/ *Root; member in class:clang::RopePieceBTree 163 iterator begin() const { return iterator(Root); }
|
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/namespace.qual/ |
H A 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/CodeGen/ |
H A D | CodeGenTBAA.h | 52 llvm::MDNode *Root; member in class:clang::CodeGen::CodeGenTBAA
|
/external/clang/test/CodeGenCXX/ |
H A D | derived-to-base-conv.cpp | 46 struct Root { struct 52 struct Base : Root {
|
/external/llvm/lib/Support/ |
H A D | IntervalMap.cpp | 19 void Path::replaceRoot(void *Root, unsigned Size, IdxPair Offsets) { argument 21 path.front() = Entry(Root, Size, Offsets.first);
|
/external/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 32 Record Root; member in class:__anon4864::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("; 137 OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n"; 138 OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n"; 141 OS << "#ifndef " << macroName(Root [all...] |
/external/llvm/include/llvm/ |
H A D | MDBuilder.h | 104 MDNode *Root = MDNode::get(Context, Dummy); local 109 Root->replaceOperandWith(0, Root); 113 return Root;
|
/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraph.cpp | 30 // Root is root of the call graph, or the external node if a 'main' function 33 CallGraphNode *Root; member in class:__anon9188::BasicCallGraph 45 BasicCallGraph() : ModulePass(ID), Root(0), 56 Root = 0; 63 if (Root == 0) Root = ExternalCallingNode; 73 OS << "CallGraph Root is: "; 103 CallGraphNode *getRoot() { return Root; } 104 const CallGraphNode *getRoot() const { return Root; } 123 if (Root) // Foun [all...] |
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 44 CallGraphNode *Root; member in class:clang::CallGraph 46 /// The list of nodes that have no parent. These are unreachable from Root. 87 CallGraphNode *getRoot() const { return Root; }
|
/external/clang/lib/Rewrite/Core/ |
H A D | DeltaTree.cpp | 386 static DeltaTreeNode *getRoot(void *Root) { argument 387 return (DeltaTreeNode*)Root; 391 Root = new DeltaTreeNode(); 395 assert(getRoot(RHS.Root)->getNumValuesUsed() == 0 && 397 Root = new DeltaTreeNode(); 401 getRoot(Root)->Destroy(); 408 const DeltaTreeNode *Node = getRoot(Root); 456 DeltaTreeNode *MyRoot = getRoot(Root); 460 Root = MyRoot = new DeltaTreeInteriorNode(InsertRes);
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | LLVMConventionsChecker.cpp | 216 const CXXRecordDecl *Root; member in class:__anon3879::ASTFieldVisitor 220 : Root(root), BR(br) {} 260 os << "AST class '" << Root->getName() << "' has a field '" 286 BR.EmitBasicReport(Root, "AST node allocates heap memory", "LLVM Conventions",
|
/external/clang/lib/Tooling/ |
H A D | JSONCompilationDatabase.cpp | 205 llvm::yaml::Node *Root = I->getRoot(); local 206 if (Root == NULL) { 211 llvm::dyn_cast<llvm::yaml::SequenceNode>(Root);
|
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableMap.h | 72 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) { 278 TreeTy *Root; member in class:llvm::ImmutableMapRef [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionExpressions.h | 518 void visitAll(const SCEV *Root) { argument 519 push(Root); 561 void visitAll(const SCEV *Root, SV& Visitor) { argument 563 T.visitAll(Root);
|
/external/clang/lib/Lex/ |
H A D | HeaderSearch.cpp | 809 const DirectoryEntry *Root) { 841 if (Dir == Root) 808 hasModuleMap(StringRef FileName, const DirectoryEntry *Root) argument
|
/external/dropbear/libtommath/ |
H A D | bn.tex | 1571 \section{Root Finding}
|
/external/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGISel.h | 92 /// operand node N of U during instruction selection that starts at Root. 93 virtual bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const; 96 /// U can be folded during instruction selection that starts at Root. 99 static bool IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 223 virtual bool CheckComplexPattern(SDNode *Root, SDNode *Parent, SDValue N, argument
|
H A D | SelectionDAG.h | 147 /// Root - The root of the entire DAG. 148 SDValue Root; member in class:llvm::SelectionDAG 289 const SDValue &getRoot() const { return Root; } 304 Root = N; 307 return Root; 438 SDValue getEHLabel(DebugLoc dl, SDValue Root, MCSymbol *Label);
|
/external/llvm/include/llvm/Support/ |
H A D | YAMLParser.h | 466 /// @brief Root for parsing a node. Returns a single node. 477 if (Root) 478 return Root; 479 return Root = parseBlockNode(); 495 Node *Root; member in class:llvm::yaml::Document
|
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcherGen.cpp | 353 const TreePatternNode *Root = Pattern.getSrcPattern(); local 354 if (N != Root) { // Not the root of the pattern. 357 bool NeedCheck = !Root->hasChild(N); 364 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); 366 Root->getOperator() == CGP.get_intrinsic_void_sdnode() || 367 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() || 368 Root->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
|
/external/llvm/utils/yaml2obj/ |
H A D | yaml2obj.cpp | 670 yaml::MappingNode *Root = dyn_cast<yaml::MappingNode>(D.getRoot()); local 671 if (!Root) { 672 YS.printError(D.getRoot(), "Root node must be a map"); 675 for (yaml::MappingNode::iterator i = Root->begin(), e = Root->end();
|
/external/llvm/lib/CodeGen/ |
H A D | LiveIntervalAnalysis.cpp | 532 unsigned Root = *Roots; local 533 if (!MRI->reg_empty(Root)) 534 LRCalc->createDeadDefs(LI, Root); 535 for (MCSuperRegIterator Supers(Root, TRI); Supers.isValid(); ++Supers) { 544 unsigned Root = *Roots; local 545 if (!isReserved(Root) && !MRI->reg_empty(Root)) 546 LRCalc->extendToUses(LI, Root); 547 for (MCSuperRegIterator Supers(Root, TRI); Supers.isValid(); ++Supers) {
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXISelLowering.cpp | 924 SDValue Root = DAG.getRoot(); local 976 SDValue p = DAG.getLoad(ObjectVT, dl, Root, Arg,
|
/external/llvm/lib/Transforms/Utils/ |
H A D | PromoteMemoryToRegister.cpp | 494 DomTreeNode *Root = DT.getRootNode(); local 495 DomLevels[Root] = 0; 496 Worklist.push_back(Root); 775 DomTreeNode *Root = RootPair.first; local 778 // Walk all dominator tree children of Root, inspecting their CFG edges with 780 // most Root's level are added to the iterated dominance frontier of the 784 Worklist.push_back(Root);
|