games - misc - clean up compiler warnings
[dragonfly.git] / games / fortune / fortune / fortune.c
CommitLineData
984263bc
MD
1/*-
2 * Copyright (c) 1986, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Ken Arnold.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
23 *
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
34 * SUCH DAMAGE.
1de703da
MD
35 *
36 * @(#) Copyright (c) 1986, 1993 The Regents of the University of California. All rights reserved.
37 * @(#)fortune.c 8.1 (Berkeley) 5/31/93
38 * $FreeBSD: src/games/fortune/fortune/fortune.c,v 1.18.2.1 2001/07/02 00:35:27 dd Exp $
984263bc
MD
39 */
40/* $FreeBSD: src/games/fortune/fortune/fortune.c,v 1.18.2.1 2001/07/02 00:35:27 dd Exp $ */
2cd69caa 41/* $DragonFly: src/games/fortune/fortune/fortune.c,v 1.6 2006/08/08 16:58:59 pavalos Exp $ */
984263bc
MD
42
43# include <sys/param.h>
44# include <sys/stat.h>
235099c3 45# include <netinet/in.h>
984263bc
MD
46
47# include <dirent.h>
509221ae 48# include <err.h>
984263bc
MD
49# include <fcntl.h>
50# include <assert.h>
51# include <unistd.h>
2cd69caa 52# include <stdbool.h>
984263bc
MD
53# include <stdio.h>
54# include <ctype.h>
55# include <stdlib.h>
56# include <string.h>
57# include <locale.h>
58# include <time.h>
59# include "strfile.h"
60# include "pathnames.h"
61
984263bc
MD
62# define MINW 6 /* minimum wait if desired */
63# define CPERS 20 /* # of chars for each sec */
64# define SLEN 160 /* # of chars in short fortune */
65
66# define POS_UNKNOWN ((long) -1) /* pos for file unknown */
67# define NO_PROB (-1) /* no prob specified for file */
68
69# ifdef DEBUG
70# define DPRINTF(l,x) { if (Debug >= l) fprintf x; }
71# undef NDEBUG
72# else
73# define DPRINTF(l,x)
74# define NDEBUG 1
75# endif
76
77typedef struct fd {
78 int percent;
79 int fd, datfd;
80 long pos;
81 FILE *inf;
2cd69caa
PA
82 const char *name;
83 const char *path;
984263bc
MD
84 char *datfile, *posfile;
85 bool read_tbl;
86 bool was_pos_file;
87 STRFILE tbl;
88 int num_children;
89 struct fd *child, *parent;
90 struct fd *next, *prev;
91} FILEDESC;
92
93bool Found_one; /* did we find a match? */
2cd69caa
PA
94bool Find_files = false; /* just find a list of proper fortune files */
95bool Fortunes_only = false; /* check only "fortunes" files */
96bool Wait = false; /* wait desired after fortune */
97bool Short_only = false; /* short fortune desired */
98bool Long_only = false; /* long fortune desired */
99bool Offend = false; /* offensive fortunes only */
100bool All_forts = false; /* any fortune allowed */
101bool Equal_probs = false; /* scatter un-allocted prob equally */
984263bc 102#ifndef NO_REGEX
2cd69caa 103bool Match = false; /* dump fortunes matching a pattern */
984263bc
MD
104#endif
105#ifdef DEBUG
2cd69caa 106bool Debug = false; /* print debug messages */
984263bc
MD
107#endif
108
109char *Fortbuf = NULL; /* fortune buffer for -m */
110
111int Fort_len = 0;
112
113long Seekpts[2]; /* seek pointers to fortunes */
114
115FILEDESC *File_list = NULL, /* Head of file list */
116 *File_tail = NULL; /* Tail of file list */
117FILEDESC *Fortfile; /* Fortune file to use */
118
119STRFILE Noprob_tbl; /* sum of data for all no prob files */
120
2cd69caa
PA
121bool add_dir (FILEDESC *);
122bool add_file (int,
123 const char *, const char *, FILEDESC **, FILEDESC **, FILEDESC *);
851dc90d 124void all_forts (FILEDESC *, char *);
2cd69caa 125char *copy (const char *, u_int);
851dc90d
EN
126void display (FILEDESC *);
127void do_free (void *);
128void *do_malloc (u_int);
2cd69caa 129bool form_file_list (char **, int);
851dc90d
EN
130int fortlen (void);
131void get_fort (void);
132void get_pos (FILEDESC *);
133void get_tbl (FILEDESC *);
134void getargs (int, char *[]);
135void init_prob (void);
2cd69caa
PA
136bool is_dir (const char *);
137bool is_fortfile (const char *, char **, char **, int);
138bool is_off_name (const char *);
851dc90d 139int max (int, int);
984263bc 140FILEDESC *
851dc90d 141 new_fp (void);
2cd69caa 142char *off_name (const char *);
851dc90d
EN
143void open_dat (FILEDESC *);
144void open_fp (FILEDESC *);
984263bc 145FILEDESC *
851dc90d
EN
146 pick_child (FILEDESC *);
147void print_file_list (void);
148void print_list (FILEDESC *, int);
149void sum_noprobs (FILEDESC *);
150void sum_tbl (STRFILE *, STRFILE *);
151void usage (void);
152void zero_tbl (STRFILE *);
984263bc
MD
153
154#ifndef NO_REGEX
851dc90d
EN
155char *conv_pat (char *);
156int find_matches (void);
157void matches_in_list (FILEDESC *);
158int maxlen_in_list (FILEDESC *);
984263bc
MD
159#endif
160
161#ifndef NO_REGEX
162#ifdef REGCMP
163# define RE_COMP(p) (Re_pat = regcmp(p, NULL))
164# define BAD_COMP(f) ((f) == NULL)
165# define RE_EXEC(p) regex(Re_pat, (p))
166
167char *Re_pat;
168
169char *regcmp(), *regex();
170#else
171# define RE_COMP(p) (p = re_comp(p))
172# define BAD_COMP(f) ((f) != NULL)
173# define RE_EXEC(p) re_exec(p)
174
175#endif
176#endif
177
178int
b1e9d17a 179main(int ac, char **av)
984263bc
MD
180{
181#ifdef OK_TO_WRITE_DISK
182 int fd;
183#endif /* OK_TO_WRITE_DISK */
184
185 (void) setlocale(LC_ALL, "");
186
187 getargs(ac, av);
188
189#ifndef NO_REGEX
190 if (Match)
191 exit(find_matches() != 0);
192#endif
193
194 init_prob();
195 srandomdev();
196 do {
197 get_fort();
198 } while ((Short_only && fortlen() > SLEN) ||
199 (Long_only && fortlen() <= SLEN));
200
201 display(Fortfile);
202
203#ifdef OK_TO_WRITE_DISK
204 if ((fd = creat(Fortfile->posfile, 0666)) < 0) {
205 perror(Fortfile->posfile);
206 exit(1);
207 }
208#ifdef LOCK_EX
209 /*
210 * if we can, we exclusive lock, but since it isn't very
211 * important, we just punt if we don't have easy locking
212 * available.
213 */
214 (void) flock(fd, LOCK_EX);
215#endif /* LOCK_EX */
216 write(fd, (char *) &Fortfile->pos, sizeof Fortfile->pos);
217 if (!Fortfile->was_pos_file)
218 (void) chmod(Fortfile->path, 0666);
219#ifdef LOCK_EX
220 (void) flock(fd, LOCK_UN);
221#endif /* LOCK_EX */
222#endif /* OK_TO_WRITE_DISK */
223 if (Wait) {
224 if (Fort_len == 0)
225 (void) fortlen();
226 sleep((unsigned int) max(Fort_len / CPERS, MINW));
227 }
228 exit(0);
229 /* NOTREACHED */
230}
231
232void
b1e9d17a 233display(FILEDESC *fp)
984263bc
MD
234{
235 char *p;
236 unsigned char ch;
237 char line[BUFSIZ];
238
239 open_fp(fp);
240 (void) fseek(fp->inf, Seekpts[0], 0);
241 for (Fort_len = 0; fgets(line, sizeof line, fp->inf) != NULL &&
242 !STR_ENDSTRING(line, fp->tbl); Fort_len++) {
243 if (fp->tbl.str_flags & STR_ROTATED)
244 for (p = line; (ch = *p) != '\0'; ++p) {
245 if (isascii(ch)) {
246 if (isupper(ch))
247 *p = 'A' + (ch - 'A' + 13) % 26;
248 else if (islower(ch))
249 *p = 'a' + (ch - 'a' + 13) % 26;
250 }
251 }
252 if (fp->tbl.str_flags & STR_COMMENTS
253 && line[0] == fp->tbl.str_delim
254 && line[1] == fp->tbl.str_delim)
255 continue;
256 fputs(line, stdout);
257 }
258 (void) fflush(stdout);
259}
260
261/*
262 * fortlen:
263 * Return the length of the fortune.
264 */
265int
b1e9d17a 266fortlen(void)
984263bc
MD
267{
268 int nchar;
269 char line[BUFSIZ];
270
271 if (!(Fortfile->tbl.str_flags & (STR_RANDOM | STR_ORDERED)))
272 nchar = (Seekpts[1] - Seekpts[0] <= SLEN);
273 else {
274 open_fp(Fortfile);
275 (void) fseek(Fortfile->inf, Seekpts[0], 0);
276 nchar = 0;
277 while (fgets(line, sizeof line, Fortfile->inf) != NULL &&
278 !STR_ENDSTRING(line, Fortfile->tbl))
279 nchar += strlen(line);
280 }
281 Fort_len = nchar;
282 return nchar;
283}
284
285/*
286 * This routine evaluates the arguments on the command line
287 */
288void
b1e9d17a 289getargs(int argc, char **argv)
984263bc
MD
290{
291 int ignore_case;
292# ifndef NO_REGEX
293 char *pat;
294# endif /* NO_REGEX */
984263bc
MD
295 int ch;
296
2cd69caa 297 ignore_case = false;
984263bc
MD
298# ifndef NO_REGEX
299 pat = NULL;
300# endif /* NO_REGEX */
301
302# ifdef DEBUG
303 while ((ch = getopt(argc, argv, "aDefilm:osw")) != -1)
304#else
305 while ((ch = getopt(argc, argv, "aefilm:osw")) != -1)
306#endif /* DEBUG */
307 switch(ch) {
308 case 'a': /* any fortune */
309 All_forts++;
310 break;
311# ifdef DEBUG
312 case 'D':
313 Debug++;
314 break;
315# endif /* DEBUG */
316 case 'e':
317 Equal_probs++; /* scatter un-allocted prob equally */
318 break;
319 case 'f': /* find fortune files */
320 Find_files++;
321 break;
322 case 'l': /* long ones only */
323 Long_only++;
2cd69caa 324 Short_only = false;
984263bc
MD
325 break;
326 case 'o': /* offensive ones only */
327 Offend++;
328 break;
329 case 's': /* short ones only */
330 Short_only++;
2cd69caa 331 Long_only = false;
984263bc
MD
332 break;
333 case 'w': /* give time to read */
334 Wait++;
335 break;
336# ifdef NO_REGEX
337 case 'i': /* case-insensitive match */
338 case 'm': /* dump out the fortunes */
339 (void) fprintf(stderr,
340 "fortune: can't match fortunes on this system (Sorry)\n");
341 exit(0);
342# else /* NO_REGEX */
343 case 'm': /* dump out the fortunes */
344 Match++;
345 pat = optarg;
346 break;
347 case 'i': /* case-insensitive match */
348 ignore_case++;
349 break;
350# endif /* NO_REGEX */
351 case '?':
352 default:
353 usage();
354 }
355 argc -= optind;
356 argv += optind;
357
358 if (!form_file_list(argv, argc))
359 exit(1); /* errors printed through form_file_list() */
360 if (Find_files) {
361 print_file_list();
362 exit(0);
363 }
364#ifdef DEBUG
365 else if (Debug >= 1)
366 print_file_list();
367#endif /* DEBUG */
368
369# ifndef NO_REGEX
370 if (pat != NULL) {
371 if (ignore_case)
372 pat = conv_pat(pat);
373 if (BAD_COMP(RE_COMP(pat))) {
374#ifndef REGCMP
375 fprintf(stderr, "%s\n", pat);
376#else /* REGCMP */
377 fprintf(stderr, "bad pattern: %s\n", pat);
378#endif /* REGCMP */
379 }
380 }
381# endif /* NO_REGEX */
382}
383
384/*
385 * form_file_list:
386 * Form the file list from the file specifications.
387 */
2cd69caa 388bool
b1e9d17a 389form_file_list(char **files, int file_cnt)
984263bc 390{
2cd69caa
PA
391 bool i;
392 int percent;
393 const char *sp;
984263bc
MD
394
395 if (file_cnt == 0) {
396 if (Find_files) {
2cd69caa 397 Fortunes_only = true;
984263bc
MD
398 i = add_file(NO_PROB, FORTDIR, NULL, &File_list,
399 &File_tail, NULL);
2cd69caa 400 Fortunes_only = false;
984263bc
MD
401 return i;
402 } else
403 return add_file(NO_PROB, "fortunes", FORTDIR,
404 &File_list, &File_tail, NULL);
405 }
406 for (i = 0; i < file_cnt; i++) {
407 percent = NO_PROB;
408 if (!isdigit((unsigned char)files[i][0]))
409 sp = files[i];
410 else {
411 percent = 0;
412 for (sp = files[i]; isdigit((unsigned char)*sp); sp++)
413 percent = percent * 10 + *sp - '0';
414 if (percent > 100) {
415 fprintf(stderr, "percentages must be <= 100\n");
2cd69caa 416 return false;
984263bc
MD
417 }
418 if (*sp == '.') {
419 fprintf(stderr, "percentages must be integers\n");
2cd69caa 420 return false;
984263bc
MD
421 }
422 /*
423 * If the number isn't followed by a '%', then
424 * it was not a percentage, just the first part
425 * of a file name which starts with digits.
426 */
427 if (*sp != '%') {
428 percent = NO_PROB;
429 sp = files[i];
430 }
431 else if (*++sp == '\0') {
432 if (++i >= file_cnt) {
433 fprintf(stderr, "percentages must precede files\n");
2cd69caa 434 return false;
984263bc
MD
435 }
436 sp = files[i];
437 }
438 }
439 if (strcmp(sp, "all") == 0)
440 sp = FORTDIR;
441 if (!add_file(percent, sp, NULL, &File_list, &File_tail, NULL))
2cd69caa 442 return false;
984263bc 443 }
2cd69caa 444 return true;
984263bc
MD
445}
446
447/*
448 * add_file:
449 * Add a file to the file list.
450 */
2cd69caa
PA
451bool
452add_file(int percent, const char *file, const char *dir, FILEDESC **head, FILEDESC **tail, FILEDESC *parent)
984263bc
MD
453{
454 FILEDESC *fp;
455 int fd;
2cd69caa
PA
456 const char *path;
457 char *tpath, *offensive;
984263bc
MD
458 bool was_malloc;
459 bool isdir;
460
461 if (dir == NULL) {
462 path = file;
2cd69caa
PA
463 tpath = NULL;
464 was_malloc = false;
984263bc
MD
465 }
466 else {
2cd69caa
PA
467 tpath = do_malloc((unsigned int) (strlen(dir) + strlen(file) + 2));
468 (void) strcat(strcat(strcpy(tpath, dir), "/"), file);
469 path = tpath;
470 was_malloc = true;
984263bc
MD
471 }
472 if ((isdir = is_dir(path)) && parent != NULL) {
473 if (was_malloc)
2cd69caa
PA
474 free(tpath);
475 return false; /* don't recurse */
984263bc
MD
476 }
477 offensive = NULL;
478 if (!isdir && parent == NULL && (All_forts || Offend) &&
479 !is_off_name(path)) {
480 offensive = off_name(path);
481 if (Offend) {
482 if (was_malloc)
2cd69caa 483 free(tpath);
984263bc
MD
484 path = offensive;
485 offensive = NULL;
2cd69caa 486 was_malloc = true;
984263bc
MD
487 DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
488 file = off_name(file);
489 }
490 }
491
492 DPRINTF(1, (stderr, "adding file \"%s\"\n", path));
493over:
494 if ((fd = open(path, 0)) < 0) {
495 /*
496 * This is a sneak. If the user said -a, and if the
497 * file we're given isn't a file, we check to see if
498 * there is a -o version. If there is, we treat it as
499 * if *that* were the file given. We only do this for
500 * individual files -- if we're scanning a directory,
501 * we'll pick up the -o file anyway.
502 */
503 if (All_forts && offensive != NULL) {
504 if (was_malloc)
2cd69caa 505 free(tpath);
984263bc
MD
506 path = offensive;
507 offensive = NULL;
2cd69caa 508 was_malloc = true;
984263bc
MD
509 DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
510 file = off_name(file);
511 goto over;
512 }
513 if (dir == NULL && file[0] != '/')
514 return add_file(percent, file, FORTDIR, head, tail,
515 parent);
516 if (parent == NULL)
517 perror(path);
518 if (was_malloc)
2cd69caa
PA
519 free(tpath);
520 return false;
984263bc
MD
521 }
522
523 DPRINTF(2, (stderr, "path = \"%s\"\n", path));
524
525 fp = new_fp();
526 fp->fd = fd;
527 fp->percent = percent;
528 fp->name = file;
529 fp->path = path;
530 fp->parent = parent;
531
532 if ((isdir && !add_dir(fp)) ||
533 (!isdir &&
534 !is_fortfile(path, &fp->datfile, &fp->posfile, (parent != NULL))))
535 {
536 if (parent == NULL)
537 fprintf(stderr,
538 "fortune:%s not a fortune file or directory\n",
539 path);
540 if (was_malloc)
2cd69caa 541 free(tpath);
984263bc
MD
542 do_free(fp->datfile);
543 do_free(fp->posfile);
544 free((char *) fp);
545 do_free(offensive);
2cd69caa 546 return false;
984263bc
MD
547 }
548 /*
549 * If the user said -a, we need to make this node a pointer to
550 * both files, if there are two. We don't need to do this if
551 * we are scanning a directory, since the scan will pick up the
552 * -o file anyway.
553 */
554 if (All_forts && parent == NULL && !is_off_name(path))
555 all_forts(fp, offensive);
556 if (*head == NULL)
557 *head = *tail = fp;
558 else if (fp->percent == NO_PROB) {
559 (*tail)->next = fp;
560 fp->prev = *tail;
561 *tail = fp;
562 }
563 else {
564 (*head)->prev = fp;
565 fp->next = *head;
566 *head = fp;
567 }
568#ifdef OK_TO_WRITE_DISK
569 fp->was_pos_file = (access(fp->posfile, W_OK) >= 0);
570#endif /* OK_TO_WRITE_DISK */
571
2cd69caa 572 return true;
984263bc
MD
573}
574
575/*
576 * new_fp:
577 * Return a pointer to an initialized new FILEDESC.
578 */
579FILEDESC *
b1e9d17a 580new_fp(void)
984263bc
MD
581{
582 FILEDESC *fp;
583
584 fp = (FILEDESC *) do_malloc(sizeof *fp);
585 fp->datfd = -1;
586 fp->pos = POS_UNKNOWN;
587 fp->inf = NULL;
588 fp->fd = -1;
589 fp->percent = NO_PROB;
2cd69caa 590 fp->read_tbl = false;
984263bc
MD
591 fp->next = NULL;
592 fp->prev = NULL;
593 fp->child = NULL;
594 fp->parent = NULL;
595 fp->datfile = NULL;
596 fp->posfile = NULL;
597 return fp;
598}
599
600/*
601 * off_name:
602 * Return a pointer to the offensive version of a file of this name.
603 */
604char *
2cd69caa 605off_name(const char *file)
984263bc
MD
606{
607 char *new;
608
609 new = copy(file, (unsigned int) (strlen(file) + 2));
610 return strcat(new, "-o");
611}
612
613/*
614 * is_off_name:
615 * Is the file an offensive-style name?
616 */
2cd69caa
PA
617bool
618is_off_name(const char *file)
984263bc
MD
619{
620 int len;
621
622 len = strlen(file);
623 return (len >= 3 && file[len - 2] == '-' && file[len - 1] == 'o');
624}
625
626/*
627 * all_forts:
628 * Modify a FILEDESC element to be the parent of two children if
629 * there are two children to be a parent of.
630 */
631void
b1e9d17a 632all_forts(FILEDESC *fp, char *offensive)
984263bc
MD
633{
634 char *sp;
635 FILEDESC *scene, *obscene;
636 int fd;
637 auto char *datfile, *posfile;
638
639 if (fp->child != NULL) /* this is a directory, not a file */
640 return;
2cd69caa 641 if (!is_fortfile(offensive, &datfile, &posfile, false))
984263bc
MD
642 return;
643 if ((fd = open(offensive, 0)) < 0)
644 return;
645 DPRINTF(1, (stderr, "adding \"%s\" because of -a\n", offensive));
646 scene = new_fp();
647 obscene = new_fp();
648 *scene = *fp;
649
650 fp->num_children = 2;
651 fp->child = scene;
652 scene->next = obscene;
653 obscene->next = NULL;
654 scene->child = obscene->child = NULL;
655 scene->parent = obscene->parent = fp;
656
657 fp->fd = -1;
658 scene->percent = obscene->percent = NO_PROB;
659
660 obscene->fd = fd;
661 obscene->inf = NULL;
662 obscene->path = offensive;
663 if ((sp = rindex(offensive, '/')) == NULL)
664 obscene->name = offensive;
665 else
666 obscene->name = ++sp;
667 obscene->datfile = datfile;
668 obscene->posfile = posfile;
2cd69caa 669 obscene->read_tbl = false;
984263bc
MD
670#ifdef OK_TO_WRITE_DISK
671 obscene->was_pos_file = (access(obscene->posfile, W_OK) >= 0);
672#endif /* OK_TO_WRITE_DISK */
673}
674
675/*
676 * add_dir:
677 * Add the contents of an entire directory.
678 */
2cd69caa 679bool
b1e9d17a 680add_dir(FILEDESC *fp)
984263bc
MD
681{
682 DIR *dir;
683 struct dirent *dirent;
684 auto FILEDESC *tailp;
685 auto char *name;
686
687 (void) close(fp->fd);
688 fp->fd = -1;
689 if ((dir = opendir(fp->path)) == NULL) {
690 perror(fp->path);
2cd69caa 691 return false;
984263bc
MD
692 }
693 tailp = NULL;
694 DPRINTF(1, (stderr, "adding dir \"%s\"\n", fp->path));
695 fp->num_children = 0;
696 while ((dirent = readdir(dir)) != NULL) {
509221ae
JS
697 if ((name = strdup(dirent->d_name)) == NULL)
698 err(1, "strdup failed");
984263bc
MD
699 if (add_file(NO_PROB, name, fp->path, &fp->child, &tailp, fp))
700 fp->num_children++;
701 else
702 free(name);
703 }
704 if (fp->num_children == 0) {
705 (void) fprintf(stderr,
706 "fortune: %s: No fortune files in directory.\n", fp->path);
2cd69caa 707 return false;
984263bc 708 }
2cd69caa 709 return true;
984263bc
MD
710}
711
712/*
713 * is_dir:
2cd69caa 714 * Return true if the file is a directory, false otherwise.
984263bc 715 */
2cd69caa
PA
716bool
717is_dir(const char *file)
984263bc
MD
718{
719 auto struct stat sbuf;
720
721 if (stat(file, &sbuf) < 0)
2cd69caa 722 return false;
984263bc
MD
723 return (sbuf.st_mode & S_IFDIR);
724}
725
726/*
727 * is_fortfile:
2cd69caa 728 * Return true if the file is a fortune database file. We try and
984263bc
MD
729 * exclude files without reading them if possible to avoid
730 * overhead. Files which start with ".", or which have "illegal"
731 * suffixes, as contained in suflist[], are ruled out.
732 */
733/* ARGSUSED */
2cd69caa
PA
734bool
735is_fortfile(const char *file, char **datp, char **posp, int check_for_offend)
984263bc
MD
736{
737 int i;
2cd69caa 738 const char *sp;
984263bc 739 char *datfile;
2cd69caa 740 static const char *suflist[] = { /* list of "illegal" suffixes" */
984263bc
MD
741 "dat", "pos", "c", "h", "p", "i", "f",
742 "pas", "ftn", "ins.c", "ins,pas",
743 "ins.ftn", "sml",
744 NULL
745 };
746
747 DPRINTF(2, (stderr, "is_fortfile(%s) returns ", file));
748
749 /*
750 * Preclude any -o files for offendable people, and any non -o
751 * files for completely offensive people.
752 */
753 if (check_for_offend && !All_forts) {
754 i = strlen(file);
755 if (Offend ^ (file[i - 2] == '-' && file[i - 1] == 'o')) {
2cd69caa
PA
756 DPRINTF(2, (stderr, "false (offending file)\n"));
757 return false;
984263bc
MD
758 }
759 }
760
761 if ((sp = rindex(file, '/')) == NULL)
762 sp = file;
763 else
764 sp++;
765 if (*sp == '.') {
2cd69caa
PA
766 DPRINTF(2, (stderr, "false (file starts with '.')\n"));
767 return false;
984263bc
MD
768 }
769 if (Fortunes_only && strncmp(sp, "fortunes", 8) != 0) {
2cd69caa
PA
770 DPRINTF(2, (stderr, "false (check fortunes only)\n"));
771 return false;
984263bc
MD
772 }
773 if ((sp = rindex(sp, '.')) != NULL) {
774 sp++;
775 for (i = 0; suflist[i] != NULL; i++)
776 if (strcmp(sp, suflist[i]) == 0) {
2cd69caa
PA
777 DPRINTF(2, (stderr, "false (file has suffix \".%s\")\n", sp));
778 return false;
984263bc
MD
779 }
780 }
781
782 datfile = copy(file, (unsigned int) (strlen(file) + 4)); /* +4 for ".dat" */
783 strcat(datfile, ".dat");
784 if (access(datfile, R_OK) < 0) {
2cd69caa 785 DPRINTF(2, (stderr, "false (no readable \".dat\" file)\n"));
984263bc
MD
786#ifdef DEBUG
787 if (Debug < 2)
788 DPRINTF(0, (stderr, "Warning: file \"%s\" unreadable\n", datfile));
789#endif
790 free(datfile);
2cd69caa 791 return false;
984263bc
MD
792 }
793 if (datp != NULL)
794 *datp = datfile;
795 else
796 free(datfile);
797 if (posp != NULL) {
798#ifdef OK_TO_WRITE_DISK
799 *posp = copy(file, (unsigned int) (strlen(file) + 4)); /* +4 for ".dat" */
800 (void) strcat(*posp, ".pos");
801#else
802 *posp = NULL;
803#endif /* OK_TO_WRITE_DISK */
804 }
2cd69caa
PA
805 DPRINTF(2, (stderr, "true\n"));
806 return true;
984263bc
MD
807}
808
809/*
810 * copy:
811 * Return a malloc()'ed copy of the string
812 */
813char *
2cd69caa 814copy(const char *str, unsigned int len)
984263bc
MD
815{
816 char *new, *sp;
817
818 new = do_malloc(len + 1);
819 sp = new;
820 do {
821 *sp++ = *str;
822 } while (*str++);
823 return new;
824}
825
826/*
827 * do_malloc:
828 * Do a malloc, checking for NULL return.
829 */
830void *
b1e9d17a 831do_malloc(unsigned int size)
984263bc
MD
832{
833 void *new;
834
835 if ((new = malloc(size)) == NULL) {
836 (void) fprintf(stderr, "fortune: out of memory.\n");
837 exit(1);
838 }
839 return new;
840}
841
842/*
843 * do_free:
844 * Free malloc'ed space, if any.
845 */
846void
b1e9d17a 847do_free(void *ptr)
984263bc
MD
848{
849 if (ptr != NULL)
850 free(ptr);
851}
852
853/*
854 * init_prob:
855 * Initialize the fortune probabilities.
856 */
857void
b1e9d17a 858init_prob(void)
984263bc
MD
859{
860 FILEDESC *fp, *last = NULL;
861 int percent, num_noprob, frac;
862
863 /*
864 * Distribute the residual probability (if any) across all
865 * files with unspecified probability (i.e., probability of 0)
866 * (if any).
867 */
868
869 percent = 0;
870 num_noprob = 0;
871 for (fp = File_tail; fp != NULL; fp = fp->prev)
872 if (fp->percent == NO_PROB) {
873 num_noprob++;
874 if (Equal_probs)
875 last = fp;
876 }
877 else
878 percent += fp->percent;
879 DPRINTF(1, (stderr, "summing probabilities:%d%% with %d NO_PROB's",
880 percent, num_noprob));
881 if (percent > 100) {
882 (void) fprintf(stderr,
883 "fortune: probabilities sum to %d%% > 100%%!\n", percent);
884 exit(1);
885 }
886 else if (percent < 100 && num_noprob == 0) {
887 (void) fprintf(stderr,
888 "fortune: no place to put residual probability (%d%% < 100%%)\n",
889 percent);
890 exit(1);
891 }
892 else if (percent == 100 && num_noprob != 0) {
893 (void) fprintf(stderr,
894 "fortune: no probability left to put in residual files (100%%)\n");
895 exit(1);
896 }
897 percent = 100 - percent;
898 if (Equal_probs) {
899 if (num_noprob != 0) {
900 if (num_noprob > 1) {
901 frac = percent / num_noprob;
902 DPRINTF(1, (stderr, ", frac = %d%%", frac));
903 for (fp = File_list; fp != last; fp = fp->next)
904 if (fp->percent == NO_PROB) {
905 fp->percent = frac;
906 percent -= frac;
907 }
908 }
909 last->percent = percent;
910 DPRINTF(1, (stderr, ", residual = %d%%", percent));
911 }
912 else
913 DPRINTF(1, (stderr,
914 ", %d%% distributed over remaining fortunes\n",
915 percent));
916 }
917 DPRINTF(1, (stderr, "\n"));
918
919#ifdef DEBUG
920 if (Debug >= 1)
921 print_file_list();
922#endif
923}
924
925/*
926 * get_fort:
927 * Get the fortune data file's seek pointer for the next fortune.
928 */
929void
b1e9d17a 930get_fort(void)
984263bc
MD
931{
932 FILEDESC *fp;
933 int choice;
934
935 if (File_list->next == NULL || File_list->percent == NO_PROB)
936 fp = File_list;
937 else {
938 choice = random() % 100;
939 DPRINTF(1, (stderr, "choice = %d\n", choice));
940 for (fp = File_list; fp->percent != NO_PROB; fp = fp->next)
941 if (choice < fp->percent)
942 break;
943 else {
944 choice -= fp->percent;
945 DPRINTF(1, (stderr,
946 " skip \"%s\", %d%% (choice = %d)\n",
947 fp->name, fp->percent, choice));
948 }
949 DPRINTF(1, (stderr,
950 "using \"%s\", %d%% (choice = %d)\n",
951 fp->name, fp->percent, choice));
952 }
953 if (fp->percent != NO_PROB)
954 get_tbl(fp);
955 else {
956 if (fp->next != NULL) {
957 sum_noprobs(fp);
958 choice = random() % Noprob_tbl.str_numstr;
959 DPRINTF(1, (stderr, "choice = %d (of %ld) \n", choice,
960 Noprob_tbl.str_numstr));
2cd69caa 961 while ((unsigned int)choice >= fp->tbl.str_numstr) {
984263bc
MD
962 choice -= fp->tbl.str_numstr;
963 fp = fp->next;
964 DPRINTF(1, (stderr,
965 " skip \"%s\", %ld (choice = %d)\n",
966 fp->name, fp->tbl.str_numstr,
967 choice));
968 }
969 DPRINTF(1, (stderr, "using \"%s\", %ld\n", fp->name,
970 fp->tbl.str_numstr));
971 }
972 get_tbl(fp);
973 }
974 if (fp->child != NULL) {
975 DPRINTF(1, (stderr, "picking child\n"));
976 fp = pick_child(fp);
977 }
978 Fortfile = fp;
979 get_pos(fp);
980 open_dat(fp);
981 (void) lseek(fp->datfd,
982 (off_t) (sizeof fp->tbl + fp->pos * sizeof Seekpts[0]), 0);
983 read(fp->datfd, Seekpts, sizeof Seekpts);
984 Seekpts[0] = ntohl(Seekpts[0]);
985 Seekpts[1] = ntohl(Seekpts[1]);
986}
987
988/*
989 * pick_child
990 * Pick a child from a chosen parent.
991 */
992FILEDESC *
b1e9d17a 993pick_child(FILEDESC *parent)
984263bc
MD
994{
995 FILEDESC *fp;
996 int choice;
997
998 if (Equal_probs) {
999 choice = random() % parent->num_children;
1000 DPRINTF(1, (stderr, " choice = %d (of %d)\n",
1001 choice, parent->num_children));
1002 for (fp = parent->child; choice--; fp = fp->next)
1003 continue;
1004 DPRINTF(1, (stderr, " using %s\n", fp->name));
1005 return fp;
1006 }
1007 else {
1008 get_tbl(parent);
1009 choice = random() % parent->tbl.str_numstr;
1010 DPRINTF(1, (stderr, " choice = %d (of %ld)\n",
1011 choice, parent->tbl.str_numstr));
2cd69caa 1012 for (fp = parent->child; (unsigned int)choice >= fp->tbl.str_numstr;
984263bc
MD
1013 fp = fp->next) {
1014 choice -= fp->tbl.str_numstr;
1015 DPRINTF(1, (stderr, "\tskip %s, %ld (choice = %d)\n",
1016 fp->name, fp->tbl.str_numstr, choice));
1017 }
1018 DPRINTF(1, (stderr, " using %s, %ld\n", fp->name,
1019 fp->tbl.str_numstr));
1020 return fp;
1021 }
1022}
1023
1024/*
1025 * sum_noprobs:
1026 * Sum up all the noprob probabilities, starting with fp.
1027 */
1028void
b1e9d17a 1029sum_noprobs(FILEDESC *fp)
984263bc 1030{
2cd69caa 1031 static bool did_noprobs = false;
984263bc
MD
1032
1033 if (did_noprobs)
1034 return;
1035 zero_tbl(&Noprob_tbl);
1036 while (fp != NULL) {
1037 get_tbl(fp);
1038 sum_tbl(&Noprob_tbl, &fp->tbl);
1039 fp = fp->next;
1040 }
2cd69caa 1041 did_noprobs = true;
984263bc
MD
1042}
1043
1044int
b1e9d17a 1045max(int i, int j)
984263bc
MD
1046{
1047 return (i >= j ? i : j);
1048}
1049
1050/*
1051 * open_fp:
1052 * Assocatiate a FILE * with the given FILEDESC.
1053 */
1054void
b1e9d17a 1055open_fp(FILEDESC *fp)
984263bc
MD
1056{
1057 if (fp->inf == NULL && (fp->inf = fdopen(fp->fd, "r")) == NULL) {
1058 perror(fp->path);
1059 exit(1);
1060 }
1061}
1062
1063/*
1064 * open_dat:
1065 * Open up the dat file if we need to.
1066 */
1067void
b1e9d17a 1068open_dat(FILEDESC *fp)
984263bc
MD
1069{
1070 if (fp->datfd < 0 && (fp->datfd = open(fp->datfile, 0)) < 0) {
1071 perror(fp->datfile);
1072 exit(1);
1073 }
1074}
1075
1076/*
1077 * get_pos:
1078 * Get the position from the pos file, if there is one. If not,
1079 * return a random number.
1080 */
1081void
b1e9d17a 1082get_pos(FILEDESC *fp)
984263bc
MD
1083{
1084#ifdef OK_TO_WRITE_DISK
1085 int fd;
1086#endif /* OK_TO_WRITE_DISK */
1087
1088 assert(fp->read_tbl);
1089 if (fp->pos == POS_UNKNOWN) {
1090#ifdef OK_TO_WRITE_DISK
1091 if ((fd = open(fp->posfile, 0)) < 0 ||
1092 read(fd, &fp->pos, sizeof fp->pos) != sizeof fp->pos)
1093 fp->pos = random() % fp->tbl.str_numstr;
1094 else if (fp->pos >= fp->tbl.str_numstr)
1095 fp->pos %= fp->tbl.str_numstr;
1096 if (fd >= 0)
1097 (void) close(fd);
1098#else
1099 fp->pos = random() % fp->tbl.str_numstr;
1100#endif /* OK_TO_WRITE_DISK */
1101 }
2cd69caa 1102 if ((unsigned int)++(fp->pos) >= fp->tbl.str_numstr)
984263bc
MD
1103 fp->pos -= fp->tbl.str_numstr;
1104 DPRINTF(1, (stderr, "pos for %s is %ld\n", fp->name, fp->pos));
1105}
1106
1107/*
1108 * get_tbl:
1109 * Get the tbl data file the datfile.
1110 */
1111void
b1e9d17a 1112get_tbl(FILEDESC *fp)
984263bc
MD
1113{
1114 auto int fd;
1115 FILEDESC *child;
1116
1117 if (fp->read_tbl)
1118 return;
1119 if (fp->child == NULL) {
1120 if ((fd = open(fp->datfile, 0)) < 0) {
1121 perror(fp->datfile);
1122 exit(1);
1123 }
1124 if (read(fd, (char *) &fp->tbl, sizeof fp->tbl) != sizeof fp->tbl) {
1125 (void)fprintf(stderr,
1126 "fortune: %s corrupted\n", fp->path);
1127 exit(1);
1128 }
1129 /* fp->tbl.str_version = ntohl(fp->tbl.str_version); */
1130 fp->tbl.str_numstr = ntohl(fp->tbl.str_numstr);
1131 fp->tbl.str_longlen = ntohl(fp->tbl.str_longlen);
1132 fp->tbl.str_shortlen = ntohl(fp->tbl.str_shortlen);
1133 fp->tbl.str_flags = ntohl(fp->tbl.str_flags);
1134 (void) close(fd);
1135 }
1136 else {
1137 zero_tbl(&fp->tbl);
1138 for (child = fp->child; child != NULL; child = child->next) {
1139 get_tbl(child);
1140 sum_tbl(&fp->tbl, &child->tbl);
1141 }
1142 }
2cd69caa 1143 fp->read_tbl = true;
984263bc
MD
1144}
1145
1146/*
1147 * zero_tbl:
1148 * Zero out the fields we care about in a tbl structure.
1149 */
1150void
b1e9d17a 1151zero_tbl(STRFILE *tp)
984263bc
MD
1152{
1153 tp->str_numstr = 0;
1154 tp->str_longlen = 0;
1155 tp->str_shortlen = ~((unsigned long)0);
1156}
1157
1158/*
1159 * sum_tbl:
1160 * Merge the tbl data of t2 into t1.
1161 */
1162void
b1e9d17a 1163sum_tbl(STRFILE *t1, STRFILE *t2)
984263bc
MD
1164{
1165 t1->str_numstr += t2->str_numstr;
1166 if (t1->str_longlen < t2->str_longlen)
1167 t1->str_longlen = t2->str_longlen;
1168 if (t1->str_shortlen > t2->str_shortlen)
1169 t1->str_shortlen = t2->str_shortlen;
1170}
1171
1172#define STR(str) ((str) == NULL ? "NULL" : (str))
1173
1174/*
1175 * print_file_list:
1176 * Print out the file list
1177 */
1178void
b1e9d17a 1179print_file_list(void)
984263bc
MD
1180{
1181 print_list(File_list, 0);
1182}
1183
1184/*
1185 * print_list:
1186 * Print out the actual list, recursively.
1187 */
1188void
b1e9d17a 1189print_list(FILEDESC *list, int lev)
984263bc
MD
1190{
1191 while (list != NULL) {
1192 fprintf(stderr, "%*s", lev * 4, "");
1193 if (list->percent == NO_PROB)
1194 fprintf(stderr, "___%%");
1195 else
1196 fprintf(stderr, "%3d%%", list->percent);
1197 fprintf(stderr, " %s", STR(list->name));
1198 DPRINTF(1, (stderr, " (%s, %s, %s)", STR(list->path),
1199 STR(list->datfile), STR(list->posfile)));
1200 fprintf(stderr, "\n");
1201 if (list->child != NULL)
1202 print_list(list->child, lev + 1);
1203 list = list->next;
1204 }
1205}
1206
1207#ifndef NO_REGEX
1208/*
1209 * conv_pat:
1210 * Convert the pattern to an ignore-case equivalent.
1211 */
1212char *
b1e9d17a 1213conv_pat(char *orig)
984263bc
MD
1214{
1215 char *sp;
1216 unsigned int cnt;
1217 char *new;
1218
1219 cnt = 1; /* allow for '\0' */
1220 for (sp = orig; *sp != '\0'; sp++)
1221 if (isalpha((unsigned char)*sp))
1222 cnt += 4;
1223 else
1224 cnt++;
1225 if ((new = malloc(cnt)) == NULL) {
1226 fprintf(stderr, "pattern too long for ignoring case\n");
1227 exit(1);
1228 }
1229
1230 for (sp = new; *orig != '\0'; orig++) {
1231 if (islower((unsigned char)*orig)) {
1232 *sp++ = '[';
1233 *sp++ = *orig;
1234 *sp++ = toupper((unsigned char)*orig);
1235 *sp++ = ']';
1236 }
1237 else if (isupper((unsigned char)*orig)) {
1238 *sp++ = '[';
1239 *sp++ = *orig;
1240 *sp++ = tolower((unsigned char)*orig);
1241 *sp++ = ']';
1242 }
1243 else
1244 *sp++ = *orig;
1245 }
1246 *sp = '\0';
1247 return new;
1248}
1249
1250/*
1251 * find_matches:
1252 * Find all the fortunes which match the pattern we've been given.
1253 */
1254int
b1e9d17a 1255find_matches(void)
984263bc
MD
1256{
1257 Fort_len = maxlen_in_list(File_list);
1258 DPRINTF(2, (stderr, "Maximum length is %d\n", Fort_len));
1259 /* extra length, "%\n" is appended */
1260 Fortbuf = do_malloc((unsigned int) Fort_len + 10);
1261
2cd69caa 1262 Found_one = false;
984263bc
MD
1263 matches_in_list(File_list);
1264 return Found_one;
1265 /* NOTREACHED */
1266}
1267
1268/*
1269 * maxlen_in_list
1270 * Return the maximum fortune len in the file list.
1271 */
1272int
b1e9d17a 1273maxlen_in_list(FILEDESC *list)
984263bc
MD
1274{
1275 FILEDESC *fp;
1276 int len, maxlen;
1277
1278 maxlen = 0;
1279 for (fp = list; fp != NULL; fp = fp->next) {
1280 if (fp->child != NULL) {
1281 if ((len = maxlen_in_list(fp->child)) > maxlen)
1282 maxlen = len;
1283 }
1284 else {
1285 get_tbl(fp);
2cd69caa 1286 if (fp->tbl.str_longlen > (unsigned int)maxlen)
984263bc
MD
1287 maxlen = fp->tbl.str_longlen;
1288 }
1289 }
1290 return maxlen;
1291}
1292
1293/*
1294 * matches_in_list
1295 * Print out the matches from the files in the list.
1296 */
1297void
b1e9d17a 1298matches_in_list(FILEDESC *list)
984263bc
MD
1299{
1300 char *sp, *p;
1301 FILEDESC *fp;
1302 int in_file;
1303 unsigned char ch;
1304
1305 for (fp = list; fp != NULL; fp = fp->next) {
1306 if (fp->child != NULL) {
1307 matches_in_list(fp->child);
1308 continue;
1309 }
1310 DPRINTF(1, (stderr, "searching in %s\n", fp->path));
1311 open_fp(fp);
1312 sp = Fortbuf;
2cd69caa 1313 in_file = false;
984263bc
MD
1314 while (fgets(sp, Fort_len, fp->inf) != NULL)
1315 if (fp->tbl.str_flags & STR_COMMENTS
1316 && sp[0] == fp->tbl.str_delim
1317 && sp[1] == fp->tbl.str_delim)
1318 continue;
1319 else if (!STR_ENDSTRING(sp, fp->tbl))
1320 sp += strlen(sp);
1321 else {
1322 *sp = '\0';
1323 if (fp->tbl.str_flags & STR_ROTATED)
1324 for (p = Fortbuf; (ch = *p) != '\0'; ++p) {
1325 if (isascii(ch)) {
1326 if (isupper(ch))
1327 *p = 'A' + (ch - 'A' + 13) % 26;
1328 else if (islower(ch))
1329 *p = 'a' + (ch - 'a' + 13) % 26;
1330 }
1331 }
1332 if (RE_EXEC(Fortbuf)) {
1333 printf("%c%c", fp->tbl.str_delim,
1334 fp->tbl.str_delim);
1335 if (!in_file) {
1336 printf(" (%s)", fp->name);
2cd69caa
PA
1337 Found_one = true;
1338 in_file = true;
984263bc
MD
1339 }
1340 putchar('\n');
1341 (void) fwrite(Fortbuf, 1, (sp - Fortbuf), stdout);
1342 }
1343 sp = Fortbuf;
1344 }
1345 }
1346}
1347# endif /* NO_REGEX */
1348
1349void
b1e9d17a 1350usage(void)
984263bc
MD
1351{
1352 (void) fprintf(stderr, "fortune [-a");
1353#ifdef DEBUG
1354 (void) fprintf(stderr, "D");
1355#endif /* DEBUG */
1356 (void) fprintf(stderr, "f");
1357#ifndef NO_REGEX
1358 (void) fprintf(stderr, "i");
1359#endif /* NO_REGEX */
1360 (void) fprintf(stderr, "losw]");
1361#ifndef NO_REGEX
1362 (void) fprintf(stderr, " [-m pattern]");
1363#endif /* NO_REGEX */
1364 (void) fprintf(stderr, "[[#%%] file/directory/all]\n");
1365 exit(1);
1366}