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