Home
last modified time | relevance | path

Searched refs:roots (Results 1 - 25 of 206) sorted by relevance

123456789

/third_party/skia/src/pathops/
H A DSkPathOpsRect.cpp17 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; in setBounds()
51 int roots = 0; setBounds() local
[all...]
H A DSkDCubicLineIntersection.cpp121 int intersectRay(double roots[3]) { in intersectRay() argument
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() argument
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()
189 double roots[3]; horizontalIntersect() local
230 VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) VerticalIntersect() argument
252 double roots[3]; verticalIntersect() local
[all...]
H A DSkDQuadLineIntersection.cpp139 int intersectRay(double roots[2]) { in intersectRay() argument
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() argument
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[ argument
260 int roots = verticalIntersect(axisIntercept, rootVals); verticalIntersect() local
452 HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) HorizontalIntercept() argument
457 VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) VerticalIntercept() argument
[all...]
H A DSkDConicLineIntersection.cpp67 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect() argument
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() argument
132 return this->validT(r, 0, roots); in intersectRay()
135 int validT(double r[3], double axisIntercept, double roots[ argument
145 verticalIntersect(double axisIntercept, double roots[2]) verticalIntersect() argument
155 double roots[2]; verticalIntersect() local
376 HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) HorizontalIntercept() argument
381 VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) VerticalIntercept() argument
[all...]
H A DSkPathOpsCurve.h360 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()
388 conic_intercept_h(const SkPoint a[2], SkScalar w, SkScalar y, double* roots) conic_intercept_h() argument
393 conic_intercept_v(const SkPoint a[2], SkScalar w, SkScalar x, double* roots) conic_intercept_v() argument
398 cubic_intercept_h(const SkPoint a[3], SkScalar , SkScalar y, double* roots) cubic_intercept_h() argument
403 cubic_intercept_v(const SkPoint a[3], SkScalar , SkScalar x, double* roots) cubic_intercept_v() argument
[all...]
/third_party/node/deps/v8/src/objects/
H A Dapi-callbacks-inl.h100 ReadOnlyRoots roots = GetReadOnlyRoots(); in IsSideEffectFreeCallHandlerInfo() local
101 DCHECK(map() == roots.side_effect_call_handler_info_map() || in IsSideEffectFreeCallHandlerInfo()
102 map() == roots.side_effect_free_call_handler_info_map() || in IsSideEffectFreeCallHandlerInfo()
103 map() == roots.next_call_side_effect_free_call_handler_info_map()); in IsSideEffectFreeCallHandlerInfo()
104 return map() == roots.side_effect_free_call_handler_info_map(); in IsSideEffectFreeCallHandlerInfo()
108 ReadOnlyRoots roots = GetReadOnlyRoots(); in IsSideEffectCallHandlerInfo() local
109 DCHECK(map() == roots.side_effect_call_handler_info_map() || in IsSideEffectCallHandlerInfo()
110 map() == roots.side_effect_free_call_handler_info_map() || in IsSideEffectCallHandlerInfo()
111 map() == roots.next_call_side_effect_free_call_handler_info_map()); in IsSideEffectCallHandlerInfo()
112 return map() == roots in IsSideEffectCallHandlerInfo()
121 ReadOnlyRoots roots = GetReadOnlyRoots(); NextCallHasNoSideEffect() local
[all...]
H A Dhash-table-inl.h14 #include "src/roots/roots-inl.h"
135 Handle<Map> HashTable<Derived, Shape>::GetMap(ReadOnlyRoots roots) { in GetMap() argument
136 return roots.hash_table_map_handle(); in GetMap()
140 Handle<Map> NameToIndexHashTable::GetMap(ReadOnlyRoots roots) { in GetMap() argument
141 return roots.name_to_index_hash_table_map_handle(); in GetMap()
145 Handle<Map> RegisteredSymbolTable::GetMap(ReadOnlyRoots roots) { in GetMap() argument
146 return roots.registered_symbol_table_map_handle(); in GetMap()
150 Handle<Map> EphemeronHashTable::GetMap(ReadOnlyRoots roots) { in GetMap() argument
151 return roots in GetMap()
163 FindEntry(PtrComprCageBase cage_base, ReadOnlyRoots roots, Key key, int32_t hash) FindEntry() argument
192 IsKey(ReadOnlyRoots roots, Object k) IsKey() argument
198 ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_k) ToKey() argument
284 Hash(ReadOnlyRoots roots, Handle<String> key) Hash() argument
289 HashForObject(ReadOnlyRoots roots, Object object) HashForObject() argument
298 HashForObject(ReadOnlyRoots roots, Object other) HashForObject() argument
302 Hash(ReadOnlyRoots roots, Handle<Name> key) Hash() argument
306 Hash(ReadOnlyRoots roots, Handle<Object> key) Hash() argument
310 HashForObject(ReadOnlyRoots roots, Object other) HashForObject() argument
[all...]
H A Dordered-hash-table-inl.h37 bool OrderedHashTable<Derived, entrysize>::IsKey(ReadOnlyRoots roots, in IsKey() argument
39 return k != roots.the_hole_value(); in IsKey()
84 Handle<Map> OrderedHashSet::GetMap(ReadOnlyRoots roots) { in GetMap() argument
85 return roots.ordered_hash_set_map_handle(); in GetMap()
88 Handle<Map> OrderedHashMap::GetMap(ReadOnlyRoots roots) { in GetMap() argument
89 return roots.ordered_hash_map_map_handle(); in GetMap()
92 Handle<Map> OrderedNameDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
93 return roots.ordered_name_dictionary_map_handle(); in GetMap()
96 Handle<Map> SmallOrderedNameDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
97 return roots in GetMap()
100 GetMap(ReadOnlyRoots roots) GetMap() argument
104 GetMap(ReadOnlyRoots roots) GetMap() argument
124 ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_key) ToKey() argument
[all...]
H A Dhash-table.h15 #include "src/roots/roots.h"
45 // static uint32_t Hash(ReadOnlyRoots roots, Key key);
47 // static uint32_t HashForObject(ReadOnlyRoots roots, Object object);
138 static inline Handle<Map> GetMap(ReadOnlyRoots roots);
146 ReadOnlyRoots roots, Key key, int32_t hash);
155 static inline bool IsKey(ReadOnlyRoots roots, Object k);
157 inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_k);
229 ReadOnlyRoots roots, uint32_t hash);
265 InternalIndex EntryForProbe(ReadOnlyRoots roots, Objec
[all...]
H A Ddictionary-inl.h198 Handle<Map> GlobalDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
199 return roots.global_dictionary_map_handle(); in GetMap()
211 Handle<Map> NameDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
212 return roots.name_dictionary_map_handle(); in GetMap()
266 uint32_t NumberDictionaryBaseShape::Hash(ReadOnlyRoots roots, uint32_t key) { in Hash() argument
267 return ComputeSeededHash(key, HashSeed(roots)); in Hash()
270 uint32_t NumberDictionaryBaseShape::HashForObject(ReadOnlyRoots roots, in HashForObject() argument
274 HashSeed(roots)); in HashForObject()
287 Handle<Map> NumberDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
288 return roots in GetMap()
291 GetMap(ReadOnlyRoots roots) GetMap() argument
301 Hash(ReadOnlyRoots roots, Handle<Name> key) Hash() argument
306 HashForObject(ReadOnlyRoots roots, Object other) HashForObject() argument
317 HashForObject(ReadOnlyRoots roots, Object other) HashForObject() argument
[all...]
H A Dsymbol-table.cc11 ReadOnlyRoots roots = this->GetReadOnlyRoots(); in SlowReverseLookup() local
14 if (!this->ToKey(roots, i, &k)) continue; in SlowReverseLookup()
18 return roots.undefined_value(); in SlowReverseLookup()
H A Dswiss-name-dictionary.cc46 ReadOnlyRoots roots(isolate); in Rehash()
62 if (table->ToKey(roots, entry, &key)) { in Rehash()
225 ReadOnlyRoots roots(isolate); in Rehash()
230 if (!ToKey(roots, entry, &key)) continue; in Rehash()
255 ReadOnlyRoots roots = this->GetReadOnlyRoots(); in NumberOfEnumerableProperties() local
259 if (!this->ToKey(roots, i, &k)) continue; in NumberOfEnumerableProperties()
272 ReadOnlyRoots roots(isolate); in SlowReverseLookup()
275 if (!ToKey(roots, i, &k)) continue; in SlowReverseLookup()
279 return roots.undefined_value(); in SlowReverseLookup()
H A Dlookup-inl.h229 ReadOnlyRoots roots(isolate); in UpdateProtector()
230 if (*name == roots.is_concat_spreadable_symbol() || in UpdateProtector()
231 *name == roots.constructor_string() || *name == roots.next_string() || in UpdateProtector()
232 *name == roots.species_symbol() || *name == roots.iterator_symbol() || in UpdateProtector()
233 *name == roots.resolve_string() || *name == roots.then_string()) { in UpdateProtector()
/third_party/node/deps/v8/src/heap/
H A Dsetup-heap-internal.cc191 ReadOnlyRoots roots(this); in FinalizePartialMap()
192 map.set_dependent_code(DependentCode::empty_dependent_code(roots)); in FinalizePartialMap()
194 map.SetInstanceDescriptors(isolate(), roots.empty_descriptor_array(), 0); in FinalizePartialMap()
195 map.set_prototype(roots.null_value()); in FinalizePartialMap()
196 map.set_constructor_or_back_pointer(roots.null_value()); in FinalizePartialMap()
225 ReadOnlyRoots roots(this); in CreateInitialMaps()
241 DCHECK_NE(roots.fixed_array_map(), roots.fixed_cow_array_map()); in CreateInitialMaps()
257 obj.set_map_after_allocation(roots.fixed_array_map(), SKIP_WRITE_BARRIER); in CreateInitialMaps()
266 obj.set_map_after_allocation(roots in CreateInitialMaps()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dqgroup-tests.c235 test_err("couldn't find old roots: %d", ret); in test_no_shared_qgroup()
238 old_roots = ctx.roots; in test_no_shared_qgroup()
239 ctx.roots = NULL; in test_no_shared_qgroup()
251 test_err("couldn't find old roots: %d", ret); in test_no_shared_qgroup()
254 new_roots = ctx.roots; in test_no_shared_qgroup()
255 ctx.roots = NULL; in test_no_shared_qgroup()
276 test_err("couldn't find old roots: %d", ret); in test_no_shared_qgroup()
279 old_roots = ctx.roots; in test_no_shared_qgroup()
280 ctx.roots = NULL; in test_no_shared_qgroup()
291 test_err("couldn't find old roots in test_no_shared_qgroup()
[all...]
/kernel/linux/linux-6.6/lib/
H A Dbch.c538 * this function builds and solves a linear system for finding roots of a degree
543 unsigned int *roots) in find_affine4_roots()
572 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
579 unsigned int *roots) in find_poly_deg1_roots()
585 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
591 * compute roots of a degree 2 polynomial over GF(2^m)
594 unsigned int *roots) in find_poly_deg2_roots()
611 * i.e. r and r+1 are roots iff Tr(u)=0 in find_poly_deg2_roots()
623 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
625 roots[ in find_poly_deg2_roots()
541 find_affine4_roots(struct bch_control *bch, unsigned int a, unsigned int b, unsigned int c, unsigned int *roots) find_affine4_roots() argument
578 find_poly_deg1_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg1_roots() argument
593 find_poly_deg2_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg2_roots() argument
635 find_poly_deg3_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg3_roots() argument
668 find_poly_deg4_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg4_roots() argument
907 find_poly_roots(struct bch_control *bch, unsigned int k, struct gf_poly *poly, unsigned int *roots) find_poly_roots() argument
947 chien_search(struct bch_control *bch, unsigned int len, struct gf_poly *p, unsigned int *roots) chien_search() argument
1204 unsigned int i, j, nbits, r, word, *roots; compute_generator_polynomial() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/
H A Di915_buddy.c126 mm->roots = kmalloc_array(mm->n_roots, in i915_buddy_init()
129 if (!mm->roots) in i915_buddy_init()
156 mm->roots[i] = root; in i915_buddy_init()
167 i915_block_free(mm->roots[i]); in i915_buddy_init()
168 kfree(mm->roots); in i915_buddy_init()
179 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); in i915_buddy_fini()
180 i915_block_free(mm->roots[i]); in i915_buddy_fini()
183 kfree(mm->roots); in i915_buddy_fini()
362 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in i915_buddy_alloc_range()
/third_party/mesa3d/src/mapi/new/
H A DgenCommon.py63 roots = [ etree.parse(xmlFile).getroot() for xmlFile in xmlFiles ]
64 return getFunctionsFromRoots(roots)
66 def getFunctionsFromRoots(roots):
68 for root in roots:
97 def getExportNamesFromRoots(target, roots):
107 return set(func.name for func in getFunctionsFromRoots(roots))
110 for root in roots:
/kernel/linux/linux-5.10/security/selinux/ss/
H A Dsidtab.c37 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
163 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
164 s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
166 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
170 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
171 s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
173 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
175 s->roots[l].ptr_inner->entries[0] = s->roots[ in sidtab_alloc_roots()
[all...]
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dsidtab.c38 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
164 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
165 s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
167 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
171 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
172 s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
174 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
176 s->roots[l].ptr_inner->entries[0] = s->roots[ in sidtab_alloc_roots()
[all...]
/third_party/node/deps/v8/src/numbers/
H A Dhash-seed-inl.h25 inline uint64_t HashSeed(ReadOnlyRoots roots);
32 #include "src/roots/roots-inl.h"
45 inline uint64_t HashSeed(ReadOnlyRoots roots) { in HashSeed() argument
47 roots.hash_seed().copy_out(0, reinterpret_cast<byte*>(&seed), kInt64Size); in HashSeed()
/third_party/node/deps/v8/src/snapshot/
H A Dread-only-deserializer.cc34 ReadOnlyRoots roots(isolate()); in DeserializeIntoIsolate()
36 roots.Iterate(this); in DeserializeIntoIsolate()
46 if (object->IsUndefined(roots)) break; in DeserializeIntoIsolate()
/kernel/linux/linux-5.10/drivers/md/
H A Ddm-verity-fec.c51 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8()
68 position = (index + rsb) * v->fec->roots; in fec_read_parity()
139 * one corrected target byte and consumes fec->roots parity bytes. in fec_decode_bufs()
157 offset += v->fec->roots; in fec_decode_bufs()
259 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
275 * maximum number (i.e. fec->roots) of erasures in fec_read_bufs()
277 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
539 v->fec->roots); in verity_fec_status_table()
573 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc()
642 v->fec->roots in verity_fec_parse_opt_args()
[all...]
/kernel/linux/linux-6.6/drivers/md/
H A Ddm-verity-fec.c51 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8()
68 position = (index + rsb) * v->fec->roots; in fec_read_parity()
139 * one corrected target byte and consumes fec->roots parity bytes. in fec_decode_bufs()
157 offset += v->fec->roots; in fec_decode_bufs()
259 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
275 * maximum number (i.e. fec->roots) of erasures in fec_read_bufs()
277 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
539 v->fec->roots); in verity_fec_status_table()
573 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc()
642 v->fec->roots in verity_fec_parse_opt_args()
[all...]
/third_party/skia/src/core/
H A DSkGeometry.cpp78 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { in SkFindUnitQuadRoots() argument
79 SkASSERT(roots); in SkFindUnitQuadRoots()
82 return return_check_zero(valid_unit_divide(-C, B, roots)); in SkFindUnitQuadRoots()
85 SkScalar* r = roots; in SkFindUnitQuadRoots()
101 if (r - roots == 2) { in SkFindUnitQuadRoots()
102 if (roots[0] > roots[1]) { in SkFindUnitQuadRoots()
104 swap(roots[0], roots[1]); in SkFindUnitQuadRoots()
105 } else if (roots[ in SkFindUnitQuadRoots()
[all...]

Completed in 17 milliseconds

123456789