aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/dev/morling/onebrc/CalculateAverage_jotschi.java
blob: 0e0b5207a872c468dc514e1453ede64e72a90b70 (plain)
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
/*
 *  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 java.io.File;
import java.io.IOException;
import java.io.RandomAccessFile;
import java.lang.foreign.Arena;
import java.lang.foreign.MemorySegment;
import java.lang.foreign.ValueLayout.OfByte;
import java.lang.foreign.ValueLayout.OfChar;
import java.nio.channels.FileChannel;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.TreeMap;
import java.util.stream.Collectors;

public class CalculateAverage_jotschi {
    private static final String FILE = "./measurements.txt";

    public static void main(String[] args) throws IOException {
        var filename = args.length == 0 ? FILE : args[0];
        parseFile(filename);
    }

    @SuppressWarnings("preview")
    private static void parseFile(String filename) throws IOException {
        var file = new File(filename);
        RandomAccessFile randomAccessFile = new RandomAccessFile(file, "r");
        FileChannel fileChannel = randomAccessFile.getChannel();
        MemorySegment memSeg = fileChannel.map(FileChannel.MapMode.READ_ONLY, 0, fileChannel.size(), Arena.global());
        var results = getFileSegments(memSeg).stream().map(segment -> {
            var resultMap = new ByteArrayToResultMap2();
            long segmentEnd = segment.end();
            MemorySegment slice = memSeg.asSlice(segment.start(), segmentEnd - segment.start());

            // Up to 100 characters for a city name
            var buffer = new byte[100];
            int startLine;
            int pos = 0;
            long limit = slice.byteSize();
            while ((startLine = pos) < limit) {
                int currentPosition = startLine;
                byte b;
                int offset = 0;
                int hash = 0;
                while (currentPosition != segmentEnd && (b = slice.get(OfByte.JAVA_BYTE, currentPosition++)) != ';') {
                    buffer[offset++] = b;
                    hash = 31 * hash + b;
                }
                int temp;
                int negative = 1;
                // Inspired by @yemreinci to unroll this even further
                if (slice.get(OfByte.JAVA_BYTE, currentPosition) == '-') {
                    negative = -1;
                    currentPosition++;
                }
                if (slice.get(OfByte.JAVA_BYTE, currentPosition + 1) == '.') {
                    temp = negative * ((slice.get(OfByte.JAVA_BYTE, currentPosition) - '0') * 10 + (slice.get(OfByte.JAVA_BYTE, currentPosition + 2) - '0'));
                    currentPosition += 3;
                }
                else {
                    temp = negative
                            * ((slice.get(OfByte.JAVA_BYTE, currentPosition) - '0') * 100
                                    + ((slice.get(OfByte.JAVA_BYTE, currentPosition + 1) - '0') * 10 + (slice.get(OfByte.JAVA_BYTE, currentPosition + 3) - '0')));
                    currentPosition += 4;
                }
                if (slice.get(OfByte.JAVA_BYTE, currentPosition) == '\r') {
                    currentPosition++;
                }
                currentPosition++;
                resultMap.putOrMerge(buffer, 0, offset, temp / 10.0, hash);
                pos = currentPosition;
            }
            return resultMap;
        }).parallel().flatMap(partition -> partition.getAll().stream())
                .collect(Collectors.toMap(e -> new String(e.key()), Entry2::value, CalculateAverage_jotschi::merge, TreeMap::new));
        System.out.println(results);
    }

    private static List<FileSegment2> getFileSegments(MemorySegment memSeg) throws IOException {
        int numberOfSegments = Runtime.getRuntime().availableProcessors();
        long fileSize = memSeg.byteSize();
        long segmentSize = fileSize / numberOfSegments;
        List<FileSegment2> segments = new ArrayList<>(numberOfSegments);

        // Pointless to split small files
        if (segmentSize < 1_000_000) {
            segments.add(new FileSegment2(0, fileSize));
            return segments;
        }

        // Split the file up into even segments that match up with the CPU core count
        // so that each core can process a segment of the file.
        // The findSegment call ensures that the segment terminates with a newline.
        for (int i = 0; i < numberOfSegments; i++) {
            long segStart = i * segmentSize;
            long segEnd = (i == numberOfSegments - 1) ? fileSize : segStart + segmentSize;
            segStart = findSegment(i, 0, memSeg, segStart, segEnd);
            segEnd = findSegment(i, numberOfSegments - 1, memSeg, segEnd, fileSize);
            segments.add(new FileSegment2(segStart, segEnd));
        }
        return segments;
    }

    private static Result2 merge(Result2 v, Result2 value) {
        return merge(v, value.min, value.max, value.sum, value.count);
    }

    private static Result2 merge(Result2 v, double value, double value1, double value2, long value3) {
        v.min = Math.min(v.min, value);
        v.max = Math.max(v.max, value1);
        v.sum += value2;
        v.count += value3;
        return v;
    }

    private static long findSegment(int i, int skipSegment, MemorySegment memSeg, long location, long fileSize) throws IOException {
        if (i != skipSegment) {
            long remaining = fileSize - location;
            int bufferSize = remaining < 64 ? (int) remaining : 64;
            MemorySegment slice = memSeg.asSlice(location, bufferSize);
            for (int offset = 0; offset < slice.byteSize(); offset++) {
                if (slice.get(OfChar.JAVA_BYTE, offset) == '\n') {
                    return location + offset + 1;
                }
            }
        }
        return location;
    }
}

class Result2 {
    double min, max, sum;
    long count;

    Result2(double value) {
        min = max = sum = value;
        this.count = 1;
    }

    @Override
    public String toString() {
        return round(min) + "/" + round(sum / count) + "/" + round(max);
    }

    double round(double v) {
        return Math.round(v * 10.0) / 10.0;
    }

}

    record Pair2(int slot, Result2 slotValue) {
    }

    record Entry2(byte[] key, Result2 value) {
    }

    record FileSegment2(long start, long end) {
    }

class ByteArrayToResultMap2 {
  public static final int MAPSIZE = 1024 * 128;
  Result2[] slots = new Result2[MAPSIZE];
  byte[][] keys = new byte[MAPSIZE][];

  public void putOrMerge(byte[] key, int offset, int size, double temp, int hash) {
    int slot = hash & (slots.length - 1);
    var slotValue = slots[slot];
    // Linear probe for open slot
    while (slotValue != null && (keys[slot].length != size || !Arrays.equals(keys[slot], 0, size, key, offset, size))) {
      slot = (slot + 1) & (slots.length - 1);
      slotValue = slots[slot];
    }
    Result2 value = slotValue;
    if (value == null) {
      slots[slot] = new Result2(temp);
      byte[] bytes = new byte[size];
      System.arraycopy(key, offset, bytes, 0, size);
      keys[slot] = bytes;
    } else {
      value.min = Math.min(value.min, temp);
      value.max = Math.max(value.max, temp);
      value.sum += temp;
      value.count += 1;
    }
  }

  // Get all pairs
  public List<Entry2> getAll() {
    List<Entry2> result = new ArrayList<>(slots.length);
    for (int i = 0; i < slots.length; i++) {
      Result2 slotValue = slots[i];
      if (slotValue != null) {
        result.add(new Entry2(keys[i], slotValue));
      }
    }
    return result;
  }
}