lithium.cc 15.2 KB
Newer Older
1
// Copyright 2012 the V8 project authors. All rights reserved.
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
// 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.

28
#include "v8.h"
29
#include "lithium.h"
30 31 32 33
#include "scopes.h"

#if V8_TARGET_ARCH_IA32
#include "ia32/lithium-ia32.h"
34
#include "ia32/lithium-codegen-ia32.h"
35 36
#elif V8_TARGET_ARCH_X64
#include "x64/lithium-x64.h"
37
#include "x64/lithium-codegen-x64.h"
38 39
#elif V8_TARGET_ARCH_ARM
#include "arm/lithium-arm.h"
40
#include "arm/lithium-codegen-arm.h"
41 42
#elif V8_TARGET_ARCH_MIPS
#include "mips/lithium-mips.h"
43
#include "mips/lithium-codegen-mips.h"
44 45 46
#else
#error "Unknown architecture."
#endif
47 48 49 50

namespace v8 {
namespace internal {

51 52 53 54 55

void LOperand::PrintTo(StringStream* stream) {
  LUnallocated* unalloc = NULL;
  switch (kind()) {
    case INVALID:
56
      stream->Add("(0)");
57 58 59 60
      break;
    case UNALLOCATED:
      unalloc = LUnallocated::cast(this);
      stream->Add("v%d", unalloc->virtual_register());
61 62 63 64 65
      if (unalloc->basic_policy() == LUnallocated::FIXED_SLOT) {
        stream->Add("(=%dS)", unalloc->fixed_slot_index());
        break;
      }
      switch (unalloc->extended_policy()) {
66 67 68
        case LUnallocated::NONE:
          break;
        case LUnallocated::FIXED_REGISTER: {
69
          int reg_index = unalloc->fixed_register_index();
70
          const char* register_name =
71
              Register::AllocationIndexToString(reg_index);
72 73 74 75
          stream->Add("(=%s)", register_name);
          break;
        }
        case LUnallocated::FIXED_DOUBLE_REGISTER: {
76
          int reg_index = unalloc->fixed_register_index();
77
          const char* double_register_name =
78
              DoubleRegister::AllocationIndexToString(reg_index);
79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
          stream->Add("(=%s)", double_register_name);
          break;
        }
        case LUnallocated::MUST_HAVE_REGISTER:
          stream->Add("(R)");
          break;
        case LUnallocated::WRITABLE_REGISTER:
          stream->Add("(WR)");
          break;
        case LUnallocated::SAME_AS_FIRST_INPUT:
          stream->Add("(1)");
          break;
        case LUnallocated::ANY:
          stream->Add("(-)");
          break;
      }
      break;
    case CONSTANT_OPERAND:
      stream->Add("[constant:%d]", index());
      break;
    case STACK_SLOT:
      stream->Add("[stack:%d]", index());
      break;
    case DOUBLE_STACK_SLOT:
      stream->Add("[double_stack:%d]", index());
      break;
    case REGISTER:
      stream->Add("[%s|R]", Register::AllocationIndexToString(index()));
      break;
    case DOUBLE_REGISTER:
      stream->Add("[%s|R]", DoubleRegister::AllocationIndexToString(index()));
      break;
    case ARGUMENT:
      stream->Add("[arg:%d]", index());
      break;
  }
}

117
#define DEFINE_OPERAND_CACHE(name, type)                      \
118 119 120
  L##name* L##name::cache = NULL;                             \
                                                              \
  void L##name::SetUpCache() {                                \
121
    if (cache) return;                                        \
122
    cache = new L##name[kNumCachedOperands];                  \
123 124 125 126
    for (int i = 0; i < kNumCachedOperands; i++) {            \
      cache[i].ConvertTo(type, i);                            \
    }                                                         \
  }                                                           \
127 128 129 130
                                                              \
  void L##name::TearDownCache() {                             \
    delete[] cache;                                           \
  }
131

132
LITHIUM_OPERAND_LIST(DEFINE_OPERAND_CACHE)
133 134 135
#undef DEFINE_OPERAND_CACHE

void LOperand::SetUpCaches() {
136 137 138 139 140 141 142 143 144 145
#define LITHIUM_OPERAND_SETUP(name, type) L##name::SetUpCache();
  LITHIUM_OPERAND_LIST(LITHIUM_OPERAND_SETUP)
#undef LITHIUM_OPERAND_SETUP
}


