aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/apache/orc/c++/src/RLEv1.cc
blob: aae9726bf6746589a3e24a18db2fb1e07716f9ae (plain) (blame)
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
/** 
 * Licensed to the Apache Software Foundation (ASF) under one 
 * or more contributor license agreements.  See the NOTICE file 
 * distributed with this work for additional information 
 * regarding copyright ownership.  The ASF licenses this file 
 * to you 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. 
 */ 
 
#include "Adaptor.hh" 
#include "Compression.hh" 
#include "orc/Exceptions.hh" 
#include "RLEv1.hh" 
 
#include <algorithm> 
 
namespace orc { 
 
const uint64_t MINIMUM_REPEAT = 3; 
const uint64_t MAXIMUM_REPEAT = 127 + MINIMUM_REPEAT; 
 
const int64_t BASE_128_MASK = 0x7f; 
 
const int64_t MAX_DELTA = 127; 
const int64_t MIN_DELTA = -128; 
const uint64_t MAX_LITERAL_SIZE = 128; 
 
RleEncoderV1::RleEncoderV1( 
                          std::unique_ptr<BufferedOutputStream> outStream, 
                          bool hasSigned): 
                          RleEncoder(std::move(outStream), hasSigned) { 
  literals = new int64_t[MAX_LITERAL_SIZE]; 
  delta = 0; 
  repeat = false; 
  tailRunLength = 0; 
} 
 
RleEncoderV1::~RleEncoderV1() { 
  delete [] literals; 
} 
 
void RleEncoderV1::writeValues() { 
  if (numLiterals != 0) { 
    if (repeat) { 
      writeByte(static_cast<char> 
                (static_cast<uint64_t>(numLiterals) - MINIMUM_REPEAT)); 
      writeByte(static_cast<char>(delta)); 
      if (isSigned) { 
        writeVslong(literals[0]); 
      } else { 
        writeVulong(literals[0]); 
      } 
    } else { 
      writeByte(static_cast<char>(-numLiterals)); 
      for(size_t i=0; i < numLiterals; ++i) { 
        if (isSigned) { 
          writeVslong(literals[i]); 
        } else { 
          writeVulong(literals[i]); 
        } 
      } 
    } 
    repeat = false; 
    numLiterals = 0; 
    tailRunLength = 0; 
  } 
} 
 
uint64_t RleEncoderV1::flush() { 
  writeValues(); 
  outputStream->BackUp(static_cast<int>(bufferLength - bufferPosition)); 
  uint64_t dataSize = outputStream->flush(); 
  bufferLength = bufferPosition = 0; 
  return dataSize; 
} 
 
void RleEncoderV1::write(int64_t value) { 
  if (numLiterals == 0) { 
    literals[numLiterals++] = value; 
    tailRunLength = 1; 
  } else if (repeat) { 
    if (value == literals[0] + delta * static_cast<int64_t>(numLiterals)) { 
      numLiterals += 1; 
      if (numLiterals == MAXIMUM_REPEAT) { 
        writeValues(); 
      } 
    } else { 
      writeValues(); 
      literals[numLiterals++] = value; 
      tailRunLength = 1; 
    } 
  } else { 
    if (tailRunLength == 1) { 
      delta = value - literals[numLiterals - 1]; 
      if (delta < MIN_DELTA || delta > MAX_DELTA) { 
        tailRunLength = 1; 
      } else { 
        tailRunLength = 2; 
      } 
    } else if (value == literals[numLiterals - 1] + delta) { 
      tailRunLength += 1; 
    } else { 
      delta = value - literals[numLiterals - 1]; 
      if (delta < MIN_DELTA || delta > MAX_DELTA) { 
        tailRunLength = 1; 
      } else { 
        tailRunLength = 2; 
      } 
    } 
    if (tailRunLength == MINIMUM_REPEAT) { 
      if (numLiterals + 1 == MINIMUM_REPEAT) { 
        repeat = true; 
        numLiterals += 1; 
      } else { 
        numLiterals -= static_cast<int>(MINIMUM_REPEAT - 1); 
        int64_t base = literals[numLiterals]; 
        writeValues(); 
        literals[0] = base; 
        repeat = true; 
        numLiterals = MINIMUM_REPEAT; 
      } 
    } else { 
      literals[numLiterals++] = value; 
      if (numLiterals == MAX_LITERAL_SIZE) { 
        writeValues(); 
      } 
    } 
  } 
} 
 
signed char RleDecoderV1::readByte() { 
  if (bufferStart == bufferEnd) { 
    int bufferLength; 
    const void* bufferPointer; 
    if (!inputStream->Next(&bufferPointer, &bufferLength)) { 
      throw ParseError("bad read in readByte"); 
    } 
    bufferStart = static_cast<const char*>(bufferPointer); 
    bufferEnd = bufferStart + bufferLength; 
  } 
  return *(bufferStart++); 
} 
 
uint64_t RleDecoderV1::readLong() { 
  uint64_t result = 0; 
  int64_t offset = 0; 
  signed char ch = readByte(); 
  if (ch >= 0) { 
    result = static_cast<uint64_t>(ch); 
  } else { 
    result = static_cast<uint64_t>(ch) & BASE_128_MASK; 
    while ((ch = readByte()) < 0) { 
      offset += 7; 
      result |= (static_cast<uint64_t>(ch) & BASE_128_MASK) << offset; 
    } 
    result |= static_cast<uint64_t>(ch) << (offset + 7); 
  } 
  return result; 
} 
 
void RleDecoderV1::skipLongs(uint64_t numValues) { 
  while (numValues > 0) { 
    if (readByte() >= 0) { 
      --numValues; 
    } 
  } 
} 
 
void RleDecoderV1::readHeader() { 
  signed char ch = readByte(); 
  if (ch < 0) { 
    remainingValues = static_cast<uint64_t>(-ch); 
    repeating = false; 
  } else { 
    remainingValues = static_cast<uint64_t>(ch) + MINIMUM_REPEAT; 
    repeating = true; 
    delta = readByte(); 
    value = isSigned 
        ? unZigZag(readLong()) 
        : static_cast<int64_t>(readLong()); 
  } 
} 
 
RleDecoderV1::RleDecoderV1(std::unique_ptr<SeekableInputStream> input, 
                           bool hasSigned) 
    : inputStream(std::move(input)), 
      isSigned(hasSigned), 
      remainingValues(0), 
      value(0), 
      bufferStart(nullptr), 
      bufferEnd(bufferStart), 
      delta(0), 
      repeating(false) { 
} 
 
void RleDecoderV1::seek(PositionProvider& location) { 
  // move the input stream 
  inputStream->seek(location); 
  // force a re-read from the stream 
  bufferEnd = bufferStart; 
  // read a new header 
  readHeader(); 
  // skip ahead the given number of records 
  skip(location.next()); 
} 
 
void RleDecoderV1::skip(uint64_t numValues) { 
  while (numValues > 0) { 
    if (remainingValues == 0) { 
      readHeader(); 
    } 
    uint64_t count = std::min(numValues, remainingValues); 
    remainingValues -= count; 
    numValues -= count; 
    if (repeating) { 
      value += delta * static_cast<int64_t>(count); 
    } else { 
      skipLongs(count); 
    } 
  } 
} 
 
void RleDecoderV1::next(int64_t* const data, 
                        const uint64_t numValues, 
                        const char* const notNull) { 
  uint64_t position = 0; 
  // skipNulls() 
  if (notNull) { 
    // Skip over null values. 
    while (position < numValues && !notNull[position]) { 
      ++position; 
    } 
  } 
  while (position < numValues) { 
    // If we are out of values, read more. 
    if (remainingValues == 0) { 
      readHeader(); 
    } 
    // How many do we read out of this block? 
    uint64_t count = std::min(numValues - position, remainingValues); 
    uint64_t consumed = 0; 
    if (repeating) { 
      if (notNull) { 
        for (uint64_t i = 0; i < count; ++i) { 
          if (notNull[position + i]) { 
            data[position + i] = value + static_cast<int64_t>(consumed) * delta; 
            consumed += 1; 
          } 
        } 
      } else { 
        for (uint64_t i = 0; i < count; ++i) { 
          data[position + i] = value + static_cast<int64_t>(i) * delta; 
        } 
        consumed = count; 
      } 
      value += static_cast<int64_t>(consumed) * delta; 
    } else { 
      if (notNull) { 
        for (uint64_t i = 0 ; i < count; ++i) { 
          if (notNull[position + i]) { 
            data[position + i] = isSigned 
                ? unZigZag(readLong()) 
                : static_cast<int64_t>(readLong()); 
            ++consumed; 
          } 
        } 
      } else { 
        if (isSigned) { 
          for (uint64_t i = 0; i < count; ++i) { 
            data[position + i] = unZigZag(readLong()); 
          } 
        } else { 
          for (uint64_t i = 0; i < count; ++i) { 
            data[position + i] = static_cast<int64_t>(readLong()); 
          } 
        } 
        consumed = count; 
      } 
    } 
    remainingValues -= consumed; 
    position += count; 
 
    // skipNulls() 
    if (notNull) { 
      // Skip over null values. 
      while (position < numValues && !notNull[position]) { 
        ++position; 
      } 
    } 
  } 
} 
 
}  // namespace orc