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 21 matching lines...) Expand all Loading... |
32 | 32 |
33 namespace v8 { | 33 namespace v8 { |
34 namespace internal { | 34 namespace internal { |
35 | 35 |
36 // Since there is no simulator for the x64 architecture the only thing we can | 36 // Since there is no simulator for the x64 architecture the only thing we can |
37 // do is to call the entry directly. | 37 // do is to call the entry directly. |
38 // TODO(X64): Don't pass p0, since it isn't used? | 38 // TODO(X64): Don't pass p0, since it isn't used? |
39 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ | 39 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ |
40 (entry(p0, p1, p2, p3, p4)) | 40 (entry(p0, p1, p2, p3, p4)) |
41 | 41 |
42 // Call the generated regexp code directly. The entry function pointer should | 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 |
43 // expect seven int/pointer sized arguments and return an int. | 46 // expect seven int/pointer sized arguments and return an int. |
44 #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) \ |
45 (entry(p0, p1, p2, p3, p4, p5, p6)) | 48 (FUNCTION_CAST<regexp_matcher>(entry)(p0, p1, p2, p3, p4, p5, p6)) |
46 | 49 |
47 #define TRY_CATCH_FROM_ADDRESS(try_catch_address) \ | 50 #define TRY_CATCH_FROM_ADDRESS(try_catch_address) \ |
48 (reinterpret_cast<TryCatch*>(try_catch_address)) | 51 (reinterpret_cast<TryCatch*>(try_catch_address)) |
49 | 52 |
50 // The stack limit beyond which we will throw stack overflow errors in | 53 // The stack limit beyond which we will throw stack overflow errors in |
51 // generated code. Because generated code on x64 uses the C stack, we | 54 // generated code. Because generated code on x64 uses the C stack, we |
52 // just use the C stack limit. | 55 // just use the C stack limit. |
53 class SimulatorStack : public v8::internal::AllStatic { | 56 class SimulatorStack : public v8::internal::AllStatic { |
54 public: | 57 public: |
55 static inline uintptr_t JsLimitFromCLimit(uintptr_t c_limit) { | 58 static inline uintptr_t JsLimitFromCLimit(uintptr_t c_limit) { |
56 return c_limit; | 59 return c_limit; |
57 } | 60 } |
58 | 61 |
59 static inline uintptr_t RegisterCTryCatch(uintptr_t try_catch_address) { | 62 static inline uintptr_t RegisterCTryCatch(uintptr_t try_catch_address) { |
60 return try_catch_address; | 63 return try_catch_address; |
61 } | 64 } |
62 | 65 |
63 static inline void UnregisterCTryCatch() { } | 66 static inline void UnregisterCTryCatch() { } |
64 }; | 67 }; |
65 | 68 |
66 } } // namespace v8::internal | 69 } } // namespace v8::internal |
67 | 70 |
68 #endif // V8_X64_SIMULATOR_X64_H_ | 71 #endif // V8_X64_SIMULATOR_X64_H_ |
OLD | NEW |