xref: /dragonfly/libexec/dma/base64.c (revision 1765f996)
1f67bedddSMatthias Schmidt /*
2*1765f996Szrj  * Copyright (c) 1995-2001 Kungliga Tekniska Högskolan
3f67bedddSMatthias Schmidt  * (Royal Institute of Technology, Stockholm, Sweden).
4f67bedddSMatthias Schmidt  * All rights reserved.
5f67bedddSMatthias Schmidt  *
6f67bedddSMatthias Schmidt  * Redistribution and use in source and binary forms, with or without
7f67bedddSMatthias Schmidt  * modification, are permitted provided that the following conditions
8f67bedddSMatthias Schmidt  * are met:
9f67bedddSMatthias Schmidt  *
10f67bedddSMatthias Schmidt  * 1. Redistributions of source code must retain the above copyright
11f67bedddSMatthias Schmidt  *    notice, this list of conditions and the following disclaimer.
12f67bedddSMatthias Schmidt  *
13f67bedddSMatthias Schmidt  * 2. Redistributions in binary form must reproduce the above copyright
14f67bedddSMatthias Schmidt  *    notice, this list of conditions and the following disclaimer in the
15f67bedddSMatthias Schmidt  *    documentation and/or other materials provided with the distribution.
16f67bedddSMatthias Schmidt  *
17f67bedddSMatthias Schmidt  * 3. Neither the name of the Institute nor the names of its contributors
18f67bedddSMatthias Schmidt  *    may be used to endorse or promote products derived from this software
19f67bedddSMatthias Schmidt  *    without specific prior written permission.
20f67bedddSMatthias Schmidt  *
21f67bedddSMatthias Schmidt  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22f67bedddSMatthias Schmidt  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23f67bedddSMatthias Schmidt  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24f67bedddSMatthias Schmidt  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25f67bedddSMatthias Schmidt  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26f67bedddSMatthias Schmidt  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27f67bedddSMatthias Schmidt  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28f67bedddSMatthias Schmidt  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29f67bedddSMatthias Schmidt  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30f67bedddSMatthias Schmidt  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31f67bedddSMatthias Schmidt  * SUCH DAMAGE.
32f67bedddSMatthias Schmidt  */
33f67bedddSMatthias Schmidt 
34f67bedddSMatthias Schmidt #include <stdlib.h>
35f67bedddSMatthias Schmidt #include <string.h>
36f67bedddSMatthias Schmidt 
37bc7baf1dSSascha Wildner #include "dma.h"
38f67bedddSMatthias Schmidt 
39f67bedddSMatthias Schmidt static char base64_chars[] =
40f67bedddSMatthias Schmidt     "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
41f67bedddSMatthias Schmidt 
427b68d8aeSMatthias Schmidt static int
pos(char c)437b68d8aeSMatthias Schmidt pos(char c)
447b68d8aeSMatthias Schmidt {
457b68d8aeSMatthias Schmidt 	char *p;
467b68d8aeSMatthias Schmidt 	for (p = base64_chars; *p; p++)
477b68d8aeSMatthias Schmidt 		if (*p == c)
487b68d8aeSMatthias Schmidt 			return p - base64_chars;
497b68d8aeSMatthias Schmidt 	return -1;
507b68d8aeSMatthias Schmidt }
517b68d8aeSMatthias Schmidt 
527b68d8aeSMatthias Schmidt 
53f67bedddSMatthias Schmidt int
base64_encode(const void * data,int size,char ** str)54f67bedddSMatthias Schmidt base64_encode(const void *data, int size, char **str)
55f67bedddSMatthias Schmidt {
56f67bedddSMatthias Schmidt     char *s, *p;
57f67bedddSMatthias Schmidt     int i;
58f67bedddSMatthias Schmidt     int c;
59f67bedddSMatthias Schmidt     const unsigned char *q;
60f67bedddSMatthias Schmidt 
61f67bedddSMatthias Schmidt     p = s = (char *) malloc(size * 4 / 3 + 4);
62f67bedddSMatthias Schmidt     if (p == NULL)
63f67bedddSMatthias Schmidt 	return -1;
64f67bedddSMatthias Schmidt     q = (const unsigned char *) data;
65f67bedddSMatthias Schmidt     i = 0;
66f67bedddSMatthias Schmidt     for (i = 0; i < size;) {
67f67bedddSMatthias Schmidt 	c = q[i++];
68f67bedddSMatthias Schmidt 	c *= 256;
69f67bedddSMatthias Schmidt 	if (i < size)
70f67bedddSMatthias Schmidt 	    c += q[i];
71f67bedddSMatthias Schmidt 	i++;
72f67bedddSMatthias Schmidt 	c *= 256;
73f67bedddSMatthias Schmidt 	if (i < size)
74f67bedddSMatthias Schmidt 	    c += q[i];
75f67bedddSMatthias Schmidt 	i++;
76f67bedddSMatthias Schmidt 	p[0] = base64_chars[(c & 0x00fc0000) >> 18];
77f67bedddSMatthias Schmidt 	p[1] = base64_chars[(c & 0x0003f000) >> 12];
78f67bedddSMatthias Schmidt 	p[2] = base64_chars[(c & 0x00000fc0) >> 6];
79f67bedddSMatthias Schmidt 	p[3] = base64_chars[(c & 0x0000003f) >> 0];
80f67bedddSMatthias Schmidt 	if (i > size)
81f67bedddSMatthias Schmidt 	    p[3] = '=';
82f67bedddSMatthias Schmidt 	if (i > size + 1)
83f67bedddSMatthias Schmidt 	    p[2] = '=';
84f67bedddSMatthias Schmidt 	p += 4;
85f67bedddSMatthias Schmidt     }
86f67bedddSMatthias Schmidt     *p = 0;
87f67bedddSMatthias Schmidt     *str = s;
88f67bedddSMatthias Schmidt     return strlen(s);
89f67bedddSMatthias Schmidt }
90f67bedddSMatthias Schmidt 
917b68d8aeSMatthias Schmidt #define DECODE_ERROR 0xffffffff
927b68d8aeSMatthias Schmidt 
937b68d8aeSMatthias Schmidt static unsigned int
token_decode(const char * token)947b68d8aeSMatthias Schmidt token_decode(const char *token)
957b68d8aeSMatthias Schmidt {
967b68d8aeSMatthias Schmidt 	int i;
977b68d8aeSMatthias Schmidt 	unsigned int val = 0;
987b68d8aeSMatthias Schmidt 	int marker = 0;
997b68d8aeSMatthias Schmidt 	if (strlen(token) < 4)
1007b68d8aeSMatthias Schmidt 		return DECODE_ERROR;
1017b68d8aeSMatthias Schmidt 	for (i = 0; i < 4; i++) {
1027b68d8aeSMatthias Schmidt 		val *= 64;
1037b68d8aeSMatthias Schmidt 		if (token[i] == '=')
1047b68d8aeSMatthias Schmidt 			marker++;
1057b68d8aeSMatthias Schmidt 		else if (marker > 0)
1067b68d8aeSMatthias Schmidt 			return DECODE_ERROR;
1077b68d8aeSMatthias Schmidt 		else
1087b68d8aeSMatthias Schmidt 			val += pos(token[i]);
1097b68d8aeSMatthias Schmidt 	}
1107b68d8aeSMatthias Schmidt 	if (marker > 2)
1117b68d8aeSMatthias Schmidt 		return DECODE_ERROR;
1127b68d8aeSMatthias Schmidt 	return (marker << 24) | val;
1137b68d8aeSMatthias Schmidt }
1147b68d8aeSMatthias Schmidt 
1157b68d8aeSMatthias Schmidt int
base64_decode(const char * str,void * data)1167b68d8aeSMatthias Schmidt base64_decode(const char *str, void *data)
1177b68d8aeSMatthias Schmidt {
1187b68d8aeSMatthias Schmidt 	const char *p;
1197b68d8aeSMatthias Schmidt 	unsigned char *q;
1207b68d8aeSMatthias Schmidt 
1217b68d8aeSMatthias Schmidt 	q = data;
1227b68d8aeSMatthias Schmidt 	for (p = str; *p && (*p == '=' || strchr(base64_chars, *p)); p += 4) {
1237b68d8aeSMatthias Schmidt 		unsigned int val = token_decode(p);
1247b68d8aeSMatthias Schmidt 		unsigned int marker = (val >> 24) & 0xff;
1257b68d8aeSMatthias Schmidt 		if (val == DECODE_ERROR)
1267b68d8aeSMatthias Schmidt 			return -1;
1277b68d8aeSMatthias Schmidt 		*q++ = (val >> 16) & 0xff;
1287b68d8aeSMatthias Schmidt 		if (marker < 2)
1297b68d8aeSMatthias Schmidt 			*q++ = (val >> 8) & 0xff;
1307b68d8aeSMatthias Schmidt 		if (marker < 1)
1317b68d8aeSMatthias Schmidt 			*q++ = val & 0xff;
1327b68d8aeSMatthias Schmidt 	}
1337b68d8aeSMatthias Schmidt 	return q - (unsigned char *) data;
1347b68d8aeSMatthias Schmidt }
1357b68d8aeSMatthias Schmidt 
136