Lines Matching defs:index
635 TNode<Object> Argument(int index) const {
636 return TNode<Object>::UncheckedCast(JSCallNode{node_ptr()}.Argument(index));
640 TNode<T> ArgumentAs(int index) const {
641 return TNode<T>::UncheckedCast(Argument(index));
644 TNode<Object> ArgumentOrNaN(int index) {
646 ArgumentCount() > index ? Argument(index) : NaNConstant());
649 TNode<Object> ArgumentOrUndefined(int index) {
651 ArgumentCount() > index ? Argument(index) : UndefinedConstant());
654 TNode<Number> ArgumentOrZero(int index) {
656 ArgumentCount() > index ? Argument(index) : ZeroConstant());
725 // Returns {index,value}. Assumes that the map has not changed, but possibly
729 TNode<Number> index) {
733 index = CheckBounds(index, length);
741 AccessBuilder::ForFixedArrayElement(kind), elements, index);
742 return std::make_pair(index, value);
773 void StoreFixedArrayBaseElement(TNode<FixedArrayBase> o, TNode<Number> index,
775 StoreElement(AccessBuilder::ForFixedArrayElement(kind), o, index, v);
928 // C arguments include the receiver at index 0. Thus C index 1 corresponds
2133 // If the index is negative, it means the offset from the end and
3642 // C arguments should include the receiver at index 0.
4120 // The index of the first relevant parameter. Only non-zero when looking at
4121 // rest parameters, in which case it is set to the index of the first rest
4298 Node* index = jsgraph()->Constant(i);
4302 elements, index, effect, control);
5648 Node* index = graph()->NewNode(simplified()->NumberAdd(), length,
5653 elements, index, value, effect, control);
5928 Node* index = graph()->NewNode(
5935 graph()->NewNode(simplified()->NumberLessThan(), index, length);
5947 // When disable FLAG_turbo_loop_variable, typer cannot infer index
5951 // And we need to use index when using NumberLessThan to check
5952 // terminate and updating index, otherwise which will break inducing
5957 index, effect2, control2);
5970 index->ReplaceInput(1,
5971 graph()->NewNode(simplified()->NumberAdd(), index,
6315 Node* index = effect = graph()->NewNode(simplified()->LoadField(index_access),
6320 // the condition below, as it might not be needed (if the {index}
6338 // Check whether {index} is within the valid range for the {iterated_object}.
6339 Node* check = graph()->NewNode(simplified()->NumberLessThan(), index, length);
6348 // This extra check exists to refine the type of {index} but also to break
6350 index = etrue = graph()->NewNode(
6353 index, length, etrue, if_true);
6357 // Just return the {index}.
6358 value_true = index;
6392 base_ptr, external_ptr, index, etrue, if_true);
6397 elements, index, etrue, if_true);
6416 graph()->NewNode(javascript()->CreateKeyValueArray(), index,
6425 Node* next_index = graph()->NewNode(simplified()->NumberAdd(), index,
6486 Node* index = n.ArgumentOr(0, jsgraph()->ZeroConstant());
6498 // Check that the {index} is within range.
6499 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
6500 index, receiver_length, effect, control);
6504 index, effect, control);
6561 Node* index = n.ArgumentOr(0, jsgraph()->ZeroConstant());
6573 // Check that the {index} is within range.
6574 index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
6575 index, receiver_length, effect, control);
6579 receiver, index, effect, control);
6781 Node* index = effect = graph()->NewNode(
6786 // branch0: if (index < length)
6788 graph()->NewNode(simplified()->NumberLessThan(), index, length);
6799 string, index, etrue0, if_true0);
6803 index = graph()->NewNode(simplified()->NumberAdd(), index, char_length);
6806 receiver, index, etrue0, if_true0);
7398 Node* index = effect = graph()->NewNode(
7401 Node* value = graph()->NewNode(simplified()->NumberEqual(), index,
7545 // Self-heal the {receiver}s index.
7546 Node* index = effect = graph()->NewNode(
7555 index = effect =
7557 jsgraph()->HeapConstant(callable.code()), table, index,
7560 index = effect = graph()->NewNode(
7561 common()->TypeGuard(TypeCache::Get()->kFixedArrayLengthType), index,
7564 // Update the {index} and {table} on the {receiver}.
7567 receiver, index, effect, control);
7580 // Get current index and table from the JSCollectionIterator {receiver}.
7581 Node* index = effect = graph()->NewNode(
7594 // Look for the next non-holey key, starting from {index} in the {table}.
7615 // Skip holes and update the {index}.
7622 common()->Phi(MachineRepresentation::kTagged, 2), index, index, loop);
7624 index = effect = graph()->NewNode(
7628 Node* check0 = graph()->NewNode(simplified()->NumberLessThan(), index,
7657 graph()->NewNode(simplified()->NumberMultiply(), index,
7665 // Advance the index.
7666 index = graph()->NewNode(simplified()->NumberAdd(), index,
7684 // Advance the index on the {receiver}.
7688 receiver, index, effect, control);
7745 // Continue with next loop index.
7748 iloop->ReplaceInput(1, index);