Commit 44b69b07 authored by plind44@gmail.com's avatar plind44@gmail.com

MIPS: Improve allocate locals to reduce code size.

TEST=
BUG=
R=plind44@gmail.com

Review URL: https://codereview.chromium.org/104713013

Patch from Dusan Milosavljevic <Dusan.Milosavljevic@rt-rk.com>.

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@18398 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent fd6b6ace
...@@ -179,20 +179,21 @@ void FullCodeGenerator::Generate() { ...@@ -179,20 +179,21 @@ void FullCodeGenerator::Generate() {
// Generators allocate locals, if any, in context slots. // Generators allocate locals, if any, in context slots.
ASSERT(!info->function()->is_generator() || locals_count == 0); ASSERT(!info->function()->is_generator() || locals_count == 0);
if (locals_count > 0) { if (locals_count > 0) {
__ LoadRoot(at, Heap::kUndefinedValueRootIndex);
// Emit a loop to initialize stack cells for locals when optimizing for // Emit a loop to initialize stack cells for locals when optimizing for
// size. Otherwise, unroll the loop for maximum performance. // size. Otherwise, unroll the loop for maximum performance.
__ LoadRoot(t5, Heap::kUndefinedValueRootIndex); __ LoadRoot(t5, Heap::kUndefinedValueRootIndex);
if (FLAG_optimize_for_size && locals_count > 4) { if ((FLAG_optimize_for_size && locals_count > 4) ||
!is_int16(locals_count)) {
Label loop; Label loop;
__ li(a2, Operand(locals_count)); __ Subu(a2, sp, Operand(locals_count * kPointerSize));
__ bind(&loop); __ bind(&loop);
__ Subu(a2, a2, 1); __ Subu(sp, sp, Operand(kPointerSize));
__ push(t5); __ Branch(&loop, gt, sp, Operand(a2), USE_DELAY_SLOT);
__ Branch(&loop, gt, a2, Operand(zero_reg)); __ sw(t5, MemOperand(sp, 0)); // Push in the delay slot.
} else { } else {
__ Subu(sp, sp, Operand(locals_count * kPointerSize));
for (int i = 0; i < locals_count; i++) { for (int i = 0; i < locals_count; i++) {
__ push(t5); __ sw(t5, MemOperand(sp, i * kPointerSize));
} }
} }
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment