| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiPackageAttributeNode.java | 269 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots(); local
270 for (int i = 0; i < roots.length; i++) {
271 IClasspathEntry entry = roots[i].getRawClasspathEntry();
273 result.add(roots[i]);
|
| /external/llvm/docs/ |
| GarbageCollection.rst | 101 * Registration of global roots with the runtime.
133 #. Implement a registry for global roots.
147 * Use ``@llvm.gcroot`` to mark stack roots.
202 roots, and for this it needs to integrate with the shadow stack. Luckily, doing
214 int32_t NumRoots; //< Number of roots in stack frame.
224 void *Roots[0]; //< Stack roots (in-place array).
245 // For roots [0, NumMeta), the metadata pointer is in the FrameMap.
247 Visitor(&R->Roots[i], R->Map->Meta[i]);
249 // For roots [NumMeta, NumRoots), the metadata pointer is null
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| GlyphPageTreeNode.h | 52 // GlyphPageTreeNode for each glyph page number. The roots do not have a
118 static HashMap<int, GlyphPageTreeNode*>* roots; member in class:WebCore::GlyphPageTreeNode
|
| /external/chromium_org/tools/deep_memory_profiler/subcommands/ |
| cat.py | 52 json_root['roots'] = []
55 json_root['roots'].append([sorter.world, sorter.name])
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDFS.h | 34 /// forest of trees with roots at the bottom of the schedule branching upward.
143 /// \brief Compute various metrics for the DAG with given roots.
|
| /external/skia/tests/ |
| PathOpsCubicLineIntersectionTest.cpp | 64 int roots = i.intersect(cubic, line); local
65 for (int pt = 0; pt < roots; ++pt) {
|
| /external/speex/libspeex/ |
| lsp.c | 68 The zeros (roots) of P(z) also happen to alternate, which is why we
69 swap coefficients as we find roots. So the process of finding the
70 LSP frequencies is basically finding the roots of 5th order
241 int roots=0; /* DR 8/2/94: number of roots found */ local
355 roots++;
387 return(roots);
|
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
231 this->Roots.clear();
417 assert(this->Roots.size() == 1 && "Should always have entry node!");
418 return this->Roots[0];
643 this->Roots.push_back(BB);
657 this->Roots.push_back(entry);
663 // Initialize the roots list
|
| /art/runtime/gc/collector/ |
| mark_sweep.h | 101 // Verify that image roots point to only marked objects within the alloc space.
269 // Mark the vm thread roots.
299 // Verify the roots of the heap and print out information related to any invalid roots.
|
| /developers/build/prebuilts/gradle/StorageProvider/StorageProviderSample/src/main/java/com/example/android/storageprovider/ |
| MyCloudFragment.java | 62 // Notify the system that the status of our roots has changed. This will trigger
|
| /developers/samples/android/content/documentsUi/StorageProvider/StorageProviderSample/src/main/java/com/example/android/storageprovider/ |
| MyCloudFragment.java | 62 // Notify the system that the status of our roots has changed. This will trigger
|
| /development/samples/browseable/StorageProvider/src/com.example.android.storageprovider/ |
| MyCloudFragment.java | 62 // Notify the system that the status of our roots has changed. This will trigger
|
| /development/tools/idegen/src/ |
| IntelliJ.java | 49 * under source roots but leave the rest in so you can still pull
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_html_writer.cc | 104 Value* roots; local
108 BookmarkCodec::kRootsKey, &roots) ||
109 roots->GetType() != Value::TYPE_DICTIONARY) {
114 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_codec_unittest.cc | 102 Value* roots; local
103 ASSERT_TRUE(d_value->Get(BookmarkCodec::kRootsKey, &roots));
104 ASSERT_EQ(Value::TYPE_DICTIONARY, roots->GetType());
106 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| bookmark_html_writer.cc | 105 Value* roots = NULL;
109 BookmarkCodec::kRootsKey, &roots) ||
110 roots->GetType() != Value::TYPE_DICTIONARY) {
115 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| /external/chromium_org/net/cert/ |
| test_root_certs.h | 111 // Scoped helper for unittests to handle safely managing trusted roots.
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/ |
| run-blink-httpd | 81 help='Absolute path to DocumentRoot (overrides layout test roots)')
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsQuad.cpp | 27 int roots = SkDCubic::RootsValidT(a, b, c, d, ts); local
32 for (int index = 0; index < roots; ++index) {
107 and using the roots
111 // this does not discard real roots <= 0 or >= 1
|
| /external/clang/test/Analysis/ |
| array-struct.c | 117 // building: a->e, e->d. Only then 'a' could be added to live region roots.
|
| /external/clang/test/Unit/ |
| lit.cfg | 63 # Get the source and object roots.
|
| /external/dropbear/libtommath/ |
| bn_mp_n_root.c | 26 * find huge roots [square and cube, etc].
|
| /external/libvorbis/lib/ |
| lsp.c | 25 /* Note that the lpc-lsp conversion finds the roots of polynomial with
28 happen with absurdly closely spaced roots (very sharp peaks in the
421 /* Remove the roots at +1 and -1. */
439 /* Find the roots of the 2 even polynomials.*/
|
| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| in-tree-user.ll | 8 ; We can't vectorize when the roots are used inside the tree.
|
| /external/llvm/test/Unit/ |
| lit.cfg | 63 # Get the source and object roots.
|
