Annotation of src/usr.bin/sort/fsort.h, Revision 1.7
1.6 naddy 1: /* $OpenBSD: fsort.h,v 1.5 2006/10/18 23:30:43 millert Exp $ */
1.1 millert 2:
3: /*-
4: * Copyright (c) 1993
5: * The Regents of the University of California. All rights reserved.
6: *
7: * This code is derived from software contributed to Berkeley by
8: * Peter McIlroy.
9: *
10: * Redistribution and use in source and binary forms, with or without
11: * modification, are permitted provided that the following conditions
12: * are met:
13: * 1. Redistributions of source code must retain the above copyright
14: * notice, this list of conditions and the following disclaimer.
15: * 2. Redistributions in binary form must reproduce the above copyright
16: * notice, this list of conditions and the following disclaimer in the
17: * documentation and/or other materials provided with the distribution.
1.4 millert 18: * 3. Neither the name of the University nor the names of its contributors
1.1 millert 19: * may be used to endorse or promote products derived from this software
20: * without specific prior written permission.
21: *
22: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32: * SUCH DAMAGE.
33: *
34: * @(#)fsort.h 8.1 (Berkeley) 6/6/93
35: */
36:
37: #define POW 20 /* exponent for buffer size */
38: #define BUFSIZE (1 << POW)
39: #define MAXNUM (BUFSIZE/10) /* lowish guess at average record size */
40: #define BUFFEND (EOF-2)
1.3 ericj 41: #define BUFFSMALL (EOF-3) /* buffer is too small to hold line */
1.1 millert 42: #define MAXFCT 1000
43: #define MAXLLEN ((1 << min(POW-4, 16)) - 14)
44:
1.7 ! millert 45: extern u_char *buffer, *bufend, *linebuf;
1.3 ericj 46: extern size_t bufsize, linebuf_size;
1.1 millert 47:
48: /* temp files in the stack have a file descriptor, a largest bin (maxb)
49: * which becomes the last non-empty bin (lastb) when the actual largest
50: * bin is smaller than max(half the total file, BUFSIZE)
51: * Max_o is the offset of maxb so it can be sought after the other bins
52: * are sorted.
53: */
54: struct tempfile {
55: FILE *fp;
56: u_char maxb;
57: u_char lastb;
1.2 millert 58: int max_o;
1.1 millert 59: };
60: extern struct tempfile fstack[MAXFCT];