d1/d7b/test-macro-assembler-arm_8cc_source.html

 // Copyright 2013 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.


 #include <stdlib.h>


 #include "v8.h"

 #include "macro-assembler.h"

 #include "arm/macro-assembler-arm.h"

 #include "arm/simulator-arm.h"

 #include "cctest.h"


 using namespace v8::internal;


 typedef void* (*F)(int x, int y, int p2, int p3, int p4);


 #define __ masm->


 static byte to_non_zero(int n) {

   return static_cast<unsigned>(n) % 255 + 1;

 }


 static bool all_zeroes(const byte* beg, const byte* end) {

   CHECK(beg);

   CHECK(beg <= end);

   while (beg < end) {

     if (*beg++ != 0)

       return false;

   }

   return true;

 }


 TEST(CopyBytes) {

   CcTest::InitializeVM();

   Isolate* isolate = Isolate::Current();

   HandleScope handles(isolate);


   const int data_size = 1 * KB;

   size_t act_size;


   // Allocate two blocks to copy data between.

   byte* src_buffer = static_cast<byte*>(OS::Allocate(data_size, &act_size, 0));

   CHECK(src_buffer);

   CHECK(act_size >= static_cast<size_t>(data_size));

   byte* dest_buffer = static_cast<byte*>(OS::Allocate(data_size, &act_size, 0));

   CHECK(dest_buffer);

   CHECK(act_size >= static_cast<size_t>(data_size));


   // Storage for R0 and R1.

   byte* r0_;

   byte* r1_;


   MacroAssembler assembler(isolate, NULL, 0);

   MacroAssembler* masm = &assembler;


   // Code to be generated: The stuff in CopyBytes followed by a store of R0 and

   // R1, respectively.

   __ CopyBytes(r0, r1, r2, r3);

   __ mov(r2, Operand(reinterpret_cast<int>(&r0_)));

   __ mov(r3, Operand(reinterpret_cast<int>(&r1_)));

   __ str(r0, MemOperand(r2));

   __ str(r1, MemOperand(r3));

   __ bx(lr);


   CodeDesc desc;

   masm->GetCode(&desc);

   Object* code = isolate->heap()->CreateCode(

       desc,

       Code::ComputeFlags(Code::STUB),

       Handle<Code>())->ToObjectChecked();

   CHECK(code->IsCode());


   F f = FUNCTION_CAST<F>(Code::cast(code)->entry());


   // Initialise source data with non-zero bytes.

   for (int i = 0; i < data_size; i++) {

     src_buffer[i] = to_non_zero(i);

   }


   const int fuzz = 11;


   for (int size = 0; size < 600; size++) {

     for (const byte* src = src_buffer; src < src_buffer + fuzz; src++) {

       for (byte* dest = dest_buffer; dest < dest_buffer + fuzz; dest++) {

         memset(dest_buffer, 0, data_size);

         CHECK(dest + size < dest_buffer + data_size);

         (void) CALL_GENERATED_CODE(f, reinterpret_cast<int>(src),

                                       reinterpret_cast<int>(dest), size, 0, 0);

         // R0 and R1 should point at the first byte after the copied data.

         CHECK_EQ(src + size, r0_);

         CHECK_EQ(dest + size, r1_);

         // Check that we haven't written outside the target area.

         CHECK(all_zeroes(dest_buffer, dest));

         CHECK(all_zeroes(dest + size, dest_buffer + data_size));

         // Check the target area.

         CHECK_EQ(0, memcmp(src, dest, size));

       }

     }

   }


   // Check that the source data hasn't been clobbered.

   for (int i = 0; i < data_size; i++) {

     CHECK(src_buffer[i] == to_non_zero(i));

   }

 }


 typedef int (*F5)(void*, void*, void*, void*, void*);


 TEST(LoadAndStoreWithRepresentation) {

   v8::internal::V8::Initialize(NULL);


   // Allocate an executable page of memory.

   size_t actual_size;

   byte* buffer = static_cast<byte*>(OS::Allocate(Assembler::kMinimalBufferSize,

                                                  &actual_size,

                                                  true));

   CHECK(buffer);

   Isolate* isolate = CcTest::i_isolate();

   HandleScope handles(isolate);

   MacroAssembler assembler(isolate, buffer, static_cast<int>(actual_size));

   MacroAssembler* masm = &assembler;  // Create a pointer for the __ macro.

   __ sub(sp, sp, Operand(1 * kPointerSize));

   Label exit;


   // Test 1.

   __ mov(r0, Operand(1));  // Test number.

   __ mov(r1, Operand(0));

   __ str(r1, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(-1));

   __ Store(r2, MemOperand(sp, 0 * kPointerSize), Representation::UInteger8());

   __ ldr(r3, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(255));

   __ cmp(r3, r2);

   __ b(ne, &exit);

   __ mov(r2, Operand(255));

   __ Load(r3, MemOperand(sp, 0 * kPointerSize), Representation::UInteger8());

   __ cmp(r3, r2);

   __ b(ne, &exit);


   // Test 2.

   __ mov(r0, Operand(2));  // Test number.

   __ mov(r1, Operand(0));

   __ str(r1, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(-1));

   __ Store(r2, MemOperand(sp, 0 * kPointerSize), Representation::Integer8());

   __ ldr(r3, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(255));

   __ cmp(r3, r2);

   __ b(ne, &exit);

   __ mov(r2, Operand(-1));

   __ Load(r3, MemOperand(sp, 0 * kPointerSize), Representation::Integer8());

   __ cmp(r3, r2);

   __ b(ne, &exit);


   // Test 3.

   __ mov(r0, Operand(3));  // Test number.

   __ mov(r1, Operand(0));

   __ str(r1, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(-1));

   __ Store(r2, MemOperand(sp, 0 * kPointerSize), Representation::UInteger16());

   __ ldr(r3, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(65535));

   __ cmp(r3, r2);

   __ b(ne, &exit);

   __ mov(r2, Operand(65535));

   __ Load(r3, MemOperand(sp, 0 * kPointerSize), Representation::UInteger16());

   __ cmp(r3, r2);

   __ b(ne, &exit);


   // Test 4.

   __ mov(r0, Operand(4));  // Test number.

   __ mov(r1, Operand(0));

   __ str(r1, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(-1));

   __ Store(r2, MemOperand(sp, 0 * kPointerSize), Representation::Integer16());

   __ ldr(r3, MemOperand(sp, 0 * kPointerSize));

   __ mov(r2, Operand(65535));

   __ cmp(r3, r2);

   __ b(ne, &exit);

   __ mov(r2, Operand(-1));

   __ Load(r3, MemOperand(sp, 0 * kPointerSize), Representation::Integer16());

   __ cmp(r3, r2);

   __ b(ne, &exit);


   __ mov(r0, Operand(0));  // Success.

   __ bind(&exit);

   __ add(sp, sp, Operand(1 * kPointerSize));

   __ bx(lr);


   CodeDesc desc;

   masm->GetCode(&desc);

   Object* code = isolate->heap()->CreateCode(

       desc,

       Code::ComputeFlags(Code::STUB),

       Handle<Code>())->ToObjectChecked();

   CHECK(code->IsCode());


   // Call the function from C++.

   F5 f = FUNCTION_CAST<F5>(Code::cast(code)->entry());

   CHECK_EQ(0, CALL_GENERATED_CODE(f, 0, 0, 0, 0, 0));

 }


 #undef __

