| 3 |
|
#endif |
| 4 |
|
/* |
| 5 |
|
* Load whitespace separated words from a file into an array. |
| 6 |
– |
* Assume the passed pointer array is big enough to hold them all. |
| 6 |
|
* |
| 7 |
< |
* External symbols declared in standard.h |
| 7 |
> |
* External symbols declared in rtio.h |
| 8 |
|
*/ |
| 9 |
|
|
| 10 |
< |
/* ==================================================================== |
| 12 |
< |
* The Radiance Software License, Version 1.0 |
| 13 |
< |
* |
| 14 |
< |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
| 15 |
< |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
| 16 |
< |
* |
| 17 |
< |
* Redistribution and use in source and binary forms, with or without |
| 18 |
< |
* modification, are permitted provided that the following conditions |
| 19 |
< |
* are met: |
| 20 |
< |
* |
| 21 |
< |
* 1. Redistributions of source code must retain the above copyright |
| 22 |
< |
* notice, this list of conditions and the following disclaimer. |
| 23 |
< |
* |
| 24 |
< |
* 2. Redistributions in binary form must reproduce the above copyright |
| 25 |
< |
* notice, this list of conditions and the following disclaimer in |
| 26 |
< |
* the documentation and/or other materials provided with the |
| 27 |
< |
* distribution. |
| 28 |
< |
* |
| 29 |
< |
* 3. The end-user documentation included with the redistribution, |
| 30 |
< |
* if any, must include the following acknowledgment: |
| 31 |
< |
* "This product includes Radiance software |
| 32 |
< |
* (http://radsite.lbl.gov/) |
| 33 |
< |
* developed by the Lawrence Berkeley National Laboratory |
| 34 |
< |
* (http://www.lbl.gov/)." |
| 35 |
< |
* Alternately, this acknowledgment may appear in the software itself, |
| 36 |
< |
* if and wherever such third-party acknowledgments normally appear. |
| 37 |
< |
* |
| 38 |
< |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
| 39 |
< |
* and "The Regents of the University of California" must |
| 40 |
< |
* not be used to endorse or promote products derived from this |
| 41 |
< |
* software without prior written permission. For written |
| 42 |
< |
* permission, please contact [email protected]. |
| 43 |
< |
* |
| 44 |
< |
* 5. Products derived from this software may not be called "Radiance", |
| 45 |
< |
* nor may "Radiance" appear in their name, without prior written |
| 46 |
< |
* permission of Lawrence Berkeley National Laboratory. |
| 47 |
< |
* |
| 48 |
< |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
| 49 |
< |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| 50 |
< |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 51 |
< |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
| 52 |
< |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 53 |
< |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 54 |
< |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
| 55 |
< |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| 56 |
< |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
| 57 |
< |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
| 58 |
< |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 59 |
< |
* SUCH DAMAGE. |
| 60 |
< |
* ==================================================================== |
| 61 |
< |
* |
| 62 |
< |
* This software consists of voluntary contributions made by many |
| 63 |
< |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
| 64 |
< |
* information on Lawrence Berkeley National Laboratory, please see |
| 65 |
< |
* <http://www.lbl.gov/>. |
| 66 |
< |
*/ |
| 10 |
> |
#include "copyright.h" |
| 11 |
|
|
| 12 |
|
#include <ctype.h> |
| 13 |
|
|
| 14 |
< |
#define NULL 0 |
| 14 |
> |
#include "platform.h" |
| 15 |
> |
#include "rtio.h" |
| 16 |
> |
#include "rtmisc.h" |
| 17 |
|
|
| 72 |
– |
#define MAXFLEN 8192 /* file must be smaller than this */ |
| 18 |
|
|
| 19 |
< |
extern char *bmalloc(); |
| 19 |
> |
#define MAXWLEN 4096 /* words must be shorter than this */ |
| 20 |
|
|
| 21 |
|
|
| 22 |
|
int |
| 23 |
< |
wordfile(words, fname) /* get words from fname, put in words */ |
| 24 |
< |
char **words; |
| 25 |
< |
char *fname; |
| 23 |
> |
wordfile( /* get words from fname, put in words */ |
| 24 |
> |
char **words, |
| 25 |
> |
int nargs, |
| 26 |
> |
char *fname |
| 27 |
> |
) |
| 28 |
|
{ |
| 29 |
+ |
int wrdcnt = 0; |
| 30 |
+ |
int n = 0; |
| 31 |
|
int fd; |
| 32 |
< |
char buf[MAXFLEN]; |
| 84 |
< |
register int n; |
| 32 |
> |
char buf[MAXWLEN]; |
| 33 |
|
/* load file into buffer */ |
| 34 |
< |
if (fname == NULL) |
| 34 |
> |
if (fname == NULL || !*fname) |
| 35 |
|
return(-1); /* no filename */ |
| 36 |
+ |
if (nargs <= 1) |
| 37 |
+ |
return(-1); |
| 38 |
|
if ((fd = open(fname, 0)) < 0) |
| 39 |
|
return(-1); /* open error */ |
| 40 |
< |
n = read(fd, buf, MAXFLEN); |
| 40 |
> |
words[0] = NULL; |
| 41 |
> |
while (nargs > 1 && (n += read(fd, buf+n, MAXWLEN-n)) > 0) { |
| 42 |
> |
int dlen = n; |
| 43 |
> |
int crem = 0; |
| 44 |
> |
if (n > MAXWLEN/2) /* check for mid-word end */ |
| 45 |
> |
while (!isspace(buf[--n])) { |
| 46 |
> |
if (n <= 0) /* one long word! */ |
| 47 |
> |
goto done; |
| 48 |
> |
++crem; |
| 49 |
> |
} |
| 50 |
> |
buf[n] = '\0'; /* terminate & parse */ |
| 51 |
> |
n = wordstring(words, nargs, buf); |
| 52 |
> |
if (n < 0) { |
| 53 |
> |
wrdcnt = -1; /* memory error */ |
| 54 |
> |
break; |
| 55 |
> |
} |
| 56 |
> |
words += n; nargs -= n; |
| 57 |
> |
wrdcnt += n; |
| 58 |
> |
if ((n = crem) > 0) /* move remainder */ |
| 59 |
> |
memmove(buf, buf+dlen-crem, crem); |
| 60 |
> |
} |
| 61 |
> |
done: |
| 62 |
|
close(fd); |
| 63 |
< |
if (n < 0) /* read error */ |
| 93 |
< |
return(-1); |
| 94 |
< |
if (n == MAXFLEN) /* file too big, take what we can */ |
| 95 |
< |
while (!isspace(buf[--n])) |
| 96 |
< |
if (n <= 0) /* one long word! */ |
| 97 |
< |
return(-1); |
| 98 |
< |
buf[n] = '\0'; /* terminate */ |
| 99 |
< |
return(wordstring(words, buf)); /* wordstring does the rest */ |
| 63 |
> |
return(wrdcnt); |
| 64 |
|
} |
| 65 |
|
|
| 66 |
|
|
| 67 |
|
int |
| 68 |
< |
wordstring(avl, str) /* allocate and load argument list */ |
| 69 |
< |
char **avl; |
| 70 |
< |
char *str; |
| 68 |
> |
wordstring( /* allocate and load argument list */ |
| 69 |
> |
char **avl, |
| 70 |
> |
int nargs, |
| 71 |
> |
char *str |
| 72 |
> |
) |
| 73 |
|
{ |
| 74 |
< |
register char *cp, **ap; |
| 74 |
> |
char *cp, **ap; |
| 75 |
|
|
| 76 |
|
if (str == NULL) |
| 77 |
|
return(-1); |
| 79 |
|
if (cp == NULL) /* ENOMEM */ |
| 80 |
|
return(-1); |
| 81 |
|
strcpy(cp, str); |
| 82 |
< |
ap = avl; /* parse into words */ |
| 83 |
< |
for ( ; ; ) { |
| 82 |
> |
/* parse into words */ |
| 83 |
> |
for (ap = avl; ap-avl < nargs-1; ap++) { |
| 84 |
|
while (isspace(*cp)) /* nullify spaces */ |
| 85 |
|
*cp++ = '\0'; |
| 86 |
|
if (!*cp) /* all done? */ |
| 87 |
|
break; |
| 88 |
< |
*ap++ = cp; /* add argument to list */ |
| 88 |
> |
*ap = cp; /* add argument to list */ |
| 89 |
|
while (*++cp && !isspace(*cp)) |
| 90 |
|
; |
| 91 |
|
} |
| 92 |
+ |
*cp = '\0'; /* terminates overflow */ |
| 93 |
|
*ap = NULL; |
| 94 |
|
return(ap - avl); |
| 95 |
|
} |
