]>
Commit | Line | Data |
---|---|---|
d7ce7006 | 1 | /*\r |
2 | * Copyright (c) 1996, 1998 by Internet Software Consortium.\r | |
3 | *\r | |
4 | * Permission to use, copy, modify, and distribute this software for any\r | |
5 | * purpose with or without fee is hereby granted, provided that the above\r | |
6 | * copyright notice and this permission notice appear in all copies.\r | |
7 | *\r | |
8 | * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS\r | |
9 | * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES\r | |
10 | * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE\r | |
11 | * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\r | |
12 | * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\r | |
13 | * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS\r | |
14 | * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS\r | |
15 | * SOFTWARE.\r | |
16 | */\r | |
17 | \r | |
18 | /*\r | |
19 | * Portions Copyright (c) 1995 by International Business Machines, Inc.\r | |
20 | *\r | |
21 | * International Business Machines, Inc. (hereinafter called IBM) grants\r | |
22 | * permission under its copyrights to use, copy, modify, and distribute this\r | |
23 | * Software with or without fee, provided that the above copyright notice and\r | |
24 | * all paragraphs of this notice appear in all copies, and that the name of IBM\r | |
25 | * not be used in connection with the marketing of any product incorporating\r | |
26 | * the Software or modifications thereof, without specific, written prior\r | |
27 | * permission.\r | |
28 | *\r | |
29 | * To the extent it has a right to do so, IBM grants an immunity from suit\r | |
30 | * under its patents, if any, for the use, sale or manufacture of products to\r | |
31 | * the extent that such products are used for performing Domain Name System\r | |
32 | * dynamic updates in TCP/IP networks by means of the Software. No immunity is\r | |
33 | * granted for any product per se or for any other function of any product.\r | |
34 | *\r | |
35 | * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,\r | |
36 | * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\r | |
37 | * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,\r | |
38 | * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING\r | |
39 | * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN\r | |
40 | * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.\r | |
41 | */\r | |
42 | \r | |
43 | /*\r | |
44 | * Portions copyright (c) 1999, 2000\r | |
45 | * Intel Corporation.\r | |
46 | * All rights reserved.\r | |
39f4382a | 47 | *\r |
d7ce7006 | 48 | * Redistribution and use in source and binary forms, with or without\r |
49 | * modification, are permitted provided that the following conditions\r | |
50 | * are met:\r | |
39f4382a | 51 | *\r |
d7ce7006 | 52 | * 1. Redistributions of source code must retain the above copyright\r |
53 | * notice, this list of conditions and the following disclaimer.\r | |
39f4382a | 54 | *\r |
d7ce7006 | 55 | * 2. Redistributions in binary form must reproduce the above copyright\r |
56 | * notice, this list of conditions and the following disclaimer in the\r | |
57 | * documentation and/or other materials provided with the distribution.\r | |
39f4382a | 58 | *\r |
d7ce7006 | 59 | * 3. All advertising materials mentioning features or use of this software\r |
60 | * must display the following acknowledgement:\r | |
39f4382a | 61 | *\r |
d7ce7006 | 62 | * This product includes software developed by Intel Corporation and\r |
63 | * its contributors.\r | |
39f4382a | 64 | *\r |
d7ce7006 | 65 | * 4. Neither the name of Intel Corporation or its contributors may be\r |
66 | * used to endorse or promote products derived from this software\r | |
67 | * without specific prior written permission.\r | |
39f4382a | 68 | *\r |
d7ce7006 | 69 | * THIS SOFTWARE IS PROVIDED BY INTEL CORPORATION AND CONTRIBUTORS ``AS IS''\r |
70 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r | |
71 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r | |
72 | * ARE DISCLAIMED. IN NO EVENT SHALL INTEL CORPORATION OR CONTRIBUTORS BE\r | |
73 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r | |
74 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r | |
75 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r | |
76 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r | |
77 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r | |
78 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\r | |
79 | * THE POSSIBILITY OF SUCH DAMAGE.\r | |
39f4382a | 80 | *\r |
81 | base64.c,v 1.1.1.1 2003/11/19 01:51:25 kyu3 Exp\r | |
d7ce7006 | 82 | */\r |
83 | \r | |
d7ce7006 | 84 | #include <sys/types.h>\r |
85 | #include <sys/param.h>\r | |
86 | #include <sys/socket.h>\r | |
87 | \r | |
88 | #include <netinet/in.h>\r | |
89 | #include <arpa/inet.h>\r | |
90 | #include <arpa/nameser.h>\r | |
91 | \r | |
92 | #include <ctype.h>\r | |
93 | #include <resolv.h>\r | |
94 | #include <stdio.h>\r | |
95 | #include <stdlib.h>\r | |
96 | #include <string.h>\r | |
97 | \r | |
98 | #define Assert(Cond) if (!(Cond)) abort()\r | |
99 | \r | |
100 | static const char Base64[] =\r | |
39f4382a | 101 | "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";\r |
d7ce7006 | 102 | static const char Pad64 = '=';\r |
103 | \r | |
104 | /* (From RFC1521 and draft-ietf-dnssec-secext-03.txt)\r | |
105 | The following encoding technique is taken from RFC 1521 by Borenstein\r | |
106 | and Freed. It is reproduced here in a slightly edited form for\r | |
107 | convenience.\r | |
108 | \r | |
109 | A 65-character subset of US-ASCII is used, enabling 6 bits to be\r | |
110 | represented per printable character. (The extra 65th character, "=",\r | |
111 | is used to signify a special processing function.)\r | |
112 | \r | |
113 | The encoding process represents 24-bit groups of input bits as output\r | |
114 | strings of 4 encoded characters. Proceeding from left to right, a\r | |
115 | 24-bit input group is formed by concatenating 3 8-bit input groups.\r | |
116 | These 24 bits are then treated as 4 concatenated 6-bit groups, each\r | |
117 | of which is translated into a single digit in the base64 alphabet.\r | |
118 | \r | |
119 | Each 6-bit group is used as an index into an array of 64 printable\r | |
120 | characters. The character referenced by the index is placed in the\r | |
121 | output string.\r | |
122 | \r | |
123 | Table 1: The Base64 Alphabet\r | |
124 | \r | |
125 | Value Encoding Value Encoding Value Encoding Value Encoding\r | |
126 | 0 A 17 R 34 i 51 z\r | |
127 | 1 B 18 S 35 j 52 0\r | |
128 | 2 C 19 T 36 k 53 1\r | |
129 | 3 D 20 U 37 l 54 2\r | |
130 | 4 E 21 V 38 m 55 3\r | |
131 | 5 F 22 W 39 n 56 4\r | |
132 | 6 G 23 X 40 o 57 5\r | |
133 | 7 H 24 Y 41 p 58 6\r | |
134 | 8 I 25 Z 42 q 59 7\r | |
135 | 9 J 26 a 43 r 60 8\r | |
136 | 10 K 27 b 44 s 61 9\r | |
137 | 11 L 28 c 45 t 62 +\r | |
138 | 12 M 29 d 46 u 63 /\r | |
139 | 13 N 30 e 47 v\r | |
140 | 14 O 31 f 48 w (pad) =\r | |
141 | 15 P 32 g 49 x\r | |
142 | 16 Q 33 h 50 y\r | |
143 | \r | |
144 | Special processing is performed if fewer than 24 bits are available\r | |
145 | at the end of the data being encoded. A full encoding quantum is\r | |
146 | always completed at the end of a quantity. When fewer than 24 input\r | |
147 | bits are available in an input group, zero bits are added (on the\r | |
148 | right) to form an integral number of 6-bit groups. Padding at the\r | |
149 | end of the data is performed using the '=' character.\r | |
150 | \r | |
151 | Since all base64 input is an integral number of octets, only the\r | |
39f4382a | 152 | -------------------------------------------------\r |
d7ce7006 | 153 | following cases can arise:\r |
39f4382a | 154 | \r |
d7ce7006 | 155 | (1) the final quantum of encoding input is an integral\r |
156 | multiple of 24 bits; here, the final unit of encoded\r | |
39f4382a | 157 | output will be an integral multiple of 4 characters\r |
158 | with no "=" padding,\r | |
d7ce7006 | 159 | (2) the final quantum of encoding input is exactly 8 bits;\r |
160 | here, the final unit of encoded output will be two\r | |
39f4382a | 161 | characters followed by two "=" padding characters, or\r |
d7ce7006 | 162 | (3) the final quantum of encoding input is exactly 16 bits;\r |
163 | here, the final unit of encoded output will be three\r | |
39f4382a | 164 | characters followed by one "=" padding character.\r |
d7ce7006 | 165 | */\r |
166 | \r | |
167 | int\r | |
168 | b64_ntop(u_char const *src, size_t srclength, char *target, size_t targsize) {\r | |
39f4382a | 169 | size_t datalength = 0;\r |
170 | u_char input[3];\r | |
171 | u_char output[4];\r | |
172 | size_t i;\r | |
173 | \r | |
7700f0f5 | 174 | input[0] = input[1] = input[2] = '\0';\r |
39f4382a | 175 | while (2 < srclength) {\r |
176 | input[0] = *src++;\r | |
177 | input[1] = *src++;\r | |
178 | input[2] = *src++;\r | |
179 | srclength -= 3;\r | |
180 | \r | |
181 | output[0] = input[0] >> 2;\r | |
182 | output[1] = ((input[0] & 0x03) << 4) + (input[1] >> 4);\r | |
183 | output[2] = ((input[1] & 0x0f) << 2) + (input[2] >> 6);\r | |
184 | output[3] = input[2] & 0x3f;\r | |
185 | Assert(output[0] < 64);\r | |
186 | Assert(output[1] < 64);\r | |
187 | Assert(output[2] < 64);\r | |
188 | Assert(output[3] < 64);\r | |
189 | \r | |
190 | if (datalength + 4 > targsize)\r | |
191 | return (-1);\r | |
192 | target[datalength++] = Base64[output[0]];\r | |
193 | target[datalength++] = Base64[output[1]];\r | |
194 | target[datalength++] = Base64[output[2]];\r | |
195 | target[datalength++] = Base64[output[3]];\r | |
196 | }\r | |
197 | \r | |
198 | /* Now we worry about padding. */\r | |
199 | if (0 != srclength) {\r | |
200 | /* Get what's left. */\r | |
201 | input[0] = input[1] = input[2] = '\0';\r | |
202 | for (i = 0; i < srclength; i++)\r | |
203 | input[i] = *src++;\r | |
204 | \r | |
205 | output[0] = input[0] >> 2;\r | |
206 | output[1] = ((input[0] & 0x03) << 4) + (input[1] >> 4);\r | |
207 | output[2] = ((input[1] & 0x0f) << 2) + (input[2] >> 6);\r | |
208 | Assert(output[0] < 64);\r | |
209 | Assert(output[1] < 64);\r | |
210 | Assert(output[2] < 64);\r | |
211 | \r | |
212 | if (datalength + 4 > targsize)\r | |
213 | return (-1);\r | |
214 | target[datalength++] = Base64[output[0]];\r | |
215 | target[datalength++] = Base64[output[1]];\r | |
216 | if (srclength == 1)\r | |
217 | target[datalength++] = Pad64;\r | |
218 | else\r | |
219 | target[datalength++] = Base64[output[2]];\r | |
220 | target[datalength++] = Pad64;\r | |
221 | }\r | |
222 | if (datalength >= targsize)\r | |
223 | return (-1);\r | |
224 | target[datalength] = '\0'; /* Returned value doesn't count \0. */\r | |
225 | return ((int)datalength);\r | |
d7ce7006 | 226 | }\r |
227 | \r | |
228 | /* skips all whitespace anywhere.\r | |
229 | converts characters, four at a time, starting at (or after)\r | |
230 | src from base - 64 numbers into three 8 bit bytes in the target area.\r | |
231 | it returns the number of data bytes stored at the target, or -1 on error.\r | |
232 | */\r | |
233 | \r | |
234 | int\r | |
235 | b64_pton(\r | |
39f4382a | 236 | char const *src,\r |
237 | u_char *target,\r | |
238 | size_t targsize\r | |
239 | )\r | |
d7ce7006 | 240 | {\r |
39f4382a | 241 | int tarindex, state, ch;\r |
242 | char *pos;\r | |
243 | \r | |
244 | state = 0;\r | |
245 | tarindex = 0;\r | |
246 | \r | |
247 | while ((ch = *src++) != '\0') {\r | |
248 | if (isspace(ch)) /* Skip whitespace anywhere. */\r | |
249 | continue;\r | |
250 | \r | |
251 | if (ch == Pad64)\r | |
252 | break;\r | |
253 | \r | |
254 | pos = strchr(Base64, ch);\r | |
255 | if (pos == 0) /* A non-base64 character. */\r | |
256 | return (-1);\r | |
257 | \r | |
258 | switch (state) {\r | |
259 | case 0:\r | |
260 | if (target) {\r | |
261 | if ((size_t)tarindex >= targsize)\r | |
262 | return (-1);\r | |
263 | target[tarindex] = (u_char)((pos - Base64) << 2);\r | |
264 | }\r | |
265 | state = 1;\r | |
266 | break;\r | |
267 | case 1:\r | |
268 | if (target) {\r | |
269 | if ((size_t)tarindex + 1 >= targsize)\r | |
270 | return (-1);\r | |
271 | target[tarindex] |= (u_char)((pos - Base64) >> 4);\r | |
272 | target[tarindex+1] = (u_char)(((pos - Base64) & 0x0f)\r | |
273 | << 4) ;\r | |
274 | }\r | |
275 | tarindex++;\r | |
276 | state = 2;\r | |
277 | break;\r | |
278 | case 2:\r | |
279 | if (target) {\r | |
280 | if ((size_t)tarindex + 1 >= targsize)\r | |
281 | return (-1);\r | |
282 | target[tarindex] |= (u_char)((pos - Base64) >> 2);\r | |
283 | target[tarindex+1] = (u_char)(((pos - Base64) & 0x03)\r | |
284 | << 6);\r | |
285 | }\r | |
286 | tarindex++;\r | |
287 | state = 3;\r | |
288 | break;\r | |
289 | case 3:\r | |
290 | if (target) {\r | |
291 | if ((size_t)tarindex >= targsize)\r | |
292 | return (-1);\r | |
293 | target[tarindex] |= (u_char)(pos - Base64);\r | |
294 | }\r | |
295 | tarindex++;\r | |
296 | state = 0;\r | |
297 | break;\r | |
298 | default:\r | |
299 | abort();\r | |
300 | }\r | |
301 | }\r | |
302 | \r | |
303 | /*\r | |
304 | * We are done decoding Base-64 chars. Let's see if we ended\r | |
305 | * on a byte boundary, and/or with erroneous trailing characters.\r | |
306 | */\r | |
307 | \r | |
308 | if (ch == Pad64) { /* We got a pad char. */\r | |
309 | ch = *src++; /* Skip it, get next. */\r | |
310 | switch (state) {\r | |
311 | case 0: /* Invalid = in first position */\r | |
312 | case 1: /* Invalid = in second position */\r | |
313 | return (-1);\r | |
314 | \r | |
315 | case 2: /* Valid, means one byte of info */\r | |
316 | /* Skip any number of spaces. */\r | |
317 | for ((void)NULL; ch != '\0'; ch = *src++)\r | |
318 | if (!isspace(ch))\r | |
319 | break;\r | |
320 | /* Make sure there is another trailing = sign. */\r | |
321 | if (ch != Pad64)\r | |
322 | return (-1);\r | |
323 | ch = *src++; /* Skip the = */\r | |
324 | /* Fall through to "single trailing =" case. */\r | |
325 | /* FALLTHROUGH */\r | |
326 | \r | |
327 | case 3: /* Valid, means two bytes of info */\r | |
328 | /*\r | |
329 | * We know this char is an =. Is there anything but\r | |
330 | * whitespace after it?\r | |
331 | */\r | |
332 | for ((void)NULL; ch != '\0'; ch = *src++)\r | |
333 | if (!isspace(ch))\r | |
334 | return (-1);\r | |
335 | \r | |
336 | /*\r | |
337 | * Now make sure for cases 2 and 3 that the "extra"\r | |
338 | * bits that slopped past the last full byte were\r | |
339 | * zeros. If we don't check them, they become a\r | |
340 | * subliminal channel.\r | |
341 | */\r | |
342 | if (target && target[tarindex] != 0)\r | |
343 | return (-1);\r | |
344 | }\r | |
345 | } else {\r | |
346 | /*\r | |
347 | * We ended by seeing the end of the string. Make sure we\r | |
348 | * have no partial bytes lying around.\r | |
349 | */\r | |
350 | if (state != 0)\r | |
351 | return (-1);\r | |
352 | }\r | |
353 | \r | |
354 | return (tarindex);\r | |
d7ce7006 | 355 | }\r |