-
Notifications
You must be signed in to change notification settings - Fork 23
/
rdencoding.c
176 lines (137 loc) · 3.97 KB
/
rdencoding.c
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
/*
* librd - Rapid Development C library
*
* Copyright (c) 2012-2013, Magnus Edenhill
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/**
* Various encoding/decoding schemes.
*/
#include "rdencoding.h"
uint64_t rd_varint_decode_u64 (const void *buf,
size_t size, int *vlenp) {
const unsigned char *s = buf;
const unsigned char *end = s + size;
uint64_t uval = 0;
int bits = 0;
*vlenp = 0;
while (&s[*vlenp] < end) {
if (s[*vlenp] < 0x80) {
if (*vlenp > 9) {
/* Overflow */
*vlenp = -*vlenp;
return 0;
}
return uval | (((uint64_t)s[(*vlenp)++]) << bits);
}
uval |= ((uint64_t)(s[(*vlenp)++] & 0x7f)) << bits;
bits += 7;
}
if (*vlenp == 0 || s[(*vlenp)-1] >= 0x80) {
/* Buffer underflow, indicate that we need more data. */
*vlenp = -((*vlenp)+1);
}
return 0;
}
int64_t rd_varint_decode_s64 (const void *buf, size_t size, int *vlenp) {
uint64_t uval;
int64_t val;
uval = rd_varint_decode_u64(buf, size, vlenp);
if (*vlenp <= 0)
return 0;
val = uval >> 1;
if (uval & 1)
val ^= val;
return val;
}
int rd_varint_encode_u64 (uint64_t uval, void *dest, size_t size) {
unsigned char *s = dest;
const unsigned char *end = s + size;
while (uval >= 0x80) {
if (s >= end)
return -1;
*(s++) = (uval & 0xff) | 0x80;
uval >>= 7;
}
if (s >= end)
return -1;
*(s++) = uval & 0xff;
return (int)(s - (unsigned char *)dest);
}
int rd_varint_encode_s64 (int64_t val, void *dest, size_t size) {
uint64_t uval = (uint64_t)val << 1;
if (val < 0)
uval ^= uval;
return rd_varint_encode_u64(uval, dest, size);
}
int rd_hex2bin (const char *hexstr, int inlen, char *dst, int dstlen) {
const char *end = inlen == -1 ?
(const char *)UINTPTR_MAX : hexstr+inlen;
const char *s = hexstr;
char *d = dst;
char *dend = dst + dstlen;
int state = 0;
static const char ignore[256] = {
[' '] = 1, ['\t'] = 1, ['.'] = 1, [':'] = 1,
['\n'] = 1, ['\r'] = 1,
};
while (*s && s < end && d < dend) {
char c;
if (ignore[(int)*s]) {
s++;
continue;
}
if (*s >= '0' && *s <= '9')
c = *s - '0';
else if (*s >= 'A' && *s <= 'F')
c = *s - 'A' + 10;
else if (*s >= 'a' && *s <= 'f')
c = *s - 'a' + 10;
else
break;
if (state++ & 1)
*(d++) |= c;
else
*d = c << 4;
s++;
}
return (int)(d-dst);
}
int rd_bin2hex (const char *bin, int inlen, char *dst, int dstlen) {
const char *end = bin+inlen;
const char *s = bin;
char *d = dst;
char *dend = dst + dstlen;
static const char map[16] = {
'0', '1', '2', '3', '4', '5', '6', '7',
'8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };
while (s < end && d+3 < dend) {
*d++ = map[(*s & 0xff) >> 4];
*d++ = map[*s & 0x0f];
s++;
}
if (d < dend)
*d = '\0';
return (int)(d - dst);
}