summaryrefslogtreecommitdiffstats
path: root/games/fortune/strfile
diff options
context:
space:
mode:
authorjkh <jkh@FreeBSD.org>1994-09-04 04:03:31 +0000
committerjkh <jkh@FreeBSD.org>1994-09-04 04:03:31 +0000
commit057afceb86e030ad65b0130436860d9a18066186 (patch)
treea0ced9c9b9278eb776d89cd2565c27ddcf020b51 /games/fortune/strfile
parenteedec95276cdb8aef98e92c5371000f10b8d6ba7 (diff)
downloadFreeBSD-src-057afceb86e030ad65b0130436860d9a18066186.zip
FreeBSD-src-057afceb86e030ad65b0130436860d9a18066186.tar.gz
Bring in the 4.4 Lite games directory, modulo man page changes and segregation
of the x11 based games. I'm not going to tag the originals with bsd_44_lite and do this in two stages since it's just not worth it for this collection, and I've got directory renames to deal with that way. Bleah. Submitted by: jkh
Diffstat (limited to 'games/fortune/strfile')
-rw-r--r--games/fortune/strfile/Makefile6
-rw-r--r--games/fortune/strfile/strfile.8146
-rw-r--r--games/fortune/strfile/strfile.c456
-rw-r--r--games/fortune/strfile/strfile.h54
4 files changed, 662 insertions, 0 deletions
diff --git a/games/fortune/strfile/Makefile b/games/fortune/strfile/Makefile
new file mode 100644
index 0000000..6c0a8d9
--- /dev/null
+++ b/games/fortune/strfile/Makefile
@@ -0,0 +1,6 @@
+# @(#)Makefile 8.1 (Berkeley) 5/31/93
+
+PROG= strfile
+NOMAN= noman
+
+.include <bsd.prog.mk>
diff --git a/games/fortune/strfile/strfile.8 b/games/fortune/strfile/strfile.8
new file mode 100644
index 0000000..443a18b
--- /dev/null
+++ b/games/fortune/strfile/strfile.8
@@ -0,0 +1,146 @@
+.\" Copyright (c) 1989, 1991, 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. All advertising materials mentioning features or use of this software
+.\" must display the following acknowledgement:
+.\" This product includes software developed by the University of
+.\" California, Berkeley and its contributors.
+.\" 4. 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.
+.\"
+.\" @(#)strfile.8 8.1 (Berkeley) 6/9/93
+.\"
+.Dd June 9, 1993
+.Dt STRFILE 8
+.Os BSD 4
+.Sh NAME
+.Nm strfile ,
+.Nm unstr
+.Nd "create a random access file for storing strings"
+.Sh SYNOPSIS
+.Nm strfile
+.Op Fl iorsx
+.Op Fl c Ar char
+.Ar source_file
+.Op Ar output_file
+.Nm unstr
+.Ar source_file
+.Sh DESCRIPTION
+.Nm Strfile
+reads a file containing groups of lines separated by a line containing
+a single percent
+.Ql \&%
+sign and creates a data file which contains
+a header structure and a table of file offsets for each group of lines.
+This allows random access of the strings.
+.Pp
+The output file, if not specified on the command line, is named
+.Ar source_file Ns Sy .out .
+.Pp
+The options are as follows:
+.Bl -tag -width "-c char"
+.It Fl c Ar char
+Change the delimiting character from the percent sign to
+.Ar char .
+.It Fl i
+Ignore case when ordering the strings.
+.It Fl o
+Order the strings in alphabetical order.
+The offset table will be sorted in the alphabetical order of the
+groups of lines referenced.
+Any initial non-alphanumeric characters are ignored.
+This option causes the
+.Dv STR_ORDERED
+bit in the header
+.Ar str_flags
+field to be set.
+.It Fl r
+Randomize access to the strings.
+Entries in the offset table will be randomly ordered.
+This option causes the
+.Dv STR_RANDOM
+bit in the header
+.Ar str_flags
+field to be set.
+.It Fl s
+Run silently; don't give a summary message when finished.
+.It Fl x
+Note that each alphabetic character in the groups of lines is rotated
+13 positions in a simple caesar cypher.
+This option causes the
+.Dv STR_ROTATED
+bit in the header
+.Ar str_flags
+field to be set.
+.El
+.Pp
+The format of the header is:
+.Bd -literal
+#define VERSION 1
+unsigned long str_version; /* version number */
+unsigned long str_numstr; /* # of strings in the file */
+unsigned long str_longlen; /* length of longest string */
+unsigned long str_shortlen; /* length of shortest string */
+#define STR_RANDOM 0x1 /* randomized pointers */
+#define STR_ORDERED 0x2 /* ordered pointers */
+#define STR_ROTATED 0x4 /* rot-13'd text */
+unsigned long str_flags; /* bit field for flags */
+char str_delim; /* delimiting character */
+.Ed
+.Pp
+All fields are written in network byte order.
+.Pp
+The purpose of
+.Nm unstr
+is to undo the work of
+.Nm strfile .
+It prints out the strings contained in the file
+.Ar source_file
+in the order that they are listed in
+the header file
+.Ar source_file Ns Pa .dat
+to standard output.
+It is possible to create sorted versions of input files by using
+.Fl o
+when
+.Nm strfile
+is run and then using
+.Nm unstr
+to dump them out in the table order.
+.Sh SEE ALSO
+.Xr byteorder 3 ,
+.Xr fortune 6
+.Sh FILES
+.Bl -tag -width strfile.out -compact
+.It Pa strfile.out
+default output file.
+.El
+.Sh HISTORY
+The
+.Nm strfile
+utility first appeared in 4.4BSD.
diff --git a/games/fortune/strfile/strfile.c b/games/fortune/strfile/strfile.c
new file mode 100644
index 0000000..2401caa
--- /dev/null
+++ b/games/fortune/strfile/strfile.c
@@ -0,0 +1,456 @@
+/*-
+ * Copyright (c) 1989, 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. All advertising materials mentioning features or use of this software
+ * must display the following acknowledgement:
+ * This product includes software developed by the University of
+ * California, Berkeley and its contributors.
+ * 4. 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.
+ */
+
+#ifndef lint
+static char copyright[] =
+"@(#) Copyright (c) 1989, 1993\n\
+ The Regents of the University of California. All rights reserved.\n";
+#endif /* not lint */
+
+#ifndef lint
+static char sccsid[] = "@(#)strfile.c 8.1 (Berkeley) 5/31/93";
+#endif /* not lint */
+
+# include <machine/endian.h>
+# include <sys/param.h>
+# include <stdio.h>
+# include <ctype.h>
+# include "strfile.h"
+
+# ifndef MAXPATHLEN
+# define MAXPATHLEN 1024
+# endif /* MAXPATHLEN */
+
+/*
+ * This program takes a file composed of strings seperated by
+ * lines starting with two consecutive delimiting character (default
+ * character is '%') and creates another file which consists of a table
+ * describing the file (structure from "strfile.h"), a table of seek
+ * pointers to the start of the strings, and the strings, each terminated
+ * by a null byte. Usage:
+ *
+ * % strfile [-iorsx] [ -cC ] sourcefile [ datafile ]
+ *
+ * c - Change delimiting character from '%' to 'C'
+ * s - Silent. Give no summary of data processed at the end of
+ * the run.
+ * o - order the strings in alphabetic order
+ * i - if ordering, ignore case
+ * r - randomize the order of the strings
+ * x - set rotated bit
+ *
+ * Ken Arnold Sept. 7, 1978 --
+ *
+ * Added ordering options.
+ */
+
+# define TRUE 1
+# define FALSE 0
+
+# define STORING_PTRS (Oflag || Rflag)
+# define CHUNKSIZE 512
+
+#ifdef lint
+# define ALWAYS atoi("1")
+#else
+# define ALWAYS 1
+#endif
+# define ALLOC(ptr,sz) if (ALWAYS) { \
+ if (ptr == NULL) \
+ ptr = malloc((unsigned int) (CHUNKSIZE * sizeof *ptr)); \
+ else if (((sz) + 1) % CHUNKSIZE == 0) \
+ ptr = realloc((void *) ptr, ((unsigned int) ((sz) + CHUNKSIZE) * sizeof *ptr)); \
+ if (ptr == NULL) { \
+ fprintf(stderr, "out of space\n"); \
+ exit(1); \
+ } \
+ } else
+
+#ifdef NO_VOID
+# define void char
+#endif
+
+typedef struct {
+ char first;
+ off_t pos;
+} STR;
+
+char *Infile = NULL, /* input file name */
+ Outfile[MAXPATHLEN] = "", /* output file name */
+ Delimch = '%'; /* delimiting character */
+
+int Sflag = FALSE; /* silent run flag */
+int Oflag = FALSE; /* ordering flag */
+int Iflag = FALSE; /* ignore case flag */
+int Rflag = FALSE; /* randomize order flag */
+int Xflag = FALSE; /* set rotated bit */
+long Num_pts = 0; /* number of pointers/strings */
+
+off_t *Seekpts;
+
+FILE *Sort_1, *Sort_2; /* pointers for sorting */
+
+STRFILE Tbl; /* statistics table */
+
+STR *Firstch; /* first chars of each string */
+
+char *fgets(), *strcpy(), *strcat();
+
+void *malloc(), *realloc();
+
+/*
+ * main:
+ * Drive the sucker. There are two main modes -- either we store
+ * the seek pointers, if the table is to be sorted or randomized,
+ * or we write the pointer directly to the file, if we are to stay
+ * in file order. If the former, we allocate and re-allocate in
+ * CHUNKSIZE blocks; if the latter, we just write each pointer,
+ * and then seek back to the beginning to write in the table.
+ */
+main(ac, av)
+int ac;
+char **av;
+{
+ register char *sp, dc;
+ register FILE *inf, *outf;
+ register off_t last_off, length, pos, *p;
+ register int first, cnt;
+ register char *nsp;
+ register STR *fp;
+ static char string[257];
+
+ getargs(ac, av); /* evalute arguments */
+ dc = Delimch;
+ if ((inf = fopen(Infile, "r")) == NULL) {
+ perror(Infile);
+ exit(1);
+ }
+
+ if ((outf = fopen(Outfile, "w")) == NULL) {
+ perror(Outfile);
+ exit(1);
+ }
+ if (!STORING_PTRS)
+ (void) fseek(outf, sizeof Tbl, 0);
+
+ /*
+ * Write the strings onto the file
+ */
+
+ Tbl.str_longlen = 0;
+ Tbl.str_shortlen = (unsigned int) 0xffffffff;
+ Tbl.str_delim = dc;
+ Tbl.str_version = VERSION;
+ first = Oflag;
+ add_offset(outf, ftell(inf));
+ last_off = 0;
+ do {
+ sp = fgets(string, 256, inf);
+ if (sp == NULL || sp[0] == dc && sp[1] == '\n') {
+ pos = ftell(inf);
+ length = pos - last_off - (sp ? strlen(sp) : 0);
+ last_off = pos;
+ if (!length)
+ continue;
+ add_offset(outf, pos);
+ if (Tbl.str_longlen < length)
+ Tbl.str_longlen = length;
+ if (Tbl.str_shortlen > length)
+ Tbl.str_shortlen = length;
+ first = Oflag;
+ }
+ else if (first) {
+ for (nsp = sp; !isalnum(*nsp); nsp++)
+ continue;
+ ALLOC(Firstch, Num_pts);
+ fp = &Firstch[Num_pts - 1];
+ if (Iflag && isupper(*nsp))
+ fp->first = tolower(*nsp);
+ else
+ fp->first = *nsp;
+ fp->pos = Seekpts[Num_pts - 1];
+ first = FALSE;
+ }
+ } while (sp != NULL);
+
+ /*
+ * write the tables in
+ */
+
+ (void) fclose(inf);
+
+ if (Oflag)
+ do_order();
+ else if (Rflag)
+ randomize();
+
+ if (Xflag)
+ Tbl.str_flags |= STR_ROTATED;
+
+ if (!Sflag) {
+ printf("\"%s\" created\n", Outfile);
+ if (Num_pts == 2)
+ puts("There was 1 string");
+ else
+ printf("There were %d strings\n", Num_pts - 1);
+ printf("Longest string: %lu byte%s\n", Tbl.str_longlen,
+ Tbl.str_longlen == 1 ? "" : "s");
+ printf("Shortest string: %lu byte%s\n", Tbl.str_shortlen,
+ Tbl.str_shortlen == 1 ? "" : "s");
+ }
+
+ (void) fseek(outf, (off_t) 0, 0);
+ Tbl.str_version = htonl(Tbl.str_version);
+ Tbl.str_numstr = htonl(Num_pts - 1);
+ Tbl.str_longlen = htonl(Tbl.str_longlen);
+ Tbl.str_shortlen = htonl(Tbl.str_shortlen);
+ Tbl.str_flags = htonl(Tbl.str_flags);
+ (void) fwrite((char *) &Tbl, sizeof Tbl, 1, outf);
+ if (STORING_PTRS) {
+ for (p = Seekpts, cnt = Num_pts; cnt--; ++p)
+ *p = htonl(*p);
+ (void) fwrite((char *) Seekpts, sizeof *Seekpts, (int) Num_pts, outf);
+ }
+ (void) fclose(outf);
+ exit(0);
+}
+
+/*
+ * This routine evaluates arguments from the command line
+ */
+getargs(argc, argv)
+int argc;
+char **argv;
+{
+ extern char *optarg;
+ extern int optind;
+ int ch;
+
+ while ((ch = getopt(argc, argv, "c:iorsx")) != EOF)
+ switch(ch) {
+ case 'c': /* new delimiting char */
+ Delimch = *optarg;
+ if (!isascii(Delimch)) {
+ printf("bad delimiting character: '\\%o\n'",
+ Delimch);
+ }
+ break;
+ case 'i': /* ignore case in ordering */
+ Iflag++;
+ break;
+ case 'o': /* order strings */
+ Oflag++;
+ break;
+ case 'r': /* randomize pointers */
+ Rflag++;
+ break;
+ case 's': /* silent */
+ Sflag++;
+ break;
+ case 'x': /* set the rotated bit */
+ Xflag++;
+ break;
+ case '?':
+ default:
+ usage();
+ }
+ argv += optind;
+
+ if (*argv) {
+ Infile = *argv;
+ if (*++argv)
+ (void) strcpy(Outfile, *argv);
+ }
+ if (!Infile) {
+ puts("No input file name");
+ usage();
+ }
+ if (*Outfile == '\0') {
+ (void) strcpy(Outfile, Infile);
+ (void) strcat(Outfile, ".dat");
+ }
+}
+
+usage()
+{
+ (void) fprintf(stderr,
+ "strfile [-iorsx] [-c char] sourcefile [datafile]\n");
+ exit(1);
+}
+
+/*
+ * add_offset:
+ * Add an offset to the list, or write it out, as appropriate.
+ */
+add_offset(fp, off)
+FILE *fp;
+off_t off;
+{
+ off_t net;
+
+ if (!STORING_PTRS) {
+ net = htonl(off);
+ fwrite(&net, 1, sizeof net, fp);
+ } else {
+ ALLOC(Seekpts, Num_pts + 1);
+ Seekpts[Num_pts] = off;
+ }
+ Num_pts++;
+}
+
+/*
+ * do_order:
+ * Order the strings alphabetically (possibly ignoring case).
+ */
+do_order()
+{
+ register int i;
+ register off_t *lp;
+ register STR *fp;
+ extern int cmp_str();
+
+ Sort_1 = fopen(Infile, "r");
+ Sort_2 = fopen(Infile, "r");
+ qsort((char *) Firstch, (int) Tbl.str_numstr, sizeof *Firstch, cmp_str);
+ i = Tbl.str_numstr;
+ lp = Seekpts;
+ fp = Firstch;
+ while (i--)
+ *lp++ = fp++->pos;
+ (void) fclose(Sort_1);
+ (void) fclose(Sort_2);
+ Tbl.str_flags |= STR_ORDERED;
+}
+
+/*
+ * cmp_str:
+ * Compare two strings in the file
+ */
+char *
+unctrl(c)
+char c;
+{
+ static char buf[3];
+
+ if (isprint(c)) {
+ buf[0] = c;
+ buf[1] = '\0';
+ }
+ else if (c == 0177) {
+ buf[0] = '^';
+ buf[1] = '?';
+ }
+ else {
+ buf[0] = '^';
+ buf[1] = c + 'A' - 1;
+ }
+ return buf;
+}
+
+cmp_str(p1, p2)
+STR *p1, *p2;
+{
+ register int c1, c2;
+ register int n1, n2;
+
+# define SET_N(nf,ch) (nf = (ch == '\n'))
+# define IS_END(ch,nf) (ch == Delimch && nf)
+
+ c1 = p1->first;
+ c2 = p2->first;
+ if (c1 != c2)
+ return c1 - c2;
+
+ (void) fseek(Sort_1, p1->pos, 0);
+ (void) fseek(Sort_2, p2->pos, 0);
+
+ n1 = FALSE;
+ n2 = FALSE;
+ while (!isalnum(c1 = getc(Sort_1)) && c1 != '\0')
+ SET_N(n1, c1);
+ while (!isalnum(c2 = getc(Sort_2)) && c2 != '\0')
+ SET_N(n2, c2);
+
+ while (!IS_END(c1, n1) && !IS_END(c2, n2)) {
+ if (Iflag) {
+ if (isupper(c1))
+ c1 = tolower(c1);
+ if (isupper(c2))
+ c2 = tolower(c2);
+ }
+ if (c1 != c2)
+ return c1 - c2;
+ SET_N(n1, c1);
+ SET_N(n2, c2);
+ c1 = getc(Sort_1);
+ c2 = getc(Sort_2);
+ }
+ if (IS_END(c1, n1))
+ c1 = 0;
+ if (IS_END(c2, n2))
+ c2 = 0;
+ return c1 - c2;
+}
+
+/*
+ * randomize:
+ * Randomize the order of the string table. We must be careful
+ * not to randomize across delimiter boundaries. All
+ * randomization is done within each block.
+ */
+randomize()
+{
+ register int cnt, i;
+ register off_t tmp;
+ register off_t *sp;
+ extern time_t time();
+
+ srandom((int)(time((time_t *) NULL) + getpid()));
+
+ Tbl.str_flags |= STR_RANDOM;
+ cnt = Tbl.str_numstr;
+
+ /*
+ * move things around randomly
+ */
+
+ for (sp = Seekpts; cnt > 0; cnt--, sp++) {
+ i = random() % cnt;
+ tmp = sp[0];
+ sp[0] = sp[i];
+ sp[i] = tmp;
+ }
+}
diff --git a/games/fortune/strfile/strfile.h b/games/fortune/strfile/strfile.h
new file mode 100644
index 0000000..9abc5f7
--- /dev/null
+++ b/games/fortune/strfile/strfile.h
@@ -0,0 +1,54 @@
+/*-
+ * Copyright (c) 1991, 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. All advertising materials mentioning features or use of this software
+ * must display the following acknowledgement:
+ * This product includes software developed by the University of
+ * California, Berkeley and its contributors.
+ * 4. 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.
+ *
+ * @(#)strfile.h 8.1 (Berkeley) 5/31/93
+ */
+
+#define STR_ENDSTRING(line,tbl) \
+ ((line)[0] == (tbl).str_delim && (line)[1] == '\n')
+
+typedef struct { /* information table */
+#define VERSION 1
+ unsigned long str_version; /* version number */
+ unsigned long str_numstr; /* # of strings in the file */
+ unsigned long str_longlen; /* length of longest string */
+ unsigned long str_shortlen; /* length of shortest string */
+#define STR_RANDOM 0x1 /* randomized pointers */
+#define STR_ORDERED 0x2 /* ordered pointers */
+#define STR_ROTATED 0x4 /* rot-13'd text */
+ unsigned long str_flags; /* bit field for flags */
+ unsigned char stuff[4]; /* long aligned space */
+#define str_delim stuff[0] /* delimiting character */
+} STRFILE;
OpenPOWER on IntegriCloud