Ben Murdoch | 7d3e7fc | 2011-07-12 16:37:06 +0100 | [diff] [blame] | 1 | // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | |
| 28 | // Flags: --allow-natives-syntax |
| 29 | |
| 30 | gW=gH=175; |
| 31 | g=[]; |
| 32 | |
| 33 | for(var n=0; n<gW; n++){ |
| 34 | var l=[]; |
| 35 | for(var p=0; p<gH; p++){ |
| 36 | l.push(1) |
| 37 | } |
| 38 | g.push(l) |
| 39 | } |
| 40 | |
| 41 | function k(a,b){ |
| 42 | if(a<0||b<0||a>=gW||b>=gH) |
| 43 | return 0; |
| 44 | return g[a][b]; |
| 45 | } |
| 46 | |
| 47 | function f(){ |
| 48 | for(var a=[],f=0; f<gW; f++){ |
| 49 | var b=[]; |
| 50 | for(var h=0; h<gH; h++){ |
| 51 | var e=0; |
| 52 | for(var i=-1; i<=1; i++) |
| 53 | for(var j=-1; j<=1; j++) |
| 54 | e+=k(f+i,h+j); |
| 55 | e=k(f,h)==1?1:0; |
| 56 | b.push(e) |
| 57 | } |
| 58 | a.push(b) |
| 59 | } |
| 60 | } |
| 61 | |
| 62 | f(); |
| 63 | %OptimizeFunctionOnNextCall(f); |
| 64 | f(); |