| 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 27 matching lines...) Expand all Loading... |
| 38 // Calculated the stack limit beyond which we will throw stack overflow errors. | 38 // Calculated the stack limit beyond which we will throw stack overflow errors. |
| 39 // This macro must be called from a C++ method. It relies on being able to take | 39 // This macro must be called from a C++ method. It relies on being able to take |
| 40 // the address of "this" to get a value on the current execution stack and then | 40 // the address of "this" to get a value on the current execution stack and then |
| 41 // calculates the stack limit based on that value. | 41 // calculates the stack limit based on that value. |
| 42 // NOTE: The check for overflow is not safe as there is no guarantee that the | 42 // NOTE: The check for overflow is not safe as there is no guarantee that the |
| 43 // running thread has its stack in all memory up to address 0x00000000. | 43 // running thread has its stack in all memory up to address 0x00000000. |
| 44 #define GENERATED_CODE_STACK_LIMIT(limit) \ | 44 #define GENERATED_CODE_STACK_LIMIT(limit) \ |
| 45 (reinterpret_cast<uintptr_t>(this) >= limit ? \ | 45 (reinterpret_cast<uintptr_t>(this) >= limit ? \ |
| 46 reinterpret_cast<uintptr_t>(this) - limit : 0) | 46 reinterpret_cast<uintptr_t>(this) - limit : 0) |
| 47 | 47 |
| 48 // Call the generated regexp code directly. The entry function pointer should |
| 49 // 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 entry(p0, p1, p2, p3, p4, p5, p6) |
| 52 |
| 48 #endif // V8_X64_SIMULATOR_X64_H_ | 53 #endif // V8_X64_SIMULATOR_X64_H_ |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 173567:
ARM native regexps. (Closed)
