Lines Matching refs:index
45 size_t index = constants_.size();
46 DCHECK_LT(index, capacity());
50 return index + start_index();
54 size_t index) {
55 DCHECK_GE(index, start_index());
56 DCHECK_LT(index, start_index() + size());
57 return constants_[index - start_index()];
61 size_t index) const {
62 DCHECK_GE(index, start_index());
63 DCHECK_LT(index, start_index() + size());
64 return constants_[index - start_index()];
158 size_t index) const {
160 if (index <= slice->max_index()) {
168 MaybeHandle<Object> ConstantArrayBuilder::At(size_t index,
170 const ConstantArraySlice* slice = IndexToSlice(index);
171 DCHECK_LT(index, slice->capacity());
172 if (index < slice->start_index() + slice->size()) {
173 const Entry& entry = slice->At(index);
180 MaybeHandle<Object> ConstantArrayBuilder::At(size_t index,
183 MaybeHandle<Object> ConstantArrayBuilder::At(size_t index,
235 index_t index = static_cast<index_t>(AllocateIndex(Entry(number)));
236 heap_number_map_[number] = index;
237 return index;
319 void ConstantArrayBuilder::SetDeferredAt(size_t index, Handle<Object> object) {
320 ConstantArraySlice* slice = IndexToSlice(index);
321 return slice->At(index).SetDeferred(object);
324 void ConstantArrayBuilder::SetJumpTableSmi(size_t index, Smi smi) {
325 ConstantArraySlice* slice = IndexToSlice(index);
329 smi_map_.emplace(smi, static_cast<index_t>(index));
330 return slice->At(index).SetJumpTableSmi(smi);
345 index_t index = static_cast<index_t>(AllocateIndex(Entry(value)));
346 smi_map_[value] = index;
347 return index;
353 size_t index;
356 index = AllocateReservedEntry(value);
359 index = entry->second;
360 if (index > slice->max_index()) {
362 // index too big for the reserved operand_size. So, duplicate
364 index = AllocateReservedEntry(value);
366 DCHECK_LE(index, slice->max_index());
368 return index;