af66ac145f
* Optimize checking for collisions by doing this a long at a time always. * Use a long at a time scanning for delimiter. * Minor tuning. Now below 0.80s on Intel i9-13900K. * Add number parsing code from Quan Anh Mai. Fix name length issue. * Include suggestion from Alfonso Peterssen for another 1.5%. * Optimize hash collision check compare for ~4% gain. * Add perf stats based on latest version.
268 lines
10 KiB
Java
268 lines
10 KiB
Java
/*
|
|
* 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 sun.misc.Unsafe;
|
|
|
|
import java.io.IOException;
|
|
import java.lang.foreign.Arena;
|
|
import java.lang.reflect.Field;
|
|
import java.nio.channels.FileChannel;
|
|
import java.nio.channels.FileChannel.MapMode;
|
|
import java.nio.charset.StandardCharsets;
|
|
import java.nio.file.Path;
|
|
import java.nio.file.StandardOpenOption;
|
|
import java.util.*;
|
|
import java.util.stream.IntStream;
|
|
|
|
/**
|
|
* Simple solution that memory maps the input file, then splits it into one segment per available core and uses
|
|
* sun.misc.Unsafe to directly access the mapped memory. Uses a long at a time when checking for collision.
|
|
* <p>
|
|
* Runs in 0.70s on my Intel i9-13900K
|
|
* Perf stats:
|
|
* 40,622,862,783 cpu_core/cycles/
|
|
* 48,241,929,925 cpu_atom/cycles/
|
|
*/
|
|
public class CalculateAverage_thomaswue {
|
|
private static final String FILE = "./measurements.txt";
|
|
|
|
// Holding the current result for a single city.
|
|
private static class Result {
|
|
final long nameAddress;
|
|
long lastNameLong;
|
|
int remainingShift;
|
|
int min;
|
|
int max;
|
|
long sum;
|
|
int count;
|
|
|
|
private Result(long nameAddress, int value) {
|
|
this.nameAddress = nameAddress;
|
|
this.min = value;
|
|
this.max = value;
|
|
this.sum = value;
|
|
this.count = 1;
|
|
}
|
|
|
|
public String toString() {
|
|
return round(((double) min) / 10.0) + "/" + round((((double) sum) / 10.0) / count) + "/" + round(((double) max) / 10.0);
|
|
}
|
|
|
|
private static double round(double value) {
|
|
return Math.round(value * 10.0) / 10.0;
|
|
}
|
|
|
|
// Accumulate another result into this one.
|
|
private void add(Result other) {
|
|
min = Math.min(min, other.min);
|
|
max = Math.max(max, other.max);
|
|
sum += other.sum;
|
|
count += other.count;
|
|
}
|
|
}
|
|
|
|
public static void main(String[] args) throws IOException {
|
|
// Calculate input segments.
|
|
int numberOfChunks = Runtime.getRuntime().availableProcessors();
|
|
long[] chunks = getSegments(numberOfChunks);
|
|
|
|
// Parallel processing of segments.
|
|
List<HashMap<String, Result>> allResults = IntStream.range(0, chunks.length - 1).mapToObj(chunkIndex -> {
|
|
HashMap<String, Result> cities = HashMap.newHashMap(1 << 10);
|
|
parseLoop(chunks[chunkIndex], chunks[chunkIndex + 1], cities);
|
|
return cities;
|
|
}).parallel().toList();
|
|
|
|
// Accumulate results sequentially.
|
|
HashMap<String, Result> result = allResults.getFirst();
|
|
for (int i = 1; i < allResults.size(); ++i) {
|
|
for (Map.Entry<String, Result> entry : allResults.get(i).entrySet()) {
|
|
Result current = result.putIfAbsent(entry.getKey(), entry.getValue());
|
|
if (current != null) {
|
|
current.add(entry.getValue());
|
|
}
|
|
}
|
|
}
|
|
|
|
// Final output.
|
|
System.out.println(new TreeMap<>(result));
|
|
}
|
|
|
|
private static final Unsafe UNSAFE = initUnsafe();
|
|
|
|
private static Unsafe initUnsafe() {
|
|
try {
|
|
Field theUnsafe = Unsafe.class.getDeclaredField("theUnsafe");
|
|
theUnsafe.setAccessible(true);
|
|
return (Unsafe) theUnsafe.get(Unsafe.class);
|
|
}
|
|
catch (NoSuchFieldException | IllegalAccessException e) {
|
|
throw new RuntimeException(e);
|
|
}
|
|
}
|
|
|
|
private static void parseLoop(long chunkStart, long chunkEnd, HashMap<String, Result> cities) {
|
|
Result[] results = new Result[1 << 18];
|
|
long scanPtr = chunkStart;
|
|
while (scanPtr < chunkEnd) {
|
|
long nameAddress = scanPtr;
|
|
long hash = 0;
|
|
|
|
// Search for ';', one long at a time.
|
|
long word = UNSAFE.getLong(scanPtr);
|
|
int pos = findDelimiter(word);
|
|
if (pos != 8) {
|
|
scanPtr += pos;
|
|
word = word & (-1L >>> ((8 - pos - 1) << 3));
|
|
hash ^= word;
|
|
}
|
|
else {
|
|
scanPtr += 8;
|
|
hash ^= word;
|
|
while (true) {
|
|
word = UNSAFE.getLong(scanPtr);
|
|
pos = findDelimiter(word);
|
|
if (pos != 8) {
|
|
scanPtr += pos;
|
|
word = word & (-1L >>> ((8 - pos - 1) << 3));
|
|
hash ^= word;
|
|
break;
|
|
}
|
|
else {
|
|
scanPtr += 8;
|
|
hash ^= word;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Save length of name for later.
|
|
int nameLength = (int) (scanPtr - nameAddress);
|
|
scanPtr++;
|
|
|
|
long numberWord = UNSAFE.getLong(scanPtr);
|
|
// The 4th binary digit of the ascii of a digit is 1 while
|
|
// that of the '.' is 0. This finds the decimal separator
|
|
// The value can be 12, 20, 28
|
|
int decimalSepPos = Long.numberOfTrailingZeros(~numberWord & 0x10101000);
|
|
int number = convertIntoNumber(decimalSepPos, numberWord);
|
|
|
|
// Skip past new line.
|
|
// scanPtr++;
|
|
scanPtr += (decimalSepPos >>> 3) + 3;
|
|
|
|
// Final calculation for index into hash table.
|
|
int hashAsInt = (int) (hash ^ (hash >>> 32));
|
|
int finalHash = (hashAsInt ^ (hashAsInt >>> 18));
|
|
int tableIndex = (finalHash & (results.length - 1));
|
|
outer: while (true) {
|
|
Result existingResult = results[tableIndex];
|
|
if (existingResult == null) {
|
|
newEntry(results, cities, nameAddress, number, tableIndex, nameLength);
|
|
break;
|
|
}
|
|
else {
|
|
// Check for collision.
|
|
int i = 0;
|
|
for (; i < nameLength + 1 - 8; i += 8) {
|
|
if (UNSAFE.getLong(existingResult.nameAddress + i) != UNSAFE.getLong(nameAddress + i)) {
|
|
tableIndex = (tableIndex + 1) & (results.length - 1);
|
|
continue outer;
|
|
}
|
|
}
|
|
if (((existingResult.lastNameLong ^ UNSAFE.getLong(nameAddress + i)) << existingResult.remainingShift) == 0) {
|
|
existingResult.min = Math.min(existingResult.min, number);
|
|
existingResult.max = Math.max(existingResult.max, number);
|
|
existingResult.sum += number;
|
|
existingResult.count++;
|
|
break;
|
|
}
|
|
else {
|
|
// Collision error, try next.
|
|
tableIndex = (tableIndex + 1) & (results.length - 1);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Special method to convert a number in the specific format into an int value without branches created by
|
|
// Quan Anh Mai.
|
|
private static int convertIntoNumber(int decimalSepPos, long numberWord) {
|
|
int shift = 28 - decimalSepPos;
|
|
// signed is -1 if negative, 0 otherwise
|
|
long signed = (~numberWord << 59) >> 63;
|
|
long designMask = ~(signed & 0xFF);
|
|
// Align the number to a specific position and transform the ascii code
|
|
// to actual digit value in each byte
|
|
long digits = ((numberWord & designMask) << shift) & 0x0F000F0F00L;
|
|
|
|
// Now digits is in the form 0xUU00TTHH00 (UU: units digit, TT: tens digit, HH: hundreds digit)
|
|
// 0xUU00TTHH00 * (100 * 0x1000000 + 10 * 0x10000 + 1) =
|
|
// 0x000000UU00TTHH00 +
|
|
// 0x00UU00TTHH000000 * 10 +
|
|
// 0xUU00TTHH00000000 * 100
|
|
// Now TT * 100 has 2 trailing zeroes and HH * 100 + TT * 10 + UU < 0x400
|
|
// This results in our value lies in the bit 32 to 41 of this product
|
|
// That was close :)
|
|
long absValue = ((digits * 0x640a0001) >>> 32) & 0x3FF;
|
|
long value = (absValue ^ signed) - signed;
|
|
return (int) value;
|
|
}
|
|
|
|
private static int findDelimiter(long word) {
|
|
long input = word ^ 0x3B3B3B3B3B3B3B3BL;
|
|
long tmp = (input - 0x0101010101010101L) & ~input & 0x8080808080808080L;
|
|
return Long.numberOfTrailingZeros(tmp) >>> 3;
|
|
}
|
|
|
|
private static void newEntry(Result[] results, HashMap<String, Result> cities, long nameAddress, int number, int hash, int nameLength) {
|
|
Result r = new Result(nameAddress, number);
|
|
results[hash] = r;
|
|
byte[] bytes = new byte[nameLength];
|
|
|
|
int i = 0;
|
|
for (; i < nameLength + 1 - 8; i += 8) {
|
|
}
|
|
r.lastNameLong = UNSAFE.getLong(nameAddress + i);
|
|
r.remainingShift = (64 - (nameLength + 1 - i) << 3);
|
|
UNSAFE.copyMemory(null, nameAddress, bytes, Unsafe.ARRAY_BYTE_BASE_OFFSET, nameLength);
|
|
String nameAsString = new String(bytes, StandardCharsets.UTF_8);
|
|
cities.put(nameAsString, r);
|
|
}
|
|
|
|
private static long[] getSegments(int numberOfChunks) throws IOException {
|
|
try (var fileChannel = FileChannel.open(Path.of(FILE), StandardOpenOption.READ)) {
|
|
long fileSize = fileChannel.size();
|
|
long segmentSize = (fileSize + numberOfChunks - 1) / numberOfChunks;
|
|
long[] chunks = new long[numberOfChunks + 1];
|
|
long mappedAddress = fileChannel.map(MapMode.READ_ONLY, 0, fileSize, Arena.global()).address();
|
|
chunks[0] = mappedAddress;
|
|
long endAddress = mappedAddress + fileSize;
|
|
for (int i = 1; i < numberOfChunks; ++i) {
|
|
long chunkAddress = mappedAddress + i * segmentSize;
|
|
// Align to first row start.
|
|
while (chunkAddress < endAddress && UNSAFE.getByte(chunkAddress++) != '\n') {
|
|
// nop
|
|
}
|
|
chunks[i] = Math.min(chunkAddress, endAddress);
|
|
}
|
|
chunks[numberOfChunks] = endAddress;
|
|
return chunks;
|
|
}
|
|
}
|
|
}
|