varint.h 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260
  1. #pragma once
  2. #include "byte_reader.h"
  3. #include "byte_writer.h"
  4. #include "traits.h"
  5. #include "zigzag.h"
  6. #include <util/system/types.h>
  7. #include <cstddef>
  8. #include <type_traits>
  9. namespace NYsonPull {
  10. namespace NDetail {
  11. namespace NVarInt {
  12. namespace NImpl {
  13. template <typename T>
  14. constexpr inline size_t max_size() {
  15. return (8 * sizeof(T) - 1) / 7 + 1;
  16. }
  17. template <typename T>
  18. inline size_t write(ui64 value, T&& consume) {
  19. auto stop = false;
  20. auto nwritten = size_t{0};
  21. while (!stop) {
  22. ++nwritten;
  23. auto byte = static_cast<ui8>(value | 0x80);
  24. value >>= 7;
  25. if (value == 0) {
  26. stop = true;
  27. byte &= 0x7F;
  28. }
  29. consume(byte);
  30. }
  31. return nwritten;
  32. }
  33. template <typename U>
  34. inline bool read_fast(byte_reader<U>& reader, ui64* value) {
  35. auto& buf = reader.stream().buffer();
  36. auto* ptr = buf.pos();
  37. ui32 b;
  38. // Splitting into 32-bit pieces gives better performance on 32-bit
  39. // processors.
  40. ui32 part0 = 0, part1 = 0, part2 = 0;
  41. b = *(ptr++);
  42. part0 = (b & 0x7F);
  43. if (!(b & 0x80))
  44. goto done;
  45. b = *(ptr++);
  46. part0 |= (b & 0x7F) << 7;
  47. if (!(b & 0x80))
  48. goto done;
  49. b = *(ptr++);
  50. part0 |= (b & 0x7F) << 14;
  51. if (!(b & 0x80))
  52. goto done;
  53. b = *(ptr++);
  54. part0 |= (b & 0x7F) << 21;
  55. if (!(b & 0x80))
  56. goto done;
  57. b = *(ptr++);
  58. part1 = (b & 0x7F);
  59. if (!(b & 0x80))
  60. goto done;
  61. b = *(ptr++);
  62. part1 |= (b & 0x7F) << 7;
  63. if (!(b & 0x80))
  64. goto done;
  65. b = *(ptr++);
  66. part1 |= (b & 0x7F) << 14;
  67. if (!(b & 0x80))
  68. goto done;
  69. b = *(ptr++);
  70. part1 |= (b & 0x7F) << 21;
  71. if (!(b & 0x80))
  72. goto done;
  73. b = *(ptr++);
  74. part2 = (b & 0x7F);
  75. if (!(b & 0x80))
  76. goto done;
  77. b = *(ptr++);
  78. part2 |= (b & 0x7F) << 7;
  79. if (!(b & 0x80))
  80. goto done;
  81. // We have overrun the maximum size of a Varint (10 bytes). The data
  82. // must be corrupt.
  83. return false;
  84. done:
  85. reader.advance(ptr - buf.pos());
  86. *value = (static_cast<ui64>(part0)) | (static_cast<ui64>(part1) << 28) | (static_cast<ui64>(part2) << 56);
  87. return true;
  88. }
  89. template <typename U>
  90. inline bool read_fast(byte_reader<U>& reader, ui32* value) {
  91. // Fast path: We have enough bytes left in the buffer to guarantee that
  92. // this read won't cross the end, so we can skip the checks.
  93. auto& buf = reader.stream().buffer();
  94. auto* ptr = buf.pos();
  95. ui32 b;
  96. ui32 result;
  97. b = *(ptr++);
  98. result = (b & 0x7F);
  99. if (!(b & 0x80))
  100. goto done;
  101. b = *(ptr++);
  102. result |= (b & 0x7F) << 7;
  103. if (!(b & 0x80))
  104. goto done;
  105. b = *(ptr++);
  106. result |= (b & 0x7F) << 14;
  107. if (!(b & 0x80))
  108. goto done;
  109. b = *(ptr++);
  110. result |= (b & 0x7F) << 21;
  111. if (!(b & 0x80))
  112. goto done;
  113. b = *(ptr++);
  114. result |= b << 28;
  115. if (!(b & 0x80))
  116. goto done;
  117. // FIXME
  118. // If the input is larger than 32 bits, we still need to read it all
  119. // and discard the high-order bits.
  120. for (size_t i = 0; i < max_size<ui64>() - max_size<ui32>(); i++) {
  121. b = *(ptr++);
  122. if (!(b & 0x80))
  123. goto done;
  124. }
  125. // We have overrun the maximum size of a Varint (10 bytes). Assume
  126. // the data is corrupt.
  127. return false;
  128. done:
  129. reader.advance(ptr - buf.pos());
  130. *value = result;
  131. return true;
  132. }
  133. template <typename U>
  134. inline bool read_slow(byte_reader<U>& reader, ui64* value) {
  135. // Slow path: This read might cross the end of the buffer, so we
  136. // need to check and refresh the buffer if and when it does.
  137. auto& buf = reader.stream().buffer();
  138. ui64 result = 0;
  139. int count = 0;
  140. ui32 b;
  141. do {
  142. if (count == max_size<ui64>()) {
  143. return false;
  144. }
  145. reader.fill_buffer();
  146. if (reader.stream().at_end()) {
  147. return false;
  148. }
  149. b = *buf.pos();
  150. result |= static_cast<ui64>(b & 0x7F) << (7 * count);
  151. reader.advance(1);
  152. ++count;
  153. } while (b & 0x80);
  154. *value = result;
  155. return true;
  156. }
  157. template <typename U>
  158. inline bool read_slow(byte_reader<U>& reader, ui32* value) {
  159. ui64 result;
  160. // fallback to 64-bit reading
  161. if (read_slow(reader, &result) && result <= std::numeric_limits<ui32>::max()) {
  162. *value = static_cast<ui32>(result);
  163. return true;
  164. }
  165. return false;
  166. }
  167. // Following functions is an adaptation
  168. // of Protobuf code from coded_stream.cc
  169. template <typename T, typename U>
  170. inline bool read_dispatch(byte_reader<U>& reader, T* value) {
  171. auto& buf = reader.stream().buffer();
  172. // NOTE: checking for 64-bit max_size(), since 32-bit
  173. // read_fast() might fallback to 64-bit reading
  174. if (buf.available() >= max_size<ui64>() ||
  175. // Optimization: If the Varint ends at exactly the end of the buffer,
  176. // we can detect that and still use the fast path.
  177. (!buf.is_empty() && !(buf.end()[-1] & 0x80)))
  178. {
  179. return read_fast(reader, value);
  180. } else {
  181. // Really slow case: we will incur the cost of an extra function call here,
  182. // but moving this out of line reduces the size of this function, which
  183. // improves the common case. In micro benchmarks, this is worth about 10-15%
  184. return read_slow(reader, value);
  185. }
  186. }
  187. }
  188. // Various functions to read/write varints.
  189. // Returns the number of bytes written.
  190. template <typename T>
  191. inline NTraits::if_unsigned<T, size_t> write(ui8* data, T value) {
  192. return NImpl::write(
  193. static_cast<ui64>(value),
  194. [&](ui8 byte) { *data++ = byte; });
  195. }
  196. template <typename T>
  197. inline NTraits::if_signed<T, size_t> write(ui8* data, T value) {
  198. return NImpl::write(
  199. static_cast<ui64>(NZigZag::encode(value)),
  200. [&](ui8 byte) { *data++ = byte; });
  201. }
  202. template <typename T, typename U>
  203. inline void write(byte_writer<U>& stream, T value) {
  204. ui8 data[NImpl::max_size<T>()];
  205. auto size = write(data, value);
  206. stream.write(data, size);
  207. }
  208. template <typename T, typename U>
  209. inline NTraits::if_unsigned<T, T> read(byte_reader<U>& reader) {
  210. auto value = T{};
  211. auto& buf = reader.stream().buffer();
  212. if (!buf.is_empty() && *buf.pos() < 0x80) {
  213. value = *buf.pos();
  214. reader.advance(1);
  215. return value;
  216. }
  217. if (Y_UNLIKELY(!NImpl::read_dispatch(reader, &value))) {
  218. reader.fail("Error parsing varint value");
  219. }
  220. return value;
  221. }
  222. template <typename T, typename U>
  223. inline NTraits::if_signed<T, T> read(byte_reader<U>& reader) {
  224. return NZigZag::decode(
  225. read<NTraits::to_unsigned<T>>(reader));
  226. }
  227. }
  228. } // namespace NDetail
  229. }