|
|
1.1 root 1: /*
2: * Copyright (c) 1983, 1988 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, 1988 Regents of the University of California.\n\
21: All rights reserved.\n";
22: #endif /* not lint */
23:
24: #ifndef lint
25: static char sccsid[] = "@(#)hostid.c 5.6 (Berkeley) 6/18/88";
26: #endif /* not lint */
27:
28: #include <sys/types.h>
29: #include <stdio.h>
30: #include <netdb.h>
31:
32: main(argc, argv)
33: int argc;
34: char **argv;
35: {
36: register char *id;
37: struct hostent *hp;
38: u_long addr, inet_addr();
39: long hostid, gethostid();
40: char *index();
41:
42: if (argc < 2) {
43: printf("%#lx\n", gethostid());
44: exit(0);
45: }
46:
47: id = argv[1];
48: if (hp = gethostbyname(id)) {
49: bcopy(hp->h_addr, &addr, sizeof(addr));
50: hostid = addr;
51: } else if (index(id, '.')) {
52: if ((hostid = inet_addr(id)) == -1)
53: goto usage;
54: } else {
55: if (id[0] == '0' && (id[1] == 'x' || id[1] == 'X'))
56: id += 2;
57: if (sscanf(id, "%lx", &hostid) != 1) {
58: usage: fputs("usage: hostid [hexnum or internet address]\n",
59: stderr);
60: exit(1);
61: }
62: }
63:
64: if (sethostid(hostid) < 0) {
65: perror("sethostid");
66: exit(1);
67: }
68:
69: exit(0);
70: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.