Home | History | Annotate | Line # | Download | only in sort
sort.c revision 1.14
      1  1.14  jdolecek /*	$NetBSD: sort.c,v 1.14 2001/01/11 15:10:46 jdolecek Exp $	*/
      2   1.2     bjh21 
      3   1.1     bjh21 /*-
      4   1.1     bjh21  * Copyright (c) 1993
      5   1.1     bjh21  *	The Regents of the University of California.  All rights reserved.
      6   1.1     bjh21  *
      7   1.1     bjh21  * This code is derived from software contributed to Berkeley by
      8   1.1     bjh21  * Peter McIlroy.
      9   1.1     bjh21  *
     10   1.1     bjh21  * Redistribution and use in source and binary forms, with or without
     11   1.1     bjh21  * modification, are permitted provided that the following conditions
     12   1.1     bjh21  * are met:
     13   1.1     bjh21  * 1. Redistributions of source code must retain the above copyright
     14   1.1     bjh21  *    notice, this list of conditions and the following disclaimer.
     15   1.1     bjh21  * 2. Redistributions in binary form must reproduce the above copyright
     16   1.1     bjh21  *    notice, this list of conditions and the following disclaimer in the
     17   1.1     bjh21  *    documentation and/or other materials provided with the distribution.
     18   1.1     bjh21  * 3. All advertising materials mentioning features or use of this software
     19   1.1     bjh21  *    must display the following acknowledgement:
     20   1.1     bjh21  *	This product includes software developed by the University of
     21   1.1     bjh21  *	California, Berkeley and its contributors.
     22   1.1     bjh21  * 4. Neither the name of the University nor the names of its contributors
     23   1.1     bjh21  *    may be used to endorse or promote products derived from this software
     24   1.1     bjh21  *    without specific prior written permission.
     25   1.1     bjh21  *
     26   1.1     bjh21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27   1.1     bjh21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28   1.1     bjh21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29   1.1     bjh21  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30   1.1     bjh21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31   1.1     bjh21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32   1.1     bjh21  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33   1.1     bjh21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34   1.1     bjh21  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35   1.1     bjh21  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36   1.1     bjh21  * SUCH DAMAGE.
     37   1.1     bjh21  */
     38   1.1     bjh21 
     39   1.1     bjh21 /* Sort sorts a file using an optional user-defined key.
     40   1.1     bjh21  * Sort uses radix sort for internal sorting, and allows
     41   1.1     bjh21  * a choice of merge sort and radix sort for external sorting.
     42   1.1     bjh21  */
     43   1.1     bjh21 
     44   1.1     bjh21 #include "sort.h"
     45   1.1     bjh21 #include "fsort.h"
     46   1.1     bjh21 #include "pathnames.h"
     47   1.1     bjh21 
     48   1.2     bjh21 #ifndef lint
     49   1.2     bjh21 __COPYRIGHT("@(#) Copyright (c) 1993\n\
     50   1.2     bjh21 	The Regents of the University of California.  All rights reserved.\n");
     51   1.2     bjh21 #endif /* not lint */
     52   1.2     bjh21 
     53   1.2     bjh21 #ifndef lint
     54  1.14  jdolecek __RCSID("$NetBSD: sort.c,v 1.14 2001/01/11 15:10:46 jdolecek Exp $");
     55   1.2     bjh21 __SCCSID("@(#)sort.c	8.1 (Berkeley) 6/6/93");
     56   1.2     bjh21 #endif /* not lint */
     57   1.2     bjh21 
     58   1.1     bjh21 #include <paths.h>
     59   1.1     bjh21 #include <signal.h>
     60   1.1     bjh21 #include <stdlib.h>
     61   1.1     bjh21 #include <string.h>
     62   1.1     bjh21 #include <unistd.h>
     63  1.11  jdolecek #include <locale.h>
     64   1.1     bjh21 
     65   1.1     bjh21 int REC_D = '\n';
     66   1.1     bjh21 u_char d_mask[NBINS];		/* flags for rec_d, field_d, <blank> */
     67   1.1     bjh21 /*
     68   1.1     bjh21  * weight tables.  Gweights is one of ascii, Rascii..
     69   1.1     bjh21  * modified to weight rec_d = 0 (or 255)
     70   1.1     bjh21  */
     71   1.1     bjh21 extern u_char gweights[NBINS];
     72   1.1     bjh21 u_char ascii[NBINS], Rascii[NBINS], RFtable[NBINS], Ftable[NBINS];
     73   1.1     bjh21 /*
     74   1.1     bjh21  * masks of ignored characters.  Alltable is 256 ones
     75   1.1     bjh21  */
     76   1.1     bjh21 u_char dtable[NBINS], itable[NBINS], alltable[NBINS];
     77   1.1     bjh21 int SINGL_FLD = 0, SEP_FLAG = 0, UNIQUE = 0;
     78   1.1     bjh21 struct coldesc clist[(ND+1)*2];
     79   1.1     bjh21 int ncols = 0;
     80   1.1     bjh21 extern struct coldesc clist[(ND+1)*2];
     81   1.1     bjh21 extern int ncols;
     82   1.1     bjh21 
     83   1.9  jdolecek /*
     84   1.9  jdolecek  * Default to stable sort.
     85   1.9  jdolecek  */
     86   1.9  jdolecek int stable_sort = 1;
     87   1.9  jdolecek 
     88   1.1     bjh21 char toutpath[_POSIX_PATH_MAX];
     89  1.10  jdolecek 
     90   1.1     bjh21 static void cleanup __P((void));
     91   1.2     bjh21 static void onsignal __P((int));
     92   1.8  jdolecek static void usage __P((const char *));
     93   1.1     bjh21 
     94   1.2     bjh21 int main __P((int argc, char **argv));
     95   1.2     bjh21 
     96   1.1     bjh21 int
     97   1.1     bjh21 main(argc, argv)
     98   1.1     bjh21 	int argc;
     99   1.1     bjh21 	char *argv[];
    100   1.1     bjh21 {
    101  1.13  jdolecek 	get_func_t get;
    102   1.1     bjh21 	int ch, i, stdinflag = 0, tmp = 0;
    103   1.6     bjh21 	char cflag = 0, mflag = 0;
    104   1.1     bjh21 	char *outfile, *outpath = 0;
    105   1.1     bjh21 	struct field fldtab[ND+2], *ftpos;
    106  1.13  jdolecek 	struct filelist filelist;
    107   1.3     bjh21 	FILE *outfp = NULL;
    108  1.10  jdolecek 
    109  1.11  jdolecek 	setlocale(LC_ALL, "");
    110  1.11  jdolecek 
    111   1.1     bjh21 	memset(fldtab, 0, (ND+2)*sizeof(struct field));
    112   1.1     bjh21 	memset(d_mask, 0, NBINS);
    113   1.1     bjh21 	d_mask[REC_D = '\n'] = REC_D_F;
    114   1.1     bjh21 	SINGL_FLD = SEP_FLAG = 0;
    115   1.1     bjh21 	d_mask['\t'] = d_mask[' '] = BLANK | FLD_D;
    116   1.1     bjh21 	ftpos = fldtab;
    117  1.10  jdolecek 
    118   1.1     bjh21 	fixit(&argc, argv);
    119  1.10  jdolecek 
    120  1.10  jdolecek 	while ((ch = getopt(argc, argv, "bcdfik:mHno:rsSt:T:ux")) != -1) {
    121  1.10  jdolecek 		switch (ch) {
    122  1.11  jdolecek 		case 'b':
    123  1.11  jdolecek 			fldtab->flags |= BI | BT;
    124  1.11  jdolecek 			break;
    125  1.11  jdolecek 		case 'c':
    126  1.11  jdolecek 			cflag = 1;
    127   1.1     bjh21 			break;
    128  1.11  jdolecek 		case 'd': case 'f': case 'i': case 'n': case 'r':
    129  1.11  jdolecek 			tmp |= optval(ch, 0);
    130   1.1     bjh21 			if (tmp & R && tmp & F)
    131   1.1     bjh21 				fldtab->weights = RFtable;
    132   1.1     bjh21 			else if (tmp & F)
    133   1.1     bjh21 				fldtab->weights = Ftable;
    134   1.1     bjh21 			else if(tmp & R)
    135   1.1     bjh21 				fldtab->weights = Rascii;
    136   1.1     bjh21 			fldtab->flags |= tmp;
    137   1.1     bjh21 			break;
    138  1.11  jdolecek 		case 'H':
    139  1.11  jdolecek 			PANIC = 0;
    140  1.11  jdolecek 			break;
    141  1.11  jdolecek 		case 'k':
    142  1.11  jdolecek 			setfield(optarg, ++ftpos, fldtab->flags);
    143  1.11  jdolecek 			break;
    144  1.11  jdolecek 		case 'm':
    145  1.11  jdolecek 			mflag = 1;
    146  1.11  jdolecek 			break;
    147   1.1     bjh21 		case 'o':
    148   1.1     bjh21 			outpath = optarg;
    149   1.1     bjh21 			break;
    150   1.9  jdolecek 		case 's':
    151   1.9  jdolecek 			/* for GNU sort compatibility (this is our default) */
    152   1.9  jdolecek 			stable_sort = 1;
    153   1.9  jdolecek 			break;
    154   1.9  jdolecek 		case 'S':
    155   1.9  jdolecek 			stable_sort = 0;
    156   1.1     bjh21 			break;
    157   1.1     bjh21 		case 't':
    158   1.1     bjh21 			if (SEP_FLAG)
    159   1.1     bjh21 				usage("multiple field delimiters");
    160   1.1     bjh21 			SEP_FLAG = 1;
    161   1.1     bjh21 			d_mask[' '] &= ~FLD_D;
    162   1.1     bjh21 			d_mask['\t'] &= ~FLD_D;
    163   1.2     bjh21 			d_mask[(u_char)*optarg] |= FLD_D;
    164   1.2     bjh21 			if (d_mask[(u_char)*optarg] & REC_D_F)
    165   1.1     bjh21 				err(2, "record/field delimiter clash");
    166   1.1     bjh21 			break;
    167   1.1     bjh21 		case 'T':
    168   1.1     bjh21 			if (REC_D != '\n')
    169   1.1     bjh21 				usage("multiple record delimiters");
    170   1.1     bjh21 			if ('\n' == (REC_D = *optarg))
    171   1.1     bjh21 				break;
    172   1.1     bjh21 			d_mask['\n'] = d_mask[' '];
    173   1.1     bjh21 			d_mask[REC_D] = REC_D_F;
    174   1.1     bjh21 			break;
    175   1.1     bjh21 		case 'u':
    176   1.1     bjh21 			UNIQUE = 1;
    177   1.1     bjh21 			break;
    178   1.1     bjh21 		case '?':
    179  1.10  jdolecek 		default:
    180  1.10  jdolecek 			usage("");
    181   1.1     bjh21 		}
    182   1.1     bjh21 	}
    183   1.1     bjh21 	if (cflag && argc > optind+1)
    184   1.1     bjh21 		errx(2, "too many input files for -c option");
    185   1.1     bjh21 	if (argc - 2 > optind && !strcmp(argv[argc-2], "-o")) {
    186   1.1     bjh21 		outpath = argv[argc-1];
    187   1.1     bjh21 		argc -= 2;
    188   1.1     bjh21 	}
    189   1.1     bjh21 	if (mflag && argc - optind > (MAXFCT - (16+1))*16)
    190   1.1     bjh21 		errx(2, "too many input files for -m option");
    191   1.1     bjh21 	for (i = optind; i < argc; i++) {
    192   1.1     bjh21 		/* allow one occurrence of /dev/stdin */
    193  1.10  jdolecek 		if (!strcmp(argv[i], "-") || !strcmp(argv[i], _PATH_STDIN)) {
    194   1.1     bjh21 			if (stdinflag)
    195   1.1     bjh21 				warnx("ignoring extra \"%s\" in file list",
    196   1.1     bjh21 				    argv[i]);
    197  1.10  jdolecek 			else
    198   1.1     bjh21 				stdinflag = 1;
    199  1.14  jdolecek 
    200  1.14  jdolecek 			/* change to /dev/stdin if '-' */
    201  1.14  jdolecek 			if (argv[i][0] == '-')
    202  1.14  jdolecek 				argv[i] = _PATH_STDIN;
    203  1.14  jdolecek 
    204   1.2     bjh21 		} else if ((ch = access(argv[i], R_OK)))
    205   1.7   thorpej 			err(2, "%s", argv[i]);
    206   1.1     bjh21 	}
    207   1.6     bjh21 	if (!(fldtab->flags & (I|D|N) || fldtab[1].icol.num)) {
    208   1.1     bjh21 		SINGL_FLD = 1;
    209   1.1     bjh21 		fldtab[0].icol.num = 1;
    210   1.1     bjh21 	} else {
    211   1.1     bjh21 		if (!fldtab[1].icol.num) {
    212   1.1     bjh21 			fldtab[0].flags &= ~(BI|BT);
    213   1.1     bjh21 			setfield("1", ++ftpos, fldtab->flags);
    214   1.1     bjh21 		}
    215   1.1     bjh21 		fldreset(fldtab);
    216   1.1     bjh21 		fldtab[0].flags &= ~F;
    217   1.1     bjh21 	}
    218   1.1     bjh21 	settables(fldtab[0].flags);
    219   1.1     bjh21 	num_init();
    220   1.1     bjh21 	fldtab->weights = gweights;
    221   1.5     bjh21 	if (optind == argc) {
    222  1.10  jdolecek 		static const char * const names[] = { _PATH_STDIN, NULL };
    223   1.5     bjh21 
    224   1.5     bjh21 		filelist.names = names;
    225   1.5     bjh21 		optind--;
    226   1.5     bjh21 	} else
    227  1.10  jdolecek 		filelist.names = (const char * const *) &argv[optind];
    228   1.1     bjh21 	if (SINGL_FLD)
    229   1.1     bjh21 		get = makeline;
    230   1.1     bjh21 	else
    231   1.1     bjh21 		get = makekey;
    232   1.1     bjh21 	if (cflag) {
    233  1.13  jdolecek 		order(&filelist, get, fldtab);
    234   1.1     bjh21 		/* NOT REACHED */
    235   1.1     bjh21 	}
    236   1.1     bjh21 	if (!outpath) {
    237   1.1     bjh21 		(void)snprintf(toutpath,
    238   1.1     bjh21 		    sizeof(toutpath), "%sstdout", _PATH_DEV);
    239   1.1     bjh21 		outfile = outpath = toutpath;
    240   1.1     bjh21 	} else if (!(ch = access(outpath, 0)) &&
    241   1.1     bjh21 	    strncmp(_PATH_DEV, outpath, 5)) {
    242   1.2     bjh21 		struct sigaction act = {0};
    243   1.1     bjh21 		int sigtable[] = {SIGHUP, SIGINT, SIGPIPE, SIGXCPU, SIGXFSZ,
    244   1.1     bjh21 		    SIGVTALRM, SIGPROF, 0};
    245   1.3     bjh21 		int outfd;
    246   1.1     bjh21 		errno = 0;
    247   1.1     bjh21 		if (access(outpath, W_OK))
    248   1.1     bjh21 			err(2, "%s", outpath);
    249   1.2     bjh21 		act.sa_handler = onsignal;
    250   1.2     bjh21 		act.sa_flags = SA_RESTART | SA_RESETHAND;
    251   1.1     bjh21 		(void)snprintf(toutpath, sizeof(toutpath), "%sXXXX", outpath);
    252   1.3     bjh21 		if ((outfd = mkstemp(toutpath)) < 0 ||
    253   1.3     bjh21 		    (outfp = fdopen(outfd, "w")) == 0)
    254   1.8  jdolecek 			err(2, "temporary file %s", toutpath);
    255   1.3     bjh21 		outfile = toutpath;
    256   1.1     bjh21 		(void)atexit(cleanup);
    257   1.1     bjh21 		for (i = 0; sigtable[i]; ++i)	/* always unlink toutpath */
    258   1.1     bjh21 			sigaction(sigtable[i], &act, 0);
    259   1.3     bjh21 	} else
    260   1.3     bjh21 		outfile = outpath;
    261  1.13  jdolecek 
    262   1.3     bjh21 	if (outfp == NULL && (outfp = fopen(outfile, "w")) == NULL)
    263   1.8  jdolecek 		err(2, "output file %s", outfile);
    264  1.13  jdolecek 
    265  1.13  jdolecek 	if (mflag) {
    266  1.13  jdolecek 		fmerge(-1, 0, &filelist, argc-optind, get, outfp, putline,
    267  1.13  jdolecek 			fldtab);
    268  1.13  jdolecek 	} else
    269  1.13  jdolecek 		fsort(-1, 0, 0, &filelist, argc-optind, outfp, fldtab);
    270  1.13  jdolecek 
    271   1.1     bjh21 	if (outfile != outpath) {
    272   1.1     bjh21 		if (access(outfile, 0))
    273   1.7   thorpej 			err(2, "%s", outfile);
    274   1.1     bjh21 		(void)unlink(outpath);
    275   1.1     bjh21 		if (link(outfile, outpath))
    276   1.1     bjh21 			err(2, "cannot link %s: output left in %s",
    277   1.1     bjh21 			    outpath, outfile);
    278   1.1     bjh21 		(void)unlink(outfile);
    279   1.1     bjh21 	}
    280   1.1     bjh21 	exit(0);
    281   1.1     bjh21 }
    282   1.1     bjh21 
    283   1.1     bjh21 static void
    284   1.2     bjh21 onsignal(sig)
    285   1.2     bjh21 	int sig;
    286   1.1     bjh21 {
    287   1.1     bjh21 	cleanup();
    288   1.1     bjh21 }
    289   1.1     bjh21 
    290   1.1     bjh21 static void
    291   1.1     bjh21 cleanup()
    292   1.1     bjh21 {
    293   1.1     bjh21 	if (toutpath[0])
    294   1.1     bjh21 		(void)unlink(toutpath);
    295   1.1     bjh21 }
    296   1.1     bjh21 
    297   1.1     bjh21 static void
    298   1.1     bjh21 usage(msg)
    299   1.8  jdolecek 	const char *msg;
    300   1.1     bjh21 {
    301   1.1     bjh21 	if (msg)
    302   1.1     bjh21 		(void)fprintf(stderr, "sort: %s\n", msg);
    303   1.1     bjh21 	(void)fprintf(stderr, "usage: [-o output] [-cmubdfinr] [-t char] ");
    304   1.1     bjh21 	(void)fprintf(stderr, "[-T char] [-k keydef] ... [files]\n");
    305   1.1     bjh21 	exit(2);
    306   1.1     bjh21 }
    307