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 17 matching lines...) Expand all Loading... |
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 | 31 |
32 // Since there is no simulator for the ia32 architecture the only thing we can | 32 // Since there is no simulator for the ia32 architecture the only thing we can |
33 // do is to call the entry directly. | 33 // do is to call the entry directly. |
34 // TODO(X64): Don't pass p0, since it isn't used? | 34 // TODO(X64): Don't pass p0, since it isn't used? |
35 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ | 35 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ |
36 entry(p0, p1, p2, p3, p4); | 36 entry(p0, p1, p2, p3, p4); |
37 | 37 |
38 // Calculated the stack limit beyond which we will throw stack overflow errors. | 38 // 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 | 39 // 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 | 40 // just use the C stack limit. |
41 // calculates the stack limit based on that value. | 41 #define GENERATED_CODE_STACK_LIMIT(c_limit) \ |
42 // NOTE: The check for overflow is not safe as there is no guarantee that the | 42 (c_limit) |
43 // running thread has its stack in all memory up to address 0x00000000. | |
44 #define GENERATED_CODE_STACK_LIMIT(limit) \ | |
45 (reinterpret_cast<uintptr_t>(this) >= limit ? \ | |
46 reinterpret_cast<uintptr_t>(this) - limit : 0) | |
47 | 43 |
48 // Call the generated regexp code directly. The entry function pointer should | 44 // Call the generated regexp code directly. The entry function pointer should |
49 // expect seven int/pointer sized arguments and return an int. | 45 // expect seven int/pointer sized arguments and return an int. |
50 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ | 46 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ |
51 entry(p0, p1, p2, p3, p4, p5, p6) | 47 entry(p0, p1, p2, p3, p4, p5, p6) |
52 | 48 |
53 #endif // V8_X64_SIMULATOR_X64_H_ | 49 #endif // V8_X64_SIMULATOR_X64_H_ |
OLD | NEW |