| /external/webkit/Source/JavaScriptCore/heap/ |
| ConservativeRoots.h | 49 JSCell** roots();
94 inline JSCell** ConservativeRoots::roots() function in class:JSC::ConservativeRoots
|
| /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...] |
| starred_url_database.h | 126 // would make a cycle) are added to roots.
134 // It's up to the caller to delete the nodes returned in roots and
139 std::set<StarredNode*>* roots,
158 // All entries in roots that are not the bookmark bar and other node are
165 std::set<StarredNode*>* roots,
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
| SHA384Digest.java | 75 * The first 64 bits of the fractional parts of the square roots
|
| SHA512Digest.java | 76 * The first 64 bits of the fractional parts of the square roots
|
| /external/llvm/docs/ |
| Lexicon.rst | 153 .. _stack roots:
170 In garbage collection, it is necessary to identify `stack roots`_ so that
175 pointers`_ must be reloaded from stack roots.
194 identifies `roots`_ within the stack frame of an executing function.
|
| GarbageCollection.html | 39 <li><a href="#gcroot">Identifying GC roots on the stack:
54 <li><a href="#init-roots">Initializing roots to null:
180 <li>Registration of global roots with the runtime.</li>
218 <li>Implement a registry for global roots.</li>
227 <li>Use <tt>@llvm.gcroot</tt> to mark stack roots.</li>
288 stack roots, and for this it needs to integrate with the shadow stack. Luckily,
300 int32_t NumRoots; //< Number of roots in stack frame.
310 void *Roots[0]; //< Stack roots (in-place array)
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| stripslash.c | 36 /* last_component returns "" for file system roots, but we need to turn
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 259 /// The roots of the simulation graph. Usually there will be only
262 /// different roots reach the same state at the same program location.
263 NodeVector Roots;
305 /// addRoot - Add an untyped node to the set of roots.
307 Roots.push_back(V);
321 unsigned num_roots() const { return Roots.size(); }
345 roots_iterator roots_begin() { return Roots.begin(); }
347 roots_iterator roots_end() { return Roots.end(); }
349 const_roots_iterator roots_begin() const { return Roots.begin(); }
351 const_roots_iterator roots_end() const { return Roots.end();
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Eigen3f.java | 70 double roots[] = new double[3];
local
71 computeRoots(scaledData, roots);
72 eigenValues[0] = (float) roots[0];
73 eigenValues[1] = (float) roots[1];
74 eigenValues[2] = (float) roots[2];
324 // eigenvalues are the roots to this equation, all guaranteed to be
334 // Construct the parameters used in classifying the roots of the
335 // equation and in solving the equation for the roots in closed form.
349 // Compute the eigenvalues by solving for the roots of the polynomial.
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| az_isp.c | 25 * The ISPs are the roots of the two polynomials F1(z) and F2(z) *
30 * For a even order m=2n, F1(z) has M/2 conjugate roots on the unit *
31 * circle and F2(z) has M/2-1 conjugate roots on the unit circle in *
32 * addition to two roots at 0 and pi. *
63 Word16 old_isp[] /* (i) : old isp[] (in case not found M roots) */
98 * Find the ISPs (roots of F1(z) and F2(z) ) using the *
100 * The roots of F1(z) and F2(z) are alternatively searched. *
102 * to F2(z) then back to F1(z) and so on until all roots are found. *
181 /* Check if M-1 roots found */
|
| /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]);
|
| db_utilities_poly.h | 39 inline void db_SolveQuadratic(double *roots,int *nr_roots,double a,double b,double c)
50 roots[0]= -c/b;
62 roots[0]=q/a;
66 else roots[1]=c/q;
76 For a non-degenerate cubic with two roots, the first root is the single root and
79 DB_API void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d);
84 DB_API void db_SolveQuartic(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
89 DB_API void db_SolveQuarticForced(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
|
| /packages/apps/LegacyCamera/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]);
|
| db_utilities_poly.h | 39 inline void db_SolveQuadratic(double *roots,int *nr_roots,double a,double b,double c)
50 roots[0]= -c/b;
62 roots[0]=q/a;
66 else roots[1]=c/q;
76 For a non-degenerate cubic with two roots, the first root is the single root and
79 DB_API void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d);
84 DB_API void db_SolveQuartic(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
89 DB_API void db_SolveQuarticForced(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
|
| /build/core/ |
| pathmap.mk | 76 # A list of all source roots under frameworks/base, which will be
113 # A list of all source roots under frameworks/support.
|
| /dalvik/vm/alloc/ |
| Verify.cpp | 68 * Searches the roots and heap for object references.
145 * Verifies references in the roots.
|
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 243 Finds real roots of cubic, quadratic or linear equation.
266 cvSolveCubic( const CvMat* coeffs, CvMat* roots )
281 if( !CV_IS_MAT(roots) )
282 CV_ERROR( !roots ? CV_StsNullPtr : CV_StsBadArg, "Output parameter is not a valid matrix" );
285 (CV_MAT_TYPE(roots->type) != CV_32FC1 && CV_MAT_TYPE(roots->type) != CV_64FC1) )
295 if( (roots->rows != 1 && roots->cols != 1) ||
296 roots->rows + roots->cols - 1 != 3
[all...] |
| /external/chromium/chrome/browser/bookmarks/ |
| 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);
|
| /external/webkit/Source/WebCore/css/ |
| CSSQuirkPrimitiveValue.h | 28 // This value is used to handle quirky margins in reflow roots (body, td, and th) like WinIE.
|
| /development/tools/idegen/ |
| README | 54 Excluding source roots and jars
68 You may want some source roots to come before others in Eclipse. Simply
79 of the "path-precedence" file. To make source roots under ./out come last,
|
| /external/llvm/include/llvm/CodeGen/ |
| GCStrategy.h | 27 // - Roots
74 bool InitRoots; ///< If set, roots are nulled during lowering.
113 /// customRoots - By default, roots are left for the code generator so it
|
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 403 const CodeGenRegister *Roots[2];
405 RegUnit() : Weight(0) { Roots[0] = Roots[1] = 0; }
408 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
409 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]);
547 RegUnits.back().Roots[0] = R0
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newxmlfile/ |
| NewXmlFileCreationPage.java | 595 Object[] roots = (Object[]) mRootTableViewer.getInput(); local
596 return roots[index].toString();
798 ArrayList<String> roots = type.getRoots(); local
1020 ArrayList<String> roots = type.getRoots(); local
[all...] |
| /external/jmonkeyengine/engine/src/core-plugins/com/jme3/material/plugins/ |
| J3MLoader.java | 425 private void loadFromRoot(List<Statement> roots) throws IOException{
426 if (roots.size() == 2){
427 Statement exception = roots.get(0);
434 }else if (roots.size() != 1){
435 throw new IOException("Too many roots in J3M/J3MD file");
439 Statement materialStat = roots.get(0);
|
