Repository navigation
Expand file tree
/
Copy pathDataOutput2.java
More file actions
213 lines (182 loc) · 5.96 KB
/
Copy pathDataOutput2.java
File metadata and controls
213 lines (182 loc) · 5.96 KB
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
package org.mapdb;
import org.mapdb.util.DataIO;
import java.io.DataOutput;
import java.io.IOException;
import java.io.OutputStream;
import java.util.Arrays;
/**
* Output of serialization
*/
public class DataOutput2 extends OutputStream implements DataOutput{
public byte[] buf;
public int pos;
public int sizeMask;
public DataOutput2(){
pos = 0;
buf = new byte[128]; //PERF take hint from serializer for initial size
sizeMask = 0xFFFFFFFF-(buf.length-1);
}
public byte[] copyBytes(){
return Arrays.copyOf(buf, pos);
}
/**
* make sure there will be enough space in buffer to write N bytes
* @param n number of bytes which can be safely written after this method returns
*/
public void ensureAvail(int n) {
//$DELAY$
n+=pos;
if ((n&sizeMask)!=0) {
grow(n);
}
}
private void grow(int n) {
//$DELAY$
int newSize = Math.max(DataIO.nextPowTwo(n),buf.length);
sizeMask = 0xFFFFFFFF-(newSize-1);
buf = Arrays.copyOf(buf, newSize);
}
@Override
public void write(final int b) throws IOException {
ensureAvail(1);
//$DELAY$
buf[pos++] = (byte) b;
}
@Override
public void write(byte[] b) throws IOException {
write(b,0,b.length);
}
@Override
public void write(final byte[] b, final int off, final int len) throws IOException {
ensureAvail(len);
//$DELAY$
System.arraycopy(b, off, buf, pos, len);
pos += len;
}
@Override
public void writeBoolean(final boolean v) throws IOException {
ensureAvail(1);
//$DELAY$
buf[pos++] = (byte) (v ? 1 : 0);
}
@Override
public void writeByte(final int v) throws IOException {
ensureAvail(1);
//$DELAY$
buf[pos++] = (byte) (v);
}
@Override
public void writeShort(final int v) throws IOException {
ensureAvail(2);
//$DELAY$
buf[pos++] = (byte) (0xff & (v >> 8));
//$DELAY$
buf[pos++] = (byte) (0xff & (v));
}
@Override
public void writeChar(final int v) throws IOException {
ensureAvail(2);
buf[pos++] = (byte) (v>>>8);
buf[pos++] = (byte) (v);
}
@Override
public void writeInt(final int v) throws IOException {
ensureAvail(4);
buf[pos++] = (byte) (0xff & (v >> 24));
//$DELAY$
buf[pos++] = (byte) (0xff & (v >> 16));
buf[pos++] = (byte) (0xff & (v >> 8));
//$DELAY$
buf[pos++] = (byte) (0xff & (v));
}
@Override
public void writeLong(final long v) throws IOException {
ensureAvail(8);
buf[pos++] = (byte) (0xff & (v >> 56));
buf[pos++] = (byte) (0xff & (v >> 48));
//$DELAY$
buf[pos++] = (byte) (0xff & (v >> 40));
buf[pos++] = (byte) (0xff & (v >> 32));
buf[pos++] = (byte) (0xff & (v >> 24));
//$DELAY$
buf[pos++] = (byte) (0xff & (v >> 16));
buf[pos++] = (byte) (0xff & (v >> 8));
buf[pos++] = (byte) (0xff & (v));
//$DELAY$
}
@Override
public void writeFloat(final float v) throws IOException {
writeInt(Float.floatToIntBits(v));
}
@Override
public void writeDouble(final double v) throws IOException {
writeLong(Double.doubleToLongBits(v));
}
@Override
public void writeBytes(final String s) throws IOException {
writeUTF(s);
}
@Override
public void writeChars(final String s) throws IOException {
writeUTF(s);
}
@Override
public void writeUTF(final String s) throws IOException {
final int len = s.length();
packInt(len);
for (int i = 0; i < len; i++) {
//$DELAY$
int c = (int) s.charAt(i);
packInt(c);
}
}
public void packInt(int value) throws IOException {
ensureAvail(5); //ensure worst case bytes
// Optimize for the common case where value is small. This is particular important where our caller
// is SerializerBase.SER_STRING.serialize because most chars will be ASCII characters and hence in this range.
// credit Max Bolingbroke https://github.com/jankotek/MapDB/pull/489
int shift = (value & ~0x7F); //reuse variable
if (shift != 0) {
shift = 31 - Integer.numberOfLeadingZeros(value);
shift -= shift % 7; // round down to nearest multiple of 7
while (shift != 0) {
buf[pos++] = (byte) ((value >>> shift) & 0x7F);
shift -= 7;
}
}
buf[pos++] = (byte) ((value & 0x7F)| 0x80);
}
public void packIntBigger(int value) throws IOException {
ensureAvail(5); //ensure worst case bytes
int shift = 31-Integer.numberOfLeadingZeros(value);
shift -= shift%7; // round down to nearest multiple of 7
while(shift!=0){
buf[pos++] = (byte) ((value>>>shift) & 0x7F);
shift-=7;
}
buf[pos++] = (byte) ((value & 0x7F)|0x80);
}
public void packLong(long value) {
ensureAvail(10); //ensure worst case bytes
int shift = 63-Long.numberOfLeadingZeros(value);
shift -= shift%7; // round down to nearest multiple of 7
while(shift!=0){
buf[pos++] = (byte) ((value>>>shift) & 0x7F);
shift-=7;
}
buf[pos++] = (byte) ((value & 0x7F) | 0x80);
}
public void packLongArray(long[] array, int fromIndex, int toIndex ) {
for(int i=fromIndex;i<toIndex;i++){
long value = array[i];
ensureAvail(10); //ensure worst case bytes
int shift = 63-Long.numberOfLeadingZeros(value);
shift -= shift%7; // round down to nearest multiple of 7
while(shift!=0){
buf[pos++] = (byte) ((value>>>shift) & 0x7F);
shift-=7;
}
buf[pos++] = (byte) ((value & 0x7F) | 0x80);
}
}
}