Mercurial > jdk8-mips64-public > nashorn / annotate
test/opt/add.js@3bcb6d195fc8 (annotated)
test/opt/add.js
Mon, 06 Aug 2018 13:27:17 +0800
- author
- aoqi
- date
- Mon, 06 Aug 2018 13:27:17 +0800
- changeset 2295
- 3bcb6d195fc8
- parent 1205
- 4112748288bb
- permissions
- -rw-r--r--
Added tag mips64el-jdk8u181-b14 for changeset 09bee99d5503
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| attila@962 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| attila@962 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| attila@962 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| attila@962 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | */ |
| aoqi@0 | 23 | |
| aoqi@0 | 24 | /** |
| aoqi@0 | 25 | * Example of an add function that gets specialized to doubles |
| attila@962 | 26 | * if run with --optimize flag set |
| aoqi@0 | 27 | */ |
| aoqi@0 | 28 | |
| aoqi@0 | 29 | function add(a,b) { |
| aoqi@0 | 30 | return a + b; |
| aoqi@0 | 31 | } |
| aoqi@0 | 32 | |
| aoqi@0 | 33 | |
| aoqi@0 | 34 | function bench() { |
| aoqi@0 | 35 | var sum = 1; |
| aoqi@0 | 36 | for (var x = 0 ; x < 10e8/2 ; x ++) { |
| attila@962 | 37 | sum *= add(x,x + 1); |
| aoqi@0 | 38 | } |
| aoqi@0 | 39 | return sum; |
| aoqi@0 | 40 | } |
| aoqi@0 | 41 | |
| aoqi@0 | 42 | print("doing first run"); |
| aoqi@0 | 43 | var d = new Date; |
| aoqi@0 | 44 | print(bench()); |
| aoqi@0 | 45 | d = new Date - d; |
| aoqi@0 | 46 | print("first run took " + d + " ms"); |
| aoqi@0 | 47 | |
| aoqi@0 | 48 | // invalidate add, replace it with something else |
| aoqi@0 | 49 | add = function(a,b) { |
| aoqi@0 | 50 | return b + a; |
| aoqi@0 | 51 | } |
| aoqi@0 | 52 | |
| aoqi@0 | 53 | print("doing second run"); |
| aoqi@0 | 54 | var d = new Date; |
| aoqi@0 | 55 | print(bench()); |
| aoqi@0 | 56 | d = new Date - d; |
| aoqi@0 | 57 | print("second run took " + d + " ms"); |
| aoqi@0 | 58 |
