Sync up to trunk head.
[reactos.git] / base / applications / network / finger / net.c
1 /*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. 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 #include <winsock2.h>
38 #include <stdio.h>
39 #include <ctype.h>
40 #include <string.h>
41
42 #include "various.h"
43
44 void
45 netfinger(char *name)
46 {
47 extern int lflag;
48 char c, lastc;
49 struct in_addr defaddr;
50 struct hostent *hp, def;
51 struct servent *sp;
52 struct sockaddr_in sin;
53 SOCKET s;
54 char *alist[1], *host;
55
56 /* If this is a local request */
57 if (!(host = rindex(name, '@')))
58 return;
59
60 *host++ = '\0';
61 if (isdigit(*host) && (defaddr.s_addr = inet_addr(host)) != (unsigned long)-1) {
62 def.h_name = host;
63 def.h_addr_list = alist;
64 def.h_addr = (char *)&defaddr;
65 def.h_length = sizeof(struct in_addr);
66 def.h_addrtype = AF_INET;
67 def.h_aliases = 0;
68 hp = &def;
69 } else if (!(hp = gethostbyname(host))) {
70 (void)fprintf(stderr,
71 "finger: unknown host: %s\n", host);
72 return;
73 }
74 if (!(sp = getservbyname("finger", "tcp"))) {
75 (void)fprintf(stderr, "finger: tcp/finger: unknown service\n");
76 return;
77 }
78 sin.sin_family = hp->h_addrtype;
79 bcopy(hp->h_addr, (char *)&sin.sin_addr, hp->h_length);
80 sin.sin_port = sp->s_port;
81 if ((s = socket(hp->h_addrtype, SOCK_STREAM, 0)) == INVALID_SOCKET) {
82 perror("finger: socket");
83 return;
84 }
85
86 /* have network connection; identify the host connected with */
87 (void)printf("[%s]\n", hp->h_name);
88 if (connect(s, (struct sockaddr *)&sin, sizeof(sin)) < 0) {
89 fprintf(stderr, "finger: connect rc = %d", WSAGetLastError());
90 (void)closesocket(s);
91 return;
92 }
93
94 /* -l flag for remote fingerd */
95 if (lflag)
96 send(s, "/W ", 3, 0);
97 /* send the name followed by <CR><LF> */
98 send(s, name, strlen(name), 0);
99 send(s, "\r\n", 2, 0);
100
101 /*
102 * Read from the remote system; once we're connected, we assume some
103 * data. If none arrives, we hang until the user interrupts.
104 *
105 * If we see a <CR> or a <CR> with the high bit set, treat it as
106 * a newline; if followed by a newline character, only output one
107 * newline.
108 *
109 * Otherwise, all high bits are stripped; if it isn't printable and
110 * it isn't a space, we can simply set the 7th bit. Every ASCII
111 * character with bit 7 set is printable.
112 */
113 lastc = 0;
114 while (recv(s, &c, 1, 0) == 1) {
115 c &= 0x7f;
116 if (c == 0x0d) {
117 if (lastc == '\r') /* ^M^M - skip dupes */
118 continue;
119 c = '\n';
120 lastc = '\r';
121 } else {
122 if (!isprint(c) && !isspace(c))
123 c |= 0x40;
124 if (lastc != '\r' || c != '\n')
125 lastc = c;
126 else {
127 lastc = '\n';
128 continue;
129 }
130 }
131 putchar(c);
132 }
133 if (lastc != '\n')
134 putchar('\n');
135 putchar('\n');
136 }