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 bool Found_one; /* did we find a match? */
101 bool Find_files = FALSE; /* just find a list of proper fortune files */
102 bool Fortunes_only = FALSE; /* check only "fortunes" files */
103 bool Wait = FALSE; /* wait desired after fortune */
104 bool Short_only = FALSE; /* short fortune desired */
105 bool Long_only = FALSE; /* long fortune desired */
106 bool Offend = FALSE; /* offensive fortunes only */
107 bool All_forts = FALSE; /* any fortune allowed */
108 bool Equal_probs = FALSE; /* scatter un-allocted prob equally */
109 bool Match = FALSE; /* dump fortunes matching a pattern */
110 static bool WriteToDisk = false; /* use files on disk to save state */
112 int Debug = FALSE; /* print debug messages */
115 char *Fortbuf = NULL; /* fortune buffer for -m */
119 off_t Seekpts[2]; /* seek pointers to fortunes */
121 FILEDESC *File_list = NULL, /* Head of file list */
122 *File_tail = NULL; /* Tail of file list */
123 FILEDESC *Fortfile; /* Fortune file to use */
125 STRFILE Noprob_tbl; /* sum of data for all no prob files */
127 const char *Fortune_path;
128 char **Fortune_path_arr;
130 int add_dir(FILEDESC *);
131 int add_file(int, const char *, const char *, FILEDESC **, FILEDESC **,
133 void all_forts(FILEDESC *, char *);
134 char *copy(const char *, u_int);
135 void display(FILEDESC *);
136 void do_free(void *);
137 void *do_malloc(u_int);
138 int form_file_list(char **, int);
141 void get_pos(FILEDESC *);
142 void get_tbl(FILEDESC *);
143 void getargs(int, char *[]);
145 void init_prob(void);
146 int is_dir(const char *);
147 int is_fortfile(const char *, char **, char **, int);
148 int is_off_name(const char *);
152 char *off_name(const char *);
153 void open_dat(FILEDESC *);
154 void open_fp(FILEDESC *);
156 pick_child(FILEDESC *);
157 void print_file_list(void);
158 void print_list(FILEDESC *, int);
159 void sum_noprobs(FILEDESC *);
160 void sum_tbl(STRFILE *, STRFILE *);
162 void zero_tbl(STRFILE *);
164 char *conv_pat(char *);
165 int find_matches(void);
166 void matches_in_list(FILEDESC *);
167 int maxlen_in_list(FILEDESC *);
169 static regex_t Re_pat;
172 main(int argc, char *argv[])
176 if (getenv("FORTUNE_SAVESTATE") != NULL)
179 (void) setlocale(LC_ALL, "");
185 exit(find_matches() != 0);
190 } while ((Short_only && fortlen() > SLEN) ||
191 (Long_only && fortlen() <= SLEN));
196 if ((fd = creat(Fortfile->posfile, 0666)) < 0) {
197 perror(Fortfile->posfile);
201 * if we can, we exclusive lock, but since it isn't very
202 * important, we just punt if we don't have easy locking
206 write(fd, (char *) &Fortfile->pos, sizeof Fortfile->pos);
207 if (!Fortfile->was_pos_file)
208 chmod(Fortfile->path, 0666);
214 sleep((unsigned int) max(Fort_len / CPERS, MINW));
221 display(FILEDESC *fp)
228 fseeko(fp->inf, Seekpts[0], SEEK_SET);
229 for (Fort_len = 0; fgets(line, sizeof line, fp->inf) != NULL &&
230 !STR_ENDSTRING(line, fp->tbl); Fort_len++) {
231 if (fp->tbl.str_flags & STR_ROTATED)
232 for (p = line; (ch = *p) != '\0'; ++p) {
235 *p = 'A' + (ch - 'A' + 13) % 26;
236 else if (islower(ch))
237 *p = 'a' + (ch - 'a' + 13) % 26;
240 if (fp->tbl.str_flags & STR_COMMENTS
241 && line[0] == fp->tbl.str_delim
242 && line[1] == fp->tbl.str_delim)
246 (void) fflush(stdout);
251 * Return the length of the fortune.
259 if (!(Fortfile->tbl.str_flags & (STR_RANDOM | STR_ORDERED)))
260 nchar = (int)(Seekpts[1] - Seekpts[0]);
263 fseeko(Fortfile->inf, Seekpts[0], SEEK_SET);
265 while (fgets(line, sizeof line, Fortfile->inf) != NULL &&
266 !STR_ENDSTRING(line, Fortfile->tbl))
267 nchar += strlen(line);
275 * This routine evaluates the arguments on the command line
278 getargs(int argc, char *argv[])
288 while ((ch = getopt(argc, argv, "aDefilm:osw")) != -1)
290 while ((ch = getopt(argc, argv, "aefilm:osw")) != -1)
293 case 'a': /* any fortune */
302 Equal_probs++; /* scatter un-allocted prob equally */
304 case 'f': /* find fortune files */
307 case 'l': /* long ones only */
311 case 'o': /* offensive ones only */
314 case 's': /* short ones only */
318 case 'w': /* give time to read */
321 case 'm': /* dump out the fortunes */
325 case 'i': /* case-insensitive match */
335 if (!form_file_list(argv, argc))
336 exit(1); /* errors printed through form_file_list() */
351 error = regcomp(&Re_pat, pat, REG_BASIC);
353 fprintf(stderr, "regcomp(%s) fails\n", pat);
361 * Form the file list from the file specifications.
364 form_file_list(char **files, int file_cnt)
372 Fortunes_only = TRUE;
373 pstr = Fortune_path_arr;
376 i += add_file(NO_PROB, *pstr++, NULL,
377 &File_list, &File_tail, NULL);
379 Fortunes_only = FALSE;
381 fprintf(stderr, "No fortunes found in %s.\n",
386 pstr = Fortune_path_arr;
389 i += add_file(NO_PROB, "fortunes", *pstr++,
390 &File_list, &File_tail, NULL);
393 fprintf(stderr, "No fortunes found in %s.\n",
399 for (i = 0; i < file_cnt; i++) {
401 if (!isdigit((unsigned char)files[i][0]))
405 for (sp = files[i]; isdigit((unsigned char)*sp); sp++)
406 percent = percent * 10 + *sp - '0';
408 fprintf(stderr, "percentages must be <= 100\n");
412 fprintf(stderr, "percentages must be integers\n");
416 * If the number isn't followed by a '%', then
417 * it was not a percentage, just the first part
418 * of a file name which starts with digits.
424 else if (*++sp == '\0') {
425 if (++i >= file_cnt) {
426 fprintf(stderr, "percentages must precede files\n");
432 if (strcmp(sp, "all") == 0) {
433 pstr = Fortune_path_arr;
436 i += add_file(NO_PROB, *pstr++, NULL,
437 &File_list, &File_tail, NULL);
440 fprintf(stderr, "No fortunes found in %s.\n",
444 } else if (!add_file(percent, sp, NULL, &File_list,
455 * Add a file to the file list.
458 add_file(int percent, const char *file, const char *dir, FILEDESC **head,
459 FILEDESC **tail, FILEDESC *parent)
464 char *tpath, *offensive;
474 tpath = do_malloc((unsigned int)(strlen(dir) + strlen(file) + 2));
475 strcat(strcat(strcpy(tpath, dir), "/"), file);
479 if ((isdir = is_dir(path)) && parent != NULL) {
482 return (FALSE); /* don't recurse */
485 if (!isdir && parent == NULL && (All_forts || Offend) &&
486 !is_off_name(path)) {
487 offensive = off_name(path);
494 DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
495 file = off_name(file);
499 DPRINTF(1, (stderr, "adding file \"%s\"\n", path));
501 if ((fd = open(path, O_RDONLY)) < 0) {
503 * This is a sneak. If the user said -a, and if the
504 * file we're given isn't a file, we check to see if
505 * there is a -o version. If there is, we treat it as
506 * if *that* were the file given. We only do this for
507 * individual files -- if we're scanning a directory,
508 * we'll pick up the -o file anyway.
510 if (All_forts && offensive != NULL) {
516 DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
517 file = off_name(file);
520 if (dir == NULL && file[0] != '/') {
522 char **pstr = Fortune_path_arr;
525 i += add_file(percent, file, *pstr++,
529 fprintf(stderr, "No '%s' found in %s.\n",
543 DPRINTF(2, (stderr, "path = \"%s\"\n", path));
547 fp->percent = percent;
552 if ((isdir && !add_dir(fp)) ||
554 !is_fortfile(path, &fp->datfile, &fp->posfile, (parent != NULL))))
558 "fortune:%s not a fortune file or directory\n",
562 do_free(fp->datfile);
563 do_free(fp->posfile);
569 * If the user said -a, we need to make this node a pointer to
570 * both files, if there are two. We don't need to do this if
571 * we are scanning a directory, since the scan will pick up the
574 if (All_forts && parent == NULL && !is_off_name(path))
575 all_forts(fp, offensive);
578 else if (fp->percent == NO_PROB) {
589 fp->was_pos_file = (access(fp->posfile, W_OK) >= 0);
596 * Return a pointer to an initialized new FILEDESC.
603 fp = do_malloc(sizeof(*fp));
605 fp->pos = POS_UNKNOWN;
608 fp->percent = NO_PROB;
609 fp->read_tbl = FALSE;
622 * Return a pointer to the offensive version of a file of this name.
625 off_name(const char *file)
629 new = copy(file, (unsigned int) (strlen(file) + 2));
631 return (strcat(new, "-o"));
636 * Is the file an offensive-style name?
639 is_off_name(const char *file)
645 return (len >= 3 && file[len - 2] == '-' && file[len - 1] == 'o');
650 * Modify a FILEDESC element to be the parent of two children if
651 * there are two children to be a parent of.
654 all_forts(FILEDESC *fp, char *offensive)
657 FILEDESC *scene, *obscene;
659 char *datfile, *posfile;
661 if (fp->child != NULL) /* this is a directory, not a file */
663 if (!is_fortfile(offensive, &datfile, &posfile, FALSE))
665 if ((fd = open(offensive, O_RDONLY)) < 0)
667 DPRINTF(1, (stderr, "adding \"%s\" because of -a\n", offensive));
672 fp->num_children = 2;
674 scene->next = obscene;
675 obscene->next = NULL;
676 scene->child = obscene->child = NULL;
677 scene->parent = obscene->parent = fp;
680 scene->percent = obscene->percent = NO_PROB;
684 obscene->path = offensive;
685 if ((sp = strrchr(offensive, '/')) == NULL)
686 obscene->name = offensive;
688 obscene->name = ++sp;
689 obscene->datfile = datfile;
690 obscene->posfile = posfile;
691 obscene->read_tbl = false;
693 obscene->was_pos_file = (access(obscene->posfile, W_OK) >= 0);
698 * Add the contents of an entire directory.
701 add_dir(FILEDESC *fp)
704 struct dirent *dirent;
708 (void) close(fp->fd);
710 if ((dir = opendir(fp->path)) == NULL) {
715 DPRINTF(1, (stderr, "adding dir \"%s\"\n", fp->path));
716 fp->num_children = 0;
717 while ((dirent = readdir(dir)) != NULL) {
718 if (dirent->d_namlen == 0)
720 name = copy(dirent->d_name, dirent->d_namlen);
721 if (add_file(NO_PROB, name, fp->path, &fp->child, &tailp, fp))
726 if (fp->num_children == 0) {
727 (void) fprintf(stderr,
728 "fortune: %s: No fortune files in directory.\n", fp->path);
737 * Return TRUE if the file is a directory, FALSE otherwise.
740 is_dir(const char *file)
744 if (stat(file, &sbuf) < 0)
747 return (sbuf.st_mode & S_IFDIR);
752 * Return TRUE if the file is a fortune database file. We try and
753 * exclude files without reading them if possible to avoid
754 * overhead. Files which start with ".", or which have "illegal"
755 * suffixes, as contained in suflist[], are ruled out.
759 is_fortfile(const char *file, char **datp, char **posp, int check_for_offend)
764 static const char *suflist[] = {
765 /* list of "illegal" suffixes" */
766 "dat", "pos", "c", "h", "p", "i", "f",
767 "pas", "ftn", "ins.c", "ins,pas",
772 DPRINTF(2, (stderr, "is_fortfile(%s) returns ", file));
775 * Preclude any -o files for offendable people, and any non -o
776 * files for completely offensive people.
778 if (check_for_offend && !All_forts) {
780 if (Offend ^ (file[i - 2] == '-' && file[i - 1] == 'o')) {
781 DPRINTF(2, (stderr, "FALSE (offending file)\n"));
786 if ((sp = strrchr(file, '/')) == NULL)
791 DPRINTF(2, (stderr, "FALSE (file starts with '.')\n"));
794 if (Fortunes_only && strncmp(sp, "fortunes", 8) != 0) {
795 DPRINTF(2, (stderr, "FALSE (check fortunes only)\n"));
798 if ((sp = strrchr(sp, '.')) != NULL) {
800 for (i = 0; suflist[i] != NULL; i++)
801 if (strcmp(sp, suflist[i]) == 0) {
802 DPRINTF(2, (stderr, "FALSE (file has suffix \".%s\")\n", sp));
807 datfile = copy(file, (unsigned int) (strlen(file) + 4)); /* +4 for ".dat" */
808 strcat(datfile, ".dat");
809 if (access(datfile, R_OK) < 0) {
810 DPRINTF(2, (stderr, "FALSE (no readable \".dat\" file)\n"));
813 DPRINTF(0, (stderr, "Warning: file \"%s\" unreadable\n", datfile));
824 *posp = copy(file, (unsigned int) (strlen(file) + 4)); /* +4 for ".dat" */
825 strcat(*posp, ".pos");
831 DPRINTF(2, (stderr, "TRUE\n"));
838 * Return a malloc()'ed copy of the string
841 copy(const char *str, unsigned int len)
845 new = do_malloc(len + 1);
856 * Do a malloc, checking for NULL return.
859 do_malloc(unsigned int size)
863 if ((new = malloc(size)) == NULL) {
864 (void) fprintf(stderr, "fortune: out of memory.\n");
873 * Free malloc'ed space, if any.
884 * Initialize the fortune probabilities.
889 FILEDESC *fp, *last = NULL;
890 int percent, num_noprob, frac;
893 * Distribute the residual probability (if any) across all
894 * files with unspecified probability (i.e., probability of 0)
900 for (fp = File_tail; fp != NULL; fp = fp->prev)
901 if (fp->percent == NO_PROB) {
906 percent += fp->percent;
907 DPRINTF(1, (stderr, "summing probabilities:%d%% with %d NO_PROB's",
908 percent, num_noprob));
910 (void) fprintf(stderr,
911 "fortune: probabilities sum to %d%% > 100%%!\n", percent);
913 } else if (percent < 100 && num_noprob == 0) {
914 (void) fprintf(stderr,
915 "fortune: no place to put residual probability (%d%% < 100%%)\n",
918 } else if (percent == 100 && num_noprob != 0) {
919 (void) fprintf(stderr,
920 "fortune: no probability left to put in residual files (100%%)\n");
923 percent = 100 - percent;
925 if (num_noprob != 0) {
926 if (num_noprob > 1) {
927 frac = percent / num_noprob;
928 DPRINTF(1, (stderr, ", frac = %d%%", frac));
929 for (fp = File_tail; fp != last; fp = fp->prev)
930 if (fp->percent == NO_PROB) {
935 last->percent = percent;
936 DPRINTF(1, (stderr, ", residual = %d%%", percent));
940 ", %d%% distributed over remaining fortunes\n",
943 DPRINTF(1, (stderr, "\n"));
953 * Get the fortune data file's seek pointer for the next fortune.
961 if (File_list->next == NULL || File_list->percent == NO_PROB)
964 choice = arc4random_uniform(100);
965 DPRINTF(1, (stderr, "choice = %d\n", choice));
966 for (fp = File_list; fp->percent != NO_PROB; fp = fp->next)
967 if (choice < fp->percent)
970 choice -= fp->percent;
972 " skip \"%s\", %d%% (choice = %d)\n",
973 fp->name, fp->percent, choice));
976 "using \"%s\", %d%% (choice = %d)\n",
977 fp->name, fp->percent, choice));
979 if (fp->percent != NO_PROB)
982 if (fp->next != NULL) {
984 choice = arc4random_uniform(Noprob_tbl.str_numstr);
985 DPRINTF(1, (stderr, "choice = %d (of %u) \n", choice,
986 Noprob_tbl.str_numstr));
987 while ((unsigned int)choice >= fp->tbl.str_numstr) {
988 choice -= fp->tbl.str_numstr;
991 " skip \"%s\", %u (choice = %d)\n",
992 fp->name, fp->tbl.str_numstr,
995 DPRINTF(1, (stderr, "using \"%s\", %u\n", fp->name,
996 fp->tbl.str_numstr));
1000 if (fp->child != NULL) {
1001 DPRINTF(1, (stderr, "picking child\n"));
1002 fp = pick_child(fp);
1008 (off_t) (sizeof fp->tbl + fp->pos * sizeof Seekpts[0]), SEEK_SET);
1009 read(fp->datfd, Seekpts, sizeof Seekpts);
1010 Seekpts[0] = be64toh(Seekpts[0]);
1011 Seekpts[1] = be64toh(Seekpts[1]);
1016 * Pick a child from a chosen parent.
1019 pick_child(FILEDESC *parent)
1025 choice = arc4random_uniform(parent->num_children);
1026 DPRINTF(1, (stderr, " choice = %d (of %d)\n",
1027 choice, parent->num_children));
1028 for (fp = parent->child; choice--; fp = fp->next)
1030 DPRINTF(1, (stderr, " using %s\n", fp->name));
1035 choice = arc4random_uniform(parent->tbl.str_numstr);
1036 DPRINTF(1, (stderr, " choice = %d (of %u)\n",
1037 choice, parent->tbl.str_numstr));
1038 for (fp = parent->child; (unsigned)choice >= fp->tbl.str_numstr;
1040 choice -= fp->tbl.str_numstr;
1041 DPRINTF(1, (stderr, "\tskip %s, %u (choice = %d)\n",
1042 fp->name, fp->tbl.str_numstr, choice));
1044 DPRINTF(1, (stderr, " using %s, %u\n", fp->name,
1045 fp->tbl.str_numstr));
1052 * Sum up all the noprob probabilities, starting with fp.
1055 sum_noprobs(FILEDESC *fp)
1057 static bool did_noprobs = FALSE;
1061 zero_tbl(&Noprob_tbl);
1062 while (fp != NULL) {
1064 sum_tbl(&Noprob_tbl, &fp->tbl);
1073 return (i >= j ? i : j);
1078 * Assocatiate a FILE * with the given FILEDESC.
1081 open_fp(FILEDESC *fp)
1083 if (fp->inf == NULL && (fp->inf = fdopen(fp->fd, "r")) == NULL) {
1091 * Open up the dat file if we need to.
1094 open_dat(FILEDESC *fp)
1096 if (fp->datfd < 0 && (fp->datfd = open(fp->datfile, O_RDONLY)) < 0) {
1097 perror(fp->datfile);
1104 * Get the position from the pos file, if there is one. If not,
1105 * return a random number.
1108 get_pos(FILEDESC *fp)
1112 assert(fp->read_tbl);
1113 if (fp->pos == POS_UNKNOWN) {
1115 if ((fd = open(fp->posfile, O_RDONLY)) < 0 ||
1116 read(fd, &fp->pos, sizeof fp->pos) != sizeof fp->pos)
1117 fp->pos = arc4random_uniform(fp->tbl.str_numstr);
1118 else if (fp->pos >= fp->tbl.str_numstr)
1119 fp->pos %= fp->tbl.str_numstr;
1124 fp->pos = arc4random_uniform(fp->tbl.str_numstr);
1126 if (++(fp->pos) >= fp->tbl.str_numstr)
1127 fp->pos -= fp->tbl.str_numstr;
1128 DPRINTF(1, (stderr, "pos for %s is %ld\n", fp->name, (long)fp->pos));
1133 * Get the tbl data file the datfile.
1136 get_tbl(FILEDESC *fp)
1143 if (fp->child == NULL) {
1144 if ((fd = open(fp->datfile, O_RDONLY)) < 0) {
1145 perror(fp->datfile);
1148 if (read(fd, (char *) &fp->tbl, sizeof fp->tbl) != sizeof fp->tbl) {
1149 (void)fprintf(stderr,
1150 "fortune: %s corrupted\n", fp->path);
1153 /* fp->tbl.str_version = be32toh(fp->tbl.str_version); */
1154 fp->tbl.str_numstr = be32toh(fp->tbl.str_numstr);
1155 fp->tbl.str_longlen = be32toh(fp->tbl.str_longlen);
1156 fp->tbl.str_shortlen = be32toh(fp->tbl.str_shortlen);
1157 fp->tbl.str_flags = be32toh(fp->tbl.str_flags);
1162 for (child = fp->child; child != NULL; child = child->next) {
1164 sum_tbl(&fp->tbl, &child->tbl);
1167 fp->read_tbl = TRUE;
1172 * Zero out the fields we care about in a tbl structure.
1175 zero_tbl(STRFILE *tp)
1178 tp->str_longlen = 0;
1179 tp->str_shortlen = ~0;
1184 * Merge the tbl data of t2 into t1.
1187 sum_tbl(STRFILE *t1, STRFILE *t2)
1189 t1->str_numstr += t2->str_numstr;
1190 if (t1->str_longlen < t2->str_longlen)
1191 t1->str_longlen = t2->str_longlen;
1192 if (t1->str_shortlen > t2->str_shortlen)
1193 t1->str_shortlen = t2->str_shortlen;
1196 #define STR(str) ((str) == NULL ? "NULL" : (str))
1200 * Print out the file list
1203 print_file_list(void)
1205 print_list(File_list, 0);
1210 * Print out the actual list, recursively.
1213 print_list(FILEDESC *list, int lev)
1215 while (list != NULL) {
1216 fprintf(stderr, "%*s", lev * 4, "");
1217 if (list->percent == NO_PROB)
1218 fprintf(stderr, "___%%");
1220 fprintf(stderr, "%3d%%", list->percent);
1221 fprintf(stderr, " %s", STR(list->name));
1222 DPRINTF(1, (stderr, " (%s, %s, %s)", STR(list->path),
1223 STR(list->datfile), STR(list->posfile)));
1224 fprintf(stderr, "\n");
1225 if (list->child != NULL)
1226 print_list(list->child, lev + 1);
1233 * Convert the pattern to an ignore-case equivalent.
1236 conv_pat(char *orig)
1242 cnt = 1; /* allow for '\0' */
1243 for (sp = orig; *sp != '\0'; sp++)
1244 if (isalpha((unsigned char)*sp))
1248 if ((new = malloc(cnt)) == NULL) {
1249 fprintf(stderr, "pattern too long for ignoring case\n");
1253 for (sp = new; *orig != '\0'; orig++) {
1254 if (islower((unsigned char)*orig)) {
1257 *sp++ = toupper((unsigned char)*orig);
1260 else if (isupper((unsigned char)*orig)) {
1263 *sp++ = tolower((unsigned char)*orig);
1276 * Find all the fortunes which match the pattern we've been given.
1281 Fort_len = maxlen_in_list(File_list);
1282 DPRINTF(2, (stderr, "Maximum length is %d\n", Fort_len));
1283 /* extra length, "%\n" is appended */
1284 Fortbuf = do_malloc((unsigned int) Fort_len + 10);
1287 matches_in_list(File_list);
1294 * Return the maximum fortune len in the file list.
1297 maxlen_in_list(FILEDESC *list)
1303 for (fp = list; fp != NULL; fp = fp->next) {
1304 if (fp->child != NULL) {
1305 if ((len = maxlen_in_list(fp->child)) > maxlen)
1310 if (fp->tbl.str_longlen > (unsigned int)maxlen)
1311 maxlen = fp->tbl.str_longlen;
1320 * Print out the matches from the files in the list.
1323 matches_in_list(FILEDESC *list)
1330 for (fp = list; fp != NULL; fp = fp->next) {
1331 if (fp->child != NULL) {
1332 matches_in_list(fp->child);
1335 DPRINTF(1, (stderr, "searching in %s\n", fp->path));
1339 while (fgets(sp, Fort_len, fp->inf) != NULL)
1340 if (fp->tbl.str_flags & STR_COMMENTS
1341 && sp[0] == fp->tbl.str_delim
1342 && sp[1] == fp->tbl.str_delim)
1344 else if (!STR_ENDSTRING(sp, fp->tbl))
1348 if (fp->tbl.str_flags & STR_ROTATED)
1349 for (p = Fortbuf; (ch = *p) != '\0'; ++p) {
1352 *p = 'A' + (ch - 'A' + 13) % 26;
1353 else if (islower(ch))
1354 *p = 'a' + (ch - 'a' + 13) % 26;
1357 if (regexec(&Re_pat, Fortbuf, 0, NULL, 0) != REG_NOMATCH) {
1358 printf("%c%c", fp->tbl.str_delim,
1361 printf(" (%s)", fp->name);
1366 (void) fwrite(Fortbuf, 1, (sp - Fortbuf), stdout);
1376 (void) fprintf(stderr, "fortune [-a");
1378 (void) fprintf(stderr, "D");
1380 (void) fprintf(stderr, "efilosw]");
1381 (void) fprintf(stderr, " [-m pattern]");
1382 (void) fprintf(stderr, " [[N%%] file/directory/all]\n");
1388 * Set up file search patch from environment var FORTUNE_PATH;
1389 * if not set, use the compiled in FORTDIR.
1396 char *pch, **ppch, *str, *path;
1399 Fortune_path = getenv("FORTUNE_PATH");
1400 if (Fortune_path == NULL) {
1401 Fortune_path = FORTDIR;
1404 path = strdup(Fortune_path);
1406 for (nstr = 2, pch = path; *pch != '\0'; pch++) {
1411 ppch = Fortune_path_arr = (char **)calloc(nstr, sizeof(char *));
1414 str = strtok(path, ":");
1420 str = strtok(NULL, ":");
1424 if (foundenv == 1) {
1426 "fortune: FORTUNE_PATH: None of the specified "
1427 "directories found.\n");
1431 Fortune_path_arr[0] = strdup(FORTDIR);