|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted provided
6: * that: (1) source distributions retain this entire copyright notice and
7: * comment, and (2) distributions including binaries display the following
8: * acknowledgement: ``This product includes software developed by the
9: * University of California, Berkeley and its contributors'' in the
10: * documentation or other materials provided with the distribution and in
11: * all advertising materials mentioning features or use of this software.
12: * Neither the name of the University nor the names of its contributors may
13: * be used to endorse or promote products derived from this software without
14: * specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #ifndef lint
21: char copyright[] =
22: "@(#) Copyright (c) 1983 Regents of the University of California.\n\
23: All rights reserved.\n";
24: #endif /* not lint */
25:
26: #ifndef lint
27: static char sccsid[] = "@(#)lptest.c 5.4 (Berkeley) 6/1/90";
28: #endif /* not lint */
29:
30: /*
31: * lptest -- line printer test program (and other devices).
32: */
33:
34: #include <stdio.h>
35:
36: main(argc, argv)
37: int argc;
38: char **argv;
39: {
40: int len, count;
41: register i, j, fc, nc;
42: char outbuf[BUFSIZ];
43:
44: setbuf(stdout, outbuf);
45: if (argc >= 2)
46: len = atoi(argv[1]);
47: else
48: len = 79;
49: if (argc >= 3)
50: count = atoi(argv[2]);
51: else
52: count = 200;
53: fc = ' ';
54: for (i = 0; i < count; i++) {
55: if (++fc == 0177)
56: fc = ' ';
57: nc = fc;
58: for (j = 0; j < len; j++) {
59: putchar(nc);
60: if (++nc == 0177)
61: nc = ' ';
62: }
63: putchar('\n');
64: }
65: (void) fflush(stdout);
66: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.