Sha256: f2ea059b4070a23ef45b8cd20983ff24cf4918aa3fbd3c8e121c4405597430ff
Contents?: true
Size: 1.75 KB
Versions: 10
Compression:
Stored size: 1.75 KB
Contents
// Copyright 2012 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef V8_X87_SIMULATOR_X87_H_ #define V8_X87_SIMULATOR_X87_H_ #include "src/allocation.h" namespace v8 { namespace internal { // Since there is no simulator for the ia32 architecture the only thing we can // do is to call the entry directly. #define CALL_GENERATED_CODE(isolate, entry, p0, p1, p2, p3, p4) \ (entry(p0, p1, p2, p3, p4)) typedef int (*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 // expect eight int/pointer sized arguments and return an int. #define CALL_GENERATED_REGEXP_CODE(isolate, entry, p0, p1, p2, p3, p4, p5, p6, \ p7, p8) \ (FUNCTION_CAST<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 ia32 uses the C stack, we // just use the C stack limit. class SimulatorStack : public v8::internal::AllStatic { public: static inline uintptr_t JsLimitFromCLimit(Isolate* isolate, uintptr_t c_limit) { USE(isolate); return c_limit; } static inline uintptr_t RegisterCTryCatch(Isolate* isolate, uintptr_t try_catch_address) { USE(isolate); return try_catch_address; } static inline void UnregisterCTryCatch(Isolate* isolate) { USE(isolate); } }; } // namespace internal } // namespace v8 #endif // V8_X87_SIMULATOR_X87_H_
Version data entries
10 entries across 9 versions & 2 rubygems