2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 static const char copyright[] =
39 "@(#) Copyright (c) 1989, 1993\n\
40 The Regents of the University of California. All rights reserved.\n";
45 static const char sccsid[] = "@(#)strfile.c 8.1 (Berkeley) 5/31/93";
47 static const char rcsid[] =
52 # include <sys/param.h>
63 * This program takes a file composed of strings seperated by
64 * lines starting with two consecutive delimiting character (default
65 * character is '%') and creates another file which consists of a table
66 * describing the file (structure from "strfile.h"), a table of seek
67 * pointers to the start of the strings, and the strings, each terminated
68 * by a null byte. Usage:
70 * % strfile [-iorsx] [ -cC ] sourcefile [ datafile ]
72 * C - Allow comments marked by a double delimiter at line's beginning
73 * c - Change delimiting character from '%' to 'C'
74 * s - Silent. Give no summary of data processed at the end of
76 * o - order the strings in alphabetic order
77 * i - if ordering, ignore case
78 * r - randomize the order of the strings
81 * Ken Arnold Sept. 7, 1978 --
83 * Added ordering options.
89 # define STORING_PTRS (Oflag || Rflag)
90 # define CHUNKSIZE 512
92 # define ALLOC(ptr,sz) { \
94 ptr = malloc((unsigned int) (CHUNKSIZE * sizeof *ptr)); \
95 else if (((sz) + 1) % CHUNKSIZE == 0) \
96 ptr = realloc((void *) ptr, ((unsigned int) ((sz) + CHUNKSIZE) * sizeof *ptr)); \
98 fprintf(stderr, "out of space\n"); \
112 char *Infile = NULL, /* input file name */
113 Outfile[MAXPATHLEN] = "", /* output file name */
114 Delimch = '%'; /* delimiting character */
116 int Cflag = FALSE; /* embedded comments */
117 int Sflag = FALSE; /* silent run flag */
118 int Oflag = FALSE; /* ordering flag */
119 int Iflag = FALSE; /* ignore case flag */
120 int Rflag = FALSE; /* randomize order flag */
121 int Xflag = FALSE; /* set rotated bit */
122 long Num_pts = 0; /* number of pointers/strings */
126 FILE *Sort_1, *Sort_2; /* pointers for sorting */
128 STRFILE Tbl; /* statistics table */
130 STR *Firstch; /* first chars of each string */
132 void getargs(), add_offset(), do_order(), randomize(), usage();
137 * Drive the sucker. There are two main modes -- either we store
138 * the seek pointers, if the table is to be sorted or randomized,
139 * or we write the pointer directly to the file, if we are to stay
140 * in file order. If the former, we allocate and re-allocate in
141 * CHUNKSIZE blocks; if the latter, we just write each pointer,
142 * and then seek back to the beginning to write in the table.
148 register char *sp, dc;
149 register FILE *inf, *outf;
150 register long last_off, length, pos, *p;
151 register int first, cnt;
154 static char string[257];
156 (void) setlocale(LC_ALL, "");
158 getargs(ac, av); /* evalute arguments */
160 if ((inf = fopen(Infile, "r")) == NULL) {
165 if ((outf = fopen(Outfile, "w")) == NULL) {
170 (void) fseek(outf, (long) sizeof Tbl, 0);
173 * Write the strings onto the file
177 Tbl.str_shortlen = ~((unsigned long) 0);
179 Tbl.str_version = VERSION;
181 add_offset(outf, ftell(inf));
184 sp = fgets(string, 256, inf);
185 if (sp == NULL || (sp[0] == dc && sp[1] == '\n')) {
187 length = pos - last_off - (sp ? strlen(sp) : 0);
191 add_offset(outf, pos);
192 if (Tbl.str_longlen < length)
193 Tbl.str_longlen = length;
194 if (Tbl.str_shortlen > length)
195 Tbl.str_shortlen = length;
199 for (nsp = sp; !isalnum((unsigned char)*nsp); nsp++)
201 ALLOC(Firstch, Num_pts);
202 fp = &Firstch[Num_pts - 1];
203 if (Iflag && isupper((unsigned char)*nsp))
204 fp->first = tolower((unsigned char)*nsp);
207 fp->pos = Seekpts[Num_pts - 1];
210 } while (sp != NULL);
213 * write the tables in
217 Tbl.str_numstr = Num_pts - 1;
220 Tbl.str_flags |= STR_COMMENTS;
228 Tbl.str_flags |= STR_ROTATED;
231 printf("\"%s\" created\n", Outfile);
233 puts("There was 1 string");
235 printf("There were %ld strings\n", Num_pts - 1);
236 printf("Longest string: %lu byte%s\n", Tbl.str_longlen,
237 Tbl.str_longlen == 1 ? "" : "s");
238 printf("Shortest string: %lu byte%s\n", Tbl.str_shortlen,
239 Tbl.str_shortlen == 1 ? "" : "s");
243 Tbl.str_version = htonl(Tbl.str_version);
244 Tbl.str_numstr = htonl(Tbl.str_numstr);
245 Tbl.str_longlen = htonl(Tbl.str_longlen);
246 Tbl.str_shortlen = htonl(Tbl.str_shortlen);
247 Tbl.str_flags = htonl(Tbl.str_flags);
248 (void) fwrite((char *) &Tbl, sizeof Tbl, 1, outf);
250 for (p = Seekpts, cnt = Num_pts; cnt--; ++p)
252 (void) fwrite((char *) Seekpts, sizeof *Seekpts, (int) Num_pts, outf);
259 * This routine evaluates arguments from the command line
261 void getargs(argc, argv)
269 while ((ch = getopt(argc, argv, "Cc:iorsx")) != EOF)
271 case 'C': /* embedded comments */
274 case 'c': /* new delimiting char */
276 if (!isascii(Delimch)) {
277 printf("bad delimiting character: '\\%o\n'",
278 (unsigned char)Delimch);
281 case 'i': /* ignore case in ordering */
284 case 'o': /* order strings */
287 case 'r': /* randomize pointers */
290 case 's': /* silent */
293 case 'x': /* set the rotated bit */
305 (void) strcpy(Outfile, *argv);
308 puts("No input file name");
311 if (*Outfile == '\0') {
312 (void) strcpy(Outfile, Infile);
313 (void) strcat(Outfile, ".dat");
319 (void) fprintf(stderr,
320 "strfile [-iorsx] [-c char] sourcefile [datafile]\n");
326 * Add an offset to the list, or write it out, as appropriate.
328 void add_offset(fp, off)
336 fwrite(&net, 1, sizeof net, fp);
338 ALLOC(Seekpts, Num_pts + 1);
339 Seekpts[Num_pts] = off;
346 * Order the strings alphabetically (possibly ignoring case).
354 Sort_1 = fopen(Infile, "r");
355 Sort_2 = fopen(Infile, "r");
356 qsort((char *) Firstch, (int) Tbl.str_numstr, sizeof *Firstch, cmp_str);
362 (void) fclose(Sort_1);
363 (void) fclose(Sort_2);
364 Tbl.str_flags |= STR_ORDERED;
367 static int collate_range_cmp (c1, c2)
370 static char s1[2], s2[2];
379 if ((ret = strcoll(s1, s2)) != 0)
386 * Compare two strings in the file
395 # define SET_N(nf,ch) (nf = (ch == '\n'))
396 # define IS_END(ch,nf) (ch == EOF || (ch == (unsigned char) Delimch && nf))
398 c1 = (unsigned char) p1->first;
399 c2 = (unsigned char) p2->first;
400 if ((r = collate_range_cmp(c1, c2)) != 0)
403 (void) fseek(Sort_1, p1->pos, 0);
404 (void) fseek(Sort_2, p2->pos, 0);
408 while (!isalnum(c1 = getc(Sort_1)) && c1 != '\0' && c1 != EOF)
410 while (!isalnum(c2 = getc(Sort_2)) && c2 != '\0' && c2 != EOF)
413 while (!IS_END(c1, n1) && !IS_END(c2, n2)) {
420 if ((r = collate_range_cmp(c1, c2)) != 0)
431 return collate_range_cmp(c1, c2);
436 * Randomize the order of the string table. We must be careful
437 * not to randomize across delimiter boundaries. All
438 * randomization is done within each block.
448 Tbl.str_flags |= STR_RANDOM;
449 cnt = Tbl.str_numstr;
452 * move things around randomly
455 for (sp = Seekpts; cnt > 0; cnt--, sp++) {