HomeSort by relevance Sort by last modified time
    Searched refs:Root (Results 51 - 75 of 170) sorted by null

1 23 4 5 6 7

  /external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h 218 // If V is a non-root vertex and sdom(V) = parent(V), then idom(V) is
230 typename GraphT::NodeType* Root = DT.Vertex[1];
233 DT.IDoms[V] = Root;
247 // Add a node for the root. This node might be the actual root, if there is
251 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : nullptr;
254 (DT.DomTreeNodes[Root] =
256 Root, nullptr)).get();
YAMLParser.h 491 /// \brief A YAML Stream is a sequence of Documents. A document contains a root
495 /// \brief Root for parsing a node. Returns a single node.
504 /// \brief Parse and return the root level node.
506 if (Root)
507 return Root;
508 return Root = parseBlockNode();
524 /// \brief The root node. Used to support skipping a partially parsed
526 Node *Root;
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/cacerts/
cacerts.txt 2 ## boto/cacerts/cacerts.txt -- Bundle of CA Root Certificates
7 ## (CA). These were automatically extracted from Mozilla's root certificates
21 GTE CyberTrust Global Root
131 GlobalSign Root CA
152 GlobalSign Root CA - R2
212 RSA Root Certificate 1
330 Baltimore CyberTrust Root
385 AddTrust Low-Value Services Root
409 AddTrust External Root
433 AddTrust Public Services Root
    [all...]
  /external/vboot_reference/utility/
