Home | History | Annotate | Download | only in mips64

Lines Matching full:arg_count

470       int32_t arg_count = info_->scope()->num_parameters() + 1;
471 int32_t sp_delta = arg_count * kPointerSize;
2868 int arg_count = args->length();
2869 for (int i = 0; i < arg_count; i++) {
2876 Handle<Code> ic = CodeFactory::CallIC(isolate(), arg_count, mode).code();
2878 __ ld(a1, MemOperand(sp, (arg_count + 1) * kPointerSize));
2889 void FullCodeGenerator::EmitResolvePossiblyDirectEval(int arg_count) {
2891 if (arg_count > 0) {
2892 __ ld(a6, MemOperand(sp, arg_count * kPointerSize));
2962 int arg_count = args->length();
2966 for (int i = 0; i < arg_count; i++) {
2972 __ ld(a1, MemOperand(sp, (arg_count + 1) * kPointerSize));
2974 EmitResolvePossiblyDirectEval(arg_count);
2977 __ sd(v0, MemOperand(sp, (arg_count + 1) * kPointerSize));
2982 __ ld(a1, MemOperand(sp, (arg_count + 1) * kPointerSize));
2983 __ li(a0, Operand(arg_count));
3006 int arg_count = args->length();
3007 for (int i = 0; i < arg_count; i++) {
3016 __ li(a0, Operand(arg_count));
3017 __ ld(a1, MemOperand(sp, arg_count * kPointerSize));
3049 int arg_count = args->length();
3050 for (int i = 0; i < arg_count; i++) {
3063 __ li(a0, Operand(arg_count));
3064 __ ld(a1, MemOperand(sp, arg_count * kPointerSize));
4043 int arg_count = args->length();
4046 __ ld(a1, MemOperand(sp, (arg_count + 1) * kPointerSize));
4047 __ li(a0, Operand(arg_count));
4055 int arg_count = args->length();
4067 for (int i = 0; i < arg_count; i++) {
4091 for (int i = 0; i < arg_count; i++) {
4097 __ CallRuntime(expr->function(), arg_count);