Searched refs:ctrl_t (Results 1 – 9 of 9) sorted by relevance
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
D | raw_hash_set.cc | 26 alignas(16) ABSL_CONST_INIT ABSL_DLL const ctrl_t kEmptyGroup[16] = { 27 ctrl_t::kSentinel, ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty, 28 ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty, 29 ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty, 30 ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty, ctrl_t::kEmpty}; 46 bool ShouldInsertBackwards(size_t hash, const ctrl_t* ctrl) { in ShouldInsertBackwards() 52 void ConvertDeletedToEmptyAndFullToDeleted(ctrl_t* ctrl, size_t capacity) { in ConvertDeletedToEmptyAndFullToDeleted() 53 assert(ctrl[capacity] == ctrl_t::kSentinel); in ConvertDeletedToEmptyAndFullToDeleted() 55 for (ctrl_t* pos = ctrl; pos < ctrl + capacity; pos += Group::kWidth) { in ConvertDeletedToEmptyAndFullToDeleted() 60 ctrl[capacity] = ctrl_t::kSentinel; in ConvertDeletedToEmptyAndFullToDeleted() [all …]
|
D | raw_hash_set.h | 259 enum class ctrl_t : int8_t { 265 (static_cast<int8_t>(ctrl_t::kEmpty) & 266 static_cast<int8_t>(ctrl_t::kDeleted) & 267 static_cast<int8_t>(ctrl_t::kSentinel) & 0x80) != 0, 270 ctrl_t::kEmpty < ctrl_t::kSentinel && ctrl_t::kDeleted < ctrl_t::kSentinel, 274 ctrl_t::kSentinel == static_cast<ctrl_t>(-1), 277 static_assert(ctrl_t::kEmpty == static_cast<ctrl_t>(-128), 281 (~static_cast<int8_t>(ctrl_t::kEmpty) & 282 ~static_cast<int8_t>(ctrl_t::kDeleted) & 283 static_cast<int8_t>(ctrl_t::kSentinel) & 0x7F) != 0, [all …]
|
D | raw_hash_set_benchmark.cc | 322 *begin = static_cast<ctrl_t>(value); in Iota() 327 std::array<ctrl_t, Group::kWidth> group; in BM_Group_Match() 339 std::array<ctrl_t, Group::kWidth> group; in BM_Group_MatchEmpty() 347 std::array<ctrl_t, Group::kWidth> group; in BM_Group_MatchEmptyOrDeleted() 355 std::array<ctrl_t, Group::kWidth> group; in BM_Group_CountLeadingEmptyOrDeleted() 364 std::array<ctrl_t, Group::kWidth> group; in BM_Group_MatchFirstEmptyOrDeleted() 373 std::vector<ctrl_t> ctrl(capacity + 1 + Group::kWidth); in BM_DropDeletes() 374 ctrl[capacity] = ctrl_t::kSentinel; in BM_DropDeletes() 375 std::vector<ctrl_t> pattern = {ctrl_t::kEmpty, static_cast<ctrl_t>(2), in BM_DropDeletes() 376 ctrl_t::kDeleted, static_cast<ctrl_t>(2), in BM_DropDeletes() [all …]
|
D | raw_hash_set_test.cc | 62 ctrl_t CtrlT(int i) { return static_cast<ctrl_t>(i); } in CtrlT() 176 ctrl_t group[] = {ctrl_t::kEmpty, CtrlT(1), ctrl_t::kDeleted, CtrlT(3), in TEST() 177 ctrl_t::kEmpty, CtrlT(5), ctrl_t::kSentinel, CtrlT(7), in TEST() 186 ctrl_t group[] = {ctrl_t::kEmpty, CtrlT(1), CtrlT(2), in TEST() 187 ctrl_t::kDeleted, CtrlT(2), CtrlT(1), in TEST() 188 ctrl_t::kSentinel, CtrlT(1)}; in TEST() 199 ctrl_t group[] = {ctrl_t::kEmpty, CtrlT(1), ctrl_t::kDeleted, CtrlT(3), in TEST() 200 ctrl_t::kEmpty, CtrlT(5), ctrl_t::kSentinel, CtrlT(7), in TEST() 205 ctrl_t group[] = {ctrl_t::kEmpty, CtrlT(1), CtrlT(2), in TEST() 206 ctrl_t::kDeleted, CtrlT(2), CtrlT(1), in TEST() [all …]
|
/third_party/node/deps/v8/src/objects/ |
D | swiss-hash-table-helpers.h | 171 using ctrl_t = signed char; variable 176 enum Ctrl : ctrl_t { 217 inline static swiss_table::ctrl_t H2(uint32_t hash) { in H2() 241 explicit GroupSse2Impl(const ctrl_t* pos) { in GroupSse2Impl() 277 void ConvertSpecialToEmptyAndFullToDeleted(ctrl_t* dst) const { in ConvertSpecialToEmptyAndFullToDeleted() 299 explicit GroupSse2Polyfill(const ctrl_t* pos) { memcpy(ctrl_, pos, kWidth); } in GroupSse2Polyfill() 327 void ConvertSpecialToEmptyAndFullToDeleted(ctrl_t* dst) const { in ConvertSpecialToEmptyAndFullToDeleted() 348 ctrl_t ctrl_[kWidth]; 354 explicit GroupPortableImpl(const ctrl_t* pos) in GroupPortableImpl() 356 reinterpret_cast<uintptr_t>(const_cast<ctrl_t*>(pos)))) {} in GroupPortableImpl() [all …]
|
D | swiss-name-dictionary.h | 266 using ctrl_t = swiss_table::ctrl_t; 300 inline ctrl_t* CtrlTable(); 302 inline static bool IsEmpty(ctrl_t c); 303 inline static bool IsFull(ctrl_t c); 304 inline static bool IsDeleted(ctrl_t c); 305 inline static bool IsEmptyOrDeleted(ctrl_t c); 309 inline void SetCtrl(int entry, ctrl_t h); 310 inline ctrl_t GetCtrl(int entry);
|
D | swiss-name-dictionary-inl.h | 32 swiss_table::ctrl_t* SwissNameDictionary::CtrlTable() { in OBJECT_CONSTRUCTORS_IMPL() 33 return reinterpret_cast<ctrl_t*>( in OBJECT_CONSTRUCTORS_IMPL() 173 ctrl_t* ctrl = CtrlTable(); in FindEntry() 351 swiss_table::ctrl_t SwissNameDictionary::GetCtrl(int entry) { in GetCtrl() 357 void SwissNameDictionary::SetCtrl(int entry, ctrl_t h) { in SetCtrl() 361 ctrl_t* ctrl = CtrlTable(); in SetCtrl() 722 bool SwissNameDictionary::IsEmpty(ctrl_t c) { return c == Ctrl::kEmpty; } in IsEmpty() 725 bool SwissNameDictionary::IsFull(ctrl_t c) { in IsFull() 733 bool SwissNameDictionary::IsDeleted(ctrl_t c) { return c == Ctrl::kDeleted; } in IsDeleted() 736 bool SwissNameDictionary::IsEmptyOrDeleted(ctrl_t c) { in IsEmptyOrDeleted()
|
/third_party/node/deps/v8/src/diagnostics/ |
D | objects-debug.cc | 1424 ctrl_t ctrl = GetCtrl(i); in SwissNameDictionaryVerify() 1475 ctrl_t ctrl = GetCtrl(entry); in SwissNameDictionaryVerify()
|
D | objects-printer.cc | 1047 ctrl_t ctrl = CtrlTable()[i]; in SwissNameDictionaryPrint()
|