Annotation of src/usr.bin/paste/paste.c, Revision 1.25
1.25 ! schwarze 1: /* $OpenBSD: paste.c,v 1.24 2018/08/04 16:14:03 schwarze 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 *);
1.25 ! schwarze 49: __dead void usage(void);
1.10 millert 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;
1.23 guenther 79:
80: if (argc == 0)
81: usage();
1.1 deraadt 82:
1.25 ! schwarze 83: if (delim == NULL) {
1.1 deraadt 84: delimcnt = 1;
85: delim = "\t";
86: }
87:
88: if (seq)
89: sequential(argv);
90: else
91: parallel(argv);
1.25 ! schwarze 92: return 0;
1.1 deraadt 93: }
94:
1.15 ray 95: struct list {
96: SIMPLEQ_ENTRY(list) entries;
1.1 deraadt 97: FILE *fp;
98: int cnt;
99: char *name;
1.15 ray 100: };
1.1 deraadt 101:
1.5 deraadt 102: void
1.12 deraadt 103: parallel(char **argv)
1.1 deraadt 104: {
1.15 ray 105: SIMPLEQ_HEAD(, list) head = SIMPLEQ_HEAD_INITIALIZER(head);
106: struct list *lp;
1.24 schwarze 107: char *line, *p;
108: size_t len, linesize;
1.9 mpech 109: int cnt;
1.1 deraadt 110: int opencnt, output;
1.24 schwarze 111: char ch;
1.1 deraadt 112:
1.25 ! schwarze 113: for (cnt = 0; (p = *argv) != NULL; ++argv, ++cnt) {
! 114: if ((lp = malloc(sizeof(*lp))) == NULL)
! 115: err(1, NULL);
1.14 mickey 116:
1.25 ! schwarze 117: if (p[0] == '-' && p[1] == '\0')
1.1 deraadt 118: lp->fp = stdin;
1.25 ! schwarze 119: else if ((lp->fp = fopen(p, "r")) == NULL)
1.14 mickey 120: err(1, "%s", p);
1.1 deraadt 121: lp->cnt = cnt;
122: lp->name = p;
1.15 ray 123: SIMPLEQ_INSERT_TAIL(&head, lp, entries);
1.1 deraadt 124: }
125:
1.24 schwarze 126: line = NULL;
127: linesize = 0;
128:
1.1 deraadt 129: for (opencnt = cnt; opencnt;) {
1.15 ray 130: output = 0;
131: SIMPLEQ_FOREACH(lp, &head, entries) {
1.25 ! schwarze 132: if (lp->fp == NULL) {
1.1 deraadt 133: if (output && lp->cnt &&
134: (ch = delim[(lp->cnt - 1) % delimcnt]))
135: putchar(ch);
136: continue;
137: }
1.24 schwarze 138: if ((len = getline(&line, &linesize, lp->fp)) == -1) {
139: if (ferror(lp->fp))
140: err(1, "%s", lp->fp == stdin ?
141: "getline" : lp->name);
1.25 ! schwarze 142: if (--opencnt == 0)
1.1 deraadt 143: break;
1.19 tobias 144: if (lp->fp != stdin)
1.25 ! schwarze 145: fclose(lp->fp);
1.1 deraadt 146: lp->fp = NULL;
147: if (output && lp->cnt &&
148: (ch = delim[(lp->cnt - 1) % delimcnt]))
149: putchar(ch);
150: continue;
151: }
1.24 schwarze 152: if (line[len - 1] == '\n')
153: line[len - 1] = '\0';
1.1 deraadt 154: /*
155: * make sure that we don't print any delimiters
156: * unless there's a non-empty file.
157: */
158: if (!output) {
159: output = 1;
160: for (cnt = 0; cnt < lp->cnt; ++cnt)
1.5 deraadt 161: if ((ch = delim[cnt % delimcnt]))
1.1 deraadt 162: putchar(ch);
1.5 deraadt 163: } else if ((ch = delim[(lp->cnt - 1) % delimcnt]))
1.1 deraadt 164: putchar(ch);
1.24 schwarze 165: fputs(line, stdout);
1.1 deraadt 166: }
167: if (output)
168: putchar('\n');
169: }
1.24 schwarze 170: free(line);
1.1 deraadt 171: }
172:
1.5 deraadt 173: void
1.12 deraadt 174: sequential(char **argv)
1.1 deraadt 175: {
1.9 mpech 176: FILE *fp;
1.24 schwarze 177: char *line, *p;
178: size_t len, linesize;
1.9 mpech 179: int cnt;
1.1 deraadt 180:
1.24 schwarze 181: line = NULL;
182: linesize = 0;
1.25 ! schwarze 183: for (; (p = *argv) != NULL; ++argv) {
! 184: if (p[0] == '-' && p[1] == '\0')
1.1 deraadt 185: fp = stdin;
1.25 ! schwarze 186: else if ((fp = fopen(p, "r")) == NULL) {
1.14 mickey 187: warn("%s", p);
1.1 deraadt 188: continue;
189: }
1.24 schwarze 190: cnt = -1;
191: while ((len = getline(&line, &linesize, fp)) != -1) {
192: if (line[len - 1] == '\n')
193: line[len - 1] = '\0';
194: if (cnt >= 0)
195: putchar(delim[cnt]);
196: if (++cnt == delimcnt)
197: cnt = 0;
198: fputs(line, stdout);
199: }
200: if (ferror(fp))
201: err(1, "%s", fp == stdin ? "getline" : p);
202: if (cnt >= 0)
1.1 deraadt 203: putchar('\n');
204: if (fp != stdin)
1.25 ! schwarze 205: fclose(fp);
1.1 deraadt 206: }
1.24 schwarze 207: free(line);
1.1 deraadt 208: }
209:
1.5 deraadt 210: int
1.12 deraadt 211: tr(char *arg)
1.1 deraadt 212: {
1.9 mpech 213: int cnt;
214: char ch, *p;
1.1 deraadt 215:
1.25 ! schwarze 216: for (p = arg, cnt = 0; (ch = *p++) != '\0'; ++arg, ++cnt) {
1.18 tedu 217: if (ch == '\\') {
218: switch (ch = *p++) {
1.1 deraadt 219: case 'n':
220: *arg = '\n';
221: break;
222: case 't':
223: *arg = '\t';
224: break;
225: case '0':
226: *arg = '\0';
227: break;
228: default:
229: *arg = ch;
230: break;
1.18 tedu 231: }
1.1 deraadt 232: } else
233: *arg = ch;
1.18 tedu 234: }
1.1 deraadt 235:
1.25 ! schwarze 236: if (cnt == 0)
1.14 mickey 237: errx(1, "no delimiters specified");
1.25 ! schwarze 238: return cnt;
1.1 deraadt 239: }
240:
1.25 ! schwarze 241: __dead void
1.12 deraadt 242: usage(void)
1.1 deraadt 243: {
1.14 mickey 244: extern char *__progname;
1.25 ! schwarze 245: fprintf(stderr, "usage: %s [-s] [-d list] file ...\n", __progname);
1.1 deraadt 246: exit(1);
247: }
![[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