OLD | NEW |
1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 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 20 matching lines...) Expand all Loading... |
31 #include "allocation.h" | 31 #include "allocation.h" |
32 | 32 |
33 namespace v8 { | 33 namespace v8 { |
34 namespace internal { | 34 namespace internal { |
35 | 35 |
36 // Since there is no simulator for the ia32 architecture the only thing we can | 36 // Since there is no simulator for the ia32 architecture the only thing we can |
37 // do is to call the entry directly. | 37 // do is to call the entry directly. |
38 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ | 38 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ |
39 (entry(p0, p1, p2, p3, p4)) | 39 (entry(p0, p1, p2, p3, p4)) |
40 | 40 |
41 // Call the generated regexp code directly. The entry function pointer should | 41 |
| 42 typedef int (*regexp_matcher)(String*, int, const byte*, |
| 43 const byte*, int*, Address, int); |
| 44 |
| 45 // Call the generated regexp code directly. The code at the entry address should |
42 // expect seven int/pointer sized arguments and return an int. | 46 // expect seven int/pointer sized arguments and return an int. |
43 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ | 47 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ |
44 (entry(p0, p1, p2, p3, p4, p5, p6)) | 48 (FUNCTION_CAST<regexp_matcher>(entry)(p0, p1, p2, p3, p4, p5, p6)) |
| 49 |
45 | 50 |
46 #define TRY_CATCH_FROM_ADDRESS(try_catch_address) \ | 51 #define TRY_CATCH_FROM_ADDRESS(try_catch_address) \ |
47 (reinterpret_cast<TryCatch*>(try_catch_address)) | 52 (reinterpret_cast<TryCatch*>(try_catch_address)) |
48 | 53 |
49 // The stack limit beyond which we will throw stack overflow errors in | 54 // The stack limit beyond which we will throw stack overflow errors in |
50 // generated code. Because generated code on ia32 uses the C stack, we | 55 // generated code. Because generated code on ia32 uses the C stack, we |
51 // just use the C stack limit. | 56 // just use the C stack limit. |
52 class SimulatorStack : public v8::internal::AllStatic { | 57 class SimulatorStack : public v8::internal::AllStatic { |
53 public: | 58 public: |
54 static inline uintptr_t JsLimitFromCLimit(uintptr_t c_limit) { | 59 static inline uintptr_t JsLimitFromCLimit(uintptr_t c_limit) { |
55 return c_limit; | 60 return c_limit; |
56 } | 61 } |
57 | 62 |
58 static inline uintptr_t RegisterCTryCatch(uintptr_t try_catch_address) { | 63 static inline uintptr_t RegisterCTryCatch(uintptr_t try_catch_address) { |
59 return try_catch_address; | 64 return try_catch_address; |
60 } | 65 } |
61 | 66 |
62 static inline void UnregisterCTryCatch() { } | 67 static inline void UnregisterCTryCatch() { } |
63 }; | 68 }; |
64 | 69 |
65 } } // namespace v8::internal | 70 } } // namespace v8::internal |
66 | 71 |
67 #endif // V8_IA32_SIMULATOR_IA32_H_ | 72 #endif // V8_IA32_SIMULATOR_IA32_H_ |
OLD | NEW |