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