1292 lines
28 KiB
C
1292 lines
28 KiB
C
|
/* $OpenBSD: fortune.c,v 1.42 2015/02/06 10:50:48 tedu Exp $ */
|
||
|
/* $NetBSD: fortune.c,v 1.8 1995/03/23 08:28:40 cgd Exp $ */
|
||
|
|
||
|
/*-
|
||
|
* Copyright (c) 1986, 1993
|
||
|
* The Regents of the University of California. All rights reserved.
|
||
|
*
|
||
|
* This code is derived from software contributed to Berkeley by
|
||
|
* Ken Arnold.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
* 3. Neither the name of the University nor the names of its contributors
|
||
|
* may be used to endorse or promote products derived from this software
|
||
|
* without specific prior written permission.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
* SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include <sys/stat.h>
|
||
|
#include <sys/types.h>
|
||
|
|
||
|
#include <dirent.h>
|
||
|
#include <fcntl.h>
|
||
|
#include <assert.h>
|
||
|
#include <unistd.h>
|
||
|
#include <stdio.h>
|
||
|
#include <ctype.h>
|
||
|
#include <stdlib.h>
|
||
|
#include <string.h>
|
||
|
#include <limits.h>
|
||
|
#include <regex.h>
|
||
|
#include "strfile.h"
|
||
|
|
||
|
#define bool short
|
||
|
|
||
|
#define MINW 6 /* minimum wait if desired */
|
||
|
#define CPERS 20 /* # of chars for each sec */
|
||
|
#define SLEN 160 /* # of chars in short fortune */
|
||
|
|
||
|
#define POS_UNKNOWN ((int32_t) -1) /* pos for file unknown */
|
||
|
#define NO_PROB (-1) /* no prob specified for file */
|
||
|
|
||
|
#ifdef DEBUG
|
||
|
#define DPRINTF(l,x) if (Debug >= l) fprintf x; else
|
||
|
#undef NDEBUG
|
||
|
#else
|
||
|
#define DPRINTF(l,x)
|
||
|
#define NDEBUG 1
|
||
|
#endif
|
||
|
|
||
|
typedef struct fd {
|
||
|
int percent;
|
||
|
int fd, datfd;
|
||
|
int32_t pos;
|
||
|
FILE *inf;
|
||
|
char *name;
|
||
|
char *path;
|
||
|
char *datfile, *posfile;
|
||
|
bool read_tbl;
|
||
|
bool was_pos_file;
|
||
|
STRFILE tbl;
|
||
|
int num_children;
|
||
|
struct fd *child, *parent;
|
||
|
struct fd *next, *prev;
|
||
|
} FILEDESC;
|
||
|
|
||
|
bool Found_one; /* did we find a match? */
|
||
|
bool Find_files = 0; /* just find a list of proper fortune files */
|
||
|
bool Wait = 0; /* wait desired after fortune */
|
||
|
bool Short_only = 0; /* short fortune desired */
|
||
|
bool Long_only = 0; /* long fortune desired */
|
||
|
bool Offend = 0; /* offensive fortunes only */
|
||
|
bool All_forts = 0; /* any fortune allowed */
|
||
|
bool Equal_probs = 0; /* scatter un-allocted prob equally */
|
||
|
bool Match = 0; /* dump fortunes matching a pattern */
|
||
|
#ifdef DEBUG
|
||
|
int Debug = 0; /* print debug messages */
|
||
|
#endif
|
||
|
|
||
|
char *Fortbuf = NULL; /* fortune buffer for -m */
|
||
|
|
||
|
size_t Fort_len = 0;
|
||
|
|
||
|
int32_t Seekpts[2]; /* seek pointers to fortunes */
|
||
|
|
||
|
FILEDESC *File_list = NULL, /* Head of file list */
|
||
|
*File_tail = NULL; /* Tail of file list */
|
||
|
FILEDESC *Fortfile; /* Fortune file to use */
|
||
|
|
||
|
STRFILE Noprob_tbl; /* sum of data for all no prob files */
|
||
|
|
||
|
int add_dir(FILEDESC *);
|
||
|
int add_file(int,
|
||
|
char *, char *, FILEDESC **, FILEDESC **, FILEDESC *);
|
||
|
void all_forts(FILEDESC *, char *);
|
||
|
char *copy(char *, char *);
|
||
|
void display(FILEDESC *);
|
||
|
void do_free(void *);
|
||
|
void *do_malloc(size_t);
|
||
|
int form_file_list(char **, int);
|
||
|
int fortlen(void);
|
||
|
void get_fort(void);
|
||
|
void get_pos(FILEDESC *);
|
||
|
void get_tbl(FILEDESC *);
|
||
|
void getargs(int, char *[]);
|
||
|
void init_prob(void);
|
||
|
int is_dir(char *);
|
||
|
int is_fortfile(char *, char **, char **, int);
|
||
|
int is_off_name(char *);
|
||
|
int max(int, int);
|
||
|
FILEDESC *
|
||
|
new_fp(void);
|
||
|
char *off_name(char *);
|
||
|
void open_dat(FILEDESC *);
|
||
|
void open_fp(FILEDESC *);
|
||
|
FILEDESC *
|
||
|
pick_child(FILEDESC *);
|
||
|
void print_file_list(void);
|
||
|
void print_list(FILEDESC *, int);
|
||
|
void sum_noprobs(FILEDESC *);
|
||
|
void sum_tbl(STRFILE *, STRFILE *);
|
||
|
void usage(void);
|
||
|
void zero_tbl(STRFILE *);
|
||
|
|
||
|
char *conv_pat(char *);
|
||
|
int find_matches(void);
|
||
|
void matches_in_list(FILEDESC *);
|
||
|
int maxlen_in_list(FILEDESC *);
|
||
|
int minlen_in_list(FILEDESC *);
|
||
|
regex_t regex;
|
||
|
|
||
|
int
|
||
|
main(int ac, char *av[])
|
||
|
{
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
int fd;
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
|
||
|
getargs(ac, av);
|
||
|
|
||
|
if (Match)
|
||
|
exit(find_matches() != 0);
|
||
|
|
||
|
init_prob();
|
||
|
if (Short_only && minlen_in_list(File_list) > SLEN ||
|
||
|
Long_only && maxlen_in_list(File_list) <= SLEN)
|
||
|
exit(0);
|
||
|
|
||
|
do {
|
||
|
get_fort();
|
||
|
} while ((Short_only && fortlen() > SLEN) ||
|
||
|
(Long_only && fortlen() <= SLEN));
|
||
|
|
||
|
display(Fortfile);
|
||
|
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
if ((fd = creat(Fortfile->posfile, 0666)) < 0) {
|
||
|
perror(Fortfile->posfile);
|
||
|
exit(1);
|
||
|
}
|
||
|
/*
|
||
|
* if we can, we exclusive lock, but since it isn't very
|
||
|
* important, we just punt if we don't have easy locking
|
||
|
* available.
|
||
|
*/
|
||
|
(void) flock(fd, LOCK_EX);
|
||
|
Fortfile->pos = htonl(Fortfile->pos);
|
||
|
write(fd, (char *) &Fortfile->pos, sizeof Fortfile->pos);
|
||
|
Fortfile->pos = ntohl(Fortfile->pos);
|
||
|
if (!Fortfile->was_pos_file)
|
||
|
(void) chmod(Fortfile->path, 0666);
|
||
|
(void) flock(fd, LOCK_UN);
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
if (Wait) {
|
||
|
if (Fort_len == 0)
|
||
|
(void) fortlen();
|
||
|
sleep((unsigned int) max(Fort_len / CPERS, MINW));
|
||
|
}
|
||
|
exit(0);
|
||
|
}
|
||
|
|
||
|
void
|
||
|
rot13(char *p, size_t len)
|
||
|
{
|
||
|
while (len--) {
|
||
|
unsigned char ch = *p;
|
||
|
if (isupper(ch))
|
||
|
*p = 'A' + (ch - 'A' + 13) % 26;
|
||
|
else if (islower(ch))
|
||
|
*p = 'a' + (ch - 'a' + 13) % 26;
|
||
|
p++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void
|
||
|
display(FILEDESC *fp)
|
||
|
{
|
||
|
char *p, ch;
|
||
|
char line[BUFSIZ];
|
||
|
|
||
|
open_fp(fp);
|
||
|
(void) fseek(fp->inf, (long)Seekpts[0], SEEK_SET);
|
||
|
for (Fort_len = 0; fgets(line, sizeof line, fp->inf) != NULL &&
|
||
|
!STR_ENDSTRING(line, fp->tbl); Fort_len++) {
|
||
|
if (fp->tbl.str_flags & STR_ROTATED)
|
||
|
rot13(line, strlen(line));
|
||
|
fputs(line, stdout);
|
||
|
}
|
||
|
(void) fflush(stdout);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* fortlen:
|
||
|
* Return the length of the fortune.
|
||
|
*/
|
||
|
int
|
||
|
fortlen(void)
|
||
|
{
|
||
|
size_t nchar;
|
||
|
char line[BUFSIZ];
|
||
|
|
||
|
if (!(Fortfile->tbl.str_flags & (STR_RANDOM | STR_ORDERED)))
|
||
|
nchar = (Seekpts[1] - Seekpts[0] <= SLEN);
|
||
|
else {
|
||
|
open_fp(Fortfile);
|
||
|
(void) fseek(Fortfile->inf, (long)Seekpts[0], SEEK_SET);
|
||
|
nchar = 0;
|
||
|
while (fgets(line, sizeof line, Fortfile->inf) != NULL &&
|
||
|
!STR_ENDSTRING(line, Fortfile->tbl))
|
||
|
nchar += strlen(line);
|
||
|
}
|
||
|
Fort_len = nchar;
|
||
|
return nchar;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* This routine evaluates the arguments on the command line
|
||
|
*/
|
||
|
void
|
||
|
getargs(int argc, char *argv[])
|
||
|
{
|
||
|
int ignore_case;
|
||
|
char *pat = NULL;
|
||
|
int ch;
|
||
|
|
||
|
ignore_case = 0;
|
||
|
|
||
|
#ifdef DEBUG
|
||
|
while ((ch = getopt(argc, argv, "aDefilm:osw")) != -1)
|
||
|
#else
|
||
|
while ((ch = getopt(argc, argv, "aefilm:osw")) != -1)
|
||
|
#endif /* DEBUG */
|
||
|
switch(ch) {
|
||
|
case 'a': /* any fortune */
|
||
|
All_forts = 1;
|
||
|
break;
|
||
|
#ifdef DEBUG
|
||
|
case 'D':
|
||
|
Debug++;
|
||
|
break;
|
||
|
#endif /* DEBUG */
|
||
|
case 'e':
|
||
|
Equal_probs = 1; /* scatter un-allocted prob equally */
|
||
|
break;
|
||
|
case 'f': /* find fortune files */
|
||
|
Find_files = 1;
|
||
|
break;
|
||
|
case 'l': /* long ones only */
|
||
|
Long_only = 1;
|
||
|
Short_only = 0;
|
||
|
break;
|
||
|
case 'o': /* offensive ones only */
|
||
|
Offend = 1;
|
||
|
break;
|
||
|
case 's': /* short ones only */
|
||
|
Short_only = 1;
|
||
|
Long_only = 0;
|
||
|
break;
|
||
|
case 'w': /* give time to read */
|
||
|
Wait = 1;
|
||
|
break;
|
||
|
case 'm': /* dump out the fortunes */
|
||
|
Match = 1;
|
||
|
pat = optarg;
|
||
|
break;
|
||
|
case 'i': /* case-insensitive match */
|
||
|
ignore_case = 1;
|
||
|
break;
|
||
|
case '?':
|
||
|
default:
|
||
|
usage();
|
||
|
}
|
||
|
argc -= optind;
|
||
|
argv += optind;
|
||
|
|
||
|
if (!form_file_list(argv, argc))
|
||
|
exit(1); /* errors printed through form_file_list() */
|
||
|
#ifdef DEBUG
|
||
|
if (Debug >= 1)
|
||
|
print_file_list();
|
||
|
#endif /* DEBUG */
|
||
|
if (Find_files) {
|
||
|
print_file_list();
|
||
|
exit(0);
|
||
|
}
|
||
|
|
||
|
if (pat != NULL) {
|
||
|
if (regcomp(®ex, pat, ignore_case ? REG_ICASE : 0))
|
||
|
fprintf(stderr, "bad pattern: %s\n", pat);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* form_file_list:
|
||
|
* Form the file list from the file specifications.
|
||
|
*/
|
||
|
int
|
||
|
form_file_list(char **files, int file_cnt)
|
||
|
{
|
||
|
int i, percent;
|
||
|
char *sp;
|
||
|
|
||
|
if (file_cnt == 0)
|
||
|
if (Find_files)
|
||
|
return add_file(NO_PROB, FORTDIR, NULL, &File_list,
|
||
|
&File_tail, NULL);
|
||
|
else
|
||
|
return add_file(NO_PROB, "fortunes", FORTDIR,
|
||
|
&File_list, &File_tail, NULL);
|
||
|
for (i = 0; i < file_cnt; i++) {
|
||
|
percent = NO_PROB;
|
||
|
if (!isdigit(files[i][0]))
|
||
|
sp = files[i];
|
||
|
else {
|
||
|
percent = 0;
|
||
|
for (sp = files[i]; isdigit(*sp); sp++)
|
||
|
percent = percent * 10 + *sp - '0';
|
||
|
if (percent > 100) {
|
||
|
fprintf(stderr, "percentages must be <= 100\n");
|
||
|
return 0;
|
||
|
}
|
||
|
if (*sp == '.') {
|
||
|
fprintf(stderr, "percentages must be integers\n");
|
||
|
return 0;
|
||
|
}
|
||
|
/*
|
||
|
* If the number isn't followed by a '%', then
|
||
|
* it was not a percentage, just the first part
|
||
|
* of a file name which starts with digits.
|
||
|
*/
|
||
|
if (*sp != '%') {
|
||
|
percent = NO_PROB;
|
||
|
sp = files[i];
|
||
|
}
|
||
|
else if (*++sp == '\0') {
|
||
|
if (++i >= file_cnt) {
|
||
|
fprintf(stderr, "percentages must precede files\n");
|
||
|
return 0;
|
||
|
}
|
||
|
sp = files[i];
|
||
|
}
|
||
|
}
|
||
|
if (strcmp(sp, "all") == 0)
|
||
|
sp = FORTDIR;
|
||
|
if (!add_file(percent, sp, NULL, &File_list, &File_tail, NULL))
|
||
|
return 0;
|
||
|
}
|
||
|
return 1;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* add_file:
|
||
|
* Add a file to the file list.
|
||
|
*/
|
||
|
int
|
||
|
add_file(int percent, char *file, char *dir, FILEDESC **head, FILEDESC **tail,
|
||
|
FILEDESC *parent)
|
||
|
{
|
||
|
FILEDESC *fp;
|
||
|
int fd;
|
||
|
char *path, *offensive;
|
||
|
bool was_malloc;
|
||
|
bool isdir;
|
||
|
|
||
|
if (dir == NULL) {
|
||
|
path = file;
|
||
|
was_malloc = 0;
|
||
|
} else {
|
||
|
size_t len;
|
||
|
|
||
|
len = strlen(dir) + strlen(file) + 2;
|
||
|
path = do_malloc(len);
|
||
|
snprintf(path, len, "%s/%s", dir, file);
|
||
|
was_malloc = 1;
|
||
|
}
|
||
|
if ((isdir = is_dir(path)) && parent != NULL) {
|
||
|
if (was_malloc)
|
||
|
free(path);
|
||
|
return 0; /* don't recurse */
|
||
|
}
|
||
|
offensive = NULL;
|
||
|
if (!isdir && parent == NULL && (All_forts || Offend) &&
|
||
|
!is_off_name(path)) {
|
||
|
offensive = off_name(path);
|
||
|
if (Offend) {
|
||
|
if (was_malloc)
|
||
|
free(path);
|
||
|
path = offensive;
|
||
|
file = off_name(file);
|
||
|
was_malloc = 1;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
DPRINTF(1, (stderr, "adding file \"%s\"\n", path));
|
||
|
over:
|
||
|
if ((fd = open(path, 0)) < 0) {
|
||
|
/*
|
||
|
* This is a sneak. If the user said -a, and if the
|
||
|
* file we're given isn't a file, we check to see if
|
||
|
* there is a -o version. If there is, we treat it as
|
||
|
* if *that* were the file given. We only do this for
|
||
|
* individual files -- if we're scanning a directory,
|
||
|
* we'll pick up the -o file anyway.
|
||
|
*/
|
||
|
if (All_forts && offensive != NULL) {
|
||
|
path = offensive;
|
||
|
if (was_malloc)
|
||
|
free(path);
|
||
|
offensive = NULL;
|
||
|
was_malloc = 1;
|
||
|
DPRINTF(1, (stderr, "\ttrying \"%s\"\n", path));
|
||
|
file = off_name(file);
|
||
|
goto over;
|
||
|
}
|
||
|
if (dir == NULL && file[0] != '/')
|
||
|
return add_file(percent, file, FORTDIR, head, tail,
|
||
|
parent);
|
||
|
if (parent == NULL)
|
||
|
perror(path);
|
||
|
if (was_malloc)
|
||
|
free(path);
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
DPRINTF(2, (stderr, "path = \"%s\"\n", path));
|
||
|
|
||
|
fp = new_fp();
|
||
|
fp->fd = fd;
|
||
|
fp->percent = percent;
|
||
|
fp->name = file;
|
||
|
fp->path = path;
|
||
|
fp->parent = parent;
|
||
|
|
||
|
if ((isdir && !add_dir(fp)) ||
|
||
|
(!isdir &&
|
||
|
!is_fortfile(path, &fp->datfile, &fp->posfile, (parent != NULL))))
|
||
|
{
|
||
|
if (parent == NULL)
|
||
|
fprintf(stderr,
|
||
|
"fortune: %s not a fortune file or directory\n",
|
||
|
path);
|
||
|
if (was_malloc)
|
||
|
free(path);
|
||
|
do_free(fp->datfile);
|
||
|
do_free(fp->posfile);
|
||
|
free((char *) fp);
|
||
|
do_free(offensive);
|
||
|
return 0;
|
||
|
}
|
||
|
/*
|
||
|
* If the user said -a, we need to make this node a pointer to
|
||
|
* both files, if there are two. We don't need to do this if
|
||
|
* we are scanning a directory, since the scan will pick up the
|
||
|
* -o file anyway.
|
||
|
*/
|
||
|
if (All_forts && parent == NULL && !is_off_name(path))
|
||
|
all_forts(fp, offensive);
|
||
|
if (*head == NULL)
|
||
|
*head = *tail = fp;
|
||
|
else if (fp->percent == NO_PROB) {
|
||
|
(*tail)->next = fp;
|
||
|
fp->prev = *tail;
|
||
|
*tail = fp;
|
||
|
}
|
||
|
else {
|
||
|
(*head)->prev = fp;
|
||
|
fp->next = *head;
|
||
|
*head = fp;
|
||
|
}
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
fp->was_pos_file = (access(fp->posfile, W_OK) >= 0);
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
|
||
|
return 1;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* new_fp:
|
||
|
* Return a pointer to an initialized new FILEDESC.
|
||
|
*/
|
||
|
FILEDESC *
|
||
|
new_fp(void)
|
||
|
{
|
||
|
FILEDESC *fp;
|
||
|
|
||
|
fp = do_malloc(sizeof *fp);
|
||
|
fp->datfd = -1;
|
||
|
fp->pos = POS_UNKNOWN;
|
||
|
fp->inf = NULL;
|
||
|
fp->fd = -1;
|
||
|
fp->percent = NO_PROB;
|
||
|
fp->read_tbl = 0;
|
||
|
fp->next = NULL;
|
||
|
fp->prev = NULL;
|
||
|
fp->child = NULL;
|
||
|
fp->parent = NULL;
|
||
|
fp->datfile = NULL;
|
||
|
fp->posfile = NULL;
|
||
|
return fp;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* off_name:
|
||
|
* Return a pointer to the offensive version of a file of this name.
|
||
|
*/
|
||
|
char *
|
||
|
off_name(char *file)
|
||
|
{
|
||
|
return (copy(file, "-o"));
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* is_off_name:
|
||
|
* Is the file an offensive-style name?
|
||
|
*/
|
||
|
int
|
||
|
is_off_name(char *file)
|
||
|
{
|
||
|
int len;
|
||
|
|
||
|
len = strlen(file);
|
||
|
return (len >= 3 && file[len - 2] == '-' && file[len - 1] == 'o');
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* all_forts:
|
||
|
* Modify a FILEDESC element to be the parent of two children if
|
||
|
* there are two children to be a parent of.
|
||
|
*/
|
||
|
void
|
||
|
all_forts(FILEDESC *fp, char *offensive)
|
||
|
{
|
||
|
char *sp;
|
||
|
FILEDESC *scene, *obscene;
|
||
|
int fd;
|
||
|
char *datfile, *posfile;
|
||
|
|
||
|
if (fp->child != NULL) /* this is a directory, not a file */
|
||
|
return;
|
||
|
if (!is_fortfile(offensive, &datfile, &posfile, 0))
|
||
|
return;
|
||
|
if ((fd = open(offensive, 0)) < 0)
|
||
|
return;
|
||
|
DPRINTF(1, (stderr, "adding \"%s\" because of -a\n", offensive));
|
||
|
scene = new_fp();
|
||
|
obscene = new_fp();
|
||
|
*scene = *fp;
|
||
|
|
||
|
fp->num_children = 2;
|
||
|
fp->child = scene;
|
||
|
scene->next = obscene;
|
||
|
obscene->next = NULL;
|
||
|
scene->child = obscene->child = NULL;
|
||
|
scene->parent = obscene->parent = fp;
|
||
|
|
||
|
fp->fd = -1;
|
||
|
scene->percent = obscene->percent = NO_PROB;
|
||
|
|
||
|
obscene->fd = fd;
|
||
|
obscene->inf = NULL;
|
||
|
obscene->path = offensive;
|
||
|
if ((sp = strrchr(offensive, '/')) == NULL)
|
||
|
obscene->name = offensive;
|
||
|
else
|
||
|
obscene->name = ++sp;
|
||
|
obscene->datfile = datfile;
|
||
|
obscene->posfile = posfile;
|
||
|
obscene->read_tbl = 0;
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
obscene->was_pos_file = (access(obscene->posfile, W_OK) >= 0);
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* add_dir:
|
||
|
* Add the contents of an entire directory.
|
||
|
*/
|
||
|
int
|
||
|
add_dir(FILEDESC *fp)
|
||
|
{
|
||
|
DIR *dir;
|
||
|
struct dirent *dirent;
|
||
|
FILEDESC *tailp;
|
||
|
char *name;
|
||
|
|
||
|
(void) close(fp->fd);
|
||
|
fp->fd = -1;
|
||
|
if ((dir = opendir(fp->path)) == NULL) {
|
||
|
perror(fp->path);
|
||
|
return 0;
|
||
|
}
|
||
|
tailp = NULL;
|
||
|
DPRINTF(1, (stderr, "adding dir \"%s\"\n", fp->path));
|
||
|
fp->num_children = 0;
|
||
|
while ((dirent = readdir(dir)) != NULL) {
|
||
|
if (strlen(dirent->d_name) == 0)
|
||
|
continue;
|
||
|
name = copy(dirent->d_name, NULL);
|
||
|
if (add_file(NO_PROB, name, fp->path, &fp->child, &tailp, fp))
|
||
|
fp->num_children++;
|
||
|
else
|
||
|
free(name);
|
||
|
}
|
||
|
if (fp->num_children == 0) {
|
||
|
(void) fprintf(stderr,
|
||
|
"fortune: %s: No fortune files in directory.\n", fp->path);
|
||
|
closedir(dir);
|
||
|
return 0;
|
||
|
}
|
||
|
closedir(dir);
|
||
|
return 1;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* is_dir:
|
||
|
* Return 1 if the file is a directory, 0 otherwise.
|
||
|
*/
|
||
|
int
|
||
|
is_dir(char *file)
|
||
|
{
|
||
|
struct stat sbuf;
|
||
|
|
||
|
if (stat(file, &sbuf) < 0)
|
||
|
return 0;
|
||
|
return S_ISDIR(sbuf.st_mode);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* is_fortfile:
|
||
|
* Return 1 if the file is a fortune database file. We try and
|
||
|
* exclude files without reading them if possible to avoid
|
||
|
* overhead. Files which start with ".", or which have "illegal"
|
||
|
* suffixes, as contained in suflist[], are ruled out.
|
||
|
*/
|
||
|
/* ARGSUSED */
|
||
|
int
|
||
|
is_fortfile(char *file, char **datp, char **posp, int check_for_offend)
|
||
|
{
|
||
|
int i;
|
||
|
char *sp;
|
||
|
char *datfile;
|
||
|
static char *suflist[] = { /* list of "illegal" suffixes" */
|
||
|
"dat", "pos", "c", "h", "p", "i", "f",
|
||
|
"pas", "ftn", "ins.c", "ins,pas",
|
||
|
"ins.ftn", "sml",
|
||
|
NULL
|
||
|
};
|
||
|
|
||
|
DPRINTF(2, (stderr, "is_fortfile(%s) returns ", file));
|
||
|
|
||
|
/*
|
||
|
* Preclude any -o files for offendable people, and any non -o
|
||
|
* files for completely offensive people.
|
||
|
*/
|
||
|
if (check_for_offend && !All_forts) {
|
||
|
i = strlen(file);
|
||
|
if (Offend ^ (file[i - 2] == '-' && file[i - 1] == 'o'))
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
if ((sp = strrchr(file, '/')) == NULL)
|
||
|
sp = file;
|
||
|
else
|
||
|
sp++;
|
||
|
if (*sp == '.') {
|
||
|
DPRINTF(2, (stderr, "0 (file starts with '.')\n"));
|
||
|
return 0;
|
||
|
}
|
||
|
if ((sp = strrchr(sp, '.')) != NULL) {
|
||
|
sp++;
|
||
|
for (i = 0; suflist[i] != NULL; i++)
|
||
|
if (strcmp(sp, suflist[i]) == 0) {
|
||
|
DPRINTF(2, (stderr, "0 (file has suffix \".%s\")\n", sp));
|
||
|
return 0;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
datfile = copy(file, ".dat");
|
||
|
if (access(datfile, R_OK) < 0) {
|
||
|
free(datfile);
|
||
|
DPRINTF(2, (stderr, "0 (no \".dat\" file)\n"));
|
||
|
return 0;
|
||
|
}
|
||
|
if (datp != NULL)
|
||
|
*datp = datfile;
|
||
|
else
|
||
|
free(datfile);
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
if (posp != NULL)
|
||
|
*posp = copy(file, ".pos");
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
DPRINTF(2, (stderr, "1\n"));
|
||
|
return 1;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* copy:
|
||
|
* Return a malloc()'ed copy of the string + an optional suffix
|
||
|
*/
|
||
|
char *
|
||
|
copy(char *str, char *suf)
|
||
|
{
|
||
|
char *new;
|
||
|
|
||
|
if (asprintf(&new, "%s%s", str, suf ? suf : "") == -1)
|
||
|
return NULL;
|
||
|
return new;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* do_malloc:
|
||
|
* Do a malloc, checking for NULL return.
|
||
|
*/
|
||
|
void *
|
||
|
do_malloc(size_t size)
|
||
|
{
|
||
|
void *new;
|
||
|
|
||
|
if ((new = malloc(size)) == NULL) {
|
||
|
(void) fprintf(stderr, "fortune: out of memory.\n");
|
||
|
exit(1);
|
||
|
}
|
||
|
return new;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* do_free:
|
||
|
* Free malloc'ed space, if any.
|
||
|
*/
|
||
|
void
|
||
|
do_free(void *ptr)
|
||
|
{
|
||
|
if (ptr != NULL)
|
||
|
free(ptr);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* init_prob:
|
||
|
* Initialize the fortune probabilities.
|
||
|
*/
|
||
|
void
|
||
|
init_prob(void)
|
||
|
{
|
||
|
FILEDESC *fp, *last;
|
||
|
int percent, num_noprob, frac;
|
||
|
|
||
|
/*
|
||
|
* Distribute the residual probability (if any) across all
|
||
|
* files with unspecified probability (i.e., probability of 0)
|
||
|
* (if any).
|
||
|
*/
|
||
|
|
||
|
percent = 0;
|
||
|
num_noprob = 0;
|
||
|
for (fp = File_tail; fp != NULL; fp = fp->prev)
|
||
|
if (fp->percent == NO_PROB) {
|
||
|
num_noprob++;
|
||
|
if (Equal_probs)
|
||
|
last = fp;
|
||
|
}
|
||
|
else
|
||
|
percent += fp->percent;
|
||
|
DPRINTF(1, (stderr, "summing probabilities:%d%% with %d NO_PROB's",
|
||
|
percent, num_noprob));
|
||
|
if (percent > 100) {
|
||
|
(void) fprintf(stderr,
|
||
|
"fortune: probabilities sum to %d%%!\n", percent);
|
||
|
exit(1);
|
||
|
}
|
||
|
else if (percent < 100 && num_noprob == 0) {
|
||
|
(void) fprintf(stderr,
|
||
|
"fortune: no place to put residual probability (%d%%)\n",
|
||
|
percent);
|
||
|
exit(1);
|
||
|
}
|
||
|
else if (percent == 100 && num_noprob != 0) {
|
||
|
(void) fprintf(stderr,
|
||
|
"fortune: no probability left to put in residual files\n");
|
||
|
exit(1);
|
||
|
}
|
||
|
percent = 100 - percent;
|
||
|
if (Equal_probs)
|
||
|
if (num_noprob != 0) {
|
||
|
if (num_noprob > 1) {
|
||
|
frac = percent / num_noprob;
|
||
|
DPRINTF(1, (stderr, ", frac = %d%%", frac));
|
||
|
for (fp = File_list; fp != last; fp = fp->next)
|
||
|
if (fp->percent == NO_PROB) {
|
||
|
fp->percent = frac;
|
||
|
percent -= frac;
|
||
|
}
|
||
|
}
|
||
|
last->percent = percent;
|
||
|
DPRINTF(1, (stderr, ", residual = %d%%", percent));
|
||
|
}
|
||
|
else {
|
||
|
DPRINTF(1, (stderr,
|
||
|
", %d%% distributed over remaining fortunes\n",
|
||
|
percent));
|
||
|
}
|
||
|
DPRINTF(1, (stderr, "\n"));
|
||
|
|
||
|
#ifdef DEBUG
|
||
|
if (Debug >= 1)
|
||
|
print_file_list();
|
||
|
#endif
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* get_fort:
|
||
|
* Get the fortune data file's seek pointer for the next fortune.
|
||
|
*/
|
||
|
void
|
||
|
get_fort(void)
|
||
|
{
|
||
|
FILEDESC *fp;
|
||
|
int choice;
|
||
|
|
||
|
if (File_list->next == NULL || File_list->percent == NO_PROB)
|
||
|
fp = File_list;
|
||
|
else {
|
||
|
choice = arc4random_uniform(100);
|
||
|
DPRINTF(1, (stderr, "choice = %d\n", choice));
|
||
|
for (fp = File_list; fp->percent != NO_PROB; fp = fp->next)
|
||
|
if (choice < fp->percent)
|
||
|
break;
|
||
|
else {
|
||
|
choice -= fp->percent;
|
||
|
DPRINTF(1, (stderr,
|
||
|
" skip \"%s\", %d%% (choice = %d)\n",
|
||
|
fp->name, fp->percent, choice));
|
||
|
}
|
||
|
DPRINTF(1, (stderr,
|
||
|
"using \"%s\", %d%% (choice = %d)\n",
|
||
|
fp->name, fp->percent, choice));
|
||
|
}
|
||
|
if (fp->percent != NO_PROB)
|
||
|
get_tbl(fp);
|
||
|
else {
|
||
|
if (fp->next != NULL) {
|
||
|
sum_noprobs(fp);
|
||
|
choice = arc4random_uniform(Noprob_tbl.str_numstr);
|
||
|
DPRINTF(1, (stderr, "choice = %d (of %d) \n", choice,
|
||
|
Noprob_tbl.str_numstr));
|
||
|
while (choice >= fp->tbl.str_numstr) {
|
||
|
choice -= fp->tbl.str_numstr;
|
||
|
fp = fp->next;
|
||
|
DPRINTF(1, (stderr,
|
||
|
" skip \"%s\", %d (choice = %d)\n",
|
||
|
fp->name, fp->tbl.str_numstr,
|
||
|
choice));
|
||
|
}
|
||
|
DPRINTF(1, (stderr, "using \"%s\", %d\n", fp->name,
|
||
|
fp->tbl.str_numstr));
|
||
|
}
|
||
|
get_tbl(fp);
|
||
|
}
|
||
|
if (fp->child != NULL) {
|
||
|
DPRINTF(1, (stderr, "picking child\n"));
|
||
|
fp = pick_child(fp);
|
||
|
}
|
||
|
Fortfile = fp;
|
||
|
get_pos(fp);
|
||
|
open_dat(fp);
|
||
|
(void) lseek(fp->datfd,
|
||
|
(off_t) (sizeof fp->tbl + fp->pos * sizeof Seekpts[0]), 0);
|
||
|
read(fp->datfd, &Seekpts[0], sizeof Seekpts[0]);
|
||
|
Seekpts[0] = ntohl(Seekpts[0]);
|
||
|
read(fp->datfd, &Seekpts[1], sizeof Seekpts[1]);
|
||
|
Seekpts[1] = ntohl(Seekpts[1]);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* pick_child
|
||
|
* Pick a child from a chosen parent.
|
||
|
*/
|
||
|
FILEDESC *
|
||
|
pick_child(FILEDESC *parent)
|
||
|
{
|
||
|
FILEDESC *fp;
|
||
|
int choice;
|
||
|
|
||
|
if (Equal_probs) {
|
||
|
choice = arc4random_uniform(parent->num_children);
|
||
|
DPRINTF(1, (stderr, " choice = %d (of %d)\n",
|
||
|
choice, parent->num_children));
|
||
|
for (fp = parent->child; choice--; fp = fp->next)
|
||
|
continue;
|
||
|
DPRINTF(1, (stderr, " using %s\n", fp->name));
|
||
|
return fp;
|
||
|
}
|
||
|
else {
|
||
|
get_tbl(parent);
|
||
|
choice = arc4random_uniform(parent->tbl.str_numstr);
|
||
|
DPRINTF(1, (stderr, " choice = %d (of %d)\n",
|
||
|
choice, parent->tbl.str_numstr));
|
||
|
for (fp = parent->child; choice >= fp->tbl.str_numstr;
|
||
|
fp = fp->next) {
|
||
|
choice -= fp->tbl.str_numstr;
|
||
|
DPRINTF(1, (stderr, "\tskip %s, %d (choice = %d)\n",
|
||
|
fp->name, fp->tbl.str_numstr, choice));
|
||
|
}
|
||
|
DPRINTF(1, (stderr, " using %s, %d\n", fp->name,
|
||
|
fp->tbl.str_numstr));
|
||
|
return fp;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* sum_noprobs:
|
||
|
* Sum up all the noprob probabilities, starting with fp.
|
||
|
*/
|
||
|
void
|
||
|
sum_noprobs(FILEDESC *fp)
|
||
|
{
|
||
|
static bool did_noprobs = 0;
|
||
|
|
||
|
if (did_noprobs)
|
||
|
return;
|
||
|
zero_tbl(&Noprob_tbl);
|
||
|
while (fp != NULL) {
|
||
|
get_tbl(fp);
|
||
|
sum_tbl(&Noprob_tbl, &fp->tbl);
|
||
|
fp = fp->next;
|
||
|
}
|
||
|
did_noprobs = 1;
|
||
|
}
|
||
|
|
||
|
int
|
||
|
max(int i, int j)
|
||
|
{
|
||
|
return (i >= j ? i : j);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* open_fp:
|
||
|
* Assocatiate a FILE * with the given FILEDESC.
|
||
|
*/
|
||
|
void
|
||
|
open_fp(FILEDESC *fp)
|
||
|
{
|
||
|
if (fp->inf == NULL && (fp->inf = fdopen(fp->fd, "r")) == NULL) {
|
||
|
perror(fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* open_dat:
|
||
|
* Open up the dat file if we need to.
|
||
|
*/
|
||
|
void
|
||
|
open_dat(FILEDESC *fp)
|
||
|
{
|
||
|
if (fp->datfd < 0 && (fp->datfd = open(fp->datfile, 0)) < 0) {
|
||
|
perror(fp->datfile);
|
||
|
exit(1);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* get_pos:
|
||
|
* Get the position from the pos file, if there is one. If not,
|
||
|
* return a random number.
|
||
|
*/
|
||
|
void
|
||
|
get_pos(FILEDESC *fp)
|
||
|
{
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
int fd;
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
|
||
|
assert(fp->read_tbl);
|
||
|
if (fp->pos == POS_UNKNOWN) {
|
||
|
#ifdef OK_TO_WRITE_DISK
|
||
|
if ((fd = open(fp->posfile, 0)) < 0 ||
|
||
|
read(fd, &fp->pos, sizeof fp->pos) != sizeof fp->pos)
|
||
|
fp->pos = arc4random_uniform(fp->tbl.str_numstr);
|
||
|
else if (ntohl(fp->pos) >= fp->tbl.str_numstr)
|
||
|
fp->pos %= fp->tbl.str_numstr;
|
||
|
else
|
||
|
fp->pos = ntohl(fp->pos);
|
||
|
if (fd >= 0)
|
||
|
(void) close(fd);
|
||
|
#else
|
||
|
fp->pos = arc4random_uniform(fp->tbl.str_numstr);
|
||
|
#endif /* OK_TO_WRITE_DISK */
|
||
|
}
|
||
|
if (++(fp->pos) >= fp->tbl.str_numstr)
|
||
|
fp->pos -= fp->tbl.str_numstr;
|
||
|
DPRINTF(1, (stderr, "pos for %s is %d\n", fp->name, fp->pos));
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* get_tbl:
|
||
|
* Get the tbl data file the datfile.
|
||
|
*/
|
||
|
void
|
||
|
get_tbl(FILEDESC *fp)
|
||
|
{
|
||
|
int fd;
|
||
|
FILEDESC *child;
|
||
|
|
||
|
if (fp->read_tbl)
|
||
|
return;
|
||
|
if (fp->child == NULL) {
|
||
|
if ((fd = open(fp->datfile, 0)) < 0) {
|
||
|
perror(fp->datfile);
|
||
|
exit(1);
|
||
|
}
|
||
|
if (read(fd, &fp->tbl.str_version, sizeof(fp->tbl.str_version)) !=
|
||
|
sizeof(fp->tbl.str_version)) {
|
||
|
(void)fprintf(stderr,
|
||
|
"fortune: %s corrupted\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
if (read(fd, &fp->tbl.str_numstr, sizeof(fp->tbl.str_numstr)) !=
|
||
|
sizeof(fp->tbl.str_numstr)) {
|
||
|
(void)fprintf(stderr,
|
||
|
"fortune: %s corrupted\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
if (read(fd, &fp->tbl.str_longlen, sizeof(fp->tbl.str_longlen)) !=
|
||
|
sizeof(fp->tbl.str_longlen)) {
|
||
|
(void)fprintf(stderr,
|
||
|
"fortune: %s corrupted\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
if (read(fd, &fp->tbl.str_shortlen, sizeof(fp->tbl.str_shortlen)) !=
|
||
|
sizeof(fp->tbl.str_shortlen)) {
|
||
|
(void)fprintf(stderr,
|
||
|
"fortune: %s corrupted\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
if (read(fd, &fp->tbl.str_flags, sizeof(fp->tbl.str_flags)) !=
|
||
|
sizeof(fp->tbl.str_flags)) {
|
||
|
(void)fprintf(stderr,
|
||
|
"fortune: %s corrupted\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
if (read(fd, fp->tbl.stuff, sizeof(fp->tbl.stuff)) !=
|
||
|
sizeof(fp->tbl.stuff)) {
|
||
|
(void)fprintf(stderr,
|
||
|
"fortune: %s corrupted\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
|
||
|
/* fp->tbl.str_version = ntohl(fp->tbl.str_version); */
|
||
|
fp->tbl.str_numstr = ntohl(fp->tbl.str_numstr);
|
||
|
fp->tbl.str_longlen = ntohl(fp->tbl.str_longlen);
|
||
|
fp->tbl.str_shortlen = ntohl(fp->tbl.str_shortlen);
|
||
|
fp->tbl.str_flags = ntohl(fp->tbl.str_flags);
|
||
|
(void) close(fd);
|
||
|
|
||
|
if (fp->tbl.str_numstr == 0) {
|
||
|
fprintf(stderr, "fortune: %s is empty\n", fp->path);
|
||
|
exit(1);
|
||
|
}
|
||
|
}
|
||
|
else {
|
||
|
zero_tbl(&fp->tbl);
|
||
|
for (child = fp->child; child != NULL; child = child->next) {
|
||
|
get_tbl(child);
|
||
|
sum_tbl(&fp->tbl, &child->tbl);
|
||
|
}
|
||
|
}
|
||
|
fp->read_tbl = 1;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* zero_tbl:
|
||
|
* Zero out the fields we care about in a tbl structure.
|
||
|
*/
|
||
|
void
|
||
|
zero_tbl(STRFILE *tp)
|
||
|
{
|
||
|
tp->str_numstr = 0;
|
||
|
tp->str_longlen = 0;
|
||
|
tp->str_shortlen = -1;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* sum_tbl:
|
||
|
* Merge the tbl data of t2 into t1.
|
||
|
*/
|
||
|
void
|
||
|
sum_tbl(STRFILE *t1, STRFILE *t2)
|
||
|
{
|
||
|
t1->str_numstr += t2->str_numstr;
|
||
|
if (t1->str_longlen < t2->str_longlen)
|
||
|
t1->str_longlen = t2->str_longlen;
|
||
|
if (t1->str_shortlen > t2->str_shortlen)
|
||
|
t1->str_shortlen = t2->str_shortlen;
|
||
|
}
|
||
|
|
||
|
#define STR(str) ((str) == NULL ? "NULL" : (str))
|
||
|
|
||
|
/*
|
||
|
* print_file_list:
|
||
|
* Print out the file list
|
||
|
*/
|
||
|
void
|
||
|
print_file_list(void)
|
||
|
{
|
||
|
print_list(File_list, 0);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* print_list:
|
||
|
* Print out the actual list, recursively.
|
||
|
*/
|
||
|
void
|
||
|
print_list(FILEDESC *list, int lev)
|
||
|
{
|
||
|
while (list != NULL) {
|
||
|
fprintf(stderr, "%*s", lev * 4, "");
|
||
|
if (list->percent == NO_PROB)
|
||
|
fprintf(stderr, "___%%");
|
||
|
else
|
||
|
fprintf(stderr, "%3d%%", list->percent);
|
||
|
fprintf(stderr, " %s", STR(list->name));
|
||
|
DPRINTF(1, (stderr, " (%s, %s, %s)\n", STR(list->path),
|
||
|
STR(list->datfile), STR(list->posfile)));
|
||
|
putc('\n', stderr);
|
||
|
if (list->child != NULL)
|
||
|
print_list(list->child, lev + 1);
|
||
|
list = list->next;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
|
||
|
/*
|
||
|
* find_matches:
|
||
|
* Find all the fortunes which match the pattern we've been given.
|
||
|
*/
|
||
|
int
|
||
|
find_matches(void)
|
||
|
{
|
||
|
Fort_len = maxlen_in_list(File_list);
|
||
|
DPRINTF(2, (stderr, "Maximum length is %zu\n", Fort_len));
|
||
|
/* extra length, "%\n" is appended */
|
||
|
Fortbuf = do_malloc(Fort_len + 10);
|
||
|
|
||
|
Found_one = 0;
|
||
|
matches_in_list(File_list);
|
||
|
return Found_one;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* maxlen_in_list
|
||
|
* Return the maximum fortune len in the file list.
|
||
|
*/
|
||
|
int
|
||
|
maxlen_in_list(FILEDESC *list)
|
||
|
{
|
||
|
FILEDESC *fp;
|
||
|
int len, maxlen;
|
||
|
|
||
|
maxlen = 0;
|
||
|
for (fp = list; fp != NULL; fp = fp->next) {
|
||
|
if (fp->child != NULL) {
|
||
|
if ((len = maxlen_in_list(fp->child)) > maxlen)
|
||
|
maxlen = len;
|
||
|
}
|
||
|
else {
|
||
|
get_tbl(fp);
|
||
|
if (fp->tbl.str_longlen > maxlen)
|
||
|
maxlen = fp->tbl.str_longlen;
|
||
|
}
|
||
|
}
|
||
|
return maxlen;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* minlen_in_list
|
||
|
* Return the minimum fortune len in the file list.
|
||
|
*/
|
||
|
int
|
||
|
minlen_in_list(FILEDESC *list)
|
||
|
{
|
||
|
FILEDESC *fp;
|
||
|
int len, minlen;
|
||
|
|
||
|
minlen = INT_MAX;
|
||
|
for (fp = list; fp != NULL; fp = fp->next) {
|
||
|
if (fp->child != NULL) {
|
||
|
if ((len = minlen_in_list(fp->child)) < minlen)
|
||
|
minlen = len;
|
||
|
} else {
|
||
|
get_tbl(fp);
|
||
|
if (fp->tbl.str_shortlen < minlen)
|
||
|
minlen = fp->tbl.str_shortlen;
|
||
|
}
|
||
|
}
|
||
|
return minlen;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* matches_in_list
|
||
|
* Print out the matches from the files in the list.
|
||
|
*/
|
||
|
void
|
||
|
matches_in_list(FILEDESC *list)
|
||
|
{
|
||
|
char *sp;
|
||
|
FILEDESC *fp;
|
||
|
int in_file;
|
||
|
|
||
|
for (fp = list; fp != NULL; fp = fp->next) {
|
||
|
if (fp->child != NULL) {
|
||
|
matches_in_list(fp->child);
|
||
|
continue;
|
||
|
}
|
||
|
DPRINTF(1, (stderr, "searching in %s\n", fp->path));
|
||
|
open_fp(fp);
|
||
|
sp = Fortbuf;
|
||
|
in_file = 0;
|
||
|
while (fgets(sp, Fort_len, fp->inf) != NULL)
|
||
|
if (!STR_ENDSTRING(sp, fp->tbl))
|
||
|
sp += strlen(sp);
|
||
|
else {
|
||
|
*sp = '\0';
|
||
|
if (fp->tbl.str_flags & STR_ROTATED)
|
||
|
rot13(Fortbuf, sp - Fortbuf);
|
||
|
if (regexec(®ex, Fortbuf, 0, NULL, 0) == 0) {
|
||
|
printf("%c%c", fp->tbl.str_delim,
|
||
|
fp->tbl.str_delim);
|
||
|
if (!in_file) {
|
||
|
printf(" (%s)", fp->name);
|
||
|
Found_one = 1;
|
||
|
in_file = 1;
|
||
|
}
|
||
|
putchar('\n');
|
||
|
(void) fwrite(Fortbuf, 1, (sp - Fortbuf), stdout);
|
||
|
}
|
||
|
sp = Fortbuf;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void
|
||
|
usage(void)
|
||
|
{
|
||
|
(void) fprintf(stderr, "usage: fortune [-ae");
|
||
|
#ifdef DEBUG
|
||
|
(void) fprintf(stderr, "D");
|
||
|
#endif /* DEBUG */
|
||
|
(void) fprintf(stderr, "f");
|
||
|
(void) fprintf(stderr, "i");
|
||
|
(void) fprintf(stderr, "losw]");
|
||
|
(void) fprintf(stderr, " [-m pattern]");
|
||
|
(void) fprintf(stderr, " [[N%%] file/directory/all]\n");
|
||
|
exit(1);
|
||
|
}
|