v8::internal::NULL
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

v8::internal::Representation::UInteger8
static Representation UInteger8()
Definition: property-details.h:108

v8::internal::V8::Initialize
static bool Initialize(Deserializer *des)
Definition: v8.cc:61

CHECK_EQ
#define CHECK_EQ(expected, value)
Definition: checks.h:252

simulator-arm.h

v8::internal::r3
const Register r3
Definition: assembler-arm.h:228

v8::internal::Handle
Definition: handles.h:44

v8::internal::TEST
Definition: natives.h:39

v8::internal::CodeDesc
Definition: v8globals.h:237

v8::internal::KB
const int KB
Definition: globals.h:245

v8::internal::STUB
Definition: hydrogen.h:560

v8::internal::F
Definition: constants-mips.h:537

v8::internal::AssemblerBase::kMinimalBufferSize
static const int kMinimalBufferSize
Definition: assembler.h:89

v8::internal::MacroAssembler
Definition: macro-assembler-arm.h:90

CHECK
#define CHECK(condition)
Definition: checks.h:75

v8::internal::r2
const Register r2
Definition: assembler-arm.h:227

v8::internal::Representation::Integer16
static Representation Integer16()
Definition: property-details.h:109

v8::internal::Code::cast
static Code * cast(Object *obj)

v8::internal::Code::entry
byte * entry()
Definition: objects-inl.h:5887

v8::internal::Object
Definition: objects.h:1440

cctest.h

v8::internal::byte
uint8_t byte
Definition: globals.h:185

v8::internal::ne
Definition: constants-arm.h:85

v8::internal::sp
const Register sp
Definition: assembler-arm.h:242

v8::internal::size
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

v8::internal::p2
Definition: assembler-arm.h:532

v8::internal::p4
Definition: assembler-arm.h:534

v8::internal::Assembler::GetCode
void GetCode(CodeDesc *desc)

v8::internal::kPointerSize
const int kPointerSize
Definition: globals.h:268

v8::internal::Operand
Definition: assembler-arm64.h:624

v8::internal::p3
Definition: assembler-arm.h:533

v8::internal::code
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

CcTest::i_isolate
static i::Isolate * i_isolate()
Definition: cctest.h:102

CALL_GENERATED_CODE
#define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4)
Definition: simulator-arm.h:48

v8::internal::r0
const Register r0
Definition: assembler-arm.h:225

v8::internal::lr
const Register lr
Definition: assembler-arm.h:243

v8::internal::Heap::CreateCode
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

Load
void Load(const v8::FunctionCallbackInfo< v8::Value > &args)
Definition: shell.cc:171

v8::internal::r1
const Register r1
Definition: assembler-arm.h:226

CcTest::InitializeVM
static void InitializeVM()
Definition: cctest.h:116

macro-assembler-arm.h

v8::internal::Code::ComputeFlags
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

F5
int(* F5)(void *, void *, void *, void *, void *)
Definition: test-macro-assembler-arm.cc:135

v8::internal::OS::Allocate
static void * Allocate(const size_t requested, size_t *allocated, bool is_executable)
Definition: platform-cygwin.cc:75

macro-assembler.h

v8::internal::MemOperand
Operand MemOperand
Definition: macro-assembler-ia32.h:40

v8::internal::CopyBytes
void CopyBytes(uint8_t *target, uint8_t *source)
Definition: runtime.cc:1309

__
#define __
Definition: test-macro-assembler-arm.cc:41

v8::internal::Representation::UInteger16
static Representation UInteger16()
Definition: property-details.h:110

v8::internal::Representation::Integer8
static Representation Integer8()
Definition: property-details.h:107

v8::internal::Isolate::heap
Heap * heap()
Definition: isolate.h:875

v8::internal::HandleScope
Definition: handles.h:131

v8::internal::Isolate
Definition: isolate.h:389