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