Home
last modified time | relevance | path

Searched refs:roots (Results 101 - 125 of 206) sorted by relevance

123456789

/third_party/gn/tools/
H A Dfind_unreachable.py55 '--from', action='append', dest='roots',
67 reachable = find_reachable_targets(cmd_args.roots, targets_graph)
/third_party/node/deps/v8/src/compiler/
H A Dtyper.h38 // TODO(bmeurer,jarin): Remove this once we have a notion of "roots" on Graph.
39 void Run(const ZoneVector<Node*>& roots,
H A Dheap-refs.cc1951 ReadOnlyRoots roots(isolate); in GetOddballType()
1952 if (map == roots.undefined_map()) { in GetOddballType()
1955 if (map == roots.null_map()) { in GetOddballType()
1958 if (map == roots.boolean_map()) { in GetOddballType()
1961 if (map == roots.the_hole_map()) { in GetOddballType()
1964 if (map == roots.uninitialized_map()) { in GetOddballType()
1967 DCHECK(map == roots.termination_exception_map() || in GetOddballType()
1968 map == roots.arguments_marker_map() || in GetOddballType()
1969 map == roots.optimized_out_map() || map == roots in GetOddballType()
[all...]
/third_party/node/deps/v8/src/objects/
H A Dsource-text-module.cc554 ReadOnlyRoots roots(isolate); in FetchStarExports()
559 if (!entry->export_name().IsUndefined(roots)) { in FetchStarExports()
581 if (!requested_exports->ToKey(roots, index, &key)) continue; in FetchStarExports()
584 if (name->Equals(roots.default_string())) continue; in FetchStarExports()
585 if (!exports->Lookup(name).IsTheHole(roots)) continue; in FetchStarExports()
591 if (*it->second == *cell || it->second->IsUndefined(roots)) { in FetchStarExports()
598 it->second = roots.undefined_value_handle(); in FetchStarExports()
H A Dshared-function-info.cc178 void SharedFunctionInfo::SetScript(ReadOnlyRoots roots, in SetScript() argument
223 HeapObjectReference::Strong(roots.undefined_value())); in SetScript()
324 ReadOnlyRoots roots = GetReadOnlyRoots(); in HasSourceCode() local
325 return !script().IsUndefined(roots) && in HasSourceCode()
326 !Script::cast(script()).source().IsUndefined(roots) && in HasSourceCode()
H A Dshared-function-info.h22 #include "src/roots/roots.h"
198 void Init(ReadOnlyRoots roots, int unique_id);
217 V8_EXPORT_PRIVATE void SetScript(ReadOnlyRoots roots,
695 void SharedFunctionInfoVerify(ReadOnlyRoots roots);
H A Dproperty-cell.h58 void ClearAndInvalidate(ReadOnlyRoots roots);
/third_party/node/tools/gyp/pylib/gyp/
H A Dcommon.py303 def DeepDependencyTargets(target_dicts, roots):
306 pending = set(roots)
319 return list(dependencies - set(roots))
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon.py296 def DeepDependencyTargets(target_dicts, roots):
299 pending = set(roots)
312 return list(dependencies - set(roots))
/third_party/rust/crates/bindgen/bindgen/ir/
H A Dcontext.rs509 roots: R, in new()
517 traversal: ItemTraversal::new(ctx, roots, predicate), in new()
1208 let roots = self.items().map(|(id, _)| id); in assert_no_dangling_item_traversal()
1211 roots, in assert_no_dangling_item_traversal()
2304 let roots = { in compute_allowlisted_and_codegen_items()
2305 let mut roots = self in compute_allowlisted_and_codegen_items() variables
2307 // Only consider roots that are enabled for codegen. in compute_allowlisted_and_codegen_items()
2421 roots.reverse(); in compute_allowlisted_and_codegen_items()
2422 roots in compute_allowlisted_and_codegen_items()
2429 // Only follow InnerType edges from the allowlisted roots in compute_allowlisted_and_codegen_items()
[all...]
/kernel/linux/linux-5.10/drivers/md/
H A Ddm-verity-fec.h39 size_t io_size; /* IO size for roots */
44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/
H A Di915_buddy.h56 struct i915_buddy_block **roots; member
/kernel/linux/linux-6.6/drivers/md/
H A Ddm-verity-fec.h39 size_t io_size; /* IO size for roots */
44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c172 * the same root or different roots) that we could find. The sharedness
1377 * When roots are found, they're added to the roots list
1408 ASSERT(ctx->roots == NULL); in find_parent_nodes()
1585 * the list of found roots is updated. in find_parent_nodes()
1603 if (ctx->roots && ref->count && ref->root_id && ref->parent == 0) { in find_parent_nodes()
1605 ret = ulist_add(ctx->roots, ref->root_id, 0, GFP_NOFS); in find_parent_nodes()
1726 * Walk all backrefs for a given extent to find all roots that reference this
1736 * Found roots are added to @ctx->roots, whic
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.h49 u64 time_seq, struct ulist **roots, bool ignore_offset);
65 struct ulist *roots, struct ulist *tmp_ulist);
/third_party/mesa3d/src/compiler/isaspec/
H A Dencode.py216 for name, root in self.isa.roots.items():
285 extr = 'encode' + isa.roots[field.type].get_c_name() + '(s, ' + p + ', ' + extr + ')'
647 bitmask_t tmp = encode${isa.roots[f.field.type].get_c_name()}(s, &bp, ${s.extractor(leaf, f.field.name)});
/third_party/skia/third_party/externals/angle2/scripts/
H A Dexport_targets.py311 def gather_libraries(roots: Sequence[str], descs: dict) -> Set[str]:
322 dag_traverse(roots, fn)
/third_party/skia/src/pathops/
H A DSkPathOpsCubic.h99 * Return the number of valid roots (0 < root < 1) for this cubic intersecting the
102 int horizontalIntersect(double yIntercept, double roots[3]) const;
104 * Return the number of valid roots (0 < root < 1) for this cubic intersecting the
107 int verticalIntersect(double xIntercept, double roots[3]) const;
/third_party/node/deps/v8/src/heap/
H A Dfactory.cc69 #include "src/roots/roots.h"
114 const ReadOnlyRoots roots(isolate_); in BuildInternal()
117 ? roots.trampoline_trivial_code_data_container_handle() in BuildInternal()
118 : roots.trampoline_promise_rejection_code_data_container_handle()); in BuildInternal()
630 ReadOnlyRoots roots(isolate()); in CreateCanonicalEmptySwissNameDictionary()
636 Map map = roots.swiss_name_dictionary_map(); in CreateCanonicalEmptySwissNameDictionary()
1851 Heap* roots = allocation_type == AllocationType::kMap in NewMap() local
1854 result.set_map_after_allocation(ReadOnlyRoots(roots).meta_map(), in NewMap()
1857 elements_kind, inobject_properties, roots), in NewMap()
1861 InitializeMap(Map map, InstanceType type, int instance_size, ElementsKind elements_kind, int inobject_properties, Heap* roots) InitializeMap() argument
[all...]
/third_party/gn/src/gn/
H A Dxcode_writer.cc221 // Returns the list of roots to use when looking for additional files
230 const std::vector<base::FilePath::StringType> roots = in GetAdditionalFilesRoots() local
235 for (const base::FilePath::StringType& root : roots) { in GetAdditionalFilesRoots()
746 // listed in --xcode-additional-files-roots. in AddSourcesFromBuilder()
750 const std::vector<base::FilePath> roots = in AddSourcesFromBuilder() local
753 for (const base::FilePath& root : roots) { in AddSourcesFromBuilder()
/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:
/kernel/linux/linux-5.10/security/selinux/ss/
H A Dsidtab.h81 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/kernel/linux/linux-6.6/include/drm/
H A Ddrm_buddy.h75 struct drm_buddy_block **roots; member
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dsidtab.h80 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member

Completed in 38 milliseconds

123456789