Index: src/mips/simulator-mips.h |
diff --git a/src/mips/simulator-mips.h b/src/mips/simulator-mips.h |
index 2785f913c9feda3e2a1585e95bf8723bc500901d..d32f6bc097d6c5b8e3731bbea97b23302d7407c2 100644 |
--- a/src/mips/simulator-mips.h |
+++ b/src/mips/simulator-mips.h |
@@ -26,18 +26,15 @@ namespace internal { |
#define CALL_GENERATED_CODE(isolate, entry, p0, p1, p2, p3, p4) \ |
entry(p0, p1, p2, p3, p4) |
-typedef int (*mips_regexp_matcher)(String*, int, const byte*, const byte*, |
- void*, int*, int, Address, int, Isolate*); |
- |
+typedef int (*mips_regexp_matcher)(String*, int, const byte*, const byte*, int*, |
+ int, Address, int, Isolate*); |
// Call the generated regexp code directly. The code at the entry address |
// should act as a function matching the type arm_regexp_matcher. |
-// The fifth argument is a dummy that reserves the space used for |
-// the return address added by the ExitFrame in native calls. |
#define CALL_GENERATED_REGEXP_CODE(isolate, entry, p0, p1, p2, p3, p4, p5, p6, \ |
p7, p8) \ |
- (FUNCTION_CAST<mips_regexp_matcher>(entry)(p0, p1, p2, p3, NULL, p4, p5, p6, \ |
- p7, p8)) |
+ (FUNCTION_CAST<mips_regexp_matcher>(entry)(p0, p1, p2, p3, p4, p5, p6, p7, \ |
+ p8)) |
// The stack limit beyond which we will throw stack overflow errors in |
// generated code. Because generated code on mips uses the C stack, we |
@@ -530,9 +527,8 @@ class Simulator { |
#define CALL_GENERATED_REGEXP_CODE(isolate, entry, p0, p1, p2, p3, p4, p5, p6, \ |
p7, p8) \ |
- Simulator::current(isolate) \ |
- ->Call(entry, 10, p0, p1, p2, p3, NULL, p4, p5, p6, p7, p8) |
- |
+ Simulator::current(isolate)->Call(entry, 9, p0, p1, p2, p3, p4, p5, p6, p7, \ |
+ p8) |
// The simulator has its own stack. Thus it has a different stack limit from |
// the C-based native code. The JS-based limit normally points near the end of |