2006-09-03 21:19:40 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
|
|
|
/*
|
2010-09-16 21:40:04 +05:30
|
|
|
* Copyright 2003, Glenn McGrath
|
|
|
|
* Copyright 2006, Rob Landley <rob@landley.net>
|
|
|
|
* Copyright 2010, Denys Vlasenko
|
2006-09-03 21:19:40 +05:30
|
|
|
*
|
2010-08-16 23:44:46 +05:30
|
|
|
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
|
2006-09-03 21:19:40 +05:30
|
|
|
*/
|
|
|
|
#include "libbb.h"
|
|
|
|
|
2020-11-26 03:17:00 +05:30
|
|
|
/* Conversion tables */
|
2020-11-28 17:18:34 +05:30
|
|
|
#if ENABLE_BASE32
|
|
|
|
const char bb_uuenc_tbl_base32[] ALIGN1 = {
|
|
|
|
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
|
|
|
|
'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
|
|
|
|
'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
|
|
|
|
'Y', 'Z', '2', '3', '4', '5', '6', '7',
|
|
|
|
/* unused: '=', */
|
|
|
|
};
|
|
|
|
#endif
|
2020-11-26 03:17:00 +05:30
|
|
|
/* for base 64 */
|
2020-11-28 17:18:34 +05:30
|
|
|
const char bb_uuenc_tbl_base64[] ALIGN1 = {
|
2006-09-03 21:19:40 +05:30
|
|
|
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
|
|
|
|
'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
|
|
|
|
'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
|
|
|
|
'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
|
|
|
|
'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
|
|
|
|
'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
|
|
|
|
'w', 'x', 'y', 'z', '0', '1', '2', '3',
|
|
|
|
'4', '5', '6', '7', '8', '9', '+', '/',
|
2007-06-12 12:54:11 +05:30
|
|
|
'=' /* termination character */,
|
2006-09-03 21:19:40 +05:30
|
|
|
};
|
2020-11-28 17:18:34 +05:30
|
|
|
const char bb_uuenc_tbl_std[] ALIGN1 = {
|
2006-09-03 21:19:40 +05:30
|
|
|
'`', '!', '"', '#', '$', '%', '&', '\'',
|
|
|
|
'(', ')', '*', '+', ',', '-', '.', '/',
|
|
|
|
'0', '1', '2', '3', '4', '5', '6', '7',
|
|
|
|
'8', '9', ':', ';', '<', '=', '>', '?',
|
|
|
|
'@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
|
|
|
|
'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
|
|
|
|
'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
|
|
|
|
'X', 'Y', 'Z', '[', '\\', ']', '^', '_',
|
|
|
|
'`' /* termination character */
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
2007-06-26 21:29:37 +05:30
|
|
|
* Encode bytes at S of length LENGTH to uuencode or base64 format and place it
|
2006-09-03 21:19:40 +05:30
|
|
|
* to STORE. STORE will be 0-terminated, and must point to a writable
|
|
|
|
* buffer of at least 1+BASE64_LENGTH(length) bytes.
|
|
|
|
* where BASE64_LENGTH(len) = (4 * ((LENGTH + 2) / 3))
|
|
|
|
*/
|
2008-06-27 08:22:20 +05:30
|
|
|
void FAST_FUNC bb_uuencode(char *p, const void *src, int length, const char *tbl)
|
2006-09-03 21:19:40 +05:30
|
|
|
{
|
2007-06-26 21:29:37 +05:30
|
|
|
const unsigned char *s = src;
|
2006-09-03 21:19:40 +05:30
|
|
|
|
2007-08-06 21:13:17 +05:30
|
|
|
/* Transform the 3x8 bits to 4x6 bits */
|
|
|
|
while (length > 0) {
|
|
|
|
unsigned s1, s2;
|
|
|
|
|
|
|
|
/* Are s[1], s[2] valid or should be assumed 0? */
|
|
|
|
s1 = s2 = 0;
|
|
|
|
length -= 3; /* can be >=0, -1, -2 */
|
2007-08-06 21:19:12 +05:30
|
|
|
if (length >= -1) {
|
2007-08-06 21:13:17 +05:30
|
|
|
s1 = s[1];
|
2007-08-06 21:19:12 +05:30
|
|
|
if (length >= 0)
|
2007-08-06 21:13:17 +05:30
|
|
|
s2 = s[2];
|
|
|
|
}
|
2006-09-03 21:19:40 +05:30
|
|
|
*p++ = tbl[s[0] >> 2];
|
2007-08-06 21:13:17 +05:30
|
|
|
*p++ = tbl[((s[0] & 3) << 4) + (s1 >> 4)];
|
|
|
|
*p++ = tbl[((s1 & 0xf) << 2) + (s2 >> 6)];
|
|
|
|
*p++ = tbl[s2 & 0x3f];
|
2006-09-03 21:19:40 +05:30
|
|
|
s += 3;
|
|
|
|
}
|
2007-08-06 21:13:17 +05:30
|
|
|
/* Zero-terminate */
|
2006-09-03 21:19:40 +05:30
|
|
|
*p = '\0';
|
2007-08-06 21:13:17 +05:30
|
|
|
/* If length is -2 or -1, pad last char or two */
|
|
|
|
while (length) {
|
|
|
|
*--p = tbl[64];
|
|
|
|
length++;
|
|
|
|
}
|
2006-09-03 21:19:40 +05:30
|
|
|
}
|
2010-09-16 21:40:04 +05:30
|
|
|
|
|
|
|
/*
|
2020-11-28 01:55:34 +05:30
|
|
|
* Decode base64 encoded string.
|
2011-10-28 17:29:04 +05:30
|
|
|
*
|
|
|
|
* Returns: pointer to the undecoded part of source.
|
|
|
|
* If points to '\0', then the source was fully decoded.
|
2011-10-28 19:45:00 +05:30
|
|
|
* (*pp_dst): advanced past the last written byte.
|
2010-09-16 21:40:04 +05:30
|
|
|
*/
|
2020-11-28 17:56:44 +05:30
|
|
|
char* FAST_FUNC decode_base64(char *dst, const char **pp_src)
|
2010-09-16 21:40:04 +05:30
|
|
|
{
|
2020-11-28 17:56:44 +05:30
|
|
|
const char *src = pp_src ? *pp_src : dst; /* for httpd.c, support NULL 2nd param */
|
2020-11-28 01:14:55 +05:30
|
|
|
unsigned ch = 0;
|
2020-11-28 17:03:50 +05:30
|
|
|
unsigned t;
|
2020-11-28 01:14:55 +05:30
|
|
|
int i = 0;
|
2010-09-16 21:40:04 +05:30
|
|
|
|
2020-11-28 14:20:14 +05:30
|
|
|
while ((t = (unsigned char)*src) != '\0') {
|
|
|
|
src++;
|
2010-09-16 21:40:04 +05:30
|
|
|
|
2020-11-28 01:14:55 +05:30
|
|
|
/* "if" forest is faster than strchr(bb_uuenc_tbl_base64, t) */
|
|
|
|
if (t >= '0' && t <= '9')
|
|
|
|
t = t - '0' + 52;
|
|
|
|
else if (t >= 'A' && t <= 'Z')
|
|
|
|
t = t - 'A';
|
|
|
|
else if (t >= 'a' && t <= 'z')
|
|
|
|
t = t - 'a' + 26;
|
|
|
|
else if (t == '+')
|
|
|
|
t = 62;
|
|
|
|
else if (t == '/')
|
|
|
|
t = 63;
|
|
|
|
else if (t == '=' && (i == 3 || (i == 2 && *src == '=')))
|
|
|
|
/* the above disallows "==AA", "A===", "AA=A" etc */
|
|
|
|
t = 0x1000000;
|
|
|
|
else
|
2010-09-16 21:40:04 +05:30
|
|
|
//TODO: add BASE64_FLAG_foo to die on bad char?
|
2020-11-28 01:14:55 +05:30
|
|
|
continue;
|
2010-09-16 21:40:04 +05:30
|
|
|
|
2020-11-28 01:14:55 +05:30
|
|
|
ch = (ch << 6) | t;
|
2020-11-28 17:03:50 +05:30
|
|
|
i = (i + 1) & 3;
|
|
|
|
if (i == 0) {
|
2020-11-28 01:14:55 +05:30
|
|
|
*dst++ = (char) (ch >> 16);
|
|
|
|
*dst++ = (char) (ch >> 8);
|
|
|
|
*dst++ = (char) ch;
|
|
|
|
if (ch & 0x1000000) { /* was last input char '='? */
|
|
|
|
dst--;
|
|
|
|
if (ch & (0x1000000 << 6)) /* was it "=="? */
|
|
|
|
dst--;
|
2010-09-16 21:40:04 +05:30
|
|
|
break;
|
2020-11-28 01:14:55 +05:30
|
|
|
}
|
|
|
|
ch = 0;
|
2010-09-16 21:40:04 +05:30
|
|
|
}
|
2020-11-28 01:14:55 +05:30
|
|
|
}
|
2020-11-28 14:20:14 +05:30
|
|
|
/* i is zero here if full 4-char block was decoded */
|
2020-11-28 17:56:44 +05:30
|
|
|
if (pp_src)
|
|
|
|
*pp_src = src - i; /* -i rejects truncations: e.g. "MQ" and "MQ=" (correct encoding is "MQ==" -> "1") */
|
|
|
|
return dst;
|
2011-10-28 17:29:04 +05:30
|
|
|
}
|
|
|
|
|
2020-11-26 03:17:00 +05:30
|
|
|
#if ENABLE_BASE32
|
2020-11-28 17:56:44 +05:30
|
|
|
char* FAST_FUNC decode_base32(char *dst, const char **pp_src)
|
2020-11-26 03:17:00 +05:30
|
|
|
{
|
2020-11-28 17:56:44 +05:30
|
|
|
const char *src = *pp_src;
|
|
|
|
uint64_t ch = 0;
|
2020-11-28 17:03:50 +05:30
|
|
|
unsigned t;
|
2020-11-28 01:55:34 +05:30
|
|
|
int i = 0;
|
2020-11-26 03:17:00 +05:30
|
|
|
|
2020-11-28 14:20:14 +05:30
|
|
|
while ((t = (unsigned char)*src) != '\0') {
|
|
|
|
src++;
|
2020-11-28 01:55:34 +05:30
|
|
|
|
|
|
|
/* "if" forest is faster than strchr(bb_uuenc_tbl_base32, t) */
|
|
|
|
if (t >= '2' && t <= '7')
|
|
|
|
t = t - '2' + 26;
|
|
|
|
else if (t == '=' && i > 1)
|
|
|
|
t = 0;
|
2020-11-28 17:03:50 +05:30
|
|
|
else {
|
|
|
|
t = (t | 0x20) - 'a';
|
|
|
|
if (t > 25)
|
2020-11-28 01:55:34 +05:30
|
|
|
//TODO: add BASE64_FLAG_foo to die on bad char?
|
2020-11-28 17:03:50 +05:30
|
|
|
continue;
|
|
|
|
}
|
2020-11-28 01:55:34 +05:30
|
|
|
|
2020-11-28 17:03:50 +05:30
|
|
|
ch = (ch << 5) | t;
|
|
|
|
i = (i + 1) & 7;
|
|
|
|
if (i == 0) {
|
2020-11-28 01:55:34 +05:30
|
|
|
*dst++ = (char) (ch >> 32);
|
2020-11-28 17:03:50 +05:30
|
|
|
if (src[-1] == '=') /* was last input char '='? */
|
|
|
|
goto tail;
|
2020-11-28 01:55:34 +05:30
|
|
|
*dst++ = (char) (ch >> 24);
|
|
|
|
*dst++ = (char) (ch >> 16);
|
|
|
|
*dst++ = (char) (ch >> 8);
|
|
|
|
*dst++ = (char) ch;
|
2020-11-26 03:17:00 +05:30
|
|
|
}
|
2020-11-28 01:55:34 +05:30
|
|
|
}
|
2020-11-28 14:20:14 +05:30
|
|
|
/* i is zero here if full 8-char block was decoded */
|
2020-11-28 17:56:44 +05:30
|
|
|
*pp_src = src - i;
|
|
|
|
return dst;
|
2020-11-28 17:03:50 +05:30
|
|
|
tail:
|
|
|
|
{
|
|
|
|
const char *s = src;
|
|
|
|
while (*--s == '=')
|
|
|
|
i++;
|
|
|
|
/* Why duplicate the below code? Testcase:
|
|
|
|
* echo ' 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18' | base32 | base32 -d
|
|
|
|
* IOW, decoding of
|
|
|
|
* EAYSAMRAGMQDIIBVEA3CANZAHAQDSIBRGAQDCMJAGEZCAMJTEAYTIIBRGUQDCNRAGE3SAMJYBI==
|
|
|
|
* ====
|
|
|
|
* must correctly stitch together the tail, must not overwrite
|
|
|
|
* the tail before it is analyzed! (we can be decoding in-place)
|
|
|
|
* Else testcase fails, prints trailing extra NUL bytes.
|
|
|
|
*/
|
|
|
|
*dst++ = (char) (ch >> 24);
|
|
|
|
*dst++ = (char) (ch >> 16);
|
|
|
|
*dst++ = (char) (ch >> 8);
|
|
|
|
*dst++ = (char) ch;
|
|
|
|
dst -= (i+1) * 2 / 3; /* discard last 1, 2, 3 or 4 bytes */
|
|
|
|
}
|
2020-11-28 17:56:44 +05:30
|
|
|
*pp_src = src;
|
|
|
|
return dst;
|
2020-11-26 03:17:00 +05:30
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2011-10-28 17:29:04 +05:30
|
|
|
/*
|
|
|
|
* Decode base64 encoded stream.
|
|
|
|
* Can stop on EOF, specified char, or on uuencode-style "====" line:
|
|
|
|
* flags argument controls it.
|
|
|
|
*/
|
|
|
|
void FAST_FUNC read_base64(FILE *src_stream, FILE *dst_stream, int flags)
|
|
|
|
{
|
|
|
|
/* Note that EOF _can_ be passed as exit_char too */
|
|
|
|
#define exit_char ((int)(signed char)flags)
|
|
|
|
#define uu_style_end (flags & BASE64_FLAG_UU_STOP)
|
2020-11-26 03:17:00 +05:30
|
|
|
#define base32 (flags & BASE64_32)
|
2011-10-28 17:29:04 +05:30
|
|
|
|
2020-11-28 14:20:14 +05:30
|
|
|
/* uuencoded files have 61 byte lines.
|
|
|
|
* base32/64 have 76 byte lines by default.
|
|
|
|
* Use 80 byte buffer to process one line at a time.
|
2011-10-28 17:29:04 +05:30
|
|
|
*/
|
2020-11-28 14:20:14 +05:30
|
|
|
enum { BUFFER_SIZE = 80 };
|
|
|
|
/* decoded data is shorter than input, can use single buffer for both */
|
|
|
|
char buf[BUFFER_SIZE + 2];
|
2011-10-28 17:29:04 +05:30
|
|
|
int term_seen = 0;
|
|
|
|
int in_count = 0;
|
|
|
|
|
|
|
|
while (1) {
|
2020-11-28 14:20:14 +05:30
|
|
|
char *out_tail;
|
|
|
|
const char *in_tail;
|
|
|
|
|
2011-10-28 17:29:04 +05:30
|
|
|
while (in_count < BUFFER_SIZE) {
|
|
|
|
int ch = fgetc(src_stream);
|
|
|
|
if (ch == exit_char) {
|
|
|
|
if (in_count == 0)
|
|
|
|
return;
|
|
|
|
term_seen = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (ch == EOF) {
|
|
|
|
term_seen = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* Prevent "====" line to be split: stop if we see '\n'.
|
|
|
|
* We can also skip other whitespace and skirt the problem
|
|
|
|
* of files with NULs by stopping on any control char or space:
|
|
|
|
*/
|
|
|
|
if (ch <= ' ')
|
|
|
|
break;
|
2020-11-28 14:20:14 +05:30
|
|
|
buf[in_count++] = ch;
|
2011-10-28 17:29:04 +05:30
|
|
|
}
|
2020-11-28 14:20:14 +05:30
|
|
|
buf[in_count] = '\0';
|
2011-10-28 17:29:04 +05:30
|
|
|
|
|
|
|
/* Did we encounter "====" line? */
|
2020-11-28 14:20:14 +05:30
|
|
|
if (uu_style_end && strcmp(buf, "====") == 0)
|
2011-10-28 17:29:04 +05:30
|
|
|
return;
|
|
|
|
|
2020-11-28 17:56:44 +05:30
|
|
|
in_tail = buf;
|
2020-11-26 03:17:00 +05:30
|
|
|
#if ENABLE_BASE32
|
|
|
|
if (base32)
|
2020-11-28 17:56:44 +05:30
|
|
|
out_tail = decode_base32(buf, &in_tail);
|
2020-11-26 03:17:00 +05:30
|
|
|
else
|
|
|
|
#endif
|
2020-11-28 17:56:44 +05:30
|
|
|
out_tail = decode_base64(buf, &in_tail);
|
2011-10-28 17:29:04 +05:30
|
|
|
|
2020-11-28 14:20:14 +05:30
|
|
|
fwrite(buf, (out_tail - buf), 1, dst_stream);
|
2011-10-28 17:29:04 +05:30
|
|
|
|
|
|
|
if (term_seen) {
|
|
|
|
/* Did we consume ALL characters? */
|
|
|
|
if (*in_tail == '\0')
|
|
|
|
return;
|
|
|
|
/* No */
|
libbb: reduce the overhead of single parameter bb_error_msg() calls
Back in 2007, commit 0c97c9d43707 ("'simple' error message functions by
Loic Grenie") introduced bb_simple_perror_msg() to allow for a lower
overhead call to bb_perror_msg() when only a string was being printed
with no parameters. This saves space for some CPU architectures because
it avoids the overhead of a call to a variadic function. However there
has never been a simple version of bb_error_msg(), and since 2007 many
new calls to bb_perror_msg() have been added that only take a single
parameter and so could have been using bb_simple_perror_message().
This changeset introduces 'simple' versions of bb_info_msg(),
bb_error_msg(), bb_error_msg_and_die(), bb_herror_msg() and
bb_herror_msg_and_die(), and replaces all calls that only take a
single parameter, or use something like ("%s", arg), with calls to the
corresponding 'simple' version.
Since it is likely that single parameter calls to the variadic functions
may be accidentally reintroduced in the future a new debugging config
option WARN_SIMPLE_MSG has been introduced. This uses some macro magic
which will cause any such calls to generate a warning, but this is
turned off by default to avoid use of the unpleasant macros in normal
circumstances.
This is a large changeset due to the number of calls that have been
replaced. The only files that contain changes other than simple
substitution of function calls are libbb.h, libbb/herror_msg.c,
libbb/verror_msg.c and libbb/xfuncs_printf.c. In miscutils/devfsd.c,
networking/udhcp/common.h and util-linux/mdev.c additonal macros have
been added for logging so that single parameter and multiple parameter
logging variants exist.
The amount of space saved varies considerably by architecture, and was
found to be as follows (for 'defconfig' using GCC 7.4):
Arm: -92 bytes
MIPS: -52 bytes
PPC: -1836 bytes
x86_64: -938 bytes
Note that for the MIPS architecture only an exception had to be made
disabling the 'simple' calls for 'udhcp' (in networking/udhcp/common.h)
because it made these files larger on MIPS.
Signed-off-by: James Byrne <james.byrne@origamienergy.com>
Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
2019-07-02 15:05:03 +05:30
|
|
|
bb_simple_error_msg_and_die("truncated base64 input");
|
2011-10-28 17:29:04 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
/* It was partial decode */
|
|
|
|
in_count = strlen(in_tail);
|
2020-11-28 14:20:14 +05:30
|
|
|
memmove(buf, in_tail, in_count);
|
2011-10-28 17:29:04 +05:30
|
|
|
}
|
2010-09-16 21:40:04 +05:30
|
|
|
}
|