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
99 channel.read(memory.clear(), JournalSegmentDescriptor.BYTES);
102 // Read the entry length.
103 int length = memory.getInt();
105 // If the length is non-zero, read the entry.
106 while (0 < length && length <= maxEntrySize && (index == 0 || nextIndex <= index)) {
108 // Read the checksum of the entry.
109 final long checksum = memory.getInt() & 0xFFFFFFFFL;
111 // Slice off the entry's bytes
112 final ByteBuffer entryBytes = memory.slice();
113 entryBytes.limit(length);
115 // Compute the checksum for the entry bytes.
116 final CRC32 crc32 = new CRC32();
117 crc32.update(entryBytes);
119 // If the stored checksum does not equal the computed checksum, do not proceed further
120 if (checksum != crc32.getValue()) {
125 final E entry = namespace.deserialize(entryBytes);
126 lastEntry = new Indexed<>(nextIndex, entry, length);
127 this.index.index(nextIndex, (int) currentPosition);
130 // Update the current position for indexing.
131 currentPosition = currentPosition + Integer.BYTES + Integer.BYTES + length;
132 memory.position(memory.position() + length);
134 // Read more bytes from the segment if necessary.
135 if (memory.remaining() < maxEntrySize) {
136 channel.read(memory.compact());
140 length = memory.getInt();
142 } catch (BufferUnderflowException e) {
143 // No-op, position is only updated on success
144 } catch (IOException e) {
145 throw new StorageException(e);
150 long getLastIndex() {
151 return lastEntry != null ? lastEntry.index() : firstIndex - 1;
155 Indexed<E> getLastEntry() {
160 long getNextIndex() {
161 if (lastEntry != null) {
162 return lastEntry.index() + 1;
169 @SuppressWarnings("unchecked")
170 <T extends E> Indexed<T> append(T entry) {
171 // Store the entry index.
172 final long index = getNextIndex();
174 // Serialize the entry.
176 namespace.serialize(entry, memory.clear().position(Integer.BYTES + Integer.BYTES));
177 } catch (KryoException e) {
178 throw new StorageException.TooLarge("Entry size exceeds maximum allowed bytes (" + maxEntrySize + ")");
182 final int length = memory.limit() - (Integer.BYTES + Integer.BYTES);
184 // Ensure there's enough space left in the buffer to store the entry.
185 if (maxSegmentSize - currentPosition < length + Integer.BYTES + Integer.BYTES) {
186 throw new BufferOverflowException();
189 // If the entry length exceeds the maximum entry size then throw an exception.
190 if (length > maxEntrySize) {
191 throw new StorageException.TooLarge("Entry size " + length + " exceeds maximum allowed bytes (" + maxEntrySize + ")");
194 // Compute the checksum for the entry.
195 final CRC32 crc32 = new CRC32();
196 crc32.update(memory.array(), Integer.BYTES + Integer.BYTES, memory.limit() - (Integer.BYTES + Integer.BYTES));
197 final long checksum = crc32.getValue();
199 // Create a single byte[] in memory for the entire entry and write it as a batch to the underlying buffer.
200 memory.putInt(0, length).putInt(Integer.BYTES, (int) checksum);
202 channel.write(memory, currentPosition);
203 } catch (IOException e) {
204 throw new StorageException(e);
207 // Update the last entry with the correct index/term/length.
208 Indexed<E> indexedEntry = new Indexed<>(index, entry, length);
209 this.lastEntry = indexedEntry;
210 this.index.index(index, (int) currentPosition);
212 currentPosition = currentPosition + Integer.BYTES + Integer.BYTES + length;
213 return (Indexed<T>) indexedEntry;
217 void truncate(long index) {
218 // If the index is greater than or equal to the last index, skip the truncate.
219 if (index >= getLastIndex()) {
223 // Reset the last entry.
226 // Truncate the index.
227 this.index.truncate(index);
230 if (index < firstIndex) {
231 // Reset the writer to the first entry.
232 currentPosition = JournalSegmentDescriptor.BYTES;
234 // Reset the writer to the given index.
238 // Zero the entry header at current channel position.
239 channel.write(ZERO_ENTRY_HEADER.asReadOnlyBuffer(), currentPosition);
240 } catch (IOException e) {
241 throw new StorageException(e);
248 if (channel.isOpen()) {
251 } catch (IOException e) {
252 throw new StorageException(e);