sort.c revision 1.31 1 1.31 jdolecek /* $NetBSD: sort.c,v 1.31 2002/12/24 14:55: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.31 jdolecek __RCSID("$NetBSD: sort.c,v 1.31 2002/12/24 14:55: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.26 ross #include <sys/types.h>
59 1.26 ross #include <sys/time.h>
60 1.26 ross #include <sys/resource.h>
61 1.26 ross
62 1.1 bjh21 #include <paths.h>
63 1.1 bjh21 #include <signal.h>
64 1.1 bjh21 #include <stdlib.h>
65 1.1 bjh21 #include <string.h>
66 1.1 bjh21 #include <unistd.h>
67 1.11 jdolecek #include <locale.h>
68 1.1 bjh21
69 1.1 bjh21 int REC_D = '\n';
70 1.1 bjh21 u_char d_mask[NBINS]; /* flags for rec_d, field_d, <blank> */
71 1.30 jdolecek
72 1.1 bjh21 /*
73 1.1 bjh21 * weight tables. Gweights is one of ascii, Rascii..
74 1.1 bjh21 * modified to weight rec_d = 0 (or 255)
75 1.1 bjh21 */
76 1.1 bjh21 u_char ascii[NBINS], Rascii[NBINS], RFtable[NBINS], Ftable[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
81 1.9 jdolecek /*
82 1.9 jdolecek * Default to stable sort.
83 1.9 jdolecek */
84 1.9 jdolecek int stable_sort = 1;
85 1.9 jdolecek
86 1.30 jdolecek static char toutpath[MAXPATHLEN];
87 1.30 jdolecek static struct field fldtab[ND+2];
88 1.10 jdolecek
89 1.22 jdolecek const char *tmpdir; /* where temporary files should be put */
90 1.22 jdolecek
91 1.1 bjh21 static void cleanup __P((void));
92 1.2 bjh21 static void onsignal __P((int));
93 1.8 jdolecek static void usage __P((const char *));
94 1.26 ross static void many_files __P((void));
95 1.1 bjh21
96 1.2 bjh21 int main __P((int argc, char **argv));
97 1.2 bjh21
98 1.1 bjh21 int
99 1.1 bjh21 main(argc, argv)
100 1.1 bjh21 int argc;
101 1.1 bjh21 char *argv[];
102 1.1 bjh21 {
103 1.13 jdolecek get_func_t get;
104 1.1 bjh21 int ch, i, stdinflag = 0, tmp = 0;
105 1.6 bjh21 char cflag = 0, mflag = 0;
106 1.1 bjh21 char *outfile, *outpath = 0;
107 1.30 jdolecek struct field *ftpos;
108 1.13 jdolecek struct filelist filelist;
109 1.3 bjh21 FILE *outfp = NULL;
110 1.31 jdolecek struct rlimit rl;
111 1.10 jdolecek
112 1.11 jdolecek setlocale(LC_ALL, "");
113 1.11 jdolecek
114 1.31 jdolecek /* bump RLIMIT_NOFILE to maximum our hard limit allows */
115 1.31 jdolecek if (getrlimit(RLIMIT_NOFILE, &rl) < 0)
116 1.31 jdolecek err(2, "getrlimit");
117 1.31 jdolecek rl.rlim_cur = rl.rlim_max;
118 1.31 jdolecek if (setrlimit(RLIMIT_NOFILE, &rl) < 0)
119 1.31 jdolecek err(2, "setrlimit");
120 1.31 jdolecek
121 1.1 bjh21 d_mask[REC_D = '\n'] = REC_D_F;
122 1.1 bjh21 SINGL_FLD = SEP_FLAG = 0;
123 1.1 bjh21 d_mask['\t'] = d_mask[' '] = BLANK | FLD_D;
124 1.1 bjh21 ftpos = fldtab;
125 1.26 ross many_files();
126 1.10 jdolecek
127 1.1 bjh21 fixit(&argc, argv);
128 1.22 jdolecek if (!(tmpdir = getenv("TMPDIR")))
129 1.22 jdolecek tmpdir = _PATH_TMP;
130 1.10 jdolecek
131 1.21 jdolecek while ((ch = getopt(argc, argv, "bcdfik:mHno:rR:sSt:T:ux")) != -1) {
132 1.10 jdolecek switch (ch) {
133 1.11 jdolecek case 'b':
134 1.11 jdolecek fldtab->flags |= BI | BT;
135 1.11 jdolecek break;
136 1.11 jdolecek case 'c':
137 1.11 jdolecek cflag = 1;
138 1.1 bjh21 break;
139 1.11 jdolecek case 'd': case 'f': case 'i': case 'n': case 'r':
140 1.11 jdolecek tmp |= optval(ch, 0);
141 1.15 jdolecek if ((tmp & R) && (tmp & F))
142 1.1 bjh21 fldtab->weights = RFtable;
143 1.1 bjh21 else if (tmp & F)
144 1.1 bjh21 fldtab->weights = Ftable;
145 1.15 jdolecek else if (tmp & R)
146 1.1 bjh21 fldtab->weights = Rascii;
147 1.1 bjh21 fldtab->flags |= tmp;
148 1.1 bjh21 break;
149 1.11 jdolecek case 'H':
150 1.11 jdolecek PANIC = 0;
151 1.11 jdolecek break;
152 1.11 jdolecek case 'k':
153 1.11 jdolecek setfield(optarg, ++ftpos, fldtab->flags);
154 1.11 jdolecek break;
155 1.11 jdolecek case 'm':
156 1.11 jdolecek mflag = 1;
157 1.11 jdolecek break;
158 1.1 bjh21 case 'o':
159 1.1 bjh21 outpath = optarg;
160 1.1 bjh21 break;
161 1.9 jdolecek case 's':
162 1.9 jdolecek /* for GNU sort compatibility (this is our default) */
163 1.9 jdolecek stable_sort = 1;
164 1.9 jdolecek break;
165 1.9 jdolecek case 'S':
166 1.9 jdolecek stable_sort = 0;
167 1.1 bjh21 break;
168 1.1 bjh21 case 't':
169 1.1 bjh21 if (SEP_FLAG)
170 1.1 bjh21 usage("multiple field delimiters");
171 1.1 bjh21 SEP_FLAG = 1;
172 1.1 bjh21 d_mask[' '] &= ~FLD_D;
173 1.1 bjh21 d_mask['\t'] &= ~FLD_D;
174 1.2 bjh21 d_mask[(u_char)*optarg] |= FLD_D;
175 1.2 bjh21 if (d_mask[(u_char)*optarg] & REC_D_F)
176 1.19 jdolecek errx(2, "record/field delimiter clash");
177 1.1 bjh21 break;
178 1.21 jdolecek case 'R':
179 1.1 bjh21 if (REC_D != '\n')
180 1.1 bjh21 usage("multiple record delimiters");
181 1.1 bjh21 if ('\n' == (REC_D = *optarg))
182 1.1 bjh21 break;
183 1.1 bjh21 d_mask['\n'] = d_mask[' '];
184 1.1 bjh21 d_mask[REC_D] = REC_D_F;
185 1.1 bjh21 break;
186 1.21 jdolecek case 'T':
187 1.23 jdolecek /* -T tmpdir */
188 1.23 jdolecek tmpdir = optarg;
189 1.21 jdolecek break;
190 1.1 bjh21 case 'u':
191 1.1 bjh21 UNIQUE = 1;
192 1.1 bjh21 break;
193 1.1 bjh21 case '?':
194 1.10 jdolecek default:
195 1.17 soren usage(NULL);
196 1.1 bjh21 }
197 1.1 bjh21 }
198 1.1 bjh21 if (cflag && argc > optind+1)
199 1.1 bjh21 errx(2, "too many input files for -c option");
200 1.1 bjh21 if (argc - 2 > optind && !strcmp(argv[argc-2], "-o")) {
201 1.1 bjh21 outpath = argv[argc-1];
202 1.1 bjh21 argc -= 2;
203 1.1 bjh21 }
204 1.1 bjh21 if (mflag && argc - optind > (MAXFCT - (16+1))*16)
205 1.1 bjh21 errx(2, "too many input files for -m option");
206 1.1 bjh21 for (i = optind; i < argc; i++) {
207 1.1 bjh21 /* allow one occurrence of /dev/stdin */
208 1.10 jdolecek if (!strcmp(argv[i], "-") || !strcmp(argv[i], _PATH_STDIN)) {
209 1.1 bjh21 if (stdinflag)
210 1.1 bjh21 warnx("ignoring extra \"%s\" in file list",
211 1.1 bjh21 argv[i]);
212 1.10 jdolecek else
213 1.1 bjh21 stdinflag = 1;
214 1.14 jdolecek
215 1.14 jdolecek /* change to /dev/stdin if '-' */
216 1.14 jdolecek if (argv[i][0] == '-')
217 1.14 jdolecek argv[i] = _PATH_STDIN;
218 1.14 jdolecek
219 1.2 bjh21 } else if ((ch = access(argv[i], R_OK)))
220 1.7 thorpej err(2, "%s", argv[i]);
221 1.1 bjh21 }
222 1.6 bjh21 if (!(fldtab->flags & (I|D|N) || fldtab[1].icol.num)) {
223 1.1 bjh21 SINGL_FLD = 1;
224 1.1 bjh21 fldtab[0].icol.num = 1;
225 1.1 bjh21 } else {
226 1.1 bjh21 if (!fldtab[1].icol.num) {
227 1.1 bjh21 fldtab[0].flags &= ~(BI|BT);
228 1.1 bjh21 setfield("1", ++ftpos, fldtab->flags);
229 1.1 bjh21 }
230 1.1 bjh21 fldreset(fldtab);
231 1.1 bjh21 fldtab[0].flags &= ~F;
232 1.1 bjh21 }
233 1.1 bjh21 settables(fldtab[0].flags);
234 1.1 bjh21 num_init();
235 1.1 bjh21 fldtab->weights = gweights;
236 1.5 bjh21 if (optind == argc) {
237 1.10 jdolecek static const char * const names[] = { _PATH_STDIN, NULL };
238 1.5 bjh21
239 1.5 bjh21 filelist.names = names;
240 1.5 bjh21 optind--;
241 1.5 bjh21 } else
242 1.10 jdolecek filelist.names = (const char * const *) &argv[optind];
243 1.15 jdolecek
244 1.1 bjh21 if (SINGL_FLD)
245 1.1 bjh21 get = makeline;
246 1.1 bjh21 else
247 1.1 bjh21 get = makekey;
248 1.15 jdolecek
249 1.1 bjh21 if (cflag) {
250 1.13 jdolecek order(&filelist, get, fldtab);
251 1.1 bjh21 /* NOT REACHED */
252 1.1 bjh21 }
253 1.1 bjh21 if (!outpath) {
254 1.1 bjh21 (void)snprintf(toutpath,
255 1.1 bjh21 sizeof(toutpath), "%sstdout", _PATH_DEV);
256 1.1 bjh21 outfile = outpath = toutpath;
257 1.24 christos outfp = stdout;
258 1.1 bjh21 } else if (!(ch = access(outpath, 0)) &&
259 1.1 bjh21 strncmp(_PATH_DEV, outpath, 5)) {
260 1.29 tron struct sigaction act;
261 1.24 christos static const int sigtable[] = {SIGHUP, SIGINT, SIGPIPE,
262 1.24 christos SIGXCPU, SIGXFSZ, SIGVTALRM, SIGPROF, 0};
263 1.3 bjh21 int outfd;
264 1.1 bjh21 errno = 0;
265 1.1 bjh21 if (access(outpath, W_OK))
266 1.1 bjh21 err(2, "%s", outpath);
267 1.24 christos (void)snprintf(toutpath, sizeof(toutpath), "%sXXXXXX",
268 1.24 christos outpath);
269 1.25 christos if ((outfd = mkstemp(toutpath)) == -1)
270 1.25 christos err(2, "Cannot create temporary file `%s'", toutpath);
271 1.25 christos if ((outfp = fdopen(outfd, "w")) == NULL)
272 1.25 christos err(2, "Cannot open temporary file `%s'", toutpath);
273 1.3 bjh21 outfile = toutpath;
274 1.1 bjh21 (void)atexit(cleanup);
275 1.29 tron act.sa_handler = onsignal;
276 1.29 tron (void) sigemptyset(&act.sa_mask);
277 1.29 tron act.sa_flags = SA_RESTART | SA_RESETHAND;
278 1.1 bjh21 for (i = 0; sigtable[i]; ++i) /* always unlink toutpath */
279 1.1 bjh21 sigaction(sigtable[i], &act, 0);
280 1.3 bjh21 } else
281 1.3 bjh21 outfile = outpath;
282 1.13 jdolecek
283 1.3 bjh21 if (outfp == NULL && (outfp = fopen(outfile, "w")) == NULL)
284 1.8 jdolecek err(2, "output file %s", outfile);
285 1.13 jdolecek
286 1.13 jdolecek if (mflag) {
287 1.13 jdolecek fmerge(-1, 0, &filelist, argc-optind, get, outfp, putline,
288 1.13 jdolecek fldtab);
289 1.13 jdolecek } else
290 1.13 jdolecek fsort(-1, 0, 0, &filelist, argc-optind, outfp, fldtab);
291 1.13 jdolecek
292 1.1 bjh21 if (outfile != outpath) {
293 1.1 bjh21 if (access(outfile, 0))
294 1.7 thorpej err(2, "%s", outfile);
295 1.1 bjh21 (void)unlink(outpath);
296 1.1 bjh21 if (link(outfile, outpath))
297 1.1 bjh21 err(2, "cannot link %s: output left in %s",
298 1.1 bjh21 outpath, outfile);
299 1.1 bjh21 (void)unlink(outfile);
300 1.1 bjh21 }
301 1.1 bjh21 exit(0);
302 1.1 bjh21 }
303 1.1 bjh21
304 1.1 bjh21 static void
305 1.2 bjh21 onsignal(sig)
306 1.2 bjh21 int sig;
307 1.1 bjh21 {
308 1.1 bjh21 cleanup();
309 1.1 bjh21 }
310 1.1 bjh21
311 1.1 bjh21 static void
312 1.1 bjh21 cleanup()
313 1.1 bjh21 {
314 1.1 bjh21 if (toutpath[0])
315 1.1 bjh21 (void)unlink(toutpath);
316 1.1 bjh21 }
317 1.1 bjh21
318 1.1 bjh21 static void
319 1.1 bjh21 usage(msg)
320 1.8 jdolecek const char *msg;
321 1.1 bjh21 {
322 1.18 soren if (msg != NULL)
323 1.1 bjh21 (void)fprintf(stderr, "sort: %s\n", msg);
324 1.15 jdolecek (void)fprintf(stderr, "usage: [-o output] [-cmubdfinrsS] [-t char] ");
325 1.21 jdolecek (void)fprintf(stderr, "[-R char] [-k keydef] ... [files]\n");
326 1.1 bjh21 exit(2);
327 1.26 ross }
328 1.26 ross
329 1.26 ross static void
330 1.26 ross many_files()
331 1.26 ross {
332 1.27 jdolecek #if 0
333 1.26 ross struct rlimit rlp_many_files[1];
334 1.26 ross
335 1.26 ross if (getrlimit(RLIMIT_NOFILE, rlp_many_files) == 0) {
336 1.26 ross rlp_many_files->rlim_cur = rlp_many_files->rlim_max;
337 1.26 ross setrlimit(RLIMIT_NOFILE, rlp_many_files);
338 1.26 ross }
339 1.27 jdolecek #endif
340 1.1 bjh21 }
341