Make more JS files beter match the coding standard.

test/mjsunit/compiler/count-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 inc1(x) { x++; o.x = x; }
 inc1(max_smi);
 assertEquals(max_smi + 1, o.x);
 
 inc1(1.1);
 assertEquals(2.1, o.x);
 
 
 // Test deopt with count operation on named property.
-function inc2(p) { p.x++ }
+function inc2(p) { p.x++; }
 
 o.x = "42";
 inc2(o);
 assertEquals(43, o.x);
 
 var s = max_smi - 10;
 o.x = s;
 for(var i = 0; i < 20; i++) {
   inc2(o);
   if (i == 4) {
@@ skipping 97 matching lines @@
 }
 %OptimizeFunctionOnNextCall(inc9);
 q[0] = 42;
 assertEquals(44, inc9(q, 1));
 q[0] = 42;
 assertEquals(44.1, inc9(q, 1.1));
 q[0] = 42.1;
 assertEquals(44.1, inc9(q, 1));
 
 // Test deopt because of a failed map check.
-function inc10(p) { return p.x++ }
+function inc10(p) { return p.x++; }
 var g1 = {x:0};
-var g2 = {y:0, x:42}
+var g2 = {y:0, x:42};
 for (var i = 0; i < 5; ++i) {
   g1.x = 42;
   assertEquals(42, inc10(g1));
   assertEquals(43, g1.x);
 }
 %OptimizeFunctionOnNextCall(inc10);
 g1.x = 42;
 assertEquals(42, inc10(g1));
 assertEquals(43, g1.x);
 assertEquals(42, inc10(g2));
 assertEquals(43, g2.x);
 
 // Test deoptimization with postfix operation in a value context.
 function inc11(a) { return a[this.x++]; }
 var g3 = {x:null, f:inc11};
 var g4 = [42];
 assertEquals(42, g3.f(g4));