|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1987 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: (1) source distributions retain this entire copyright ! 7: * notice and comment, and (2) distributions including binaries display ! 8: * the following acknowledgement: ``This product includes software ! 9: * developed by the University of California, Berkeley and its contributors'' ! 10: * in the documentation or other materials provided with the distribution ! 11: * and in all advertising materials mentioning features or use of this ! 12: * software. Neither the name of the University nor the names of its ! 13: * contributors may be used to endorse or promote products derived ! 14: * from this software without specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: */ ! 19: ! 20: #ifndef lint ! 21: char copyright[] = ! 22: "@(#) Copyright (c) 1987 Regents of the University of California.\n\ ! 23: All rights reserved.\n"; ! 24: #endif /* not lint */ ! 25: ! 26: #ifndef lint ! 27: static char sccsid[] = "@(#)printenv.c 5.4 (Berkeley) 6/1/90"; ! 28: #endif /* not lint */ ! 29: ! 30: /* ! 31: * printenv ! 32: * ! 33: * Bill Joy, UCB ! 34: * February, 1979 ! 35: */ ! 36: main(argc, argv) ! 37: int argc; ! 38: char **argv; ! 39: { ! 40: extern char **environ; ! 41: register char *cp, **ep; ! 42: register int len; ! 43: ! 44: if (argc < 2) { ! 45: for (ep = environ; *ep; ep++) ! 46: puts(*ep); ! 47: exit(0); ! 48: } ! 49: len = strlen(*++argv); ! 50: for (ep = environ; *ep; ep++) ! 51: if (!strncmp(*ep, *argv, len)) { ! 52: cp = *ep + len; ! 53: if (!*cp || *cp == '=') { ! 54: puts(*cp ? cp + 1 : cp); ! 55: exit(0); ! 56: } ! 57: } ! 58: exit(1); ! 59: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.