rpc.c revision 1.8 1 1.8 pk /* $NetBSD: rpc.c,v 1.8 1995/09/17 00:49:44 pk Exp $ */
2 1.2 cgd
3 1.1 brezak /*
4 1.1 brezak * Copyright (c) 1992 Regents of the University of California.
5 1.1 brezak * All rights reserved.
6 1.1 brezak *
7 1.1 brezak * This software was developed by the Computer Systems Engineering group
8 1.1 brezak * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9 1.1 brezak * contributed to Berkeley.
10 1.1 brezak *
11 1.1 brezak * Redistribution and use in source and binary forms, with or without
12 1.1 brezak * modification, are permitted provided that the following conditions
13 1.1 brezak * are met:
14 1.1 brezak * 1. Redistributions of source code must retain the above copyright
15 1.1 brezak * notice, this list of conditions and the following disclaimer.
16 1.1 brezak * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 brezak * notice, this list of conditions and the following disclaimer in the
18 1.1 brezak * documentation and/or other materials provided with the distribution.
19 1.1 brezak * 3. All advertising materials mentioning features or use of this software
20 1.1 brezak * must display the following acknowledgement:
21 1.1 brezak * This product includes software developed by the University of
22 1.1 brezak * California, Lawrence Berkeley Laboratory and its contributors.
23 1.1 brezak * 4. Neither the name of the University nor the names of its contributors
24 1.1 brezak * may be used to endorse or promote products derived from this software
25 1.1 brezak * without specific prior written permission.
26 1.1 brezak *
27 1.1 brezak * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 1.1 brezak * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 1.1 brezak * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 1.1 brezak * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 1.1 brezak * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 1.1 brezak * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 1.1 brezak * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 1.1 brezak * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 1.1 brezak * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 1.1 brezak * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 1.1 brezak * SUCH DAMAGE.
38 1.1 brezak *
39 1.2 cgd * @(#) Header: rpc.c,v 1.12 93/09/28 08:31:56 leres Exp (LBL)
40 1.1 brezak */
41 1.1 brezak
42 1.5 gwr /*
43 1.6 gwr * RPC functions used by NFS and bootparams.
44 1.6 gwr * Note that bootparams requires the ability to find out the
45 1.6 gwr * address of the server from which its response has come.
46 1.6 gwr * This is supported by keeping the IP/UDP headers in the
47 1.6 gwr * buffer space provided by the caller. (See rpc_fromaddr)
48 1.5 gwr */
49 1.5 gwr
50 1.1 brezak #include <sys/param.h>
51 1.1 brezak #include <sys/socket.h>
52 1.1 brezak
53 1.1 brezak #include <netinet/in.h>
54 1.1 brezak #include <netinet/in_systm.h>
55 1.1 brezak
56 1.1 brezak #include <nfs/rpcv2.h>
57 1.1 brezak #include <nfs/nfsv2.h>
58 1.4 mycroft #include <nfs/xdr_subs.h>
59 1.4 mycroft
60 1.1 brezak #include <string.h>
61 1.1 brezak
62 1.1 brezak #include "stand.h"
63 1.1 brezak #include "net.h"
64 1.1 brezak #include "netif.h"
65 1.1 brezak #include "rpc.h"
66 1.1 brezak
67 1.5 gwr struct auth_info {
68 1.5 gwr int32_t authtype; /* auth type */
69 1.5 gwr u_int32_t authlen; /* auth length */
70 1.5 gwr };
71 1.5 gwr
72 1.5 gwr struct auth_unix {
73 1.5 gwr int32_t ua_time;
74 1.5 gwr int32_t ua_hostname; /* null */
75 1.5 gwr int32_t ua_uid;
76 1.5 gwr int32_t ua_gid;
77 1.5 gwr int32_t ua_gidlist; /* null */
78 1.1 brezak };
79 1.1 brezak
80 1.5 gwr struct rpc_call {
81 1.5 gwr u_int32_t rp_xid; /* request transaction id */
82 1.5 gwr int32_t rp_direction; /* call direction (0) */
83 1.5 gwr u_int32_t rp_rpcvers; /* rpc version (2) */
84 1.5 gwr u_int32_t rp_prog; /* program */
85 1.5 gwr u_int32_t rp_vers; /* version */
86 1.5 gwr u_int32_t rp_proc; /* procedure */
87 1.5 gwr };
88 1.1 brezak
89 1.5 gwr struct rpc_reply {
90 1.5 gwr u_int32_t rp_xid; /* request transaction id */
91 1.5 gwr int32_t rp_direction; /* call direction (1) */
92 1.5 gwr int32_t rp_astatus; /* accept status (0: accepted) */
93 1.5 gwr union {
94 1.5 gwr u_int32_t rpu_errno;
95 1.5 gwr struct {
96 1.5 gwr struct auth_info rok_auth;
97 1.5 gwr u_int32_t rok_status;
98 1.5 gwr } rpu_rok;
99 1.5 gwr } rp_u;
100 1.1 brezak };
101 1.1 brezak
102 1.1 brezak /* Local forwards */
103 1.7 pk static ssize_t recvrpc __P((struct iodesc *, void *, size_t, time_t));
104 1.1 brezak
105 1.5 gwr int rpc_xid;
106 1.5 gwr int rpc_port = 0x400; /* predecrement */
107 1.5 gwr
108 1.5 gwr /*
109 1.5 gwr * Make a rpc call; return length of answer
110 1.6 gwr * Note: Caller must leave room for headers.
111 1.5 gwr */
112 1.7 pk ssize_t
113 1.5 gwr rpc_call(d, prog, vers, proc, sdata, slen, rdata, rlen)
114 1.1 brezak register struct iodesc *d;
115 1.5 gwr register n_long prog, vers, proc;
116 1.1 brezak register void *sdata;
117 1.4 mycroft register size_t slen;
118 1.1 brezak register void *rdata;
119 1.4 mycroft register size_t rlen;
120 1.1 brezak {
121 1.7 pk register ssize_t cc;
122 1.5 gwr struct auth_info *auth;
123 1.5 gwr struct rpc_call *call;
124 1.5 gwr struct rpc_reply *reply;
125 1.8 pk char *send_head, *send_tail;
126 1.8 pk char *recv_head, *recv_tail;
127 1.5 gwr n_long x;
128 1.1 brezak
129 1.1 brezak #ifdef RPC_DEBUG
130 1.1 brezak if (debug)
131 1.5 gwr printf("rpc_call: prog=0x%x vers=%d proc=%d\n",
132 1.5 gwr prog, vers, proc);
133 1.5 gwr #endif
134 1.5 gwr
135 1.5 gwr d->destport = rpc_getport(d, prog, vers);
136 1.5 gwr
137 1.5 gwr /*
138 1.5 gwr * Prepend authorization stuff and headers.
139 1.5 gwr * Note, must prepend things in reverse order.
140 1.5 gwr */
141 1.5 gwr send_head = sdata;
142 1.7 pk send_tail = (char *)sdata + slen;
143 1.5 gwr
144 1.5 gwr /* Auth verifier is always auth_null */
145 1.8 pk send_head -= sizeof(*auth);
146 1.8 pk auth = (struct auth_info *)send_head;
147 1.5 gwr auth->authtype = htonl(RPCAUTH_NULL);
148 1.5 gwr auth->authlen = 0;
149 1.5 gwr
150 1.6 gwr #if 1
151 1.5 gwr /* Auth credentials: always auth unix (as root) */
152 1.8 pk send_head -= sizeof(struct auth_unix);
153 1.5 gwr bzero(send_head, sizeof(struct auth_unix));
154 1.8 pk send_head -= sizeof(*auth);
155 1.8 pk auth = (struct auth_info *)send_head;
156 1.5 gwr auth->authtype = htonl(RPCAUTH_UNIX);
157 1.5 gwr auth->authlen = htonl(sizeof(struct auth_unix));
158 1.5 gwr #else
159 1.5 gwr /* Auth credentials: always auth_null (XXX OK?) */
160 1.8 pk send_head -= sizeof(*auth);
161 1.5 gwr auth = send_head;
162 1.5 gwr auth->authtype = htonl(RPCAUTH_NULL);
163 1.5 gwr auth->authlen = 0;
164 1.1 brezak #endif
165 1.1 brezak
166 1.5 gwr /* RPC call structure. */
167 1.8 pk send_head -= sizeof(*call);
168 1.8 pk call = (struct rpc_call *)send_head;
169 1.5 gwr rpc_xid++;
170 1.5 gwr call->rp_xid = htonl(rpc_xid);
171 1.5 gwr call->rp_direction = htonl(RPC_CALL);
172 1.5 gwr call->rp_rpcvers = htonl(RPC_VER2);
173 1.5 gwr call->rp_prog = htonl(prog);
174 1.5 gwr call->rp_vers = htonl(vers);
175 1.5 gwr call->rp_proc = htonl(proc);
176 1.5 gwr
177 1.5 gwr /* Make room for the rpc_reply header. */
178 1.5 gwr recv_head = rdata;
179 1.7 pk recv_tail = (char *)rdata + rlen;
180 1.8 pk recv_head -= sizeof(*reply);
181 1.1 brezak
182 1.4 mycroft cc = sendrecv(d,
183 1.7 pk sendudp, send_head, ((int)send_tail - (int)send_head),
184 1.7 pk recvrpc, recv_head, ((int)recv_tail - (int)recv_head));
185 1.3 mycroft #ifdef RPC_DEBUG
186 1.3 mycroft if (debug)
187 1.5 gwr printf("callrpc: cc=%d rlen=%d\n", cc, rlen);
188 1.3 mycroft #endif
189 1.7 pk if (cc == -1)
190 1.5 gwr return (-1);
191 1.7 pk
192 1.7 pk if (cc <= sizeof(*reply)) {
193 1.7 pk errno = EBADRPC;
194 1.7 pk return (-1);
195 1.7 pk }
196 1.7 pk
197 1.8 pk recv_tail = recv_head + cc;
198 1.3 mycroft
199 1.5 gwr /*
200 1.5 gwr * Check the RPC reply status.
201 1.5 gwr * The xid, dir, astatus were already checked.
202 1.5 gwr */
203 1.8 pk reply = (struct rpc_reply *)recv_head;
204 1.5 gwr auth = &reply->rp_u.rpu_rok.rok_auth;
205 1.5 gwr x = ntohl(auth->authlen);
206 1.5 gwr if (x != 0) {
207 1.5 gwr #ifdef RPC_DEBUG
208 1.5 gwr if (debug)
209 1.5 gwr printf("callrpc: reply auth != NULL\n");
210 1.5 gwr #endif
211 1.8 pk errno = EBADRPC;
212 1.5 gwr return(-1);
213 1.5 gwr }
214 1.5 gwr x = ntohl(reply->rp_u.rpu_rok.rok_status);
215 1.5 gwr if (x != 0) {
216 1.5 gwr printf("callrpc: error = %d\n", x);
217 1.8 pk errno = EBADRPC;
218 1.5 gwr return(-1);
219 1.5 gwr }
220 1.8 pk recv_head += sizeof(*reply);
221 1.1 brezak
222 1.7 pk return (ssize_t)((int)recv_tail - (int)recv_head);
223 1.1 brezak }
224 1.1 brezak
225 1.5 gwr /*
226 1.5 gwr * Returns true if packet is the one we're waiting for.
227 1.5 gwr * This just checks the XID, direction, acceptance.
228 1.5 gwr * Remaining checks are done by callrpc
229 1.5 gwr */
230 1.7 pk static ssize_t
231 1.4 mycroft recvrpc(d, pkt, len, tleft)
232 1.1 brezak register struct iodesc *d;
233 1.1 brezak register void *pkt;
234 1.4 mycroft register size_t len;
235 1.4 mycroft time_t tleft;
236 1.1 brezak {
237 1.5 gwr register struct rpc_reply *reply;
238 1.8 pk ssize_t n;
239 1.8 pk long x;
240 1.1 brezak
241 1.1 brezak errno = 0;
242 1.1 brezak #ifdef RPC_DEBUG
243 1.1 brezak if (debug)
244 1.3 mycroft printf("recvrpc: called len=%d\n", len);
245 1.1 brezak #endif
246 1.1 brezak
247 1.7 pk n = readudp(d, pkt, len, tleft);
248 1.7 pk if (n <= (4 * 4))
249 1.8 pk return -1;
250 1.8 pk
251 1.5 gwr reply = (struct rpc_reply *)pkt;
252 1.4 mycroft
253 1.5 gwr x = ntohl(reply->rp_xid);
254 1.5 gwr if (x != rpc_xid) {
255 1.1 brezak #ifdef RPC_DEBUG
256 1.5 gwr if (debug)
257 1.5 gwr printf("recvrpc: rp_xid %d != xid %d\n", x, rpc_xid);
258 1.1 brezak #endif
259 1.8 pk return -1;
260 1.1 brezak }
261 1.1 brezak
262 1.5 gwr x = ntohl(reply->rp_direction);
263 1.5 gwr if (x != RPC_REPLY) {
264 1.5 gwr #ifdef RPC_DEBUG
265 1.5 gwr if (debug)
266 1.5 gwr printf("recvrpc: rp_direction %d != REPLY\n", x);
267 1.5 gwr #endif
268 1.8 pk return -1;
269 1.5 gwr }
270 1.5 gwr
271 1.5 gwr x = ntohl(reply->rp_astatus);
272 1.5 gwr if (x != RPC_MSGACCEPTED) {
273 1.5 gwr errno = ntohl(reply->rp_u.rpu_errno);
274 1.5 gwr printf("recvrpc: reject, astat=%d, errno=%d\n", x, errno);
275 1.8 pk return -1;
276 1.5 gwr }
277 1.5 gwr
278 1.1 brezak /* Return data count (thus indicating success) */
279 1.7 pk return (n);
280 1.1 brezak }
281 1.1 brezak
282 1.5 gwr /*
283 1.5 gwr * Given a pointer to a reply just received,
284 1.5 gwr * dig out the IP address/port from the headers.
285 1.5 gwr */
286 1.5 gwr void
287 1.5 gwr rpc_fromaddr(void *pkt, n_long *addr, u_short *port)
288 1.5 gwr {
289 1.5 gwr struct hackhdr {
290 1.5 gwr /* Tail of IP header: just IP addresses */
291 1.5 gwr n_long ip_src;
292 1.5 gwr n_long ip_dst;
293 1.5 gwr /* UDP header: */
294 1.5 gwr u_int16_t uh_sport; /* source port */
295 1.5 gwr u_int16_t uh_dport; /* destination port */
296 1.5 gwr int16_t uh_ulen; /* udp length */
297 1.5 gwr u_int16_t uh_sum; /* udp checksum */
298 1.5 gwr /* RPC reply header: */
299 1.5 gwr struct rpc_reply rpc;
300 1.5 gwr } *hhdr;
301 1.5 gwr
302 1.5 gwr hhdr = ((struct hackhdr *)pkt) - 1;
303 1.5 gwr *addr = hhdr->ip_src;
304 1.5 gwr *port = hhdr->uh_sport;
305 1.5 gwr }
306 1.5 gwr
307 1.5 gwr /*
308 1.5 gwr * RPC Portmapper cache
309 1.5 gwr */
310 1.5 gwr
311 1.5 gwr #define PMAP_NUM 8 /* need at most 5 pmap entries */
312 1.5 gwr
313 1.5 gwr int rpc_pmap_num;
314 1.5 gwr struct pmap_list {
315 1.5 gwr u_long addr; /* server, net order */
316 1.5 gwr u_long prog; /* host order */
317 1.5 gwr u_long vers; /* host order */
318 1.5 gwr u_short port; /* net order */
319 1.5 gwr u_short _pad;
320 1.5 gwr } rpc_pmap_list[PMAP_NUM];
321 1.5 gwr
322 1.5 gwr /* return port number in net order */
323 1.5 gwr int
324 1.5 gwr rpc_pmap_getcache(addr, prog, vers)
325 1.5 gwr u_long addr; /* server, net order */
326 1.5 gwr u_long prog; /* host order */
327 1.5 gwr u_long vers; /* host order */
328 1.5 gwr {
329 1.5 gwr struct pmap_list *pl;
330 1.5 gwr
331 1.5 gwr for (pl = rpc_pmap_list; pl < &rpc_pmap_list[rpc_pmap_num]; pl++)
332 1.5 gwr if (pl->addr == addr && pl->prog == prog && pl->vers == vers)
333 1.5 gwr return ((int) pl->port);
334 1.5 gwr return (-1);
335 1.5 gwr }
336 1.5 gwr
337 1.5 gwr void
338 1.5 gwr rpc_pmap_putcache(addr, prog, vers, port)
339 1.5 gwr n_long addr; /* net order */
340 1.5 gwr n_long prog; /* host order */
341 1.5 gwr n_long vers; /* host order */
342 1.5 gwr int port; /* net order */
343 1.5 gwr {
344 1.5 gwr struct pmap_list *pl;
345 1.5 gwr
346 1.5 gwr /* Don't overflow cache... */
347 1.5 gwr if (rpc_pmap_num >= PMAP_NUM) {
348 1.5 gwr /* ... just re-use the last entry. */
349 1.5 gwr rpc_pmap_num = PMAP_NUM - 1;
350 1.5 gwr #ifdef RPC_DEBUG
351 1.5 gwr printf("rpc_pmap_putcache: cache overflow\n");
352 1.5 gwr #endif
353 1.5 gwr }
354 1.5 gwr
355 1.5 gwr pl = &rpc_pmap_list[rpc_pmap_num];
356 1.5 gwr rpc_pmap_num++;
357 1.5 gwr
358 1.5 gwr /* Cache answer */
359 1.5 gwr pl->addr = addr;
360 1.5 gwr pl->prog = prog;
361 1.5 gwr pl->vers = vers;
362 1.5 gwr pl->port = port;
363 1.5 gwr }
364 1.5 gwr
365 1.5 gwr
366 1.5 gwr /*
367 1.5 gwr * Request a port number from the port mapper.
368 1.5 gwr * Returns the port in network order.
369 1.5 gwr */
370 1.5 gwr int
371 1.5 gwr rpc_getport(d, prog, vers)
372 1.1 brezak register struct iodesc *d;
373 1.5 gwr n_long prog; /* host order */
374 1.5 gwr n_long vers; /* host order */
375 1.1 brezak {
376 1.5 gwr struct args {
377 1.1 brezak u_long prog; /* call program */
378 1.1 brezak u_long vers; /* call version */
379 1.1 brezak u_long proto; /* call protocol */
380 1.1 brezak u_long port; /* call port (unused) */
381 1.5 gwr } *args;
382 1.5 gwr struct res {
383 1.5 gwr u_long port;
384 1.5 gwr } *res;
385 1.5 gwr struct {
386 1.5 gwr n_long h[RPC_HEADER_WORDS];
387 1.5 gwr struct args d;
388 1.1 brezak } sdata;
389 1.5 gwr struct {
390 1.5 gwr n_long h[RPC_HEADER_WORDS];
391 1.5 gwr struct res d;
392 1.5 gwr n_long pad;
393 1.5 gwr } rdata;
394 1.5 gwr int cc, port;
395 1.1 brezak
396 1.1 brezak #ifdef RPC_DEBUG
397 1.1 brezak if (debug)
398 1.5 gwr printf("getport: prog=0x%x vers=%d\n", prog, vers);
399 1.1 brezak #endif
400 1.5 gwr
401 1.5 gwr /* This one is fixed forever. */
402 1.5 gwr if (prog == PMAPPROG)
403 1.5 gwr return PMAPPORT;
404 1.5 gwr
405 1.1 brezak /* Try for cached answer first */
406 1.5 gwr port = rpc_pmap_getcache(d->destip, prog, vers);
407 1.5 gwr if (port >= 0)
408 1.5 gwr return (port);
409 1.5 gwr
410 1.5 gwr args = &sdata.d;
411 1.5 gwr args->prog = htonl(prog);
412 1.5 gwr args->vers = htonl(vers);
413 1.5 gwr args->proto = htonl(IPPROTO_UDP);
414 1.5 gwr args->port = 0;
415 1.5 gwr res = &rdata.d;
416 1.5 gwr
417 1.5 gwr cc = rpc_call(d, PMAPPROG, PMAPVERS, PMAPPROC_GETPORT,
418 1.5 gwr args, sizeof(*args), res, sizeof(*res));
419 1.5 gwr if (cc < sizeof(*res)) {
420 1.1 brezak printf("getport: %s", strerror(errno));
421 1.1 brezak return(-1);
422 1.1 brezak }
423 1.5 gwr port = (u_short)res->port;
424 1.1 brezak
425 1.5 gwr rpc_pmap_putcache(d->destip, prog, vers, port);
426 1.1 brezak
427 1.5 gwr return (port);
428 1.1 brezak }
429