| /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/core/html/shadow/ |
| PasswordGeneratorButtonElement.cpp | 74 // FIXME: This interacts really badly with author shadow roots because now
75 // we can interleave user agent and author shadow roots on the element meaning
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| 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/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.
|
| /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_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.
|
| /external/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/smali/util/src/main/java/org/jf/util/ |
| PathUtil.java | 61 //if the roots aren't the same (i.e. different drives on a windows machine), we can't construct a relative
|
| /external/llvm/lib/CodeGen/ |
| LiveIntervalAnalysis.cpp | 241 // The physregs aliasing Unit are the roots and their super-registers.
242 // Create all values as dead defs before extending to uses. Note that roots
244 // idempotent. It is very rare for a register unit to have multiple roots, so
246 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
247 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
256 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
[all...] |
| /art/runtime/ |
| intern_table.cc | 58 // image roots.
147 // Mark as dirty so that we rescan the roots.
|
| /dalvik/vm/alloc/ |
| Visit.cpp | 160 * Visits all roots associated with a thread.
210 * Visits roots. TODO: visit cached global references.
|
