1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312
|
/*
NrrdIO: stand-alone code for basic nrrd functionality
Copyright (C) 2008, 2007, 2006, 2005 Gordon Kindlmann
Copyright (C) 2004, 2003, 2002, 2001, 2000, 1999, 1998 University of Utah
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any
damages arising from the use of this software.
Permission is granted to anyone to use this software for any
purpose, including commercial applications, and to alter it and
redistribute it freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must
not claim that you wrote the original software. If you use this
software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
#include "NrrdIO.h"
/*
** with the Nov'09 re-write of biff, this sourcefile becomes the only
** place where a static buffer is used for message handling; this
** should eventually be avoided by using things like asprintf and
** vasprintf which allocated the string as needed
*/
#define _HACK_STRLEN AIR_STRLEN_HUGE
#define _MSG_INCR 2
biffMsg *
biffMsgNew(const char *key) {
static const char me[]="biffMsgNew";
biffMsg *msg;
if (!key) {
fprintf(stderr, "%s: PANIC got NULL key\n", me);
exit(1);
}
msg = AIR_CALLOC(1, biffMsg);
if (msg) {
msg->key = airStrdup(key);
msg->err = NULL;
msg->errNum = 0;
msg->errArr = airArrayNew(AIR_CAST(void**, &(msg->err)),
&(msg->errNum), sizeof(char*), _MSG_INCR);
if (msg->errArr) {
airArrayPointerCB(msg->errArr, NULL, airFree);
}
}
if (!( msg && msg->key && msg->errArr )) {
fprintf(stderr, "%s: PANIC couldn't calloc new msg\n", me);
exit(1);
}
return msg;
}
biffMsg *
biffMsgNix(biffMsg *msg) {
if (msg && msg != biffMsgNoop) {
airFree(msg->key);
airArrayLenSet(msg->errArr, 0); /* frees all msg->err[i] */
airArrayNuke(msg->errArr);
airFree(msg);
}
return NULL;
}
/*
** adds a given message to the given entry. The message is processed to
** convert all whitespace into ' ', and to eliminate whitespace at the
** end of the message.
*/
void
biffMsgAdd(biffMsg *msg, const char *err) {
static const char me[]="biffMsgAdd";
unsigned int idx;
if (biffMsgNoop == msg) {
return;
}
if (!( msg && err )) {
fprintf(stderr, "%s: PANIC got NULL msg (%p) or err (%p)\n", me, msg, err);
exit(1);
}
idx = airArrayLenIncr(msg->errArr, 1);
if (!msg->err) {
fprintf(stderr, "%s: PANIC: couldn't add message to %s\n", me, msg->key);
exit(1);
}
if (!( msg->err[idx] = airOneLinify(airStrdup(err)) )) {
fprintf(stderr, "%s: PANIC: couldn't alloc message to %s\n", me, msg->key);
exit(1);
}
return;
}
void
biffMsgAddVL(biffMsg *msg, const char *errfmt, va_list args) {
char errstr[_HACK_STRLEN];
vsprintf(errstr, errfmt, args);
biffMsgAdd(msg, errstr);
return;
}
void
biffMsgAddf(biffMsg *msg, const char *errfmt, ...) {
va_list args;
va_start(args, errfmt);
biffMsgAddVL(msg, errfmt, args);
va_end(args);
return;
}
void
biffMsgClear(biffMsg *msg) {
if (biffMsgNoop == msg) {
return;
}
airArrayLenSet(msg->errArr, 0); /* frees all msg->err[i] */
/* but msg->key stays allocated */
return;
}
/*
** max length of line formatted "[<key>] <err>\n"
*/
unsigned int
biffMsgLineLenMax(const biffMsg *msg) {
unsigned int ii, len, maxlen;
if (biffMsgNoop == msg) {
return 0;
}
maxlen = 0;
for (ii=0; ii<msg->errNum; ii++) {
len = AIR_CAST(unsigned int, strlen(msg->err[ii]) + strlen(msg->key) + strlen("[] \n"));
maxlen = AIR_MAX(maxlen, len);
}
return maxlen;
}
/*
******** biffMsgMove
**
** "src" is not const because we clear it after moving things out
*/
void
biffMsgMove(biffMsg *dest, biffMsg *src, const char *err) {
static const char me[]="biffMsgMove";
unsigned int ii;
char *buff;
if (biffMsgNoop == dest || biffMsgNoop == src) {
return;
}
if (!( dest && src )) {
fprintf(stderr, "%s: PANIC got NULL msg (%p %p)\n", me, dest, src);
exit(1);
}
/* if src and dest are same, this degenerates to biffMsgAdd */
if (dest == src && airStrlen(err)) {
biffMsgAdd(dest, err);
return;
}
buff = AIR_CALLOC(biffMsgLineLenMax(src)+1, char);
if (!buff) {
fprintf(stderr, "%s: PANIC: can't allocate buffer\n", me);
exit(1);
}
for (ii=0; ii<src->errNum; ii++) {
sprintf(buff, "[%s] %s", src->key, src->err[ii]);
biffMsgAdd(dest, buff);
}
free(buff);
biffMsgClear(src);
if (airStrlen(err)) {
biffMsgAdd(dest, err);
}
return;
}
void
biffMsgMoveVL(biffMsg *dest, biffMsg *src,
const char *errfmt, va_list args) {
char errstr[_HACK_STRLEN];
vsprintf(errstr, errfmt, args);
biffMsgMove(dest, src, errstr);
return;
}
void
biffMsgMovef(biffMsg *dest, biffMsg *src, const char *errfmt, ...) {
va_list args;
va_start(args, errfmt);
biffMsgMoveVL(dest, src, errfmt, args);
va_end(args);
return;
}
/*
******** biffMsgStrlen
**
** returns length of string (not including null termination, as usual)
** of the error message that will be generated by biffMsgStrSet
*/
unsigned int
biffMsgStrlen(const biffMsg *msg) {
static const char me[]="biffMsgStrlen";
unsigned int ii, len;
if (biffMsgNoop == msg) {
return 0;
}
if (!( msg )) {
fprintf(stderr, "%s: PANIC got NULL msg %p\n", me, msg);
exit(1);
}
len = 0;
for (ii=0; ii<msg->errNum; ii++) {
len += AIR_CAST(unsigned int, strlen(msg->key) + strlen(msg->err[ii]) + strlen("[] \n"));
}
return len+1;
}
char *
biffMsgStrAlloc(const biffMsg *msg) {
static const char me[]="biffMsgStrAlloc";
char *ret;
unsigned int len;
if (biffMsgNoop == msg) {
return NULL;
}
len = biffMsgStrlen(msg);
ret = AIR_CALLOC(len+1, char);
if (!ret) {
fprintf(stderr, "%s: PANIC couldn't alloc string", me);
exit(1);
}
return ret;
}
/*
** ret is assumed to be allocated for biffMsgStrlen()+1, or is the
** the return from biffMsgStrAlloc
*/
void
biffMsgStrSet(char *ret, const biffMsg *msg) {
static const char me[]="biffMsgStrSet";
char *buff;
unsigned int ii;
if (biffMsgNoop == msg) {
return;
}
buff = AIR_CALLOC(biffMsgLineLenMax(msg)+1, char);
if (!buff) {
fprintf(stderr, "%s: PANIC couldn't alloc buffer", me);
exit(1);
}
strcpy(ret, "");
for (ii=msg->errNum; ii>0; ii--) {
sprintf(buff, "[%s] %s\n", msg->key, msg->err[ii-1]);
strcat(ret, buff);
}
free(buff);
}
char *
biffMsgStrGet(const biffMsg *msg) {
char *ret;
if (biffMsgNoop == msg) {
return NULL;
}
ret = biffMsgStrAlloc(msg);
biffMsgStrSet(ret, msg);
return ret;
}
biffMsg
_biffMsgNoop = {
NULL,
NULL,
0,
NULL
};
/*
******** biffMsgNoop
**
** pass this instead of a real biffMsg (allocated by biffMsgNew) as a
** flag to say, "don't bother, really". This turns all the biffMsg
** functions into no-ops (except that var-args are still consumed
** where they are used)
*/
biffMsg *
biffMsgNoop = &_biffMsgNoop;
|