Home | History | Annotate | Line # | Download | only in sort
fsort.h revision 1.1 
      1 /*-
      2  * Copyright (c) 1993
      3  *	The Regents of the University of California.  All rights reserved.
      4  *
      5  * This code is derived from software contributed to Berkeley by
      6  * Peter McIlroy.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     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. All advertising materials mentioning features or use of this software
     17  *    must display the following acknowledgement:
     18  *	This product includes software developed by the University of
     19  *	California, Berkeley and its contributors.
     20  * 4. Neither the name of the University nor the names of its contributors
     21  *    may be used to endorse or promote products derived from this software
     22  *    without specific prior written permission.
     23  *
     24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  * SUCH DAMAGE.
     35  *
     36  *	@(#)fsort.h	8.1 (Berkeley) 6/6/93
     37  */
     38 
     39 #define POW 20			/* exponent for buffer size */
     40 #define BUFSIZE (1 << POW)
     41 #define MAXNUM (BUFSIZE/10)	/* lowish guess at average record size */
     42 #define BUFFEND (EOF-2)
     43 #define MAXFCT 1000
     44 #define MAXLLEN ((1 << min(POW-4, 16)) - 14)
     45 
     46 extern u_char **keylist, **l2buf, *buffer, *linebuf;
     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 *fd;
     56 	u_char maxb;
     57 	u_char lastb;
     58 	long max_o;
     59 };
     60 extern struct tempfile fstack[MAXFCT];
     61