/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* 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.
*/
/*
* @test
* @bug 8005419
* @summary Improve intrinsics code performance on x86 by using AVX2
*
*/
public class Test8005419 {
char[] a = new char[SIZE];
char[] b = new char[SIZE];
for (int i = 16; i < SIZE; i++) {
a[i] = (char)i;
b[i] = (char)i;
}
// Warm up
boolean failed = false;
int result = 0;
for (int i = 0; i < 10000; i++) {
}
for (int i = 0; i < 10000; i++) {
}
for (int i = 0; i < 10000; i++) {
}
// Compare same string
if (result != 0) {
failed = true;
}
// Compare equal strings
for (int i = 1; i <= SIZE; i++) {
if (result != 0) {
failed = true;
System.out.println("Failed equals s1[" + i + "], s2[" + i + "]: result = " + result + ", expected 0");
}
}
// Compare equal strings but different sizes
for (int i = 1; i <= SIZE; i++) {
for (int j = 1; j <= SIZE; j++) {
if (result != (i-j)) {
failed = true;
System.out.println("Failed diff size s1[" + i + "], s2[" + j + "]: result = " + result + ", expected " + (i-j));
}
}
}
// Compare strings with one char different and different sizes
for (int i = 1; i <= SIZE; i++) {
for (int j = 0; j < i; j++) {
b[j] -= 3; // change char
int chdiff = a[j] - b[j];
failed = true;
System.out.println("Failed diff char s1[" + i + "], s2[" + i + "]: result = " + result + ", expected " + chdiff);
}
chdiff = b[j] - a[j];
failed = true;
System.out.println("Failed diff char s2[" + i + "], s1[" + i + "]: result = " + result + ", expected " + chdiff);
}
b[j] += 3; // restore
}
}
if (failed) {
}
}
}
}