sort.c revision 1.49 1 1.49 dsl /* $NetBSD: sort.c,v 1.49 2009/08/15 09:48:46 dsl Exp $ */
2 1.34 jdolecek
3 1.34 jdolecek /*-
4 1.34 jdolecek * Copyright (c) 2000-2003 The NetBSD Foundation, Inc.
5 1.34 jdolecek * All rights reserved.
6 1.34 jdolecek *
7 1.34 jdolecek * This code is derived from software contributed to The NetBSD Foundation
8 1.34 jdolecek * by Ben Harris and Jaromir Dolecek.
9 1.34 jdolecek *
10 1.34 jdolecek * Redistribution and use in source and binary forms, with or without
11 1.34 jdolecek * modification, are permitted provided that the following conditions
12 1.34 jdolecek * are met:
13 1.34 jdolecek * 1. Redistributions of source code must retain the above copyright
14 1.34 jdolecek * notice, this list of conditions and the following disclaimer.
15 1.34 jdolecek * 2. Redistributions in binary form must reproduce the above copyright
16 1.34 jdolecek * notice, this list of conditions and the following disclaimer in the
17 1.34 jdolecek * documentation and/or other materials provided with the distribution.
18 1.34 jdolecek *
19 1.34 jdolecek * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.34 jdolecek * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.34 jdolecek * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.34 jdolecek * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.34 jdolecek * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.34 jdolecek * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.34 jdolecek * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.34 jdolecek * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.34 jdolecek * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.34 jdolecek * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.34 jdolecek * POSSIBILITY OF SUCH DAMAGE.
30 1.34 jdolecek */
31 1.2 bjh21
32 1.1 bjh21 /*-
33 1.1 bjh21 * Copyright (c) 1993
34 1.1 bjh21 * The Regents of the University of California. All rights reserved.
35 1.1 bjh21 *
36 1.1 bjh21 * This code is derived from software contributed to Berkeley by
37 1.1 bjh21 * Peter McIlroy.
38 1.1 bjh21 *
39 1.1 bjh21 * Redistribution and use in source and binary forms, with or without
40 1.1 bjh21 * modification, are permitted provided that the following conditions
41 1.1 bjh21 * are met:
42 1.1 bjh21 * 1. Redistributions of source code must retain the above copyright
43 1.1 bjh21 * notice, this list of conditions and the following disclaimer.
44 1.1 bjh21 * 2. Redistributions in binary form must reproduce the above copyright
45 1.1 bjh21 * notice, this list of conditions and the following disclaimer in the
46 1.1 bjh21 * documentation and/or other materials provided with the distribution.
47 1.33 agc * 3. Neither the name of the University nor the names of its contributors
48 1.1 bjh21 * may be used to endorse or promote products derived from this software
49 1.1 bjh21 * without specific prior written permission.
50 1.1 bjh21 *
51 1.1 bjh21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52 1.1 bjh21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53 1.1 bjh21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54 1.1 bjh21 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55 1.1 bjh21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56 1.1 bjh21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57 1.1 bjh21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58 1.1 bjh21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59 1.1 bjh21 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60 1.1 bjh21 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 1.1 bjh21 * SUCH DAMAGE.
62 1.1 bjh21 */
63 1.1 bjh21
64 1.1 bjh21 /* Sort sorts a file using an optional user-defined key.
65 1.1 bjh21 * Sort uses radix sort for internal sorting, and allows
66 1.1 bjh21 * a choice of merge sort and radix sort for external sorting.
67 1.1 bjh21 */
68 1.1 bjh21
69 1.1 bjh21 #include "sort.h"
70 1.1 bjh21 #include "fsort.h"
71 1.1 bjh21 #include "pathnames.h"
72 1.1 bjh21
73 1.2 bjh21 #ifndef lint
74 1.46 lukem __COPYRIGHT("@(#) Copyright (c) 1993\
75 1.46 lukem The Regents of the University of California. All rights reserved.");
76 1.2 bjh21 #endif /* not lint */
77 1.2 bjh21
78 1.2 bjh21 #ifndef lint
79 1.49 dsl __RCSID("$NetBSD: sort.c,v 1.49 2009/08/15 09:48:46 dsl Exp $");
80 1.2 bjh21 __SCCSID("@(#)sort.c 8.1 (Berkeley) 6/6/93");
81 1.2 bjh21 #endif /* not lint */
82 1.2 bjh21
83 1.26 ross #include <sys/types.h>
84 1.26 ross #include <sys/time.h>
85 1.26 ross #include <sys/resource.h>
86 1.26 ross
87 1.1 bjh21 #include <paths.h>
88 1.1 bjh21 #include <signal.h>
89 1.1 bjh21 #include <stdlib.h>
90 1.1 bjh21 #include <string.h>
91 1.1 bjh21 #include <unistd.h>
92 1.11 jdolecek #include <locale.h>
93 1.1 bjh21
94 1.1 bjh21 int REC_D = '\n';
95 1.1 bjh21 u_char d_mask[NBINS]; /* flags for rec_d, field_d, <blank> */
96 1.30 jdolecek
97 1.1 bjh21 /*
98 1.1 bjh21 * weight tables. Gweights is one of ascii, Rascii..
99 1.1 bjh21 * modified to weight rec_d = 0 (or 255)
100 1.1 bjh21 */
101 1.1 bjh21 u_char ascii[NBINS], Rascii[NBINS], RFtable[NBINS], Ftable[NBINS];
102 1.1 bjh21 int SINGL_FLD = 0, SEP_FLAG = 0, UNIQUE = 0;
103 1.1 bjh21
104 1.9 jdolecek /*
105 1.9 jdolecek * Default to stable sort.
106 1.9 jdolecek */
107 1.9 jdolecek int stable_sort = 1;
108 1.9 jdolecek
109 1.30 jdolecek static char toutpath[MAXPATHLEN];
110 1.10 jdolecek
111 1.22 jdolecek const char *tmpdir; /* where temporary files should be put */
112 1.22 jdolecek
113 1.49 dsl static void cleanup(void);
114 1.49 dsl static void onsignal(int);
115 1.49 dsl static void usage(const char *);
116 1.1 bjh21
117 1.49 dsl int main(int argc, char **argv);
118 1.2 bjh21
119 1.1 bjh21 int
120 1.49 dsl main(int argc, char *argv[])
121 1.1 bjh21 {
122 1.13 jdolecek get_func_t get;
123 1.1 bjh21 int ch, i, stdinflag = 0, tmp = 0;
124 1.6 bjh21 char cflag = 0, mflag = 0;
125 1.1 bjh21 char *outfile, *outpath = 0;
126 1.39 jdolecek struct field *fldtab, *p;
127 1.39 jdolecek size_t fldtab_sz = 3, fidx = 0;
128 1.13 jdolecek struct filelist filelist;
129 1.3 bjh21 FILE *outfp = NULL;
130 1.31 jdolecek struct rlimit rl;
131 1.43 jdolecek struct stat st;
132 1.10 jdolecek
133 1.11 jdolecek setlocale(LC_ALL, "");
134 1.11 jdolecek
135 1.31 jdolecek /* bump RLIMIT_NOFILE to maximum our hard limit allows */
136 1.31 jdolecek if (getrlimit(RLIMIT_NOFILE, &rl) < 0)
137 1.31 jdolecek err(2, "getrlimit");
138 1.31 jdolecek rl.rlim_cur = rl.rlim_max;
139 1.31 jdolecek if (setrlimit(RLIMIT_NOFILE, &rl) < 0)
140 1.31 jdolecek err(2, "setrlimit");
141 1.31 jdolecek
142 1.1 bjh21 d_mask[REC_D = '\n'] = REC_D_F;
143 1.1 bjh21 d_mask['\t'] = d_mask[' '] = BLANK | FLD_D;
144 1.35 jdolecek
145 1.36 itojun fldtab = malloc(fldtab_sz * sizeof(*fldtab));
146 1.36 itojun memset(fldtab, 0, fldtab_sz * sizeof(*fldtab));
147 1.10 jdolecek
148 1.1 bjh21 fixit(&argc, argv);
149 1.35 jdolecek
150 1.22 jdolecek if (!(tmpdir = getenv("TMPDIR")))
151 1.22 jdolecek tmpdir = _PATH_TMP;
152 1.10 jdolecek
153 1.21 jdolecek while ((ch = getopt(argc, argv, "bcdfik:mHno:rR:sSt:T:ux")) != -1) {
154 1.10 jdolecek switch (ch) {
155 1.11 jdolecek case 'b':
156 1.11 jdolecek fldtab->flags |= BI | BT;
157 1.11 jdolecek break;
158 1.11 jdolecek case 'c':
159 1.11 jdolecek cflag = 1;
160 1.1 bjh21 break;
161 1.11 jdolecek case 'd': case 'f': case 'i': case 'n': case 'r':
162 1.11 jdolecek tmp |= optval(ch, 0);
163 1.15 jdolecek if ((tmp & R) && (tmp & F))
164 1.1 bjh21 fldtab->weights = RFtable;
165 1.1 bjh21 else if (tmp & F)
166 1.1 bjh21 fldtab->weights = Ftable;
167 1.15 jdolecek else if (tmp & R)
168 1.1 bjh21 fldtab->weights = Rascii;
169 1.1 bjh21 fldtab->flags |= tmp;
170 1.1 bjh21 break;
171 1.11 jdolecek case 'H':
172 1.11 jdolecek PANIC = 0;
173 1.11 jdolecek break;
174 1.11 jdolecek case 'k':
175 1.37 itojun p = realloc(fldtab, (fldtab_sz + 1) * sizeof(*fldtab));
176 1.37 itojun if (!p)
177 1.37 itojun err(1, "realloc");
178 1.37 itojun fldtab = p;
179 1.37 itojun memset(&fldtab[fldtab_sz], 0,
180 1.37 itojun sizeof(fldtab[fldtab_sz]));
181 1.35 jdolecek fldtab_sz++;
182 1.35 jdolecek
183 1.39 jdolecek setfield(optarg, &fldtab[++fidx], fldtab->flags);
184 1.11 jdolecek break;
185 1.11 jdolecek case 'm':
186 1.11 jdolecek mflag = 1;
187 1.11 jdolecek break;
188 1.1 bjh21 case 'o':
189 1.1 bjh21 outpath = optarg;
190 1.1 bjh21 break;
191 1.9 jdolecek case 's':
192 1.9 jdolecek /* for GNU sort compatibility (this is our default) */
193 1.9 jdolecek stable_sort = 1;
194 1.9 jdolecek break;
195 1.9 jdolecek case 'S':
196 1.9 jdolecek stable_sort = 0;
197 1.1 bjh21 break;
198 1.1 bjh21 case 't':
199 1.1 bjh21 if (SEP_FLAG)
200 1.1 bjh21 usage("multiple field delimiters");
201 1.1 bjh21 SEP_FLAG = 1;
202 1.1 bjh21 d_mask[' '] &= ~FLD_D;
203 1.1 bjh21 d_mask['\t'] &= ~FLD_D;
204 1.2 bjh21 d_mask[(u_char)*optarg] |= FLD_D;
205 1.2 bjh21 if (d_mask[(u_char)*optarg] & REC_D_F)
206 1.19 jdolecek errx(2, "record/field delimiter clash");
207 1.1 bjh21 break;
208 1.21 jdolecek case 'R':
209 1.1 bjh21 if (REC_D != '\n')
210 1.1 bjh21 usage("multiple record delimiters");
211 1.1 bjh21 if ('\n' == (REC_D = *optarg))
212 1.1 bjh21 break;
213 1.47 christos if (optarg[1] != '\0') {
214 1.47 christos char *ep;
215 1.47 christos int t = 0;
216 1.47 christos if (optarg[0] == '\\')
217 1.47 christos optarg++, t = 8;
218 1.47 christos REC_D = (int)strtol(optarg, &ep, t);
219 1.47 christos if (*ep != '\0' || REC_D < 0 ||
220 1.48 lukem REC_D >= (int)__arraycount(d_mask))
221 1.47 christos errx(2, "invalid record delimiter %s",
222 1.47 christos optarg);
223 1.47 christos }
224 1.1 bjh21 d_mask['\n'] = d_mask[' '];
225 1.1 bjh21 d_mask[REC_D] = REC_D_F;
226 1.1 bjh21 break;
227 1.21 jdolecek case 'T':
228 1.23 jdolecek /* -T tmpdir */
229 1.23 jdolecek tmpdir = optarg;
230 1.21 jdolecek break;
231 1.1 bjh21 case 'u':
232 1.1 bjh21 UNIQUE = 1;
233 1.1 bjh21 break;
234 1.1 bjh21 case '?':
235 1.10 jdolecek default:
236 1.17 soren usage(NULL);
237 1.1 bjh21 }
238 1.1 bjh21 }
239 1.1 bjh21 if (cflag && argc > optind+1)
240 1.1 bjh21 errx(2, "too many input files for -c option");
241 1.1 bjh21 if (argc - 2 > optind && !strcmp(argv[argc-2], "-o")) {
242 1.1 bjh21 outpath = argv[argc-1];
243 1.1 bjh21 argc -= 2;
244 1.1 bjh21 }
245 1.1 bjh21 if (mflag && argc - optind > (MAXFCT - (16+1))*16)
246 1.1 bjh21 errx(2, "too many input files for -m option");
247 1.1 bjh21 for (i = optind; i < argc; i++) {
248 1.1 bjh21 /* allow one occurrence of /dev/stdin */
249 1.10 jdolecek if (!strcmp(argv[i], "-") || !strcmp(argv[i], _PATH_STDIN)) {
250 1.1 bjh21 if (stdinflag)
251 1.1 bjh21 warnx("ignoring extra \"%s\" in file list",
252 1.1 bjh21 argv[i]);
253 1.10 jdolecek else
254 1.1 bjh21 stdinflag = 1;
255 1.14 jdolecek
256 1.14 jdolecek /* change to /dev/stdin if '-' */
257 1.14 jdolecek if (argv[i][0] == '-')
258 1.48 lukem argv[i] = __UNCONST(_PATH_STDIN);
259 1.14 jdolecek
260 1.2 bjh21 } else if ((ch = access(argv[i], R_OK)))
261 1.7 thorpej err(2, "%s", argv[i]);
262 1.1 bjh21 }
263 1.6 bjh21 if (!(fldtab->flags & (I|D|N) || fldtab[1].icol.num)) {
264 1.1 bjh21 SINGL_FLD = 1;
265 1.1 bjh21 fldtab[0].icol.num = 1;
266 1.1 bjh21 } else {
267 1.1 bjh21 if (!fldtab[1].icol.num) {
268 1.1 bjh21 fldtab[0].flags &= ~(BI|BT);
269 1.39 jdolecek setfield("1", &fldtab[++fidx], fldtab->flags);
270 1.1 bjh21 }
271 1.1 bjh21 fldreset(fldtab);
272 1.1 bjh21 fldtab[0].flags &= ~F;
273 1.1 bjh21 }
274 1.1 bjh21 settables(fldtab[0].flags);
275 1.1 bjh21 num_init();
276 1.1 bjh21 fldtab->weights = gweights;
277 1.5 bjh21 if (optind == argc) {
278 1.10 jdolecek static const char * const names[] = { _PATH_STDIN, NULL };
279 1.5 bjh21
280 1.5 bjh21 filelist.names = names;
281 1.5 bjh21 optind--;
282 1.5 bjh21 } else
283 1.10 jdolecek filelist.names = (const char * const *) &argv[optind];
284 1.15 jdolecek
285 1.1 bjh21 if (SINGL_FLD)
286 1.1 bjh21 get = makeline;
287 1.1 bjh21 else
288 1.1 bjh21 get = makekey;
289 1.15 jdolecek
290 1.1 bjh21 if (cflag) {
291 1.13 jdolecek order(&filelist, get, fldtab);
292 1.1 bjh21 /* NOT REACHED */
293 1.1 bjh21 }
294 1.1 bjh21 if (!outpath) {
295 1.43 jdolecek toutpath[0] = '\0'; /* path not used in this case */
296 1.1 bjh21 outfile = outpath = toutpath;
297 1.24 christos outfp = stdout;
298 1.43 jdolecek } else if (lstat(outpath, &st) == 0
299 1.43 jdolecek && !S_ISCHR(st.st_mode) && !S_ISBLK(st.st_mode)) {
300 1.43 jdolecek /* output file exists and isn't character or block device */
301 1.29 tron struct sigaction act;
302 1.24 christos static const int sigtable[] = {SIGHUP, SIGINT, SIGPIPE,
303 1.24 christos SIGXCPU, SIGXFSZ, SIGVTALRM, SIGPROF, 0};
304 1.3 bjh21 int outfd;
305 1.1 bjh21 errno = 0;
306 1.1 bjh21 if (access(outpath, W_OK))
307 1.1 bjh21 err(2, "%s", outpath);
308 1.24 christos (void)snprintf(toutpath, sizeof(toutpath), "%sXXXXXX",
309 1.24 christos outpath);
310 1.25 christos if ((outfd = mkstemp(toutpath)) == -1)
311 1.25 christos err(2, "Cannot create temporary file `%s'", toutpath);
312 1.25 christos if ((outfp = fdopen(outfd, "w")) == NULL)
313 1.25 christos err(2, "Cannot open temporary file `%s'", toutpath);
314 1.3 bjh21 outfile = toutpath;
315 1.1 bjh21 (void)atexit(cleanup);
316 1.29 tron act.sa_handler = onsignal;
317 1.29 tron (void) sigemptyset(&act.sa_mask);
318 1.29 tron act.sa_flags = SA_RESTART | SA_RESETHAND;
319 1.1 bjh21 for (i = 0; sigtable[i]; ++i) /* always unlink toutpath */
320 1.1 bjh21 sigaction(sigtable[i], &act, 0);
321 1.43 jdolecek } else {
322 1.3 bjh21 outfile = outpath;
323 1.13 jdolecek
324 1.43 jdolecek if ((outfp = fopen(outfile, "w")) == NULL)
325 1.43 jdolecek err(2, "output file %s", outfile);
326 1.43 jdolecek }
327 1.13 jdolecek
328 1.13 jdolecek if (mflag) {
329 1.13 jdolecek fmerge(-1, 0, &filelist, argc-optind, get, outfp, putline,
330 1.13 jdolecek fldtab);
331 1.13 jdolecek } else
332 1.13 jdolecek fsort(-1, 0, 0, &filelist, argc-optind, outfp, fldtab);
333 1.13 jdolecek
334 1.1 bjh21 if (outfile != outpath) {
335 1.42 jdolecek if (access(outfile, F_OK))
336 1.7 thorpej err(2, "%s", outfile);
337 1.44 jdolecek
338 1.44 jdolecek /*
339 1.44 jdolecek * Copy file permissions bits of the original file.
340 1.44 jdolecek * st is initialized above, when we create the
341 1.44 jdolecek * temporary spool file.
342 1.44 jdolecek */
343 1.44 jdolecek if (lchmod(outfile, st.st_mode & ALLPERMS) != 0) {
344 1.44 jdolecek err(2, "cannot chmod %s: output left in %s",
345 1.44 jdolecek outpath, outfile);
346 1.44 jdolecek }
347 1.44 jdolecek
348 1.1 bjh21 (void)unlink(outpath);
349 1.1 bjh21 if (link(outfile, outpath))
350 1.1 bjh21 err(2, "cannot link %s: output left in %s",
351 1.1 bjh21 outpath, outfile);
352 1.1 bjh21 (void)unlink(outfile);
353 1.1 bjh21 }
354 1.1 bjh21 exit(0);
355 1.1 bjh21 }
356 1.1 bjh21
357 1.1 bjh21 static void
358 1.49 dsl onsignal(int sig)
359 1.1 bjh21 {
360 1.1 bjh21 cleanup();
361 1.1 bjh21 }
362 1.1 bjh21
363 1.1 bjh21 static void
364 1.49 dsl cleanup(void)
365 1.1 bjh21 {
366 1.1 bjh21 if (toutpath[0])
367 1.1 bjh21 (void)unlink(toutpath);
368 1.1 bjh21 }
369 1.1 bjh21
370 1.1 bjh21 static void
371 1.49 dsl usage(const char *msg)
372 1.1 bjh21 {
373 1.18 soren if (msg != NULL)
374 1.47 christos (void)fprintf(stderr, "%s: %s\n", getprogname(), msg);
375 1.41 wiz (void)fprintf(stderr,
376 1.41 wiz "usage: %s [-bcdfHimnrSsu] [-k field1[,field2]] [-o output]"
377 1.41 wiz " [-R char] [-T dir]", getprogname());
378 1.41 wiz (void)fprintf(stderr,
379 1.41 wiz " [-t char] [file ...]\n");
380 1.1 bjh21 exit(2);
381 1.1 bjh21 }
382