source: rtems-libbsd/services/librpc/src/rpc/pmap_prot2.c @ cd450d2

4.1155-freebsd-126-freebsd-12freebsd-9.3
Last change on this file since cd450d2 was cd450d2, checked in by Joel Sherrill <joel.sherrill@…>, on 08/06/12 at 00:10:35

librpc: now compiles

  • Property mode set to 100644
File size: 4.0 KB
Line 
1/*
2 * Sun RPC is a product of Sun Microsystems, Inc. and is provided for
3 * unrestricted use provided that this legend is included on all tape
4 * media and as a part of the software program in whole or part.  Users
5 * may copy or modify Sun RPC without charge, but are not authorized
6 * to license or distribute it to anyone else except as part of a product or
7 * program developed by the user.
8 *
9 * SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
10 * WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
11 * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
12 *
13 * Sun RPC is provided with no support and without any obligation on the
14 * part of Sun Microsystems, Inc. to assist in its use, correction,
15 * modification or enhancement.
16 *
17 * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
18 * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
19 * OR ANY PART THEREOF.
20 *
21 * In no event will Sun Microsystems, Inc. be liable for any lost revenue
22 * or profits or other special, indirect and consequential damages, even if
23 * Sun has been advised of the possibility of such damages.
24 *
25 * Sun Microsystems, Inc.
26 * 2550 Garcia Avenue
27 * Mountain View, California  94043
28 */
29
30#if defined(LIBC_SCCS) && !defined(lint)
31/*static char *sccsid = "from: @(#)pmap_prot2.c 1.3 87/08/11 Copyr 1984 Sun Micro";*/
32/*static char *sccsid = "from: @(#)pmap_prot2.c 2.1 88/07/29 4.0 RPCSRC";*/
33static char *rcsid = "$FreeBSD: src/lib/libc/rpc/pmap_prot2.c,v 1.7 1999/08/28 00:00:42 peter Exp $";
34#endif
35
36/*
37 * pmap_prot2.c
38 * Protocol for the local binder service, or pmap.
39 *
40 * Copyright (C) 1984, Sun Microsystems, Inc.
41 */
42
43#ifdef HAVE_CONFIG_H
44#include "config.h"
45#endif
46
47#include <freebsd/bsd.h>
48#ifndef __rtems__
49        /* XXX not needed in old.. */
50        #include <sys/types.h>
51#endif
52#include <rpc/types.h>
53#include <rpc/xdr.h>
54#include <rpc/pmap_prot.h>
55
56
57/*
58 * What is going on with linked lists? (!)
59 * First recall the link list declaration from pmap_prot.h:
60 *
61 * struct pmaplist {
62 *      struct pmap pml_map;
63 *      struct pmaplist *pml_map;
64 * };
65 *
66 * Compare that declaration with a corresponding xdr declaration that
67 * is (a) pointer-less, and (b) recursive:
68 *
69 * typedef union switch (bool_t) {
70 *
71 *      case TRUE: struct {
72 *              struct pmap;
73 *              pmaplist_t foo;
74 *      };
75 *
76 *      case FALSE: struct {};
77 * } pmaplist_t;
78 *
79 * Notice that the xdr declaration has no nxt pointer while
80 * the C declaration has no bool_t variable.  The bool_t can be
81 * interpreted as ``more data follows me''; if FALSE then nothing
82 * follows this bool_t; if TRUE then the bool_t is followed by
83 * an actual struct pmap, and then (recursively) by the
84 * xdr union, pamplist_t.
85 *
86 * This could be implemented via the xdr_union primitive, though this
87 * would cause a one recursive call per element in the list.  Rather than do
88 * that we can ``unwind'' the recursion
89 * into a while loop and do the union arms in-place.
90 *
91 * The head of the list is what the C programmer wishes to past around
92 * the net, yet is the data that the pointer points to which is interesting;
93 * this sounds like a job for xdr_reference!
94 */
95bool_t
96xdr_pmaplist(
97        XDR *xdrs,
98        struct pmaplist **rp)
99{
100        /*
101         * more_elements is pre-computed in case the direction is
102         * XDR_ENCODE or XDR_FREE.  more_elements is overwritten by
103         * xdr_bool when the direction is XDR_DECODE.
104         */
105        bool_t more_elements;
106        register int freeing = (xdrs->x_op == XDR_FREE);
107        register struct pmaplist **next = NULL;
108
109        while (TRUE) {
110                more_elements = (bool_t)(*rp != NULL);
111                if (! xdr_bool(xdrs, &more_elements))
112                        return (FALSE);
113                if (! more_elements)
114                        return (TRUE);  /* we are done */
115                /*
116                 * the unfortunate side effect of non-recursion is that in
117                 * the case of freeing we must remember the next object
118                 * before we free the current object ...
119                 */
120                if (freeing)
121                        next = &((*rp)->pml_next);
122                if (! xdr_reference(xdrs, (caddr_t *)rp,
123                    (u_int)sizeof(struct pmaplist), (xdrproc_t) xdr_pmap))
124                        return (FALSE);
125                rp = (freeing) ? next : &((*rp)->pml_next);
126        }
127}
Note: See TracBrowser for help on using the repository browser.