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
36 * $FreeBSD: src/games/fortune/strfile/strfile.c,v 1.15.2.2 2001/03/05 11:52:37 kris Exp $
37 * $DragonFly: src/games/fortune/strfile/strfile.c,v 1.5 2006/08/08 16:58:59 pavalos Exp $
39 * @(#) Copyright (c) 1989, 1993 The Regents of the University of California. All rights reserved.
40 * @(#)strfile.c 8.1 (Berkeley) 5/31/93
41 * $FreeBSD: src/games/fortune/strfile/strfile.c,v 1.15.2.2 2001/03/05 11:52:37 kris Exp $
44 # include <sys/param.h>
56 * This program takes a file composed of strings separated by
57 * lines starting with two consecutive delimiting character (default
58 * character is '%') and creates another file which consists of a table
59 * describing the file (structure from "strfile.h"), a table of seek
60 * pointers to the start of the strings, and the strings, each terminated
61 * by a null byte. Usage:
63 * % strfile [-iorsx] [ -cC ] sourcefile [ datafile ]
65 * C - Allow comments marked by a double delimiter at line's beginning
66 * c - Change delimiting character from '%' to 'C'
67 * s - Silent. Give no summary of data processed at the end of
69 * o - order the strings in alphabetic order
70 * i - if ordering, ignore case
71 * r - randomize the order of the strings
74 * Ken Arnold Sept. 7, 1978 --
76 * Added ordering options.
79 # define STORING_PTRS (Oflag || Rflag)
80 # define CHUNKSIZE 512
82 # define ALLOC(ptr,sz) { \
84 ptr = malloc((unsigned int) (CHUNKSIZE * sizeof *ptr)); \
85 else if (((sz) + 1) % CHUNKSIZE == 0) \
86 ptr = realloc((void *) ptr, ((unsigned int) ((sz) + CHUNKSIZE) * sizeof *ptr)); \
88 fprintf(stderr, "out of space\n"); \
98 char *Infile
= NULL
, /* input file name */
99 Outfile
[MAXPATHLEN
] = "", /* output file name */
100 Delimch
= '%'; /* delimiting character */
102 int Cflag
= false; /* embedded comments */
103 int Sflag
= false; /* silent run flag */
104 int Oflag
= false; /* ordering flag */
105 int Iflag
= false; /* ignore case flag */
106 int Rflag
= false; /* randomize order flag */
107 int Xflag
= false; /* set rotated bit */
108 long Num_pts
= 0; /* number of pointers/strings */
112 FILE *Sort_1
, *Sort_2
; /* pointers for sorting */
114 STRFILE Tbl
; /* statistics table */
116 STR
*Firstch
; /* first chars of each string */
118 void add_offset (FILE *, long);
119 int cmp_str (const void *, const void *);
120 static int collate_range_cmp (int, int);
121 void do_order (void);
122 void getargs (int, char **);
123 void randomize (void);
128 * Drive the sucker. There are two main modes -- either we store
129 * the seek pointers, if the table is to be sorted or randomized,
130 * or we write the pointer directly to the file, if we are to stay
131 * in file order. If the former, we allocate and re-allocate in
132 * CHUNKSIZE blocks; if the latter, we just write each pointer,
133 * and then seek back to the beginning to write in the table.
136 main(int ac
, char **av
)
140 long last_off
, length
, pos
, *p
;
144 static char string
[257];
146 (void) setlocale(LC_ALL
, "");
148 getargs(ac
, av
); /* evalute arguments */
150 if ((inf
= fopen(Infile
, "r")) == NULL
) {
155 if ((outf
= fopen(Outfile
, "w")) == NULL
) {
160 (void) fseek(outf
, (long) sizeof Tbl
, 0);
163 * Write the strings onto the file
167 Tbl
.str_shortlen
= ~((unsigned long) 0);
169 Tbl
.str_version
= VERSION
;
171 add_offset(outf
, ftell(inf
));
174 sp
= fgets(string
, 256, inf
);
175 if (sp
== NULL
|| (sp
[0] == dc
&& sp
[1] == '\n')) {
177 length
= pos
- last_off
- (sp
? strlen(sp
) : 0);
181 add_offset(outf
, pos
);
182 if (Tbl
.str_longlen
< (unsigned long)length
)
183 Tbl
.str_longlen
= length
;
184 if (Tbl
.str_shortlen
> (unsigned long)length
)
185 Tbl
.str_shortlen
= length
;
189 for (nsp
= sp
; !isalnum((unsigned char)*nsp
); nsp
++)
191 ALLOC(Firstch
, Num_pts
);
192 fp
= &Firstch
[Num_pts
- 1];
193 if (Iflag
&& isupper((unsigned char)*nsp
))
194 fp
->first
= tolower((unsigned char)*nsp
);
197 fp
->pos
= Seekpts
[Num_pts
- 1];
200 } while (sp
!= NULL
);
203 * write the tables in
207 Tbl
.str_numstr
= Num_pts
- 1;
210 Tbl
.str_flags
|= STR_COMMENTS
;
218 Tbl
.str_flags
|= STR_ROTATED
;
221 printf("\"%s\" created\n", Outfile
);
223 puts("There was 1 string");
225 printf("There were %ld strings\n", Num_pts
- 1);
226 printf("Longest string: %lu byte%s\n", Tbl
.str_longlen
,
227 Tbl
.str_longlen
== 1 ? "" : "s");
228 printf("Shortest string: %lu byte%s\n", Tbl
.str_shortlen
,
229 Tbl
.str_shortlen
== 1 ? "" : "s");
233 Tbl
.str_version
= htonl(Tbl
.str_version
);
234 Tbl
.str_numstr
= htonl(Tbl
.str_numstr
);
235 Tbl
.str_longlen
= htonl(Tbl
.str_longlen
);
236 Tbl
.str_shortlen
= htonl(Tbl
.str_shortlen
);
237 Tbl
.str_flags
= htonl(Tbl
.str_flags
);
238 (void) fwrite((char *) &Tbl
, sizeof Tbl
, 1, outf
);
240 for (p
= Seekpts
, cnt
= Num_pts
; cnt
--; ++p
)
242 (void) fwrite((char *) Seekpts
, sizeof *Seekpts
, (int) Num_pts
, outf
);
249 * This routine evaluates arguments from the command line
252 getargs(int argc
, char **argv
)
256 while ((ch
= getopt(argc
, argv
, "Cc:iorsx")) != EOF
)
258 case 'C': /* embedded comments */
261 case 'c': /* new delimiting char */
263 if (!isascii(Delimch
)) {
264 printf("bad delimiting character: '\\%o\n'",
265 (unsigned char)Delimch
);
268 case 'i': /* ignore case in ordering */
271 case 'o': /* order strings */
274 case 'r': /* randomize pointers */
277 case 's': /* silent */
280 case 'x': /* set the rotated bit */
292 (void) strcpy(Outfile
, *argv
);
295 puts("No input file name");
298 if (*Outfile
== '\0') {
299 (void) strcpy(Outfile
, Infile
);
300 (void) strcat(Outfile
, ".dat");
307 (void) fprintf(stderr
,
308 "strfile [-Ciorsx] [-c char] sourcefile [datafile]\n");
314 * Add an offset to the list, or write it out, as appropriate.
317 add_offset(FILE *fp
, long off
)
323 fwrite(&net
, 1, sizeof net
, fp
);
325 ALLOC(Seekpts
, Num_pts
+ 1);
326 Seekpts
[Num_pts
] = off
;
333 * Order the strings alphabetically (possibly ignoring case).
342 Sort_1
= fopen(Infile
, "r");
343 Sort_2
= fopen(Infile
, "r");
344 qsort((char *) Firstch
, (int) Tbl
.str_numstr
, sizeof *Firstch
, cmp_str
);
350 (void) fclose(Sort_1
);
351 (void) fclose(Sort_2
);
352 Tbl
.str_flags
|= STR_ORDERED
;
356 collate_range_cmp (int c1
, int c2
)
358 static char s1
[2], s2
[2];
367 if ((ret
= strcoll(s1
, s2
)) != 0)
374 * Compare two strings in the file
377 cmp_str(const void *s1
, const void *s2
)
384 # define SET_N(nf,ch) (nf = (ch == '\n'))
385 # define IS_END(ch,nf) (ch == EOF || (ch == (unsigned char) Delimch && nf))
387 p1
= (const STR
*) s1
;
388 p2
= (const STR
*) s2
;
390 c1
= (unsigned char) p1
->first
;
391 c2
= (unsigned char) p2
->first
;
392 if ((r
= collate_range_cmp(c1
, c2
)) != 0)
395 (void) fseek(Sort_1
, p1
->pos
, 0);
396 (void) fseek(Sort_2
, p2
->pos
, 0);
400 while (!isalnum(c1
= getc(Sort_1
)) && c1
!= '\0' && c1
!= EOF
)
402 while (!isalnum(c2
= getc(Sort_2
)) && c2
!= '\0' && c2
!= EOF
)
405 while (!IS_END(c1
, n1
) && !IS_END(c2
, n2
)) {
412 if ((r
= collate_range_cmp(c1
, c2
)) != 0)
423 return collate_range_cmp(c1
, c2
);
428 * Randomize the order of the string table. We must be careful
429 * not to randomize across delimiter boundaries. All
430 * randomization is done within each block.
441 Tbl
.str_flags
|= STR_RANDOM
;
442 cnt
= Tbl
.str_numstr
;
445 * move things around randomly
448 for (sp
= Seekpts
; cnt
> 0; cnt
--, sp
++) {