| OLD | NEW |
| 1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #ifndef V8_X64_SIMULATOR_X64_H_ | 28 #ifndef V8_X64_SIMULATOR_X64_H_ |
| 29 #define V8_X64_SIMULATOR_X64_H_ | 29 #define V8_X64_SIMULATOR_X64_H_ |
| 30 | 30 |
| 31 #include "allocation.h" |
| 31 | 32 |
| 32 // Since there is no simulator for the ia32 architecture the only thing we can | 33 // Since there is no simulator for the ia32 architecture the only thing we can |
| 33 // do is to call the entry directly. | 34 // do is to call the entry directly. |
| 34 // TODO(X64): Don't pass p0, since it isn't used? | 35 // TODO(X64): Don't pass p0, since it isn't used? |
| 35 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ | 36 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ |
| 36 entry(p0, p1, p2, p3, p4); | 37 entry(p0, p1, p2, p3, p4); |
| 37 | 38 |
| 38 // Calculated the stack limit beyond which we will throw stack overflow errors. | 39 // The stack limit beyond which we will throw stack overflow errors in |
| 39 // This macro must be called from a C++ method. It relies on being able to take | 40 // generated code. Because generated code on x64 uses the C stack, we |
| 40 // the address of "this" to get a value on the current execution stack and then | 41 // just use the C stack limit. |
| 41 // calculates the stack limit based on that value. | 42 class SimulatorStack : public v8::internal::AllStatic { |
| 42 // NOTE: The check for overflow is not safe as there is no guarantee that the | 43 public: |
| 43 // running thread has its stack in all memory up to address 0x00000000. | 44 static inline uintptr_t JsLimitFromCLimit(uintptr_t c_limit) { |
| 44 #define GENERATED_CODE_STACK_LIMIT(limit) \ | 45 return c_limit; |
| 45 (reinterpret_cast<uintptr_t>(this) >= limit ? \ | 46 } |
| 46 reinterpret_cast<uintptr_t>(this) - limit : 0) | 47 }; |
| 47 | 48 |
| 48 // Call the generated regexp code directly. The entry function pointer should | 49 // Call the generated regexp code directly. The entry function pointer should |
| 49 // expect seven int/pointer sized arguments and return an int. | 50 // expect seven int/pointer sized arguments and return an int. |
| 50 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ | 51 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ |
| 51 entry(p0, p1, p2, p3, p4, p5, p6) | 52 entry(p0, p1, p2, p3, p4, p5, p6) |
| 52 | 53 |
| 53 #endif // V8_X64_SIMULATOR_X64_H_ | 54 #endif // V8_X64_SIMULATOR_X64_H_ |
| OLD | NEW |