aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/dev/morling/onebrc/CalculateAverage_dpsoft.java
blob: 671d8bab7508ccc44d527cde49ec761adb8bdc5f (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
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
/*
 *  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.nio.ByteOrder;
import java.nio.MappedByteBuffer;
import java.nio.channels.FileChannel;
import java.nio.charset.StandardCharsets;
import java.nio.file.Path;
import java.nio.file.StandardOpenOption;
import java.util.*;
import java.util.concurrent.Phaser;

public class CalculateAverage_dpsoft {
    private static final String FILE = "./measurements.txt";
    private static final int MAX_ROWS = 1 << 15;
    private static final int ROWS_MASK = MAX_ROWS - 1;

    public static void main(String[] args) throws IOException {
        final var cpus = Runtime.getRuntime().availableProcessors();
        final var segments = getMemorySegments(cpus);
        final var tasks = new MeasurementExtractor[segments.size()];
        final var phaser = new Phaser(segments.size());

        for (int i = 0; i < segments.size(); i++) {
            tasks[i] = new MeasurementExtractor(segments.get(i), phaser);
        }

        phaser.awaitAdvance(phaser.getPhase());

        final var allMeasurements = Arrays.stream(tasks)
                .parallel()
                .map(MeasurementExtractor::getMeasurements)
                .reduce(MeasurementMap::merge)
                .orElseThrow();

        System.out.println(sortSequentially(allMeasurements));

        System.exit(0);
    }

    private static Map<String, Measurement> sortSequentially(MeasurementMap allMeasurements) {
        final Map<String, Measurement> sorted = new TreeMap<>();
        for (Measurement m : allMeasurements.measurements) {
            if (m != null) {
                sorted.put(new String(m.name, StandardCharsets.UTF_8), m);
            }
        }
        return sorted;
    }

    // Inspired by @spullara
    private static List<FileSegment> getMemorySegments(int numberOfSegments) throws IOException {
        var file = new File(FILE);
        long fileSize = file.length();
        long segmentSize = fileSize / numberOfSegments;
        List<FileSegment> segments = new ArrayList<>(numberOfSegments);

        if (fileSize < 1_000_000) {
            segments.add(new FileSegment(0, fileSize));
            return segments;
        }

        while (segmentSize >= Integer.MAX_VALUE) {
            numberOfSegments += 1;
            segmentSize = fileSize / numberOfSegments;
        }

        try (RandomAccessFile randomAccessFile = new RandomAccessFile(file, "r")) {
            for (int i = 0; i < numberOfSegments; i++) {
                long segStart = i * segmentSize;
                long segEnd = (i == numberOfSegments - 1) ? fileSize : segStart + segmentSize;
                segStart = findSegment(i, 0, randomAccessFile, segStart, segEnd);
                segEnd = findSegment(i, numberOfSegments - 1, randomAccessFile, segEnd, fileSize);

                segments.add(new FileSegment(segStart, segEnd));
            }
        }
        return segments;
    }

    private static long findSegment(int i, int skipSegment, RandomAccessFile raf, long location, long fileSize) throws IOException {
        if (i != skipSegment) {
            raf.seek(location);
            while (location < fileSize) {
                location++;
                if (raf.read() == '\n')
                    break;
            }
        }
        return location;
    }

    record FileSegment(long start, long end) {
    }

    static final class MeasurementExtractor implements Runnable {
        private final FileSegment segment;
        private final Phaser phaser;
        private final MeasurementMap measurements = new MeasurementMap();

        MeasurementExtractor(FileSegment memorySegment, Phaser phaser) {
            this.segment = memorySegment;
            this.phaser = phaser;
            (new Thread(this)).start();
        }

        @Override
        public void run() {
            long segmentEnd = segment.end();
            try (var fileChannel = FileChannel.open(Path.of(FILE), StandardOpenOption.READ)) {
                var mbb = fileChannel.map(FileChannel.MapMode.READ_ONLY, segment.start(), segmentEnd - segment.start());
                mbb.order(ByteOrder.nativeOrder());

                if (segment.start() > 0) {
                    skipToFirstLine(mbb);
                }

                while (mbb.remaining() > 0 && mbb.position() <= segmentEnd) {
                    int pos = mbb.position();
                    int nameHash = hashAndRewind(mbb);
                    var m = measurements.getOrCompute(nameHash, mbb, pos);
                    int temp = readTemperatureFromBuffer(mbb);

                    m.sample(temp);
                }
            }
            catch (IOException e) {
                throw new RuntimeException("Error reading file", e);
            }
            finally {
                phaser.arriveAndAwaitAdvance();
            }
        }

        // inspired by @lawrey
        private static int hashAndRewind(MappedByteBuffer mbb) {
            int hash = 0;
            int idx = mbb.position();
            outer: while (true) {
                int name = mbb.getInt();
                for (int c = 0; c < 4; c++) {
                    int b = (name >> (c << 3)) & 0xFF;
                    if (b == ';') {
                        idx += c + 1;
                        break outer;
                    }
                    hash ^= b * 82805;
                }
                idx += 4;
            }

            var rewind = mbb.position() - idx;
            mbb.position(mbb.position() - rewind);
            return hash;
        }

        private static int readTemperatureFromBuffer(MappedByteBuffer mbb) {
            int temp = 0;
            boolean negative = false;

            outer: while (mbb.remaining() > 0) {
                int b = mbb.get();
                switch (b) {
                    case '-':
                        negative = true;
                        break;
                    default:
                        temp = 10 * temp + (b - '0');
                        break;
                    case '.':
                        b = mbb.get();
                        temp = 10 * temp + (b - '0');
                    case '\r':
                        mbb.get();
                    case '\n':
                        break outer;
                }
            }
            if (negative)
                temp = -temp;
            return temp;
        }

        public MeasurementMap getMeasurements() {
            return measurements;
        }

        // Skips to the first line in the buffer, used for chunk processing.
        private static void skipToFirstLine(MappedByteBuffer mbb) {
            while ((mbb.get() & 0xFF) >= ' ') {
                // Skip bytes until reaching the start of a line.
            }
        }
    }

    // credits to @shipilev
    static class MeasurementMap {
        private final Measurement[] measurements = new Measurement[MAX_ROWS];

        public Measurement getOrCompute(int hash, MappedByteBuffer mbb, int position) {
            int index = hash & ROWS_MASK;
            var measurement = measurements[index];
            if (measurement != null && hash == measurement.nameHash && Measurement.equalsTo(measurement.name, mbb, position)) {
                return measurement;
            }
            else {
                return compute(hash, mbb, position);
            }
        }

        private Measurement compute(int hash, MappedByteBuffer mbb, int position) {
            var index = hash & ROWS_MASK;
            Measurement m;

            while (true) {
                m = measurements[index];
                if (m == null || (hash == m.nameHash && Measurement.equalsTo(m.name, mbb, position))) {
                    break;
                }
                index = (index + 1) & ROWS_MASK;
            }

            if (m == null) {
                int len = mbb.position() - position - 1;
                byte[] bytes = new byte[len];
                mbb.position(position);
                mbb.get(bytes, 0, len);
                mbb.get();
                measurements[index] = m = new Measurement(bytes, hash);
            }

            return m;
        }

        public MeasurementMap merge(MeasurementMap otherMap) {
            for (Measurement other : otherMap.measurements) {
                if (other == null)
                    continue;
                int index = other.nameHash & ROWS_MASK;
                while (true) {
                    Measurement m = measurements[index];
                    if (m == null) {
                        measurements[index] = other;
                        break;
                    }
                    else if (Arrays.equals(m.name, other.name)) {
                        m.merge(other);
                        break;
                    }
                    else {
                        index = (index + 1) & ROWS_MASK;
                    }
                }
            }
            return this;
        }
    }

    static final class Measurement {
        public final int nameHash;
        public final byte[] name;

        public long sum;
        public int count = 0;
        public int min = Integer.MAX_VALUE;
        public int max = Integer.MIN_VALUE;

        public Measurement(byte[] name, int nameHash) {
            this.name = name;
            this.nameHash = nameHash;
        }

        public static boolean equalsTo(byte[] name, MappedByteBuffer mbb, int position) {
            int len = mbb.position() - position - 1;
            if (len != name.length)
                return false;
            for (int i = 0; i < len; i++) {
                if (name[i] != mbb.get(position + i))
                    return false;
            }
            return true;
        }

        public void sample(int temp) {
            min = Math.min(min, temp);
            max = Math.max(max, temp);
            sum += temp;
            count++;
        }

        public Measurement merge(Measurement m2) {
            min = Math.min(min, m2.min);
            max = Math.max(max, m2.max);
            sum += m2.sum;
            count += m2.count;
            return this;
        }

        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;
        }
    }
}