/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.
|
/external/webkit/Source/WebCore/bindings/v8/ |
DOMDataStore.cpp | 48 // reachable from JS roots. 135 // Called when the object is near death (not reachable from JS roots).
|
/external/webkit/Source/WebCore/platform/graphics/ |
GlyphPageTreeNode.h | 151 // GlyphPageTreeNode for each glyph page number. The roots do not have a 185 static HashMap<int, GlyphPageTreeNode*>* roots;
|
/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
|
/dalvik/vm/alloc/ |
Heap.cpp | 472 LOGV_HEAP("Verifying roots and heap before GC"); 485 /* Mark the set of objects that are strongly reachable from the roots. 501 * Resume threads while tracing from the roots. We unlock the 527 * assume all roots may be gray and re-mark them. 538 * Recursively mark gray objects pointed to by the roots or by 578 LOGV_HEAP("Verifying roots and heap after GC");
|
/frameworks/base/core/java/android/animation/ |
AnimatorSet.java | 786 * - All nodes without dependencies become 'roots' 787 * - while roots list is not null 791 * - any nodes with no dependencies are added to the roots list 796 ArrayList<Node> roots = new ArrayList<Node>(); local 801 roots.add(node); 805 while (roots.size() > 0) { 806 int numRoots = roots.size(); 808 Node root = roots.get(i); [all...] |
/frameworks/base/core/java/android/widget/ |
RelativeLayout.java | 1473 final ArrayDeque<Node> roots = findRoots(rules); local 1549 final ArrayDeque<Node> roots = mRoots; local 1568 final ArrayDeque<Node> roots = findRoots(rules); local [all...] |
/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];
|
/external/blktrace/btt/ |
inlines.h | 287 struct rb_root *roots = dip->heads; local 288 return &roots[type];
|
/external/llvm/utils/TableGen/ |
RegisterInfoEmitter.cpp | 665 // Emit the table of register unit roots. Each regunit has one or two root 669 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); 670 assert(!Roots.empty() && "All regunits must have a root register."); 671 assert(Roots.size() <= 2 && "More than two roots not supported yet."); 672 OS << " { " << getQualifiedName(Roots.front()->TheDef); 673 for (unsigned r = 1; r != Roots.size(); ++r) 674 OS << ", " << getQualifiedName(Roots[r]->TheDef); [all...] |
TableGenBackends.h | 39 // pattern partly has historical roots in the previous TableGen backend API
|
/external/skia/include/core/ |
SkGeometry.h | 30 /** Given a quadratic equation Ax^2 + Bx + C = 0, return 0, 1, 2 roots for the 33 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]);
|
/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
ggc.h | 65 /* Structures for the easy way to mark roots. 133 /* When true, identifier nodes are considered as GC roots. When
|
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
ggc.h | 65 /* Structures for the easy way to mark roots. 133 /* When true, identifier nodes are considered as GC roots. When
|
/prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
ggc.h | 65 /* Structures for the easy way to mark roots. 133 /* When true, identifier nodes are considered as GC roots. When
|
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
ggc.h | 65 /* Structures for the easy way to mark roots. 133 /* When true, identifier nodes are considered as GC roots. When
|
/external/llvm/lib/CodeGen/ |
LiveIntervalAnalysis.cpp | 526 // The physregs aliasing Unit are the roots and their super-registers. 527 // Create all values as dead defs before extending to uses. Note that roots 529 // idempotent. It is very rare for a register unit to have multiple roots, so 531 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { 532 unsigned Root = *Roots; 543 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { [all...] |
/dalvik/vm/hprof/ |
Hprof.cpp | 226 * Walk the roots and heap writing heap information to the specified
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
OcamlGCPrinter.cpp | 135 AP.OutStreamer.AddComment("live roots for " +
|
/external/llvm/utils/lit/lit/ExampleTests/LLVM.InTree/test/ |
lit.cfg | 48 # Get the source and object roots.
|
/external/llvm/utils/lit/lit/ExampleTests/LLVM.OutOfTree/src/test/ |
lit.cfg | 48 # Get the source and object roots.
|
/external/valgrind/main/auxprogs/ |
gsl16test | 63 TESTS7="poly/test qrng/test randist/test rng/test roots/test siman/test"
|
gsl19test | 65 TESTS7="poly/test qrng/test randist/test rng/test roots/test siman/test"
|
/external/valgrind/main/memcheck/tests/ |
leak-cases.c | 57 // These are definite roots.
|