2003-12-04 02:01:39 +00:00
|
|
|
/*
|
|
|
|
* Utility functions.
|
|
|
|
*
|
|
|
|
* Copyright 2003 Dimitrie O. Paun
|
|
|
|
* Copyright 2003 Ferenc Wagner
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
2004-06-15 22:45:15 +00:00
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
2003-12-04 02:01:39 +00:00
|
|
|
*/
|
2004-06-15 22:45:15 +00:00
|
|
|
|
2004-03-30 04:32:46 +00:00
|
|
|
#include <unistd.h>
|
2004-03-19 19:15:23 +00:00
|
|
|
#include <errno.h>
|
2003-12-04 02:01:39 +00:00
|
|
|
|
|
|
|
#include "winetest.h"
|
|
|
|
|
|
|
|
void *xmalloc (size_t len)
|
|
|
|
{
|
|
|
|
void *p = malloc (len);
|
|
|
|
|
2004-01-15 01:48:05 +00:00
|
|
|
if (!p) report (R_FATAL, "Out of memory.");
|
2003-12-04 02:01:39 +00:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *xrealloc (void *op, size_t len)
|
|
|
|
{
|
|
|
|
void *p = realloc (op, len);
|
|
|
|
|
2005-03-18 14:09:55 +00:00
|
|
|
if (len && !p) report (R_FATAL, "Out of memory.");
|
2003-12-04 02:01:39 +00:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2005-06-16 10:45:25 +00:00
|
|
|
static char *vstrfmtmake (size_t *lenp, const char *fmt, va_list ap)
|
2003-12-04 02:01:39 +00:00
|
|
|
{
|
|
|
|
size_t size = 1000;
|
|
|
|
char *p, *q;
|
|
|
|
int n;
|
|
|
|
|
|
|
|
p = malloc (size);
|
|
|
|
if (!p) return NULL;
|
|
|
|
while (1) {
|
|
|
|
n = vsnprintf (p, size, fmt, ap);
|
|
|
|
if (n < 0) size *= 2; /* Windows */
|
|
|
|
else if ((unsigned)n >= size) size = n+1; /* glibc */
|
|
|
|
else break;
|
|
|
|
q = realloc (p, size);
|
|
|
|
if (!q) {
|
|
|
|
free (p);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
p = q;
|
|
|
|
}
|
|
|
|
if (lenp) *lenp = n;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2004-03-30 04:32:46 +00:00
|
|
|
char *vstrmake (size_t *lenp, va_list ap)
|
|
|
|
{
|
|
|
|
const char *fmt;
|
|
|
|
|
|
|
|
fmt = va_arg (ap, const char*);
|
|
|
|
return vstrfmtmake (lenp, fmt, ap);
|
|
|
|
}
|
|
|
|
|
2004-01-15 01:48:05 +00:00
|
|
|
char *strmake (size_t *lenp, ...)
|
2003-12-04 02:01:39 +00:00
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
char *p;
|
|
|
|
|
2004-01-15 01:48:05 +00:00
|
|
|
va_start (ap, lenp);
|
|
|
|
p = vstrmake (lenp, ap);
|
|
|
|
if (!p) report (R_FATAL, "Out of memory.");
|
2003-12-04 02:01:39 +00:00
|
|
|
va_end (ap);
|
|
|
|
return p;
|
|
|
|
}
|
2004-02-19 04:12:42 +00:00
|
|
|
|
2004-03-30 04:32:46 +00:00
|
|
|
void xprintf (const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
size_t size;
|
|
|
|
ssize_t written;
|
|
|
|
char *buffer, *head;
|
|
|
|
|
|
|
|
va_start (ap, fmt);
|
|
|
|
buffer = vstrfmtmake (&size, fmt, ap);
|
|
|
|
head = buffer;
|
|
|
|
va_end (ap);
|
|
|
|
while ((written = write (1, head, size)) != size) {
|
|
|
|
if (written == -1)
|
|
|
|
report (R_FATAL, "Can't write logs: %d", errno);
|
|
|
|
head += written;
|
|
|
|
size -= written;
|
|
|
|
}
|
|
|
|
free (buffer);
|
|
|
|
}
|
|
|
|
|
2005-04-18 09:54:24 +00:00
|
|
|
int
|
|
|
|
goodtagchar (char c)
|
|
|
|
{
|
|
|
|
return (('a'<=c && c<='z') ||
|
|
|
|
('A'<=c && c<='Z') ||
|
|
|
|
('0'<=c && c<='9') ||
|
|
|
|
c=='-' || c=='.');
|
|
|
|
}
|
|
|
|
|
2004-04-22 23:43:54 +00:00
|
|
|
const char *
|
2005-04-18 09:54:24 +00:00
|
|
|
findbadtagchar (const char *tag)
|
2004-02-19 04:12:42 +00:00
|
|
|
{
|
|
|
|
while (*tag)
|
2005-04-18 09:54:24 +00:00
|
|
|
if (goodtagchar (*tag)) tag++;
|
2004-02-19 04:12:42 +00:00
|
|
|
else return tag;
|
|
|
|
return NULL;
|
|
|
|
}
|