Lines Matching refs:arity
790 uint32_t arity = 0;
803 DCHECK_GT(arity, i);
804 return arity == 1 ? vals.first : vals.array[i];
2371 c->start_merge.arity = 0;
2372 c->end_merge.arity = 1;
2514 if (c.start_merge.arity) Append("%u-", c.start_merge.arity);
2515 Append("%u", c.end_merge.arity);
2999 uint32_t arity = 0;
3015 arity = control_at(target)->br_merge()->arity;
3016 } else if (!VALIDATE(control_at(target)->br_merge()->arity == arity)) {
3018 pos, "br_table: label arity inconsistent with previous arity %d",
3019 arity);
3603 void InitMerge(Merge<Value>* merge, uint32_t arity, func get_val) {
3604 merge->arity = arity;
3605 if (arity == 1) {
3607 } else if (arity > 1) {
3608 merge->vals.array = this->zone()->template NewArray<Value>(arity);
3609 for (uint32_t i = 0; i < arity; i++) {
4603 if (c->br_merge()->arity == 0) {
4605 "br_on_cast must target a branch of arity at least 1");
4688 if (c->br_merge()->arity == 0) {
4690 "br_on_cast_fail must target a branch of arity at least 1");
4826 if (c->br_merge()->arity == 0) {
4827 this->DecodeError("%s must target a branch of arity at least 1",
4883 if (c->br_merge()->arity == 0) {
4884 this->DecodeError("%s must target a branch of arity at least 1",
5149 if (merge->arity == 1) {
5155 EnsureStackSpace(merge->arity);
5156 for (uint32_t i = 0; i < merge->arity; i++) {
5160 DCHECK_EQ(c->stack_depth + merge->arity, stack_size());
5265 // #(stack elements) == {merge->arity}, otherwise
5266 // #(stack elements) >= {merge->arity}.
5286 uint32_t arity = merge->arity;
5292 if (V8_UNLIKELY(strict_count ? actual != drop_values + arity
5293 : actual < drop_values + arity)) {
5295 arity, merge_description,
5299 // Typecheck the topmost {merge->arity} values on the stack.
5300 Value* stack_values = stack_end_ - (arity + drop_values);
5301 for (uint32_t i = 0; i < arity; ++i) {
5314 if (V8_UNLIKELY(strict_count && actual > drop_values + arity)) {
5316 arity, merge_description,
5321 for (int i = arity - 1, depth = drop_values; i >= 0; --i, ++depth) {
5326 static_cast<uint32_t>(EnsureStackArguments(drop_values + arity));
5331 Value* stack_base = stack_value(drop_values + arity);
5332 for (uint32_t i = 0; i < std::min(arity, inserted_value_count); i++) {
5368 if (c->end_merge.arity != c->start_merge.arity) {
5370 "start-arity and end-arity of one-armed if must match");
5373 for (uint32_t i = 0; i < c->start_merge.arity; ++i) {