Home
last modified time | relevance | path

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

1234567

/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...]
H A DSkPathOpsAsWinding.cpp110 int roots = 0; in left_edge() local
118 roots = SkDQuad::FindExtrema(&quad[0].fX, &t); in left_edge()
120 if (roots) { in left_edge()
131 roots = SkDConic::FindExtrema(&conic[0].fX, weight, &t); in left_edge()
133 if (roots) { in left_edge()
146 roots = SkDCubic::FindExtrema(&cubic[0].fX, tValues); in left_edge()
147 SkASSERT(roots <= 2); in left_edge()
148 for (int index = 0; index < roots; ++index) { in left_edge()
156 if (roots) { in left_edge()
/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...]
H A Dfactory-base-inl.h14 #include "src/roots/roots.h"
101 ReadOnlyRoots roots = read_only_roots(); in NewStructInternal() local
102 Map map = Map::GetInstanceTypeMap(roots, type); in NewStructInternal()
104 return StructType::cast(NewStructInternal(roots, map, size, allocation)); in NewStructInternal()
108 Struct FactoryBase<Impl>::NewStructInternal(ReadOnlyRoots roots, Map map, in NewStructInternal() argument
114 Object value = roots.undefined_value(); in NewStructInternal()
/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 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 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 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()
H A Dtransitions.cc256 bool TransitionsAccessor::IsSpecialTransition(ReadOnlyRoots roots, Name name) { in IsSpecialTransition() argument
258 return name == roots.nonextensible_symbol() || in IsSpecialTransition()
259 name == roots.sealed_symbol() || name == roots.frozen_symbol() || in IsSpecialTransition()
260 name == roots.elements_transition_symbol() || in IsSpecialTransition()
261 name == roots.strict_function_transition_symbol(); in IsSpecialTransition()
723 ReadOnlyRoots roots = GetReadOnlyRoots();
729 if (!TransitionsAccessor::IsSpecialTransition(roots, key)) {
742 if (!TransitionsAccessor::IsSpecialTransition(roots, temp_key)) {
767 ReadOnlyRoots roots(isolate
[all...]
H A Dproperty-descriptor.cc86 ReadOnlyRoots roots(isolate); in ToPropertyDescriptorFastPath()
87 if (key == roots.enumerable_string()) { in ToPropertyDescriptorFastPath()
89 } else if (key == roots.configurable_string()) { in ToPropertyDescriptorFastPath()
91 } else if (key == roots.value_string()) { in ToPropertyDescriptorFastPath()
93 } else if (key == roots.writable_string()) { in ToPropertyDescriptorFastPath()
95 } else if (key == roots.get_string()) { in ToPropertyDescriptorFastPath()
99 } else if (key == roots.set_string()) { in ToPropertyDescriptorFastPath()
H A Ddictionary.h14 #include "src/roots/roots.h"
121 static inline uint32_t Hash(ReadOnlyRoots roots, Handle<Name> key);
122 static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
188 static inline Handle<Map> GetMap(ReadOnlyRoots roots);
210 static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
230 static inline Handle<Map> GetMap(ReadOnlyRoots roots);
260 static inline uint32_t Hash(ReadOnlyRoots roots, uint32_t key);
261 static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
297 static inline Handle<Map> GetMap(ReadOnlyRoots roots);
[all...]
/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:
/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...]
/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()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-repacker.hh348 hb_set_t roots; in assign_32bit_spaces() local
355 roots.add (l.objidx); in assign_32bit_spaces()
361 // Mark everything not in the subgraphs of 32 bit roots as visited. in assign_32bit_spaces()
365 if (!roots) return false; in assign_32bit_spaces()
367 while (roots) in assign_32bit_spaces()
370 if (!roots.next (&next)) break; in assign_32bit_spaces()
373 find_connected_nodes (next, roots, visited, connected_roots); in assign_32bit_spaces()
399 * Indices stored in roots will be updated if any of the roots are duplicated to new indices.
401 bool isolate_subgraph (hb_set_t& roots) in isolate_subgraph()
1060 hb_set_t roots; _try_isolating_subgraphs() local
[all...]
/third_party/node/test/common/
H A Dprof.js34 return { frame: first, roots: profile.head.children };
38 const { frame, roots } = findFirstFrame(file, func);
42 console.log(roots);

Completed in 15 milliseconds

1234567