1*a9e8641dSBaptiste Daroussin /*
2*a9e8641dSBaptiste Daroussin * Copyright (c) 1995-2001 Kungliga Tekniska H�gskolan
3*a9e8641dSBaptiste Daroussin * (Royal Institute of Technology, Stockholm, Sweden).
4*a9e8641dSBaptiste Daroussin * All rights reserved.
5*a9e8641dSBaptiste Daroussin *
6*a9e8641dSBaptiste Daroussin * Redistribution and use in source and binary forms, with or without
7*a9e8641dSBaptiste Daroussin * modification, are permitted provided that the following conditions
8*a9e8641dSBaptiste Daroussin * are met:
9*a9e8641dSBaptiste Daroussin *
10*a9e8641dSBaptiste Daroussin * 1. Redistributions of source code must retain the above copyright
11*a9e8641dSBaptiste Daroussin * notice, this list of conditions and the following disclaimer.
12*a9e8641dSBaptiste Daroussin *
13*a9e8641dSBaptiste Daroussin * 2. Redistributions in binary form must reproduce the above copyright
14*a9e8641dSBaptiste Daroussin * notice, this list of conditions and the following disclaimer in the
15*a9e8641dSBaptiste Daroussin * documentation and/or other materials provided with the distribution.
16*a9e8641dSBaptiste Daroussin *
17*a9e8641dSBaptiste Daroussin * 3. Neither the name of the Institute nor the names of its contributors
18*a9e8641dSBaptiste Daroussin * may be used to endorse or promote products derived from this software
19*a9e8641dSBaptiste Daroussin * without specific prior written permission.
20*a9e8641dSBaptiste Daroussin *
21*a9e8641dSBaptiste Daroussin * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22*a9e8641dSBaptiste Daroussin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*a9e8641dSBaptiste Daroussin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*a9e8641dSBaptiste Daroussin * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25*a9e8641dSBaptiste Daroussin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*a9e8641dSBaptiste Daroussin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*a9e8641dSBaptiste Daroussin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*a9e8641dSBaptiste Daroussin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*a9e8641dSBaptiste Daroussin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*a9e8641dSBaptiste Daroussin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*a9e8641dSBaptiste Daroussin * SUCH DAMAGE.
32*a9e8641dSBaptiste Daroussin */
33*a9e8641dSBaptiste Daroussin
34*a9e8641dSBaptiste Daroussin #include <stdlib.h>
35*a9e8641dSBaptiste Daroussin #include <string.h>
36*a9e8641dSBaptiste Daroussin
37*a9e8641dSBaptiste Daroussin #include "dma.h"
38*a9e8641dSBaptiste Daroussin
39*a9e8641dSBaptiste Daroussin static char base64_chars[] =
40*a9e8641dSBaptiste Daroussin "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
41*a9e8641dSBaptiste Daroussin
42*a9e8641dSBaptiste Daroussin static int
pos(char c)43*a9e8641dSBaptiste Daroussin pos(char c)
44*a9e8641dSBaptiste Daroussin {
45*a9e8641dSBaptiste Daroussin char *p;
46*a9e8641dSBaptiste Daroussin for (p = base64_chars; *p; p++)
47*a9e8641dSBaptiste Daroussin if (*p == c)
48*a9e8641dSBaptiste Daroussin return p - base64_chars;
49*a9e8641dSBaptiste Daroussin return -1;
50*a9e8641dSBaptiste Daroussin }
51*a9e8641dSBaptiste Daroussin
52*a9e8641dSBaptiste Daroussin
53*a9e8641dSBaptiste Daroussin int
base64_encode(const void * data,int size,char ** str)54*a9e8641dSBaptiste Daroussin base64_encode(const void *data, int size, char **str)
55*a9e8641dSBaptiste Daroussin {
56*a9e8641dSBaptiste Daroussin char *s, *p;
57*a9e8641dSBaptiste Daroussin int i;
58*a9e8641dSBaptiste Daroussin int c;
59*a9e8641dSBaptiste Daroussin const unsigned char *q;
60*a9e8641dSBaptiste Daroussin
61*a9e8641dSBaptiste Daroussin p = s = (char *) malloc(size * 4 / 3 + 4);
62*a9e8641dSBaptiste Daroussin if (p == NULL)
63*a9e8641dSBaptiste Daroussin return -1;
64*a9e8641dSBaptiste Daroussin q = (const unsigned char *) data;
65*a9e8641dSBaptiste Daroussin i = 0;
66*a9e8641dSBaptiste Daroussin for (i = 0; i < size;) {
67*a9e8641dSBaptiste Daroussin c = q[i++];
68*a9e8641dSBaptiste Daroussin c *= 256;
69*a9e8641dSBaptiste Daroussin if (i < size)
70*a9e8641dSBaptiste Daroussin c += q[i];
71*a9e8641dSBaptiste Daroussin i++;
72*a9e8641dSBaptiste Daroussin c *= 256;
73*a9e8641dSBaptiste Daroussin if (i < size)
74*a9e8641dSBaptiste Daroussin c += q[i];
75*a9e8641dSBaptiste Daroussin i++;
76*a9e8641dSBaptiste Daroussin p[0] = base64_chars[(c & 0x00fc0000) >> 18];
77*a9e8641dSBaptiste Daroussin p[1] = base64_chars[(c & 0x0003f000) >> 12];
78*a9e8641dSBaptiste Daroussin p[2] = base64_chars[(c & 0x00000fc0) >> 6];
79*a9e8641dSBaptiste Daroussin p[3] = base64_chars[(c & 0x0000003f) >> 0];
80*a9e8641dSBaptiste Daroussin if (i > size)
81*a9e8641dSBaptiste Daroussin p[3] = '=';
82*a9e8641dSBaptiste Daroussin if (i > size + 1)
83*a9e8641dSBaptiste Daroussin p[2] = '=';
84*a9e8641dSBaptiste Daroussin p += 4;
85*a9e8641dSBaptiste Daroussin }
86*a9e8641dSBaptiste Daroussin *p = 0;
87*a9e8641dSBaptiste Daroussin *str = s;
88*a9e8641dSBaptiste Daroussin return strlen(s);
89*a9e8641dSBaptiste Daroussin }
90*a9e8641dSBaptiste Daroussin
91*a9e8641dSBaptiste Daroussin #define DECODE_ERROR 0xffffffff
92*a9e8641dSBaptiste Daroussin
93*a9e8641dSBaptiste Daroussin static unsigned int
token_decode(const char * token)94*a9e8641dSBaptiste Daroussin token_decode(const char *token)
95*a9e8641dSBaptiste Daroussin {
96*a9e8641dSBaptiste Daroussin int i;
97*a9e8641dSBaptiste Daroussin unsigned int val = 0;
98*a9e8641dSBaptiste Daroussin int marker = 0;
99*a9e8641dSBaptiste Daroussin if (strlen(token) < 4)
100*a9e8641dSBaptiste Daroussin return DECODE_ERROR;
101*a9e8641dSBaptiste Daroussin for (i = 0; i < 4; i++) {
102*a9e8641dSBaptiste Daroussin val *= 64;
103*a9e8641dSBaptiste Daroussin if (token[i] == '=')
104*a9e8641dSBaptiste Daroussin marker++;
105*a9e8641dSBaptiste Daroussin else if (marker > 0)
106*a9e8641dSBaptiste Daroussin return DECODE_ERROR;
107*a9e8641dSBaptiste Daroussin else
108*a9e8641dSBaptiste Daroussin val += pos(token[i]);
109*a9e8641dSBaptiste Daroussin }
110*a9e8641dSBaptiste Daroussin if (marker > 2)
111*a9e8641dSBaptiste Daroussin return DECODE_ERROR;
112*a9e8641dSBaptiste Daroussin return (marker << 24) | val;
113*a9e8641dSBaptiste Daroussin }
114*a9e8641dSBaptiste Daroussin
115*a9e8641dSBaptiste Daroussin int
base64_decode(const char * str,void * data)116*a9e8641dSBaptiste Daroussin base64_decode(const char *str, void *data)
117*a9e8641dSBaptiste Daroussin {
118*a9e8641dSBaptiste Daroussin const char *p;
119*a9e8641dSBaptiste Daroussin unsigned char *q;
120*a9e8641dSBaptiste Daroussin
121*a9e8641dSBaptiste Daroussin q = data;
122*a9e8641dSBaptiste Daroussin for (p = str; *p && (*p == '=' || strchr(base64_chars, *p)); p += 4) {
123*a9e8641dSBaptiste Daroussin unsigned int val = token_decode(p);
124*a9e8641dSBaptiste Daroussin unsigned int marker = (val >> 24) & 0xff;
125*a9e8641dSBaptiste Daroussin if (val == DECODE_ERROR)
126*a9e8641dSBaptiste Daroussin return -1;
127*a9e8641dSBaptiste Daroussin *q++ = (val >> 16) & 0xff;
128*a9e8641dSBaptiste Daroussin if (marker < 2)
129*a9e8641dSBaptiste Daroussin *q++ = (val >> 8) & 0xff;
130*a9e8641dSBaptiste Daroussin if (marker < 1)
131*a9e8641dSBaptiste Daroussin *q++ = val & 0xff;
132*a9e8641dSBaptiste Daroussin }
133*a9e8641dSBaptiste Daroussin return q - (unsigned char *) data;
134*a9e8641dSBaptiste Daroussin }
135*a9e8641dSBaptiste Daroussin
136