v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
test-macro-assembler-mips.cc
Go to the documentation of this file.
1 // Copyright 2013 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 
28 #include <stdlib.h>
29 
30 #include "v8.h"
31 #include "macro-assembler.h"
33 #include "mips/simulator-mips.h"
34 #include "cctest.h"
35 
36 
37 using namespace v8::internal;
38 
39 typedef void* (*F)(int x, int y, int p2, int p3, int p4);
40 
41 #define __ masm->
42 
43 
44 static byte to_non_zero(int n) {
45  return static_cast<unsigned>(n) % 255 + 1;
46 }
47 
48 
49 static bool all_zeroes(const byte* beg, const byte* end) {
50  CHECK(beg);
51  CHECK(beg <= end);
52  while (beg < end) {
53  if (*beg++ != 0)
54  return false;
55  }
56  return true;
57 }
58 
59 
62  Isolate* isolate = Isolate::Current();
63  HandleScope handles(isolate);
64 
65  const int data_size = 1 * KB;
66  size_t act_size;
67 
68  // Allocate two blocks to copy data between.
69  byte* src_buffer = static_cast<byte*>(OS::Allocate(data_size, &act_size, 0));
70  CHECK(src_buffer);
71  CHECK(act_size >= static_cast<size_t>(data_size));
72  byte* dest_buffer = static_cast<byte*>(OS::Allocate(data_size, &act_size, 0));
73  CHECK(dest_buffer);
74  CHECK(act_size >= static_cast<size_t>(data_size));
75 
76  // Storage for a0 and a1.
77  byte* a0_;
78  byte* a1_;
79 
80  MacroAssembler assembler(isolate, NULL, 0);
81  MacroAssembler* masm = &assembler;
82 
83  // Code to be generated: The stuff in CopyBytes followed by a store of a0 and
84  // a1, respectively.
85  __ CopyBytes(a0, a1, a2, a3);
86  __ li(a2, Operand(reinterpret_cast<int>(&a0_)));
87  __ li(a3, Operand(reinterpret_cast<int>(&a1_)));
88  __ sw(a0, MemOperand(a2));
89  __ jr(ra);
90  __ sw(a1, MemOperand(a3));
91 
92  CodeDesc desc;
93  masm->GetCode(&desc);
94  Object* code = isolate->heap()->CreateCode(
95  desc,
97  Handle<Code>())->ToObjectChecked();
98  CHECK(code->IsCode());
99 
100  ::F f = FUNCTION_CAST< ::F>(Code::cast(code)->entry());
101 
102  // Initialise source data with non-zero bytes.
103  for (int i = 0; i < data_size; i++) {
104  src_buffer[i] = to_non_zero(i);
105  }
106 
107  const int fuzz = 11;
108 
109  for (int size = 0; size < 600; size++) {
110  for (const byte* src = src_buffer; src < src_buffer + fuzz; src++) {
111  for (byte* dest = dest_buffer; dest < dest_buffer + fuzz; dest++) {
112  memset(dest_buffer, 0, data_size);
113  CHECK(dest + size < dest_buffer + data_size);
114  (void) CALL_GENERATED_CODE(f, reinterpret_cast<int>(src),
115  reinterpret_cast<int>(dest), size, 0, 0);
116  // a0 and a1 should point at the first byte after the copied data.
117  CHECK_EQ(src + size, a0_);
118  CHECK_EQ(dest + size, a1_);
119  // Check that we haven't written outside the target area.
120  CHECK(all_zeroes(dest_buffer, dest));
121  CHECK(all_zeroes(dest + size, dest_buffer + data_size));
122  // Check the target area.
123  CHECK_EQ(0, memcmp(src, dest, size));
124  }
125  }
126  }
127 
128  // Check that the source data hasn't been clobbered.
129  for (int i = 0; i < data_size; i++) {
130  CHECK(src_buffer[i] == to_non_zero(i));
131  }
132 }
133 
134 
135 static void TestNaN(const char *code) {
136  // NaN value is different on MIPS and x86 architectures, and TEST(NaNx)
137  // tests checks the case where a x86 NaN value is serialized into the
138  // snapshot on the simulator during cross compilation.
140  v8::Local<v8::Context> context = CcTest::NewContext(PRINT_EXTENSION);
141  v8::Context::Scope context_scope(context);
142 
143  v8::Local<v8::Script> script = v8::Script::Compile(v8_str(code));
145  // Have to populate the handle manually, as it's not Cast-able.
147  v8::Utils::OpenHandle<v8::Object, i::JSObject>(result);
148  i::Handle<i::JSArray> array1(reinterpret_cast<i::JSArray*>(*o));
149  i::FixedDoubleArray* a = i::FixedDoubleArray::cast(array1->elements());
150  double value = a->get_scalar(0);
151  CHECK(std::isnan(value) &&
152  i::BitCast<uint64_t>(value) ==
153  i::BitCast<uint64_t>(
155 }
156 
157 
158 TEST(NaN0) {
159  TestNaN(
160  "var result;"
161  "for (var i = 0; i < 2; i++) {"
162  " result = new Array(Number.NaN, Number.POSITIVE_INFINITY);"
163  "}"
164  "result;");
165 }
166 
167 
168 TEST(NaN1) {
169  TestNaN(
170  "var result;"
171  "for (var i = 0; i < 2; i++) {"
172  " result = [NaN];"
173  "}"
174  "result;");
175 }
176 
177 
178 #undef __
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flags.cc:269
#define CHECK_EQ(expected, value)
Definition: checks.h:252
const int KB
Definition: globals.h:245
#define CHECK(condition)
Definition: checks.h:75
static Code * cast(Object *obj)
static v8::Local< v8::Context > NewContext(CcTestExtensionFlags extensions, v8::Isolate *isolate=CcTest::isolate())
Definition: cctest.cc:90
int isnan(double x)
uint8_t byte
Definition: globals.h:185
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object size
Definition: flags.cc:211
void GetCode(CodeDesc *desc)
static Local< Script > Compile(Handle< String > source, ScriptOrigin *origin=NULL, ScriptData *script_data=NULL)
Definition: api.cc:1832
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra code(assertions) for debugging") DEFINE_bool(code_comments
static FixedDoubleArray * cast(Object *obj)
#define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4)
Definition: simulator-arm.h:48
double get_scalar(int index)
Definition: objects-inl.h:2173
static V8_INLINE Local< T > Cast(Local< S > that)
Definition: v8.h:372
MUST_USE_RESULT MaybeObject * CreateCode(const CodeDesc &desc, Code::Flags flags, Handle< Object > self_reference, bool immovable=false, bool crankshafted=false, int prologue_offset=Code::kPrologueOffsetNotSet)
Definition: heap.cc:4119
static void InitializeVM()
Definition: cctest.h:116
static Flags ComputeFlags(Kind kind, InlineCacheState ic_state=UNINITIALIZED, ExtraICState extra_ic_state=kNoExtraICState, StubType type=NORMAL, InlineCacheHolderFlag holder=OWN_MAP)
Definition: objects-inl.h:4601
static void * Allocate(const size_t requested, size_t *allocated, bool is_executable)
void CopyBytes(uint8_t *target, uint8_t *source)
Definition: runtime.cc:1309
static double canonical_not_the_hole_nan_as_double()
Definition: objects-inl.h:2166
Local< Value > Run()
Definition: api.cc:1686
#define __
Definition: v8.h:124
static v8::Isolate * isolate()
Definition: cctest.h:96