| /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 …]
|
| /external/skqp/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 …]
|
| /external/v8/src/heap/ |
| D | setup-heap-internal.cc | 148 ReadOnlyRoots roots(this); in FinalizePartialMap() local
149 map->set_dependent_code(DependentCode::cast(roots.empty_weak_fixed_array())); in FinalizePartialMap()
151 map->set_instance_descriptors(roots.empty_descriptor_array()); in FinalizePartialMap()
155 map->set_prototype(roots.null_value()); in FinalizePartialMap()
156 map->set_constructor_or_backpointer(roots.null_value()); in FinalizePartialMap()
205 ReadOnlyRoots roots(this); in CreateInitialMaps() local
221 DCHECK_NE(roots.fixed_array_map(), roots.fixed_cow_array_map()); in CreateInitialMaps()
237 obj->set_map_after_allocation(roots.fixed_array_map(), SKIP_WRITE_BARRIER); in CreateInitialMaps()
245 obj->set_map_after_allocation(roots.weak_fixed_array_map(), in CreateInitialMaps()
255 obj->set_map_after_allocation(roots.weak_array_list_map(), in CreateInitialMaps()
[all …]
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| D | tfprof_scope.cc | 63 std::vector<ScopeNode*> roots; in Build() local
64 // Found roots, which are nodes without "/". in Build()
69 roots.push_back(node); in Build()
77 root_->children.assign(roots.begin(), roots.end()); in Build()
87 std::vector<ScopeNode*> roots = Account(root_->children, opts); in ShowInternal() local
89 for (ScopeNode* n : roots) { in ShowInternal()
95 roots = SearchRoot(roots, opts.start_name_regexes); in ShowInternal()
98 root_->show_children.assign(roots.begin(), roots.end()); in ShowInternal()
110 void TFScope::Format(const std::vector<ScopeNode*> roots, string* display_str, in Format() argument
112 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()
89 std::vector<GraphNode*> roots = Account(root_->children, opts, &visits); in ShowInternal() local
90 for (GraphNode* n : roots) { in ShowInternal()
98 roots = SearchRoot(roots, opts.start_name_regexes, &visits); in ShowInternal()
104 root_->show_children.assign(roots.begin(), roots.end()); in ShowInternal()
118 const std::vector<GraphNode*>& roots, const std::vector<string>& regexes, in SearchRoot() argument
121 if (roots.empty()) { in SearchRoot()
124 for (GraphNode* root : roots) { in SearchRoot()
[all …]
|
| /external/v8/src/objects/ |
| D | api-callbacks-inl.h | 105 ReadOnlyRoots roots = GetReadOnlyRoots(); in ACCESSORS() local
106 DCHECK(map() == roots.side_effect_call_handler_info_map() || in ACCESSORS()
107 map() == roots.side_effect_free_call_handler_info_map() || in ACCESSORS()
108 map() == roots.next_call_side_effect_free_call_handler_info_map()); in ACCESSORS()
109 return map() == roots.side_effect_free_call_handler_info_map(); in ACCESSORS()
113 ReadOnlyRoots roots = GetReadOnlyRoots(); in IsSideEffectCallHandlerInfo() local
114 DCHECK(map() == roots.side_effect_call_handler_info_map() || in IsSideEffectCallHandlerInfo()
115 map() == roots.side_effect_free_call_handler_info_map() || in IsSideEffectCallHandlerInfo()
116 map() == roots.next_call_side_effect_free_call_handler_info_map()); in IsSideEffectCallHandlerInfo()
117 return map() == roots.side_effect_call_handler_info_map(); in IsSideEffectCallHandlerInfo()
[all …]
|
| D | hash-table-inl.h | 13 #include "src/roots-inl.h"
76 int HashTable<Derived, Shape>::FindEntry(ReadOnlyRoots roots, Key key, in FindEntry() argument
82 Object* undefined = roots.undefined_value(); in FindEntry()
83 Object* the_hole = roots.the_hole_value(); in FindEntry()
99 bool HashTable<Derived, Shape>::IsKey(ReadOnlyRoots roots, Object* k) { in IsKey() argument
100 return Shape::IsKey(roots, k); in IsKey()
104 bool HashTable<Derived, Shape>::ToKey(ReadOnlyRoots roots, int entry, in ToKey() argument
107 if (!IsKey(roots, k)) return false; in ToKey()
113 bool BaseShape<KeyT>::IsKey(ReadOnlyRoots roots, Object* key) { in IsKey() argument
114 return IsLive(roots, key); in IsKey()
[all …]
|
| /external/eigen/unsupported/test/ |
| D | polynomialsolver.cpp | 45 const RootsType& roots( psolve.roots() ); in aux_evalSolver() local
47 for( int i=0; i<roots.size(); ++i ){ in aux_evalSolver()
48 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } in aux_evalSolver()
55 cerr << "Roots found: " << roots.transpose() << endl; in aux_evalSolver()
56 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl; in aux_evalSolver()
60 std::vector<Scalar> rootModuli( roots.size() ); in aux_evalSolver()
61 Map< EvalRootsType > aux( &rootModuli[0], roots.size() ); in aux_evalSolver()
62 aux = roots.array().abs(); in aux_evalSolver()
95 template< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >
96 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro… in evalSolverSugarFunction() argument
[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-7.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 __anondcdc57a40111::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/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | 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; member in __anonb1b206d10111::ShadowStackGC
210 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
221 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
263 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
264 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
[all …]
|
| /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 __anond1a93d4c0111::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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 55 using RootsT = decltype(DomTreeT::Roots);
358 // For postdominators, nodes with no forward successors are trivial roots that
359 // are always selected as tree roots. Roots with forward successors correspond
371 // Finds all roots without relaying on the set of roots already stored in the
373 // We define roots to be some non-redundant set of the CFG nodes
376 RootsT Roots; in FindRoots() local
380 Roots.push_back(GetEntryNode(DT)); in FindRoots()
381 return Roots; in FindRoots()
390 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n"); in FindRoots()
392 // Step #1: Find all the trivial roots that are going to will definitely in FindRoots()
[all …]
|
| /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/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.
92 std::vector<GCRoot> Roots; variable
102 // The bit vector is the more compact representation where >3.2% of roots
121 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
142 /// roots_begin/roots_end - Iterators for all roots in the function.
144 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
145 roots_iterator roots_end () { return Roots.end(); } in roots_end()
146 size_t roots_size() const { return Roots.size(); } in roots_size()
[all …]
|