Home
last modified time | relevance | path

Searched refs:roots (Results 151 - 175 of 209) sorted by relevance

123456789

/third_party/spirv-tools/source/opt/
H A Dinstrument_pass.h202 // ids in |roots|.
204 std::queue<uint32_t>* roots,
/third_party/node/deps/v8/src/heap/
H A Dobject-stats.cc835 ReadOnlyRoots roots(heap_); in CanRecordFixedArray()
836 return array != roots.empty_fixed_array() && in CanRecordFixedArray()
837 array != roots.empty_slow_element_dictionary() && in CanRecordFixedArray()
838 array != roots.empty_property_dictionary(); in CanRecordFixedArray()
H A Dfactory-base.h13 #include "src/roots/roots.h"
285 Struct NewStructInternal(ReadOnlyRoots roots, Map map, int size,
/third_party/node/deps/v8/src/objects/
H A Dcode-inl.h1278 ReadOnlyRoots roots = GetReadOnlyRoots(); in SourcePositionTable()
1279 DCHECK(maybe_table.IsUndefined(roots) || maybe_table.IsException(roots)); in SourcePositionTable()
1280 return roots.empty_byte_array(); in SourcePositionTable()
H A Dstring-inl.h1070 bool SeqOneByteString::IsCompatibleMap(Map map, ReadOnlyRoots roots) { in IsCompatibleMap() argument
1071 return map == roots.one_byte_string_map() || in IsCompatibleMap()
1072 map == roots.shared_one_byte_string_map(); in IsCompatibleMap()
1076 bool SeqTwoByteString::IsCompatibleMap(Map map, ReadOnlyRoots roots) { in IsCompatibleMap() argument
1077 return map == roots.string_map() || map == roots.shared_string_map(); in IsCompatibleMap()
H A Dtransitions.h72 static bool IsSpecialTransition(ReadOnlyRoots roots, Name name);
H A Dobjects.h322 V8_INLINE bool IsNumber(ReadOnlyRoots roots) const;
325 // isolate/read-only roots overloads should be preferred where possible.
329 V8_INLINE bool Is##Type(ReadOnlyRoots roots) const; \
H A Dcode.cc22 #include "src/roots/roots-inl.h"
878 DependentCode DependentCode::empty_dependent_code(const ReadOnlyRoots& roots) { in empty_dependent_code() argument
879 return DependentCode::cast(roots.empty_weak_array_list()); in empty_dependent_code()
H A Dstring.h752 static inline bool IsCompatibleMap(Map map, ReadOnlyRoots roots);
799 static inline bool IsCompatibleMap(Map map, ReadOnlyRoots roots);
H A Dkeys.cc810 ReadOnlyRoots roots(isolate); in CommonCopyEnumKeysTo()
815 if (!dictionary->ToKey(roots, i, &key)) continue; in CommonCopyEnumKeysTo()
911 ReadOnlyRoots roots(isolate); in CollectKeysFromDictionary()
924 if (!raw_dictionary.ToKey(roots, i, &key)) continue; in CollectKeysFromDictionary()
H A Dfeedback-vector.cc57 ReadOnlyRoots roots = symbol.GetReadOnlyRoots(); in IsPropertyNameFeedback() local
58 return symbol != roots.uninitialized_symbol() && in IsPropertyNameFeedback()
59 symbol != roots.mega_dom_symbol() && in IsPropertyNameFeedback()
60 symbol != roots.megamorphic_symbol(); in IsPropertyNameFeedback()
H A Delements.cc199 ReadOnlyRoots roots(isolate); in CopyObjectToObjectElements()
200 DCHECK(to_base.map() != roots.fixed_cow_array_map()); in CopyObjectToObjectElements()
211 roots.the_hole_value(), length); in CopyObjectToObjectElements()
1422 ReadOnlyRoots roots(isolate);
1429 if (dict->IsKey(roots, index)) { in IsKey()
1447 if (dict->IsKey(roots, index)) {
1488 ReadOnlyRoots roots = holder.GetReadOnlyRoots(cage_base); in HasAccessorsImpl() local
1491 if (!dict.IsKey(roots, key)) continue; in HasAccessorsImpl()
1620 ReadOnlyRoots roots(isolate); in CollectElementIndicesImpl()
1624 if (!dictionary->IsKey(roots, raw_ke in CollectElementIndicesImpl()
[all...]
/third_party/skia/src/core/
H A DSkStroke.cpp969 static int intersect_quad_ray(const SkPoint line[2], const SkPoint quad[3], SkScalar roots[2]) {
980 return SkFindUnitQuadRoots(A, 2 * B, C, roots);
1050 SkScalar roots[2];
1051 int rootCount = intersect_quad_ray(ray, stroke, roots);
1056 SkPoint quadPt = SkEvalQuadAt(stroke, roots[0]);
1057 SkScalar error = fInvResScale * (SK_Scalar1 - SkScalarAbs(roots[0] - 0.5f) * 2);
H A DSkGeometry.h28 /** Given a quadratic equation Ax^2 + Bx + C = 0, return 0, 1, 2 roots for the
31 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]);
/kernel/linux/linux-5.10/fs/btrfs/
H A Dqgroup.c1213 * root while we are deleting the root. This is like dropping fs roots in btrfs_quota_disable()
2418 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2421 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt()
2431 if (!roots) in qgroup_update_refcnt()
2434 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2599 * Check if the @roots potentially is a list of fs tree roots
2601 * Return 0 for definitely not a fs/subvol tree roots ulist
2602 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2605 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2420 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
3242 struct ulist *roots = NULL; qgroup_rescan_leaf() local
[all...]
/third_party/mesa3d/src/compiler/isaspec/
H A Disa.py420 self.roots = {}
467 self.roots[b.name] = b
/third_party/skia/third_party/externals/freetype/src/sdf/
H A Dftsdf.c130 * roots of a cubic polynomial to find the shortest distance. However,
1478 /* Compute roots of a quadratic polynomial, assign them to `out`, */
1479 /* and return number of real roots. */
1531 /* Compute roots of a cubic polynomial, assign them to `out`, */
1532 /* and return number of real roots. */
2055 * (4) Now the roots of the equation can be computed using 'Cardano's in get_min_distance_conic()
2056 * Cubic formula'; we clamp the roots in the range [0.0f, 1.0f]. in get_min_distance_conic()
2072 FT_16D16 roots[3] = { 0, 0, 0 }; /* real roots of the cubic eq. */ in get_min_distance_conic() local
2077 FT_UShort num_roots; /* number of real roots o in get_min_distance_conic()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.h82 * commit roots when searching b+trees - this is a special case for
92 * List used to collect the IDs of the roots from which the target
96 struct ulist *roots; member
/third_party/node/deps/v8/src/compiler/
H A Dscheduler.cc1338 // Fixed nodes are always roots for schedule late. in InitializePlacement()
1407 void Run(NodeVector* roots) { in Run() argument
1408 for (Node* const root : *roots) { in Run()
1496 TRACE("roots: "); in ScheduleEarly()
1524 void Run(NodeVector* roots) { in Run() argument
1525 for (Node* const root : *roots) { in Run()
1862 TRACE("roots: "); in ScheduleLate()
1922 // TODO(turbofan): The following loop gathering the propagation roots is a in FuseFloatingControl()
1934 TRACE("propagation roots: "); in FuseFloatingControl()
/third_party/node/deps/v8/src/builtins/
H A Dbuiltins-array.cc884 ReadOnlyRoots roots(isolate); in EstimateElementCount()
887 if (dictionary.IsKey(roots, key)) { in EstimateElementCount()
961 ReadOnlyRoots roots(isolate); in CollectElementIndices()
964 if (!dict.IsKey(roots, k)) continue; in CollectElementIndices()
/third_party/python/Lib/
H A Dinspect.py1286 roots = []
1295 elif c not in roots:
1296 roots.append(c)
1299 roots.append(parent)
1300 return walktree(roots, children, None)
/kernel/linux/linux-6.6/arch/x86/kvm/mmu/
H A Dmmu.c2590 * Already invalid pages (previously active roots) are not on in __kvm_mmu_prepare_zap_page()
2620 * Make the request to free obsolete roots after marking the root in __kvm_mmu_prepare_zap_page()
2720 * four pages, e.g. for PAE roots or for 5-level paging. Temporarily in make_mmu_pages_available()
3593 /* Nothing to cleanup for dummy roots. */ in kvm_mmu_free_roots()
3624 * _only_ its own roots, e.g. INVVPID unconditionally exits. in kvm_mmu_free_guest_mode_roots()
3909 * is allocated if the other roots are valid and pml5 is needed, as any in mmu_alloc_special_roots()
3916 * The special roots should always be allocated in concert. Yell and in mmu_alloc_special_roots()
3917 * bail if KVM ends up in a state where only one of the roots is valid. in mmu_alloc_special_roots()
3981 * PAE roots (somewhat arbitrarily) aren't backed by shadow pages, the in is_unsync_root()
4345 /* Special roots, in is_page_fault_stale()
5805 kvm_mmu_invalidate_addr(struct kvm_vcpu *vcpu, struct kvm_mmu *mmu, u64 addr, unsigned long roots) kvm_mmu_invalidate_addr() argument
5855 unsigned long roots = 0; kvm_mmu_invpcid_gva() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/selftests/
H A Di915_buddy.c204 root = mm->roots[i]; in igt_check_mm()
/third_party/skia/third_party/externals/spirv-cross/
H A Dspirv_cross_c.cpp877 vector<RootConstants> roots; in spvc_compiler_hlsl_set_root_constants_layout() local
878 roots.reserve(count); in spvc_compiler_hlsl_set_root_constants_layout()
886 roots.push_back(root); in spvc_compiler_hlsl_set_root_constants_layout()
889 hlsl.set_root_constant_layouts(std::move(roots)); in spvc_compiler_hlsl_set_root_constants_layout()
/third_party/node/deps/v8/src/ast/
H A Dast.cc823 ReadOnlyRoots roots(isolate); in GetOrBuildDescription()
828 cooked_strings.set_undefined(roots, i); in GetOrBuildDescription()

Completed in 68 milliseconds

123456789