| /external/smali/util/src/test/java/org/jf/util/ |
| D | PathUtilTest.java | 39 File[] roots = File.listRoots(); in pathUtilTest1() local
41 if (roots.length > 1) { in pathUtilTest1()
42 …File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "te… in pathUtilTest1()
43 …File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar +… in pathUtilTest1()
53 File[] roots = File.listRoots(); in pathUtilTest2() local
55 …File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "te… in pathUtilTest2()
56 …File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar +… in pathUtilTest2()
68 File[] roots = File.listRoots(); in pathUtilTest3() local
70 … File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); in pathUtilTest3()
71 … File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); in pathUtilTest3()
[all …]
|
| /external/eigen/unsupported/doc/examples/ |
| D | PolynomialSolver1.cpp | 12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
23 cout << "Real roots: " << mapRR.transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
36 …cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl <… in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
[all …]
|
| D | PolynomialUtils1.cpp | 9 Vector4d roots = Vector4d::Random(); in main() local
10 cout << "Roots: " << roots.transpose() << endl; in main()
12 roots_to_monicPolynomial( roots, polynomial ); in main()
18 evaluation[i] = poly_eval( polynomial, roots[i] ); } in main()
19 cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose(); in main()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsRect.cpp | 17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds()
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
[all …]
|
| D | SkPathOpsCurve.h | 360 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in line_intercept_h() argument
365 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y); in line_intercept_h()
366 return between(0, roots[0], 1); in line_intercept_h()
369 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in line_intercept_v() argument
374 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x); in line_intercept_v()
375 return between(0, roots[0], 1); in line_intercept_v()
378 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in quad_intercept_h() argument
380 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots); in quad_intercept_h()
383 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in quad_intercept_v() argument
385 return SkIntersections::VerticalIntercept(quad.set(a), x, roots); in quad_intercept_v()
[all …]
|
| D | SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
69 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
77 double roots[2]; in horizontalIntersect() local
78 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
80 double conicT = roots[index]; in horizontalIntersect()
103 int roots = this->intersectRay(rootVals); in intersect() local
104 for (int index = 0; index < roots; ++index) { in intersect()
125 int intersectRay(double roots[2]) { in intersectRay()
132 return this->validT(r, 0, roots); in intersectRay()
135 int validT(double r[3], double axisIntercept, double roots[2]) { in validT()
[all …]
|
| D | SkDCubicLineIntersection.cpp | 121 int intersectRay(double roots[3]) { in intersectRay()
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
133 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
154 int roots = intersectRay(rootVals); in intersect() local
155 for (int index = 0; index < roots; ++index) { in intersect()
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
173 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 139 int intersectRay(double roots[2]) { in intersectRay()
141 solve by rotating line+quad so line is horizontal, then finding the roots in intersectRay()
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
175 int roots = intersectRay(rootVals); in intersect() local
176 for (int index = 0; index < roots; ++index) { in intersect()
188 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
204 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect() local
205 for (int index = 0; index < roots; ++index) { in horizontalIntersect()
244 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect()
[all …]
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| D | tfprof_scope.cc | 64 std::vector<ScopeNode*> roots; in Build() local
65 // Found roots, which are nodes without "/". in Build()
70 roots.push_back(node); in Build()
78 root_->children.assign(roots.begin(), roots.end()); in Build()
88 std::vector<ScopeNode*> roots = Account(root_->children, opts); in ShowInternal() local
90 for (ScopeNode* n : roots) { in ShowInternal()
96 roots = SearchRoot(roots, opts.start_name_regexes); in ShowInternal()
99 root_->show_children.assign(roots.begin(), roots.end()); in ShowInternal()
111 void TFScope::Format(const std::vector<ScopeNode*> roots, string* display_str, in Format() argument
113 for (ScopeNode* node : roots) { in Format()
[all …]
|
| D | tfprof_graph.cc | 62 std::vector<GraphNode*> roots; in Build() local
65 roots.push_back(it->second.get()); in Build()
69 root_->children.insert(root_->children.end(), roots.begin(), roots.end()); in Build()
90 std::vector<GraphNode*> roots = Account(root_->children, opts, &visits); in ShowInternal() local
91 for (GraphNode* n : roots) { in ShowInternal()
99 roots = SearchRoot(roots, opts.start_name_regexes, &visits); in ShowInternal()
105 root_->show_children.assign(roots.begin(), roots.end()); in ShowInternal()
119 const std::vector<GraphNode*>& roots, const std::vector<string>& regexes, in SearchRoot() argument
122 if (roots.empty()) { in SearchRoot()
125 for (GraphNode* root : roots) { in SearchRoot()
[all …]
|
| /external/dagger2/java/dagger/hilt/processor/internal/root/ |
| D | RootProcessor.java | 128 // Skip further processing since there's no roots that need processing. in postRoundProcess()
132 // TODO(bcorso): Currently, if there's an exception in any of the roots we stop processing in postRoundProcess()
133 // all roots. We should consider if it's worth trying to continue processing for other in postRoundProcess()
134 // roots. At the moment, I think it's rare that if one root failed the others would not. in postRoundProcess()
184 // Calculate the roots processed in this round. We do this in the finally-block rather than in in postRoundProcess()
188 // Only add a sentinel for processed roots. Skip preprocessed roots since those will in postRoundProcess()
213 // Perform validation between roots in this compilation unit. in validateRoots()
224 "Cannot process test roots and app roots in the same compilation unit:" in validateRoots()
226 + "\n\tTest roots in this compilation unit: %s", in validateRoots()
232 "Cannot process multiple app roots in the same compilation unit: %s", in validateRoots()
[all …]
|
| /external/eigen/unsupported/test/ |
| D | polynomialsolver.cpp | 55 const RootsType& roots( psolve.roots() ); in aux_evalSolver() local
59 for( int i=0; i<roots.size(); ++i ){ in aux_evalSolver()
60 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); in aux_evalSolver()
61 der[i] = numext::maxi(RealScalar(1.), std::abs( poly_eval( pols_der, roots[i] ) )); in aux_evalSolver()
72 cerr << "Roots found: " << roots.transpose() << endl; in aux_evalSolver()
73 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl; in aux_evalSolver()
77 std::vector<RealScalar> rootModuli( roots.size() ); in aux_evalSolver()
78 Map< EvalRootsType > aux( &rootModuli[0], roots.size() ); in aux_evalSolver()
79 aux = roots.array().abs(); in aux_evalSolver()
112 template< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >
[all …]
|
| D | polynomialutils.cpp | 36 EvalRootsType roots = EvalRootsType::Random(deg); in realRoots_to_monicPolynomial_test() local
37 roots_to_monicPolynomial( roots, pols ); in realRoots_to_monicPolynomial_test()
40 for( int i=0; i<roots.size(); ++i ){ in realRoots_to_monicPolynomial_test()
41 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } in realRoots_to_monicPolynomial_test()
74 EvalRootsType roots = EvalRootsType::Random(deg); in CauchyBounds() local
75 roots_to_monicPolynomial( roots, pols ); in CauchyBounds()
78 _Scalar Max = roots.array().abs().maxCoeff(); in CauchyBounds()
79 _Scalar min = roots.array().abs().minCoeff(); in CauchyBounds()
83 cerr << "Roots: " << roots << endl; in CauchyBounds()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ShadowStackGCLowering.cpp | 53 /// roots.
60 /// Roots - GC roots in the current function. Each is a pair of the
62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon28817bb10111::ShadowStackGCLowering
109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
110 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
161 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
180 // int32_t NumRoots; // Number of roots in stack frame. in doInitialization()
182 // void *Meta[]; // May be absent for roots without metadata. in doInitialization()
[all …]
|
| /external/webrtc/tools_webrtc/sslroots/ |
| D | README.md | 4 [rtc_base/ssl_roots.h][ssl-roots-header], to update the SSL roots shipped
7 1. Download roots.pem from [pki.goog][pki-goog].
12 $ python tools_webrtc/sslroots/generate_sslroots.py roots.pem
15 3. Step 2 should have generated an ssl_roots.h file right next to roots.pem.
20 5. Delete the generated ssl_roots.h and roots.pem before creating the CL.
22 [ssl-roots-header]: https://cs.chromium.org/chromium/src/third_party/webrtc/rtc_base/ssl_roots.h
23 [pki-goog]: https://www.google.com/url?q=https://pki.google.com/roots.pem
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | PolynomialSolver.h | 20 * - real roots,
21 * - greatest, smallest complex roots,
22 * - real roots with greatest, smallest absolute real value,
23 * - greatest, smallest real roots.
25 * It stores the set of roots as a vector of complexes.
54 /** \returns the complex roots of the polynomial */
55 inline const RootsType& roots() const { return m_roots; } in roots() function
58 /** Clear and fills the back insertion sequence with the real roots of the polynomial
59 * i.e. the real part of the complex roots that have an imaginary part which
307 * Computes the complex roots of a real polynomial.
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | ShadowStackGCLowering.cpp | 35 /// roots.
43 /// Roots - GC roots in the current function. Each is a pair of the
45 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anonb96d8c4f0111::ShadowStackGCLowering
206 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
207 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
217 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
257 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
258 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
277 // int32_t NumRoots; // Number of roots in stack frame. in doInitialization()
279 // void *Meta[]; // May be absent for roots without metadata. in doInitialization()
[all …]
|
| /external/rust/crates/num-integer/src/ |
| D | roots.rs | 9 pub trait Roots: Integer { trait
22 /// # use num_integer::Roots;
29 /// # use num_integer::Roots;
36 /// use num_integer::Roots;
67 /// # use num_integer::Roots;
74 /// use num_integer::Roots;
96 /// use num_integer::Roots;
114 /// see [Roots::sqrt](trait.Roots.html#method.sqrt).
116 pub fn sqrt<T: Roots>(x: T) -> T { in sqrt()
121 /// see [Roots::cbrt](trait.Roots.html#method.cbrt).
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 57 using RootsT = decltype(DomTreeT::Roots);
367 // For postdominators, nodes with no forward successors are trivial roots that
368 // are always selected as tree roots. Roots with forward successors correspond
380 // Finds all roots without relaying on the set of roots already stored in the
382 // We define roots to be some non-redundant set of the CFG nodes
385 RootsT Roots; in FindRoots() local
389 Roots.push_back(GetEntryNode(DT)); in FindRoots()
390 return Roots; in FindRoots()
399 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n"); in FindRoots()
401 // Step #1: Find all the trivial roots that are going to will definitely in FindRoots()
[all …]
|
| /external/dagger2/javatests/dagger/hilt/processor/internal/root/ |
| D | MyTestPreviousCompilationTest.java | 75 "Cannot process new roots when there are test roots from a previous compilation unit:" in testRootTest()
76 + "\n \tTest roots from previous compilation unit: " in testRootTest()
78 + "\n \tAll roots from this compilation unit: [test.TestRoot]"); in testRootTest()
103 "Cannot process new roots when there are test roots from a previous compilation unit:" in appRootTest()
104 + "\n \tTest roots from previous compilation unit: " in appRootTest()
106 + "\n \tAll roots from this compilation unit: [test.AppRoot]"); in appRootTest()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | 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.
84 std::vector<GCRoot> Roots; variable
94 // The bit vector is the more compact representation where >3.2% of roots
113 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
118 return Roots.erase(position); in removeStackRoot()
139 /// roots_begin/roots_end - Iterators for all roots in the function.
141 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
142 roots_iterator roots_end() { return Roots.end(); } in roots_end()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | GCMetadata.h | 18 // - Stack offsets for GC roots, as specified by calls to llvm.gcroot
20 // As a refinement, liveness analysis calculates the set of live roots at each
22 // generator, so all roots are assumed live.
87 std::vector<GCRoot> Roots; variable
97 // The bit vector is the more compact representation where >3.2% of roots
114 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
119 return Roots.erase(position); in removeStackRoot()
138 /// roots_begin/roots_end - Iterators for all roots in the function.
139 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
140 roots_iterator roots_end() { return Roots.end(); } in roots_end()
[all …]
|
| /external/skia/src/gpu/tessellate/ |
| D | Tessellation.cpp | 238 // NOTE: We only need the roots, so a uniform scale factor does not affect the solution. in FindCubicConvex180Chops()
245 // If -cuspThreshold <= discr_over_4 <= cuspThreshold, it means the two roots are within in FindCubicConvex180Chops()
276 // The two roots are close enough that we can consider them a single cusp. in FindCubicConvex180Chops()
278 // Pick the average of both roots. in FindCubicConvex180Chops()
310 float2 roots = float2{q,c} / float2{a,q}; in FindCubicConvex180Chops()
312 auto inside = (roots > kEpsilon) & (roots < (1 - kEpsilon)); in FindCubicConvex180Chops()
314 if (inside[1] && roots[0] != roots[1]) { in FindCubicConvex180Chops()
315 if (roots[0] > roots[1]) { in FindCubicConvex180Chops()
316 roots = skvx::shuffle<1,0>(roots); // Sort. in FindCubicConvex180Chops()
318 roots.store(T); in FindCubicConvex180Chops()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 352 // ST[y1] +1 +2 <-- Roots
370 SmallInstructionVector Roots; member
376 // The set of all DAG roots, and state tracking of all roots
389 /// Stage 1: Find all the DAG roots for the induction variable.
392 /// Stage 2: Validate if the found roots are valid.
407 std::map<int64_t,Instruction*> &Roots);
411 void collectInLoopUserSet(const SmallInstructionVector &Roots,
452 // The roots themselves.
722 const SmallInstructionVector &Roots, in collectInLoopUserSet() argument
726 for (Instruction *Root : Roots) in collectInLoopUserSet()
[all …]
|
| /external/perfetto/src/trace_processor/importers/memory_tracker/ |
| D | graph.cc | 60 std::vector<Node*> roots; in VisitInDepthFirstPreOrder() local
63 roots.push_back(it->second->root()); in VisitInDepthFirstPreOrder()
65 roots.push_back(shared_memory_graph_->root()); in VisitInDepthFirstPreOrder()
66 return PreOrderIterator{std::move(roots)}; in VisitInDepthFirstPreOrder()
70 std::vector<Node*> roots; in VisitInDepthFirstPostOrder() local
73 roots.push_back(it->second->root()); in VisitInDepthFirstPostOrder()
75 roots.push_back(shared_memory_graph_->root()); in VisitInDepthFirstPostOrder()
76 return PostOrderIterator(std::move(roots)); in VisitInDepthFirstPostOrder()
189 PreOrderIterator::PreOrderIterator(std::vector<Node*>&& roots) in PreOrderIterator() argument
190 : to_visit_(std::move(roots)) {} in PreOrderIterator()
[all …]
|