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