1 /*
2 * Copyright 2014 The Netty Project
3 *
4 * The Netty Project licenses this file to you under the Apache License,
5 * version 2.0 (the "License"); you may not use this file except in compliance
6 * with the License. You may obtain a copy of the License at:
7 *
8 * https://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
12 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
13 * License for the specific language governing permissions and limitations
14 * under the License.
15 */
16 package io.netty.channel.unix;
17
18 import io.netty.buffer.ByteBuf;
19 import io.netty.buffer.Unpooled;
20 import io.netty.channel.ChannelOutboundBuffer.MessageProcessor;
21 import io.netty.util.internal.PlatformDependent;
22
23 import java.nio.ByteBuffer;
24 import java.nio.ByteOrder;
25
26 import static io.netty.channel.unix.Limits.IOV_MAX;
27 import static io.netty.channel.unix.Limits.SSIZE_MAX;
28 import static io.netty.util.internal.ObjectUtil.checkPositive;
29 import static java.lang.Math.min;
30
31 /**
32 * Represent an array of struct array and so can be passed directly over via JNI without the need to do any more
33 * array copies.
34 *
35 * The buffers are written out directly into direct memory to match the struct iov. See also {@code man writev}.
36 *
37 * <pre>
38 * struct iovec {
39 * void *iov_base;
40 * size_t iov_len;
41 * };
42 * </pre>
43 *
44 * See also
45 * <a href="https://rkennke.wordpress.com/2007/07/30/efficient-jni-programming-iv-wrapping-native-data-objects/"
46 * >Efficient JNI programming IV: Wrapping native data objects</a>.
47 */
48 public final class IovArray implements MessageProcessor {
49
50 /** The size of an address which should be 8 for 64 bits and 4 for 32 bits. */
51 private static final int ADDRESS_SIZE = Buffer.addressSize();
52
53 /**
54 * The size of an {@code iovec} struct in bytes. This is calculated as we have 2 entries each of the size of the
55 * address.
56 */
57 public static final int IOV_SIZE = 2 * ADDRESS_SIZE;
58
59 /**
60 * The needed memory to hold up to {@code IOV_MAX} iov entries, where {@code IOV_MAX} signified
61 * the maximum number of {@code iovec} structs that can be passed to {@code writev(...)}.
62 */
63 private static final int MAX_CAPACITY = IOV_MAX * IOV_SIZE;
64
65 private final long memoryAddress;
66 private final ByteBuf memory;
67 private int count;
68 private long size;
69 private long maxBytes = SSIZE_MAX;
70
71 public IovArray() {
72 this(Unpooled.wrappedBuffer(Buffer.allocateDirectWithNativeOrder(MAX_CAPACITY)).setIndex(0, 0));
73 }
74
75 @SuppressWarnings("deprecation")
76 public IovArray(ByteBuf memory) {
77 assert memory.writerIndex() == 0;
78 assert memory.readerIndex() == 0;
79 this.memory = PlatformDependent.hasUnsafe() ? memory : memory.order(
80 PlatformDependent.BIG_ENDIAN_NATIVE_ORDER ? ByteOrder.BIG_ENDIAN : ByteOrder.LITTLE_ENDIAN);
81 if (memory.hasMemoryAddress()) {
82 memoryAddress = memory.memoryAddress();
83 } else {
84 // Fallback to using JNI as we were not be able to access the address otherwise.
85 memoryAddress = Buffer.memoryAddress(memory.internalNioBuffer(0, memory.capacity()));
86 }
87 }
88
89 public void clear() {
90 count = 0;
91 size = 0;
92 }
93
94 /**
95 * @deprecated Use {@link #add(ByteBuf, int, int)}
96 */
97 @Deprecated
98 public boolean add(ByteBuf buf) {
99 return add(buf, buf.readerIndex(), buf.readableBytes());
100 }
101
102 public boolean add(ByteBuf buf, int offset, int len) {
103 if (count == IOV_MAX) {
104 // No more room!
105 return false;
106 }
107 if (buf.nioBufferCount() == 1) {
108 if (len == 0) {
109 return true;
110 }
111 if (buf.hasMemoryAddress()) {
112 return add(memoryAddress, buf.memoryAddress() + offset, len);
113 } else {
114 ByteBuffer nioBuffer = buf.internalNioBuffer(offset, len);
115 return add(memoryAddress, Buffer.memoryAddress(nioBuffer) + nioBuffer.position(), len);
116 }
117 } else {
118 ByteBuffer[] buffers = buf.nioBuffers(offset, len);
119 for (ByteBuffer nioBuffer : buffers) {
120 final int remaining = nioBuffer.remaining();
121 if (remaining != 0 &&
122 (!add(memoryAddress, Buffer.memoryAddress(nioBuffer) + nioBuffer.position(), remaining)
123 || count == IOV_MAX)) {
124 return false;
125 }
126 }
127 return true;
128 }
129 }
130
131 private boolean add(long memoryAddress, long addr, int len) {
132 assert addr != 0;
133
134 // If there is at least 1 entry then we enforce the maximum bytes. We want to accept at least one entry so we
135 // will attempt to write some data and make progress.
136 if ((maxBytes - len < size && count > 0) ||
137 // Check if we have enough space left
138 memory.capacity() < (count + 1) * IOV_SIZE) {
139 // If the size + len will overflow SSIZE_MAX we stop populate the IovArray. This is done as linux
140 // not allow to write more bytes then SSIZE_MAX with one writev(...) call and so will
141 // return 'EINVAL', which will raise an IOException.
142 //
143 // See also:
144 // - https://linux.die.net//man/2/writev
145 return false;
146 }
147 final int baseOffset = idx(count);
148 final int lengthOffset = baseOffset + ADDRESS_SIZE;
149
150 size += len;
151 ++count;
152
153 if (ADDRESS_SIZE == 8) {
154 // 64bit
155 if (PlatformDependent.hasUnsafe()) {
156 PlatformDependent.putLong(baseOffset + memoryAddress, addr);
157 PlatformDependent.putLong(lengthOffset + memoryAddress, len);
158 } else {
159 memory.setLong(baseOffset, addr);
160 memory.setLong(lengthOffset, len);
161 }
162 } else {
163 assert ADDRESS_SIZE == 4;
164 if (PlatformDependent.hasUnsafe()) {
165 PlatformDependent.putInt(baseOffset + memoryAddress, (int) addr);
166 PlatformDependent.putInt(lengthOffset + memoryAddress, len);
167 } else {
168 memory.setInt(baseOffset, (int) addr);
169 memory.setInt(lengthOffset, len);
170 }
171 }
172 return true;
173 }
174
175 /**
176 * Returns the number if iov entries.
177 */
178 public int count() {
179 return count;
180 }
181
182 /**
183 * Returns the size in bytes
184 */
185 public long size() {
186 return size;
187 }
188
189 /**
190 * Set the maximum amount of bytes that can be added to this {@link IovArray} via {@link #add(ByteBuf, int, int)}
191 * <p>
192 * This will not impact the existing state of the {@link IovArray}, and only applies to subsequent calls to
193 * {@link #add(ByteBuf)}.
194 * <p>
195 * In order to ensure some progress is made at least one {@link ByteBuf} will be accepted even if it's size exceeds
196 * this value.
197 * @param maxBytes the maximum amount of bytes that can be added to this {@link IovArray}.
198 */
199 public void maxBytes(long maxBytes) {
200 this.maxBytes = min(SSIZE_MAX, checkPositive(maxBytes, "maxBytes"));
201 }
202
203 /**
204 * Get the maximum amount of bytes that can be added to this {@link IovArray}.
205 * @return the maximum amount of bytes that can be added to this {@link IovArray}.
206 */
207 public long maxBytes() {
208 return maxBytes;
209 }
210
211 /**
212 * Returns the {@code memoryAddress} for the given {@code offset}.
213 */
214 public long memoryAddress(int offset) {
215 return memoryAddress + idx(offset);
216 }
217
218 /**
219 * Release the {@link IovArray}. Once release further using of it may crash the JVM!
220 */
221 public void release() {
222 memory.release();
223 }
224
225 @Override
226 public boolean processMessage(Object msg) throws Exception {
227 if (msg instanceof ByteBuf) {
228 ByteBuf buffer = (ByteBuf) msg;
229 return add(buffer, buffer.readerIndex(), buffer.readableBytes());
230 }
231 return false;
232 }
233
234 private static int idx(int index) {
235 return IOV_SIZE * index;
236 }
237 }