1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
/*
* Copyright (C) 2016 Linaro Limited. All rights received.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
package org.linaro.benchmarks;
import org.openjdk.jmh.annotations.*;
import java.util.concurrent.TimeUnit;
@BenchmarkMode(Mode.AverageTime)
@OutputTimeUnit(TimeUnit.MICROSECONDS)
@State(Scope.Benchmark)
public class TestSIMDLd2St2 {
static final int VECT_LENGTH = 256 * 1024;
static final int DIM = 2;
static final int LENGTH = VECT_LENGTH * DIM;
static int [] in = new int[LENGTH];
static int [] out = new int[LENGTH];
static int [] c = new int[DIM];
static short [] sin = new short[LENGTH];
static short [] sout = new short[LENGTH];
static short [] sc = new short[DIM];
public static void vect2DInit() {
int i;
for (i = 0; i < LENGTH; i++) {
in[i] = i + 3;
sin[i] = (short)(i + 3);
}
for (i = 0; i < DIM; i++) {
c[i] = i + 1;
sc[i] = (short)(i + 1);
}
}
public static void vect2DAddInt(
int[] out,
int[] in,
int[] c) {
int c0 = c[0];
int c1 = c[1];
for (int i = 0; i < VECT_LENGTH; i++) {
out[i*DIM] = in[i*DIM] + c0;
out[i*DIM + 1] = in[i*DIM + 1] + c1;
}
}
public static void vect2DMulInt(
int[] out,
int[] in,
int[] c) {
int c0 = c[0];
int c1 = c[1];
for (int i = 0; i < VECT_LENGTH; i++) {
out[i*DIM] = in[i*DIM] * c0;
out[i*DIM + 1] = in[i*DIM + 1] * c1;
}
}
public static void vect2DAddShort(
short[] out,
short[] in,
short[] c) {
short c0 = c[0];
short c1 = c[1];
for (int i = 0; i < VECT_LENGTH; i++) {
out[i*DIM] = (short)(in[i*DIM] + c0);
out[i*DIM + 1] = (short)(in[i*DIM + 1] + c1);
}
}
public static void vect2DMulShort(
short[] out,
short[] in,
short[] c) {
short c0 = c[0];
short c1 = c[1];
for (int i = 0; i < VECT_LENGTH; i++) {
out[i*DIM] = (short)(in[i*DIM] * c0);
out[i*DIM + 1] = (short)(in[i*DIM + 1] * c1);
}
}
@Setup
public void setup()
{
vect2DInit();
}
@Benchmark
public void testVect2D() {
vect2DAddInt(out, in, c);
vect2DMulInt(out, in, c);
vect2DAddShort(sout, sin, sc);
vect2DMulShort(sout, sin, sc);
}
}
|