-
Notifications
You must be signed in to change notification settings - Fork 25
Expand file tree
/
Copy pathCompute.java
More file actions
189 lines (182 loc) · 5.48 KB
/
Copy pathCompute.java
File metadata and controls
189 lines (182 loc) · 5.48 KB
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
package javaforce.cl;
import javaforce.*;
/** Compute kernels (computations).
*
* @author peter.quiring
*/
public class Compute {
private CL cl;
private long ctx;
private long k_array_square;
private long k_array_mult;
private long k_matrix_mult;
public boolean init(int type) {
uninit();
cl = CL.getInstance();
if (cl == null) return false;
ctx = cl.create(
"kernel void array_square(global float* input, global float* output)" +
" {" +
" int i = get_global_id(0);" +
" output[i] = input[i] * input[i];" +
" };\n" +
"kernel void array_mult(global float* input0, global float* input1, global float* output)" +
" {" +
" int i = get_global_id(0);" +
" output[i] = input0[i] * input1[i];" +
" };\n" +
"kernel void matrix_mult(const int M, const int N, const int K, global float* A, global float* B, global float* C)" +
" {" +
" const int globalRow = get_global_id(0);" + // row id of C (0..M)
" const int globalCol = get_global_id(1);" + // col id of C (0..N)
" float acc = 0.0f;" +
" for (int k=0;k<K;k++) {" +
" acc += A[k*M + globalRow] * B[globalCol*K + k];" +
" }" +
" C[globalCol*M + globalRow] = acc;" + //store result
" }\n"
, type);
k_array_square = cl.kernel(ctx, "array_square");
k_array_mult = cl.kernel(ctx, "array_mult");
k_matrix_mult = cl.kernel(ctx, "matrix_mult");
return true;
}
public void uninit() {
if (cl != null) {
cl.freeKernel(ctx, k_array_square);
cl.freeKernel(ctx, k_array_mult);
cl.freeKernel(ctx, k_matrix_mult);
cl.close(ctx);
cl = null;
}
}
/** array square each element.
*
* b[i] = a[i] * a[i];
*
* @param a = input array
* @param b = output array
*
* All arrays must be same size.
*/
public boolean array_square(float[] a, float[] b) {
if (a == null) {
JFLog.log("Compute:array_square:a invalid");
return false;
}
int size = a.length;
if (b == null || b.length != size) {
JFLog.log("Compute:array_square:b invalid");
return false;
}
long input0 = cl.createWriteBuffer(ctx, Float.BYTES * size);
long output = cl.createReadBuffer(ctx, Float.BYTES * size);
boolean ret;
cl.writeBuffer(ctx, input0, a);
cl.setArg(ctx, k_array_square, 0, input0);
cl.setArg(ctx, k_array_square, 1, output);
ret = cl.execute(ctx, k_array_square, size);
cl.readBuffer(ctx, output, b);
cl.freeBuffer(ctx, input0);
cl.freeBuffer(ctx, output);
return ret;
}
/** array multiple.
*
* c[i] = a[i] * b[i];
*
* @param a = input array
* @param b = input array
* @param c = output array
*
* All arrays must be same size.
*
*/
public boolean array_mult(float[] a, float[] b, float[] c) {
if (a == null) {
JFLog.log("Compute:array_mult:a invalid");
return false;
}
int size = a.length;
if (b == null || b.length != size) {
JFLog.log("Compute:array_mult:b invalid");
return false;
}
if (c == null || c.length != size) {
JFLog.log("Compute:array_mult:c invalid");
return false;
}
long input0 = cl.createWriteBuffer(ctx, Float.BYTES * size);
long input1 = cl.createWriteBuffer(ctx, Float.BYTES * size);
long output = cl.createReadBuffer(ctx, Float.BYTES * size);
boolean ret;
cl.writeBuffer(ctx, input0, a);
cl.writeBuffer(ctx, input1, b);
cl.setArg(ctx, k_array_mult, 0, input0);
cl.setArg(ctx, k_array_mult, 1, input1);
cl.setArg(ctx, k_array_mult, 2, output);
ret = cl.execute(ctx, k_array_mult, size);
cl.readBuffer(ctx, output, c);
cl.freeBuffer(ctx, input0);
cl.freeBuffer(ctx, input1);
cl.freeBuffer(ctx, output);
return ret;
}
/** matrix multiple.
*
* c = ab
*
* https://cnugteren.github.io/tutorial/pages/page1.html
*
* N
* ...
* K .B.
* ...
* K
* ... ...
* M .A. .C.
* ... ...
*
* @param as = a size (M)
* @param bs = b size (N)
* @param ks = common size (K)
* @param a = input array
* @param b = input array
* @param c = output array
*/
public boolean matrix_mult(int as, int bs, int ks, float[] a, float[] b, float[] c) {
int a_size = as * ks;
if (a == null || a.length != a_size) {
JFLog.log("Compute:matrix_mult:a invalid");
return false;
}
int b_size = bs * ks;
if (b == null || b.length != b_size) {
JFLog.log("Compute:matrix_mult:b invalid");
return false;
}
int c_size = as * bs;
if (c == null || c.length != c_size) {
JFLog.log("Compute:matrix_mult:c invalid");
return false;
}
long input0 = cl.createWriteBuffer(ctx, Float.BYTES * a_size);
long input1 = cl.createWriteBuffer(ctx, Float.BYTES * b_size);
long output = cl.createReadBuffer(ctx, Float.BYTES * c_size);
boolean ret;
cl.writeBuffer(ctx, input0, a);
cl.writeBuffer(ctx, input1, b);
cl.setArg(ctx, k_matrix_mult, 0, as); //M
cl.setArg(ctx, k_matrix_mult, 1, bs); //N
cl.setArg(ctx, k_matrix_mult, 2, ks); //K
cl.setArg(ctx, k_matrix_mult, 3, input0); //A
cl.setArg(ctx, k_matrix_mult, 4, input1); //B
cl.setArg(ctx, k_matrix_mult, 5, output); //C
ret = cl.execute2(ctx, k_matrix_mult, as, bs);
cl.readBuffer(ctx, output, c);
cl.freeBuffer(ctx, input0);
cl.freeBuffer(ctx, input1);
cl.freeBuffer(ctx, output);
return ret;
}
}