/freebsd-10.0-release/contrib/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) { 283 TreeTy *Root; member in class:llvm::ImmutableMapRef [all...] |
H A D | ImmutableSet.h | 660 inline ImutAVLTreeGenericIterator(const TreeTy* Root) { argument 661 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root)); 770 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) { argument 771 if (Root) operator++(); // Advance to first element. 938 TreeTy *Root; member in class:llvm::ImmutableSet 945 explicit ImmutableSet(TreeTy* R) : Root(R) { 946 if (Root) { Root 1114 TreeTy *Root; member in class:llvm::ImmutableSetRef [all...] |
/freebsd-10.0-release/contrib/llvm/tools/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 32 Record Root; member in class:__anon3467::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...] |
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Rewrite/Core/ |
H A D | DeltaTree.h | 29 void *Root; // "DeltaTreeNode *" member in class:clang::DeltaTree
|
H A D | RewriteRope.h | 156 void /*RopePieceBTreeNode*/ *Root; member in class:clang::RopePieceBTree 164 iterator begin() const { return iterator(Root); }
|
/freebsd-10.0-release/contrib/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:__anon2084::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...] |
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Rewrite/Core/ |
H A D | RewriteRope.cpp | 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), RH [all...] |
H A D | DeltaTree.cpp | 383 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);
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Tooling/ |
H A D | FileMatchTrie.h | 81 FileMatchTrieNode *Root; member in class:clang::tooling::FileMatchTrie
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 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);
|
H A D | JSONCompilationDatabase.cpp | 237 llvm::yaml::Node *Root = I->getRoot(); local 238 if (Root == NULL) { 242 llvm::yaml::SequenceNode *Array = dyn_cast<llvm::yaml::SequenceNode>(Root);
|
/freebsd-10.0-release/sys/contrib/dev/acpica/components/disassembler/ |
H A D | dmdeferred.c | 69 * PARAMETERS: Root - Root of the parse tree 79 ACPI_PARSE_OBJECT *Root) 82 ACPI_PARSE_OBJECT *Op = Root; 96 Op = AcpiPsGetDepthNext (Root, Op); 137 Op = AcpiPsGetDepthNext (Root, Op); 148 * PARAMETERS: Op - Root Op of the deferred opcode 78 AcpiDmParseDeferredOps( ACPI_PARSE_OBJECT *Root) argument
|
/freebsd-10.0-release/contrib/llvm/include/llvm/IR/ |
H A D | MDBuilder.h | 105 MDNode *Root = MDNode::get(Context, Dummy); local 110 Root->replaceOperandWith(0, Root); 114 return Root;
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 105 Root = getOrInsertNode(0); 166 // Make Root node a parent of all functions to make sure all are reachable. 168 Root->addCallee(Node, this); 183 if (N == Root) 191 assert(*CI != Root && "No one can call the root node.");
|
H A D | ThreadSafety.cpp | 318 unsigned Root = makeDot(ND, false); local 320 NodeVec[Root].setArrow(ImplicitDeref > 0); 321 NodeVec[Root].setSize(Sz + 1); 347 unsigned Root = makeMCall(NumCallArgs, CMCE->getMethodDecl()); local 353 NodeVec[Root].setSize(Sz + 1); 378 unsigned Root = makeCall(NumCallArgs, 0); local 384 NodeVec[Root].setSize(Sz+1); 387 unsigned Root = makeBinary(); local 390 NodeVec[Root].setSize(Sz); 405 unsigned Root local 414 unsigned Root = makeUnary(); local 420 unsigned Root = makeIndex(); local 427 unsigned Root = makeUnknown(3); local 434 unsigned Root = makeUnknown(3); local [all...] |
/freebsd-10.0-release/sys/contrib/dev/acpica/components/debugger/ |
H A D | dbutils.c | 62 ACPI_PARSE_OBJECT *Root); 398 * PARAMETERS: Root - Root of the parse tree 409 ACPI_PARSE_OBJECT *Root) 411 ACPI_PARSE_OBJECT *Op = Root; 481 Op = AcpiPsGetDepthNext (Root, Op); 408 AcpiDbSecondPassParse( ACPI_PARSE_OBJECT *Root) argument
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | DominatorInternals.h | 231 typename GraphT::NodeType* Root = DT.Vertex[1]; 234 DT.IDoms[V] = Root; 252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : 0; 254 DT.DomTreeNodes[Root] = DT.RootNode = 255 new DomTreeNodeBase<typename GraphT::NodeType>(Root, 0);
|
/freebsd-10.0-release/contrib/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);
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | CodeGenTBAA.cpp | 36 MDHelper(VMContext), Root(0), Char(0) { 47 if (!Root) 48 Root = MDHelper.createTBAARoot("Simple C/C++ TBAA"); 50 return Root;
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | LLVMConventionsChecker.cpp | 217 const CXXRecordDecl *Root; member in class:__anon3369::ASTFieldVisitor 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",
|
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGISel.h | 94 /// operand node N of U during instruction selection that starts at Root. 95 virtual bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const; 98 /// U can be folded during instruction selection that starts at Root. 101 static bool IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 225 virtual bool CheckComplexPattern(SDNode *Root, SDNode *Parent, SDValue N, argument
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Support/ |
H A D | YAMLParser.h | 462 /// @brief Root for parsing a node. Returns a single node. 473 if (Root) 474 return Root; 475 return Root = parseBlockNode(); 491 Node *Root; member in class:llvm::yaml::Document
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 43 CallGraphNode *Root; member in class:clang::CallGraph 81 CallGraphNode *getRoot() const { return Root; }
|
/freebsd-10.0-release/contrib/llvm/utils/TableGen/ |
H A D | DAGISelMatcherGen.cpp | 363 const TreePatternNode *Root = Pattern.getSrcPattern(); local 364 if (N != Root) { // Not the root of the pattern. 367 bool NeedCheck = !Root->hasChild(N); 374 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); 376 Root->getOperator() == CGP.get_intrinsic_void_sdnode() || 377 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() || 378 Root->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | LiveIntervalAnalysis.cpp | 232 unsigned Root = *Roots; local 233 if (!MRI->reg_empty(Root)) 234 LRCalc->createDeadDefs(LI, Root); 235 for (MCSuperRegIterator Supers(Root, TRI); Supers.isValid(); ++Supers) { 244 unsigned Root = *Roots; local 245 if (!MRI->isReserved(Root) && !MRI->reg_empty(Root)) 246 LRCalc->extendToUses(LI, Root); 247 for (MCSuperRegIterator Supers(Root, TRI); Supers.isValid(); ++Supers) {
|