8198949: Modularize arraycopy stub routine GC barriers
Reviewed-by: rkennke, pliden
/*
* Copyright (c) 2010, 2014, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/**
* Simple benchmark to measure charCodeAt specialized method performance
*/
var str = "sghjkdsfkjghsdfjkfkjdfkjdfjkdfjkfdjkfdkfldjfhdfpkjdhafgksdjfgldfgjldfkjgdlfjgldkfjgkldfj";
var RESULT1 = 9187;
var RESULT2 = 1496;
function f() {
var len = str.length;
var c = 0;
for (var i = 0; i < len; i++) {
c += str.charCodeAt(i);
}
return c;
}
function bench(res) {
var d = new Date;
var sum = 0;
for (var i = 0; i < 1e6; i++) {
sum |= f();
}
if (sum == res) {
print("Verified OK");
} else {
print("Verification failed " + sum + " should be " + res);
}
print((new Date - d) + " ms");
}
bench(RESULT1);
print("Replacing charCodeAt... ");
String.prototype.charCodeAt = function() { return 17; }
bench(RESULT2);
print("Done");