[v8-dev] Merged r11459, r11523 into 3.9 branch. (issue 10377103)

Fri, 11 May 2012 02:11:58 -0700 

Reviewers: Michael Starzinger,

Description:
Merged r11459, r11523 into 3.9 branch.

MIPS: Removed unused variables (fixes for gcc-4.6)

MIPS: Fixed illegal instruction use on Loongson in code for Math.random().

[email protected]
BUG=v8:2115


Please review this at https://chromiumcodereview.appspot.com/10377103/

SVN Base: https://v8.googlecode.com/svn/branches/3.9

Affected files:
  M src/mips/code-stubs-mips.cc
  M src/mips/full-codegen-mips.cc
  M src/mips/lithium-codegen-mips.cc
  M src/mips/lithium-mips.cc
  M src/mips/stub-cache-mips.cc
  M src/version.cc


Index: src/mips/code-stubs-mips.cc
diff --git a/src/mips/code-stubs-mips.cc b/src/mips/code-stubs-mips.cc
index 3e7b5bf63bd37b172a76269bf8e29d73c0b1db09..5719d2cca39cc63066cfa827b916624dd8c2ae49 100644 
--- a/src/mips/code-stubs-mips.cc
+++ b/src/mips/code-stubs-mips.cc
@@ -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
Index: src/mips/full-codegen-mips.cc
diff --git a/src/mips/full-codegen-mips.cc b/src/mips/full-codegen-mips.cc
index 657bee86570eaf5094dd86cd33ab18c66ff6551d..778d140b0142ff2fcaf192c34452bfdd81fbabdb 100644 
--- a/src/mips/full-codegen-mips.cc
+++ b/src/mips/full-codegen-mips.cc
@@ -3646,7 +3646,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);
Index: src/mips/lithium-codegen-mips.cc
diff --git a/src/mips/lithium-codegen-mips.cc b/src/mips/lithium-codegen-mips.cc index 6628d8e1efd508fbc3d2c1b84992c1e4c4b40479..f21ed8f3ee7ee9962a9eafb787f813df53f7efe2 100644 
--- a/src/mips/lithium-codegen-mips.cc
+++ b/src/mips/lithium-codegen-mips.cc
@@ -2823,7 +2823,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));
 }
@@ -3210,7 +3209,7 @@ void LCodeGen::DoRandom(LRandom* instr) {
   // state[0] = 18273 * (state[0] & 0xFFFF) + (state[0] >> 16)
   __ And(a3, a1, Operand(0xFFFF));
   __ li(t0, Operand(18273));
-  __ mul(a3, a3, t0);
+  __ Mul(a3, a3, t0);
   __ srl(a1, a1, 16);
   __ Addu(a1, a3, a1);
   // Save state[0].
@@ -3219,7 +3218,7 @@ void LCodeGen::DoRandom(LRandom* instr) {
   // state[1] = 36969 * (state[1] & 0xFFFF) + (state[1] >> 16)
   __ And(a3, a0, Operand(0xFFFF));
   __ li(t0, Operand(36969));
-  __ mul(a3, a3, t0);
+  __ Mul(a3, a3, t0);
   __ srl(a0, a0, 16),
   __ Addu(a0, a3, a0);
   // Save state[1].
@@ -4124,7 +4123,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()) {
Index: src/mips/lithium-mips.cc
diff --git a/src/mips/lithium-mips.cc b/src/mips/lithium-mips.cc
index 29cb3c63d8f9ce34da09e1b7923ddd3457ee386b..32c887585349181a127b453085f4af539e9b786c 100644 
--- a/src/mips/lithium-mips.cc
+++ b/src/mips/lithium-mips.cc
@@ -1460,7 +1460,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);
Index: src/mips/stub-cache-mips.cc
diff --git a/src/mips/stub-cache-mips.cc b/src/mips/stub-cache-mips.cc
index f1a8c89f5377e7c522dd4aadbd9412720c6f2073..54f55b3ceb3b587fda01fec1b67a048834a41bfc 100644 
--- a/src/mips/stub-cache-mips.cc
+++ b/src/mips/stub-cache-mips.cc
@@ -1170,9 +1170,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);
@@ -4230,7 +4229,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.
Index: src/version.cc
diff --git a/src/version.cc b/src/version.cc
index d0240481c9f01e6be9c9841ba1aa7986529a7328..7ffe44648050a721c4e3635a9602c745ec6662b0 100644 
--- a/src/version.cc
+++ b/src/version.cc
@@ -35,7 +35,7 @@
 #define MAJOR_VERSION     3
 #define MINOR_VERSION     9
 #define BUILD_NUMBER      24
-#define PATCH_LEVEL       21
+#define PATCH_LEVEL       22
 // Use 1 for candidates and 0 otherwise.
 // (Boolean macro values are not supported by all preprocessors.)
 #define IS_CANDIDATE_VERSION 0


--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev

Reply via email to