therubyracer 0.4.8-x86-darwin-9 → 0.4.9-x86-darwin-9

data/ext/v8/upstream/2.0.6/test/mjsunit/tobool.js

@@ -1,36 +0,0 @@
-// Copyright 2008 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.
-
-// All objects, including wrappers, must convert to true.
-assertTrue(!!new Boolean(true), "new Boolean(true)");
-assertTrue(!!new Boolean(false), "new Boolean(false)");
-
-assertTrue(!!new Number(-1), "new Number(-1)");
-assertTrue(!!new Number(0), "new Number(0)");
-assertTrue(!!new Number(1), "new Number(1)");
-
-

data/ext/v8/upstream/2.0.6/test/mjsunit/toint32.js

@@ -1,129 +0,0 @@
-// Copyright 2008 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.
-
-function toInt32(x) {
-  return x | 0;
-}
-
-assertEquals(0, toInt32(Infinity), "Inf");
-assertEquals(0, toInt32(-Infinity), "-Inf");
-assertEquals(0, toInt32(NaN), "NaN");
-assertEquals(0, toInt32(0.0), "zero");
-assertEquals(0, toInt32(-0.0), "-zero");
-
-assertEquals(0, toInt32(Number.MIN_VALUE));
-assertEquals(0, toInt32(-Number.MIN_VALUE));
-assertEquals(0, toInt32(0.1));
-assertEquals(0, toInt32(-0.1));
-assertEquals(1, toInt32(1), "one");
-assertEquals(1, toInt32(1.1), "onepointone");
-assertEquals(-1, toInt32(-1), "-one");
-assertEquals(0, toInt32(0.6), "truncate positive (0.6)");
-assertEquals(1, toInt32(1.6), "truncate positive (1.6)");
-assertEquals(0, toInt32(-0.6), "truncate negative (-0.6)");
-assertEquals(-1, toInt32(-1.6), "truncate negative (-1.6)");
-
-assertEquals(2147483647, toInt32(2147483647));
-assertEquals(-2147483648, toInt32(2147483648));
-assertEquals(-2147483647, toInt32(2147483649));
-
-assertEquals(-1, toInt32(4294967295));
-assertEquals(0, toInt32(4294967296));
-assertEquals(1, toInt32(4294967297));
-
-assertEquals(-2147483647, toInt32(-2147483647));
-assertEquals(-2147483648, toInt32(-2147483648));
-assertEquals(2147483647, toInt32(-2147483649));
-
-assertEquals(1, toInt32(-4294967295));
-assertEquals(0, toInt32(-4294967296));
-assertEquals(-1, toInt32(-4294967297));
-
-assertEquals(-2147483648, toInt32(2147483648.25));
-assertEquals(-2147483648, toInt32(2147483648.5));
-assertEquals(-2147483648, toInt32(2147483648.75));
-assertEquals(-1, toInt32(4294967295.25));
-assertEquals(-1, toInt32(4294967295.5));
-assertEquals(-1, toInt32(4294967295.75));
-assertEquals(-1294967296, toInt32(3000000000.25));
-assertEquals(-1294967296, toInt32(3000000000.5));
-assertEquals(-1294967296, toInt32(3000000000.75));
-
-assertEquals(-2147483648, toInt32(-2147483648.25));
-assertEquals(-2147483648, toInt32(-2147483648.5));
-assertEquals(-2147483648, toInt32(-2147483648.75));
-assertEquals(1, toInt32(-4294967295.25));
-assertEquals(1, toInt32(-4294967295.5));
-assertEquals(1, toInt32(-4294967295.75));
-assertEquals(1294967296, toInt32(-3000000000.25));
-assertEquals(1294967296, toInt32(-3000000000.5));
-assertEquals(1294967296, toInt32(-3000000000.75));
-
-var base = Math.pow(2, 64);
-assertEquals(0, toInt32(base + 0));
-assertEquals(0, toInt32(base + 1117));
-assertEquals(4096, toInt32(base + 2234));
-assertEquals(4096, toInt32(base + 3351));
-assertEquals(4096, toInt32(base + 4468));
-assertEquals(4096, toInt32(base + 5585));
-assertEquals(8192, toInt32(base + 6702));
-assertEquals(8192, toInt32(base + 7819));
-assertEquals(8192, toInt32(base + 8936));
-assertEquals(8192, toInt32(base + 10053));
-assertEquals(12288, toInt32(base + 11170));
-assertEquals(12288, toInt32(base + 12287));
-assertEquals(12288, toInt32(base + 13404));
-assertEquals(16384, toInt32(base + 14521));
-assertEquals(16384, toInt32(base + 15638));
-assertEquals(16384, toInt32(base + 16755));
-assertEquals(16384, toInt32(base + 17872));
-assertEquals(20480, toInt32(base + 18989));
-assertEquals(20480, toInt32(base + 20106));
-assertEquals(20480, toInt32(base + 21223));
-assertEquals(20480, toInt32(base + 22340));
-assertEquals(24576, toInt32(base + 23457));
-assertEquals(24576, toInt32(base + 24574));
-assertEquals(24576, toInt32(base + 25691));
-assertEquals(28672, toInt32(base + 26808));
-assertEquals(28672, toInt32(base + 27925));
-assertEquals(28672, toInt32(base + 29042));
-assertEquals(28672, toInt32(base + 30159));
-assertEquals(32768, toInt32(base + 31276));
-
-// bignum is (2^53 - 1) * 2^31 - highest number with bit 31 set.
-var bignum = Math.pow(2, 84) - Math.pow(2, 31);
-assertEquals(-Math.pow(2,31), toInt32(bignum));
-assertEquals(-Math.pow(2,31), toInt32(-bignum));
-assertEquals(0, toInt32(2 * bignum));
-assertEquals(0, toInt32(-(2 * bignum)));
-assertEquals(0, toInt32(bignum - Math.pow(2,31)));
-assertEquals(0, toInt32(-(bignum - Math.pow(2,31))));
-
-// max_fraction is largest number below 1.
-var max_fraction = (1 - Math.pow(2,-53));
-assertEquals(0, toInt32(max_fraction));
-assertEquals(0, toInt32(-max_fraction));

