1/*
2 * Copyright (c) 2011-12 Apple Inc. All Rights Reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
11 * file.
12 *
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
20 *
21 * @APPLE_LICENSE_HEADER_END@
22 */
23/*
24 * Copyright (c) 2004-2005 Kungliga Tekniska Högskolan
25 * (Royal Institute of Technology, Stockholm, Sweden).
26 * All rights reserved.
27 *
28 * Redistribution and use in source and binary forms, with or without
29 * modification, are permitted provided that the following conditions
30 * are met:
31 *
32 * 1. Redistributions of source code must retain the above copyright
33 *    notice, this list of conditions and the following disclaimer.
34 *
35 * 2. Redistributions in binary form must reproduce the above copyright
36 *    notice, this list of conditions and the following disclaimer in the
37 *    documentation and/or other materials provided with the distribution.
38 *
39 * 3. Neither the name of the Institute nor the names of its contributors
40 *    may be used to endorse or promote products derived from this software
41 *    without specific prior written permission.
42 *
43 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
44 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
47 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * SUCH DAMAGE.
54 */
55
56
57#include "ossl-config.h"
58
59/* #include "rk-roken.h" */
60
61#include <ctype.h>
62#include <stdlib.h>
63#include <string.h>
64
65#include "hex.h"
66
67static const char hexchar[16] = "0123456789ABCDEF";
68
69static int
70pos(char c)
71{
72    const char *p;
73    c = toupper((unsigned char)c);
74    for (p = hexchar; *p; p++)
75	if (*p == c)
76	    return p - hexchar;
77    return -1;
78}
79
80ROKEN_LIB_FUNCTION ssize_t ROKEN_LIB_CALL
81hex_encode(const void *data, size_t size, char **str)
82{
83    const unsigned char *q = data;
84    size_t i;
85    char *p;
86
87    /* check for overflow */
88    if (size * 2 < size) {
89        *str = NULL;
90	return -1;
91    }
92
93    p = malloc(size * 2 + 1);
94    if (p == NULL) {
95        *str = NULL;
96	return -1;
97    }
98
99    for (i = 0; i < size; i++) {
100	p[i * 2] = hexchar[(*q >> 4) & 0xf];
101	p[i * 2 + 1] = hexchar[*q & 0xf];
102	q++;
103    }
104    p[i * 2] = '\0';
105    *str = p;
106
107    return i * 2;
108}
109
110ROKEN_LIB_FUNCTION ssize_t ROKEN_LIB_CALL
111hex_decode(const char *str, void *data, size_t len)
112{
113    size_t l;
114    unsigned char *p = data;
115    size_t i;
116
117    l = strlen(str);
118
119    /* check for overflow, same as (l+1)/2 but overflow safe */
120    if ((l/2) + (l&1) > len)
121	return -1;
122
123    if (l & 1) {
124	p[0] = pos(str[0]);
125	str++;
126	p++;
127    }
128    for (i = 0; i < l / 2; i++)
129	p[i] = pos(str[i * 2]) << 4 | pos(str[(i * 2) + 1]);
130    return i + (l & 1);
131}
132