prevent buffer overflow, LoadString accepts the size of the buffer in TCHARs, not...
[reactos.git] / reactos / apps / utils / net / 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 #ifndef lint
38 static char sccsid[] = "@(#)net.c 8.4 (Berkeley) 4/28/95";
39 #endif /* not lint */
40
41 #include <sys/types.h>
42 #include <winsock2.h>
43 #include "unistd.h"
44 #include <stdio.h>
45 #include <ctype.h>
46 #include <string.h>
47
48 #include "various.h"
49
50 void
51 netfinger(char *name)
52 {
53 extern int lflag;
54 char c, lastc;
55 struct in_addr defaddr;
56 struct hostent *hp, def;
57 struct servent *sp;
58 struct sockaddr_in sin;
59 SOCKET s;
60 char *alist[1], *host;
61
62 /* If this is a local request */
63 if (!(host = rindex(name, '@')))
64 return;
65
66 *host++ = '\0';
67 if (isdigit(*host) && (defaddr.s_addr = inet_addr(host)) != -1) {
68 def.h_name = host;
69 def.h_addr_list = alist;
70 def.h_addr = (char *)&defaddr;
71 def.h_length = sizeof(struct in_addr);
72 def.h_addrtype = AF_INET;
73 def.h_aliases = 0;
74 hp = &def;
75 } else if (!(hp = gethostbyname(host))) {
76 (void)fprintf(stderr,
77 "finger: unknown host: %s\n", host);
78 return;
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)) == INVALID_SOCKET) {
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 fprintf(stderr, "finger: connect rc = %d", WSAGetLastError());
96 (void)close(s);
97 return;
98 }
99
100 /* -l flag for remote fingerd */
101 if (lflag)
102 send(s, "/W ", 3, 0);
103 /* send the name followed by <CR><LF> */
104 send(s, name, strlen(name), 0);
105 send(s, "\r\n", 2, 0);
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 lastc = 0;
120 while (recv(s, &c, 1, 0) == 1) {
121 c &= 0x7f;
122 if (c == 0x0d) {
123 if (lastc == '\r') /* ^M^M - skip dupes */
124 continue;
125 c = '\n';
126 lastc = '\r';
127 } else {
128 if (!isprint(c) && !isspace(c))
129 c |= 0x40;
130 if (lastc != '\r' || c != '\n')
131 lastc = c;
132 else {
133 lastc = '\n';
134 continue;
135 }
136 }
137 putchar(c);
138 }
139 if (lastc != '\n')
140 putchar('\n');
141 putchar('\n');
142 }