Home
last modified time | relevance | path

Searched defs:roots (Results 1 - 25 of 78) sorted by relevance

1234

/third_party/node/deps/v8/src/objects/
H A Dsymbol-table.cc11 ReadOnlyRoots roots = this->GetReadOnlyRoots(); in SlowReverseLookup() local
H A Dstring-set-inl.h28 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 Dapi-callbacks-inl.h100 ReadOnlyRoots roots = GetReadOnlyRoots(); in IsSideEffectFreeCallHandlerInfo() local
108 ReadOnlyRoots roots = GetReadOnlyRoots(); in IsSideEffectCallHandlerInfo() local
121 ReadOnlyRoots roots = GetReadOnlyRoots(); NextCallHasNoSideEffect() local
[all...]
H A Dcompilation-cache-table.h26 static inline uint32_t Hash(ReadOnlyRoots roots, HashTableKey* key) { in Hash() argument
H A Dcompilation-cache-table-inl.h61 uint32_t CompilationCacheShape::HashForObject(ReadOnlyRoots roots, in HashForObject() argument
H A Dordered-hash-table-inl.h37 bool OrderedHashTable<Derived, entrysize>::IsKey(ReadOnlyRoots roots, in IsKey() argument
84 Handle<Map> OrderedHashSet::GetMap(ReadOnlyRoots roots) { in GetMap() argument
88 Handle<Map> OrderedHashMap::GetMap(ReadOnlyRoots roots) { in GetMap() argument
92 Handle<Map> OrderedNameDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
96 Handle<Map> SmallOrderedNameDictionary::GetMap(ReadOnlyRoots roots) { in GetMap() argument
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 Dscope-info-inl.h100 ReadOnlyRoots roots = scope_info()->GetReadOnlyRoots(); in advance_hashtable_index() local
/third_party/node/deps/v8/src/numbers/
H A Dhash-seed-inl.h45 inline uint64_t HashSeed(ReadOnlyRoots roots) { in HashSeed() argument
/third_party/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
34 int roots = 0; in setBounds() local
51 int roots = 0; setBounds() local
[all...]
/third_party/skia/tests/
H A DCubicMapTest.cpp18 double roots[3]; in accurate_t() local
H A DPathOpsConicQuadIntersectionTest.cpp56 int roots = i.intersect(conic, quad); in conicQuadIntersection() local
H A DPathOpsCubicQuadIntersectionTest.cpp77 int roots = i.intersect(cubic, quad); in cubicQuadIntersection() local
H A DPathOpsCubicConicIntersectionTest.cpp67 int roots = i.intersect(cubic, conic); in cubicConicIntersection() local
H A DPathOpsCubicLineIntersectionTest.cpp50 int roots = i.intersect(cubic, line); in testFail() local
152 int roots = doIntersect(i, cubic, line); in testOne() local
/third_party/skia/tools/
H A Drewrite_includes.py24 roots = [ variable
/third_party/skia/src/core/
H A DSkCubicMap.cpp30 double roots[3]; in compute_slow() local
H A DSkQuadClipper.cpp34 SkScalar roots[2]; // we only expect one, but make room for 2 for safety in chopMonoQuadAt() local
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dremove_unused_interface_variables_pass.cpp52 std::queue<uint32_t> roots; in CollectUsedVariables() local
H A Dfunction.cpp249 std::queue<uint32_t> roots; in IsRecursive() local
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dremove_unused_interface_variables_pass.cpp52 std::queue<uint32_t> roots; in CollectUsedVariables() local
H A Dfunction.cpp249 std::queue<uint32_t> roots; in IsRecursive() local
/third_party/spirv-tools/source/opt/
H A Dremove_unused_interface_variables_pass.cpp53 std::queue<uint32_t> roots; in CollectUsedVariables() local
H A Dfunction.cpp247 std::queue<uint32_t> roots; in IsRecursive() local
/third_party/gn/src/gn/
H A Dfunction_get_path_info.cc160 system ("/") or source ("//") roots, a "." will be appended such that it member
/third_party/node/deps/v8/src/heap/
H A Dfactory-base-inl.h101 ReadOnlyRoots roots = read_only_roots(); in NewStructInternal() local
108 Struct FactoryBase<Impl>::NewStructInternal(ReadOnlyRoots roots, Map map, in NewStructInternal() argument

Completed in 13 milliseconds

1234