Make more JS files beter match the coding standard.

test/mjsunit/smi-ops-inlined.js

 // Copyright 2010 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
@@ skipping 210 matching lines @@
 assertTrue(v == v);
 assertTrue(v === v);
 assertTrue(v <= v);
 assertTrue(v >= v);
 assertFalse(v < v);
 assertFalse(v > v);
 assertFalse(v != v);
 assertFalse(v !== v);
 
 // Right hand side of unary minus is overwritable.
-v = 1.5
+v = 1.5;
 assertEquals(-2.25, -(v * v));
 
 // Smi input to bitop gives non-smi result where the rhs is a float that
 // can be overwritten.
 var x1 = 0x10000000;
 var x2 = 0x40000002;
 var x3 = 0x40000000;
 assertEquals(0x40000000, x1 << (x2 - x3), "0x10000000<<1(1)");
 
 // Smi input to bitop gives non-smi result where the rhs could be overwritten
 // if it were a float, but it isn't.
-x1 = 0x10000000
-x2 = 4
-x3 = 2
+x1 = 0x10000000;
+x2 = 4;
+x3 = 2;
 assertEquals(0x40000000, x1 << (x2 - x3), "0x10000000<<2(2)");
 
 
 // Test shift operators on non-smi inputs, giving smi and non-smi results.
 function testShiftNonSmis() {
   var pos_non_smi = 2000000000;
   var neg_non_smi = -pos_non_smi;
   var pos_smi = 1000000000;
   var neg_smi = -pos_smi;
 
@@ skipping 408 matching lines @@
   }
 }
 
 intConversion();
 
 // Verify that we handle the (optimized) corner case of shifting by
 // zero even for non-smis.
 function shiftByZero(n) { return n << 0; }
 
 assertEquals(3, shiftByZero(3.1415));