void LOperand::TearDownCaches() {
#define LITHIUM_OPERAND_TEARDOWN(name, type) L##name::TearDownCache();
  LITHIUM_OPERAND_LIST(LITHIUM_OPERAND_TEARDOWN)
#undef LITHIUM_OPERAND_TEARDOWN
146
}
147

148

149 150 151 152 153 154 155 156 157
bool LParallelMove::IsRedundant() const {
  for (int i = 0; i < move_operands_.length(); ++i) {
    if (!move_operands_[i].IsRedundant()) return false;
  }
  return true;
}


void LParallelMove::PrintDataTo(StringStream* stream) const {
158 159
  bool first = true;
  for (int i = 0; i < move_operands_.length(); ++i) {
160
    if (!move_operands_[i].IsEliminated()) {
161 162 163 164 165 166
      LOperand* source = move_operands_[i].source();
      LOperand* destination = move_operands_[i].destination();
      if (!first) stream->Add(" ");
      first = false;
      if (source->Equals(destination)) {
        destination->PrintTo(stream);
167
      } else {
168
        destination->PrintTo(stream);
169
        stream->Add(" = ");
170
        source->PrintTo(stream);
171
      }
172
      stream->Add(";");
173 174 175 176 177
    }
  }
}


178
void LEnvironment::PrintTo(StringStream* stream) {
179
  stream->Add("[id=%d|", ast_id().ToInt());
180 181 182
  if (deoptimization_index() != Safepoint::kNoDeoptimizationIndex) {
    stream->Add("deopt_id=%d|", deoptimization_index());
  }
183 184
  stream->Add("parameters=%d|", parameter_count());
  stream->Add("arguments_stack_height=%d|", arguments_stack_height());
185 186 187 188 189 190 191 192 193 194 195 196
  for (int i = 0; i < values_.length(); ++i) {
    if (i != 0) stream->Add(";");
    if (values_[i] == NULL) {
      stream->Add("[hole]");
    } else {
      values_[i]->PrintTo(stream);
    }
  }
  stream->Add("]");
}


197
void LPointerMap::RecordPointer(LOperand* op, Zone* zone) {
198 199 200
  // Do not record arguments as pointers.
  if (op->IsStackSlot() && op->index() < 0) return;
  ASSERT(!op->IsDoubleRegister() && !op->IsDoubleStackSlot());
201
  pointer_operands_.Add(op, zone);
202 203 204
}


205 206 207 208 209 210 211 212 213 214 215 216 217
void LPointerMap::RemovePointer(LOperand* op) {
  // Do not record arguments as pointers.
  if (op->IsStackSlot() && op->index() < 0) return;
  ASSERT(!op->IsDoubleRegister() && !op->IsDoubleStackSlot());
  for (int i = 0; i < pointer_operands_.length(); ++i) {
    if (pointer_operands_[i]->Equals(op)) {
      pointer_operands_.Remove(i);
      --i;
    }
  }
}


218
void LPointerMap::RecordUntagged(LOperand* op, Zone* zone) {
219 220 221
  // Do not record arguments as pointers.
  if (op->IsStackSlot() && op->index() < 0) return;
  ASSERT(!op->IsDoubleRegister() && !op->IsDoubleStackSlot());
222
  untagged_operands_.Add(op, zone);
223 224 225
}


226 227 228 229 230 231
void LPointerMap::PrintTo(StringStream* stream) {
  stream->Add("{");
  for (int i = 0; i < pointer_operands_.length(); ++i) {
    if (i != 0) stream->Add(";");
    pointer_operands_[i]->PrintTo(stream);
  }
232
  stream->Add("}");
233 234 235
}


236
int ElementsKindToShiftSize(ElementsKind elements_kind) {
237
  switch (elements_kind) {
238 239 240
    case EXTERNAL_BYTE_ELEMENTS:
    case EXTERNAL_PIXEL_ELEMENTS:
    case EXTERNAL_UNSIGNED_BYTE_ELEMENTS:
241
      return 0;
242 243
    case EXTERNAL_SHORT_ELEMENTS:
    case EXTERNAL_UNSIGNED_SHORT_ELEMENTS:
244
      return 1;
245 246 247
    case EXTERNAL_INT_ELEMENTS:
    case EXTERNAL_UNSIGNED_INT_ELEMENTS:
    case EXTERNAL_FLOAT_ELEMENTS:
248
      return 2;
249 250
    case EXTERNAL_DOUBLE_ELEMENTS:
    case FAST_DOUBLE_ELEMENTS:
251
    case FAST_HOLEY_DOUBLE_ELEMENTS:
252
      return 3;
253
    case FAST_SMI_ELEMENTS:
254
    case FAST_ELEMENTS:
255 256
    case FAST_HOLEY_SMI_ELEMENTS:
    case FAST_HOLEY_ELEMENTS:
257 258
    case DICTIONARY_ELEMENTS:
    case NON_STRICT_ARGUMENTS_ELEMENTS:
259
      return kPointerSizeLog2;
260 261 262 263 264 265
  }
  UNREACHABLE();
  return 0;
}


