Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /* |
2 | * Copyright (c) 1980 Regents of the University of California. | |
3 | * 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 | #ifndef lint | |
35 | char copyright[] = | |
36 | "@(#) Copyright (c) 1980 Regents of the University of California.\n\ | |
37 | All rights reserved.\n"; | |
38 | #endif /* not lint */ | |
39 | ||
40 | #ifndef lint | |
41 | static char sccsid[] = "@(#)colrm.c 5.4 (Berkeley) 6/1/90"; | |
42 | #endif /* not lint */ | |
43 | ||
44 | #include <stdio.h> | |
45 | /* | |
46 | COLRM removes unwanted columns from a file | |
47 | Jeff Schriebman UC Berkeley 11-74 | |
48 | */ | |
49 | ||
50 | ||
51 | main(argc,argv) | |
52 | char **argv; | |
53 | { | |
54 | register c, ct, first, last; | |
55 | ||
56 | first = 0; | |
57 | last = 0; | |
58 | if (argc > 1) | |
59 | first = getn(*++argv); | |
60 | if (argc > 2) | |
61 | last = getn(*++argv); | |
62 | ||
63 | start: | |
64 | ct = 0; | |
65 | loop1: | |
66 | c = getc(stdin); | |
67 | if (feof(stdin)) | |
68 | goto fin; | |
69 | if (c == '\t') | |
70 | ct = (ct + 8) & ~7; | |
71 | else if (c == '\b') | |
72 | ct = ct ? ct - 1 : 0; | |
73 | else | |
74 | ct++; | |
75 | if (c == '\n') { | |
76 | putc(c, stdout); | |
77 | goto start; | |
78 | } | |
79 | if (!first || ct < first) { | |
80 | putc(c, stdout); | |
81 | goto loop1; | |
82 | } | |
83 | ||
84 | /* Loop getting rid of characters */ | |
85 | while (!last || ct < last) { | |
86 | c = getc(stdin); | |
87 | if (feof(stdin)) | |
88 | goto fin; | |
89 | if (c == '\n') { | |
90 | putc(c, stdout); | |
91 | goto start; | |
92 | } | |
93 | if (c == '\t') | |
94 | ct = (ct + 8) & ~7; | |
95 | else if (c == '\b') | |
96 | ct = ct ? ct - 1 : 0; | |
97 | else | |
98 | ct++; | |
99 | } | |
100 | ||
101 | /* Output last of the line */ | |
102 | for (;;) { | |
103 | c = getc(stdin); | |
104 | if (feof(stdin)) | |
105 | break; | |
106 | putc(c, stdout); | |
107 | if (c == '\n') | |
108 | goto start; | |
109 | } | |
110 | fin: | |
111 | fflush(stdout); | |
112 | exit(0); | |
113 | } | |
114 | ||
115 | getn(ap) | |
116 | char *ap; | |
117 | { | |
118 | register int n,c; | |
119 | register char *p; | |
120 | ||
121 | p = ap; | |
122 | n = 0; | |
123 | while ((c = *p++) >= '0' && c <= '9') | |
124 | n = n*10 + c - '0'; | |
125 | return(n); | |
126 | } |