Lines Matching refs:index
137 auto set_entry = [&](TNode<IntPtrT> index) {
139 CAST(elements), UncheckedCast<IntPtrT>(index));
164 auto set_entry = [&](TNode<IntPtrT> index) {
166 elements, UncheckedCast<IntPtrT>(index));
342 int index;
345 index = Context::JS_MAP_FUN_INDEX;
348 index = Context::JS_SET_FUN_INDEX;
351 index = Context::JS_WEAK_MAP_FUN_INDEX;
354 index = Context::JS_WEAK_SET_FUN_INDEX;
357 return CAST(LoadContextElement(native_context, index));
362 int index;
365 index = Context::MAP_SET_INDEX;
368 index = Context::SET_ADD_INDEX;
371 index = Context::WEAKMAP_SET_INDEX;
374 index = Context::WEAKSET_ADD_INDEX;
377 return CAST(LoadContextElement(native_context, index));
453 TNode<FixedArray> elements, TNode<IntPtrT> index) {
454 TNode<Object> element = UnsafeLoadFixedArrayElement(elements, index);
460 TNode<HeapObject> elements, TNode<IntPtrT> index) {
464 LoadFixedDoubleArrayElement(CAST(elements), index, &if_hole);
514 const TNode<IntPtrT> index)>;
517 const TNode<TableType> table, const TNode<IntPtrT> index,
524 TNode<TableType> table, TNode<IntPtrT> index, Label* if_end);
527 // The {result} variable will contain the entry index if the key was found,
538 // The {result} variable will contain the entry index if the key was found,
549 // The {result} variable will contain the entry index if the key was found,
561 // The {result} variable will contain the entry index if the key was found,
576 // The {result} variable will contain the entry index if the key was found,
631 // entry_start_position will be bound to the index of the entry (relative to
652 // Get the index of the bucket.
671 // If the entry index is the not-found sentinel, we are done.
676 // Make sure the entry index is within range.
687 // Compute the index of the entry relative to kHashTableStartIndex.
701 // Load the index of the next entry in the bucket chain.
874 const TNode<Object> index =
876 GotoIfNot(TaggedEqual(index, SmiConstant(0)), if_false);
939 const TNode<Object> index =
941 GotoIfNot(TaggedEqual(index, SmiConstant(0)), if_false);
976 TNode<IntPtrT> index;
977 std::tie(table, index) =
979 CSA_DCHECK(this, IntPtrEqual(index, IntPtrConstant(0)));
998 TVARIABLE(IntPtrT, var_index, index);
1321 auto index = Parameter<Smi>(Descriptor::kIndex);
1324 // Check if we need to update the {index}.
1325 GotoIfNot(SmiLessThan(SmiConstant(0), index), &return_zero);
1339 TVARIABLE(Smi, var_index, index);
1350 GotoIf(SmiGreaterThanOrEqual(removed_index, index), &return_index);
1366 const TNode<TableType> table, const TNode<IntPtrT> index,
1368 TVARIABLE(IntPtrT, var_index, index);
1396 // Update with the new {table} and {index}.
1413 const TNode<IntPtrT> index) {
1417 SmiTag(index));
1424 TNode<IntPtrT> index,
1438 TVARIABLE(IntPtrT, var_index, index);
1468 TNode<Smi> index =
1472 Branch(SmiGreaterThanOrEqual(index, SmiConstant(0)), &if_found,
1477 CAST(table), SmiUntag(index),
1494 TNode<Smi> index =
1498 Branch(SmiGreaterThanOrEqual(index, SmiConstant(0)), &if_found,
1909 // Transition {table} and {index} if there was any modification to
1911 TNode<IntPtrT> index = var_index.value();
1913 std::tie(table, index) = Transition<OrderedHashMap>(
1914 table, index, [](const TNode<OrderedHashMap>, const TNode<IntPtrT>) {});
1919 std::tie(entry_key, entry_start_position, index) =
1920 NextSkipHoles<OrderedHashMap>(table, index, &done_loop);
1933 var_index = index;
1996 TNode<IntPtrT> index;
1997 std::tie(table, index) =
2003 std::tie(entry_key, entry_start_position, index) =
2004 NextSkipHoles<OrderedHashMap>(table, index, &return_end);
2006 SmiTag(index));
2145 // Transition {table} and {index} if there was any modification to
2147 TNode<IntPtrT> index = var_index.value();
2149 std::tie(table, index) = Transition<OrderedHashSet>(
2150 table, index, [](const TNode<OrderedHashSet>, const TNode<IntPtrT>) {});
2155 std::tie(entry_key, entry_start_position, index) =
2156 NextSkipHoles<OrderedHashSet>(table, index, &done_loop);
2162 var_index = index;
2216 TNode<IntPtrT> index;
2217 std::tie(table, index) =
2223 std::tie(entry_key, entry_start_position, index) =
2224 NextSkipHoles<OrderedHashSet>(table, index, &return_end);
2226 SmiTag(index));
2601 const TNode<Smi> index =
2604 GotoIf(TaggedEqual(index, SmiConstant(-1)), &return_undefined);
2606 Return(LoadFixedArrayElement(table, SmiUntag(index)));
2623 const TNode<Object> index =
2626 GotoIf(TaggedEqual(index, SmiConstant(-1)), &return_false);
2787 const TNode<Object> index =
2790 GotoIf(TaggedEqual(index, SmiConstant(-1)), &return_false);