1 /*- 2 * Copyright (c) 1980, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #include <sys/cdefs.h> 35 36 __FBSDID("$FreeBSD: src/usr.bin/unexpand/unexpand.c,v 1.5.2.3 2002/10/11 11:33:23 tjr Exp $"); 37 38 #ifndef lint 39 static const char copyright[] = 40 "@(#) Copyright (c) 1980, 1993\n\ 41 The Regents of the University of California. All rights reserved.\n"; 42 #endif 43 44 #ifndef lint 45 static const char sccsid[] = "@(#)unexpand.c 8.1 (Berkeley) 6/6/93"; 46 #endif 47 48 /* 49 * unexpand - put tabs into a file replacing blanks 50 */ 51 #include <ctype.h> 52 #include <err.h> 53 #include <limits.h> 54 #include <locale.h> 55 #include <stdio.h> 56 #include <stdlib.h> 57 #include <string.h> 58 #include <unistd.h> 59 60 int all; 61 int nstops; 62 int tabstops[100]; 63 64 static void getstops(const char *); 65 static void usage(void); 66 static void tabify(void); 67 68 int 69 main(argc, argv) 70 int argc; 71 char *argv[]; 72 { 73 int ch, failed; 74 char *filename; 75 76 setlocale(LC_CTYPE, ""); 77 78 nstops = 1; 79 tabstops[0] = 8; 80 while ((ch = getopt(argc, argv, "at:")) != -1) { 81 switch (ch) { 82 case 'a': /* Un-expand all spaces, not just leading. */ 83 all = 1; 84 break; 85 case 't': /* Specify tab list, implies -a. */ 86 getstops(optarg); 87 all = 1; 88 break; 89 default: 90 usage(); 91 /*NOTREACHED*/ 92 } 93 } 94 argc -= optind; 95 argv += optind; 96 97 failed = 0; 98 if (argc == 0) 99 tabify(); 100 else { 101 while ((filename = *argv++) != NULL) { 102 if (freopen(filename, "r", stdin) == NULL) { 103 warn("%s", filename); 104 failed++; 105 } else 106 tabify(); 107 } 108 } 109 exit(failed != 0); 110 } 111 112 static void 113 usage() 114 { 115 fprintf(stderr, "usage: unexpand [-a] [-t tablist] [file ...]\n"); 116 exit(1); 117 } 118 119 static void 120 tabify() 121 { 122 int ch, dcol, doneline, limit, n, ocol; 123 124 limit = nstops == 1 ? INT_MAX : tabstops[nstops - 1] - 1; 125 126 doneline = ocol = dcol = 0; 127 while ((ch = getchar()) != EOF) { 128 if (ch == ' ' && !doneline) { 129 if (++dcol >= limit) 130 doneline = 1; 131 continue; 132 } else if (ch == '\t') { 133 if (nstops == 1) { 134 dcol = (1 + dcol / tabstops[0]) * 135 tabstops[0]; 136 continue; 137 } else { 138 for (n = 0; tabstops[n] - 1 < dcol && 139 n < nstops; n++) 140 ; 141 if (n < nstops - 1 && tabstops[n] - 1 < limit) { 142 dcol = tabstops[n]; 143 continue; 144 } 145 doneline = 1; 146 } 147 } 148 149 /* Output maximal number of tabs. */ 150 if (nstops == 1) { 151 while (((ocol + tabstops[0]) / tabstops[0]) 152 <= (dcol / tabstops[0])) { 153 if (dcol - ocol < 2) 154 break; 155 putchar('\t'); 156 ocol = (1 + ocol / tabstops[0]) * 157 tabstops[0]; 158 } 159 } else { 160 for (n = 0; tabstops[n] - 1 < ocol && n < nstops; n++) 161 ; 162 while (ocol < dcol && n < nstops && ocol < limit) { 163 putchar('\t'); 164 ocol = tabstops[n++]; 165 } 166 } 167 168 /* Then spaces. */ 169 while (ocol < dcol && ocol < limit) { 170 putchar(' '); 171 ocol++; 172 } 173 174 if (ch == '\b') { 175 putchar('\b'); 176 if (ocol > 0) 177 ocol--, dcol--; 178 } else if (ch == '\n') { 179 putchar('\n'); 180 doneline = ocol = dcol = 0; 181 continue; 182 } else if (ch != ' ' || dcol > limit) { 183 putchar(ch); 184 if (isprint(ch)) 185 ocol++, dcol++; 186 } 187 188 /* 189 * Only processing leading blanks or we've gone past the 190 * last tab stop. Emit remainder of this line unchanged. 191 */ 192 if (!all || dcol >= limit) { 193 while ((ch = getchar()) != '\n' && ch != EOF) 194 putchar(ch); 195 if (ch == '\n') 196 putchar('\n'); 197 doneline = ocol = dcol = 0; 198 } 199 } 200 } 201 202 static void 203 getstops(cp) 204 const char *cp; 205 { 206 int i; 207 208 nstops = 0; 209 for (;;) { 210 i = 0; 211 while (*cp >= '0' && *cp <= '9') 212 i = i * 10 + *cp++ - '0'; 213 if (i <= 0) 214 errx(1, "bad tab stop spec"); 215 if (nstops > 0 && i <= tabstops[nstops-1]) 216 errx(1, "bad tab stop spec"); 217 if (nstops == sizeof(tabstops) / sizeof(*tabstops)) 218 errx(1, "too many tab stops"); 219 tabstops[nstops++] = i; 220 if (*cp == 0) 221 break; 222 if (*cp != ',' && !isblank((unsigned char)*cp)) 223 errx(1, "bad tab stop spec"); 224 cp++; 225 } 226 } 227