Lines Matching defs:spread
1834 inline bool IsSpreadAcceptable(int spread, int ncases) {
1835 return spread < FLAG_switch_table_spread_threshold * ncases;
1899 // Due to case spread will be used as the size of jump-table,
1905 int64_t spread = max - min + 1;
1907 DCHECK_GT(spread, 0);
1909 // Check if casted spread is acceptable and doesn't overflow.
1910 if (spread <= INT_MAX &&
1911 IsSpreadAcceptable(static_cast<int>(spread), cases->length())) {
3363 // If we have a leading spread, use CreateArrayFromIterable to create
3380 // There are some elements before the first (if any) spread, and we can
3385 // elements before the first spread. This also handle the empty array case
3431 // Insert the missing non-constant elements, up until the first spread
3452 // to store the next element, which comes from the first spread.
4133 // // A spread receives the remaining items in the iterator.
4168 Spread* spread = nullptr;
4171 spread = target->AsSpread();
4246 if (spread) {
4250 // A spread is turned into a loop over the remainer of the iterator.
4251 Expression* target = spread->expression();
4254 builder()->SetExpressionAsStatementPosition(spread);
5381 // If there is only one spread and it is the final argument, there is a
5384 // If there is a non-final spread, we rewrite calls like
5397 // if we have a non-final spread. For all other cases it is popped from args
5405 // specifies the call type (e.g., property, spread, tailcall, etc.).
5423 // TODO(leszeks): There's no special bytecode for tail calls or spread
5459 // TODO(leszeks): There's no special bytecode for tail calls or spread
5594 // If there is only one spread and it is the final argument, there is a
5597 // It there is a non-final spread, we rewrite something like
5712 // calling %reflect_construct if we have a non-final spread. For all other
5719 // If there is only one spread and it is the final argument, there is a
5722 // If there is a non-final spread, we rewrite calls like