266 267 268 269 270 271 272
int StackSlotOffset(int index) {
  if (index >= 0) {
    // Local or spill slot. Skip the frame pointer, function, and
    // context in the fixed part of the frame.
    return -(index + 3) * kPointerSize;
  } else {
    // Incoming parameter. Skip the return address.
273
    return -(index + 1) * kPointerSize + kFPOnStackSize + kPCOnStackSize;
274 275 276 277
  }
}


278 279 280 281 282 283 284 285 286 287
LChunk::LChunk(CompilationInfo* info, HGraph* graph)
    : spill_slot_count_(0),
      info_(info),
      graph_(graph),
      instructions_(32, graph->zone()),
      pointer_maps_(8, graph->zone()),
      inlined_closures_(1, graph->zone()) {
}


288
LLabel* LChunk::GetLabel(int block_id) const {
289 290 291 292 293 294
  HBasicBlock* block = graph_->blocks()->at(block_id);
  int first_instruction = block->first_instruction_index();
  return LLabel::cast(instructions_[first_instruction]);
}


295
int LChunk::LookupDestination(int block_id) const {
296 297 298 299 300 301 302
  LLabel* cur = GetLabel(block_id);
  while (cur->replacement() != NULL) {
    cur = cur->replacement();
  }
  return cur->block_id();
}

303
Label* LChunk::GetAssemblyLabel(int block_id) const {
304 305 306 307 308
  LLabel* label = GetLabel(block_id);
  ASSERT(!label->HasReplacement());
  return label->label();
}

309

310
void LChunk::MarkEmptyBlocks() {
311
  LPhase phase("L_Mark empty blocks", this);
312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344
  for (int i = 0; i < graph()->blocks()->length(); ++i) {
    HBasicBlock* block = graph()->blocks()->at(i);
    int first = block->first_instruction_index();
    int last = block->last_instruction_index();
    LInstruction* first_instr = instructions()->at(first);
    LInstruction* last_instr = instructions()->at(last);

    LLabel* label = LLabel::cast(first_instr);
    if (last_instr->IsGoto()) {
      LGoto* goto_instr = LGoto::cast(last_instr);
      if (label->IsRedundant() &&
          !label->is_loop_header()) {
        bool can_eliminate = true;
        for (int i = first + 1; i < last && can_eliminate; ++i) {
          LInstruction* cur = instructions()->at(i);
          if (cur->IsGap()) {
            LGap* gap = LGap::cast(cur);
            if (!gap->IsRedundant()) {
              can_eliminate = false;
            }
          } else {
            can_eliminate = false;
          }
        }
        if (can_eliminate) {
          label->set_replacement(GetLabel(goto_instr->block_id()));
        }
      }
    }
  }
}


345
void LChunk::AddInstruction(LInstruction* instr, HBasicBlock* block) {
346
  LInstructionGap* gap = new(graph_->zone()) LInstructionGap(block);
347
  gap->set_hydrogen_value(instr->hydrogen_value());
348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364
  int index = -1;
  if (instr->IsControl()) {
    instructions_.Add(gap, zone());
    index = instructions_.length();
    instructions_.Add(instr, zone());
  } else {
    index = instructions_.length();
    instructions_.Add(instr, zone());
    instructions_.Add(gap, zone());
  }
  if (instr->HasPointerMap()) {
    pointer_maps_.Add(instr->pointer_map(), zone());
    instr->pointer_map()->set_lithium_position(index);
  }
}


365
LConstantOperand* LChunk::DefineConstantOperand(HConstant* constant) {
366 367 368 369
  return LConstantOperand::Create(constant->id(), zone());
}


370
int LChunk::GetParameterStackSlot(int index) const {
371 372 373 374
  // The receiver is at index 0, the first parameter at index 1, so we
  // shift all parameter indexes down by the number of parameters, and
  // make sure they end up negative so they are distinguishable from
  // spill slots.
375 376
  int result = index - info()->num_parameters() - 1;

377 378 379 380 381 382
  ASSERT(result < 0);
  return result;
}


