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