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 #include <err.h> 54 #include <errno.h> 55 #include <limits.h> 56 #include <stdio.h> 57 #include <stdlib.h> 58 #include <string.h> 59 #include <unistd.h> 60 61 char *delim; 62 int delimcnt; 63 64 void parallel(char **); 65 void sequential(char **); 66 int tr(char *); 67 static void usage(void); 68 69 int 70 main(argc, argv) 71 int argc; 72 char **argv; 73 { 74 int ch, seq; 75 76 seq = 0; 77 while ((ch = getopt(argc, argv, "d:s")) != -1) 78 switch(ch) { 79 case 'd': 80 delimcnt = tr(delim = optarg); 81 break; 82 case 's': 83 seq = 1; 84 break; 85 case '?': 86 default: 87 usage(); 88 } 89 argc -= optind; 90 argv += optind; 91 92 if (*argv == NULL) 93 usage(); 94 if (!delim) { 95 delimcnt = 1; 96 delim = "\t"; 97 } 98 99 if (seq) 100 sequential(argv); 101 else 102 parallel(argv); 103 exit(0); 104 } 105 106 typedef struct _list { 107 struct _list *next; 108 FILE *fp; 109 int cnt; 110 char *name; 111 } LIST; 112 113 void 114 parallel(argv) 115 char **argv; 116 { 117 register LIST *lp; 118 register int cnt; 119 register 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(argv) 182 char **argv; 183 { 184 register FILE *fp; 185 register int cnt; 186 register char ch, *p, *dp; 187 char buf[_POSIX2_LINE_MAX + 1]; 188 189 for (; (p = *argv); ++argv) { 190 if (p[0] == '-' && !p[1]) 191 fp = stdin; 192 else if (!(fp = fopen(p, "r"))) { 193 warn("%s", p); 194 continue; 195 } 196 if (fgets(buf, sizeof(buf), fp)) { 197 for (cnt = 0, dp = delim;;) { 198 if (!(p = index(buf, '\n'))) 199 errx(1, "%s: input line too long", *argv); 200 *p = '\0'; 201 (void)printf("%s", buf); 202 if (!fgets(buf, sizeof(buf), fp)) 203 break; 204 if ((ch = *dp++)) 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); 215 } 216 } 217 218 int 219 tr(arg) 220 char *arg; 221 { 222 register int cnt; 223 register char ch, *p; 224 225 for (p = arg, cnt = 0; (ch = *p++); ++arg, ++cnt) 226 if (ch == '\\') 227 switch(ch = *p++) { 228 case 'n': 229 *arg = '\n'; 230 break; 231 case 't': 232 *arg = '\t'; 233 break; 234 case '0': 235 *arg = '\0'; 236 break; 237 default: 238 *arg = ch; 239 break; 240 } else 241 *arg = ch; 242 243 if (!cnt) 244 errx(1, "no delimiters specified"); 245 return(cnt); 246 } 247 248 static void 249 usage() 250 { 251 (void)fprintf(stderr, "usage: paste [-s] [-d delimiters] file ...\n"); 252 exit(1); 253 } 254