Lines Matching refs:value
159 // which must be a value between 0 (inclusive) and Capacity() (exclusive).
177 // |kGroupWidth|, but can have any value between 0 (inclusive) and Capacity()
261 void SwissNameDictionary::ValueAtPut(int entry, Object value) {
262 DCHECK(!value.IsTheHole());
263 StoreToDataTable(entry, kDataTableValueEntryIndex, value);
266 void SwissNameDictionary::ValueAtPut(InternalIndex entry, Object value) {
267 ValueAtPut(entry.as_int(), value);
325 // GetCtrl(entry) does a bounds check for |entry| value.
405 void SwissNameDictionary::SetMetaTableField(int field_index, int value) {
412 SetMetaTableField<uint8_t>(meta_table, field_index, value);
414 SetMetaTableField<uint16_t>(meta_table, field_index, value);
416 SetMetaTableField<uint32_t>(meta_table, field_index, value);
438 int field_index, int value) {
439 STATIC_ASSERT((std::is_same<T, uint8_t>::value) ||
440 (std::is_same<T, uint16_t>::value) ||
441 (std::is_same<T, uint32_t>::value));
442 DCHECK_LE(value, std::numeric_limits<T>::max());
446 raw_data[field_index] = value;
453 STATIC_ASSERT((std::is_same<T, uint8_t>::value) ||
454 (std::is_same<T, uint16_t>::value) ||
455 (std::is_same<T, uint32_t>::value));
510 Handle<Name> key, Handle<Object> value, PropertyDetails details,
520 int new_entry = table->AddInternal(*key, *value, details);
532 int SwissNameDictionary::AddInternal(Name key, Object value,
548 ValueAtPut(target, value);
755 value.length() >= kMetaTableEnumerationDataStartIndex)