HomeSort by relevance Sort by last modified time
    Searched full:roots (Results 151 - 175 of 577) sorted by null

1 2 3 4 5 67 8 91011>>

  /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
SkOpAngle.cpp 189 int roots, rroots;
201 roots = (i.*CurveRay[SkPathOpsVerbToPoints(verb)])(fSegment->pts(), ray);
203 } while ((roots == 0 || rroots == 0) && (flip ^= true));
204 if (roots == 0 || rroots == 0) {
209 return COMPARE_RESULT("roots == 0 || rroots == 0", this < &rh);
223 for (int index = 0; index < roots; ++index) {
  /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.
Heap.cpp 492 LOGV_HEAP("Verifying roots and heap before GC");
507 /* Mark the set of objects that are strongly reachable from the roots.
523 * Resume threads while tracing from the roots. We unlock the
551 * assume all roots may be gray and re-mark them.
562 * Recursively mark gray objects pointed to by the roots or by
602 LOGV_HEAP("Verifying roots and heap after GC");
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/
SHA256Digest.java 133 * The first 32 bits of the fractional parts of the square roots
289 * cube roots of the first sixty-four prime numbers)
  /external/v8/src/
global-handles.h 176 // Iterates over all weak roots in heap.
179 // Iterates over weak roots that are bound to a given callback.
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/
SampleSelectionPage.java 179 Object[] roots = (Object[]) mTableViewer.getInput(); local
180 selectSample(((Pair<String, File>) roots[index]).getSecond());
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/templates/
TemplateManager.java 119 * Returns a template file under one of the available roots, if it exists
122 * @return a template file under one of the available roots, if it exists
  /external/chromium_org/net/spdy/
spdy_priority_forest.h 422 std::map<uint64, NodeId> roots; // maps cumulative weight to root node ID local
432 roots[total_weight] = root_id;
445 DCHECK(roots.empty());
448 DCHECK(!roots.empty());
453 roots.upper_bound(base::RandGenerator(total_weight));
454 DCHECK(root_iter != roots.end());
  /external/chromium_org/third_party/skia/src/pathops/
SkOpAngle.cpp 189 int roots, rroots;
201 roots = (i.*CurveRay[SkPathOpsVerbToPoints(verb)])(fSegment->pts(), ray);
203 } while ((roots == 0 || rroots == 0) && (flip ^= true));
204 if (roots == 0 || rroots == 0) {
209 return COMPARE_RESULT("roots == 0 || rroots == 0", this < &rh);
223 for (int index = 0; index < roots; ++index) {
  /external/chromium_org/tools/code_coverage/
croc.py 206 # Replace alternate roots
439 path relative to an alt_name for one of the roots
518 for rootdict in cfg.get('roots', []):
629 '-r', '--root', dest='roots', type='string', action='append',
655 roots=[],
667 for root_opt in options.roots:
croc_test.py 252 # Replace alt roots
258 # Alt root replacement is applied for all roots
262 # Can use previously defined roots in cleanup
267 # Verify roots starting with UNC paths or drive letters work, and that
511 'roots' : [
562 # possible roots for the '_' alt_name.
  /frameworks/base/core/java/android/animation/
AnimatorSet.java 850 ArrayList<Node> roots = new ArrayList<Node>(); local
    [all...]
  /frameworks/base/docs/html/guide/topics/providers/
document-provider.jd 84 <li>Supports multiple user accounts and transient roots such as USB storage
101 &quot;roots&quot; which are starting points into exploring a tree of documents.
105 Roots are dynamic by design to support use cases like multiple accounts,
156 and shows the user the matching content roots.</li>
705 // It's possible to have multiple roots (e.g. for multiple accounts in the
727 // The child MIME types are used to filter the roots and only present to the
728 // user roots that contain the desired type somewhere in their file hierarchy.
    [all...]
  /frameworks/base/core/java/android/provider/
DocumentsProvider.java 107 * <h3>Roots</h3>
109 * All documents are surfaced through one or more "roots." Each root represents
197 * Return all roots currently provided. To display to users, you must define
205 * If this set of roots changes, you must call {@link ContentResolver#notifyChange(Uri,
216 * only be called for roots that advertise
  /external/chromium_org/ash/touch/
touch_hud_debug.cc 374 aura::Window::Windows roots = Shell::GetInstance()->GetAllRootWindows(); local
375 for (aura::Window::Windows::iterator iter = roots.begin();
376 iter != roots.end(); ++iter) {
  /external/chromium_org/third_party/skia/src/core/
SkEdgeClipper.cpp 58 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
59 int count = SkFindUnitQuadRoots(A, B, C, roots);
61 *t = roots[0];
  /external/skia/src/core/
SkEdgeClipper.cpp 58 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
59 int count = SkFindUnitQuadRoots(A, B, C, roots);
61 *t = roots[0];
  /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/
DirectoryFragment.java 274 final RootsCache roots = DocumentsApplication.getRootsCache(context);
275 return new RecentLoader(context, roots, state);
739 final RootsCache roots = DocumentsApplication.getRootsCache(context); local
    [all...]
  /external/blktrace/btt/
inlines.h 287 struct rb_root *roots = dip->heads; local
288 return &roots[type];
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
LayoutState.cpp 98 // writing mode roots.
197 // writing mode roots.
  /external/chromium_org/tools/cr/cr/
plugin.py 211 # Don't yield abstract roots, just children. We detect roots as direct

Completed in 619 milliseconds

1 2 3 4 5 67 8 91011>>