|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1980 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: static char sccsid[] = "@(#)getname.c 5.8 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: #include <sys/types.h> ! 25: #include <pwd.h> ! 26: ! 27: /* ! 28: * Getname / getuserid for those with ! 29: * hashed passwd data base). ! 30: * ! 31: */ ! 32: ! 33: #include "rcv.h" ! 34: ! 35: /* ! 36: * Search the passwd file for a uid. Return name through ref parameter ! 37: * if found, indicating success with 0 return. Return -1 on error. ! 38: */ ! 39: char * ! 40: getname(uid) ! 41: { ! 42: struct passwd *pw; ! 43: ! 44: if ((pw = getpwuid(uid)) == NULL) ! 45: return NOSTR; ! 46: return pw->pw_name; ! 47: } ! 48: ! 49: /* ! 50: * Convert the passed name to a user id and return it. Return -1 ! 51: * on error. ! 52: */ ! 53: getuserid(name) ! 54: char name[]; ! 55: { ! 56: struct passwd *pw; ! 57: ! 58: if ((pw = getpwnam(name)) == NULL) ! 59: return -1; ! 60: return pw->pw_uid; ! 61: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.