/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...] |
/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. 92 std::vector<GCRoot> Roots; 102 // The bit vector is the more compact representation where >3.2% of roots 121 Roots.push_back(GCRoot(Num, Metadata)); 142 /// roots_begin/roots_end - Iterators for all roots in the function. 144 roots_iterator roots_begin() { return Roots.begin(); } 145 roots_iterator roots_end () { return Roots.end(); } 146 size_t roots_size() const { return Roots.size(); [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; 210 for (unsigned I = 0; I != Roots.size(); ++I) { 211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); 221 ConstantInt::get(Int32Ty, Roots.size(), false), 263 for (size_t I = 0; I != Roots.size(); I++ [all...] |
GCStrategy.cpp | 13 // MachineCodeAnalysis identifies the GC safe points in the machine code. Roots 49 AllocaInst **Roots, unsigned Count); 174 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots, 191 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) 205 // action. The default for roots is no action. 279 SmallVector<AllocaInst*, 32> Roots; 309 Roots.push_back(cast<AllocaInst>( 322 if (Roots.size()) 323 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 | 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...] |
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];
|
/dalvik/vm/alloc/ |
Verify.h | 32 * Verifies the contents of various global roots.
|
/external/webkit/Source/WebCore/platform/graphics/ |
GlyphPageTreeNode.cpp | 45 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0; 53 roots = new HashMap<int, GlyphPageTreeNode*>; 57 GlyphPageTreeNode* node = pageNumber ? roots->get(pageNumber) : pageZeroRoot; 64 roots->set(pageNumber, node); 74 if (roots) { 75 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end(); 76 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it) 98 // Enumerate all the roots and prune any tree that contains our custom font data. 99 if (roots) { 100 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end() [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();
|
/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...] |
/dalvik/dx/src/junit/runner/ |
ClassPathTestCollector.java | 32 Hashtable collectFilesInRoots(Vector roots) { 34 Enumeration e= roots.elements();
|
/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; } 165 assert(Roots.size() == 1 && "Should always have entry node!"); 166 return Roots[0]; 172 Roots = DT.getRoots(); 173 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!"); 174 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]);
|
ConservativeRoots.h | 49 JSCell** roots(); 94 inline JSCell** ConservativeRoots::roots() function in class:JSC::ConservativeRoots
|
/external/junit/src/junit/runner/ |
ClassPathTestCollector.java | 35 Hashtable collectFilesInRoots(Vector roots) { 37 Enumeration e= roots.elements();
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
ExplodedGraph.h | 245 /// Roots - The roots of the simulation graph. Usually there will be only 248 /// different roots reach the same state at the same program location. 249 RootsTy Roots; 287 /// addRoot - Add an untyped node to the set of roots. 289 Roots.push_back(V); 305 unsigned num_roots() const { return Roots.size(); } 329 roots_iterator roots_begin() { return Roots.begin(); } 331 roots_iterator roots_end() { return Roots.end(); } 333 const_roots_iterator roots_begin() const { return Roots.begin(); [all...] |