split.c revision 1.10 1 1.10 bjh21 /* $NetBSD: split.c,v 1.10 2003/06/10 16:32:54 bjh21 Exp $ */
2 1.4 jtc
3 1.1 cgd /*
4 1.4 jtc * Copyright (c) 1987, 1993, 1994
5 1.4 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.6 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.6 lukem __COPYRIGHT("@(#) Copyright (c) 1987, 1993, 1994\n\
39 1.6 lukem The Regents of the University of California. All rights reserved.\n");
40 1.1 cgd #endif /* not lint */
41 1.1 cgd
42 1.1 cgd #ifndef lint
43 1.4 jtc #if 0
44 1.5 jtc static char sccsid[] = "@(#)split.c 8.3 (Berkeley) 4/25/94";
45 1.4 jtc #endif
46 1.10 bjh21 __RCSID("$NetBSD: split.c,v 1.10 2003/06/10 16:32:54 bjh21 Exp $");
47 1.1 cgd #endif /* not lint */
48 1.1 cgd
49 1.1 cgd #include <sys/param.h>
50 1.4 jtc
51 1.4 jtc #include <ctype.h>
52 1.4 jtc #include <err.h>
53 1.4 jtc #include <fcntl.h>
54 1.1 cgd #include <stdio.h>
55 1.4 jtc #include <stdlib.h>
56 1.4 jtc #include <string.h>
57 1.4 jtc #include <unistd.h>
58 1.4 jtc
59 1.9 christos #define DEFLINE 1000 /* Default num lines per file. */
60 1.4 jtc
61 1.9 christos static int file_open; /* If a file open. */
62 1.9 christos static int ifd = -1, ofd = -1; /* Input/output file descriptors. */
63 1.9 christos static char fname[MAXPATHLEN]; /* File name prefix. */
64 1.10 bjh21 static int sfxlen = 2; /* suffix length. */
65 1.9 christos
66 1.9 christos int main(int, char **);
67 1.9 christos static void newfile(void);
68 1.9 christos static void split1(unsigned long long);
69 1.9 christos static void split2(unsigned long long);
70 1.9 christos static void usage(void) __attribute__((__noreturn__));
71 1.9 christos static unsigned long long bigwrite __P((int, const void *, unsigned long long));
72 1.1 cgd
73 1.4 jtc int
74 1.9 christos main(int argc, char *argv[])
75 1.1 cgd {
76 1.4 jtc int ch;
77 1.4 jtc char *ep, *p;
78 1.9 christos unsigned long long bytecnt = 0; /* Byte count to split on. */
79 1.9 christos unsigned long long numlines = 0;/* Line count to split on. */
80 1.4 jtc
81 1.10 bjh21 while ((ch = getopt(argc, argv, "-0123456789b:l:a:")) != -1)
82 1.4 jtc switch (ch) {
83 1.4 jtc case '0': case '1': case '2': case '3': case '4':
84 1.4 jtc case '5': case '6': case '7': case '8': case '9':
85 1.4 jtc /*
86 1.4 jtc * Undocumented kludge: split was originally designed
87 1.4 jtc * to take a number after a dash.
88 1.4 jtc */
89 1.4 jtc if (numlines == 0) {
90 1.4 jtc p = argv[optind - 1];
91 1.4 jtc if (p[0] == '-' && p[1] == ch && !p[2])
92 1.4 jtc numlines = strtol(++p, &ep, 10);
93 1.4 jtc else
94 1.4 jtc numlines =
95 1.4 jtc strtol(argv[optind] + 1, &ep, 10);
96 1.4 jtc if (numlines <= 0 || *ep)
97 1.4 jtc errx(1,
98 1.4 jtc "%s: illegal line count.", optarg);
99 1.1 cgd }
100 1.4 jtc break;
101 1.4 jtc case '-': /* Undocumented: historic stdin flag. */
102 1.4 jtc if (ifd != -1)
103 1.4 jtc usage();
104 1.4 jtc ifd = 0;
105 1.4 jtc break;
106 1.4 jtc case 'b': /* Byte count. */
107 1.9 christos if ((bytecnt = strtoull(optarg, &ep, 10)) <= 0 ||
108 1.6 lukem (*ep != '\0' && *ep != 'k' && *ep != 'm'))
109 1.4 jtc errx(1, "%s: illegal byte count.", optarg);
110 1.4 jtc if (*ep == 'k')
111 1.4 jtc bytecnt *= 1024;
112 1.4 jtc else if (*ep == 'm')
113 1.9 christos bytecnt *= 1024 * 1024;
114 1.4 jtc break;
115 1.4 jtc case 'l': /* Line count. */
116 1.4 jtc if (numlines != 0)
117 1.4 jtc usage();
118 1.9 christos if ((numlines = strtoull(optarg, &ep, 10)) <= 0 || *ep)
119 1.4 jtc errx(1, "%s: illegal line count.", optarg);
120 1.4 jtc break;
121 1.10 bjh21 case 'a': /* Suffix length. */
122 1.10 bjh21 if ((sfxlen = strtol(optarg, &ep, 10)) <= 0 || *ep)
123 1.10 bjh21 errx(1, "%s: illegal suffix length.", optarg);
124 1.10 bjh21 break;
125 1.4 jtc default:
126 1.4 jtc usage();
127 1.4 jtc }
128 1.4 jtc argv += optind;
129 1.4 jtc argc -= optind;
130 1.4 jtc
131 1.4 jtc if (*argv != NULL)
132 1.4 jtc if (ifd == -1) { /* Input file. */
133 1.4 jtc if ((ifd = open(*argv, O_RDONLY, 0)) < 0)
134 1.4 jtc err(1, "%s", *argv);
135 1.4 jtc ++argv;
136 1.1 cgd }
137 1.10 bjh21
138 1.10 bjh21 if (*argv != NULL) {
139 1.10 bjh21 if (strlen(*argv) + sfxlen > NAME_MAX)
140 1.10 bjh21 errx(EXIT_FAILURE, "Output file name too long");
141 1.10 bjh21 (void)strcpy(fname, *argv++); /* File name prefix. */
142 1.10 bjh21 } else {
143 1.10 bjh21 if (1 + sfxlen > NAME_MAX)
144 1.10 bjh21 errx(EXIT_FAILURE, "Output file name too long");
145 1.10 bjh21 }
146 1.10 bjh21
147 1.4 jtc if (*argv != NULL)
148 1.4 jtc usage();
149 1.4 jtc
150 1.4 jtc if (numlines == 0)
151 1.4 jtc numlines = DEFLINE;
152 1.4 jtc else if (bytecnt)
153 1.4 jtc usage();
154 1.4 jtc
155 1.4 jtc if (ifd == -1) /* Stdin by default. */
156 1.1 cgd ifd = 0;
157 1.4 jtc
158 1.4 jtc if (bytecnt) {
159 1.9 christos split1(bytecnt);
160 1.9 christos } else {
161 1.9 christos split2(numlines);
162 1.4 jtc }
163 1.9 christos return 0;
164 1.1 cgd }
165 1.1 cgd
166 1.1 cgd /*
167 1.1 cgd * split1 --
168 1.4 jtc * Split the input by bytes.
169 1.1 cgd */
170 1.9 christos static void
171 1.9 christos split1(unsigned long long bytecnt)
172 1.1 cgd {
173 1.9 christos unsigned long long bcnt, dist;
174 1.9 christos ssize_t len;
175 1.4 jtc char *C;
176 1.9 christos char bfr[MAXBSIZE];
177 1.1 cgd
178 1.1 cgd for (bcnt = 0;;)
179 1.4 jtc switch (len = read(ifd, bfr, MAXBSIZE)) {
180 1.1 cgd case 0:
181 1.4 jtc exit(0);
182 1.4 jtc case -1:
183 1.4 jtc err(1, "read");
184 1.4 jtc /* NOTREACHED */
185 1.1 cgd default:
186 1.1 cgd if (!file_open) {
187 1.1 cgd newfile();
188 1.4 jtc file_open = 1;
189 1.1 cgd }
190 1.1 cgd if (bcnt + len >= bytecnt) {
191 1.1 cgd dist = bytecnt - bcnt;
192 1.9 christos if (bigwrite(ofd, bfr, dist) != dist)
193 1.4 jtc err(1, "write");
194 1.1 cgd len -= dist;
195 1.4 jtc for (C = bfr + dist; len >= bytecnt;
196 1.4 jtc len -= bytecnt, C += bytecnt) {
197 1.1 cgd newfile();
198 1.9 christos if (bigwrite(ofd,
199 1.4 jtc C, (int)bytecnt) != bytecnt)
200 1.4 jtc err(1, "write");
201 1.1 cgd }
202 1.1 cgd if (len) {
203 1.1 cgd newfile();
204 1.9 christos if (bigwrite(ofd, C, len) != len)
205 1.4 jtc err(1, "write");
206 1.4 jtc } else
207 1.4 jtc file_open = 0;
208 1.1 cgd bcnt = len;
209 1.4 jtc } else {
210 1.1 cgd bcnt += len;
211 1.9 christos if (bigwrite(ofd, bfr, len) != len)
212 1.4 jtc err(1, "write");
213 1.1 cgd }
214 1.1 cgd }
215 1.1 cgd }
216 1.1 cgd
217 1.1 cgd /*
218 1.1 cgd * split2 --
219 1.4 jtc * Split the input by lines.
220 1.1 cgd */
221 1.9 christos static void
222 1.9 christos split2(unsigned long long numlines)
223 1.1 cgd {
224 1.9 christos unsigned long long lcnt, bcnt;
225 1.9 christos ssize_t len;
226 1.4 jtc char *Ce, *Cs;
227 1.9 christos char bfr[MAXBSIZE];
228 1.1 cgd
229 1.1 cgd for (lcnt = 0;;)
230 1.4 jtc switch (len = read(ifd, bfr, MAXBSIZE)) {
231 1.1 cgd case 0:
232 1.1 cgd exit(0);
233 1.4 jtc case -1:
234 1.4 jtc err(1, "read");
235 1.4 jtc /* NOTREACHED */
236 1.1 cgd default:
237 1.1 cgd if (!file_open) {
238 1.1 cgd newfile();
239 1.4 jtc file_open = 1;
240 1.1 cgd }
241 1.1 cgd for (Cs = Ce = bfr; len--; Ce++)
242 1.1 cgd if (*Ce == '\n' && ++lcnt == numlines) {
243 1.1 cgd bcnt = Ce - Cs + 1;
244 1.9 christos if (bigwrite(ofd, Cs, bcnt) != bcnt)
245 1.4 jtc err(1, "write");
246 1.1 cgd lcnt = 0;
247 1.1 cgd Cs = Ce + 1;
248 1.1 cgd if (len)
249 1.1 cgd newfile();
250 1.1 cgd else
251 1.4 jtc file_open = 0;
252 1.1 cgd }
253 1.1 cgd if (Cs < Ce) {
254 1.1 cgd bcnt = Ce - Cs;
255 1.9 christos if (bigwrite(ofd, Cs, bcnt) != bcnt)
256 1.4 jtc err(1, "write");
257 1.1 cgd }
258 1.1 cgd }
259 1.1 cgd }
260 1.1 cgd
261 1.1 cgd /*
262 1.1 cgd * newfile --
263 1.4 jtc * Open a new output file.
264 1.1 cgd */
265 1.9 christos static void
266 1.9 christos newfile(void)
267 1.1 cgd {
268 1.9 christos static int fnum;
269 1.4 jtc static int defname;
270 1.1 cgd static char *fpnt;
271 1.10 bjh21 int quot, i;
272 1.1 cgd
273 1.4 jtc if (ofd == -1) {
274 1.4 jtc if (fname[0] == '\0') {
275 1.1 cgd fname[0] = 'x';
276 1.1 cgd fpnt = fname + 1;
277 1.4 jtc defname = 1;
278 1.4 jtc } else {
279 1.4 jtc fpnt = fname + strlen(fname);
280 1.4 jtc defname = 0;
281 1.1 cgd }
282 1.1 cgd ofd = fileno(stdout);
283 1.1 cgd }
284 1.1 cgd /*
285 1.4 jtc * Hack to increase max files; original code wandered through
286 1.1 cgd * magic characters. Maximum files is 3 * 26 * 26 == 2028
287 1.1 cgd */
288 1.10 bjh21 fpnt[sfxlen] = '\0';
289 1.10 bjh21 quot = fnum;
290 1.10 bjh21 for (i = sfxlen - 1; i >= 0; i--) {
291 1.10 bjh21 fpnt[i] = quot % 26 + 'a';
292 1.10 bjh21 quot = quot / 26;
293 1.10 bjh21 }
294 1.10 bjh21 if (quot > 0) {
295 1.4 jtc if (!defname || fname[0] == 'z')
296 1.4 jtc errx(1, "too many files.");
297 1.1 cgd ++fname[0];
298 1.1 cgd fnum = 0;
299 1.1 cgd }
300 1.1 cgd ++fnum;
301 1.4 jtc if (!freopen(fname, "w", stdout))
302 1.4 jtc err(1, "%s", fname);
303 1.1 cgd }
304 1.1 cgd
305 1.9 christos static unsigned long long
306 1.9 christos bigwrite(int fd, const void *buf, unsigned long long len)
307 1.9 christos {
308 1.9 christos const char *ptr = buf;
309 1.9 christos unsigned long long sofar = 0;
310 1.9 christos
311 1.9 christos while (len != 0) {
312 1.9 christos ssize_t w, nw = (len > INT_MAX) ? INT_MAX : (ssize_t)len;
313 1.9 christos if ((w = write(fd, ptr, nw)) == -1)
314 1.9 christos return sofar;
315 1.9 christos len -= w;
316 1.9 christos ptr += w;
317 1.9 christos sofar += w;
318 1.9 christos }
319 1.9 christos return sofar;
320 1.9 christos }
321 1.9 christos
322 1.9 christos
323 1.9 christos static void
324 1.9 christos usage(void)
325 1.1 cgd {
326 1.4 jtc (void)fprintf(stderr,
327 1.10 bjh21 "Usage: %s [-b byte_count] [-l line_count] [-a suffix_length] "
328 1.10 bjh21 "[file [prefix]]\n", getprogname());
329 1.1 cgd exit(1);
330 1.1 cgd }
331