| 1 | /* |
| 2 | * Copyright (c) 1989 The Regents of the University of California. |
| 3 | * All rights reserved. |
| 4 | * |
| 5 | * This code is derived from software contributed to Berkeley by |
| 6 | * Tony Nardo of the Johns Hopkins University/Applied Physics Lab. |
| 7 | * |
| 8 | * Redistribution and use in source and binary forms, with or without |
| 9 | * modification, are permitted provided that the following conditions |
| 10 | * are met: |
| 11 | * 1. Redistributions of source code must retain the above copyright |
| 12 | * notice, this list of conditions and the following disclaimer. |
| 13 | * 2. Redistributions in binary form must reproduce the above copyright |
| 14 | * notice, this list of conditions and the following disclaimer in the |
| 15 | * documentation and/or other materials provided with the distribution. |
| 16 | * 3. All advertising materials mentioning features or use of this software |
| 17 | * must display the following acknowledgement: |
| 18 | * This product includes software developed by the University of |
| 19 | * California, Berkeley and its contributors. |
| 20 | * 4. Neither the name of the University nor the names of its contributors |
| 21 | * may be used to endorse or promote products derived from this software |
| 22 | * without specific prior written permission. |
| 23 | * |
| 24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 34 | * SUCH DAMAGE. |
| 35 | */ |
| 36 | |
| 37 | #ifndef lint |
| 38 | static char sccsid[] = "@(#)net.c 5.5 (Berkeley) 6/1/90"; |
| 39 | #endif /* not lint */ |
| 40 | |
| 41 | #include <sys/types.h> |
| 42 | #include <sys/socket.h> |
| 43 | #include <netinet/in.h> |
| 44 | #include <netdb.h> |
| 45 | #include <stdio.h> |
| 46 | #include <ctype.h> |
| 47 | |
| 48 | netfinger(name) |
| 49 | char *name; |
| 50 | { |
| 51 | extern int lflag; |
| 52 | register FILE *fp; |
| 53 | register int c, lastc; |
| 54 | struct in_addr defaddr; |
| 55 | struct hostent *hp, def; |
| 56 | struct servent *sp; |
| 57 | struct sockaddr_in sin; |
| 58 | int s; |
| 59 | char *alist[1], *host, *rindex(); |
| 60 | u_long inet_addr(); |
| 61 | |
| 62 | if (!(host = rindex(name, '@'))) |
| 63 | return; |
| 64 | *host++ = NULL; |
| 65 | if (!(hp = gethostbyname(host))) { |
| 66 | defaddr.s_addr = inet_addr(host); |
| 67 | if (defaddr.s_addr == -1) { |
| 68 | (void)fprintf(stderr, |
| 69 | "finger: unknown host: %s\n", host); |
| 70 | return; |
| 71 | } |
| 72 | def.h_name = host; |
| 73 | def.h_addr_list = alist; |
| 74 | def.h_addr = (char *)&defaddr; |
| 75 | def.h_length = sizeof(struct in_addr); |
| 76 | def.h_addrtype = AF_INET; |
| 77 | def.h_aliases = 0; |
| 78 | hp = &def; |
| 79 | } |
| 80 | if (!(sp = getservbyname("finger", "tcp"))) { |
| 81 | (void)fprintf(stderr, "finger: tcp/finger: unknown service\n"); |
| 82 | return; |
| 83 | } |
| 84 | sin.sin_family = hp->h_addrtype; |
| 85 | bcopy(hp->h_addr, (char *)&sin.sin_addr, hp->h_length); |
| 86 | sin.sin_port = sp->s_port; |
| 87 | if ((s = socket(hp->h_addrtype, SOCK_STREAM, 0)) < 0) { |
| 88 | perror("finger: socket"); |
| 89 | return; |
| 90 | } |
| 91 | |
| 92 | /* have network connection; identify the host connected with */ |
| 93 | (void)printf("[%s]\n", hp->h_name); |
| 94 | if (connect(s, (struct sockaddr *)&sin, sizeof(sin)) < 0) { |
| 95 | perror("finger: connect"); |
| 96 | (void)close(s); |
| 97 | return; |
| 98 | } |
| 99 | |
| 100 | /* -l flag for remote fingerd */ |
| 101 | if (lflag) |
| 102 | write(s, "/W ", 3); |
| 103 | /* send the name followed by <CR><LF> */ |
| 104 | (void)write(s, name, strlen(name)); |
| 105 | (void)write(s, "\r\n", 2); |
| 106 | |
| 107 | /* |
| 108 | * Read from the remote system; once we're connected, we assume some |
| 109 | * data. If none arrives, we hang until the user interrupts. |
| 110 | * |
| 111 | * If we see a <CR> or a <CR> with the high bit set, treat it as |
| 112 | * a newline; if followed by a newline character, only output one |
| 113 | * newline. |
| 114 | * |
| 115 | * Otherwise, all high bits are stripped; if it isn't printable and |
| 116 | * it isn't a space, we can simply set the 7th bit. Every ASCII |
| 117 | * character with bit 7 set is printable. |
| 118 | */ |
| 119 | if (fp = fdopen(s, "r")) |
| 120 | while ((c = getc(fp)) != EOF) { |
| 121 | c &= 0x7f; |
| 122 | if (c == 0x0d) { |
| 123 | c = '\n'; |
| 124 | lastc = '\r'; |
| 125 | } else { |
| 126 | if (!isprint(c) && !isspace(c)) |
| 127 | c |= 0x40; |
| 128 | if (lastc != '\r' || c != '\n') |
| 129 | lastc = c; |
| 130 | else { |
| 131 | lastc = '\n'; |
| 132 | continue; |
| 133 | } |
| 134 | } |
| 135 | putchar(c); |
| 136 | } |
| 137 | if (lastc != '\n') |
| 138 | putchar('\n'); |
| 139 | (void)fclose(fp); |
| 140 | } |