Home | History | Annotate | Line # | Download | only in sort
fsort.h revision 1.4 
      1 /*	$NetBSD: fsort.h,v 1.4 2000/10/16 21:53:19 jdolecek Exp $	*/
      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.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the University of
     21  *	California, Berkeley and its contributors.
     22  * 4. Neither the name of the University nor the names of its contributors
     23  *    may be used to endorse or promote products derived from this software
     24  *    without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  * SUCH DAMAGE.
     37  *
     38  *	@(#)fsort.h	8.1 (Berkeley) 6/6/93
     39  */
     40 
     41 #define POW 20			/* exponent for buffer size */
     42 #define BUFSIZE (1 << POW)
     43 #define MAXNUM (BUFSIZE/10)	/* lowish guess at average record size */
     44 #define BUFFEND (EOF-2)
     45 #define BUFFSMALL (EOF-3)	/* buffer is too small to hold line */
     46 #define MAXFCT 1000
     47 #define DEFLLEN ((1 << min(POW-4, 16)) - 14)
     48 
     49 extern const u_char **keylist;
     50 extern u_char *buffer, *linebuf;
     51 extern size_t bufsize, linebuf_size;
     52 
     53 /* temp files in the stack have a file descriptor, a largest bin (maxb)
     54  * which becomes the last non-empty bin (lastb) when the actual largest
     55  * bin is smaller than max(half the total file, BUFSIZE)
     56  * Max_o is the offset of maxb so it can be sought after the other bins
     57  * are sorted.
     58 */
     59 struct tempfile {
     60 	FILE *fp;
     61 	u_char maxb;
     62 	u_char lastb;
     63 	long max_o;
     64 };
     65 extern struct tempfile fstack[MAXFCT];
     66