2009-02-27 13:00:32 +00:00
|
|
|
// Copyright 2008 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"
|
|
|
|
|
2009-03-20 12:58:14 +00:00
|
|
|
#include "codegen-inl.h"
|
|
|
|
#include "register-allocator-inl.h"
|
2009-02-27 13:00:32 +00:00
|
|
|
|
2009-05-25 10:05:56 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2009-02-27 13:00:32 +00:00
|
|
|
|
|
|
|
// -------------------------------------------------------------------------
|
|
|
|
// Result implementation.
|
|
|
|
|
|
|
|
void Result::ToRegister() {
|
|
|
|
ASSERT(is_valid());
|
|
|
|
if (is_constant()) {
|
2009-05-15 11:09:51 +00:00
|
|
|
Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate();
|
2009-02-27 13:00:32 +00:00
|
|
|
ASSERT(fresh.is_valid());
|
2009-05-15 11:09:51 +00:00
|
|
|
if (CodeGeneratorScope::Current()->IsUnsafeSmi(handle())) {
|
2009-11-16 23:11:19 +00:00
|
|
|
CodeGeneratorScope::Current()->MoveUnsafeSmi(fresh.reg(), handle());
|
2009-02-27 13:00:32 +00:00
|
|
|
} else {
|
2009-05-15 11:09:51 +00:00
|
|
|
CodeGeneratorScope::Current()->masm()->Set(fresh.reg(),
|
|
|
|
Immediate(handle()));
|
2009-02-27 13:00:32 +00:00
|
|
|
}
|
|
|
|
// This result becomes a copy of the fresh one.
|
|
|
|
*this = fresh;
|
|
|
|
}
|
|
|
|
ASSERT(is_register());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Result::ToRegister(Register target) {
|
|
|
|
ASSERT(is_valid());
|
|
|
|
if (!is_register() || !reg().is(target)) {
|
2009-05-15 11:09:51 +00:00
|
|
|
Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(target);
|
2009-02-27 13:00:32 +00:00
|
|
|
ASSERT(fresh.is_valid());
|
|
|
|
if (is_register()) {
|
2009-05-15 11:09:51 +00:00
|
|
|
CodeGeneratorScope::Current()->masm()->mov(fresh.reg(), reg());
|
2009-02-27 13:00:32 +00:00
|
|
|
} else {
|
|
|
|
ASSERT(is_constant());
|
2009-05-15 11:09:51 +00:00
|
|
|
if (CodeGeneratorScope::Current()->IsUnsafeSmi(handle())) {
|
2009-11-16 23:11:19 +00:00
|
|
|
CodeGeneratorScope::Current()->MoveUnsafeSmi(fresh.reg(), handle());
|
2009-02-27 13:00:32 +00:00
|
|
|
} else {
|
2009-05-15 11:09:51 +00:00
|
|
|
CodeGeneratorScope::Current()->masm()->Set(fresh.reg(),
|
|
|
|
Immediate(handle()));
|
2009-02-27 13:00:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
*this = fresh;
|
|
|
|
} else if (is_register() && reg().is(target)) {
|
2009-05-15 11:09:51 +00:00
|
|
|
ASSERT(CodeGeneratorScope::Current()->has_valid_frame());
|
|
|
|
CodeGeneratorScope::Current()->frame()->Spill(target);
|
|
|
|
ASSERT(CodeGeneratorScope::Current()->allocator()->count(target) == 1);
|
2009-02-27 13:00:32 +00:00
|
|
|
}
|
|
|
|
ASSERT(is_register());
|
|
|
|
ASSERT(reg().is(target));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------------
|
|
|
|
// RegisterAllocator implementation.
|
|
|
|
|
|
|
|
Result RegisterAllocator::AllocateByteRegisterWithoutSpilling() {
|
|
|
|
Result result = AllocateWithoutSpilling();
|
|
|
|
// Check that the register is a byte register. If not, unuse the
|
|
|
|
// register if valid and return an invalid result.
|
|
|
|
if (result.is_valid() && !result.reg().is_byte_register()) {
|
|
|
|
result.Unuse();
|
2009-05-15 11:09:51 +00:00
|
|
|
return Result();
|
2009-02-27 13:00:32 +00:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
} } // namespace v8::internal
|