1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/* $NetBSD: paste.c,v 1.16 2011/09/06 18:24:43 joerg Exp $ */
/*
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam S. Moskowitz of Menlo Consulting.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#ifndef lint
__COPYRIGHT("@(#) Copyright (c) 1989, 1993\
The Regents of the University of California. All rights reserved.");
#endif /* not lint */
#ifndef lint
/*static char sccsid[] = "from: @(#)paste.c 8.1 (Berkeley) 6/6/93";*/
__RCSID("$NetBSD: paste.c,v 1.16 2011/09/06 18:24:43 joerg Exp $");
#endif /* not lint */
#include <sys/types.h>
#include <err.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
static void parallel(int, char **);
static void sequential(char **);
static int tr(char *);
__dead static void usage(void);
static char dflt_delim[] = "\t";
static char *delim = dflt_delim;
static int delimcnt = 1;
int
main(int argc, char **argv)
{
int ch, seq;
seq = 0;
while ((ch = getopt(argc, argv, "d:s")) != -1) {
switch (ch) {
case 'd':
delim = strdup(optarg);
delimcnt = tr(delim);
break;
case 's':
seq = 1;
break;
case '?':
default:
usage();
}
}
argc -= optind;
argv += optind;
if (seq)
sequential(argv);
else
parallel(argc, argv);
exit(0);
}
static void
parallel(int argc, char **argv)
{
char ch, *dp, *line;
FILE **fpp, *fp;
size_t line_len;
int cnt, output;
fpp = calloc(argc, sizeof *fpp);
if (fpp == NULL)
err(1, "calloc");
for (cnt = 0; cnt < argc; cnt++) {
if (strcmp(argv[cnt], "-") == 0)
fpp[cnt] = stdin;
else if (!(fpp[cnt] = fopen(argv[cnt], "r")))
err(1, "%s", argv[cnt]);
}
for (;;) {
/* Start with the NUL at the end of 'delim' ... */
dp = delim + delimcnt;
output = 0;
for (cnt = 0; cnt < argc; cnt++) {
fp = fpp[cnt];
if (fp == NULL)
continue;
line = fgetln(fp, &line_len);
if (line == NULL) {
/* Assume EOF */
if (fp != stdin)
fclose(fp);
fpp[cnt] = NULL;
continue;
}
/* Output enough separators to catch up */
do {
ch = *dp++;
if (ch)
putchar(ch);
if (dp >= delim + delimcnt)
dp = delim;
} while (++output <= cnt);
/* Remove any trailing newline - check for last line */
if (line[line_len - 1] == '\n')
line_len--;
printf("%.*s", (int)line_len, line);
}
if (!output)
break;
/* Add separators to end of line */
while (++output <= cnt) {
ch = *dp++;
if (ch)
putchar(ch);
if (dp >= delim + delimcnt)
dp = delim;
}
putchar('\n');
}
free(fpp);
}
static void
sequential(char **argv)
{
FILE *fp;
int cnt;
char ch, *p, *dp;
char buf[_POSIX2_LINE_MAX + 1];
for (; (p = *argv) != NULL; ++argv) {
if (p[0] == '-' && !p[1])
fp = stdin;
else if (!(fp = fopen(p, "r"))) {
warn("%s", p);
continue;
}
if (fgets(buf, sizeof(buf), fp)) {
for (cnt = 0, dp = delim;;) {
if (!(p = strchr(buf, '\n')))
err(1, "%s: input line too long.",
*argv);
*p = '\0';
(void)printf("%s", buf);
if (!fgets(buf, sizeof(buf), fp))
break;
if ((ch = *dp++) != 0)
putchar(ch);
if (++cnt == delimcnt) {
dp = delim;
cnt = 0;
}
}
putchar('\n');
}
if (fp != stdin)
(void)fclose(fp);
}
}
static int
tr(char *arg)
{
int cnt;
char ch, *p;
for (p = arg, cnt = 0; (ch = *p++); ++arg, ++cnt)
if (ch == '\\')
switch(ch = *p++) {
case 'n':
*arg = '\n';
break;
case 't':
*arg = '\t';
break;
case '0':
*arg = '\0';
break;
default:
*arg = ch;
break;
} else
*arg = ch;
if (!cnt)
errx(1, "no delimiters specified.");
*arg = '\0';
return(cnt);
}
static void
usage(void)
{
(void)fprintf(stderr, "paste: [-s] [-d delimiters] file ...\n");
exit(1);
}
|
