Make more JS files beter match the coding standard.

test/mjsunit/regress/regress-85177.js

 // Copyright 2011 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
 //       with the distribution.
 //     * Neither the name of Google Inc. nor the names of its
 //       contributors may be used to endorse or promote products derived
 //       from this software without specific prior written permission.
 //
 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // Flags: --allow-natives-syntax
 
-gW=gH=175;
-g=[];
+gW = gH = 175;
+g = [];
 
-for(var n=0; n<gW; n++){
+for(var n = 0; n < gW; n++){
  var l=[];
- for(var p=0; p<gH; p++){
-   l.push(1)
+ for(var p = 0; p < gH; p++){
+   l.push(1);
  }
- g.push(l)
+ g.push(l);
 }
 
-function k(a,b){
- if(a<0||b<0||a>=gW||b>=gH)
+function k(a, b){
+ if(a < 0 || b < 0 || a >= gW || b >= gH) {
    return 0;
+ }
  return g[a][b];
 }
 
 function f(){
- for(var a=[],f=0; f<gW; f++){
-   var b=[];
-   for(var h=0; h<gH; h++){
-     var e=0;
-     for(var i=-1; i<=1; i++)
-       for(var j=-1; j<=1; j++)
-          e+=k(f+i,h+j);
-     e=k(f,h)==1?1:0;
-     b.push(e)
+ for(var a = [], f=0; f < gW; f++){
+   var b = [];
+   for(var h = 0; h < gH; h++){
+     var e = 0;
+     for(var i = -1; i <= 1; i++)
+       for(var j = -1; j <= 1; j++) {
+         e += k(f + i, h + j);
+       }
+     e = k(f, h) == 1 ? 1 : 0;
+     b.push(e);
    }
-   a.push(b)
+   a.push(b);
  }
 }
 
 f();
 %OptimizeFunctionOnNextCall(f);
 f();
-