s3-netapi: remove pointless use_memory_krb5_ccache.
[Samba/id10ts.git] / lib / util / base64.c
blobbc78404c181324a3d7e1485e75d08149b071f648
1 /*
2 Unix SMB/CIFS implementation.
3 Samba utility functions
5 Copyright (C) Andrew Tridgell 1992-2001
6 Copyright (C) Simo Sorce 2001-2002
7 Copyright (C) Martin Pool 2003
8 Copyright (C) James Peach 2006
9 Copyright (C) Jeremy Allison 1992-2007
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 3 of the License, or
14 (at your option) any later version.
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with this program. If not, see <http://www.gnu.org/licenses/>.
25 #include "includes.h"
27 static const char b64[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
29 /**
30 * Decode a base64 string into a DATA_BLOB - simple and slow algorithm
31 **/
32 _PUBLIC_ DATA_BLOB base64_decode_data_blob_talloc(TALLOC_CTX *mem_ctx, const char *s)
34 int bit_offset, byte_offset, idx, i, n;
35 DATA_BLOB decoded = data_blob_talloc(mem_ctx, s, strlen(s)+1);
36 unsigned char *d = decoded.data;
37 char *p;
39 n=i=0;
41 while (*s && (p=strchr_m(b64,*s))) {
42 idx = (int)(p - b64);
43 byte_offset = (i*6)/8;
44 bit_offset = (i*6)%8;
45 d[byte_offset] &= ~((1<<(8-bit_offset))-1);
46 if (bit_offset < 3) {
47 d[byte_offset] |= (idx << (2-bit_offset));
48 n = byte_offset+1;
49 } else {
50 d[byte_offset] |= (idx >> (bit_offset-2));
51 d[byte_offset+1] = 0;
52 d[byte_offset+1] |= (idx << (8-(bit_offset-2))) & 0xFF;
53 n = byte_offset+2;
55 s++; i++;
58 if ((n > 0) && (*s == '=')) {
59 n -= 1;
62 /* fix up length */
63 decoded.length = n;
64 decoded.data = talloc_realloc(mem_ctx, decoded.data, uint8_t, n);
65 return decoded;
68 /**
69 * Decode a base64 string into a DATA_BLOB - simple and slow algorithm
70 **/
71 _PUBLIC_ DATA_BLOB base64_decode_data_blob(const char *s)
73 return base64_decode_data_blob_talloc(NULL, s);
76 /**
77 * Decode a base64 string in-place - wrapper for the above
78 **/
79 _PUBLIC_ void base64_decode_inplace(char *s)
81 DATA_BLOB decoded = base64_decode_data_blob(s);
83 if ( decoded.length != 0 ) {
84 memcpy(s, decoded.data, decoded.length);
86 /* null terminate */
87 s[decoded.length] = '\0';
88 } else {
89 *s = '\0';
92 data_blob_free(&decoded);
95 /**
96 * Encode a base64 string into a talloc()ed string caller to free.
98 * From SQUID: adopted from http://ftp.sunet.se/pub2/gnu/vm/base64-encode.c
99 * with adjustments
102 _PUBLIC_ char *base64_encode_data_blob(TALLOC_CTX *mem_ctx, DATA_BLOB data)
104 int bits = 0;
105 int char_count = 0;
106 size_t out_cnt, len, output_len;
107 char *result;
109 if (!data.length || !data.data)
110 return NULL;
112 out_cnt = 0;
113 len = data.length;
114 output_len = data.length * 2 + 4; /* Account for closing bytes. 4 is
115 * random but should be enough for
116 * the = and \0 */
117 result = talloc_array(mem_ctx, char, output_len); /* get us plenty of space */
118 SMB_ASSERT(result != NULL);
120 while (len--) {
121 int c = (unsigned char) *(data.data++);
122 bits += c;
123 char_count++;
124 if (char_count == 3) {
125 result[out_cnt++] = b64[bits >> 18];
126 result[out_cnt++] = b64[(bits >> 12) & 0x3f];
127 result[out_cnt++] = b64[(bits >> 6) & 0x3f];
128 result[out_cnt++] = b64[bits & 0x3f];
129 bits = 0;
130 char_count = 0;
131 } else {
132 bits <<= 8;
135 if (char_count != 0) {
136 bits <<= 16 - (8 * char_count);
137 result[out_cnt++] = b64[bits >> 18];
138 result[out_cnt++] = b64[(bits >> 12) & 0x3f];
139 if (char_count == 1) {
140 result[out_cnt++] = '=';
141 result[out_cnt++] = '=';
142 } else {
143 result[out_cnt++] = b64[(bits >> 6) & 0x3f];
144 result[out_cnt++] = '=';
147 result[out_cnt] = '\0'; /* terminate */
148 return result;