Make more JS files beter match the coding standard.

test/mjsunit/compiler/assignment-deopt.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 22 matching lines @@
 
 function assign1(x) { x += 1; o.x = x; }
 assign1(max_smi);
 assertEquals(max_smi + 1, o.x);
 
 assign1(1.1);
 assertEquals(2.1, o.x);
 
 
 // Test deopt with count operation on named property.
-function assign2(p) { p.x += 1 }
+function assign2(p) { p.x += 1; }
 
 o.x = "42";
 assign2(o);
 assertEquals("421", o.x);
 
 var s = max_smi - 10;
 o.x = s;
 for(var i = 0; i < 20; i++) {
   assign2(o);
   if (i == 4) {
@@ skipping 66 matching lines @@
 %OptimizeFunctionOnNextCall(assign9);
 q[0] = 42;
 assertEquals(44, assign9(q, 1));
 
 q[0] = 42;
 assertEquals(44.1, assign9(q, 1.1));
 q[0] = 42.1;
 assertEquals(44.1, assign9(q, 1));
 
 // Test deopt because of a failed map check on the load.
-function assign10(p) { return p.x += 1 }
+function assign10(p) { return p.x += 1; }
 var g1 = {x:0};
 var g2 = {y:0, x:42};
 for (var i = 0; i < 5; ++i) {
   g1.x = 42;
   assertEquals(43, assign10(g1));
   assertEquals(43, g1.x);
 }
 %OptimizeFunctionOnNextCall(assign10);
 g1.x = 42;
 assertEquals(43, assign10(g1));
@@ skipping 30 matching lines @@
   assign12(o);
 }
 %OptimizeFunctionOnNextCall(assign12);
 o[0] = "a";
 assign12(o);
 
 assertEquals("a11", assign12(o));
 o[0] = g4;
 assertEquals(43, assign12(o));
 assertEquals("bar", o.y);