2007-02-15 07:20:47 +03:00
|
|
|
/* Written by Kris Maglione <fbsdaemon at gmail dot com> */
|
|
|
|
/* Public domain */
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2007-03-04 21:54:02 +03:00
|
|
|
#include "wmii.h"
|
2007-02-15 07:20:47 +03:00
|
|
|
|
|
|
|
void
|
|
|
|
fatal(const char *fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vfprintf(stderr, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
emalloc(uint size) {
|
|
|
|
void *ret = malloc(size);
|
|
|
|
if(!ret)
|
|
|
|
fatal("fatal: could not malloc() %d bytes\n", size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
emallocz(uint size) {
|
|
|
|
void *ret = emalloc(size);
|
|
|
|
memset(ret, 0, size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
erealloc(void *ptr, uint size) {
|
|
|
|
void *ret = realloc(ptr, size);
|
|
|
|
if(!ret)
|
|
|
|
fatal("fatal: could not realloc() %d bytes\n", size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
estrdup(const char *str) {
|
|
|
|
void *ret = strdup(str);
|
|
|
|
if(!ret)
|
|
|
|
fatal("fatal: could not strdup() %u bytes\n", strlen(str));
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint
|
|
|
|
tokenize(char *res[], uint reslen, char *str, char delim) {
|
|
|
|
char *s;
|
|
|
|
uint i;
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
s = str;
|
|
|
|
while(i < reslen && *s) {
|
|
|
|
while(*s == delim)
|
|
|
|
*(s++) = '\0';
|
|
|
|
if(*s)
|
|
|
|
res[i++] = s;
|
|
|
|
while(*s && *s != delim)
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
return i;
|
|
|
|
}
|
2007-02-12 06:17:20 +03:00
|
|
|
|
|
|
|
int
|
|
|
|
max(int a, int b) {
|
|
|
|
if(a > b)
|
|
|
|
return a;
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
str_nil(char *s) {
|
|
|
|
if(s)
|
|
|
|
return s;
|
|
|
|
return "<nil>";
|
|
|
|
}
|
2007-03-03 20:36:44 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
|
|
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
|
|
* THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
|
|
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
|
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Appends src to string dst of size siz (unlike strncat, siz is the
|
|
|
|
* full size of dst, not space left). At most siz-1 characters
|
|
|
|
* will be copied. Always NUL terminates (unless siz <= strlen(dst)).
|
|
|
|
* Returns strlen(src) + MIN(siz, strlen(initial dst)).
|
|
|
|
* If retval >= siz, truncation occurred.
|
|
|
|
*/
|
|
|
|
uint
|
|
|
|
strlcat(char *dst, const char *src, unsigned int siz) {
|
|
|
|
const char *s;
|
|
|
|
char *d;
|
|
|
|
unsigned int n, dlen;
|
|
|
|
|
|
|
|
n = siz;
|
|
|
|
s = src;
|
|
|
|
d = dst;
|
|
|
|
|
|
|
|
/* Find the end of dst and adjust bytes left but don't go past end */
|
|
|
|
while (n-- != 0 && *d != '\0')
|
|
|
|
d++;
|
|
|
|
dlen = d - dst;
|
|
|
|
n = siz - dlen;
|
|
|
|
|
|
|
|
if (n == 0)
|
|
|
|
return(dlen + strlen(s));
|
|
|
|
while (*s != '\0') {
|
|
|
|
if (n != 1) {
|
|
|
|
*d++ = *s;
|
|
|
|
n--;
|
|
|
|
}
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
*d = '\0';
|
|
|
|
|
|
|
|
return(dlen + (s - src)); /* count does not include NUL */
|
|
|
|
}
|