Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 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 // Test the counter module of d8. Work in progress. | |
| 29 | |
| 30 function round(number, digits) { | |
| 31 var multiplier = Math.pow(10, digits); | |
| 32 return Math.round(number*multiplier) / multiplier; | |
| 33 } | |
| 34 | |
| 35 print("compiled code size: " + counter.get("c:V8.TotalCompiledCodeSize")); | |
| 36 | |
| 37 // Test whether all counters have been initialized | |
| 38 assertEquals(173, counter.names().length); | |
| 39 | |
| 40 // Two input files were parsed and compiled | |
| 41 assertEquals(2, counter.get("V8.Parse")); | |
| 42 | |
| 43 // Test math stuff | |
| 44 // Integral of sin^2(x) from 0 to pi is pi/2 | |
| 45 var sum = 0; | |
| 46 var segments = 1000; | |
| 47 var delta = (Math.PI/segments); | |
| 48 for(var i = 0; i < segments; i++) { | |
| 49 var x = i/segments * Math.PI; | |
| 50 sum += Math.sin(x) * delta; | |
| 51 assertEquals(round(Math.tan(x), 7), round(Math.sin(x)/Math.cos(x), 7)); | |
| 52 } | |
| 53 | |
| 54 assertEquals(round(2, 5), round(sum, 5)); | |
| 55 | |
| 56 print("number of transcendental cache misses for Math.sin: " | |
| 57 + counter.get("c:V8.MathSin")); | |
| 58 print("number of transcendental cache misses for Math.cos: " | |
| 59 + counter.get("c:V8.MathCos")); | |
| 60 print("number of transcendental cache misses for Math.tan: " | |
| 61 + counter.get("c:V8.MathTan")); | |
| 62 | |
|
Yang
2011/06/29 12:02:20
surprisingly, c:V8.MathSin and c:V8.MathCos both r
| |
| 63 print("total transcendental cache misses: " | |
| 64 + counter.get("c:V8.TranscendentalCacheMiss")); | |
| 65 | |
| 66 print("compiled code size: " + counter.get("c:V8.TotalCompiledCodeSize")); | |
| OLD | NEW |