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 int parallel(char **); 66 int 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, rval, 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 rval = sequential(argv); 102 else 103 rval = parallel(argv); 104 exit(rval); 105 } 106 107 typedef struct _list { 108 struct _list *next; 109 FILE *fp; 110 int cnt; 111 char *name; 112 } LIST; 113 114 int 115 parallel(char **argv) 116 { 117 LIST *lp; 118 int cnt; 119 char ch, *buf, *p; 120 LIST *head, *tmp; 121 int opencnt, output; 122 size_t len; 123 124 for (cnt = 0, head = NULL; (p = *argv); ++argv, ++cnt) { 125 if ((lp = malloc(sizeof(LIST))) == NULL) 126 err(1, NULL); 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 ((buf = fgetln(lp->fp, &len)) == NULL) { 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 /* 160 * make sure that we don't print any delimiters 161 * unless there's a non-empty file. 162 */ 163 if (!output) { 164 output = 1; 165 for (cnt = 0; cnt < lp->cnt; ++cnt) 166 if ((ch = delim[cnt % delimcnt])) 167 putchar(ch); 168 } else if ((ch = delim[(lp->cnt - 1) % delimcnt])) 169 putchar(ch); 170 if (buf[len - 1] == '\n') 171 len--; 172 fwrite(buf, 1, len, stdout); 173 } 174 if (output) 175 putchar('\n'); 176 } 177 178 return (0); 179 } 180 181 int 182 sequential(char **argv) 183 { 184 FILE *fp; 185 int cnt, failed, needdelim; 186 char *buf, *p; 187 size_t len; 188 189 failed = 0; 190 for (; (p = *argv); ++argv) { 191 if (p[0] == '-' && !p[1]) 192 fp = stdin; 193 else if (!(fp = fopen(p, "r"))) { 194 warn("%s", p); 195 failed = 1; 196 continue; 197 } 198 cnt = needdelim = 0; 199 while ((buf = fgetln(fp, &len)) != NULL) { 200 if (needdelim) { 201 needdelim = 0; 202 if (delim[cnt] != '\0') 203 putchar(delim[cnt]); 204 if (++cnt == delimcnt) 205 cnt = 0; 206 } 207 if (buf[len - 1] == '\n') 208 len--; 209 fwrite(buf, 1, len, stdout); 210 needdelim = 1; 211 } 212 if (needdelim) 213 putchar('\n'); 214 if (fp != stdin) 215 (void)fclose(fp); 216 } 217 218 return (failed != 0); 219 } 220 221 int 222 tr(char *arg) 223 { 224 int cnt; 225 char ch, *p; 226 227 for (p = arg, cnt = 0; (ch = *p++); ++arg, ++cnt) 228 if (ch == '\\') 229 switch(ch = *p++) { 230 case 'n': 231 *arg = '\n'; 232 break; 233 case 't': 234 *arg = '\t'; 235 break; 236 case '0': 237 *arg = '\0'; 238 break; 239 default: 240 *arg = ch; 241 break; 242 } else 243 *arg = ch; 244 245 if (!cnt) 246 errx(1, "no delimiters specified"); 247 return(cnt); 248 } 249 250 static void 251 usage(void) 252 { 253 (void)fprintf(stderr, "usage: paste [-s] [-d delimiters] file ...\n"); 254 exit(1); 255 } 256