// A parameter relative to ebp in the arguments stub.
383
int LChunk::ParameterAt(int index) {
384 385 386 387 388 389
  ASSERT(-1 <= index);  // -1 is the receiver.
  return (1 + info()->scope()->num_parameters() - index) *
      kPointerSize;
}


390
LGap* LChunk::GetGapAt(int index) const {
391 392 393 394
  return LGap::cast(instructions_[index]);
}


395
bool LChunk::IsGapAt(int index) const {
396 397 398 399
  return instructions_[index]->IsGap();
}


400
int LChunk::NearestGapPos(int index) const {
401 402 403 404 405
  while (!IsGapAt(index)) index--;
  return index;
}


406
void LChunk::AddGapMove(int index, LOperand* from, LOperand* to) {
407 408 409 410 411
  GetGapAt(index)->GetOrCreateParallelMove(
      LGap::START, zone())->AddMove(from, to, zone());
}


412
HConstant* LChunk::LookupConstant(LConstantOperand* operand) const {
413
  return HConstant::cast(graph_->LookupValue(operand->index()));
414 415 416
}


417
Representation LChunk::LookupLiteralRepresentation(
418 419 420 421 422
    LConstantOperand* operand) const {
  return graph_->LookupValue(operand->index())->representation();
}


423
LChunk* LChunk::NewChunk(HGraph* graph) {
424 425
  DisallowHandleAllocation no_handles;
  DisallowHeapAllocation no_gc;
426
  graph->DisallowAddingNewValues();
427
  int values = graph->GetMaximumValueID();
428
  CompilationInfo* info = graph->info();
429
  if (values > LUnallocated::kMaxVirtualRegisters) {
430
    info->set_bailout_reason(kNotEnoughVirtualRegistersForValues);
431 432 433
    return NULL;
  }
  LAllocator allocator(values, graph);
434
  LChunkBuilder builder(info, graph, &allocator);
435
  LChunk* chunk = builder.Build();
436 437 438
  if (chunk == NULL) return NULL;

  if (!allocator.Allocate(chunk)) {
439
    info->set_bailout_reason(kNotEnoughVirtualRegistersRegalloc);
440 441 442
    return NULL;
  }

443 444 445
  chunk->set_allocated_double_registers(
      allocator.assigned_double_registers());

446 447 448 449
  return chunk;
}


450
Handle<Code> LChunk::Codegen() {
451
  MacroAssembler assembler(info()->isolate(), NULL, 0);
452 453 454
  LOG_CODE_EVENT(info()->isolate(),
                 CodeStartLinePosInfoRecordEvent(
                     assembler.positions_recorder()));
455 456 457 458 459
  LCodeGen generator(this, &assembler, info());

  MarkEmptyBlocks();

  if (generator.GenerateCode()) {
460
    CodeGenerator::MakeCodePrologue(info(), "optimized");
461
    Code::Flags flags = info()->flags();
462 463 464
    Handle<Code> code =
        CodeGenerator::MakeCodeEpilogue(&assembler, flags, info());
    generator.FinishCode(code);
465
    code->set_is_crankshafted(true);
466 467 468 469
    void* jit_handler_data =
        assembler.positions_recorder()->DetachJITHandlerData();
    LOG_CODE_EVENT(info()->isolate(),
                   CodeEndLinePosInfoRecordEvent(*code, jit_handler_data));
470

471 472 473 474 475 476 477
    CodeGenerator::PrintCode(code, info());
    return code;
  }
  return Handle<Code>::null();
}


478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494
void LChunk::set_allocated_double_registers(BitVector* allocated_registers) {
  allocated_double_registers_ = allocated_registers;
  BitVector* doubles = allocated_double_registers();
  BitVector::Iterator iterator(doubles);
  while (!iterator.Done()) {
    if (info()->saves_caller_doubles()) {
      if (kDoubleSize == kPointerSize * 2) {
        spill_slot_count_ += 2;
      } else {
        spill_slot_count_++;
      }
    }
    iterator.Advance();
  }
}


495 496 497 498 499 500 501 502
LInstruction* LChunkBuilder::CheckElideControlInstruction(
    HControlInstruction* instr) {
  HBasicBlock* successor;
  if (!instr->KnownSuccessorBlock(&successor)) return NULL;
  return new(zone()) LGoto(successor);
}


503 504 505 506 507 508 509
LPhase::~LPhase() {
  if (ShouldProduceTraceOutput()) {
    isolate()->GetHTracer()->TraceLithium(name(), chunk_);
  }
}


510
} }  // namespace v8::internal