| /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/CodeGen/ |
| TargetRegisterInfo.cpp | 69 MCRegUnitRootIterator Roots(Unit, TRI);
70 assert(Roots.isValid() && "Unit has no roots.");
71 OS << TRI->getName(*Roots);
72 for (++Roots; Roots.isValid(); ++Roots)
73 OS << '~' << TRI->getName(*Roots);
|
| /external/llvm/test/CodeGen/ARM/ |
| 2010-04-15-ScavengerDebugValue.ll | 19 !12 = metadata !{metadata !"libgcc2.c", metadata !"/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gcc"}
24 !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 ]
|
| /frameworks/base/packages/DocumentsUI/res/values-km-rKH/ |
| strings.xml | 36 <string name="drawer_open" msgid="4545466532430226949">"?????? roots"</string>
37 <string name="drawer_close" msgid="7602734368552123318">"???? roots"</string>
|
| /frameworks/base/packages/DocumentsUI/res/values-lo-rLA/ |
| strings.xml | 36 <string name="drawer_open" msgid="4545466532430226949">"????? roots"</string>
37 <string name="drawer_close" msgid="7602734368552123318">"?????? roots"</string>
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 492 static inline void computeRoots(const MatrixType& m, VectorType& roots)
502 // eigenvalues are the roots to this equation, all guaranteed to be
508 // Construct the parameters used in classifying the roots of the equation
509 // and in solving the equation for the roots in closed form.
521 // Compute the eigenvalues by solving for the roots of the polynomial.
526 roots(0) = c2_over_3 + Scalar(2)*rho*cos_theta;
527 roots(1) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta);
528 roots(2) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta);
531 if (roots(0) >= roots(1)
[all...] |
| /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/bison/lib/ |
| stripslash.c | 37 /* last_component returns "" for file system roots, but we need to turn
|
| /external/ceres-solver/internal/ceres/ |
| polynomial.h | 57 // Use the companion matrix eigenvalues to determine the roots of the
64 // If real is not NULL, the real parts of the roots will be returned in it.
75 // x_max]. The minimum is obtained by computing all the roots of the
76 // derivative of the input polynomial. All real roots within the
|
| /external/chromium_org/third_party/skia/src/effects/gradients/ |
| SkTwoPointConicalGradient.cpp | 20 // Return the number of distinct real roots, and write them into roots[] in
22 static int find_quad_roots(float A, float B, float C, float roots[2]) {
23 SkASSERT(roots);
26 return valid_divide(-C, B, roots);
48 roots[0] = 0;
54 roots[0] = r0 < r1 ? r0 : r1;
55 roots[1] = r0 > r1 ? r0 : r1;
89 float roots[2]; local
92 int countRoots = find_quad_roots(fA, fB, C, roots);
[all...] |
| /external/llvm/docs/ |
| Lexicon.rst | 170 .. _stack roots:
187 In garbage collection, it is necessary to identify `stack roots`_ so that
192 pointers`_ must be reloaded from stack roots.
215 identifies `roots`_ within the stack frame of an executing function.
|
| /external/llvm/test/CodeGen/X86/GC/ |
| ocaml-gc.ll | 24 ; CHECK-NEXT: # live roots for main
|
| /external/skia/src/effects/gradients/ |
| SkTwoPointConicalGradient.cpp | 20 // Return the number of distinct real roots, and write them into roots[] in
22 static int find_quad_roots(float A, float B, float C, float roots[2]) {
23 SkASSERT(roots);
26 return valid_divide(-C, B, roots);
48 roots[0] = 0;
54 roots[0] = r0 < r1 ? r0 : r1;
55 roots[1] = r0 > r1 ? r0 : r1;
89 float roots[2]; local
92 int countRoots = find_quad_roots(fA, fB, C, roots);
[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/chromium_org/remoting/host/installer/ |
| build-installer-archive.py | 91 of this, if you have roots that share a common prefix, the longest string
221 ' --source-file-roots <list of roots to strip off source files...>\n'
244 if arg == '--source-file-roots':
245 arg_mode = 'src-roots'
255 elif arg_mode == 'src-roots':
273 # Sort roots to ensure the longest one is first. See comment in remapSrcFile
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 256 /// The roots of the simulation graph. Usually there will be only
259 /// different roots reach the same state at the same program location.
260 NodeVector Roots;
304 /// addRoot - Add an untyped node to the set of roots.
306 Roots.push_back(V);
320 unsigned num_roots() const { return Roots.size(); }
344 roots_iterator roots_begin() { return Roots.begin(); }
346 roots_iterator roots_end() { return Roots.end(); }
348 const_roots_iterator roots_begin() const { return Roots.begin(); }
350 const_roots_iterator roots_end() const { return Roots.end();
[all...] |
| /external/chromium_org/tools/code_coverage/ |
| example.croc | 33 # Roots may also be specified on the command line via the --root option.
34 # Roots specified by --root are applied before those specified in config
36 'roots' : [
72 # regular expression (after applying mappings from 'roots') are
129 # altname (see 'roots' above).
|
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/ |
| RecentsCreateFragment.java | 99 final RootsCache roots = DocumentsApplication.getRootsCache(context); local
105 return new RecentsCreateLoader(context, roots, state);
152 public RecentsCreateLoader(Context context, RootsCache roots, State state) {
154 mRoots = roots;
176 // restore. This also filters away roots that don't
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 22 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4],
52 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
54 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
58 roots[index] = 1 - roots[index];
64 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
68 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
71 double t = 1 - roots[index];
131 int roots = rootTs.intersect(q1, line) local
159 int roots = rootTs.intersect(q2, *testLines[index]); local
[all...] |
| /external/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 22 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4],
52 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
54 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
58 roots[index] = 1 - roots[index];
64 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
68 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
71 double t = 1 - roots[index];
131 int roots = rootTs.intersect(q1, line) local
159 int roots = rootTs.intersect(q2, *testLines[index]); local
[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 */
|
| /art/runtime/ |
| runtime.h | 311 // Visit all the roots. If only_dirty is true then non-dirty roots won't be visited. If
312 // clean_dirty is true then dirty roots will be marked as non-dirty after visiting.
316 // Visit all of the roots we can do safely do concurrently.
319 // Visit all of the non thread roots, we can do this with mutators unpaused.
322 // Visit all other roots which must be done with mutators suspended.
|
| /development/ndk/tools/ |
| headers-diff-bionic-vs-ndk.py | 4 # script should be in development/ndk/tools for correct roots autodetection
22 """Init platform roots and structures before collecting"""
116 """Automated roots initialization (AOSP oriented)"""
186 roots = self.diffs[arch].keys()
187 roots.sort()
188 for root in roots:
|