eficompress.c 229 IN INT32 Root
1133 UINT32 i, k, Flags, Root, Pos, Size;
1136 Root = MakeTree(NC, mCFreq, mCLen, mCCode);
1137 Size = mCFreq[Root];
1139 if (Root >= NC) {
1141 Root = MakeTree(NT, mTFreq, mPTLen, mPTCode);
1142 if (Root >= NT) {
1146 PutBits(TBIT, Root);
1153 PutBits(CBIT, Root);
1155 Root = MakeTree(NP, mPFreq, mPTLen, mPTCode)
    [all...]
  /external/llvm/lib/CodeGen/
TargetInstrInfo.cpp 621 // C = B op Y (Root)
638 MachineInstr &Root,
642 if (isReassociationCandidate(Root, Commute)) {
663 MachineInstr &Root, MachineInstr &Prev,
668 MachineFunction *MF = Root.getParent()->getParent();
672 const TargetRegisterClass *RC = Root.getRegClassConstraint(0, TII, TRI);
694 MachineOperand &OpB = Root.getOperand(OpIdx[Row][1]);
696 MachineOperand &OpY = Root.getOperand(OpIdx[Row][3]);
697 MachineOperand &OpC = Root.getOperand(0);
722 unsigned Opcode = Root.getOpcode()
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp 105 void getBlockTraversalOrder(BasicBlock *Root, ValueVect &Order);
159 Root = 0x01,
174 if (Flags & Root)
201 if (GN.Flags & GepNode::Root) {
202 OS << "root";
218 if (GN.Flags & GepNode::Root)
297 void HexagonCommonGEP::getBlockTraversalOrder(BasicBlock *Root,
303 Order.push_back(Root);
304 DomTreeNode *DTN = DT->getNode(Root);
331 N->Flags |= GepNode::Root;
    [all...]
  /external/llvm/lib/Support/
IntervalMap.cpp 19 void Path::replaceRoot(void *Root, unsigned Size, IdxPair Offsets) {
20 assert(!path.empty() && "Can't replace missing root");
21 path.front() = Entry(Root, Size, Offsets.first);
26 // The root has no siblings.
49 assert(Level != 0 && "Cannot move the root node");
76 // The root has no siblings.
99 assert(Level != 0 && "Cannot move the root node");
  /frameworks/base/tools/preload/
PrintHtmlDiff.java 36 Root root = Root.fromFile(args[0]); local
43 for (Proc proc : root.processes.values()) {
55 for (LoadedClass loadedClass : root.loadedClasses.values()) {
64 LoadedClass clazz = root.loadedClasses.get(line);
81 printTable(out, root.baseline, added);
83 printTable(out, root.baseline, removed);
MemoryUsage.java 289 Root root = Root.fromFile(args[0]); local
290 root.baseline = baseline();
291 for (LoadedClass loadedClass : root.loadedClasses.values()) {
296 root.toFile(args[0]);
  /system/core/libmemunreachable/
HeapWalker.cpp 73 void HeapWalker::RecurseRoot(const Range& root) {
74 allocator::vector<Range> to_do(1, root, allocator_);
88 void HeapWalker::Root(uintptr_t begin, uintptr_t end) {
92 void HeapWalker::Root(const allocator::vector<uintptr_t>& vals) {
  /external/clang/lib/CodeGen/
CodeGenTBAA.cpp 36 MDHelper(VMContext), Root(nullptr), Char(nullptr) {
43 // Define the root of the tree. This identifies the tree, so that
47 if (!Root)
48 Root = MDHelper.createTBAARoot("Simple C/C++ TBAA");
50 return Root;
61 // Define the root of the tree for user-accessible memory. C and C++
CodeGenTBAA.h 71 llvm::MDNode *Root;
74 /// getRoot - This is the mdnode for the root of the metadata type graph
  /external/llvm/include/llvm/CodeGen/
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,
157 OPFL_Variadic0 = 1<<4, // Node is variadic, root has 0 fixed inputs.
158 OPFL_Variadic1 = 2<<4, // Node is variadic, root has 1 fixed inputs.
159 OPFL_Variadic2 = 3<<4, // Node is variadic, root has 2 fixed inputs.
160 OPFL_Variadic3 = 4<<4, // Node is variadic, root has 3 fixed inputs.
161 OPFL_Variadic4 = 5<<4, // Node is variadic, root has 4 fixed inputs.
162 OPFL_Variadic5 = 6<<4, // Node is variadic, root has 5 fixed inputs
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64InstrInfo.cpp     [all...]
AArch64InstrInfo.h 167 /// for an instruction chain ending in <Root>. All potential patterns are
169 bool getMachineCombinerPatterns(MachineInstr &Root,
176 MachineInstr &Root, MachineCombinerPattern Pattern,
  /system/core/libmemunreachable/tests/
HeapWalker_test.cpp 112 heap_walker.Root(buffer_begin(buffer1), buffer_end(buffer1));
140 heap_walker.Root(buffer_begin(buffer1) + i, buffer_end(buffer1) - j);
189 heap_walker.Root(buffer_begin(buffer2), buffer_end(buffer2));
  /frameworks/base/packages/MtpDocumentsProvider/tests/src/com/android/mtp/
MtpDocumentsProviderTest.java 27 import android.provider.DocumentsContract.Root;
148 DocumentsContract.Root.COLUMN_TITLE,
149 DocumentsContract.Root.COLUMN_DOCUMENT_ID
213 assertEquals(Root.FLAG_SUPPORTS_IS_CHILD | Root.FLAG_SUPPORTS_CREATE, cursor.getInt(1));
228 assertEquals(Root.FLAG_SUPPORTS_IS_CHILD, cursor.getInt(1));
274 assertEquals(Root.FLAG_SUPPORTS_IS_CHILD | Root.FLAG_SUPPORTS_CREATE, cursor.getInt(1));
282 assertEquals(Root.FLAG_SUPPORTS_IS_CHILD | Root.FLAG_SUPPORTS_CREATE, cursor.getInt(1))
    [all...]
  /frameworks/base/packages/MtpDocumentsProvider/src/com/android/mtp/
MtpDocumentsProvider.java 38 import android.provider.DocumentsContract.Root;
66 Root.COLUMN_ROOT_ID, Root.COLUMN_FLAGS, Root.COLUMN_ICON,
67 Root.COLUMN_TITLE, Root.COLUMN_DOCUMENT_ID,
68 Root.COLUMN_AVAILABLE_BYTES,
436 // root scanner resumes.
472 * Resumes root scanner to handle the update of device list.
  /external/clang/lib/Tooling/
JSONCompilationDatabase.cpp 245 llvm::yaml::Node *Root = I->getRoot();
246 if (!Root) {
250 llvm::yaml::SequenceNode *Array = dyn_cast<llvm::yaml::SequenceNode>(Root);
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
Antlr.Runtime.Tree.Tests.pas 221 Root, R0, C0, C1, C2: ICommonTree;
223 // Add child ^(nil 101 102 103) to root ^(5 6)
225 Root := TCommonTree.Create(TCommonToken.Create(5));
226 Root.AddChild(TCommonTree.Create(TCommonToken.Create(6)));
237 Root.AddChild(R0);
239 CheckNull(Root.Parent);
240 CheckEquals(Root.ChildIndex, -1);
242 // check children of root all point at root
243 Check(C0.Parent = Root);
    [all...]
  /external/chromium-trace/catapult/devil/devil/android/sdk/
adb_wrapper_devicetest.py 85 self._adb.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.
  /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/
SearchViewManager.java 23 import android.provider.DocumentsContract.Root;
102 * @param root Info about the current directory.
104 void update(RootInfo root) {
128 showMenu(root != null
129 && ((root.flags & Root.FLAG_SUPPORTS_SEARCH) != 0));
  /external/clang/lib/Basic/
VirtualFileSystem.cpp 479 : Root(new detail::InMemoryDirectory(
488 return Root->toString(/*Indent=*/0);
507 detail::InMemoryDirectory *Dir = Root.get();
602 auto Node = lookupInMemoryNode(*this, Root.get(), Path);
610 auto Node = lookupInMemoryNode(*this, Root.get(), Path);
649 auto Node = lookupInMemoryNode(*this, Root.get(), Dir);
797 /// The root(s) of the virtual file system.
    [all...]
  /external/llvm/utils/TableGen/
DAGISelMatcherGen.cpp 211 // 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...]

Completed in 1001 milliseconds

1 23 4 5 6 7