![[BACK]](/icons/back.gif){kind=icon}
Return to paste.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / paste|
Return to paste.c CVS log | Up to [local] / src / usr.bin / paste |
1.21 ! deraadt 1: /* $OpenBSD: paste.c,v 1.20 2015/10/07 14:12:42 deraadt Exp $ */
1.2 deraadt 2:
1.1 deraadt 3: /*
4: * Copyright (c) 1989 The Regents of the University of California.
5: * All rights reserved.
6: *
7: * This code is derived from software contributed to Berkeley by
8: * Adam S. Moskowitz of Menlo Consulting.
9: *
10: * Redistribution and use in source and binary forms, with or without
11: * modification, are permitted provided that the following conditions
12: * are met:
13: * 1. Redistributions of source code must retain the above copyright
14: * notice, this list of conditions and the following disclaimer.
15: * 2. Redistributions in binary form must reproduce the above copyright
16: * notice, this list of conditions and the following disclaimer in the
17: * documentation and/or other materials provided with the distribution.
1.11 millert 18: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 19: * may be used to endorse or promote products derived from this software
20: * without specific prior written permission.
21: *
22: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32: * SUCH DAMAGE.
33: */
34:
1.15 ray 35: #include <sys/queue.h>
1.1 deraadt 36: #include <sys/types.h>
1.13 david 37: #include <err.h>
1.1 deraadt 38: #include <errno.h>
39: #include <limits.h>
40: #include <stdio.h>
1.6 aaron 41: #include <stdlib.h>
1.1 deraadt 42: #include <string.h>
1.6 aaron 43: #include <unistd.h>
1.1 deraadt 44:
45: char *delim;
46: int delimcnt;
47:
1.10 millert 48: int tr(char *);
49: void usage(void);
50: void parallel(char **);
51: void sequential(char **);
1.5 deraadt 52:
53: int
1.12 deraadt 54: main(int argc, char *argv[])
1.1 deraadt 55: {
56: extern char *optarg;
57: extern int optind;
58: int ch, seq;
1.20 deraadt 59:
1.21 ! deraadt 60: if (pledge("stdio rpath", NULL) == -1)
! 61: err(1, "pledge");
1.1 deraadt 62:
63: seq = 0;
1.18 tedu 64: while ((ch = getopt(argc, argv, "d:s")) != -1) {
65: switch (ch) {
1.1 deraadt 66: case 'd':
67: delimcnt = tr(delim = optarg);
68: break;
69: case 's':
70: seq = 1;
71: break;
72: case '?':
73: default:
74: usage();
75: }
1.18 tedu 76: }
1.1 deraadt 77: argc -= optind;
78: argv += optind;
79:
80: if (!delim) {
81: delimcnt = 1;
82: delim = "\t";
83: }
84:
85: if (seq)
86: sequential(argv);
87: else
88: parallel(argv);
89: exit(0);
90: }
91:
1.15 ray 92: struct list {
93: SIMPLEQ_ENTRY(list) entries;
1.1 deraadt 94: FILE *fp;
95: int cnt;
96: char *name;
1.15 ray 97: };
1.1 deraadt 98:
1.5 deraadt 99: void
1.12 deraadt 100: parallel(char **argv)
1.1 deraadt 101: {
1.15 ray 102: SIMPLEQ_HEAD(, list) head = SIMPLEQ_HEAD_INITIALIZER(head);
103: struct list *lp;
1.9 mpech 104: int cnt;
105: char ch, *p;
1.1 deraadt 106: int opencnt, output;
1.7 aaron 107: char *buf, *lbuf;
1.6 aaron 108: size_t len;
1.1 deraadt 109:
1.15 ray 110: for (cnt = 0; (p = *argv); ++argv, ++cnt) {
111: if (!(lp = malloc(sizeof(struct list))))
1.14 mickey 112: err(1, "malloc");
113:
1.1 deraadt 114: if (p[0] == '-' && !p[1])
115: lp->fp = stdin;
1.14 mickey 116: else if (!(lp->fp = fopen(p, "r")))
117: err(1, "%s", p);
1.1 deraadt 118: lp->cnt = cnt;
119: lp->name = p;
1.15 ray 120: SIMPLEQ_INSERT_TAIL(&head, lp, entries);
1.1 deraadt 121: }
122:
123: for (opencnt = cnt; opencnt;) {
1.15 ray 124: output = 0;
125: SIMPLEQ_FOREACH(lp, &head, entries) {
1.8 aaron 126: lbuf = NULL;
1.1 deraadt 127: if (!lp->fp) {
128: if (output && lp->cnt &&
129: (ch = delim[(lp->cnt - 1) % delimcnt]))
130: putchar(ch);
131: continue;
132: }
1.7 aaron 133: if (!(buf = fgetln(lp->fp, &len))) {
1.1 deraadt 134: if (!--opencnt)
135: break;
1.19 tobias 136: if (lp->fp != stdin)
137: (void)fclose(lp->fp);
1.1 deraadt 138: lp->fp = NULL;
139: if (output && lp->cnt &&
140: (ch = delim[(lp->cnt - 1) % delimcnt]))
141: putchar(ch);
142: continue;
143: }
1.18 tedu 144: if (buf[len - 1] == '\n')
145: buf[len - 1] = '\0';
1.6 aaron 146: else {
1.8 aaron 147: if ((lbuf = malloc(len + 1)) == NULL)
1.14 mickey 148: err(1, "malloc");
1.7 aaron 149: memcpy(lbuf, buf, len);
150: lbuf[len] = '\0';
151: buf = lbuf;
1.1 deraadt 152: }
153: /*
154: * make sure that we don't print any delimiters
155: * unless there's a non-empty file.
156: */
157: if (!output) {
158: output = 1;
159: for (cnt = 0; cnt < lp->cnt; ++cnt)
1.5 deraadt 160: if ((ch = delim[cnt % delimcnt]))
1.1 deraadt 161: putchar(ch);
1.5 deraadt 162: } else if ((ch = delim[(lp->cnt - 1) % delimcnt]))
1.1 deraadt 163: putchar(ch);
1.7 aaron 164: (void)printf("%s", buf);
1.8 aaron 165: if (lbuf)
1.7 aaron 166: free(lbuf);
1.1 deraadt 167: }
168: if (output)
169: putchar('\n');
170: }
171: }
172:
1.5 deraadt 173: void
1.12 deraadt 174: sequential(char **argv)
1.1 deraadt 175: {
1.9 mpech 176: FILE *fp;
177: int cnt;
178: char ch, *p, *dp;
1.7 aaron 179: char *buf, *lbuf;
180: size_t len;
1.1 deraadt 181:
1.5 deraadt 182: for (; (p = *argv); ++argv) {
1.8 aaron 183: lbuf = NULL;
1.1 deraadt 184: if (p[0] == '-' && !p[1])
185: fp = stdin;
186: else if (!(fp = fopen(p, "r"))) {
1.14 mickey 187: warn("%s", p);
1.1 deraadt 188: continue;
189: }
1.7 aaron 190: if ((buf = fgetln(fp, &len))) {
1.1 deraadt 191: for (cnt = 0, dp = delim;;) {
1.18 tedu 192: if (buf[len - 1] == '\n')
193: buf[len - 1] = '\0';
1.7 aaron 194: else {
1.8 aaron 195: if ((lbuf = malloc(len + 1)) == NULL)
1.14 mickey 196: err(1, "malloc");
1.7 aaron 197: memcpy(lbuf, buf, len);
198: lbuf[len] = '\0';
199: buf = lbuf;
1.1 deraadt 200: }
201: (void)printf("%s", buf);
1.7 aaron 202: if (!(buf = fgetln(fp, &len)))
1.1 deraadt 203: break;
1.5 deraadt 204: if ((ch = *dp++))
1.1 deraadt 205: putchar(ch);
206: if (++cnt == delimcnt) {
207: dp = delim;
208: cnt = 0;
209: }
210: }
211: putchar('\n');
212: }
213: if (fp != stdin)
214: (void)fclose(fp);
1.8 aaron 215: if (lbuf)
1.7 aaron 216: free(lbuf);
1.1 deraadt 217: }
218: }
219:
1.5 deraadt 220: int
1.12 deraadt 221: tr(char *arg)
1.1 deraadt 222: {
1.9 mpech 223: int cnt;
224: char ch, *p;
1.1 deraadt 225:
1.18 tedu 226: for (p = arg, cnt = 0; (ch = *p++); ++arg, ++cnt) {
227: if (ch == '\\') {
228: switch (ch = *p++) {
1.1 deraadt 229: case 'n':
230: *arg = '\n';
231: break;
232: case 't':
233: *arg = '\t';
234: break;
235: case '0':
236: *arg = '\0';
237: break;
238: default:
239: *arg = ch;
240: break;
1.18 tedu 241: }
1.1 deraadt 242: } else
243: *arg = ch;
1.18 tedu 244: }
1.1 deraadt 245:
1.14 mickey 246: if (!cnt)
247: errx(1, "no delimiters specified");
1.18 tedu 248: return (cnt);
1.1 deraadt 249: }
250:
1.5 deraadt 251: void
1.12 deraadt 252: usage(void)
1.1 deraadt 253: {
1.14 mickey 254: extern char *__progname;
1.16 sobrado 255: (void)fprintf(stderr, "usage: %s [-s] [-d list] file ...\n",
256: __progname);
1.1 deraadt 257: exit(1);
258: }