Lines Matching defs:count
609 table_count = decoder->read_u32v<validate>(pc, &len, "table count");
649 const uint32_t table_count_; // the count of entries, not including default.
947 F(DeallocateLocals, uint32_t count) \
1023 const Value& value, const Value& count) \
1123 uint32_t entries = read_u32v<validate>(pc, &length, "local decls count");
1125 DecodeError(pc + *total_length, "invalid local decls count");
1129 TRACE("local decls count: %u\n", entries);
1138 uint32_t count =
1139 read_u32v<validate>(pc + *total_length, &length, "local count");
1141 DecodeError(pc + *total_length, "invalid local count");
1145 if (!VALIDATE(count <= kV8MaxWasmFunctionLocals - local_types_.size())) {
1146 DecodeError(pc + *total_length, "local count too large");
1155 total_count += count;
1160 local_types_.insert(insert_iterator, count, type) + count;
1161 num_locals_ += count;
1369 DecodeError(pc, "invalid table count (> max br_table size): %u",
2139 // Parameters count as initialized...
2667 // -1 because the current try block is not included in the count.
2674 // +1 because the current try block is not included in the count.
3634 // In reachable code, check if there are at least {count} values on the stack.
3635 // In unreachable code, if there are less than {count} values on the stack,
3638 V8_INLINE int EnsureStackArguments(int count) {
3640 if (V8_LIKELY(stack_size() >= count + limit)) return 0;
3641 return EnsureStackArguments_Slow(count, limit);
3644 V8_NOINLINE int EnsureStackArguments_Slow(int count, uint32_t limit) {
3646 NotEnoughArgumentsError(count, stack_size() - limit);
3653 int additional_values = count - current_values;
3669 int count = sig ? static_cast<int>(sig->parameter_count()) : 0;
3670 if (count == 0) return {};
3671 EnsureStackArguments(depth + count);
3672 ArgVector args(stack_value(depth + count), count);
3673 for (int i = 0; i < count; i++) {
3678 // Drops a number of stack elements equal to the {sig}'s parameter count (0 if
3681 int count = sig ? static_cast<int>(sig->parameter_count()) : 0;
3682 Drop(count);
3686 int count = static_cast<int>(type->field_count());
3687 if (count == 0) return {};
3688 EnsureStackArguments(depth + count);
3689 ArgVector args(stack_value(depth + count), count);
3690 for (int i = 0; i < count; i++) {
3695 // Drops a number of stack elements equal to the struct's field count, or all
5100 Value count = Peek(0, 2, kWasmI32);
5103 CALL_INTERFACE_IF_OK_AND_REACHABLE(TableFill, imm, start, value, count);
5234 // Drop the top {count} stack elements, or all of them if less than {count}
5236 V8_INLINE void Drop(int count = 1) {
5239 if (V8_UNLIKELY(stack_size() < limit + count)) {
5241 count = std::min(count, static_cast<int>(stack_size() - limit));
5243 DCHECK_LE(stack_, stack_end_ - count);
5244 stack_end_ -= count;