HomeSort by: relevance | last modified time | path
    Searched refs:Root (Results 1 - 25 of 175) sorted by relevancy

1 2 3 4 5 6 7

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
ImmutableMap.h 73 IntrusiveRefCntPtr<TreeTy> Root;
76 /// Constructs a map from a pointer to a tree root. In general one
80 explicit ImmutableMap(const TreeTy *R) : Root(const_cast<TreeTy *>(R)) {}
99 TreeTy *T = F.add(Old.Root.get(), std::pair<key_type, data_type>(K, D));
104 TreeTy *T = F.remove(Old.Root.get(), K);
114 return Root ? Root->contains(K) : false;
118 return Root && RHS.Root ? Root->isEqual(*RHS.Root.get()) : Root == RHS.Root
    [all...]
ImmutableSet.h 266 // Mutating operations. A tree root can be manipulated as
461 // in an existing root if that root is still marked mutable.
602 /// markImmutable - Clears the mutable bits of a root and all of its
670 ImutAVLTreeGenericIterator(const TreeTy *Root) {
671 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
782 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) {
783 if (Root)
    [all...]
  /src/external/bsd/libc++/dist/libcxxrt/test/
test_typeinfo.cc 12 struct Root
24 struct Sub1 : public Root
34 struct Virt1a : public virtual Root
40 struct Virt2a : public virtual Root
73 Root root; local
76 Root *b = &sub2;
77 Root *f = &sub2;
78 Root *s2 = &sub2;
79 Root *b2 = &root
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/dsymutil/
Reproducer.cpp 16 SmallString<128> Root;
18 Root.assign(Path);
19 EC = sys::fs::create_directory(Root);
21 EC = sys::fs::createUniqueDirectory("dsymutil", Root);
23 return EC ? "" : std::string(Root);
30 : Root(createReproducerDir(EC)), FC() {
31 if (!Root.empty())
32 FC = std::make_shared<FileCollector>(Root, Root);
40 SmallString<128> Mapping(Root);
    [all...]
Reproducer.h 39 createReproducer(ReproducerMode Mode, StringRef Root);
55 std::string Root;
66 ReproducerUse(StringRef Root, std::error_code &EC);
71 std::string Root;
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUInstructionSelector.h 154 std::pair<Register, unsigned> selectVOP3ModsImpl(MachineOperand &Root,
158 selectVCSRC(MachineOperand &Root) const;
161 selectVSRC0(MachineOperand &Root) const;
164 selectVOP3Mods0(MachineOperand &Root) const;
166 selectVOP3BMods0(MachineOperand &Root) const;
168 selectVOP3OMods(MachineOperand &Root) const;
170 selectVOP3Mods(MachineOperand &Root) const;
172 selectVOP3BMods(MachineOperand &Root) const;
174 ComplexRendererFns selectVOP3NoMods(MachineOperand &Root) const;
177 selectVOP3Mods_nnan(MachineOperand &Root) const
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
InterpBlock.cpp 63 DeadBlock::DeadBlock(DeadBlock *&Root, Block *Blk)
64 : Root(Root), B(Blk->Desc, Blk->IsStatic, Blk->IsExtern, /*isDead=*/true) {
66 if (Root)
67 Root->Prev = this;
69 Next = Root;
71 Root = this;
84 if (Root == this)
85 Root = Next;
  /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/
NVPTXPeephole.cpp 73 static bool isCVTAToLocalCombinationCandidate(MachineInstr &Root) {
74 auto &MBB = *Root.getParent();
77 if (Root.getOpcode() != NVPTX::cvta_to_local_yes_64 &&
78 Root.getOpcode() != NVPTX::cvta_to_local_yes)
81 auto &Op = Root.getOperand(1);
104 static void CombineCVTAToLocal(MachineInstr &Root) {
105 auto &MBB = *Root.getParent();
109 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg());
112 BuildMI(MF, Root.getDebugLoc(), TII->get(Prev.getOpcode()),
113 Root.getOperand(0).getReg()
    [all...]
  /src/external/gpl2/xcvs/dist/contrib/
newcvsroot.sh 44 cp /tmp/$prog$$ "$dir"/Root
  /src/games/warp/
object.h 15 #define Root 0
43 OBJECT root = {0, 0, 0, 0, &root, &root, 0, 0, 0, Root, '?', 0, 0}; variable
45 EXT OBJECT root; variable
49 OBJECT free_root = {0, 0, 0, 0, &free_root, &free_root, 0, 0, 0, Root, '?', 0, 0};
  /src/usr.sbin/sysinst/arch/hppa/
msg.md.de 55 {Die Root-Partition �berschreitet die PDC Grenze von 2GB}
  /src/external/apache2/llvm/dist/clang/include/clang/Rewrite/Core/
DeltaTree.h 26 void *Root; // "DeltaTreeNode *"
  /src/external/apache2/llvm/dist/clang/lib/IndexSerialization/
SerializablePathCollection.cpp 22 size_t PathPool::addFilePath(RootDirKind Root,
25 FilePaths.emplace_back(DirPath(Root, Dir), Paths.add(Filename));
55 Paths.addFilePath(Dir.Root, Dir.Path, sys::path::filename(FE.getName()));
72 PathPool::RootDirKind Root = PathPool::RootDirKind::Regular;
75 Root = PathPool::RootDirKind::SysRoot;
79 Root = PathPool::RootDirKind::CurrentWorkDir;
83 if (Root != PathPool::RootDirKind::Regular) {
88 PathPool::DirPath Result(Root, Paths.addDirPath(Dir));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
InstructionSelector.cpp 46 const MachineOperand &Root, const MachineRegisterInfo &MRI) const {
47 if (!Root.isReg())
50 MachineInstr *RootI = MRI.getVRegDef(Root.getReg());
  /src/external/apache2/llvm/dist/clang/include/clang/IndexSerialization/
SerializablePathCollection.h 46 /// Special root directory of a filesystem path.
54 RootDirKind Root;
57 DirPath(RootDirKind Root, const StringPool::StringOffsetSize &Path)
58 : Root(Root), Path(Path) {}
70 size_t addFilePath(RootDirKind Root, const StringPool::StringOffsetSize &Dir,
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
ClangASTNodesEmitter.cpp 37 ASTNode Root;
52 assert(Root && "root node not yet derived!");
54 MacroHierarchyName = macroName(std::string(Root.getName()));
59 // the record's name plus the base suffix, but if it is the root node and
62 if (node == Root && !BaseSuffix.empty())
133 if (Base == Root)
145 assert(!Root && "already computed tree");
156 else if (Root)
158 Twine("multiple root nodes in \"") + NodeClassNam
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Rewrite/
RewriteRope.cpp 82 /// the root, which may have less) and may have at most 2*WidthFactor
722 Root = new RopePieceBTreeLeaf();
727 Root = new RopePieceBTreeLeaf();
731 getRoot(Root)->Destroy();
735 return getRoot(Root)->size();
739 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root)))
742 getRoot(Root)->Destroy();
743 Root = new RopePieceBTreeLeaf();
749 if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset))
750 Root = new RopePieceBTreeInterior(getRoot(Root), RHS)
    [all...]
DeltaTree.cpp 67 /// WidthFactor-1 K/V pairs (except the root) and may have at most
386 static DeltaTreeNode *getRoot(void *Root) {
387 return (DeltaTreeNode*)Root;
391 Root = new DeltaTreeNode();
396 assert(getRoot(RHS.Root)->getNumValuesUsed() == 0 &&
398 Root = new DeltaTreeNode();
402 getRoot(Root)->Destroy();
409 const DeltaTreeNode *Node = getRoot(Root);
457 DeltaTreeNode *MyRoot = getRoot(Root);
461 Root = new DeltaTreeInteriorNode(InsertRes)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/
FileMatchTrie.h 40 /// /<project-root>/src/<path>/<somefile>.cc (used as input for the tool)
41 /// /<project-root>/build/<symlink-to-src>/<path>/<somefile>.cc (stored in DB)
81 FileMatchTrieNode *Root;
  /src/sys/external/bsd/acpica/dist/disassembler/
dmdeferred.c 68 * PARAMETERS: Root - Root of the parse tree
78 ACPI_PARSE_OBJECT *Root)
81 ACPI_PARSE_OBJECT *Op = Root;
95 Op = AcpiPsGetDepthNext (Root, Op);
137 Op = AcpiPsGetDepthNext (Root, Op);
148 * PARAMETERS: Op - Root Op of the deferred opcode
  /src/external/apache2/llvm/dist/clang/lib/Tooling/
FileMatchTrie.cpp 42 /// child nodes. The trie starts with an empty root node.
50 /// 'p'starts at the root node and does the following:
130 // If `ConsumedLength` is zero, this is the root and we have no filename
183 : Root(new FileMatchTrieNode), Comparator(new DefaultPathComparator()) {}
186 : Root(new FileMatchTrieNode), Comparator(Comparator) {}
189 delete Root;
193 Root->insert(NewPath);
203 StringRef Result = Root->findEquivalent(*Comparator, FileName, IsAmbiguous);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
ProfiledCallGraph.h 83 iterator begin() { return Root.Callees.begin(); }
84 iterator end() { return Root.Callees.end(); }
85 ProfiledCallGraphNode *getEntryNode() { return &Root; }
88 // Link to synthetic root to make sure every node is reachable
89 // from root. This does not affect SCC order.
91 Root.Callees.insert(&ProfiledFunctions[Name]);
124 ProfiledCallGraphNode Root;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
SuffixTree.cpp 20 Root = insertInternalNode(nullptr, EmptyIdx, EmptyIdx, 0);
21 Active.Node = Root;
37 assert(Root && "Root node can't be nullptr!");
59 "Non-root internal nodes must have parents!");
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root);
76 SuffixTreeNode *CurrNode = Root;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopNestAnalysis.h 29 /// Construct a loop nest rooted by loop \p Root.
30 LoopNest(Loop &Root, ScalarEvolution &SE);
36 static std::unique_ptr<LoopNest> getLoopNest(Loop &Root, ScalarEvolution &SE);
52 /// Return the maximum nesting depth of the loop nest rooted by loop \p Root.
55 /// for(i) // loop at level 1 and Root of the nest
61 static unsigned getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE);
118 /// for(i) // loop at level 1 and Root of the nest
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
ComputeReplacements.cpp 19 void enumerateTokenSpans(const syntax::Tree *Root, ProcessTokensFn Callback) {
25 void run(const syntax::Tree *Root) {
26 process(Root);
62 return Enumerator(Callback).run(Root);

Completed in 85 milliseconds

1 2 3 4 5 6 7