data/ext/v8/upstream/2.0.6/test/mjsunit/tools/codemap.js

@@ -1,180 +0,0 @@
-// Copyright 2009 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.
-
-// Load Splay tree and CodeMap implementations from <project root>/tools.
-// Files: tools/splaytree.js tools/codemap.js
-
-
-function newCodeEntry(size, name) {
-  return new devtools.profiler.CodeMap.CodeEntry(size, name);
-};
-
-
-function assertEntry(codeMap, expected_name, addr) {
-  var entry = codeMap.findEntry(addr);
-  assertNotNull(entry, 'no entry at ' + addr.toString(16));
-  assertEquals(expected_name, entry.name, 'at ' + addr.toString(16));
-};
-
-
-function assertNoEntry(codeMap, addr) {
-  assertNull(codeMap.findEntry(addr), 'at ' + addr.toString(16));
-};
-
-
-(function testLibrariesAndStaticCode() {
-  var codeMap = new devtools.profiler.CodeMap();
-  codeMap.addLibrary(0x1500, newCodeEntry(0x3000, 'lib1'));
-  codeMap.addLibrary(0x15500, newCodeEntry(0x5000, 'lib2'));
-  codeMap.addLibrary(0x155500, newCodeEntry(0x10000, 'lib3'));
-  assertNoEntry(codeMap, 0);
-  assertNoEntry(codeMap, 0x1500 - 1);
-  assertEntry(codeMap, 'lib1', 0x1500);
-  assertEntry(codeMap, 'lib1', 0x1500 + 0x100);
-  assertEntry(codeMap, 'lib1', 0x1500 + 0x1000);
-  assertEntry(codeMap, 'lib1', 0x1500 + 0x3000 - 1);
-  assertNoEntry(codeMap, 0x1500 + 0x3000);
-  assertNoEntry(codeMap, 0x15500 - 1);
-  assertEntry(codeMap, 'lib2', 0x15500);
-  assertEntry(codeMap, 'lib2', 0x15500 + 0x100);
-  assertEntry(codeMap, 'lib2', 0x15500 + 0x1000);
-  assertEntry(codeMap, 'lib2', 0x15500 + 0x5000 - 1);
-  assertNoEntry(codeMap, 0x15500 + 0x5000);
-  assertNoEntry(codeMap, 0x155500 - 1);
-  assertEntry(codeMap, 'lib3', 0x155500);
-  assertEntry(codeMap, 'lib3', 0x155500 + 0x100);
-  assertEntry(codeMap, 'lib3', 0x155500 + 0x1000);
-  assertEntry(codeMap, 'lib3', 0x155500 + 0x10000 - 1);
-  assertNoEntry(codeMap, 0x155500 + 0x10000);
-  assertNoEntry(codeMap, 0xFFFFFFFF);
-
-  codeMap.addStaticCode(0x1510, newCodeEntry(0x30, 'lib1-f1'));
-  codeMap.addStaticCode(0x1600, newCodeEntry(0x50, 'lib1-f2'));
-  codeMap.addStaticCode(0x15520, newCodeEntry(0x100, 'lib2-f1'));
-  assertEntry(codeMap, 'lib1', 0x1500);
-  assertEntry(codeMap, 'lib1', 0x1510 - 1);
-  assertEntry(codeMap, 'lib1-f1', 0x1510);
-  assertEntry(codeMap, 'lib1-f1', 0x1510 + 0x15);
-  assertEntry(codeMap, 'lib1-f1', 0x1510 + 0x30 - 1);
-  assertEntry(codeMap, 'lib1', 0x1510 + 0x30);
-  assertEntry(codeMap, 'lib1', 0x1600 - 1);
-  assertEntry(codeMap, 'lib1-f2', 0x1600);
-  assertEntry(codeMap, 'lib1-f2', 0x1600 + 0x30);
-  assertEntry(codeMap, 'lib1-f2', 0x1600 + 0x50 - 1);
-  assertEntry(codeMap, 'lib1', 0x1600 + 0x50);
-  assertEntry(codeMap, 'lib2', 0x15500);
-  assertEntry(codeMap, 'lib2', 0x15520 - 1);
-  assertEntry(codeMap, 'lib2-f1', 0x15520);
-  assertEntry(codeMap, 'lib2-f1', 0x15520 + 0x80);
-  assertEntry(codeMap, 'lib2-f1', 0x15520 + 0x100 - 1);
-  assertEntry(codeMap, 'lib2', 0x15520 + 0x100);
-
-})();
-
-
-(function testDynamicCode() {
-  var codeMap = new devtools.profiler.CodeMap();
-  codeMap.addCode(0x1500, newCodeEntry(0x200, 'code1'));
-  codeMap.addCode(0x1700, newCodeEntry(0x100, 'code2'));
-  codeMap.addCode(0x1900, newCodeEntry(0x50, 'code3'));
-  codeMap.addCode(0x1950, newCodeEntry(0x10, 'code4'));
-  assertNoEntry(codeMap, 0);
-  assertNoEntry(codeMap, 0x1500 - 1);
-  assertEntry(codeMap, 'code1', 0x1500);
-  assertEntry(codeMap, 'code1', 0x1500 + 0x100);
-  assertEntry(codeMap, 'code1', 0x1500 + 0x200 - 1);
-  assertEntry(codeMap, 'code2', 0x1700);
-  assertEntry(codeMap, 'code2', 0x1700 + 0x50);
-  assertEntry(codeMap, 'code2', 0x1700 + 0x100 - 1);
-  assertNoEntry(codeMap, 0x1700 + 0x100);
-  assertNoEntry(codeMap, 0x1900 - 1);
-  assertEntry(codeMap, 'code3', 0x1900);
-  assertEntry(codeMap, 'code3', 0x1900 + 0x28);
-  assertEntry(codeMap, 'code4', 0x1950);
-  assertEntry(codeMap, 'code4', 0x1950 + 0x7);
-  assertEntry(codeMap, 'code4', 0x1950 + 0x10 - 1);
-  assertNoEntry(codeMap, 0x1950 + 0x10);
-  assertNoEntry(codeMap, 0xFFFFFFFF);
-})();
-
-
-(function testCodeMovesAndDeletions() {
-  var codeMap = new devtools.profiler.CodeMap();
-  codeMap.addCode(0x1500, newCodeEntry(0x200, 'code1'));
-  codeMap.addCode(0x1700, newCodeEntry(0x100, 'code2'));
-  assertEntry(codeMap, 'code1', 0x1500);
-  assertEntry(codeMap, 'code2', 0x1700);
-  codeMap.moveCode(0x1500, 0x1800);
-  assertNoEntry(codeMap, 0x1500);
-  assertEntry(codeMap, 'code2', 0x1700);
-  assertEntry(codeMap, 'code1', 0x1800);
-  codeMap.deleteCode(0x1700);
-  assertNoEntry(codeMap, 0x1700);
-  assertEntry(codeMap, 'code1', 0x1800);
-})();
-
-
-(function testDynamicNamesDuplicates() {
-  var codeMap = new devtools.profiler.CodeMap();
-  // Code entries with same names but different addresses.
-  codeMap.addCode(0x1500, newCodeEntry(0x200, 'code'));
-  codeMap.addCode(0x1700, newCodeEntry(0x100, 'code'));
-  assertEntry(codeMap, 'code', 0x1500);
-  assertEntry(codeMap, 'code {1}', 0x1700);
-  // Test name stability.
-  assertEntry(codeMap, 'code', 0x1500);
-  assertEntry(codeMap, 'code {1}', 0x1700);
-})();
-
-
-(function testStaticEntriesExport() {
-  var codeMap = new devtools.profiler.CodeMap();
-  codeMap.addStaticCode(0x1500, newCodeEntry(0x3000, 'lib1'));
-  codeMap.addStaticCode(0x15500, newCodeEntry(0x5000, 'lib2'));
-  codeMap.addStaticCode(0x155500, newCodeEntry(0x10000, 'lib3'));
-  var allStatics = codeMap.getAllStaticEntries();
-  allStatics.sort();
-  assertEquals(['lib1: 3000', 'lib2: 5000', 'lib3: 10000'], allStatics);
-})();
-
-
-(function testDynamicEntriesExport() {
-  var codeMap = new devtools.profiler.CodeMap();
-  codeMap.addCode(0x1500, newCodeEntry(0x200, 'code1'));
-  codeMap.addCode(0x1700, newCodeEntry(0x100, 'code2'));
-  codeMap.addCode(0x1900, newCodeEntry(0x50, 'code3'));
-  var allDynamics = codeMap.getAllDynamicEntries();
-  allDynamics.sort();
-  assertEquals(['code1: 200', 'code2: 100', 'code3: 50'], allDynamics);
-  codeMap.deleteCode(0x1700);
-  var allDynamics2 = codeMap.getAllDynamicEntries();
-  allDynamics2.sort();
-  assertEquals(['code1: 200', 'code3: 50'], allDynamics2);
-  codeMap.deleteCode(0x1500);
-  var allDynamics3 = codeMap.getAllDynamicEntries();
-  assertEquals(['code3: 50'], allDynamics3);
-})();

