| /external/dbus/test/ |
| unused-code-gc.py | 11 roots = {} variable
176 ## now we need to find the roots (exported symbols)
185 if roots.has_key(name):
188 roots[name] = 1
190 print "%d symbols exported from this object" % len(roots)
193 ## notice they are used. Manually add them as roots...
214 if roots.has_key(vr):
216 roots[vr] = 1
218 for k in roots.keys():
237 print "The following are hardcoded in as vtable roots: %s" % vtable_root
[all...] |
| /external/webkit/Source/JavaScriptCore/heap/ |
| ConservativeRoots.h | 49 JSCell** roots();
94 inline JSCell** ConservativeRoots::roots() function in class:JSC::ConservativeRoots
|
| MarkStack.cpp | 51 JSCell** roots = conservativeRoots.roots(); local
54 internalAppend(roots[i]);
|
| /external/skia/src/core/ |
| SkQuadClipper.cpp | 51 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
52 int count = SkFindUnitQuadRoots(A, B, C, roots);
54 *t = roots[0];
|
| SkEdgeClipper.cpp | 65 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
66 int count = SkFindUnitQuadRoots(A, B, C, roots);
68 *t = roots[0];
|
| SkGeometry.cpp | 143 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2])
145 SkASSERT(roots);
148 return valid_unit_divide(-C, B, roots);
150 SkScalar* r = roots;
154 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
173 if (r - roots == 2)
175 if (roots[0] > roots[1])
176 SkTSwap<SkScalar>(roots[0], roots[1])
883 SkScalar* roots = tValues; local
1140 SkScalar roots[2]; local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiModelTreeContentProvider.java | 88 ArrayList<UiElementNode> roots = new ArrayList<UiElementNode>(); local
92 roots.add(ui_node);
96 roots.add(ui_node);
103 return roots.toArray();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newxmlfile/ |
| NewXmlFileCreationPage.java | 597 Object[] roots = (Object[]) mRootTableViewer.getInput(); local
598 return roots[index].toString();
806 ArrayList<String> roots = type.getRoots(); local
1028 ArrayList<String> roots = type.getRoots(); local
[all...] |
| /external/blktrace/btt/ |
| inlines.h | 287 struct rb_root *roots = dip->heads; local
288 return &roots[type];
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_codec.cc | 19 const char* BookmarkCodec::kRootsKey = "roots";
53 DictionaryValue* roots = new DictionaryValue(); local
54 roots->Set(kRootFolderNameKey, EncodeNode(bookmark_bar_node));
55 roots->Set(kOtherBookmarkFolderNameKey, EncodeNode(other_folder_node));
64 main->Set(kRootsKey, roots);
137 Value* roots; local
138 if (!d_value.Get(kRootsKey, &roots))
139 return false; // No roots.
141 if (roots->GetType() != Value::TYPE_DICTIONARY)
142 return false; // Invalid type for roots
[all...] |
| bookmark_codec_unittest.cc | 67 Value* roots; local
68 ASSERT_TRUE(d_value->Get(BookmarkCodec::kRootsKey, &roots));
69 ASSERT_EQ(Value::TYPE_DICTIONARY, roots->GetType());
71 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
|
| 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/chrome/browser/history/ |
| starred_url_database.cc | 134 std::set<StarredNode*> roots; local
139 if (!BuildStarNodes(&roots, &folders_with_duplicate_ids, &unparented_urls,
144 bool valid = EnsureStarredIntegrityImpl(&roots, folders_with_duplicate_ids,
147 STLDeleteElements(&roots);
319 std::set<StarredURLDatabase::StarredNode*>* roots,
374 roots->insert(folder_id_to_node_map[star_entries[i].folder_id]);
383 // The node has a cycle. Add it to the list of roots so the cycle is
385 roots->insert(node);
424 std::set<StarredURLDatabase::StarredNode*>* roots,
430 GetNodeByType(*roots, StarredEntry::BOOKMARK_BAR)
[all...] |
| /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);
|
| sb_celp.c | 307 int i, roots, sub; local
411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
412 if (roots!=st->lpcSize)
414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack);
415 if (roots!=st->lpcSize) {
[all...] |
| nb_celp.c | 255 int i, sub, roots; local
322 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
323 /* Check if we found all the roots */
324 if (roots!=st->lpcSize)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/ |
| SampleSelectionPage.java | 181 Object[] roots = (Object[]) mTableViewer.getInput(); local
182 selectSample((File) roots[index]);
|
| /frameworks/base/core/java/android/animation/ |
| AnimatorSet.java | 782 * - All nodes without dependencies become 'roots'
783 * - while roots list is not null
787 * - any nodes with no dependencies are added to the roots list
792 ArrayList<Node> roots = new ArrayList<Node>(); local
797 roots.add(node);
801 while (roots.size() > 0) {
802 int numRoots = roots.size();
804 Node root = roots.get(i);
817 roots.clear();
818 roots.addAll(tmpRoots)
[all...] |
| /external/v8/src/arm/ |
| macro-assembler-arm.h | 56 const Register roots = { 10 }; // Roots array pointer. member in namespace:v8::internal
[all...] |
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiPackageAttributeNode.java | 267 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots(); local
268 for (int i = 0; i < roots.length; i++) {
269 IClasspathEntry entry = roots[i].getRawClasspathEntry();
271 result.add(roots[i]);
|
| /external/v8/src/mips/ |
| macro-assembler-mips.h | 55 const Register roots = s6; // Roots array pointer. member in namespace:v8::internal
[all...] |
| /frameworks/base/core/java/android/widget/ |
| RelativeLayout.java | 1264 final LinkedList<Node> roots = findRoots(rules); local
1340 final LinkedList<Node> roots = mRoots; local
1359 final LinkedList<Node> roots = findRoots(rules); local
[all...] |
| /external/opencv/cv/src/ |
| cvfundam.cpp | 692 CvMat roots = cvMat( 1, 3, CV_64F, r ); local
761 // solve the cubic equation; there can be 1 to 3 roots ...
762 n = cvSolveCubic( &coeffs, &roots );
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/io/ |
| FileTest.java | 1739 File[] roots = File.listRoots(); local
[all...] |
