13 |
|
#include <ctype.h> |
14 |
|
|
15 |
|
#include "platform.h" |
16 |
< |
#include "rtprocess.h" |
16 |
> |
#include "rtio.h" |
17 |
|
|
18 |
|
#define MAXFILE 512 /* maximum number of files */ |
19 |
|
|
22 |
|
FILE *input[MAXFILE]; |
23 |
|
int bytsiz[MAXFILE]; |
24 |
|
char *tabc[MAXFILE]; |
25 |
< |
int nfiles; |
25 |
> |
int nfiles = 0; |
26 |
|
|
27 |
|
char buf[MAXLINE]; |
28 |
|
|
29 |
|
int |
30 |
< |
main(argc, argv) |
31 |
< |
int argc; |
32 |
< |
char *argv[]; |
30 |
> |
main(int argc, char *argv[]) |
31 |
|
{ |
32 |
+ |
long incnt = 0; |
33 |
|
int unbuff = 0; |
34 |
|
int binout = 0; |
35 |
< |
int i; |
36 |
< |
char *curtab; |
38 |
< |
int curbytes; |
35 |
> |
char *curtab = "\t"; |
36 |
> |
int curbytes = 0; |
37 |
|
int puteol; |
38 |
+ |
int i; |
39 |
|
|
41 |
– |
curtab = "\t"; |
42 |
– |
curbytes = 0; |
43 |
– |
nfiles = 0; |
40 |
|
for (i = 1; i < argc; i++) { |
41 |
|
if (argv[i][0] == '-') { |
42 |
|
switch (argv[i][1]) { |
43 |
|
case 't': |
44 |
|
curtab = argv[i]+2; |
45 |
+ |
if (!*curtab) curtab = "\n"; |
46 |
|
break; |
47 |
|
case 'u': |
48 |
|
unbuff = !unbuff; |
49 |
|
break; |
50 |
|
case 'i': |
51 |
|
switch (argv[i][2]) { |
52 |
+ |
case 'n': |
53 |
+ |
incnt = atol(argv[++i]); |
54 |
+ |
break; |
55 |
|
case 'f': |
56 |
+ |
case 'F': |
57 |
|
curbytes = sizeof(float); |
58 |
|
break; |
59 |
|
case 'd': |
60 |
+ |
case 'D': |
61 |
|
curbytes = sizeof(double); |
62 |
|
break; |
63 |
|
case 'i': |
64 |
+ |
case 'I': |
65 |
|
curbytes = sizeof(int); |
66 |
|
break; |
67 |
|
case 'w': |
68 |
+ |
case 'W': |
69 |
|
curbytes = 2; |
70 |
|
break; |
71 |
|
case 'b': |
79 |
|
} |
80 |
|
if (isdigit(argv[i][3])) |
81 |
|
curbytes *= atoi(argv[i]+3); |
82 |
< |
if (abs(curbytes) > MAXLINE) { |
82 |
> |
curbytes += (curbytes == -1); |
83 |
> |
if (curbytes > MAXLINE) { |
84 |
|
fputs(argv[0], stderr); |
85 |
|
fputs(": input size too big\n", stderr); |
86 |
< |
exit(1); |
86 |
> |
return(1); |
87 |
|
} |
88 |
< |
if (curbytes) { |
88 |
> |
if (curbytes > 0) { |
89 |
|
curtab = ""; |
90 |
|
++binout; |
91 |
|
} |
95 |
|
input[nfiles] = stdin; |
96 |
|
if (curbytes > 0) |
97 |
|
SET_FILE_BINARY(input[nfiles]); |
93 |
– |
else |
94 |
– |
curbytes = -curbytes; |
98 |
|
bytsiz[nfiles++] = curbytes; |
99 |
|
break; |
100 |
|
badopt:; |
101 |
|
default: |
102 |
|
fputs(argv[0], stderr); |
103 |
|
fputs(": bad option\n", stderr); |
104 |
< |
exit(1); |
104 |
> |
return(1); |
105 |
|
} |
106 |
|
} else if (argv[i][0] == '!') { |
107 |
|
tabc[nfiles] = curtab; |
108 |
|
if ((input[nfiles] = popen(argv[i]+1, "r")) == NULL) { |
109 |
|
fputs(argv[i], stderr); |
110 |
|
fputs(": cannot start command\n", stderr); |
111 |
< |
exit(1); |
111 |
> |
return(1); |
112 |
|
} |
113 |
|
if (curbytes > 0) |
114 |
|
SET_FILE_BINARY(input[nfiles]); |
112 |
– |
else |
113 |
– |
curbytes = -curbytes; |
115 |
|
bytsiz[nfiles++] = curbytes; |
116 |
|
} else { |
117 |
|
tabc[nfiles] = curtab; |
118 |
|
if ((input[nfiles] = fopen(argv[i], "r")) == NULL) { |
119 |
|
fputs(argv[i], stderr); |
120 |
|
fputs(": cannot open file\n", stderr); |
121 |
< |
exit(1); |
121 |
> |
return(1); |
122 |
|
} |
123 |
|
if (curbytes > 0) |
124 |
|
SET_FILE_BINARY(input[nfiles]); |
124 |
– |
else |
125 |
– |
curbytes = -curbytes; |
125 |
|
bytsiz[nfiles++] = curbytes; |
126 |
|
} |
127 |
|
if (nfiles >= MAXFILE) { |
128 |
|
fputs(argv[0], stderr); |
129 |
|
fputs(": too many input streams\n", stderr); |
130 |
< |
exit(1); |
130 |
> |
return(1); |
131 |
|
} |
132 |
|
} |
133 |
+ |
if (!nfiles) { |
134 |
+ |
fputs(argv[0], stderr); |
135 |
+ |
fputs(": no input streams\n", stderr); |
136 |
+ |
return(1); |
137 |
+ |
} |
138 |
|
if (binout) /* binary output? */ |
139 |
|
SET_FILE_BINARY(stdout); |
140 |
|
#ifdef getc_unlocked /* avoid lock/unlock overhead */ |
142 |
|
flockfile(input[i]); |
143 |
|
flockfile(stdout); |
144 |
|
#endif |
145 |
< |
puteol = 0; /* check for ASCII output */ |
145 |
> |
puteol = 0; /* any ASCII output at all? */ |
146 |
|
for (i = nfiles; i--; ) |
147 |
< |
if (!bytsiz[i] || isprint(tabc[i][0]) || tabc[i][0] == '\t') { |
148 |
< |
puteol++; |
145 |
< |
break; |
146 |
< |
} |
147 |
< |
for ( ; ; ) { /* main loop */ |
147 |
> |
puteol += (bytsiz[i] <= 0); |
148 |
> |
do { /* main loop */ |
149 |
|
for (i = 0; i < nfiles; i++) { |
150 |
< |
if (bytsiz[i]) { /* binary file */ |
151 |
< |
if (fread(buf, bytsiz[i], 1, input[i]) < 1) |
150 |
> |
if (bytsiz[i] > 0) { /* binary input */ |
151 |
> |
if (getbinary(buf, bytsiz[i], 1, input[i]) < 1) |
152 |
|
break; |
153 |
< |
if (i) |
154 |
< |
fputs(tabc[i], stdout); |
155 |
< |
fwrite(buf, bytsiz[i], 1, stdout); |
156 |
< |
} else { |
153 |
> |
if (putbinary(buf, bytsiz[i], 1, stdout) != 1) |
154 |
> |
break; |
155 |
> |
} else if (bytsiz[i] < 0) { /* multi-line input */ |
156 |
> |
int n = -bytsiz[i]; |
157 |
> |
while (n--) { |
158 |
> |
if (fgets(buf, MAXLINE, input[i]) == NULL) |
159 |
> |
break; |
160 |
> |
if ((i > 0) | (n < -bytsiz[i]-1)) |
161 |
> |
fputs(tabc[i], stdout); |
162 |
> |
buf[strlen(buf)-1] = '\0'; |
163 |
> |
if (fputs(buf, stdout) == EOF) |
164 |
> |
break; |
165 |
> |
} |
166 |
> |
if (n >= 0) /* fell short? */ |
167 |
> |
break; |
168 |
> |
} else { /* single-line input */ |
169 |
|
if (fgets(buf, MAXLINE, input[i]) == NULL) |
170 |
|
break; |
171 |
|
if (i) |
172 |
|
fputs(tabc[i], stdout); |
173 |
|
buf[strlen(buf)-1] = '\0'; |
174 |
< |
fputs(buf, stdout); |
174 |
> |
if (fputs(buf, stdout) == EOF) |
175 |
> |
break; |
176 |
|
} |
177 |
|
} |
178 |
|
if (i < nfiles) |
181 |
|
putchar('\n'); |
182 |
|
if (unbuff) |
183 |
|
fflush(stdout); |
184 |
+ |
} while (--incnt); |
185 |
+ |
/* check ending */ |
186 |
+ |
if (fflush(stdout) == EOF) { |
187 |
+ |
fputs(argv[0], stderr); |
188 |
+ |
fputs(": write error on standard output\n", stderr); |
189 |
+ |
return(1); |
190 |
+ |
} |
191 |
+ |
if (incnt > 0) { |
192 |
+ |
fputs(argv[0], stderr); |
193 |
+ |
fputs(": warning: premature EOD\n", stderr); |
194 |
|
} |
195 |
|
return(0); |
196 |
|
} |