| /external/smali/util/src/test/java/org/jf/util/ |
| PathUtilTest.java | 39 File[] roots = File.listRoots(); local
41 if (roots.length > 1) {
42 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
43 File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
53 File[] roots = File.listRoots(); local
55 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
56 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
68 File[] roots = File.listRoots(); local
70 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar);
71 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar)
80 File[] roots = File.listRoots(); local
92 File[] roots = File.listRoots(); local
104 File[] roots = File.listRoots(); local
116 File[] roots = File.listRoots(); local
128 File[] roots = File.listRoots(); local
140 File[] roots = File.listRoots(); local
152 File[] roots = File.listRoots(); local
164 File[] roots = File.listRoots(); local
176 File[] roots = File.listRoots(); local
188 File[] roots = File.listRoots(); local
200 File[] roots = File.listRoots(); local
212 File[] roots = File.listRoots(); local
224 File[] roots = File.listRoots(); local
236 File[] roots = File.listRoots(); local
248 File[] roots = File.listRoots(); local
260 File[] roots = File.listRoots(); local
[all...] |
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_utilities_poly.cpp | 28 void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d)
35 /*For nondegenerate cubics with three roots
40 if(a==0.0) db_SolveQuadratic(roots,nr_roots,b,c,d);
68 roots[0]= -2.0*srq*cos_theta_through3-bp_through3;
69 roots[1]=srq*min2_cos_theta_plu-bp_through3;
70 roots[2]=srq*min2_cos_theta_min-bp_through3;
77 if(A!=0.0) roots[0]=A+q/A-bp_through3;
78 else roots[0]= -bp_through3;
87 roots[0]= -2.0*si_r_srq-bp_through3;
89 roots[1]=si_r_srq-bp_through3
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_poly.cpp | 28 void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d)
35 /*For nondegenerate cubics with three roots
40 if(a==0.0) db_SolveQuadratic(roots,nr_roots,b,c,d);
68 roots[0]= -2.0*srq*cos_theta_through3-bp_through3;
69 roots[1]=srq*min2_cos_theta_plu-bp_through3;
70 roots[2]=srq*min2_cos_theta_min-bp_through3;
77 if(A!=0.0) roots[0]=A+q/A-bp_through3;
78 else roots[0]= -bp_through3;
87 roots[0]= -2.0*si_r_srq-bp_through3;
89 roots[1]=si_r_srq-bp_through3
[all...] |
| /external/clang/test/Analysis/ |
| null-deref-ps-region.c | 5 // also be live roots.
|
| /external/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 19 // - Stack offsets for GC roots, as specified by calls to llvm.gcroot
21 // As a refinement, liveness analysis calculates the set of live roots at each
23 // generator, so all roots are assumed live.
93 std::vector<GCRoot> Roots;
103 // The bit vector is the more compact representation where >3.2% of roots
122 Roots.push_back(GCRoot(Num, Metadata));
143 /// roots_begin/roots_end - Iterators for all roots in the function.
145 roots_iterator roots_begin() { return Roots.begin(); }
146 roots_iterator roots_end () { return Roots.end(); }
147 size_t roots_size() const { return Roots.size();
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/ |
| GlyphPageTreeNode.cpp | 45 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0;
54 roots = new HashMap<int, GlyphPageTreeNode*>;
58 if (!roots)
59 roots = new HashMap<int, GlyphPageTreeNode*>;
64 GlyphPageTreeNode* node = pageNumber ? roots->get(pageNumber) : pageZeroRoot;
71 roots->set(pageNumber, node);
81 if (roots) {
82 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end();
83 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it)
104 if (roots) {
[all...] |
| /build/tools/ |
| fileslist.py | 26 roots = argv[1:]
27 for root in roots:
|
| /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/llvm/lib/CodeGen/ |
| ShadowStackGC.cpp | 13 // to identify roots.
22 // In order to support this particular transformation, all stack roots are
43 /// roots.
51 /// Roots - GC roots in the current function. Each is a pair of the
53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots;
209 for (unsigned I = 0; I != Roots.size(); ++I) {
210 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
220 ConstantInt::get(Int32Ty, Roots.size(), false),
262 for (size_t I = 0; I != Roots.size(); I++
[all...] |
| GCStrategy.cpp | 14 // Roots are identified in SelectionDAGISel.
49 AllocaInst **Roots, unsigned Count);
180 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots,
197 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
211 // action. The default for roots is no action.
285 SmallVector<AllocaInst*, 32> Roots;
315 Roots.push_back(cast<AllocaInst>(
328 if (Roots.size())
329 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size())
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2010-04-15-ScavengerDebugValue.ll | 17 !2 = metadata !{i32 524329, metadata !"libgcc2.c", metadata !"/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gcc", metadata !3} ; [ DW_TAG_file_type ]
18 !3 = metadata !{i32 524305, i32 0, i32 1, metadata !"libgcc2.c", metadata !"/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gcc", metadata !"4.2.1 (Based on Apple Inc. build 5658) (LLVM build 00)", i1 true, i1 true, metadata !"", i32 0} ; [ DW_TAG_compile_unit ]
22 !7 = metadata !{i32 524329, metadata !"libgcc2.h", metadata !"/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gcc", metadata !3} ; [ DW_TAG_file_type ]
|
| /external/skia/src/core/ |
| SkGeometry.cpp | 135 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2])
137 SkASSERT(roots);
140 return valid_unit_divide(-C, B, roots);
142 SkScalar* r = roots;
146 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
165 if (r - roots == 2)
167 if (roots[0] > roots[1])
168 SkTSwap<SkScalar>(roots[0], roots[1])
[all...] |
| SkQuadClipper.cpp | 44 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
45 int count = SkFindUnitQuadRoots(A, B, C, roots);
47 *t = roots[0];
|
| /dalvik/vm/alloc/ |
| Verify.h | 32 * Verifies the contents of various global roots.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiModelTreeContentProvider.java | 92 ArrayList<UiElementNode> roots = new ArrayList<UiElementNode>(); local
96 roots.add(ui_node);
100 roots.add(ui_node);
107 return roots.toArray();
|
| /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...] |
| /frameworks/base/test-runner/src/junit/runner/ |
| ClassPathTestCollector.java | 33 Hashtable collectFilesInRoots(Vector roots) {
35 Enumeration e= roots.elements();
|
| /development/tools/idegen/src/ |
| Eclipse.java | 43 * root directory, we'll order source roots based on how they match
44 * regular expressions in that file. Source roots that match earlier
66 // Put source roots in respective buckets.
79 // Output source roots to configuration file.
121 // Exclude nested source roots.
173 * A precedence bucket for source roots.
|
| Configuration.java | 36 /** Java source tree roots. */
53 * for .java and .jar files and identifying source roots.
76 Log.debug(sourceRoots.size() + " source roots");
111 * Recursively finds .java source roots, .jar files, and excluded
120 * source roots in our generated source directory (specifically,
134 // Keep track of source roots for .java files.
224 * Picks out excluded directories that are under source roots.
|
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnMathUtils.cpp | 354 // Returns the number of real roots of the equation [0..2]. Roots are
356 int findUnitQuadRoots(float a, float b, float c, float roots[2])
359 return safeUnitDivide(-c, b, roots[0]) ? 1 : 0;
362 if (discriminant < 0 || isnan(discriminant)) // complex roots
368 if (safeUnitDivide(q, a, roots[numberOfRoots]))
370 if (safeUnitDivide(c, q, roots[numberOfRoots]))
373 // Seemingly have two roots. Check for equality and sort.
374 if (roots[0] == roots[1]
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 37 std::vector<BasicBlock*> Roots;
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; }
166 assert(Roots.size() == 1 && "Should always have entry node!");
167 return Roots[0];
173 Roots = DT.getRoots();
174 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!");
175 calculate(DT, DT[Roots[0]]);
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots;
201 // Compute the roots.
205 Roots.push_back(*it);
208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
253 llvm::errs() << "Roots: [";
254 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
255 ie = Roots.end(); it != ie; ++it) {
256 if (it != Roots.begin()) llvm::errs() << ", ";
309 // The current set of changes we are minimizing, starting at the roots
[all...] |
| /external/webkit/Source/JavaScriptCore/heap/ |
| MarkStack.cpp | 51 JSCell** roots = conservativeRoots.roots(); local
54 internalAppend(roots[i]);
|
| /external/compiler-rt/BlocksRuntime/tests/ |
| makefile | 55 ditto $(RootsDirectory)/libclosure.roots/libclosure~dst/usr/local/lib/system $(ALTUSRLOCALLIBSYSTEM)
67 LibsystemRootPath ?= $(RootsDirectory)/Libsystem-$(LibsystemVersion).roots/Libsystem-$(LibsystemVersion)~dst/usr/lib/
|
| /external/llvm/lib/Target/ |
| TargetRegisterInfo.cpp | 63 MCRegUnitRootIterator Roots(Unit, TRI);
64 assert(Roots.isValid() && "Unit has no roots.");
65 OS << TRI->getName(*Roots);
66 for (++Roots; Roots.isValid(); ++Roots)
67 OS << '~' << TRI->getName(*Roots);
|
