| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 121 Heap::RootListIndex index; | 121 Heap::RootListIndex index; |
| 122 if (pointers != 0) { | 122 if (pointers != 0) { |
| 123 __ sub(scratch, sp, Operand(pointers * kPointerSize)); | 123 __ sub(scratch, sp, Operand(pointers * kPointerSize)); |
| 124 index = Heap::kRealStackLimitRootIndex; | 124 index = Heap::kRealStackLimitRootIndex; |
| 125 } else { | 125 } else { |
| 126 index = Heap::kStackLimitRootIndex; | 126 index = Heap::kStackLimitRootIndex; |
| 127 } | 127 } |
| 128 __ LoadRoot(stack_limit_scratch, index); | 128 __ LoadRoot(stack_limit_scratch, index); |
| 129 __ cmp(scratch, Operand(stack_limit_scratch)); | 129 __ cmp(scratch, Operand(stack_limit_scratch)); |
| 130 __ b(hs, &ok); | 130 __ b(hs, &ok); |
| 131 PredictableCodeSizeScope predictable(masm_, 2 * Assembler::kInstrSize); | 131 Handle<Code> stack_check = isolate->builtins()->StackCheck(); |
| 132 __ Call(isolate->builtins()->StackCheck(), RelocInfo::CODE_TARGET); | 132 PredictableCodeSizeScope predictable(masm_, |
| 133 masm_->CallSize(stack_check, RelocInfo::CODE_TARGET)); |
| 134 __ Call(stack_check, RelocInfo::CODE_TARGET); |
| 133 __ bind(&ok); | 135 __ bind(&ok); |
| 134 } | 136 } |
| 135 | 137 |
| 136 | 138 |
| 137 // Generate code for a JS function. On entry to the function the receiver | 139 // Generate code for a JS function. On entry to the function the receiver |
| 138 // and arguments have been pushed on the stack left to right. The actual | 140 // and arguments have been pushed on the stack left to right. The actual |
| 139 // argument count matches the formal parameter count expected by the | 141 // argument count matches the formal parameter count expected by the |
| 140 // function. | 142 // function. |
| 141 // | 143 // |
| 142 // The live registers are: | 144 // The live registers are: |
| (...skipping 4784 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4927 | 4929 |
| 4928 ASSERT(interrupt_address == | 4930 ASSERT(interrupt_address == |
| 4929 isolate->builtins()->OsrAfterStackCheck()->entry()); | 4931 isolate->builtins()->OsrAfterStackCheck()->entry()); |
| 4930 return OSR_AFTER_STACK_CHECK; | 4932 return OSR_AFTER_STACK_CHECK; |
| 4931 } | 4933 } |
| 4932 | 4934 |
| 4933 | 4935 |
| 4934 } } // namespace v8::internal | 4936 } } // namespace v8::internal |
| 4935 | 4937 |
| 4936 #endif // V8_TARGET_ARCH_ARM | 4938 #endif // V8_TARGET_ARCH_ARM |
| OLD | NEW |