Steve Block | a7e24c1 | 2009-10-30 11:49:00 +0000 | [diff] [blame] | 1 | // Copyright 2009 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 | |
| 28 | #ifndef V8_X64_SIMULATOR_X64_H_ |
| 29 | #define V8_X64_SIMULATOR_X64_H_ |
| 30 | |
| 31 | #include "allocation.h" |
| 32 | |
| 33 | // Since there is no simulator for the ia32 architecture the only thing we can |
| 34 | // do is to call the entry directly. |
| 35 | // TODO(X64): Don't pass p0, since it isn't used? |
| 36 | #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ |
| 37 | entry(p0, p1, p2, p3, p4); |
| 38 | |
| 39 | // The stack limit beyond which we will throw stack overflow errors in |
| 40 | // generated code. Because generated code on x64 uses the C stack, we |
| 41 | // just use the C stack limit. |
| 42 | class SimulatorStack : public v8::internal::AllStatic { |
| 43 | public: |
| 44 | static inline uintptr_t JsLimitFromCLimit(uintptr_t c_limit) { |
| 45 | return c_limit; |
| 46 | } |
Steve Block | d0582a6 | 2009-12-15 09:54:21 +0000 | [diff] [blame^] | 47 | |
| 48 | static inline uintptr_t RegisterCTryCatch(uintptr_t try_catch_address) { |
| 49 | return try_catch_address; |
| 50 | } |
| 51 | |
| 52 | static inline void UnregisterCTryCatch() { } |
Steve Block | a7e24c1 | 2009-10-30 11:49:00 +0000 | [diff] [blame] | 53 | }; |
| 54 | |
| 55 | // Call the generated regexp code directly. The entry function pointer should |
| 56 | // expect seven int/pointer sized arguments and return an int. |
| 57 | #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ |
| 58 | entry(p0, p1, p2, p3, p4, p5, p6) |
| 59 | |
Steve Block | d0582a6 | 2009-12-15 09:54:21 +0000 | [diff] [blame^] | 60 | #define TRY_CATCH_FROM_ADDRESS(try_catch_address) \ |
| 61 | reinterpret_cast<TryCatch*>(try_catch_address) |
| 62 | |
Steve Block | a7e24c1 | 2009-10-30 11:49:00 +0000 | [diff] [blame] | 63 | #endif // V8_X64_SIMULATOR_X64_H_ |