/frameworks/base/packages/DocumentsUI/tests/src/com/android/documentsui/ |
StubProvider.java | 34 import android.provider.DocumentsContract.Root; 64 public static final String EXTRA_ROOT = "com.android.documentsui.stubprovider.ROOT"; 79 Root.COLUMN_ROOT_ID, Root.COLUMN_FLAGS, Root.COLUMN_TITLE, Root.COLUMN_DOCUMENT_ID, 80 Root.COLUMN_AVAILABLE_BYTES 123 // Make a subdir in the cache dir for each root. 126 Log.i(TAG, "Created new root directory @ " + file.getPath()); 155 row.add(Root.COLUMN_ROOT_ID, id) 628 RootInfo root = mRoots.get(rootId); local 678 StubDocument root = mRoots.get(rootId).document; local 695 StubDocument root = mRoots.get(rootId).document; local [all...] |
/frameworks/base/packages/DocumentsUI/src/com/android/documentsui/ |
RootsCache.java | 38 import android.provider.DocumentsContract.Root; 95 // Special root for recents 98 flags = Root.FLAG_LOCAL_ONLY | Root.FLAG_SUPPORTS_IS_CHILD 99 | Root.FLAG_SUPPORTS_CREATE; 131 // Nothing else about the root should ever change. 136 assert(mRecentsRoot.flags == (Root.FLAG_LOCAL_ONLY 137 | Root.FLAG_SUPPORTS_IS_CHILD 138 | Root.FLAG_SUPPORTS_CREATE)); 327 final RootInfo root = RootInfo.fromRootsCursor(authority, cursor) local 354 RootInfo root = getRootLocked(authority, rootId); local [all...] |
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/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;
|
/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 214 Root.FLAG_SUPPORTS_IS_CHILD | 215 Root.FLAG_SUPPORTS_CREATE | 216 Root.FLAG_LOCAL_ONLY, 233 Root.FLAG_SUPPORTS_IS_CHILD | Root.FLAG_LOCAL_ONLY, cursor.getInt(1)); 280 Root.FLAG_SUPPORTS_IS_CHILD | Root.FLAG_SUPPORTS_CREATE | Root.FLAG_LOCAL_ONLY [all...] |
/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++
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
btQuickprof.cpp | 437 CProfileNode CProfileManager::Root( "Root", NULL ); 438 CProfileNode * CProfileManager::CurrentNode = &CProfileManager::Root; 487 Root.Reset(); 488 Root.Call();
|
/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/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/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/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...] |