fast-codegen-ia32.cc 8.58 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
// Copyright 2010 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 "v8.h"

#include "codegen-inl.h"
#include "fast-codegen.h"

namespace v8 {
namespace internal {

#define __ ACCESS_MASM(masm())

38 39 40 41 42 43
Register FastCodeGenerator::accumulator0() { return eax; }
Register FastCodeGenerator::accumulator1() { return edx; }
Register FastCodeGenerator::scratch0() { return ecx; }
Register FastCodeGenerator::scratch1() { return edi; }
Register FastCodeGenerator::receiver_reg() { return ebx; }
Register FastCodeGenerator::context_reg() { return esi; }
44 45


46 47 48 49
void FastCodeGenerator::EmitLoadReceiver() {
  // Offset 2 is due to return address and saved frame pointer.
  int index = 2 + function()->scope()->num_parameters();
  __ mov(receiver_reg(), Operand(ebp, index * kPointerSize));
50 51 52
}


53
void FastCodeGenerator::EmitGlobalVariableLoad(Handle<Object> cell) {
54
  ASSERT(!destination().is(no_reg));
55
  ASSERT(cell->IsJSGlobalPropertyCell());
56 57 58 59

  __ mov(destination(), Immediate(cell));
  __ mov(destination(),
         FieldOperand(destination(), JSGlobalPropertyCell::kValueOffset));
60
  if (FLAG_debug_code) {
61
    __ cmp(destination(), Factory::the_hole_value());
62
    __ Check(not_equal, "DontDelete cells can't contain the hole");
63
  }
64 65 66

  // The loaded value is not known to be a smi.
  clear_as_smi(destination());
67 68 69 70 71
}


void FastCodeGenerator::EmitThisPropertyStore(Handle<String> name) {
  LookupResult lookup;
72
  info()->receiver()->Lookup(*name, &lookup);
73

74
  ASSERT(lookup.holder() == *info()->receiver());
75
  ASSERT(lookup.type() == FIELD);
76
  Handle<Map> map(Handle<HeapObject>::cast(info()->receiver())->map());
77 78 79
  int index = lookup.GetFieldIndex() - map->inobject_properties();
  int offset = index * kPointerSize;

80 81 82 83 84
  // We will emit the write barrier unless the stored value is statically
  // known to be a smi.
  bool needs_write_barrier = !is_smi(accumulator0());

  // Perform the store.  Negative offsets are inobject properties.
85 86
  if (offset < 0) {
    offset += map->instance_size();
87 88 89 90 91
    __ mov(FieldOperand(receiver_reg(), offset), accumulator0());
    if (needs_write_barrier) {
      // Preserve receiver from write barrier.
      __ mov(scratch0(), receiver_reg());
    }
92 93
  } else {
    offset += FixedArray::kHeaderSize;
94 95
    __ mov(scratch0(),
           FieldOperand(receiver_reg(), JSObject::kPropertiesOffset));
96
    __ mov(FieldOperand(scratch0(), offset), accumulator0());
97
  }
98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113

  if (needs_write_barrier) {
    if (destination().is(no_reg)) {
      // After RecordWrite accumulator0 is only accidently a smi, but it is
      // already marked as not known to be one.
      __ RecordWrite(scratch0(), offset, accumulator0(), scratch1());
    } else {
      // Copy the value to the other accumulator to preserve a copy from the
      // write barrier. One of the accumulators is available as a scratch
      // register.  Neither is a smi.
      __ mov(accumulator1(), accumulator0());
      clear_as_smi(accumulator1());
      Register value_scratch = other_accumulator(destination());
      __ RecordWrite(scratch0(), offset, value_scratch, scratch1());
    }
  } else if (destination().is(accumulator1())) {
114
    __ mov(accumulator1(), accumulator0());
115 116
    // Is a smi because we do not need the write barrier.
    set_as_smi(accumulator1());
117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141
  }
}


void FastCodeGenerator::EmitThisPropertyLoad(Handle<String> name) {
  ASSERT(!destination().is(no_reg));
  LookupResult lookup;
  info()->receiver()->Lookup(*name, &lookup);

  ASSERT(lookup.holder() == *info()->receiver());
  ASSERT(lookup.type() == FIELD);
  Handle<Map> map(Handle<HeapObject>::cast(info()->receiver())->map());
  int index = lookup.GetFieldIndex() - map->inobject_properties();
  int offset = index * kPointerSize;

  // Perform the load.  Negative offsets are inobject properties.
  if (offset < 0) {
    offset += map->instance_size();
    __ mov(destination(), FieldOperand(receiver_reg(), offset));
  } else {
    offset += FixedArray::kHeaderSize;
    __ mov(scratch0(),
           FieldOperand(receiver_reg(), JSObject::kPropertiesOffset));
    __ mov(destination(), FieldOperand(scratch0(), offset));
  }
142 143 144

  // The loaded value is not known to be a smi.
  clear_as_smi(destination());
145 146 147 148
}


void FastCodeGenerator::EmitBitOr() {
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
  if (is_smi(accumulator0()) && is_smi(accumulator1())) {
    // If both operands are known to be a smi then there is no need to check
    // the operands or result.  There is no need to perform the operation in
    // an effect context.
    if (!destination().is(no_reg)) {
      // Leave the result in the destination register.  Bitwise or is
      // commutative.
      __ or_(destination(), Operand(other_accumulator(destination())));
    }
  } else if (destination().is(no_reg)) {
    // Result is not needed but do not clobber the operands in case of
    // bailout.
    __ mov(scratch0(), accumulator1());
    __ or_(scratch0(), Operand(accumulator0()));
    __ test(scratch0(), Immediate(kSmiTagMask));
164 165
    __ j(not_zero, bailout(), not_taken);
  } else {
166 167
    // Preserve the destination operand in a scratch register in case of
    // bailout.
168
    Label done;
169 170 171
    __ mov(scratch0(), destination());
    __ or_(destination(), Operand(other_accumulator(destination())));
    __ test(destination(), Immediate(kSmiTagMask));
172
    __ j(zero, &done, taken);
173
    __ mov(destination(), scratch0());
174 175 176
    __ jmp(bailout());
    __ bind(&done);
  }
177 178 179 180 181

  // If we didn't bailout, the result (in fact, both inputs too) is known to
  // be a smi.
  set_as_smi(accumulator0());
  set_as_smi(accumulator1());
182 183 184
}


185
void FastCodeGenerator::Generate(CompilationInfo* compilation_info) {
186
  ASSERT(info_ == NULL);
187
  info_ = compilation_info;
188 189 190 191 192 193 194 195 196 197

  // Save the caller's frame pointer and set up our own.
  Comment prologue_cmnt(masm(), ";; Prologue");
  __ push(ebp);
  __ mov(ebp, esp);
  __ push(esi);  // Context.
  __ push(edi);  // Closure.
  // Note that we keep a live register reference to esi (context) at this
  // point.

198 199 200 201
  // Receiver (this) is allocated to a fixed register.
  if (info()->has_this_properties()) {
    Comment cmnt(masm(), ";; MapCheck(this)");
    if (FLAG_print_ir) {
202
      PrintF("#: MapCheck(this)\n");
203 204 205 206 207 208 209
    }
    ASSERT(info()->has_receiver() && info()->receiver()->IsHeapObject());
    Handle<HeapObject> object = Handle<HeapObject>::cast(info()->receiver());
    Handle<Map> map(object->map());
    EmitLoadReceiver();
    __ CheckMap(receiver_reg(), map, bailout(), false);
  }
210

211 212 213 214 215
  // If there is a global variable access check if the global object is the
  // same as at lazy-compilation time.
  if (info()->has_globals()) {
    Comment cmnt(masm(), ";; MapCheck(GLOBAL)");
    if (FLAG_print_ir) {
216
      PrintF("#: MapCheck(GLOBAL)\n");
217 218 219 220 221 222
    }
    ASSERT(info()->has_global_object());
    Handle<Map> map(info()->global_object()->map());
    __ mov(scratch0(), CodeGenerator::GlobalObject());
    __ CheckMap(scratch0(), map, bailout(), true);
  }
223

224
  VisitStatements(function()->body());
225 226

  Comment return_cmnt(masm(), ";; Return(<undefined>)");
227
  if (FLAG_print_ir) {
228
    PrintF("#: Return(<undefined>)\n");
229
  }
230 231 232
  __ mov(eax, Factory::undefined_value());
  __ mov(esp, ebp);
  __ pop(ebp);
233
  __ ret((scope()->num_parameters() + 1) * kPointerSize);
234 235 236 237 238 239 240 241 242

  __ bind(&bailout_);
}


#undef __


} }  // namespace v8::internal