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
|
/*-
* Copyright 2016 UPLEX - Nils Goroll Systemoptimierung
* All rights reserved.
*
* Authors: Nils Goroll <nils.goroll@uplex.de>
* Geoffrey Simmons <geoffrey.simmons@uplex.de>
*
* SPDX-License-Identifier: BSD-2-Clause
*
* 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 AUTHOR 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 AUTHOR 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.
*
*/
#include "config.h"
#include <ctype.h>
#include "vdef.h"
#include "vrt.h"
#include "vas.h"
#include "vmod_blob.h"
const char hex_alphabet[][17] = {
"0123456789abcdef",
"0123456789ABCDEF"
};
/*
* Shift the ASCII table over so that it begins at '0', and replace the
* hex digits with their binary values. This fits all of the hex digits
* into 55 bytes (cacheline friendly).
*/
const uint8_t hex_nibble[] = {
0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
ILL, ILL, ILL, ILL, ILL, ILL, ILL, 10, 11, 12,
13, 14, 15, ILL, ILL, ILL, ILL, ILL, ILL, ILL,
ILL, ILL, ILL, ILL, ILL, ILL, ILL, ILL, ILL, ILL,
ILL, ILL, ILL, ILL, ILL, ILL, ILL, ILL, ILL, 10,
11, 12, 13, 14, 15
};
size_t
hex_encode_l(size_t l)
{
return ((l << 1) + 1);
}
size_t
hex_decode_l(size_t l)
{
return ((l + 1) >> 1);
}
static inline char
hex2byte(const unsigned char hi, const unsigned char lo)
{
return ((hex_nibble[hi - '0'] << 4) | hex_nibble[lo - '0']);
}
ssize_t
hex_encode(const enum encoding enc, const enum case_e kase,
blob_dest_t buf, blob_len_t buflen,
blob_src_t in, blob_len_t inlen)
{
char *p = buf;
const char *alphabet = hex_alphabet[0];
size_t i;
AN(buf);
assert(enc == HEX);
if (in == NULL || inlen == 0)
return (0);
if (buflen < hex_encode_l(inlen))
return (-1);
if (kase == UPPER)
alphabet = hex_alphabet[1];
for (i = 0; i < inlen; i++) {
*p++ = alphabet[(in[i] & 0xf0) >> 4];
*p++ = alphabet[in[i] & 0x0f];
}
return (p - buf);
}
ssize_t
hex_decode(const enum encoding dec, blob_dest_t buf,
blob_len_t buflen, ssize_t n, VCL_STRANDS strings)
{
char *dest = buf;
const char *b, *s;
unsigned char extranib = 0;
size_t len = 0;
int i;
AN(buf);
AN(strings);
assert(dec == HEX);
for (i = 0; i < strings->n; i++) {
s = strings->p[i];
if (s == NULL)
continue;
b = s;
while (*s) {
if (!isxdigit(*s++)) {
errno = EINVAL;
return (-1);
}
}
len += s - b;
}
if (len == 0)
return (0);
if (n >= 0 && len > (size_t)n)
len = n;
if (((len+1) >> 1) > buflen) {
errno = ENOMEM;
return (-1);
}
if (len & 1) {
extranib = '0';
len++;
}
for (i = 0; len > 0 && i < strings->n; i++) {
s = strings->p[i];
if (s == NULL || *s == '\0')
continue;
if (extranib) {
*dest++ = hex2byte(extranib, *s++);
len -= 2;
}
while (len >= 2 && *s && *(s+1)) {
*dest++ = hex2byte(*s, *(s+1));
s += 2;
len -= 2;
}
extranib = *s;
}
assert(dest <= buf + buflen);
return (dest - buf);
}
|
