pmap_prot.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*
* Copyright 1991 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Portions of this source code were derived from Berkeley
* 4.3 BSD under license from the Regents of the University of
* California.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Protocol for the local binder service, or pmap.
* All the pmap xdr routines here.
*
*/
#include <rpc/pmap_prot.h>
#include <rpc/pmap_rmt.h>
{
register rpc_inline_t *buf;
trace1(TR_xdr_pmap, 0);
return (FALSE);
}
return (FALSE);
}
return (FALSE);
}
return (FALSE);
}
} else {
}
return (TRUE);
return (FALSE);
}
return (FALSE);
}
return (FALSE);
}
return (FALSE);
}
} else {
}
return (TRUE);
}
return (dummy);
}
return (FALSE);
}
/*
* pmaplist_ptr implements a linked list. The RPCL definition from
* pmap_prot.x is:
*
* struct pm__list {
* pmap pml_map;
* struct pm__list *pml_next;
* };
* typedef pm__list *pmaplist_ptr;
*
* Recall that "pointers" in XDR are encoded as a boolean, indicating whether
* there's any data behind the pointer, followed by the data (if any exists).
* The boolean can be interpreted as ``more data follows me''; if FALSE then
* nothing follows the boolean; if TRUE then the boolean is followed by an
* actual struct pmap, and another pmaplist_ptr (declared in RPCL as "struct
* pmaplist *").
*
* This could be implemented via the xdr_pointer type, though this would
* result in one recursive call per element in the list. Rather than do that
* we can ``unwind'' the recursion into a while loop and use xdr_reference to
* serialize the pmap elements.
*/
register pmaplist_ptr *rp;
{
/*
* more_elements is pre-computed in case the direction is
* XDR_ENCODE or XDR_FREE. more_elements is overwritten by
* xdr_bool when the direction is XDR_DECODE.
*/
/*CONSTANTCONDITION*/
while (TRUE) {
return (FALSE);
}
if (! more_elements) {
return (TRUE); /* we are done */
}
/*
* the unfortunate side effect of non-recursion is that in
* the case of freeing we must remember the next object
* before we free the current object ...
*/
if (freeing)
return (FALSE);
}
if (freeing) {
/*
* Note that in the subsequent iteration, next_copy
* gets nulled out by the xdr_reference
* but next itself survives.
*/
} else {
}
}
/*NOTREACHED*/
}
/*
* xdr_pmaplist() is specified to take a PMAPLIST **, but is identical in
* functionality to xdr_pmaplist_ptr().
*/
{
return (dummy);
}
/*
* XDR remote call arguments
* written for XDR_ENCODE direction only
*/
register struct p_rmtcallargs *cap;
{
register rpc_inline_t *buf;
trace1(TR_xdr_rmtcallargs, 0);
return (FALSE);
}
} else {
}
/*
* All the jugglery for just getting the size of the arguments
*/
return (FALSE);
}
return (FALSE);
}
return (FALSE);
}
return (TRUE);
}
/*
* XDR remote call results
* written for XDR_DECODE direction only
*/
register struct p_rmtcallres *crp;
{
trace1(TR_xdr_rmtcallres, 0);
return (dummy);
}
return (FALSE);
}