Home
last modified time | relevance | path

Searched refs:roots (Results 126 - 150 of 209) sorted by relevance

123456789

/third_party/node/deps/v8/src/runtime/
H A Druntime-classes.cc214 ReadOnlyRoots roots(isolate); in SubstituteValues()
217 if (!Dictionary::IsKey(roots, maybe_key)) continue; in SubstituteValues()
261 ReadOnlyRoots roots(isolate); in UpdateProtectors()
264 if (!Dictionary::IsKey(roots, maybe_key)) continue; in UpdateProtectors()
/third_party/python/Lib/
H A Dfunctools.py191 roots = {op for op in _convert if getattr(cls, op, None) is not getattr(object, op, None)}
192 if not roots:
194 root = max(roots) # prefer __lt__ to __le__ to __gt__ to __ge__
196 if opname not in roots:
/third_party/node/deps/v8/src/heap/
H A Dheap-inl.h126 /* The deserializer makes use of the fact that these common roots are */ \
501 ReadOnlyRoots roots(this); in ToBoolean()
502 return condition ? roots.true_value() : roots.false_value(); in ToBoolean()
/third_party/node/deps/v8/src/objects/
H A Dcontexts.cc21 ReadOnlyRoots roots(isolate); in AddLocalNamesFromContext()
31 int32_t hash = NameToIndexShape::Hash(roots, name); in AddLocalNamesFromContext()
32 if (names_table->FindEntry(cage_base, roots, name, hash).is_found()) { in AddLocalNamesFromContext()
H A Dmodule.cc298 ReadOnlyRoots roots(isolate); in GetModuleNamespace()
299 if (!object->IsUndefined(roots)) { in GetModuleNamespace()
318 if (!exports->ToKey(roots, i, &key)) continue; in GetModuleNamespace()
H A Dlookup.cc193 ReadOnlyRoots roots(isolate); in InternalUpdateProtector()
194 if (*name == roots.constructor_string()) { in InternalUpdateProtector()
236 } else if (*name == roots.next_string()) { in InternalUpdateProtector()
258 } else if (*name == roots.species_symbol()) { in InternalUpdateProtector()
276 } else if (*name == roots.is_concat_spreadable_symbol()) { in InternalUpdateProtector()
279 } else if (*name == roots.iterator_symbol()) { in InternalUpdateProtector()
310 } else if (*name == roots.resolve_string()) { in InternalUpdateProtector()
317 } else if (*name == roots.then_string()) { in InternalUpdateProtector()
H A Dmap-inl.h683 auto roots = GetReadOnlyRoots(); in IsNullOrUndefinedMap() local
684 return *this == roots.null_map() || *this == roots.undefined_map(); in IsNullOrUndefinedMap()
H A Dheap-object.h12 #include "src/roots/roots.h"
100 // isolate/read-only roots overloads should be preferred where possible.
104 V8_INLINE bool Is##Type(ReadOnlyRoots roots) const; \
/third_party/skia/src/core/
H A DSkEdgeClipper.cpp77 SkScalar roots[2]; // we only expect one, but make room for 2 for safety in chopMonoQuadAt() local
78 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt()
80 *t = roots[0]; in chopMonoQuadAt()
H A DSkPath.cpp2751 SkScalar roots[2]; in winding_mono_conic() local
2758 int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); in winding_mono_conic()
2762 // zero roots are returned only when y0 == y in winding_mono_conic()
2767 SkScalar t = roots[0]; in winding_mono_conic()
2832 SkScalar roots[2]; in winding_mono_quad() local
2836 roots); in winding_mono_quad()
2840 // zero roots are returned only when y0 == y in winding_mono_quad()
2845 SkScalar t = roots[0]; in winding_mono_quad()
2951 SkScalar roots[2]; in tangent_conic() local
2958 int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); in tangent_conic()
2978 SkScalar roots[2]; tangent_quad() local
[all...]
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_lens_correction.cpp486 // considering the roots of its derivative which lie in the domain [0, 1 -
487 // maxDstGap]. gap' (r) is a 5th-order polynomial. One of its roots is
489 // interest. This leaves 4 other possible roots. We solve for these
493 real64 roots [4];
502 // No roots in [0,1].
509 // k7 is zero, but k5 is non-zero. At most two real roots.
516 // Two real roots.
522 roots [numRoots++] = scale * (offset + sDiscrim);
523 roots [numRoots++] = scale * (offset - sDiscrim);
534 // k7 is non-zero. Up to 4 real roots
[all...]
/third_party/node/deps/v8/src/snapshot/
H A Dserializer.cc616 ReadOnlyRoots roots(isolate()); in SerializeExternalStringAsSequentialString()
628 map = internalized ? roots.one_byte_internalized_string_map() in SerializeExternalStringAsSequentialString()
629 : roots.one_byte_string_map(); in SerializeExternalStringAsSequentialString()
635 map = internalized ? roots.internalized_string_map() : roots.string_map(); in SerializeExternalStringAsSequentialString()
1293 // serialization, i.e. no backrefs or roots. in SerializeCode()
/base/notification/common_event_service/services/include/
H A Dinner_common_event_manager.h191 bool GetJsonByFilePath(const char *filePath, std::vector<nlohmann::json> &roots);
/third_party/rust/crates/bindgen/bindgen/ir/
H A Dtraversal.rs189 /// the traversal's roots.
196 /// will only visit the traversal's roots and their inner types. This is used
399 /// Begin a new traversal, starting from the given roots.
402 roots: R, in new()
411 for id in roots { in new()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dqgroup.c1244 * root while we are deleting the root. This is like dropping fs roots in btrfs_quota_disable()
1859 * it would not use commit roots and would lock extent buffers, causing in btrfs_qgroup_trace_extent_post()
1891 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post()
2484 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2487 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt()
2497 if (!roots) in qgroup_update_refcnt()
2500 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2665 * Check if the @roots potentially is a list of fs tree roots
2667 * Return 0 for definitely not a fs/subvol tree roots ulis
2486 qgroup_update_refcnt(struct btrfs_fs_info *fs_info, struct ulist *roots, struct ulist *tmp, struct ulist *qgroups, u64 seq, int update_old) qgroup_update_refcnt() argument
2671 maybe_fs_roots(struct ulist *roots) maybe_fs_roots() argument
[all...]
/third_party/node/deps/v8/src/strings/
H A Dstring-stream.cc329 ReadOnlyRoots roots = array.GetReadOnlyRoots(); in PrintFixedArray() local
332 if (element.IsTheHole(roots)) continue; in PrintFixedArray()
/third_party/python/Tools/c-analyzer/c_common/
H A Dfsutil.py254 roots = root
255 for root in roots:
/third_party/skia/src/pathops/
H A DSkPathOpsWinding.cpp134 int roots = (*CurveIntercept[fVerb * 2 + xy_index(dir)])(fPts, fWeight, baseYX, tVals); in rayCheck() local
135 for (int index = 0; index < roots; ++index) { in rayCheck()
/base/notification/common_event_service/services/src/
H A Dinner_common_event_manager.cpp107 bool InnerCommonEventManager::GetJsonByFilePath(const char *filePath, std::vector<nlohmann::json> &roots) in GetJsonByFilePath() argument
126 roots.push_back(localRoot); in GetJsonByFilePath()
135 roots.push_back(localRoot); in GetJsonByFilePath()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dupgrade_memory_model.cpp649 std::queue<uint32_t> roots; in UpgradeBarriers() local
652 roots.push(e.GetSingleWordInOperand(1u)); in UpgradeBarriers()
653 if (context()->ProcessCallTreeFromRoots(CollectBarriers, &roots)) { in UpgradeBarriers()
H A Dinstrument_pass.h311 // ids in |roots|.
313 std::queue<uint32_t>* roots,
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dupgrade_memory_model.cpp649 std::queue<uint32_t> roots; in UpgradeBarriers() local
652 roots.push(e.GetSingleWordInOperand(1u)); in UpgradeBarriers()
653 if (context()->ProcessCallTreeFromRoots(CollectBarriers, &roots)) { in UpgradeBarriers()
H A Dinstrument_pass.h311 // ids in |roots|.
313 std::queue<uint32_t>* roots,
/third_party/spirv-tools/source/opt/
H A Dupgrade_memory_model.cpp657 std::queue<uint32_t> roots; in UpgradeBarriers() local
661 roots.push(e.GetSingleWordInOperand(1u)); in UpgradeBarriers()
662 if (context()->ProcessCallTreeFromRoots(CollectBarriers, &roots)) { in UpgradeBarriers()
/third_party/gn/src/gn/
H A Dfunction_get_path_info.cc160 system ("/") or source ("//") roots, a "." will be appended such that it member

Completed in 32 milliseconds

123456789