2 * Copyright (c) 1986, 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. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 static const char copyright[] =
36 "@(#) Copyright (c) 1986, 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
41 static const char sccsid[] = "@(#)fortune.c 8.1 (Berkeley) 5/31/93";
44 #include <sys/cdefs.h>
45 __FBSDID("$FreeBSD$");
48 #include <sys/endian.h>
64 #include "pathnames.h"
69 #define MINW 6 /* minimum wait if desired */
70 #define CPERS 20 /* # of chars for each sec */
71 #define SLEN 160 /* # of chars in short fortune */
73 #define POS_UNKNOWN ((uint32_t) -1) /* pos for file unknown */
74 #define NO_PROB (-1) /* no prob specified for file */
77 #define DPRINTF(l,x) { if (Debug >= l) fprintf x; }
91 char *datfile, *posfile;
96 struct fd *child, *parent;
97 struct fd *next, *prev;
100 static bool Found_one; /* did we find a match? */
101 static bool Find_files = FALSE; /* just find a list of proper fortune files */
102 static bool Fortunes_only = FALSE; /* check only "fortunes" files */
103 static bool Wait = FALSE; /* wait desired after fortune */
104 static bool Short_only = FALSE; /* short fortune desired */
105 static bool Long_only = FALSE; /* long fortune desired */
106 static bool Offend = FALSE; /* offensive fortunes only */
107 static bool All_forts = FALSE; /* any fortune allowed */
108 static bool Equal_probs = FALSE; /* scatter un-allocted prob equally */
109 static bool Match = FALSE; /* dump fortunes matching a pattern */
110 static bool WriteToDisk = false; /* use files on disk to save state */
112 static int Debug = 0; /* print debug messages */
115 static char *Fortbuf = NULL; /* fortune buffer for -m */
117 static int Fort_len = 0;
119 static off_t Seekpts[2]; /* seek pointers to fortunes */
121 static FILEDESC *File_list = NULL, /* Head of file list */
122 *File_tail = NULL; /* Tail of file list */
123 static FILEDESC *Fortfile; /* Fortune file to use */
125 static STRFILE Noprob_tbl; /* sum of data for all no prob files */
127 static const char *Fortune_path;
128 static char **Fortune_path_arr;
130 static int add_dir(FILEDESC *);
131 static int add_file(int, const char *, const char *, FILEDESC **,
132 FILEDESC **, FILEDESC *);
133 static void all_forts(FILEDESC *, char *);
134 static char *copy(const char *, u_int);
135 static void display(FILEDESC *);
136 static void do_free(void *);
137 static void *do_malloc(u_int);
138 static int form_file_list(char **, int);
139 static int fortlen(void);
140 static void get_fort(void);
141 static void get_pos(FILEDESC *);
142 static void get_tbl(FILEDESC *);
143 static void getargs(int, char *[]);
144 static void getpath(void);
145 static void init_prob(void);
146 static int is_dir(const char *);
147 static int is_fortfile(const char *, char **, char **, int);
148 static int is_off_name(const char *);
149 static int max(int, int);
150 static FILEDESC *new_fp(void);
151 static char *off_name(const char *);
152 static void open_dat(FILEDESC *);
153 static void open_fp(FILEDESC *);
154 static FILEDESC *pick_child(FILEDESC *);
155 static void print_file_list(void);
156 static void print_list(FILEDESC *, int);
157 static void sum_noprobs(FILEDESC *);
158 static void sum_tbl(STRFILE *, STRFILE *);
159 static void usage(void);
160 static void zero_tbl(STRFILE *);
162 static char *conv_pat(char *);
163 static int find_matches(void);
164 static void matches_in_list(FILEDESC *);
165 static int maxlen_in_list(FILEDESC *);
167 static regex_t Re_pat;
170 main(int argc, char *argv[])
174 if (getenv("FORTUNE_SAVESTATE") != NULL)
177 (void) setlocale(LC_ALL, "");
183 exit(find_matches() != 0);
188 } while ((Short_only && fortlen() > SLEN) ||
189 (Long_only && fortlen() <= SLEN));
194 if ((fd = creat(Fortfile->posfile, 0666)) < 0) {
195 perror(Fortfile->posfile);
199 * if we can, we exclusive lock, but since it isn't very
200 * important, we just punt if we don't have easy locking
204 write(fd, (char *) &Fortfile->pos, sizeof Fortfile->pos);
205 if (!Fortfile->was_pos_file)
206 chmod(Fortfile->path, 0666);
212 sleep((unsigned int) max(Fort_len / CPERS, MINW));
219 display(FILEDESC *fp)
226 fseeko(fp->inf, Seekpts[0], SEEK_SET);
227 for (Fort_len = 0; fgets(line, sizeof line, fp->inf) != NULL &&
228 !STR_ENDSTRING(line, fp->tbl); Fort_len++) {
229 if (fp->tbl.str_flags & STR_ROTATED)
230 for (p = line; (ch = *p) != '\0'; ++p) {
233 *p = 'A' + (ch - 'A' + 13) % 26;
234 else if (islower(ch))
235 *p = 'a' + (ch - 'a' + 13) % 26;
238 if (fp->tbl.str_flags & STR_COMMENTS
239 && line[0] == fp->tbl.str_delim
240 && line[1] == fp->tbl.str_delim)
244 (void) fflush(stdout);
249 * Return the length of the fortune.
257 if (!(Fortfile->tbl.str_flags & (STR_RANDOM | STR_ORDERED)))
258 nchar = (int)(Seekpts[1] - Seekpts[0]);
261 fseeko(Fortfile->inf, Seekpts[0], SEEK_SET);
263 while (fgets(line, sizeof line, Fortfile->inf) != NULL &&
264 !STR_ENDSTRING(line, Fortfile->tbl))
265 nchar += strlen(line);
273 * This routine evaluates the arguments on the command line
276 getargs(int argc, char *argv[])
286 while ((ch = getopt(argc, argv, "aDefilm:osw")) != -1)
288 while ((ch = getopt(argc, argv, "aefilm:osw")) != -1)
291 case 'a': /* any fortune */
299 case 'e': /* scatter un-allocted prob equally */
302 case 'f': /* find fortune files */
305 case 'l': /* long ones only */
309 case 'o': /* offensive ones only */
312 case 's': /* short ones only */
316 case 'w': /* give time to read */
319 case 'm': /* dump out the fortunes */
323 case 'i': /* case-insensitive match */
333 if (!form_file_list(argv, argc))
334 exit(1); /* errors printed through form_file_list() */
349 error = regcomp(&Re_pat, pat, REG_BASIC);
351 fprintf(stderr, "regcomp(%s) fails\n", pat);
359 * Form the file list from the file specifications.
362 form_file_list(char **files, int file_cnt)
370 Fortunes_only = TRUE;
371 pstr = Fortune_path_arr;
374 i += add_file(NO_PROB, *pstr++, NULL,
375 &File_list, &File_tail, NULL);
377 Fortunes_only = FALSE;
379 fprintf(stderr, "No fortunes found in %s.\n",
384 pstr = Fortune_path_arr;
387 i += add_file(NO_PROB, "fortunes", *pstr++,
388 &File_list, &File_tail, NULL);
391 fprintf(stderr, "No fortunes found in %s.\n",
397 for (i = 0; i < file_cnt; i++) {
399 if (!isdigit((unsigned char)files[i][0]))
403 for (sp = files[i]; isdigit((unsigned char)*sp); sp++) {
404 percent = percent * 10 + *sp - '0';
406 fprintf(stderr, "percentages must be <= 100\n");
411 fprintf(stderr, "percentages must be integers\n");
415 * If the number isn't followed by a '%', then
416 * it was not a percentage, just the first part
417 * of a file name which starts with digits.
423 else if (*++sp == '\0') {
424 if (++i >= file_cnt) {
425 fprintf(stderr, "percentages must precede files\n");
431 if (strcmp(sp, "all") == 0) {
432 pstr = Fortune_path_arr;
435 i += add_file(NO_PROB, *pstr++, NULL,
436 &File_list, &File_tail, NULL);
439 fprintf(stderr, "No fortunes found in %s.\n",
443 } else if (!add_file(percent, sp, NULL, &File_list,
454 * Add a file to the file list.
457 add_file(int percent, const char *file, const char *dir, FILEDESC **head,
458 FILEDESC **tail, FILEDESC *parent)
463 char *tpath, *offensive;
473 tpath = do_malloc((unsigned int)(strlen(dir) + strlen(file) + 2));
474 strcat(strcat(strcpy(tpath, dir), "/"), file);
478 if ((isdir = is_dir(path)) && parent != NULL) {
481 return (FALSE); /* don't recurse */
484 if (!isdir && parent == NULL && (All_forts || Offend) &&
485 !is_off_name(path)) {
486 offensive = off_name(path);
490 path = tpath = offensive;
493 DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
494 file = off_name(file);
498 DPRINTF(1, (stderr, "adding file \"%s\"\n", path));
500 if ((fd = open(path, O_RDONLY)) < 0) {
502 * This is a sneak. If the user said -a, and if the
503 * file we're given isn't a file, we check to see if
504 * there is a -o version. If there is, we treat it as
505 * if *that* were the file given. We only do this for
506 * individual files -- if we're scanning a directory,
507 * we'll pick up the -o file anyway.
509 if (All_forts && offensive != NULL) {
512 path = tpath = offensive;
515 DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
516 file = off_name(file);
519 if (dir == NULL && file[0] != '/') {
521 char **pstr = Fortune_path_arr;
524 i += add_file(percent, file, *pstr++,
528 fprintf(stderr, "No '%s' found in %s.\n",
542 DPRINTF(2, (stderr, "path = \"%s\"\n", path));
546 fp->percent = percent;
551 if ((isdir && !add_dir(fp)) ||
553 !is_fortfile(path, &fp->datfile, &fp->posfile, (parent != NULL))))
557 "fortune:%s not a fortune file or directory\n",
561 do_free(fp->datfile);
562 do_free(fp->posfile);
568 * If the user said -a, we need to make this node a pointer to
569 * both files, if there are two. We don't need to do this if
570 * we are scanning a directory, since the scan will pick up the
573 if (All_forts && parent == NULL && !is_off_name(path))
574 all_forts(fp, offensive);
577 else if (fp->percent == NO_PROB) {
588 fp->was_pos_file = (access(fp->posfile, W_OK) >= 0);
595 * Return a pointer to an initialized new FILEDESC.
602 fp = do_malloc(sizeof(*fp));
604 fp->pos = POS_UNKNOWN;
607 fp->percent = NO_PROB;
608 fp->read_tbl = FALSE;
621 * Return a pointer to the offensive version of a file of this name.
624 off_name(const char *file)
628 new = copy(file, (unsigned int) (strlen(file) + 2));
630 return (strcat(new, "-o"));
635 * Is the file an offensive-style name?
638 is_off_name(const char *file)
644 return (len >= 3 && file[len - 2] == '-' && file[len - 1] == 'o');
649 * Modify a FILEDESC element to be the parent of two children if
650 * there are two children to be a parent of.
653 all_forts(FILEDESC *fp, char *offensive)
656 FILEDESC *scene, *obscene;
658 char *datfile, *posfile;
660 if (fp->child != NULL) /* this is a directory, not a file */
662 if (!is_fortfile(offensive, &datfile, &posfile, FALSE))
664 if ((fd = open(offensive, O_RDONLY)) < 0)
666 DPRINTF(1, (stderr, "adding \"%s\" because of -a\n", offensive));
671 fp->num_children = 2;
673 scene->next = obscene;
674 obscene->next = NULL;
675 scene->child = obscene->child = NULL;
676 scene->parent = obscene->parent = fp;
679 scene->percent = obscene->percent = NO_PROB;
683 obscene->path = offensive;
684 if ((sp = strrchr(offensive, '/')) == NULL)
685 obscene->name = offensive;
687 obscene->name = ++sp;
688 obscene->datfile = datfile;
689 obscene->posfile = posfile;
690 obscene->read_tbl = false;
692 obscene->was_pos_file = (access(obscene->posfile, W_OK) >= 0);
697 * Add the contents of an entire directory.
700 add_dir(FILEDESC *fp)
703 struct dirent *dirent;
707 (void) close(fp->fd);
709 if ((dir = opendir(fp->path)) == NULL) {
714 DPRINTF(1, (stderr, "adding dir \"%s\"\n", fp->path));
715 fp->num_children = 0;
716 while ((dirent = readdir(dir)) != NULL) {
717 if (dirent->d_namlen == 0)
719 name = copy(dirent->d_name, dirent->d_namlen);
720 if (add_file(NO_PROB, name, fp->path, &fp->child, &tailp, fp))
725 if (fp->num_children == 0) {
726 (void) fprintf(stderr,
727 "fortune: %s: No fortune files in directory.\n", fp->path);
736 * Return TRUE if the file is a directory, FALSE otherwise.
739 is_dir(const char *file)
743 if (stat(file, &sbuf) < 0)
746 return (sbuf.st_mode & S_IFDIR);
751 * Return TRUE if the file is a fortune database file. We try and
752 * exclude files without reading them if possible to avoid
753 * overhead. Files which start with ".", or which have "illegal"
754 * suffixes, as contained in suflist[], are ruled out.
758 is_fortfile(const char *file, char **datp, char **posp, int check_for_offend)
763 static const char *suflist[] = {
764 /* list of "illegal" suffixes" */
765 "dat", "pos", "c", "h", "p", "i", "f",
766 "pas", "ftn", "ins.c", "ins,pas",
771 DPRINTF(2, (stderr, "is_fortfile(%s) returns ", file));
774 * Preclude any -o files for offendable people, and any non -o
775 * files for completely offensive people.
777 if (check_for_offend && !All_forts) {
779 if (Offend ^ (file[i - 2] == '-' && file[i - 1] == 'o')) {
780 DPRINTF(2, (stderr, "FALSE (offending file)\n"));
785 if ((sp = strrchr(file, '/')) == NULL)
790 DPRINTF(2, (stderr, "FALSE (file starts with '.')\n"));
793 if (Fortunes_only && strncmp(sp, "fortunes", 8) != 0) {
794 DPRINTF(2, (stderr, "FALSE (check fortunes only)\n"));
797 if ((sp = strrchr(sp, '.')) != NULL) {
799 for (i = 0; suflist[i] != NULL; i++)
800 if (strcmp(sp, suflist[i]) == 0) {
801 DPRINTF(2, (stderr, "FALSE (file has suffix \".%s\")\n", sp));
806 datfile = copy(file, (unsigned int) (strlen(file) + 4)); /* +4 for ".dat" */
807 strcat(datfile, ".dat");
808 if (access(datfile, R_OK) < 0) {
809 DPRINTF(2, (stderr, "FALSE (no readable \".dat\" file)\n"));
819 *posp = copy(file, (unsigned int) (strlen(file) + 4)); /* +4 for ".dat" */
820 strcat(*posp, ".pos");
826 DPRINTF(2, (stderr, "TRUE\n"));
833 * Return a malloc()'ed copy of the string
836 copy(const char *str, unsigned int len)
840 new = do_malloc(len + 1);
851 * Do a malloc, checking for NULL return.
854 do_malloc(unsigned int size)
858 if ((new = malloc(size)) == NULL) {
859 (void) fprintf(stderr, "fortune: out of memory.\n");
868 * Free malloc'ed space, if any.
879 * Initialize the fortune probabilities.
884 FILEDESC *fp, *last = NULL;
885 int percent, num_noprob, frac;
888 * Distribute the residual probability (if any) across all
889 * files with unspecified probability (i.e., probability of 0)
895 for (fp = File_tail; fp != NULL; fp = fp->prev)
896 if (fp->percent == NO_PROB) {
901 percent += fp->percent;
902 DPRINTF(1, (stderr, "summing probabilities:%d%% with %d NO_PROB's",
903 percent, num_noprob));
905 (void) fprintf(stderr,
906 "fortune: probabilities sum to %d%% > 100%%!\n", percent);
908 } else if (percent < 100 && num_noprob == 0) {
909 (void) fprintf(stderr,
910 "fortune: no place to put residual probability (%d%% < 100%%)\n",
913 } else if (percent == 100 && num_noprob != 0) {
914 (void) fprintf(stderr,
915 "fortune: no probability left to put in residual files (100%%)\n");
918 percent = 100 - percent;
920 if (num_noprob != 0) {
921 if (num_noprob > 1) {
922 frac = percent / num_noprob;
923 DPRINTF(1, (stderr, ", frac = %d%%", frac));
924 for (fp = File_tail; fp != last; fp = fp->prev)
925 if (fp->percent == NO_PROB) {
930 last->percent = percent;
931 DPRINTF(1, (stderr, ", residual = %d%%", percent));
935 ", %d%% distributed over remaining fortunes\n",
938 DPRINTF(1, (stderr, "\n"));
948 * Get the fortune data file's seek pointer for the next fortune.
956 if (File_list->next == NULL || File_list->percent == NO_PROB)
959 choice = arc4random_uniform(100);
960 DPRINTF(1, (stderr, "choice = %d\n", choice));
961 for (fp = File_list; fp->percent != NO_PROB; fp = fp->next)
962 if (choice < fp->percent)
965 choice -= fp->percent;
967 " skip \"%s\", %d%% (choice = %d)\n",
968 fp->name, fp->percent, choice));
971 "using \"%s\", %d%% (choice = %d)\n",
972 fp->name, fp->percent, choice));
974 if (fp->percent != NO_PROB)
977 if (fp->next != NULL) {
979 choice = arc4random_uniform(Noprob_tbl.str_numstr);
980 DPRINTF(1, (stderr, "choice = %d (of %u) \n", choice,
981 Noprob_tbl.str_numstr));
982 while ((unsigned int)choice >= fp->tbl.str_numstr) {
983 choice -= fp->tbl.str_numstr;
986 " skip \"%s\", %u (choice = %d)\n",
987 fp->name, fp->tbl.str_numstr,
990 DPRINTF(1, (stderr, "using \"%s\", %u\n", fp->name,
991 fp->tbl.str_numstr));
995 if (fp->child != NULL) {
996 DPRINTF(1, (stderr, "picking child\n"));
1003 (off_t) (sizeof fp->tbl + fp->pos * sizeof Seekpts[0]), SEEK_SET);
1004 read(fp->datfd, Seekpts, sizeof Seekpts);
1005 Seekpts[0] = be64toh(Seekpts[0]);
1006 Seekpts[1] = be64toh(Seekpts[1]);
1011 * Pick a child from a chosen parent.
1014 pick_child(FILEDESC *parent)
1020 choice = arc4random_uniform(parent->num_children);
1021 DPRINTF(1, (stderr, " choice = %d (of %d)\n",
1022 choice, parent->num_children));
1023 for (fp = parent->child; choice--; fp = fp->next)
1025 DPRINTF(1, (stderr, " using %s\n", fp->name));
1030 choice = arc4random_uniform(parent->tbl.str_numstr);
1031 DPRINTF(1, (stderr, " choice = %d (of %u)\n",
1032 choice, parent->tbl.str_numstr));
1033 for (fp = parent->child; (unsigned)choice >= fp->tbl.str_numstr;
1035 choice -= fp->tbl.str_numstr;
1036 DPRINTF(1, (stderr, "\tskip %s, %u (choice = %d)\n",
1037 fp->name, fp->tbl.str_numstr, choice));
1039 DPRINTF(1, (stderr, " using %s, %u\n", fp->name,
1040 fp->tbl.str_numstr));
1047 * Sum up all the noprob probabilities, starting with fp.
1050 sum_noprobs(FILEDESC *fp)
1052 static bool did_noprobs = FALSE;
1056 zero_tbl(&Noprob_tbl);
1057 while (fp != NULL) {
1059 sum_tbl(&Noprob_tbl, &fp->tbl);
1068 return (i >= j ? i : j);
1073 * Assocatiate a FILE * with the given FILEDESC.
1076 open_fp(FILEDESC *fp)
1078 if (fp->inf == NULL && (fp->inf = fdopen(fp->fd, "r")) == NULL) {
1086 * Open up the dat file if we need to.
1089 open_dat(FILEDESC *fp)
1091 if (fp->datfd < 0 && (fp->datfd = open(fp->datfile, O_RDONLY)) < 0) {
1092 perror(fp->datfile);
1099 * Get the position from the pos file, if there is one. If not,
1100 * return a random number.
1103 get_pos(FILEDESC *fp)
1107 assert(fp->read_tbl);
1108 if (fp->pos == POS_UNKNOWN) {
1110 if ((fd = open(fp->posfile, O_RDONLY)) < 0 ||
1111 read(fd, &fp->pos, sizeof fp->pos) != sizeof fp->pos)
1112 fp->pos = arc4random_uniform(fp->tbl.str_numstr);
1113 else if (fp->pos >= fp->tbl.str_numstr)
1114 fp->pos %= fp->tbl.str_numstr;
1119 fp->pos = arc4random_uniform(fp->tbl.str_numstr);
1121 if (++(fp->pos) >= fp->tbl.str_numstr)
1122 fp->pos -= fp->tbl.str_numstr;
1123 DPRINTF(1, (stderr, "pos for %s is %ld\n", fp->name, (long)fp->pos));
1128 * Get the tbl data file the datfile.
1131 get_tbl(FILEDESC *fp)
1138 if (fp->child == NULL) {
1139 if ((fd = open(fp->datfile, O_RDONLY)) < 0) {
1140 perror(fp->datfile);
1143 if (read(fd, (char *) &fp->tbl, sizeof fp->tbl) != sizeof fp->tbl) {
1144 (void)fprintf(stderr,
1145 "fortune: %s corrupted\n", fp->path);
1148 /* fp->tbl.str_version = be32toh(fp->tbl.str_version); */
1149 fp->tbl.str_numstr = be32toh(fp->tbl.str_numstr);
1150 fp->tbl.str_longlen = be32toh(fp->tbl.str_longlen);
1151 fp->tbl.str_shortlen = be32toh(fp->tbl.str_shortlen);
1152 fp->tbl.str_flags = be32toh(fp->tbl.str_flags);
1157 for (child = fp->child; child != NULL; child = child->next) {
1159 sum_tbl(&fp->tbl, &child->tbl);
1162 fp->read_tbl = TRUE;
1167 * Zero out the fields we care about in a tbl structure.
1170 zero_tbl(STRFILE *tp)
1173 tp->str_longlen = 0;
1174 tp->str_shortlen = ~0;
1179 * Merge the tbl data of t2 into t1.
1182 sum_tbl(STRFILE *t1, STRFILE *t2)
1184 t1->str_numstr += t2->str_numstr;
1185 if (t1->str_longlen < t2->str_longlen)
1186 t1->str_longlen = t2->str_longlen;
1187 if (t1->str_shortlen > t2->str_shortlen)
1188 t1->str_shortlen = t2->str_shortlen;
1191 #define STR(str) ((str) == NULL ? "NULL" : (str))
1195 * Print out the file list
1198 print_file_list(void)
1200 print_list(File_list, 0);
1205 * Print out the actual list, recursively.
1208 print_list(FILEDESC *list, int lev)
1210 while (list != NULL) {
1211 fprintf(stderr, "%*s", lev * 4, "");
1212 if (list->percent == NO_PROB)
1213 fprintf(stderr, "___%%");
1215 fprintf(stderr, "%3d%%", list->percent);
1216 fprintf(stderr, " %s", STR(list->name));
1217 DPRINTF(1, (stderr, " (%s, %s, %s)", STR(list->path),
1218 STR(list->datfile), STR(list->posfile)));
1219 fprintf(stderr, "\n");
1220 if (list->child != NULL)
1221 print_list(list->child, lev + 1);
1228 * Convert the pattern to an ignore-case equivalent.
1231 conv_pat(char *orig)
1237 cnt = 1; /* allow for '\0' */
1238 for (sp = orig; *sp != '\0'; sp++)
1239 if (isalpha((unsigned char)*sp))
1243 if ((new = malloc(cnt)) == NULL) {
1244 fprintf(stderr, "pattern too long for ignoring case\n");
1248 for (sp = new; *orig != '\0'; orig++) {
1249 if (islower((unsigned char)*orig)) {
1252 *sp++ = toupper((unsigned char)*orig);
1255 else if (isupper((unsigned char)*orig)) {
1258 *sp++ = tolower((unsigned char)*orig);
1271 * Find all the fortunes which match the pattern we've been given.
1276 Fort_len = maxlen_in_list(File_list);
1277 DPRINTF(2, (stderr, "Maximum length is %d\n", Fort_len));
1278 /* extra length, "%\n" is appended */
1279 Fortbuf = do_malloc((unsigned int) Fort_len + 10);
1282 matches_in_list(File_list);
1289 * Return the maximum fortune len in the file list.
1292 maxlen_in_list(FILEDESC *list)
1298 for (fp = list; fp != NULL; fp = fp->next) {
1299 if (fp->child != NULL) {
1300 if ((len = maxlen_in_list(fp->child)) > maxlen)
1305 if (fp->tbl.str_longlen > (unsigned int)maxlen)
1306 maxlen = fp->tbl.str_longlen;
1315 * Print out the matches from the files in the list.
1318 matches_in_list(FILEDESC *list)
1325 for (fp = list; fp != NULL; fp = fp->next) {
1326 if (fp->child != NULL) {
1327 matches_in_list(fp->child);
1330 DPRINTF(1, (stderr, "searching in %s\n", fp->path));
1334 while (fgets(sp, Fort_len, fp->inf) != NULL)
1335 if (fp->tbl.str_flags & STR_COMMENTS
1336 && sp[0] == fp->tbl.str_delim
1337 && sp[1] == fp->tbl.str_delim)
1339 else if (!STR_ENDSTRING(sp, fp->tbl))
1343 if (fp->tbl.str_flags & STR_ROTATED)
1344 for (p = Fortbuf; (ch = *p) != '\0'; ++p) {
1347 *p = 'A' + (ch - 'A' + 13) % 26;
1348 else if (islower(ch))
1349 *p = 'a' + (ch - 'a' + 13) % 26;
1352 if (regexec(&Re_pat, Fortbuf, 0, NULL, 0) != REG_NOMATCH) {
1353 printf("%c%c", fp->tbl.str_delim,
1356 printf(" (%s)", fp->name);
1361 (void) fwrite(Fortbuf, 1, (sp - Fortbuf), stdout);
1371 (void) fprintf(stderr, "fortune [-a");
1373 (void) fprintf(stderr, "D");
1375 (void) fprintf(stderr, "efilosw]");
1376 (void) fprintf(stderr, " [-m pattern]");
1377 (void) fprintf(stderr, " [[N%%] file/directory/all]\n");
1383 * Set up file search patch from environment var FORTUNE_PATH;
1384 * if not set, use the compiled in FORTDIR.
1391 char *pch, **ppch, *str, *path;
1394 Fortune_path = getenv("FORTUNE_PATH");
1395 if (Fortune_path == NULL) {
1396 Fortune_path = FORTDIR;
1399 path = strdup(Fortune_path);
1401 for (nstr = 2, pch = path; *pch != '\0'; pch++) {
1406 ppch = Fortune_path_arr = (char **)calloc(nstr, sizeof(char *));
1409 str = strtok(path, ":");
1415 str = strtok(NULL, ":");
1419 if (foundenv == 1) {
1421 "fortune: FORTUNE_PATH: None of the specified "
1422 "directories found.\n");
1426 Fortune_path_arr[0] = strdup(FORTDIR);