mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
72 lines
3.1 KiB
72 lines
3.1 KiB
// Copyright 2011 the V8 project authors. All rights reserved.
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#ifndef V8_X64_SIMULATOR_X64_H_
|
|
#define V8_X64_SIMULATOR_X64_H_
|
|
|
|
#include "allocation.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
// Since there is no simulator for the x64 architecture the only thing we can
|
|
// do is to call the entry directly.
|
|
// TODO(X64): Don't pass p0, since it isn't used?
|
|
#define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \
|
|
(entry(p0, p1, p2, p3, p4))
|
|
|
|
typedef int (*regexp_matcher)(String*, int, const byte*,
|
|
const byte*, 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(entry, p0, p1, p2, p3, p4, p5, p6, p7) \
|
|
(FUNCTION_CAST<regexp_matcher>(entry)(p0, p1, p2, p3, p4, p5, p6, p7))
|
|
|
|
#define TRY_CATCH_FROM_ADDRESS(try_catch_address) \
|
|
(reinterpret_cast<TryCatch*>(try_catch_address))
|
|
|
|
// The stack limit beyond which we will throw stack overflow errors in
|
|
// generated code. Because generated code on x64 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) {
|
|
return c_limit;
|
|
}
|
|
|
|
static inline uintptr_t RegisterCTryCatch(uintptr_t try_catch_address) {
|
|
return try_catch_address;
|
|
}
|
|
|
|
static inline void UnregisterCTryCatch() { }
|
|
};
|
|
|
|
} } // namespace v8::internal
|
|
|
|
#endif // V8_X64_SIMULATOR_X64_H_
|
|
|