data/ext/v8/upstream/2.0.6/test/mjsunit/tools/consarray.js

@@ -1,60 +0,0 @@
-// Copyright 2009 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.
-
-// Load ConsArray implementation from <project root>/tools.
-// Files: tools/consarray.js
-
-
-var arr1 = new ConsArray();
-assertTrue(arr1.atEnd());
-
-arr1.concat([]);
-assertTrue(arr1.atEnd());
-
-arr1.concat([1]);
-assertFalse(arr1.atEnd());
-assertEquals(1, arr1.next());
-assertTrue(arr1.atEnd());
-
-arr1.concat([2, 3, 4]);
-arr1.concat([5]);
-arr1.concat([]);
-arr1.concat([6, 7]);
-
-assertFalse(arr1.atEnd());
-assertEquals(2, arr1.next());
-assertFalse(arr1.atEnd());
-assertEquals(3, arr1.next());
-assertFalse(arr1.atEnd());
-assertEquals(4, arr1.next());
-assertFalse(arr1.atEnd());
-assertEquals(5, arr1.next());
-assertFalse(arr1.atEnd());
-assertEquals(6, arr1.next());
-assertFalse(arr1.atEnd());
-assertEquals(7, arr1.next());
-assertTrue(arr1.atEnd());

data/ext/v8/upstream/2.0.6/test/mjsunit/tools/csvparser.js

