rpc.c revision 1.23 1 1.23 fvdl /* $NetBSD: rpc.c,v 1.23 2003/08/31 22:40:49 fvdl 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.4 mycroft
56 1.20 thorpej #ifdef _STANDALONE
57 1.20 thorpej #include <lib/libkern/libkern.h>
58 1.20 thorpej #else
59 1.20 thorpej #include <string.h>
60 1.20 thorpej #endif
61 1.20 thorpej
62 1.12 gwr #include "rpcv2.h"
63 1.1 brezak
64 1.1 brezak #include "stand.h"
65 1.1 brezak #include "net.h"
66 1.1 brezak #include "rpc.h"
67 1.1 brezak
68 1.5 gwr struct auth_info {
69 1.5 gwr int32_t authtype; /* auth type */
70 1.5 gwr u_int32_t authlen; /* auth length */
71 1.5 gwr };
72 1.5 gwr
73 1.5 gwr struct auth_unix {
74 1.5 gwr int32_t ua_time;
75 1.5 gwr int32_t ua_hostname; /* null */
76 1.5 gwr int32_t ua_uid;
77 1.5 gwr int32_t ua_gid;
78 1.5 gwr int32_t ua_gidlist; /* null */
79 1.1 brezak };
80 1.1 brezak
81 1.5 gwr struct rpc_call {
82 1.5 gwr u_int32_t rp_xid; /* request transaction id */
83 1.5 gwr int32_t rp_direction; /* call direction (0) */
84 1.5 gwr u_int32_t rp_rpcvers; /* rpc version (2) */
85 1.5 gwr u_int32_t rp_prog; /* program */
86 1.5 gwr u_int32_t rp_vers; /* version */
87 1.5 gwr u_int32_t rp_proc; /* procedure */
88 1.5 gwr };
89 1.1 brezak
90 1.5 gwr struct rpc_reply {
91 1.5 gwr u_int32_t rp_xid; /* request transaction id */
92 1.5 gwr int32_t rp_direction; /* call direction (1) */
93 1.5 gwr int32_t rp_astatus; /* accept status (0: accepted) */
94 1.5 gwr union {
95 1.5 gwr u_int32_t rpu_errno;
96 1.5 gwr struct {
97 1.5 gwr struct auth_info rok_auth;
98 1.5 gwr u_int32_t rok_status;
99 1.5 gwr } rpu_rok;
100 1.5 gwr } rp_u;
101 1.1 brezak };
102 1.1 brezak
103 1.1 brezak /* Local forwards */
104 1.7 pk static ssize_t recvrpc __P((struct iodesc *, void *, size_t, time_t));
105 1.9 pk static int rpc_getport __P((struct iodesc *, n_long, n_long));
106 1.1 brezak
107 1.5 gwr int rpc_xid;
108 1.5 gwr int rpc_port = 0x400; /* predecrement */
109 1.5 gwr
110 1.5 gwr /*
111 1.5 gwr * Make a rpc call; return length of answer
112 1.6 gwr * Note: Caller must leave room for headers.
113 1.5 gwr */
114 1.7 pk ssize_t
115 1.5 gwr rpc_call(d, prog, vers, proc, sdata, slen, rdata, rlen)
116 1.21 augustss struct iodesc *d;
117 1.21 augustss n_long prog, vers, proc;
118 1.21 augustss void *sdata;
119 1.21 augustss size_t slen;
120 1.21 augustss void *rdata;
121 1.21 augustss size_t rlen;
122 1.1 brezak {
123 1.21 augustss ssize_t cc;
124 1.5 gwr struct auth_info *auth;
125 1.5 gwr struct rpc_call *call;
126 1.5 gwr struct rpc_reply *reply;
127 1.8 pk char *send_head, *send_tail;
128 1.8 pk char *recv_head, *recv_tail;
129 1.5 gwr n_long x;
130 1.10 gwr int port; /* host order */
131 1.1 brezak
132 1.1 brezak #ifdef RPC_DEBUG
133 1.1 brezak if (debug)
134 1.16 christos printf("rpc_call: prog=0x%x vers=%d proc=%d\n",
135 1.15 christos prog, vers, proc);
136 1.5 gwr #endif
137 1.5 gwr
138 1.10 gwr port = rpc_getport(d, prog, vers);
139 1.10 gwr if (port == -1)
140 1.9 pk return (-1);
141 1.9 pk
142 1.10 gwr d->destport = htons(port);
143 1.5 gwr
144 1.5 gwr /*
145 1.5 gwr * Prepend authorization stuff and headers.
146 1.5 gwr * Note, must prepend things in reverse order.
147 1.5 gwr */
148 1.5 gwr send_head = sdata;
149 1.7 pk send_tail = (char *)sdata + slen;
150 1.5 gwr
151 1.5 gwr /* Auth verifier is always auth_null */
152 1.8 pk send_head -= sizeof(*auth);
153 1.8 pk auth = (struct auth_info *)send_head;
154 1.5 gwr auth->authtype = htonl(RPCAUTH_NULL);
155 1.5 gwr auth->authlen = 0;
156 1.5 gwr
157 1.6 gwr #if 1
158 1.5 gwr /* Auth credentials: always auth unix (as root) */
159 1.8 pk send_head -= sizeof(struct auth_unix);
160 1.5 gwr bzero(send_head, sizeof(struct auth_unix));
161 1.8 pk send_head -= sizeof(*auth);
162 1.8 pk auth = (struct auth_info *)send_head;
163 1.5 gwr auth->authtype = htonl(RPCAUTH_UNIX);
164 1.5 gwr auth->authlen = htonl(sizeof(struct auth_unix));
165 1.5 gwr #else
166 1.5 gwr /* Auth credentials: always auth_null (XXX OK?) */
167 1.8 pk send_head -= sizeof(*auth);
168 1.5 gwr auth = send_head;
169 1.5 gwr auth->authtype = htonl(RPCAUTH_NULL);
170 1.5 gwr auth->authlen = 0;
171 1.1 brezak #endif
172 1.1 brezak
173 1.5 gwr /* RPC call structure. */
174 1.8 pk send_head -= sizeof(*call);
175 1.8 pk call = (struct rpc_call *)send_head;
176 1.5 gwr rpc_xid++;
177 1.5 gwr call->rp_xid = htonl(rpc_xid);
178 1.5 gwr call->rp_direction = htonl(RPC_CALL);
179 1.5 gwr call->rp_rpcvers = htonl(RPC_VER2);
180 1.5 gwr call->rp_prog = htonl(prog);
181 1.5 gwr call->rp_vers = htonl(vers);
182 1.5 gwr call->rp_proc = htonl(proc);
183 1.5 gwr
184 1.5 gwr /* Make room for the rpc_reply header. */
185 1.5 gwr recv_head = rdata;
186 1.7 pk recv_tail = (char *)rdata + rlen;
187 1.8 pk recv_head -= sizeof(*reply);
188 1.1 brezak
189 1.4 mycroft cc = sendrecv(d,
190 1.13 cgd sendudp, send_head, send_tail - send_head,
191 1.13 cgd recvrpc, recv_head, recv_tail - recv_head);
192 1.9 pk
193 1.3 mycroft #ifdef RPC_DEBUG
194 1.3 mycroft if (debug)
195 1.18 thorpej printf("callrpc: cc=%ld rlen=%lu\n", (long)cc, (u_long)rlen);
196 1.3 mycroft #endif
197 1.7 pk if (cc == -1)
198 1.5 gwr return (-1);
199 1.7 pk
200 1.23 fvdl if ((size_t)cc <= sizeof(*reply)) {
201 1.7 pk errno = EBADRPC;
202 1.7 pk return (-1);
203 1.7 pk }
204 1.7 pk
205 1.8 pk recv_tail = recv_head + cc;
206 1.3 mycroft
207 1.5 gwr /*
208 1.5 gwr * Check the RPC reply status.
209 1.5 gwr * The xid, dir, astatus were already checked.
210 1.5 gwr */
211 1.8 pk reply = (struct rpc_reply *)recv_head;
212 1.5 gwr auth = &reply->rp_u.rpu_rok.rok_auth;
213 1.5 gwr x = ntohl(auth->authlen);
214 1.5 gwr if (x != 0) {
215 1.5 gwr #ifdef RPC_DEBUG
216 1.5 gwr if (debug)
217 1.16 christos printf("callrpc: reply auth != NULL\n");
218 1.5 gwr #endif
219 1.8 pk errno = EBADRPC;
220 1.5 gwr return(-1);
221 1.5 gwr }
222 1.5 gwr x = ntohl(reply->rp_u.rpu_rok.rok_status);
223 1.5 gwr if (x != 0) {
224 1.16 christos printf("callrpc: error = %d\n", x);
225 1.8 pk errno = EBADRPC;
226 1.5 gwr return(-1);
227 1.5 gwr }
228 1.8 pk recv_head += sizeof(*reply);
229 1.1 brezak
230 1.13 cgd return (ssize_t)(recv_tail - recv_head);
231 1.1 brezak }
232 1.1 brezak
233 1.5 gwr /*
234 1.5 gwr * Returns true if packet is the one we're waiting for.
235 1.5 gwr * This just checks the XID, direction, acceptance.
236 1.5 gwr * Remaining checks are done by callrpc
237 1.5 gwr */
238 1.7 pk static ssize_t
239 1.4 mycroft recvrpc(d, pkt, len, tleft)
240 1.21 augustss struct iodesc *d;
241 1.21 augustss void *pkt;
242 1.21 augustss size_t len;
243 1.4 mycroft time_t tleft;
244 1.1 brezak {
245 1.21 augustss struct rpc_reply *reply;
246 1.8 pk ssize_t n;
247 1.14 cgd int x;
248 1.1 brezak
249 1.1 brezak errno = 0;
250 1.1 brezak #ifdef RPC_DEBUG
251 1.1 brezak if (debug)
252 1.18 thorpej printf("recvrpc: called len=%lu\n", (u_long)len);
253 1.1 brezak #endif
254 1.1 brezak
255 1.7 pk n = readudp(d, pkt, len, tleft);
256 1.7 pk if (n <= (4 * 4))
257 1.8 pk return -1;
258 1.8 pk
259 1.5 gwr reply = (struct rpc_reply *)pkt;
260 1.4 mycroft
261 1.5 gwr x = ntohl(reply->rp_xid);
262 1.5 gwr if (x != rpc_xid) {
263 1.1 brezak #ifdef RPC_DEBUG
264 1.5 gwr if (debug)
265 1.16 christos printf("recvrpc: rp_xid %d != xid %d\n", x, rpc_xid);
266 1.1 brezak #endif
267 1.8 pk return -1;
268 1.1 brezak }
269 1.1 brezak
270 1.5 gwr x = ntohl(reply->rp_direction);
271 1.5 gwr if (x != RPC_REPLY) {
272 1.5 gwr #ifdef RPC_DEBUG
273 1.5 gwr if (debug)
274 1.16 christos printf("recvrpc: rp_direction %d != REPLY\n", x);
275 1.5 gwr #endif
276 1.8 pk return -1;
277 1.5 gwr }
278 1.5 gwr
279 1.5 gwr x = ntohl(reply->rp_astatus);
280 1.5 gwr if (x != RPC_MSGACCEPTED) {
281 1.5 gwr errno = ntohl(reply->rp_u.rpu_errno);
282 1.16 christos printf("recvrpc: reject, astat=%d, errno=%d\n", x, errno);
283 1.8 pk return -1;
284 1.5 gwr }
285 1.5 gwr
286 1.1 brezak /* Return data count (thus indicating success) */
287 1.7 pk return (n);
288 1.1 brezak }
289 1.1 brezak
290 1.5 gwr /*
291 1.5 gwr * Given a pointer to a reply just received,
292 1.5 gwr * dig out the IP address/port from the headers.
293 1.5 gwr */
294 1.5 gwr void
295 1.9 pk rpc_fromaddr(pkt, addr, port)
296 1.9 pk void *pkt;
297 1.9 pk struct in_addr *addr;
298 1.9 pk u_short *port;
299 1.5 gwr {
300 1.5 gwr struct hackhdr {
301 1.5 gwr /* Tail of IP header: just IP addresses */
302 1.5 gwr n_long ip_src;
303 1.5 gwr n_long ip_dst;
304 1.5 gwr /* UDP header: */
305 1.5 gwr u_int16_t uh_sport; /* source port */
306 1.5 gwr u_int16_t uh_dport; /* destination port */
307 1.5 gwr int16_t uh_ulen; /* udp length */
308 1.5 gwr u_int16_t uh_sum; /* udp checksum */
309 1.5 gwr /* RPC reply header: */
310 1.5 gwr struct rpc_reply rpc;
311 1.5 gwr } *hhdr;
312 1.5 gwr
313 1.5 gwr hhdr = ((struct hackhdr *)pkt) - 1;
314 1.9 pk addr->s_addr = hhdr->ip_src;
315 1.5 gwr *port = hhdr->uh_sport;
316 1.5 gwr }
317 1.5 gwr
318 1.5 gwr /*
319 1.5 gwr * RPC Portmapper cache
320 1.5 gwr */
321 1.5 gwr #define PMAP_NUM 8 /* need at most 5 pmap entries */
322 1.5 gwr
323 1.5 gwr int rpc_pmap_num;
324 1.5 gwr struct pmap_list {
325 1.9 pk struct in_addr addr; /* server, net order */
326 1.14 cgd u_int prog; /* host order */
327 1.14 cgd u_int vers; /* host order */
328 1.10 gwr int port; /* host order */
329 1.5 gwr } rpc_pmap_list[PMAP_NUM];
330 1.5 gwr
331 1.10 gwr /* return port number in host order, or -1 */
332 1.5 gwr int
333 1.5 gwr rpc_pmap_getcache(addr, prog, vers)
334 1.9 pk struct in_addr addr; /* server, net order */
335 1.14 cgd u_int prog; /* host order */
336 1.14 cgd u_int vers; /* host order */
337 1.5 gwr {
338 1.5 gwr struct pmap_list *pl;
339 1.5 gwr
340 1.10 gwr for (pl = rpc_pmap_list; pl < &rpc_pmap_list[rpc_pmap_num]; pl++) {
341 1.10 gwr if (pl->addr.s_addr == addr.s_addr &&
342 1.10 gwr pl->prog == prog && pl->vers == vers )
343 1.10 gwr {
344 1.10 gwr return (pl->port);
345 1.10 gwr }
346 1.10 gwr }
347 1.10 gwr return (-1);
348 1.5 gwr }
349 1.5 gwr
350 1.5 gwr void
351 1.5 gwr rpc_pmap_putcache(addr, prog, vers, port)
352 1.9 pk struct in_addr addr; /* server, net order */
353 1.14 cgd u_int prog; /* host order */
354 1.14 cgd u_int vers; /* host order */
355 1.10 gwr int port; /* host order */
356 1.5 gwr {
357 1.5 gwr struct pmap_list *pl;
358 1.5 gwr
359 1.5 gwr /* Don't overflow cache... */
360 1.5 gwr if (rpc_pmap_num >= PMAP_NUM) {
361 1.5 gwr /* ... just re-use the last entry. */
362 1.5 gwr rpc_pmap_num = PMAP_NUM - 1;
363 1.5 gwr #ifdef RPC_DEBUG
364 1.16 christos printf("rpc_pmap_putcache: cache overflow\n");
365 1.5 gwr #endif
366 1.5 gwr }
367 1.5 gwr
368 1.5 gwr pl = &rpc_pmap_list[rpc_pmap_num];
369 1.5 gwr rpc_pmap_num++;
370 1.5 gwr
371 1.5 gwr /* Cache answer */
372 1.5 gwr pl->addr = addr;
373 1.5 gwr pl->prog = prog;
374 1.5 gwr pl->vers = vers;
375 1.5 gwr pl->port = port;
376 1.5 gwr }
377 1.5 gwr
378 1.5 gwr
379 1.5 gwr /*
380 1.5 gwr * Request a port number from the port mapper.
381 1.10 gwr * Returns the port in host order.
382 1.5 gwr */
383 1.5 gwr int
384 1.5 gwr rpc_getport(d, prog, vers)
385 1.21 augustss struct iodesc *d;
386 1.5 gwr n_long prog; /* host order */
387 1.5 gwr n_long vers; /* host order */
388 1.1 brezak {
389 1.5 gwr struct args {
390 1.9 pk n_long prog; /* call program */
391 1.9 pk n_long vers; /* call version */
392 1.9 pk n_long proto; /* call protocol */
393 1.9 pk n_long port; /* call port (unused) */
394 1.5 gwr } *args;
395 1.5 gwr struct res {
396 1.9 pk n_long port;
397 1.5 gwr } *res;
398 1.5 gwr struct {
399 1.5 gwr n_long h[RPC_HEADER_WORDS];
400 1.5 gwr struct args d;
401 1.1 brezak } sdata;
402 1.5 gwr struct {
403 1.5 gwr n_long h[RPC_HEADER_WORDS];
404 1.5 gwr struct res d;
405 1.5 gwr n_long pad;
406 1.5 gwr } rdata;
407 1.9 pk ssize_t cc;
408 1.10 gwr int port;
409 1.1 brezak
410 1.1 brezak #ifdef RPC_DEBUG
411 1.1 brezak if (debug)
412 1.16 christos printf("getport: prog=0x%x vers=%d\n", prog, vers);
413 1.1 brezak #endif
414 1.5 gwr
415 1.5 gwr /* This one is fixed forever. */
416 1.5 gwr if (prog == PMAPPROG)
417 1.10 gwr return (PMAPPORT);
418 1.5 gwr
419 1.1 brezak /* Try for cached answer first */
420 1.5 gwr port = rpc_pmap_getcache(d->destip, prog, vers);
421 1.10 gwr if (port != -1)
422 1.5 gwr return (port);
423 1.5 gwr
424 1.5 gwr args = &sdata.d;
425 1.5 gwr args->prog = htonl(prog);
426 1.5 gwr args->vers = htonl(vers);
427 1.5 gwr args->proto = htonl(IPPROTO_UDP);
428 1.5 gwr args->port = 0;
429 1.5 gwr res = &rdata.d;
430 1.5 gwr
431 1.5 gwr cc = rpc_call(d, PMAPPROG, PMAPVERS, PMAPPROC_GETPORT,
432 1.5 gwr args, sizeof(*args), res, sizeof(*res));
433 1.23 fvdl if ((size_t)cc < sizeof(*res)) {
434 1.16 christos printf("getport: %s", strerror(errno));
435 1.9 pk errno = EBADRPC;
436 1.10 gwr return (-1);
437 1.1 brezak }
438 1.10 gwr port = (int)ntohl(res->port);
439 1.1 brezak
440 1.5 gwr rpc_pmap_putcache(d->destip, prog, vers, port);
441 1.1 brezak
442 1.5 gwr return (port);
443 1.1 brezak }
444