Home | History | Annotate | Line # | Download | only in sort
sort.h revision 1.2 
      1 /*	$NetBSD: sort.h,v 1.2 2000/10/07 18:37:10 bjh21 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  *	@(#)sort.h	8.1 (Berkeley) 6/6/93
     39  */
     40 
     41 #include <sys/param.h>
     42 
     43 #include <db.h>
     44 #include <err.h>
     45 #include <errno.h>
     46 #include <fcntl.h>
     47 #include <limits.h>
     48 #include <stdio.h>
     49 #include <stdlib.h>
     50 
     51 #define NBINS 256
     52 #define MAXMERGE 16
     53 
     54 /* values for masks, weights, and other flags. */
     55 #define I 1		/* mask out non-printable characters */
     56 #define D 2		/* sort alphanumeric characters only */
     57 #define N 4		/* Field is a number */
     58 #define F 8		/* weight lower and upper case the same */
     59 #define R 16		/* Field is reversed with respect to the global weight */
     60 #define BI 32		/* ignore blanks in icol */
     61 #define BT 64		/* ignore blanks in tcol */
     62 
     63 /* masks for delimiters: blanks, fields, and termination. */
     64 #define BLANK 1		/* ' ', '\t'; '\n' if -T is invoked */
     65 #define FLD_D 2		/* ' ', '\t' default; from -t otherwise */
     66 #define REC_D_F 4	/* '\n' default; from -T otherwise */
     67 
     68 #define ND 10	/* limit on number of -k options. */
     69 
     70 #define min(a, b) ((a) < (b) ? (a) : (b))
     71 #define max(a, b) ((a) > (b) ? (a) : (b))
     72 
     73 #define	FCLOSE(file) {							\
     74 	if (EOF == fclose(file))					\
     75 		err(2, "%p", file);					\
     76 }
     77 
     78 #define	EWRITE(ptr, size, n, f) {					\
     79 	if (!fwrite(ptr, size, n, f))					\
     80 		 err(2, NULL);						\
     81 }
     82 
     83 /* length of record is currently limited to 2^16 - 1 */
     84 typedef u_short length_t;
     85 
     86 #define SALIGN(n) ((n+1) & ~1)
     87 
     88 /* a record is a key/line pair starting at rec.data. It has a total length
     89  * and an offset to the start of the line half of the pair.
     90  */
     91 typedef struct recheader {
     92 	length_t length;
     93 	length_t offset;
     94 	u_char data[1];
     95 } RECHEADER;
     96 
     97 typedef struct trecheader {
     98 	length_t length;
     99 	length_t offset;
    100 } TRECHEADER;
    101 
    102 /* This is the column as seen by struct field.  It is used by enterfield.
    103  * They are matched with corresponding coldescs during initialization.
    104  */
    105 struct column {
    106 	struct coldesc *p;
    107 	int num;
    108 	int indent;
    109 };
    110 
    111 /* a coldesc has a number and pointers to the beginning and end of the
    112  * corresponding column in the current line.  This is determined in enterkey.
    113  */
    114 typedef struct coldesc {
    115 	u_char *start;
    116 	u_char *end;
    117 	int num;
    118 } COLDESC;
    119 
    120 /* A field has an initial and final column; an omitted final column
    121  * implies the end of the line.  Flags regulate omission of blanks and
    122  * numerical sorts; mask determines which characters are ignored (from -i, -d);
    123  * weights determines the sort weights of a character (from -f, -r).
    124  */
    125 struct field {
    126 	struct column icol;
    127 	struct column tcol;
    128 	u_int flags;
    129 	u_char *mask;
    130 	u_char *weights;
    131 };
    132 
    133 union f_handle {
    134 	int top;
    135 	char **names;
    136 };
    137 extern int PANIC;	/* maximum depth of fsort before fmerge is called */
    138 extern u_char ascii[NBINS], Rascii[NBINS], Ftable[NBINS], RFtable[NBINS];
    139 extern u_char alltable[NBINS], dtable[NBINS], itable[NBINS];
    140 extern u_char d_mask[NBINS];
    141 extern int SINGL_FLD, SEP_FLAG, UNIQUE;
    142 extern int REC_D;
    143 
    144 #include "extern.h"
    145