1c19800e8SDoug Rabson /*
2*ae771770SStanislav Sedov * Copyright (c) 2004-2005 Kungliga Tekniska Högskolan
3c19800e8SDoug Rabson * (Royal Institute of Technology, Stockholm, Sweden).
4c19800e8SDoug Rabson * All rights reserved.
5c19800e8SDoug Rabson *
6c19800e8SDoug Rabson * Redistribution and use in source and binary forms, with or without
7c19800e8SDoug Rabson * modification, are permitted provided that the following conditions
8c19800e8SDoug Rabson * are met:
9c19800e8SDoug Rabson *
10c19800e8SDoug Rabson * 1. Redistributions of source code must retain the above copyright
11c19800e8SDoug Rabson * notice, this list of conditions and the following disclaimer.
12c19800e8SDoug Rabson *
13c19800e8SDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright
14c19800e8SDoug Rabson * notice, this list of conditions and the following disclaimer in the
15c19800e8SDoug Rabson * documentation and/or other materials provided with the distribution.
16c19800e8SDoug Rabson *
17c19800e8SDoug Rabson * 3. Neither the name of the Institute nor the names of its contributors
18c19800e8SDoug Rabson * may be used to endorse or promote products derived from this software
19c19800e8SDoug Rabson * without specific prior written permission.
20c19800e8SDoug Rabson *
21c19800e8SDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22c19800e8SDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23c19800e8SDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24c19800e8SDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25c19800e8SDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26c19800e8SDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27c19800e8SDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28c19800e8SDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29c19800e8SDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30c19800e8SDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31c19800e8SDoug Rabson * SUCH DAMAGE.
32c19800e8SDoug Rabson */
33c19800e8SDoug Rabson
34*ae771770SStanislav Sedov
35c19800e8SDoug Rabson #include <config.h>
36c19800e8SDoug Rabson #include "roken.h"
37c19800e8SDoug Rabson #include <ctype.h>
38c19800e8SDoug Rabson #include "hex.h"
39c19800e8SDoug Rabson
40*ae771770SStanislav Sedov static const char hexchar[16] = "0123456789ABCDEF";
41c19800e8SDoug Rabson
42c19800e8SDoug Rabson static int
pos(char c)43c19800e8SDoug Rabson pos(char c)
44c19800e8SDoug Rabson {
45c19800e8SDoug Rabson const char *p;
46c19800e8SDoug Rabson c = toupper((unsigned char)c);
47c19800e8SDoug Rabson for (p = hexchar; *p; p++)
48c19800e8SDoug Rabson if (*p == c)
49c19800e8SDoug Rabson return p - hexchar;
50c19800e8SDoug Rabson return -1;
51c19800e8SDoug Rabson }
52c19800e8SDoug Rabson
53*ae771770SStanislav Sedov ROKEN_LIB_FUNCTION ssize_t ROKEN_LIB_CALL
hex_encode(const void * data,size_t size,char ** str)54c19800e8SDoug Rabson hex_encode(const void *data, size_t size, char **str)
55c19800e8SDoug Rabson {
56c19800e8SDoug Rabson const unsigned char *q = data;
57c19800e8SDoug Rabson size_t i;
58c19800e8SDoug Rabson char *p;
59c19800e8SDoug Rabson
60c19800e8SDoug Rabson /* check for overflow */
61*ae771770SStanislav Sedov if (size * 2 < size) {
62*ae771770SStanislav Sedov *str = NULL;
63c19800e8SDoug Rabson return -1;
64*ae771770SStanislav Sedov }
65c19800e8SDoug Rabson
66c19800e8SDoug Rabson p = malloc(size * 2 + 1);
67*ae771770SStanislav Sedov if (p == NULL) {
68*ae771770SStanislav Sedov *str = NULL;
69c19800e8SDoug Rabson return -1;
70*ae771770SStanislav Sedov }
71c19800e8SDoug Rabson
72c19800e8SDoug Rabson for (i = 0; i < size; i++) {
73c19800e8SDoug Rabson p[i * 2] = hexchar[(*q >> 4) & 0xf];
74c19800e8SDoug Rabson p[i * 2 + 1] = hexchar[*q & 0xf];
75c19800e8SDoug Rabson q++;
76c19800e8SDoug Rabson }
77c19800e8SDoug Rabson p[i * 2] = '\0';
78c19800e8SDoug Rabson *str = p;
79c19800e8SDoug Rabson
80c19800e8SDoug Rabson return i * 2;
81c19800e8SDoug Rabson }
82c19800e8SDoug Rabson
83*ae771770SStanislav Sedov ROKEN_LIB_FUNCTION ssize_t ROKEN_LIB_CALL
hex_decode(const char * str,void * data,size_t len)84c19800e8SDoug Rabson hex_decode(const char *str, void *data, size_t len)
85c19800e8SDoug Rabson {
86c19800e8SDoug Rabson size_t l;
87c19800e8SDoug Rabson unsigned char *p = data;
88c19800e8SDoug Rabson size_t i;
89c19800e8SDoug Rabson
90c19800e8SDoug Rabson l = strlen(str);
91c19800e8SDoug Rabson
92c19800e8SDoug Rabson /* check for overflow, same as (l+1)/2 but overflow safe */
93c19800e8SDoug Rabson if ((l/2) + (l&1) > len)
94c19800e8SDoug Rabson return -1;
95c19800e8SDoug Rabson
96c19800e8SDoug Rabson if (l & 1) {
97c19800e8SDoug Rabson p[0] = pos(str[0]);
98c19800e8SDoug Rabson str++;
99c19800e8SDoug Rabson p++;
100c19800e8SDoug Rabson }
101c19800e8SDoug Rabson for (i = 0; i < l / 2; i++)
102c19800e8SDoug Rabson p[i] = pos(str[i * 2]) << 4 | pos(str[(i * 2) + 1]);
103c19800e8SDoug Rabson return i + (l & 1);
104c19800e8SDoug Rabson }
105