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