19 |
|
|
20 |
|
#define MAXLINE 65536 /* maximum input line */ |
21 |
|
|
22 |
+ |
long incnt = 0; /* limit number of records? */ |
23 |
+ |
|
24 |
|
FILE *input[MAXFILE]; |
25 |
|
int bytsiz[MAXFILE]; |
26 |
|
char *tabc[MAXFILE]; |
54 |
|
break; |
55 |
|
case 'i': |
56 |
|
switch (argv[i][2]) { |
57 |
+ |
case 'n': |
58 |
+ |
incnt = atol(argv[++i]); |
59 |
+ |
break; |
60 |
|
case 'f': |
61 |
|
curbytes = sizeof(float); |
62 |
|
break; |
143 |
|
flockfile(input[i]); |
144 |
|
flockfile(stdout); |
145 |
|
#endif |
146 |
< |
puteol = 0; /* check for ASCII output */ |
146 |
> |
puteol = 0; /* any ASCII output at all? */ |
147 |
|
for (i = nfiles; i--; ) |
148 |
|
if (!bytsiz[i] || isprint(tabc[i][0]) || tabc[i][0] == '\t') { |
149 |
|
puteol++; |
150 |
|
break; |
151 |
|
} |
152 |
< |
for ( ; ; ) { /* main loop */ |
152 |
> |
do { /* main loop */ |
153 |
|
for (i = 0; i < nfiles; i++) { |
154 |
|
if (bytsiz[i]) { /* binary file */ |
155 |
|
if (fread(buf, bytsiz[i], 1, input[i]) < 1) |
172 |
|
putchar('\n'); |
173 |
|
if (unbuff) |
174 |
|
fflush(stdout); |
175 |
< |
} |
175 |
> |
} while (--incnt); |
176 |
|
return(0); |
177 |
|
} |