/third_party/node/deps/v8/src/heap/ |
H A D | factory-base-inl.h | 14 #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/skia/src/core/ |
H A D | SkGeometry.cpp | 78 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...] |
H A D | SkQuadClipper.cpp | 34 SkScalar roots[2]; // we only expect one, but make room for 2 for safety in chopMonoQuadAt() local 35 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt() 37 *t = roots[0]; in chopMonoQuadAt()
|
/base/notification/distributed_notification_service/services/ans/src/common/ |
H A D | file_utils.cpp | 28 bool FileUtils::GetJsonByFilePath(const char *filePath, std::vector<nlohmann::json> &roots) in GetJsonByFilePath() argument 47 roots.push_back(localRoot); in GetJsonByFilePath() 56 roots.push_back(localRoot); in GetJsonByFilePath()
|
/third_party/node/test/common/ |
H A D | prof.js | 34 return { frame: first, roots: profile.head.children }; 38 const { frame, roots } = findFirstFrame(file, func); 42 console.log(roots);
|
/third_party/node/deps/v8/src/objects/ |
H A D | property-descriptor.cc | 86 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 D | transitions.cc | 256 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 D | dictionary.h | 14 #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...] |
H A D | swiss-name-dictionary-inl.h | 255 ReadOnlyRoots roots(isolate); in ClearDataTableEntry() 257 StoreToDataTable(entry, kDataTableKeyEntryIndex, roots.the_hole_value()); in ClearDataTableEntry() 258 StoreToDataTable(entry, kDataTableValueEntryIndex, roots.the_hole_value()); in ClearDataTableEntry() 489 bool SwissNameDictionary::IsKey(ReadOnlyRoots roots, Object key_candidate) { in IsKey() argument 490 return key_candidate != roots.the_hole_value(); in IsKey() 493 bool SwissNameDictionary::ToKey(ReadOnlyRoots roots, int entry, in ToKey() argument 496 if (!IsKey(roots, k)) return false; in ToKey() 501 bool SwissNameDictionary::ToKey(ReadOnlyRoots roots, InternalIndex entry, in ToKey() argument 503 return ToKey(roots, entry.as_int(), out_key); in ToKey() 562 ReadOnlyRoots roots(isolat in Initialize() [all...] |
H A D | string-set-inl.h | 28 uint32_t StringSetShape::Hash(ReadOnlyRoots roots, String key) { in Hash() argument 32 uint32_t StringSetShape::HashForObject(ReadOnlyRoots roots, Object object) { in HashForObject() argument
|
H A D | string-set.h | 19 static inline uint32_t Hash(ReadOnlyRoots roots, String key); 20 static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
|
/third_party/skia/third_party/externals/spirv-tools/source/opt/ |
H A D | remove_unused_interface_variables_pass.cpp | 52 std::queue<uint32_t> roots; in CollectUsedVariables() local 53 roots.push(entry_.GetSingleWordInOperand(1)); in CollectUsedVariables() 54 parent_.context()->ProcessCallTreeFromRoots(pfn_, &roots); in CollectUsedVariables()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
H A D | remove_unused_interface_variables_pass.cpp | 52 std::queue<uint32_t> roots; in CollectUsedVariables() local 53 roots.push(entry_.GetSingleWordInOperand(1)); in CollectUsedVariables() 54 parent_.context()->ProcessCallTreeFromRoots(pfn_, &roots); in CollectUsedVariables()
|
/third_party/skia/tests/ |
H A D | CubicMapTest.cpp | 18 double roots[3]; in accurate_t() local 19 SkDEBUGCODE(int count =) SkDCubic::RootsValidT(A, B, C, D, roots); in accurate_t() 21 return (float)roots[0]; in accurate_t()
|
/third_party/spirv-tools/source/opt/ |
H A D | remove_unused_interface_variables_pass.cpp | 53 std::queue<uint32_t> roots; in CollectUsedVariables() local 54 roots.push(entry_.GetSingleWordInOperand(1)); in CollectUsedVariables() 55 parent_.context()->ProcessCallTreeFromRoots(pfn_, &roots); in CollectUsedVariables()
|
H A D | ir_context.cpp | 932 // Collect all of the entry points as the roots. in ProcessEntryPointCallTree() 933 std::queue<uint32_t> roots; in ProcessEntryPointCallTree() local 935 roots.push(e.GetSingleWordInOperand(kEntryPointFunctionIdInIdx)); in ProcessEntryPointCallTree() 937 return ProcessCallTreeFromRoots(pfn, &roots); in ProcessEntryPointCallTree() 941 std::queue<uint32_t> roots; in ProcessReachableCallTree() local 945 roots.push(e.GetSingleWordInOperand(kEntryPointFunctionIdInIdx)); in ProcessReachableCallTree() 960 roots.push(id); in ProcessReachableCallTree() 967 return ProcessCallTreeFromRoots(pfn, &roots); in ProcessReachableCallTree() 971 std::queue<uint32_t>* roots) { in ProcessCallTreeFromRoots() 976 while (!roots in ProcessCallTreeFromRoots() 970 ProcessCallTreeFromRoots(ProcessFunction& pfn, std::queue<uint32_t>* roots) ProcessCallTreeFromRoots() argument 991 std::queue<uint32_t> roots; CollectCallTreeFromRoots() local [all...] |
/third_party/skia/third_party/externals/harfbuzz/src/ |
H A D | hb-repacker.hh | 348 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...] |
/kernel/linux/linux-5.10/lib/ |
H A D | bch.c | 572 * this function builds and solves a linear system for finding roots of a degree 577 unsigned int *roots) in find_affine4_roots() 606 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots() 613 unsigned int *roots) in find_poly_deg1_roots() 619 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots() 625 * compute roots of a degree 2 polynomial over GF(2^m) 628 unsigned int *roots) in find_poly_deg2_roots() 645 * i.e. r and r+1 are roots iff Tr(u)=0 in find_poly_deg2_roots() 657 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots() 659 roots[ in find_poly_deg2_roots() 575 find_affine4_roots(struct bch_control *bch, unsigned int a, unsigned int b, unsigned int c, unsigned int *roots) find_affine4_roots() argument 612 find_poly_deg1_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg1_roots() argument 627 find_poly_deg2_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg2_roots() argument 669 find_poly_deg3_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg3_roots() argument 702 find_poly_deg4_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg4_roots() argument 941 find_poly_roots(struct bch_control *bch, unsigned int k, struct gf_poly *poly, unsigned int *roots) find_poly_roots() argument 981 chien_search(struct bch_control *bch, unsigned int len, struct gf_poly *p, unsigned int *roots) chien_search() argument 1238 unsigned int i, j, nbits, r, word, *roots; compute_generator_polynomial() local [all...] |
/third_party/openssl/test/ |
H A D | crltest.c | 252 STACK_OF(X509) *roots = sk_X509_new_null(); in verify() 258 || !TEST_ptr(roots)) in verify() 263 if (!TEST_true(sk_X509_push(roots, root)) in verify() 266 X509_STORE_CTX_set0_trusted_stack(ctx, roots); in verify() 281 sk_X509_pop_free(roots, X509_free); in verify()
|
/third_party/skia/src/pathops/ |
H A D | SkPathOpsAsWinding.cpp | 110 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()
|
H A D | SkPathOpsCubic.cpp | 268 int roots = cubic.findMaxCurvature(maxCurvature); in ComplexBreak() local 279 for (int index = 0; index < roots; ++index) { in ComplexBreak() 288 for (int index = 0; index < roots; ++index) { in ComplexBreak() 298 for (int index = 0; index < roots; ++index) { in ComplexBreak() 367 // cubic roots 458 double* roots = s; 459 if (R2MinusQ3 < 0) { // we have 3 real roots 465 *roots++ = r; 469 *roots++ = r; 472 if (!AlmostDequalUlps(s[0], r) && (roots [all...] |
/kernel/linux/linux-6.6/drivers/gpu/drm/ |
H A D | drm_buddy.c | 131 mm->roots = kmalloc_array(mm->n_roots, in drm_buddy_init() 134 if (!mm->roots) in drm_buddy_init() 161 mm->roots[i] = root; in drm_buddy_init() 172 drm_block_free(mm, mm->roots[i]); in drm_buddy_init() 173 kfree(mm->roots); in drm_buddy_init() 192 WARN_ON(!drm_buddy_block_is_free(mm->roots[i])); in drm_buddy_fini() 193 drm_block_free(mm, mm->roots[i]); in drm_buddy_fini() 198 kfree(mm->roots); in drm_buddy_fini() 345 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in alloc_range_bias() 577 list_add_tail(&mm->roots[ in __drm_buddy_alloc_range() [all...] |
/third_party/node/deps/npm/node_modules/path-scurry/dist/cjs/ |
H A D | index.js | 194 * All roots found within the current PathScurry family 198 roots; 311 constructor(name, type = UNKNOWN, root, roots, nocase, children, opts) { 316 this.roots = roots; 1196 constructor(name, type = UNKNOWN, root, roots, nocase, children, opts) { 1197 super(name, type, root, roots, nocase, children, opts); 1203 return new PathWin32(name, type, this.root, this.roots, this.nocase, this.childrenCache(), opts); 1220 for (const [compare, root] of Object.entries(this.roots)) { 1222 return (this.roots[rootPat [all...] |
/third_party/node/deps/npm/node_modules/path-scurry/dist/mjs/ |
H A D | index.js | 166 * All roots found within the current PathScurry family 170 roots; 283 constructor(name, type = UNKNOWN, root, roots, nocase, children, opts) { 288 this.roots = roots; 1167 constructor(name, type = UNKNOWN, root, roots, nocase, children, opts) { 1168 super(name, type, root, roots, nocase, children, opts); 1174 return new PathWin32(name, type, this.root, this.roots, this.nocase, this.childrenCache(), opts); 1191 for (const [compare, root] of Object.entries(this.roots)) { 1193 return (this.roots[rootPat [all...] |
/third_party/node/test/sequential/ |
H A D | test-diagnostic-dir-heap-prof.js | 37 return { frame: first, roots: profile.head.children }; 41 const { frame, roots } = findFirstFrame(file, func); 45 console.log(roots);
|