2 * Copyright 2017-present Open Networking Foundation
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
16 package io.atomix.storage.journal;
18 import com.esotericsoftware.kryo.KryoException;
19 import io.atomix.storage.journal.index.JournalIndex;
21 import java.io.IOException;
22 import java.nio.BufferOverflowException;
23 import java.nio.BufferUnderflowException;
24 import java.nio.ByteBuffer;
25 import java.nio.MappedByteBuffer;
26 import java.nio.channels.FileChannel;
27 import java.util.zip.CRC32;
32 * The format of an entry in the log is as follows:
34 * <li>64-bit index</li>
35 * <li>8-bit boolean indicating whether a term change is contained in the entry</li>
36 * <li>64-bit optional term</li>
37 * <li>32-bit signed entry length, including the entry type ID</li>
38 * <li>8-bit signed entry type ID</li>
39 * <li>n-bit entry bytes</li>
42 * @author <a href="http://github.com/kuujo">Jordan Halterman</a>
44 final class FileChannelJournalSegmentWriter<E> extends JournalSegmentWriter<E> {
45 private static final ByteBuffer ZERO_ENTRY_HEADER = ByteBuffer.wrap(new byte[Integer.BYTES + Integer.BYTES]);
47 private final ByteBuffer memory;
48 private Indexed<E> lastEntry;
49 private long currentPosition;
51 FileChannelJournalSegmentWriter(
53 JournalSegment<E> segment,
56 JournalSerdes namespace) {
57 super(channel, segment, maxEntrySize, index, namespace);
58 memory = allocMemory(maxEntrySize);
62 FileChannelJournalSegmentWriter(JournalSegmentWriter<E> previous, int position) {
64 memory = allocMemory(maxEntrySize);
65 lastEntry = previous.getLastEntry();
66 currentPosition = position;
69 private static ByteBuffer allocMemory(int maxEntrySize) {
70 final var buf = ByteBuffer.allocate((maxEntrySize + Integer.BYTES + Integer.BYTES) * 2);
76 MappedByteBuffer buffer() {
81 MappedJournalSegmentWriter<E> toMapped() {
82 return new MappedJournalSegmentWriter<>(this, (int) currentPosition);
86 FileChannelJournalSegmentWriter<E> toFileChannel() {
91 void reset(long index) {
92 long nextIndex = firstIndex;
94 // Clear the buffer indexes.
95 currentPosition = JournalSegmentDescriptor.BYTES;
98 // Clear memory buffer and read fist chunk
100 channel.read(memory, JournalSegmentDescriptor.BYTES);
103 // Read the entry length.
104 int length = memory.getInt();
106 // If the length is non-zero, read the entry.
107 while (0 < length && length <= maxEntrySize && (index == 0 || nextIndex <= index)) {
109 // Read the checksum of the entry.
110 final long checksum = memory.getInt() & 0xFFFFFFFFL;
112 // Slice off the entry's bytes
113 final ByteBuffer entryBytes = memory.slice();
114 entryBytes.limit(length);
116 // Compute the checksum for the entry bytes.
117 final CRC32 crc32 = new CRC32();
118 crc32.update(entryBytes);
120 // If the stored checksum does not equal the computed checksum, do not proceed further
121 if (checksum != crc32.getValue()) {
126 final E entry = namespace.deserialize(entryBytes);
127 lastEntry = new Indexed<>(nextIndex, entry, length);
128 this.index.index(nextIndex, (int) currentPosition);
131 // Update the current position for indexing.
132 currentPosition = currentPosition + Integer.BYTES + Integer.BYTES + length;
133 memory.position(memory.position() + length);
135 // Read more bytes from the segment if necessary.
136 if (memory.remaining() < maxEntrySize) {
138 channel.read(memory, currentPosition);
142 length = memory.getInt();
144 } catch (BufferUnderflowException e) {
145 // No-op, position is only updated on success
146 } catch (IOException e) {
147 throw new StorageException(e);
152 long getLastIndex() {
153 return lastEntry != null ? lastEntry.index() : firstIndex - 1;
157 Indexed<E> getLastEntry() {
162 long getNextIndex() {
163 if (lastEntry != null) {
164 return lastEntry.index() + 1;
171 @SuppressWarnings("unchecked")
172 <T extends E> Indexed<T> append(T entry) {
173 // Store the entry index.
174 final long index = getNextIndex();
176 // Serialize the entry.
178 memory.position(Integer.BYTES + Integer.BYTES);
180 namespace.serialize(entry, memory);
181 } catch (KryoException e) {
182 throw new StorageException.TooLarge("Entry size exceeds maximum allowed bytes (" + maxEntrySize + ")");
186 final int length = memory.limit() - (Integer.BYTES + Integer.BYTES);
188 // Ensure there's enough space left in the buffer to store the entry.
189 if (maxSegmentSize - currentPosition < length + Integer.BYTES + Integer.BYTES) {
190 throw new BufferOverflowException();
193 // If the entry length exceeds the maximum entry size then throw an exception.
194 if (length > maxEntrySize) {
195 throw new StorageException.TooLarge("Entry size " + length + " exceeds maximum allowed bytes (" + maxEntrySize + ")");
198 // Compute the checksum for the entry.
199 final CRC32 crc32 = new CRC32();
200 crc32.update(memory.array(), Integer.BYTES + Integer.BYTES, memory.limit() - (Integer.BYTES + Integer.BYTES));
201 final long checksum = crc32.getValue();
203 // Create a single byte[] in memory for the entire entry and write it as a batch to the underlying buffer.
204 memory.putInt(0, length);
205 memory.putInt(Integer.BYTES, (int) checksum);
207 channel.write(memory, currentPosition);
208 } catch (IOException e) {
209 throw new StorageException(e);
212 // Update the last entry with the correct index/term/length.
213 Indexed<E> indexedEntry = new Indexed<>(index, entry, length);
214 this.lastEntry = indexedEntry;
215 this.index.index(index, (int) currentPosition);
217 currentPosition = currentPosition + Integer.BYTES + Integer.BYTES + length;
218 return (Indexed<T>) indexedEntry;
222 void truncate(long index) {
223 // If the index is greater than or equal to the last index, skip the truncate.
224 if (index >= getLastIndex()) {
228 // Reset the last entry.
231 // Truncate the index.
232 this.index.truncate(index);
235 if (index < firstIndex) {
236 // Reset the writer to the first entry.
237 currentPosition = JournalSegmentDescriptor.BYTES;
239 // Reset the writer to the given index.
243 // Zero the entry header at current channel position.
244 channel.write(ZERO_ENTRY_HEADER.asReadOnlyBuffer(), currentPosition);
245 } catch (IOException e) {
246 throw new StorageException(e);
253 if (channel.isOpen()) {
256 } catch (IOException e) {
257 throw new StorageException(e);