1 /* 2 * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 /** 25 * @test 26 * @bug 8199421 27 * @summary Test vectorization of popcount 28 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+UsePopCountInstruction 29 * compiler.vectorization.TestPopCountVector 30 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+UsePopCountInstruction 31 * -XX:MaxVectorSize=8 compiler.vectorization.TestPopCountVector 32 */ 33 34 package compiler.vectorization; 35 36 public class TestPopCountVector { 37 private int[] input; 38 private int[] output; 39 private static final int LEN = 1024; 40 41 public static void main(String args[]) { 42 TestPopCountVector test = new TestPopCountVector(); 43 44 for (int i = 0; i < 10_000; ++i) { 45 test.vectorizeBitCount(); 46 } 47 System.out.println("Checking popcount result"); 48 test.checkResult(); 49 50 for (int i = 0; i < 10_000; ++i) { 51 test.vectorizeBitCount(); 52 } 53 System.out.println("Checking popcount result"); 54 test.checkResult(); 55 } 56 57 public TestPopCountVector() { 58 input = new int[LEN]; 59 output = new int[LEN]; 60 for (int i = 0; i < LEN; ++i) { 61 input[i] = i % 2 == 0 ? i : -1 * i; 62 } 63 } 64 65 public void vectorizeBitCount() { 66 for (int i = 0; i < LEN; ++i) { 67 output[i] = Integer.bitCount(input[i]); 68 } 69 } 70 71 public void checkResult() { 72 for (int i = 0; i < LEN; ++i) { 73 int expected = Integer.bitCount(input[i]); 74 if (output[i] != expected) { 75 throw new RuntimeException("Invalid result: output[" + i + "] = " + output[i] + " != " + expected); 76 } 77 } 78 } 79 } 80