mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
109 lines
3.4 KiB
109 lines
3.4 KiB
// 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
|
|
// 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.
|
|
|
|
// Regression test for the register allocator.
|
|
var gp = "";
|
|
var yE = "";
|
|
var W = "";
|
|
var LA = "";
|
|
var zE = "";
|
|
var Fp = "";
|
|
var AE = "";
|
|
var Gob = "";
|
|
var Hob = "";
|
|
var Iob = "";
|
|
var Job = "";
|
|
var Kob = "";
|
|
var Lob = "";
|
|
var Mob = "";
|
|
var p = "";
|
|
function O() { this.append = function(a,b,c,d,e) { return a + b + c + d + e; } }
|
|
|
|
function Nob(b,a) {
|
|
var c;
|
|
if (b==2) {
|
|
c=new O;
|
|
c.append(gp,
|
|
yE,
|
|
W,
|
|
LA+(a.Un+(zE+(Fp+(LA+(a.Im+(zE+(AE+(LA+(a.total+Gob))))))))),
|
|
p);
|
|
c=c.toString();
|
|
} else {
|
|
if (b==1) {
|
|
if(a.total>=2E6) {
|
|
c=new O;
|
|
c.append(gp,yE,W,LA+(a.Un+(zE+(Fp+(LA+(a.Im+Hob))))),p);
|
|
c=c.toString();
|
|
} else {
|
|
if(a.total>=2E5) {
|
|
c=new O;
|
|
c.append(gp,yE,W,LA+(a.Un+(zE+(Fp+(LA+(a.Im+Iob))))),p);
|
|
c=c.toString();
|
|
} else {
|
|
if(a.total>=2E4) {
|
|
c=new O;
|
|
c.append(gp,yE,W,LA+(a.Un+(zE+(Fp+(LA+(a.Im+Job))))),p);
|
|
c=c.toString();
|
|
} else {
|
|
if(a.total>=2E3) {
|
|
c=new O;
|
|
c.append(gp,yE,W,LA+(a.Un+(zE+(Fp+(LA+(a.Im+Kob))))),p);
|
|
c=c.toString();
|
|
} else {
|
|
if(a.total>=200) {
|
|
c=new O;
|
|
c.append(gp,yE,W,LA+(a.Un+(zE+(Fp+(LA+(a.Im+Lob))))),p);
|
|
c=c.toString();
|
|
} else {
|
|
c=new O;
|
|
c.append(gp,yE,W,
|
|
LA+(a.Un+(zE+(Fp+(LA+(a.Im+(zE+(Mob+(LA+(a.total+zE))))))))),
|
|
p);
|
|
c=c.toString();
|
|
}
|
|
c=c;
|
|
}
|
|
c=c;
|
|
}
|
|
c=c;
|
|
}
|
|
c=c;
|
|
}
|
|
c=c;
|
|
} else {
|
|
c=new O;
|
|
c.append(gp,yE,W,
|
|
LA+(a.Un+(zE+(Fp+(LA+(a.Im+(zE+(AE+(LA+(a.total+zE))))))))),
|
|
p);
|
|
c=c.toString();
|
|
}
|
|
c=c;
|
|
}
|
|
return c;
|
|
}
|
|
Nob(2, { Un: "" , Im: "" , total: 42});
|
|
|