MIPS: Removed unused variables.
These were found by compilation errors with gcc 4.6. BUG= TEST= Review URL: https://chromiumcodereview.appspot.com/10253004 Patch from Daniel Kalmar <kalmard@homejinni.com>. git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@11459 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
parent
569eba39f5
commit
03e8d039ca
@ -2754,7 +2754,6 @@ void BinaryOpStub::GenerateSmiCode(
|
||||
Register left = a1;
|
||||
Register right = a0;
|
||||
Register scratch1 = t3;
|
||||
Register scratch2 = t5;
|
||||
|
||||
// Perform combined smi check on both operands.
|
||||
__ Or(scratch1, left, Operand(right));
|
||||
@ -3459,7 +3458,6 @@ void TranscendentalCacheStub::Generate(MacroAssembler* masm) {
|
||||
|
||||
Label no_update;
|
||||
Label skip_cache;
|
||||
const Register heap_number_map = t2;
|
||||
|
||||
// Call C function to calculate the result and update the cache.
|
||||
// Register a0 holds precalculated cache entry address; preserve
|
||||
|
@ -3750,7 +3750,6 @@ void FullCodeGenerator::EmitFastAsciiArrayJoin(CallRuntime* expr) {
|
||||
Register scratch1 = t3;
|
||||
Register scratch2 = t5;
|
||||
Register scratch3 = t4;
|
||||
Register scratch4 = v1;
|
||||
|
||||
// Separator operand is on the stack.
|
||||
__ pop(separator);
|
||||
|
@ -2832,7 +2832,6 @@ void LCodeGen::DoDeclareGlobals(LDeclareGlobals* instr) {
|
||||
|
||||
|
||||
void LCodeGen::DoGlobalObject(LGlobalObject* instr) {
|
||||
Register context = ToRegister(instr->context());
|
||||
Register result = ToRegister(instr->result());
|
||||
__ lw(result, ContextOperand(cp, Context::GLOBAL_INDEX));
|
||||
}
|
||||
@ -4156,7 +4155,6 @@ void LCodeGen::DoDoubleToI(LDoubleToI* instr) {
|
||||
Register scratch1 = scratch0();
|
||||
Register scratch2 = ToRegister(instr->TempAt(0));
|
||||
DoubleRegister double_input = ToDoubleRegister(instr->InputAt(0));
|
||||
DoubleRegister double_scratch = double_scratch0();
|
||||
FPURegister single_scratch = double_scratch0().low();
|
||||
|
||||
if (instr->truncating()) {
|
||||
|
@ -1442,7 +1442,6 @@ LInstruction* LChunkBuilder::DoRandom(HRandom* instr) {
|
||||
|
||||
|
||||
LInstruction* LChunkBuilder::DoCompareGeneric(HCompareGeneric* instr) {
|
||||
Representation r = instr->GetInputRepresentation();
|
||||
ASSERT(instr->left()->representation().IsTagged());
|
||||
ASSERT(instr->right()->representation().IsTagged());
|
||||
LOperand* left = UseFixed(instr->left(), a1);
|
||||
|
@ -1176,9 +1176,8 @@ void StubCompiler::GenerateLoadConstant(Handle<JSObject> object,
|
||||
__ JumpIfSmi(receiver, miss, scratch1);
|
||||
|
||||
// Check that the maps haven't changed.
|
||||
Register reg =
|
||||
CheckPrototypes(object, receiver, holder,
|
||||
scratch1, scratch2, scratch3, name, miss);
|
||||
CheckPrototypes(object, receiver, holder,
|
||||
scratch1, scratch2, scratch3, name, miss);
|
||||
|
||||
// Return the constant value.
|
||||
__ LoadHeapObject(v0, value);
|
||||
@ -4273,7 +4272,6 @@ void KeyedStoreStubCompiler::GenerateStoreFastElement(
|
||||
Register elements_reg = a3;
|
||||
Register length_reg = t1;
|
||||
Register scratch2 = t2;
|
||||
Register scratch3 = t3;
|
||||
|
||||
// This stub is meant to be tail-jumped to, the receiver must already
|
||||
// have been verified by the caller to not be a smi.
|
||||
|
Loading…
Reference in New Issue
Block a user