2001-03-17 04:17:14 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
|
|
|
/*
|
|
|
|
* Utility routines.
|
|
|
|
*
|
2004-03-15 13:59:22 +05:30
|
|
|
* Copyright (C) 1999-2004 by Erik Andersen <andersen@codepoet.org>
|
2006-08-03 21:11:12 +05:30
|
|
|
* Copyright (C) 2006 Rob Landley
|
2008-03-02 18:23:15 +05:30
|
|
|
* Copyright (C) 2006 Denys Vlasenko
|
2001-03-17 04:17:14 +05:30
|
|
|
*
|
2006-09-21 03:36:01 +05:30
|
|
|
* Licensed under GPL version 2, see file LICENSE in this tarball for details.
|
2001-03-17 04:17:14 +05:30
|
|
|
*/
|
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
/* We need to have separate xfuncs.c and xfuncs_printf.c because
|
|
|
|
* with current linkers, even with section garbage collection,
|
|
|
|
* if *.o module references any of XXXprintf functions, you pull in
|
|
|
|
* entire printf machinery. Even if you do not use the function
|
|
|
|
* which uses XXXprintf.
|
|
|
|
*
|
|
|
|
* xfuncs.c contains functions (not necessarily xfuncs)
|
|
|
|
* which do not pull in printf, directly or indirectly.
|
|
|
|
* xfunc_printf.c contains those which do.
|
|
|
|
*
|
|
|
|
* TODO: move xmalloc() and xatonum() here.
|
2006-08-29 05:01:54 +05:30
|
|
|
*/
|
2008-02-17 19:58:53 +05:30
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
#include "libbb.h"
|
2008-02-17 19:58:53 +05:30
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
/* Turn on nonblocking I/O on a fd */
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC ndelay_on(int fd)
|
2006-11-22 21:24:52 +05:30
|
|
|
{
|
2009-11-12 01:35:42 +05:30
|
|
|
return fcntl(fd, F_SETFL, fcntl(fd, F_GETFL) | O_NONBLOCK);
|
2006-11-22 21:24:52 +05:30
|
|
|
}
|
|
|
|
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC ndelay_off(int fd)
|
2006-12-24 12:45:50 +05:30
|
|
|
{
|
2009-11-12 01:35:42 +05:30
|
|
|
return fcntl(fd, F_SETFL, fcntl(fd, F_GETFL) & ~O_NONBLOCK);
|
2006-12-24 12:45:50 +05:30
|
|
|
}
|
|
|
|
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC close_on_exec_on(int fd)
|
2006-10-03 21:27:40 +05:30
|
|
|
{
|
2008-04-09 06:03:23 +05:30
|
|
|
return fcntl(fd, F_SETFD, FD_CLOEXEC);
|
2006-10-03 21:27:40 +05:30
|
|
|
}
|
|
|
|
|
2008-12-02 23:48:50 +05:30
|
|
|
char* FAST_FUNC strncpy_IFNAMSIZ(char *dst, const char *src)
|
|
|
|
{
|
|
|
|
#ifndef IFNAMSIZ
|
|
|
|
enum { IFNAMSIZ = 16 };
|
|
|
|
#endif
|
|
|
|
return strncpy(dst, src, IFNAMSIZ);
|
|
|
|
}
|
|
|
|
|
2008-01-06 08:56:53 +05:30
|
|
|
|
2007-03-29 03:27:12 +05:30
|
|
|
// Convert unsigned integer to ascii, writing into supplied buffer.
|
|
|
|
// A truncated result contains the first few digits of the result ala strncpy.
|
|
|
|
// Returns a pointer past last generated digit, does _not_ store NUL.
|
2006-11-05 06:14:39 +05:30
|
|
|
void BUG_sizeof_unsigned_not_4(void);
|
2008-06-27 08:22:20 +05:30
|
|
|
char* FAST_FUNC utoa_to_buf(unsigned n, char *buf, unsigned buflen)
|
2006-07-10 13:11:34 +05:30
|
|
|
{
|
2006-11-05 06:14:39 +05:30
|
|
|
unsigned i, out, res;
|
|
|
|
if (sizeof(unsigned) != 4)
|
|
|
|
BUG_sizeof_unsigned_not_4();
|
2006-07-11 06:14:36 +05:30
|
|
|
if (buflen) {
|
2006-11-05 06:14:39 +05:30
|
|
|
out = 0;
|
|
|
|
for (i = 1000000000; i; i /= 10) {
|
|
|
|
res = n / i;
|
|
|
|
if (res || out || i == 1) {
|
|
|
|
if (!--buflen) break;
|
2006-07-11 06:14:36 +05:30
|
|
|
out++;
|
|
|
|
n -= res*i;
|
|
|
|
*buf++ = '0' + res;
|
|
|
|
}
|
2006-07-10 13:11:34 +05:30
|
|
|
}
|
|
|
|
}
|
2007-03-28 03:31:31 +05:30
|
|
|
return buf;
|
2006-07-10 13:11:34 +05:30
|
|
|
}
|
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
/* Convert signed integer to ascii, like utoa_to_buf() */
|
2008-06-27 08:22:20 +05:30
|
|
|
char* FAST_FUNC itoa_to_buf(int n, char *buf, unsigned buflen)
|
2006-07-10 13:11:34 +05:30
|
|
|
{
|
2008-04-20 00:35:12 +05:30
|
|
|
if (buflen && n < 0) {
|
2006-07-10 13:11:34 +05:30
|
|
|
n = -n;
|
|
|
|
*buf++ = '-';
|
2006-07-11 06:14:36 +05:30
|
|
|
buflen--;
|
2006-07-10 13:11:34 +05:30
|
|
|
}
|
2007-03-28 03:31:31 +05:30
|
|
|
return utoa_to_buf((unsigned)n, buf, buflen);
|
2006-07-10 13:11:34 +05:30
|
|
|
}
|
|
|
|
|
2006-09-15 01:22:07 +05:30
|
|
|
// The following two functions use a static buffer, so calling either one a
|
|
|
|
// second time will overwrite previous results.
|
|
|
|
//
|
|
|
|
// The largest 32 bit integer is -2 billion plus null terminator, or 12 bytes.
|
2008-04-09 06:03:23 +05:30
|
|
|
// It so happens that sizeof(int) * 3 is enough for 32+ bits.
|
|
|
|
// (sizeof(int) * 3 + 2 is correct for any width, even 8-bit)
|
2006-09-15 01:22:07 +05:30
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
static char local_buf[sizeof(int) * 3];
|
2006-08-05 01:50:03 +05:30
|
|
|
|
2006-09-15 01:22:07 +05:30
|
|
|
// Convert unsigned integer to ascii using a static buffer (returned).
|
2008-06-27 08:22:20 +05:30
|
|
|
char* FAST_FUNC utoa(unsigned n)
|
2006-08-05 01:50:03 +05:30
|
|
|
{
|
2007-03-28 03:31:31 +05:30
|
|
|
*(utoa_to_buf(n, local_buf, sizeof(local_buf))) = '\0';
|
2006-08-05 01:50:03 +05:30
|
|
|
|
|
|
|
return local_buf;
|
|
|
|
}
|
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
/* Convert signed integer to ascii using a static buffer (returned). */
|
2008-06-27 08:22:20 +05:30
|
|
|
char* FAST_FUNC itoa(int n)
|
2006-07-10 13:11:34 +05:30
|
|
|
{
|
2007-03-28 03:31:31 +05:30
|
|
|
*(itoa_to_buf(n, local_buf, sizeof(local_buf))) = '\0';
|
2006-07-10 13:11:34 +05:30
|
|
|
|
|
|
|
return local_buf;
|
|
|
|
}
|
2006-07-16 04:30:46 +05:30
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
/* Emit a string of hex representation of bytes */
|
2008-06-27 08:22:20 +05:30
|
|
|
char* FAST_FUNC bin2hex(char *p, const char *cp, int count)
|
2007-01-13 03:40:34 +05:30
|
|
|
{
|
|
|
|
while (count) {
|
|
|
|
unsigned char c = *cp++;
|
|
|
|
/* put lowercase hex digits */
|
2007-01-27 05:01:05 +05:30
|
|
|
*p++ = 0x20 | bb_hexdigits_upcase[c >> 4];
|
|
|
|
*p++ = 0x20 | bb_hexdigits_upcase[c & 0xf];
|
2007-01-13 03:40:34 +05:30
|
|
|
count--;
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2010-04-04 18:59:32 +05:30
|
|
|
/* Convert "[x]x[:][x]x[:][x]x[:][x]x" hex string to binary, no more than COUNT bytes */
|
|
|
|
char* FAST_FUNC hex2bin(char *dst, const char *str, int count)
|
|
|
|
{
|
|
|
|
errno = EINVAL;
|
|
|
|
while (*str && count) {
|
|
|
|
uint8_t val;
|
|
|
|
uint8_t c = *str++;
|
|
|
|
if (isdigit(c))
|
|
|
|
val = c - '0';
|
|
|
|
else if ((c|0x20) >= 'a' && (c|0x20) <= 'f')
|
|
|
|
val = (c|0x20) - ('a' - 10);
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
val <<= 4;
|
|
|
|
c = *str;
|
|
|
|
if (isdigit(c))
|
|
|
|
val |= c - '0';
|
|
|
|
else if ((c|0x20) >= 'a' && (c|0x20) <= 'f')
|
|
|
|
val |= (c|0x20) - ('a' - 10);
|
|
|
|
else if (c == ':' || c == '\0')
|
|
|
|
val >>= 4;
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
*dst++ = val;
|
|
|
|
if (c != '\0')
|
|
|
|
str++;
|
|
|
|
if (*str == ':')
|
|
|
|
str++;
|
|
|
|
count--;
|
|
|
|
}
|
|
|
|
errno = (*str ? ERANGE : 0);
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2008-04-09 06:03:23 +05:30
|
|
|
/* Return how long the file at fd is, if there's any way to determine it. */
|
2008-01-28 05:11:34 +05:30
|
|
|
#ifdef UNUSED
|
2008-06-27 08:22:20 +05:30
|
|
|
off_t FAST_FUNC fdlength(int fd)
|
2006-07-16 13:44:35 +05:30
|
|
|
{
|
|
|
|
off_t bottom = 0, top = 0, pos;
|
|
|
|
long size;
|
|
|
|
|
2006-09-15 01:22:07 +05:30
|
|
|
// If the ioctl works for this, return it.
|
2006-07-16 13:44:35 +05:30
|
|
|
|
|
|
|
if (ioctl(fd, BLKGETSIZE, &size) >= 0) return size*512;
|
|
|
|
|
2006-10-27 14:33:24 +05:30
|
|
|
// FIXME: explain why lseek(SEEK_END) is not used here!
|
|
|
|
|
2006-09-15 01:22:07 +05:30
|
|
|
// If not, do a binary search for the last location we can read. (Some
|
|
|
|
// block devices don't do BLKGETSIZE right.)
|
2006-07-16 13:44:35 +05:30
|
|
|
|
|
|
|
do {
|
|
|
|
char temp;
|
|
|
|
|
2006-09-05 15:06:19 +05:30
|
|
|
pos = bottom + (top - bottom) / 2;
|
2006-07-16 13:44:35 +05:30
|
|
|
|
2006-09-15 01:22:07 +05:30
|
|
|
// If we can read from the current location, it's bigger.
|
2006-07-16 13:44:35 +05:30
|
|
|
|
2006-10-14 07:53:43 +05:30
|
|
|
if (lseek(fd, pos, SEEK_SET)>=0 && safe_read(fd, &temp, 1)==1) {
|
2006-07-16 13:44:35 +05:30
|
|
|
if (bottom == top) bottom = top = (top+1) * 2;
|
|
|
|
else bottom = pos;
|
|
|
|
|
2006-09-15 01:22:07 +05:30
|
|
|
// If we can't, it's smaller.
|
2006-07-16 13:44:35 +05:30
|
|
|
|
|
|
|
} else {
|
|
|
|
if (bottom == top) {
|
|
|
|
if (!top) return 0;
|
|
|
|
bottom = top/2;
|
|
|
|
}
|
|
|
|
else top = pos;
|
|
|
|
}
|
|
|
|
} while (bottom + 1 != top);
|
|
|
|
|
|
|
|
return pos + 1;
|
|
|
|
}
|
2008-01-28 05:11:34 +05:30
|
|
|
#endif
|
2006-08-03 21:11:12 +05:30
|
|
|
|
2008-12-24 05:06:47 +05:30
|
|
|
char* FAST_FUNC xmalloc_ttyname(int fd)
|
|
|
|
{
|
|
|
|
char *buf = xzalloc(128);
|
|
|
|
int r = ttyname_r(fd, buf, 127);
|
|
|
|
if (r) {
|
|
|
|
free(buf);
|
|
|
|
buf = NULL;
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2006-09-21 03:36:01 +05:30
|
|
|
/* It is perfectly ok to pass in a NULL for either width or for
|
2006-10-27 14:33:24 +05:30
|
|
|
* height, in which case that value will not be set. */
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC get_terminal_width_height(int fd, unsigned *width, unsigned *height)
|
2006-09-21 03:36:01 +05:30
|
|
|
{
|
|
|
|
struct winsize win = { 0, 0, 0, 0 };
|
|
|
|
int ret = ioctl(fd, TIOCGWINSZ, &win);
|
2006-10-27 14:33:24 +05:30
|
|
|
|
|
|
|
if (height) {
|
|
|
|
if (!win.ws_row) {
|
|
|
|
char *s = getenv("LINES");
|
|
|
|
if (s) win.ws_row = atoi(s);
|
|
|
|
}
|
|
|
|
if (win.ws_row <= 1 || win.ws_row >= 30000)
|
|
|
|
win.ws_row = 24;
|
|
|
|
*height = (int) win.ws_row;
|
2006-09-21 03:36:01 +05:30
|
|
|
}
|
2006-10-27 14:33:24 +05:30
|
|
|
|
|
|
|
if (width) {
|
|
|
|
if (!win.ws_col) {
|
|
|
|
char *s = getenv("COLUMNS");
|
|
|
|
if (s) win.ws_col = atoi(s);
|
|
|
|
}
|
|
|
|
if (win.ws_col <= 1 || win.ws_col >= 30000)
|
|
|
|
win.ws_col = 80;
|
|
|
|
*width = (int) win.ws_col;
|
2006-09-21 03:36:01 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2008-11-05 18:50:58 +05:30
|
|
|
|
|
|
|
int FAST_FUNC tcsetattr_stdin_TCSANOW(const struct termios *tp)
|
|
|
|
{
|
|
|
|
return tcsetattr(STDIN_FILENO, TCSANOW, tp);
|
|
|
|
}
|
2009-10-15 12:54:25 +05:30
|
|
|
|
|
|
|
void FAST_FUNC generate_uuid(uint8_t *buf)
|
|
|
|
{
|
|
|
|
/* http://www.ietf.org/rfc/rfc4122.txt
|
|
|
|
* 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
|
|
|
|
* +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
|
|
|
* | time_low |
|
|
|
|
* +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
|
|
|
* | time_mid | time_hi_and_version |
|
|
|
|
* +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
|
|
|
* |clk_seq_and_variant | node (0-1) |
|
|
|
|
* +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
|
|
|
* | node (2-5) |
|
|
|
|
* +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
|
|
|
* IOW, uuid has this layout:
|
|
|
|
* uint32_t time_low (big endian)
|
|
|
|
* uint16_t time_mid (big endian)
|
|
|
|
* uint16_t time_hi_and_version (big endian)
|
|
|
|
* version is a 4-bit field:
|
|
|
|
* 1 Time-based
|
|
|
|
* 2 DCE Security, with embedded POSIX UIDs
|
|
|
|
* 3 Name-based (MD5)
|
|
|
|
* 4 Randomly generated
|
|
|
|
* 5 Name-based (SHA-1)
|
|
|
|
* uint16_t clk_seq_and_variant (big endian)
|
|
|
|
* variant is a 3-bit field:
|
|
|
|
* 0xx Reserved, NCS backward compatibility
|
|
|
|
* 10x The variant specified in rfc4122
|
|
|
|
* 110 Reserved, Microsoft backward compatibility
|
|
|
|
* 111 Reserved for future definition
|
|
|
|
* uint8_t node[6]
|
|
|
|
*
|
|
|
|
* For version 4, these bits are set/cleared:
|
|
|
|
* time_hi_and_version & 0x0fff | 0x4000
|
|
|
|
* clk_seq_and_variant & 0x3fff | 0x8000
|
|
|
|
*/
|
|
|
|
pid_t pid;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
i = open("/dev/urandom", O_RDONLY);
|
|
|
|
if (i >= 0) {
|
|
|
|
read(i, buf, 16);
|
|
|
|
close(i);
|
|
|
|
}
|
|
|
|
/* Paranoia. /dev/urandom may be missing.
|
|
|
|
* rand() is guaranteed to generate at least [0, 2^15) range,
|
|
|
|
* but lowest bits in some libc are not so "random". */
|
|
|
|
srand(monotonic_us());
|
|
|
|
pid = getpid();
|
|
|
|
while (1) {
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
buf[i] ^= rand() >> 5;
|
|
|
|
if (pid == 0)
|
|
|
|
break;
|
|
|
|
srand(pid);
|
|
|
|
pid = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* version = 4 */
|
|
|
|
buf[4 + 2 ] = (buf[4 + 2 ] & 0x0f) | 0x40;
|
|
|
|
/* variant = 10x */
|
|
|
|
buf[4 + 2 + 2] = (buf[4 + 2 + 2] & 0x3f) | 0x80;
|
|
|
|
}
|