-
Notifications
You must be signed in to change notification settings - Fork 1.9k
/
CalculateAverage_plevart.java
402 lines (364 loc) · 15.6 KB
/
CalculateAverage_plevart.java
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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
/*
* Copyright 2023 The original authors
*
* 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 dev.morling.onebrc;
import jdk.incubator.vector.ByteVector;
import jdk.incubator.vector.VectorOperators;
import java.io.IOException;
import java.lang.foreign.Arena;
import java.lang.foreign.MemorySegment;
import java.lang.foreign.ValueLayout;
import java.nio.ByteOrder;
import java.nio.channels.FileChannel;
import java.nio.charset.StandardCharsets;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.StandardOpenOption;
import java.util.Comparator;
import java.util.Objects;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stream;
public class CalculateAverage_plevart {
private static final Path FILE = Path.of("measurements.txt");
private static final int MAX_CITY_LEN = 100;
// 100 (city name) + 1 (;) + 5 (-99.9) + 1 (NL)
private static final int MAX_LINE_LEN = MAX_CITY_LEN + 7;
private static final int INITIAL_TABLE_CAPACITY = 8192;
public static void main(String[] args) throws IOException {
System.setProperty("jdk.incubator.vector.VECTOR_ACCESS_OOB_CHECK", "0");
try (
var channel = (FileChannel) Files.newByteChannel(FILE, StandardOpenOption.READ);
var arena = Arena.ofShared()) {
var segment = channel.map(FileChannel.MapMode.READ_ONLY, 0, Files.size(FILE), arena);
int regions = Runtime.getRuntime().availableProcessors();
IntStream
.range(0, regions)
.parallel()
.mapToObj(r -> calculateRegion(segment, regions, r))
.reduce(StatsTable::reduce)
.ifPresent(System.out::println);
}
}
private static StatsTable calculateRegion(MemorySegment segment, int regions, int r) {
long start = (segment.byteSize() * r) / regions;
long end = (segment.byteSize() * (r + 1)) / regions;
if (r > 0) {
start = skipPastNl(segment, start);
}
if (r + 1 < regions) {
end = skipPastNl(segment, end);
}
return calculateAdjustedRegion(segment, start, end);
}
private static long skipPastNl(MemorySegment segment, long i) {
int skipped = 0;
while (skipped++ < MAX_LINE_LEN && segment.get(ValueLayout.JAVA_BYTE, i++) != '\n') {
}
if (skipped > MAX_LINE_LEN) {
throw new IllegalArgumentException(
"Encountered line that exceeds " + MAX_LINE_LEN + " bytes at offset: " + i);
}
return i;
}
private static StatsTable calculateAdjustedRegion(MemorySegment segment, long start, long end) {
var stats = new StatsTable(segment, INITIAL_TABLE_CAPACITY);
var species = ByteVector.SPECIES_PREFERRED;
long cityStart = start, numberStart = 0;
int cityLen = 0;
for (long i = start, j = i; i < end; j = i) {
long semiNlSet;
if (end - i >= species.vectorByteSize()) {
var vec = ByteVector.fromMemorySegment(species, segment, i, ByteOrder.nativeOrder());
semiNlSet = vec.compare(VectorOperators.EQ, (byte) ';')
.or(vec.compare(VectorOperators.EQ, (byte) '\n'))
.toLong();
i += species.vectorByteSize();
}
else { // tail, smaller than speciesByteSize
semiNlSet = 0;
long mask = 1;
while (i < end && mask != 0) {
int c = segment.get(ValueLayout.JAVA_BYTE, i++);
if (c == '\n' || c == ';') {
semiNlSet |= mask;
}
mask <<= 1;
}
}
for (int step = Long.numberOfTrailingZeros(semiNlSet); step < 64; semiNlSet >>>= (step + 1), step = Long.numberOfTrailingZeros(semiNlSet)) {
j += step;
if (numberStart == 0) { // semi
cityLen = (int) (j - cityStart);
numberStart = ++j;
}
else { // nl
int numberLen = (int) (j - numberStart);
stats.calculateEntry(cityStart, cityLen, numberStart, numberLen);
cityStart = ++j;
numberStart = 0;
}
}
}
return stats;
}
final static class StatsTable {
private static final int LOAD_FACTOR = 16;
// offsets of fields
private static final int _lenHash = 0,
_off = 1,
_count = 2,
_sum = 3,
_min = 4,
_max = 5;
private final MemorySegment segment;
private int pow2cap, loadedSize;
private long[] table;
StatsTable(MemorySegment segment, int capacity) {
this.segment = Objects.requireNonNull(segment);
int pow2cap = Integer.highestOneBit(capacity);
if (pow2cap < capacity) {
pow2cap <<= 1;
}
this.pow2cap = pow2cap;
this.table = new long[idx(pow2cap)];
}
private StatsTable(StatsTable st) {
this.segment = st.segment;
this.pow2cap = st.pow2cap;
this.loadedSize = st.loadedSize;
this.table = st.table;
}
private static int idx(int i) {
return i << 3;
}
private static long lenHash(int len, int hash) {
return ((long) len << 32) | ((long) hash & 0x00000000FFFFFFFFL);
}
private static int len(long lenHash) {
return (int) (lenHash >>> 32);
}
private static int hash(long lenHash) {
return (int) (lenHash & 0x00000000FFFFFFFFL);
}
private static final long[] LEN_LONG_MASK;
private static final int[] LEN_INT_MASK;
static {
LEN_LONG_MASK = new long[Long.BYTES + 1];
for (int len = 0; len <= Long.BYTES; len++) {
LEN_LONG_MASK[len] = len == 0
? 0L
: ValueLayout.JAVA_LONG_UNALIGNED.order() == ByteOrder.LITTLE_ENDIAN
? -1L >>> ((Long.BYTES - len) * Byte.SIZE)
: -1L << ((Long.BYTES - len) * Byte.SIZE);
}
LEN_INT_MASK = new int[Integer.BYTES + 1];
for (int len = 0; len <= Integer.BYTES; len++) {
LEN_INT_MASK[len] = len == 0
? 0
: ValueLayout.JAVA_LONG_UNALIGNED.order() == ByteOrder.LITTLE_ENDIAN
? -1 >>> ((Integer.BYTES - len) * Byte.SIZE)
: -1 << ((Integer.BYTES - len) * Byte.SIZE);
}
}
void calculateEntry(long cityStart, int cityLen, long numberStart, int numberLen) {
int hash = hash(cityStart, cityLen);
int number = parseNumber(numberStart, numberLen);
aggregate(cityStart, cityLen, hash, 1, number, number, number);
}
int parseNumber(long off, int len) {
int c0 = segment.get(ValueLayout.JAVA_BYTE, off);
int d0;
int sign;
if (c0 == '-') {
off++;
len--;
d0 = segment.get(ValueLayout.JAVA_BYTE, off) - '0';
sign = -1;
} else {
d0 = c0 - '0';
sign = 1;
}
return sign * switch (len) {
case 1 -> d0 * 10; // 9
case 2 -> {
int d1 = segment.get(ValueLayout.JAVA_BYTE, off + 1) - '0';
yield d0 * 100 + d1 * 10; // 99
}
case 3 -> {
int d2 = segment.get(ValueLayout.JAVA_BYTE, off + 2) - '0';
yield d0 * 10 + d2; // 9.9
}
case 4 -> {
int d1 = segment.get(ValueLayout.JAVA_BYTE, off + 1) - '0';
int d3 = segment.get(ValueLayout.JAVA_BYTE, off + 3) - '0';
yield d0 * 100 + d1 * 10 + d3; // 99.9
}
default ->
throw new IllegalArgumentException(
"Invalid number: " +
new String(segment.asSlice(off, len).toArray(ValueLayout.JAVA_BYTE), StandardCharsets.UTF_8)
);
};
}
int hash(long off, int len) {
if (len > Integer.BYTES) {
int head = segment.get(ValueLayout.JAVA_INT_UNALIGNED, off);
int tail = segment.get(ValueLayout.JAVA_INT_UNALIGNED, off + len - Integer.BYTES);
return (head * 31) ^ tail;
}
else {
// assert len >= 0 && len <= 4;
// each city name starts at least 4 bytes before segment end
// assert off + Integer.BYTES <= segment.byteSize();
return segment.get(ValueLayout.JAVA_INT_UNALIGNED, off) & LEN_INT_MASK[len];
}
}
private static boolean bothLessThan(long a, long b, long threshold) {
return (a < threshold) && (b < threshold);
}
boolean equals(long off1, long off2, int len) {
while (len >= Long.BYTES) {
if (segment.get(ValueLayout.JAVA_LONG_UNALIGNED, off1) != segment.get(ValueLayout.JAVA_LONG_UNALIGNED, off2)) {
return false;
}
off1 += Long.BYTES;
off2 += Long.BYTES;
len -= Long.BYTES;
}
// still enough memory to compare two longs, but masked?
if (bothLessThan(off1, off2, segment.byteSize() - Long.BYTES + 1)) {
long mask = LEN_LONG_MASK[len];
return (segment.get(ValueLayout.JAVA_LONG_UNALIGNED, off1) & mask) == (segment.get(ValueLayout.JAVA_LONG_UNALIGNED, off2) & mask);
}
else {
return equalsAtBorder(off1, off2, len);
}
}
private boolean equalsAtBorder(long off1, long off2, int len) {
if (len > Integer.BYTES) {
if (segment.get(ValueLayout.JAVA_INT_UNALIGNED, off1) != segment.get(ValueLayout.JAVA_INT_UNALIGNED, off2)) {
return false;
}
len -= Integer.BYTES;
off1 += Integer.BYTES;
off2 += Integer.BYTES;
}
// assert len >= 0 && len <= 4;
// each city name starts at least 4 bytes before segment end
// assert Math.max(off1, off2) + Integer.BYTES <= segment.byteSize();
int mask = LEN_INT_MASK[len];
return (segment.get(ValueLayout.JAVA_INT_UNALIGNED, off1) & mask) == (segment.get(ValueLayout.JAVA_INT_UNALIGNED, off2) & mask);
}
void aggregate(
// key
long off, int len, int hash,
// value
long count, long sum, int min, int max) {
long lenHash = lenHash(len, hash);
int mask = pow2cap - 1;
for (int i = hash & mask, probe = 0; probe < pow2cap; i = (i + 1) & mask, probe++) {
int idx = idx(i);
long lenHash_i = table[idx + _lenHash];
if (lenHash_i == 0) {
table[idx + _lenHash] = lenHash;
table[idx + _off] = off;
table[idx + _count] = count;
table[idx + _sum] = sum;
table[idx + _min] = min;
table[idx + _max] = max;
loadedSize += LOAD_FACTOR;
if (loadedSize >= pow2cap) {
grow();
}
return;
}
if (lenHash_i == lenHash && equals(off, table[idx + _off], len)) {
table[idx + _count] += count;
table[idx + _sum] += sum;
table[idx + _min] = Math.min(min, (int) table[idx + _min]);
table[idx + _max] = Math.max(max, (int) table[idx + _max]);
return;
}
}
throw new OutOfMemoryError("StatsTable capacity exceeded due to poor hash");
}
private void grow() {
if (idx(pow2cap) >= 0x4000_0000) {
throw new OutOfMemoryError("StatsTable capacity exceeded");
}
else {
var oldStats = new StatsTable(this);
pow2cap <<= 1;
table = new long[idx(pow2cap)];
loadedSize = 0;
reduce(oldStats);
}
}
StatsTable reduce(StatsTable other) {
other
.idxStream()
.forEach(
idx -> aggregate(
other.table[idx + _off],
len(other.table[idx + _lenHash]),
hash(other.table[idx + _lenHash]),
other.table[idx + _count],
other.table[idx + _sum],
(int) other.table[idx + _min],
(int) other.table[idx + _max]));
return this;
}
IntStream idxStream() {
return IntStream
.range(0, pow2cap)
.map(StatsTable::idx)
.filter(idx -> table[idx + _lenHash] != 0);
}
Stream<Entry> stream() {
return idxStream()
.mapToObj(
idx -> new Entry(
new String(
segment
.asSlice(table[idx + _off], len(table[idx + _lenHash]))
.toArray(ValueLayout.JAVA_BYTE),
StandardCharsets.UTF_8),
table[idx + _count],
table[idx + _sum],
table[idx + _min],
table[idx + _max]));
}
@Override
public String toString() {
return stream()
.sorted(Comparator.comparing(StatsTable.Entry::city))
.map(Entry::toString)
.collect(Collectors.joining(", ", "{", "}"));
}
record Entry(String city, long count, long sum, long min, long max) {
double average() {
return count > 0L ? (double) sum / (double) count : 0d;
}
@Override
public String toString() {
return String.format(
"%s=%.1f/%.1f/%.1f",
city(), (double) min() / 10d, average() / 10d, (double) max() / 10d
);
}
}
}
}