Home | History | Annotate | Line # | Download | only in fold
fold.c revision 1.2
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1990 The Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * This code is derived from software contributed to Berkeley by
      6  1.1  cgd  * Kevin Ruddy.
      7  1.1  cgd  *
      8  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      9  1.1  cgd  * modification, are permitted provided that the following conditions
     10  1.1  cgd  * are met:
     11  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     12  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     13  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     14  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     15  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     16  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     17  1.1  cgd  *    must display the following acknowledgement:
     18  1.1  cgd  *	This product includes software developed by the University of
     19  1.1  cgd  *	California, Berkeley and its contributors.
     20  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     21  1.1  cgd  *    may be used to endorse or promote products derived from this software
     22  1.1  cgd  *    without specific prior written permission.
     23  1.1  cgd  *
     24  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  1.1  cgd  * SUCH DAMAGE.
     35  1.1  cgd  */
     36  1.1  cgd 
     37  1.1  cgd #ifndef lint
     38  1.1  cgd char copyright[] =
     39  1.1  cgd "@(#) Copyright (c) 1990 The Regents of the University of California.\n\
     40  1.1  cgd  All rights reserved.\n";
     41  1.1  cgd #endif /* not lint */
     42  1.1  cgd 
     43  1.1  cgd #ifndef lint
     44  1.1  cgd static char sccsid[] = "@(#)fold.c	5.5 (Berkeley) 6/1/90";
     45  1.1  cgd #endif /* not lint */
     46  1.1  cgd 
     47  1.1  cgd #include <stdio.h>
     48  1.2  jtc #include <stdlib.h>
     49  1.1  cgd #include <string.h>
     50  1.2  jtc #include <errno.h>
     51  1.1  cgd 
     52  1.1  cgd #define	DEFLINEWIDTH	80
     53  1.1  cgd 
     54  1.2  jtc static void fold ();
     55  1.2  jtc static int new_column_position ();
     56  1.2  jtc int count_bytes = 0;
     57  1.2  jtc int split_words = 0;
     58  1.2  jtc 
     59  1.2  jtc int
     60  1.1  cgd main(argc, argv)
     61  1.1  cgd 	int argc;
     62  1.1  cgd 	char **argv;
     63  1.1  cgd {
     64  1.1  cgd 	register int ch;
     65  1.1  cgd 	int width;
     66  1.1  cgd 	char *p;
     67  1.1  cgd 
     68  1.1  cgd 	width = -1;
     69  1.2  jtc 	while ((ch = getopt(argc, argv, "0123456789bsw:")) != EOF)
     70  1.1  cgd 		switch (ch) {
     71  1.2  jtc 		case 'b':
     72  1.2  jtc 			count_bytes = 1;
     73  1.2  jtc 			break;
     74  1.2  jtc 		case 's':
     75  1.2  jtc 			split_words = 1;
     76  1.2  jtc 			break;
     77  1.1  cgd 		case 'w':
     78  1.1  cgd 			if ((width = atoi(optarg)) <= 0) {
     79  1.1  cgd 				(void)fprintf(stderr,
     80  1.1  cgd 				    "fold: illegal width value.\n");
     81  1.1  cgd 				exit(1);
     82  1.1  cgd 			}
     83  1.1  cgd 			break;
     84  1.1  cgd 		case '0': case '1': case '2': case '3': case '4':
     85  1.1  cgd 		case '5': case '6': case '7': case '8': case '9':
     86  1.1  cgd 			if (width == -1) {
     87  1.1  cgd 				p = argv[optind - 1];
     88  1.1  cgd 				if (p[0] == '-' && p[1] == ch && !p[2])
     89  1.1  cgd 					width = atoi(++p);
     90  1.1  cgd 				else
     91  1.1  cgd 					width = atoi(argv[optind] + 1);
     92  1.1  cgd 			}
     93  1.1  cgd 			break;
     94  1.1  cgd 		default:
     95  1.1  cgd 			(void)fprintf(stderr,
     96  1.1  cgd 			    "usage: fold [-w width] [file ...]\n");
     97  1.1  cgd 			exit(1);
     98  1.1  cgd 		}
     99  1.1  cgd 	argv += optind;
    100  1.1  cgd 	argc -= optind;
    101  1.1  cgd 
    102  1.1  cgd 	if (width == -1)
    103  1.1  cgd 		width = DEFLINEWIDTH;
    104  1.2  jtc 
    105  1.1  cgd 	if (!*argv)
    106  1.1  cgd 		fold(width);
    107  1.1  cgd 	else for (; *argv; ++argv)
    108  1.1  cgd 		if (!freopen(*argv, "r", stdin)) {
    109  1.1  cgd 			(void)fprintf(stderr,
    110  1.1  cgd 			    "fold: %s: %s\n", *argv, strerror(errno));
    111  1.1  cgd 			exit(1);
    112  1.1  cgd 		} else
    113  1.1  cgd 			fold(width);
    114  1.1  cgd 	exit(0);
    115  1.1  cgd }
    116  1.1  cgd 
    117  1.2  jtc /*
    118  1.2  jtc  * Fold the contents of standard input to fit within WIDTH columns
    119  1.2  jtc  * (or bytes) and write to standard output.
    120  1.2  jtc  *
    121  1.2  jtc  * If split_words is set, split the line at the last space character
    122  1.2  jtc  * on the line.  This flag necessitates storing the line in a buffer
    123  1.2  jtc  * until the current column > width, or a newline or EOF is read.
    124  1.2  jtc  *
    125  1.2  jtc  * The buffer can grow larger than WIDTH due to backspaces and carriage
    126  1.2  jtc  * returns embedded in the input stream.
    127  1.2  jtc  */
    128  1.2  jtc static void
    129  1.1  cgd fold(width)
    130  1.1  cgd 	register int width;
    131  1.1  cgd {
    132  1.2  jtc 	static char *buf = NULL;
    133  1.2  jtc 	static int   buf_max = 0;
    134  1.2  jtc 	register int ch, col;
    135  1.2  jtc 	register int indx;
    136  1.2  jtc 
    137  1.2  jtc 	col = indx = 0;
    138  1.2  jtc 	while ((ch = getchar()) != EOF) {
    139  1.2  jtc 		if (ch == '\n') {
    140  1.2  jtc 			if (indx != 0)
    141  1.2  jtc 				fwrite (buf, 1, indx, stdout);
    142  1.2  jtc 			putchar('\n');
    143  1.2  jtc 			col = indx = 0;
    144  1.2  jtc 			continue;
    145  1.2  jtc 		}
    146  1.2  jtc 
    147  1.2  jtc 		col = new_column_position (col, ch);
    148  1.2  jtc 		if (col > width) {
    149  1.2  jtc 			int i, last_space;
    150  1.2  jtc 
    151  1.2  jtc 			if (split_words) {
    152  1.2  jtc 				for (i = 0, last_space = -1; i < indx; i++)
    153  1.2  jtc 					if(buf[i] == ' ') last_space = i;
    154  1.2  jtc 			}
    155  1.1  cgd 
    156  1.2  jtc 			if (split_words && last_space != -1) {
    157  1.2  jtc 				last_space++;
    158  1.2  jtc 
    159  1.2  jtc 				fwrite (buf, 1, last_space, stdout);
    160  1.2  jtc 				memmove (buf, buf+last_space, indx-last_space);
    161  1.2  jtc 
    162  1.2  jtc 				indx -= last_space;
    163  1.2  jtc 				col = 0;
    164  1.2  jtc 				for (i = 0; i < indx; i++) {
    165  1.2  jtc 					col = new_column_position (col, ch);
    166  1.2  jtc 				}
    167  1.2  jtc 			} else {
    168  1.2  jtc 				fwrite (buf, 1, indx, stdout);
    169  1.2  jtc 				col = indx = 0;
    170  1.2  jtc 			}
    171  1.2  jtc 			putchar('\n');
    172  1.2  jtc 
    173  1.2  jtc 			/* calculate the column position for the next line. */
    174  1.2  jtc 			col = new_column_position (col, ch);
    175  1.1  cgd 		}
    176  1.1  cgd 
    177  1.2  jtc 		if (indx + 1 > buf_max) {
    178  1.2  jtc 			/* Allocate buffer in LINE_MAX increments */
    179  1.2  jtc 			buf_max += 2048;
    180  1.2  jtc 			if((buf = realloc (buf, buf_max)) == NULL) {
    181  1.2  jtc 				(void)fprintf(stderr, "%s\n", strerror(errno));
    182  1.2  jtc 				exit(1);
    183  1.2  jtc 			}
    184  1.1  cgd 		}
    185  1.2  jtc 		buf[indx++] = ch;
    186  1.2  jtc 	}
    187  1.2  jtc 
    188  1.2  jtc 	if (indx != 0)
    189  1.2  jtc 		fwrite (buf, 1, indx, stdout);
    190  1.2  jtc }
    191  1.1  cgd 
    192  1.2  jtc /*
    193  1.2  jtc  * calculate the column position
    194  1.2  jtc  */
    195  1.2  jtc static int
    196  1.2  jtc new_column_position (col, ch)
    197  1.2  jtc 	int col;
    198  1.2  jtc 	int ch;
    199  1.2  jtc {
    200  1.2  jtc 	if (!count_bytes) {
    201  1.1  cgd 		switch (ch) {
    202  1.1  cgd 		case '\b':
    203  1.1  cgd 			if (col > 0)
    204  1.1  cgd 				--col;
    205  1.1  cgd 			break;
    206  1.1  cgd 		case '\r':
    207  1.1  cgd 			col = 0;
    208  1.1  cgd 			break;
    209  1.1  cgd 		case '\t':
    210  1.2  jtc 			col = (col + 8) & ~7;
    211  1.1  cgd 			break;
    212  1.1  cgd 		default:
    213  1.1  cgd 			++col;
    214  1.1  cgd 			break;
    215  1.1  cgd 		}
    216  1.2  jtc 	} else {
    217  1.2  jtc 		++col;
    218  1.1  cgd 	}
    219  1.2  jtc 
    220  1.2  jtc 	return col;
    221  1.1  cgd }
    222