Lines Matching defs:slice
115 // Print all the entries in the slice to help debug duplicates.
149 ConstantArraySlice* slice = idx_slice_[--i];
150 if (slice->size() > 0) {
151 return slice->start_index() + slice->size();
159 for (ConstantArraySlice* slice : idx_slice_) {
160 if (index <= slice->max_index()) {
161 return slice;
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);
191 for (const ConstantArraySlice* slice : idx_slice_) {
192 DCHECK_EQ(slice->reserved(), 0);
197 // all elements within a slice should be unique.
198 slice->CheckAllElementsAreUnique(isolate);
200 // Copy objects from slice into array.
201 for (size_t i = 0; i < slice->size(); ++i) {
203 slice->At(slice->start_index() + i).ToHandle(isolate);
207 size_t padding = slice->capacity() - slice->size();
293 ConstantArraySlice* slice = nullptr;
298 slice = idx_slice_[0];
301 slice = idx_slice_[1];
304 slice = idx_slice_[2];
307 DCHECK(slice->operand_size() == operand_size);
308 return slice;
320 ConstantArraySlice* slice = IndexToSlice(index);
321 return slice->At(index).SetDeferred(object);
325 ConstantArraySlice* slice = IndexToSlice(index);
330 return slice->At(index).SetJumpTableSmi(smi);
358 ConstantArraySlice* slice = OperandSizeToSlice(operand_size);
360 if (index > slice->max_index()) {
366 DCHECK_LE(index, slice->max_index());