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
|
/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2008 Sun Microsystems
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; version 2 of the License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef DRIZZLED_SERIALIZE_BINLOG_ENCODING_H
#define DRIZZLED_SERIALIZE_BINLOG_ENCODING_H
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <stdint.h>
#define LENGTH_ENCODE_MAX_BYTES (sizeof(std::size_t) + 1)
inline unsigned char *
length_encode(std::size_t length, unsigned char *buf)
{
unsigned char *ptr= buf;
assert(length > 1);
if (length < 256)
{
*ptr++= static_cast<unsigned char>((length & 0xFF));
}
else
{
int_fast8_t log2m1= -1; // ceil(log2(ptr - buf)) - 1
uint_fast8_t pow2= 1; // pow2(log2m1 + 1)
while (length > 0)
{
// Check the invariants
assert((static_cast<int_fast8_t>(pow2)) == (1 << (log2m1 + 1)));
assert((ptr - buf) <= (1 << (log2m1 + 1)));
// Write the least significant byte of the current
// length. Prefix increment is used to make space for the first
// byte that will hold log2m1.
*++ptr= static_cast<unsigned char>(length & 0xFF);
length >>= 8;
// Ensure the invariant holds by correcting it if it doesn't,
// that is, the number of bytes written is greater than the
// nearest power of two.
if (ptr - buf > pow2)
{
++log2m1;
pow2= static_cast<int_fast8_t>(pow2 << 1);
}
}
// Clear the remaining bytes up to the next power of two
std::memset(ptr + 1, 0, pow2 - (ptr - buf));
*buf= log2m1;
ptr= buf + pow2 + 1;
}
return ptr;
}
inline unsigned char *
length_decode(unsigned char *buf, std::size_t *plen)
{
if (*buf > 1)
{
*plen = *buf;
return buf + 1;
}
std::size_t bytes= 1 << (*buf + 1);
unsigned char *ptr= buf + 1;
std::size_t length= 0;
for (unsigned int i = 0 ; i < bytes ; ++i)
length |= *ptr++ << (8 * i);
*plen= length;
return ptr;
}
/**
Compute how many bytes are use for the length.
The number of bytes that make up th length can be computed based on
the first byte of the length field. By supplying this byte to the
function, the number of bytes that is needed for the length is
computed.
*/
inline std::size_t
length_decode_bytes(int peek)
{
return (peek < 2) ? (1 << (peek + 1)) + 1 : 1;
}
#endif /* DRIZZLED_SERIALIZE_BINLOG_ENCODING_H */
|