@@ -1,79 +0,0 @@
-// Copyright 2009 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.
-
-// Load CSV parser implementation from <project root>/tools.
-// Files: tools/csvparser.js
-
-var parser = new devtools.profiler.CsvParser();
-
-assertEquals(
-    [],
-    parser.parseLine(''));
-
-assertEquals(
-    ['', ''],
-    parser.parseLine(','));
-
-assertEquals(
-    ['1997','Ford','E350'],
-    parser.parseLine('1997,Ford,E350'));
-
-assertEquals(
-    ['1997','Ford','E350'],
-    parser.parseLine('"1997","Ford","E350"'));
-
-assertEquals(
-    ['1997','Ford','E350','Super, luxurious truck'],
-    parser.parseLine('1997,Ford,E350,"Super, luxurious truck"'));
-
-assertEquals(
-    ['1997','Ford','E350','Super "luxurious" truck'],
-    parser.parseLine('1997,Ford,E350,"Super ""luxurious"" truck"'));
-
-assertEquals(
-    ['1997','Ford','E350','Super "luxurious" "truck"'],
-    parser.parseLine('1997,Ford,E350,"Super ""luxurious"" ""truck"""'));
-
-assertEquals(
-    ['1997','Ford','E350','Super "luxurious""truck"'],
-    parser.parseLine('1997,Ford,E350,"Super ""luxurious""""truck"""'));
-
-assertEquals(
-    ['shared-library','/lib/ld-2.3.6.so','0x489a2000','0x489b7000'],
-    parser.parseLine('shared-library,"/lib/ld-2.3.6.so",0x489a2000,0x489b7000'));
-
-assertEquals(
-    ['code-creation','LazyCompile','0xf6fe2d20','1201','APPLY_PREPARE native runtime.js:165'],
-    parser.parseLine('code-creation,LazyCompile,0xf6fe2d20,1201,"APPLY_PREPARE native runtime.js:165"'));
-
-assertEquals(
-    ['code-creation','LazyCompile','0xf6fe4bc0','282',' native v8natives.js:69'],
-    parser.parseLine('code-creation,LazyCompile,0xf6fe4bc0,282," native v8natives.js:69"'));
-
-assertEquals(
-    ['code-creation','RegExp','0xf6c21c00','826','NccyrJroXvg\\/([^,]*)'],
-    parser.parseLine('code-creation,RegExp,0xf6c21c00,826,"NccyrJroXvg\\/([^,]*)"'));