]> git.saurik.com Git - apple/libinfo.git/blob - rpc.subproj/xdr.c
Libinfo-503.tar.gz
[apple/libinfo.git] / rpc.subproj / xdr.c
1 /*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7 * Reserved. This file contains Original Code and/or Modifications of
8 * Original Code as defined in and that are subject to the Apple Public
9 * Source License Version 1.1 (the "License"). You may not use this file
10 * except in compliance with the License. Please obtain a copy of the
11 * License at http://www.apple.com/publicsource and read it before using
12 * this file.
13 *
14 * The Original Code and all software distributed under the License are
15 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the
19 * License for the specific language governing rights and limitations
20 * under the License.
21 *
22 * @APPLE_LICENSE_HEADER_END@
23 */
24
25 /* $NetBSD: xdr.c,v 1.22 2000/07/06 03:10:35 christos Exp $ */
26
27 /*
28 * Sun RPC is a product of Sun Microsystems, Inc. and is provided for
29 * unrestricted use provided that this legend is included on all tape
30 * media and as a part of the software program in whole or part. Users
31 * may copy or modify Sun RPC without charge, but are not authorized
32 * to license or distribute it to anyone else except as part of a product or
33 * program developed by the user.
34 *
35 * SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
36 * WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
37 * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
38 *
39 * Sun RPC is provided with no support and without any obligation on the
40 * part of Sun Microsystems, Inc. to assist in its use, correction,
41 * modification or enhancement.
42 *
43 * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
44 * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
45 * OR ANY PART THEREOF.
46 *
47 * In no event will Sun Microsystems, Inc. be liable for any lost revenue
48 * or profits or other special, indirect and consequential damages, even if
49 * Sun has been advised of the possibility of such damages.
50 *
51 * Sun Microsystems, Inc.
52 * 2550 Garcia Avenue
53 * Mountain View, California 94043
54 */
55
56 #if defined(LIBC_SCCS) && !defined(lint)
57 static char *sccsid = "@(#)xdr.c 1.35 87/08/12";
58 static char *sccsid = "@(#)xdr.c 2.1 88/07/29 4.0 RPCSRC";
59 #endif
60 #include <sys/cdefs.h>
61
62 /*
63 * xdr.c, Generic XDR routines implementation.
64 *
65 * Copyright (C) 1986, Sun Microsystems, Inc.
66 *
67 * These are the "generic" xdr routines used to serialize and de-serialize
68 * most common data items. See xdr.h for more info on the interface to
69 * xdr.
70 */
71
72 #include <err.h>
73 #include <stdio.h>
74 #include <stdlib.h>
75 #include <string.h>
76
77 #include <rpc/types.h>
78 #include <rpc/xdr.h>
79
80 #ifdef __LP64__
81 #define xdrlong_t int
82 #else
83 #define xdrlong_t long
84 #endif
85
86 typedef quad_t longlong_t; /* ANSI long long type */
87 typedef u_quad_t u_longlong_t; /* ANSI unsigned long long type */
88
89 /*
90 * constants specific to the xdr "protocol"
91 */
92 #ifdef __LP64__
93 #define XDR_FALSE ((int) 0)
94 #define XDR_TRUE ((int) 1)
95 #else
96 #define XDR_FALSE ((long) 0)
97 #define XDR_TRUE ((long) 1)
98 #endif
99 #define LASTUNSIGNED ((u_int) 0-1)
100
101 /*
102 * for unit alignment
103 */
104 static const char xdr_zero[BYTES_PER_XDR_UNIT] = { 0, 0, 0, 0 };
105
106 /*
107 * Free a data structure using XDR
108 * Not a filter, but a convenient utility nonetheless
109 */
110 void
111 xdr_free(proc, objp)
112 xdrproc_t proc;
113 void *objp;
114 {
115 XDR x;
116
117 x.x_op = XDR_FREE;
118 (*proc)(&x, objp, 0);
119 }
120
121 /*
122 * XDR nothing
123 */
124 bool_t
125 xdr_void(void)
126 {
127
128 return (TRUE);
129 }
130
131
132 /*
133 * XDR integers
134 */
135 bool_t
136 xdr_int(xdrs, ip)
137 XDR *xdrs;
138 int *ip;
139 {
140 xdrlong_t l;
141
142 switch (xdrs->x_op) {
143
144 case XDR_ENCODE:
145 l = *ip;
146 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
147
148 case XDR_DECODE:
149 if (!XDR_GETLONG(xdrs, &l)) {
150 return (FALSE);
151 }
152 *ip = l;
153 return (TRUE);
154
155 case XDR_FREE:
156 return (TRUE);
157 }
158 /* NOTREACHED */
159 return (FALSE);
160 }
161
162 /*
163 * XDR unsigned integers
164 */
165 bool_t
166 xdr_u_int(xdrs, up)
167 XDR *xdrs;
168 u_int *up;
169 {
170 xdrlong_t l;
171
172 switch (xdrs->x_op) {
173
174 case XDR_ENCODE:
175 l = *up;
176 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
177
178 case XDR_DECODE:
179 if (!XDR_GETLONG(xdrs, &l)) {
180 return (FALSE);
181 }
182 *up = l;
183 return (TRUE);
184
185 case XDR_FREE:
186 return (TRUE);
187 }
188 /* NOTREACHED */
189 return (FALSE);
190 }
191
192
193 /*
194 * XDR long integers
195 * same as xdr_u_long - open coded to save a proc call!
196 */
197 bool_t
198 xdr_long(xdrs, lp)
199 XDR *xdrs;
200 #ifdef __LP64__
201 int *lp;
202 #else
203 long *lp;
204 #endif
205 {
206 switch (xdrs->x_op) {
207 case XDR_ENCODE:
208 return (XDR_PUTLONG(xdrs, lp));
209 case XDR_DECODE:
210 return (XDR_GETLONG(xdrs, lp));
211 case XDR_FREE:
212 return (TRUE);
213 }
214 /* NOTREACHED */
215 return (FALSE);
216 }
217
218 /*
219 * XDR unsigned long integers
220 * same as xdr_long - open coded to save a proc call!
221 */
222 bool_t
223 xdr_u_long(xdrs, ulp)
224 XDR *xdrs;
225 #ifdef __LP64__
226 unsigned int *ulp;
227 #else
228 u_long *ulp;
229 #endif
230 {
231 switch (xdrs->x_op) {
232 case XDR_ENCODE:
233 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)ulp));
234 case XDR_DECODE:
235 return (XDR_GETLONG(xdrs, (xdrlong_t *)ulp));
236 case XDR_FREE:
237 return (TRUE);
238 }
239 /* NOTREACHED */
240 return (FALSE);
241 }
242
243
244 /*
245 * XDR 32-bit integers
246 * same as xdr_u_int32_t - open coded to save a proc call!
247 */
248 bool_t
249 xdr_int32_t(xdrs, int32_p)
250 XDR *xdrs;
251 int32_t *int32_p;
252 {
253 xdrlong_t l;
254
255 switch (xdrs->x_op) {
256
257 case XDR_ENCODE:
258 l = *int32_p;
259 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
260
261 case XDR_DECODE:
262 if (!XDR_GETLONG(xdrs, &l)) {
263 return (FALSE);
264 }
265 *int32_p = l;
266 return (TRUE);
267
268 case XDR_FREE:
269 return (TRUE);
270 }
271 /* NOTREACHED */
272 return (FALSE);
273 }
274
275 /*
276 * XDR unsigned 32-bit integers
277 * same as xdr_int32_t - open coded to save a proc call!
278 */
279 bool_t
280 xdr_u_int32_t(xdrs, u_int32_p)
281 XDR *xdrs;
282 u_int32_t *u_int32_p;
283 {
284 u_int32_t l;
285
286 switch (xdrs->x_op) {
287
288 case XDR_ENCODE:
289 l = *u_int32_p;
290 return (XDR_PUTLONG(xdrs, (xdrlong_t *)&l));
291
292 case XDR_DECODE:
293 if (!XDR_GETLONG(xdrs, (xdrlong_t *)&l)) return (FALSE);
294 *u_int32_p = l;
295 return (TRUE);
296
297 case XDR_FREE:
298 return (TRUE);
299 }
300 /* NOTREACHED */
301 return (FALSE);
302 }
303
304
305 /*
306 * XDR short integers
307 */
308 bool_t
309 xdr_short(xdrs, sp)
310 XDR *xdrs;
311 short *sp;
312 {
313 xdrlong_t l;
314
315 switch (xdrs->x_op) {
316
317 case XDR_ENCODE:
318 l = *sp;
319 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
320
321 case XDR_DECODE:
322 if (!XDR_GETLONG(xdrs, &l)) {
323 return (FALSE);
324 }
325 *sp = l;
326 return (TRUE);
327
328 case XDR_FREE:
329 return (TRUE);
330 }
331 /* NOTREACHED */
332 return (FALSE);
333 }
334
335 /*
336 * XDR unsigned short integers
337 */
338 bool_t
339 xdr_u_short(xdrs, usp)
340 XDR *xdrs;
341 u_short *usp;
342 {
343 xdrlong_t l;
344
345 switch (xdrs->x_op) {
346
347 case XDR_ENCODE:
348 l = *usp;
349 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
350
351 case XDR_DECODE:
352 if (!XDR_GETLONG(xdrs, &l)) {
353 return (FALSE);
354 }
355 *usp = l;
356 return (TRUE);
357
358 case XDR_FREE:
359 return (TRUE);
360 }
361 /* NOTREACHED */
362 return (FALSE);
363 }
364
365
366 /*
367 * XDR 16-bit integers
368 */
369 bool_t
370 xdr_int16_t(xdrs, int16_p)
371 XDR *xdrs;
372 int16_t *int16_p;
373 {
374 xdrlong_t l;
375
376 switch (xdrs->x_op) {
377
378 case XDR_ENCODE:
379 l = *int16_p;
380 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
381
382 case XDR_DECODE:
383 if (!XDR_GETLONG(xdrs, &l)) {
384 return (FALSE);
385 }
386 *int16_p = l;
387 return (TRUE);
388
389 case XDR_FREE:
390 return (TRUE);
391 }
392 /* NOTREACHED */
393 return (FALSE);
394 }
395
396 /*
397 * XDR unsigned 16-bit integers
398 */
399 bool_t
400 xdr_u_int16_t(xdrs, u_int16_p)
401 XDR *xdrs;
402 u_int16_t *u_int16_p;
403 {
404 xdrlong_t l;
405
406 switch (xdrs->x_op) {
407
408 case XDR_ENCODE:
409 l = *u_int16_p;
410 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&l));
411
412 case XDR_DECODE:
413 if (!XDR_GETLONG(xdrs, &l)) {
414 return (FALSE);
415 }
416 *u_int16_p = l;
417 return (TRUE);
418
419 case XDR_FREE:
420 return (TRUE);
421 }
422 /* NOTREACHED */
423 return (FALSE);
424 }
425
426
427 /*
428 * XDR a char
429 */
430 bool_t
431 xdr_char(xdrs, cp)
432 XDR *xdrs;
433 char *cp;
434 {
435 int i;
436
437 i = (*cp);
438 if (!xdr_int(xdrs, &i)) {
439 return (FALSE);
440 }
441 *cp = i;
442 return (TRUE);
443 }
444
445 /*
446 * XDR an unsigned char
447 */
448 bool_t
449 xdr_u_char(xdrs, cp)
450 XDR *xdrs;
451 u_char *cp;
452 {
453 u_int32_t u;
454
455 u = (*cp);
456 if (!xdr_u_int(xdrs, &u)) {
457 return (FALSE);
458 }
459 *cp = u;
460 return (TRUE);
461 }
462
463 /*
464 * XDR booleans
465 */
466 bool_t
467 xdr_bool(xdrs, bp)
468 XDR *xdrs;
469 bool_t *bp;
470 {
471 xdrlong_t lb;
472
473 switch (xdrs->x_op) {
474
475 case XDR_ENCODE:
476 lb = *bp ? XDR_TRUE : XDR_FALSE;
477 return (XDR_PUTLONG(xdrs, (const xdrlong_t *)&lb));
478
479 case XDR_DECODE:
480 if (!XDR_GETLONG(xdrs, &lb)) {
481 return (FALSE);
482 }
483 *bp = (lb == XDR_FALSE) ? FALSE : TRUE;
484 return (TRUE);
485
486 case XDR_FREE:
487 return (TRUE);
488 }
489 /* NOTREACHED */
490 return (FALSE);
491 }
492
493 /*
494 * XDR enumerations
495 */
496 bool_t
497 xdr_enum(xdrs, ep)
498 XDR *xdrs;
499 enum_t *ep;
500 {
501 enum sizecheck { SIZEVAL }; /* used to find the size of an enum */
502
503 /*
504 * enums are treated as ints
505 */
506 /* LINTED */ if (sizeof (enum sizecheck) == sizeof (int)) {
507 return (xdr_long(xdrs, (xdrlong_t *)(void *)ep));
508 } else /* LINTED */ if (sizeof (enum sizecheck) == sizeof (int)) {
509 return (xdr_int(xdrs, (int *)(void *)ep));
510 } else /* LINTED */ if (sizeof (enum sizecheck) == sizeof (short)) {
511 return (xdr_short(xdrs, (short *)(void *)ep));
512 } else {
513 return (FALSE);
514 }
515 }
516
517 /*
518 * XDR opaque data
519 * Allows the specification of a fixed size sequence of opaque bytes.
520 * cp points to the opaque object and cnt gives the byte length.
521 */
522 bool_t
523 xdr_opaque(xdrs, cp, cnt)
524 XDR *xdrs;
525 caddr_t cp;
526 u_int cnt;
527 {
528 u_int32_t rndup;
529 u_int8_t crud[BYTES_PER_XDR_UNIT];
530
531 /*
532 * if no data we are done
533 */
534 if (cnt == 0)
535 return (TRUE);
536
537 /*
538 * round byte count to full xdr units
539 */
540 rndup = cnt % BYTES_PER_XDR_UNIT;
541 if (rndup > 0)
542 rndup = BYTES_PER_XDR_UNIT - rndup;
543
544 if (xdrs->x_op == XDR_DECODE) {
545 if (!XDR_GETBYTES(xdrs, cp, cnt)) {
546 return (FALSE);
547 }
548 if (rndup == 0)
549 return (TRUE);
550 return (XDR_GETBYTES(xdrs, (caddr_t)(void *)crud, rndup));
551 }
552
553 if (xdrs->x_op == XDR_ENCODE) {
554 if (!XDR_PUTBYTES(xdrs, cp, cnt)) {
555 return (FALSE);
556 }
557 if (rndup == 0)
558 return (TRUE);
559 return (XDR_PUTBYTES(xdrs, xdr_zero, rndup));
560 }
561
562 if (xdrs->x_op == XDR_FREE) {
563 return (TRUE);
564 }
565
566 return (FALSE);
567 }
568
569 /*
570 * XDR counted bytes
571 * *cpp is a pointer to the bytes, *sizep is the count.
572 * If *cpp is NULL maxsize bytes are allocated
573 */
574 bool_t
575 xdr_bytes(xdrs, cpp, sizep, maxsize)
576 XDR *xdrs;
577 char **cpp;
578 u_int *sizep;
579 u_int maxsize;
580 {
581 char *sp = *cpp; /* sp is the actual string pointer */
582 u_int32_t nodesize;
583
584 /*
585 * first deal with the length since xdr bytes are counted
586 */
587 if (! xdr_u_int(xdrs, sizep)) {
588 return (FALSE);
589 }
590 nodesize = *sizep;
591 if ((nodesize > maxsize) && (xdrs->x_op != XDR_FREE)) {
592 return (FALSE);
593 }
594
595 /*
596 * now deal with the actual bytes
597 */
598 switch (xdrs->x_op) {
599
600 case XDR_DECODE:
601 if (nodesize == 0) {
602 return (TRUE);
603 }
604 if (sp == NULL) {
605 *cpp = sp = mem_alloc(nodesize);
606 }
607 if (sp == NULL) {
608 warnx("xdr_bytes: out of memory");
609 return (FALSE);
610 }
611 /* FALLTHROUGH */
612
613 case XDR_ENCODE:
614 return (xdr_opaque(xdrs, sp, nodesize));
615
616 case XDR_FREE:
617 if (sp != NULL) {
618 mem_free(sp, nodesize);
619 *cpp = NULL;
620 }
621 return (TRUE);
622 }
623 /* NOTREACHED */
624 return (FALSE);
625 }
626
627 /*
628 * Implemented here due to commonality of the object.
629 */
630 bool_t
631 xdr_netobj(xdrs, np)
632 XDR *xdrs;
633 struct netobj *np;
634 {
635
636 return (xdr_bytes(xdrs, &np->n_bytes, &np->n_len, MAX_NETOBJ_SZ));
637 }
638
639 /*
640 * XDR a descriminated union
641 * Support routine for discriminated unions.
642 * You create an array of xdrdiscrim structures, terminated with
643 * an entry with a null procedure pointer. The routine gets
644 * the discriminant value and then searches the array of xdrdiscrims
645 * looking for that value. It calls the procedure given in the xdrdiscrim
646 * to handle the discriminant. If there is no specific routine a default
647 * routine may be called.
648 * If there is no specific or default routine an error is returned.
649 */
650 bool_t
651 xdr_union(xdrs, dscmp, unp, choices, dfault)
652 XDR *xdrs;
653 enum_t *dscmp; /* enum to decide which arm to work on */
654 char *unp; /* the union itself */
655 const struct xdr_discrim *choices; /* [value, xdr proc] for each arm */
656 xdrproc_t dfault; /* default xdr routine */
657 {
658 enum_t dscm;
659
660 /*
661 * we deal with the discriminator; it's an enum
662 */
663 if (! xdr_enum(xdrs, dscmp)) {
664 return (FALSE);
665 }
666 dscm = *dscmp;
667
668 /*
669 * search choices for a value that matches the discriminator.
670 * if we find one, execute the xdr routine for that value.
671 */
672 for (; choices->proc != NULL_xdrproc_t; choices++) {
673 if (choices->value == dscm)
674 return ((*(choices->proc))(xdrs, unp, 0));
675 }
676
677 /*
678 * no match - execute the default xdr routine if there is one
679 */
680 return ((dfault == NULL_xdrproc_t) ? FALSE :
681 (*dfault)(xdrs, unp, 0));
682 }
683
684
685 /*
686 * Non-portable xdr primitives.
687 * Care should be taken when moving these routines to new architectures.
688 */
689
690
691 /*
692 * XDR null terminated ASCII strings
693 * xdr_string deals with "C strings" - arrays of bytes that are
694 * terminated by a NULL character. The parameter cpp references a
695 * pointer to storage; If the pointer is null, then the necessary
696 * storage is allocated. The last parameter is the max allowed length
697 * of the string as specified by a protocol.
698 */
699 bool_t
700 xdr_string(xdrs, cpp, maxsize)
701 XDR *xdrs;
702 char **cpp;
703 u_int maxsize;
704 {
705 char *sp = *cpp; /* sp is the actual string pointer */
706 u_int32_t size;
707 u_int32_t nodesize;
708
709 /*
710 * first deal with the length since xdr strings are counted-strings
711 */
712 switch (xdrs->x_op) {
713 case XDR_FREE:
714 if (sp == NULL) {
715 return(TRUE); /* already free */
716 }
717 /* FALLTHROUGH */
718 case XDR_ENCODE:
719 size = strlen(sp);
720 break;
721 case XDR_DECODE:
722 break;
723 }
724 if (! xdr_u_int(xdrs, &size)) {
725 return (FALSE);
726 }
727 if (size > maxsize) {
728 return (FALSE);
729 }
730 nodesize = size + 1;
731
732 /*
733 * now deal with the actual bytes
734 */
735 switch (xdrs->x_op) {
736
737 case XDR_DECODE:
738 if (nodesize == 0) {
739 return (TRUE);
740 }
741 if (sp == NULL)
742 *cpp = sp = mem_alloc(nodesize);
743 if (sp == NULL) {
744 warnx("xdr_string: out of memory");
745 return (FALSE);
746 }
747 sp[size] = 0;
748 /* FALLTHROUGH */
749
750 case XDR_ENCODE:
751 return (xdr_opaque(xdrs, sp, size));
752
753 case XDR_FREE:
754 mem_free(sp, nodesize);
755 *cpp = NULL;
756 return (TRUE);
757 }
758 /* NOTREACHED */
759 return (FALSE);
760 }
761
762 /*
763 * Wrapper for xdr_string that can be called directly from
764 * routines like clnt_call
765 */
766 bool_t
767 xdr_wrapstring(xdrs, cpp)
768 XDR *xdrs;
769 char **cpp;
770 {
771 return xdr_string(xdrs, cpp, LASTUNSIGNED);
772 }
773
774 /*
775 * NOTE: xdr_hyper(), xdr_u_hyper(), xdr_longlong_t(), and xdr_u_longlong_t()
776 * are in the "non-portable" section because they require that a `long long'
777 * be a 64-bit type.
778 *
779 * --thorpej@netbsd.org, November 30, 1999
780 */
781
782 /*
783 * XDR 64-bit integers
784 */
785 bool_t
786 xdr_int64_t(xdrs, llp)
787 XDR *xdrs;
788 int64_t *llp;
789 {
790 u_int32_t ul[2];
791
792 switch (xdrs->x_op) {
793 case XDR_ENCODE:
794 ul[0] = (u_int32_t)((u_int64_t)*llp >> 32) & 0xffffffff;
795 ul[1] = (u_int32_t)((u_int64_t)*llp) & 0xffffffff;
796 if (XDR_PUTLONG(xdrs, (xdrlong_t *)&ul[0]) == FALSE)
797 return (FALSE);
798 return (XDR_PUTLONG(xdrs, (xdrlong_t *)&ul[1]));
799 case XDR_DECODE:
800 if (XDR_GETLONG(xdrs, (xdrlong_t *)&ul[0]) == FALSE)
801 return (FALSE);
802 if (XDR_GETLONG(xdrs, (xdrlong_t *)&ul[1]) == FALSE)
803 return (FALSE);
804 *llp = (int64_t)
805 (((u_int64_t)ul[0] << 32) | ((u_int64_t)ul[1]));
806 return (TRUE);
807 case XDR_FREE:
808 return (TRUE);
809 }
810 /* NOTREACHED */
811 return (FALSE);
812 }
813
814
815 /*
816 * XDR unsigned 64-bit integers
817 */
818 bool_t
819 xdr_u_int64_t(xdrs, ullp)
820 XDR *xdrs;
821 u_int64_t *ullp;
822 {
823 u_int32_t ul[2];
824
825 switch (xdrs->x_op) {
826 case XDR_ENCODE:
827 ul[0] = (u_int32_t)(*ullp >> 32) & 0xffffffff;
828 ul[1] = (u_int32_t)(*ullp) & 0xffffffff;
829 if (XDR_PUTLONG(xdrs, (xdrlong_t *)&ul[0]) == FALSE)
830 return (FALSE);
831 return (XDR_PUTLONG(xdrs, (xdrlong_t *)&ul[1]));
832 case XDR_DECODE:
833 if (XDR_GETLONG(xdrs, (xdrlong_t *)&ul[0]) == FALSE)
834 return (FALSE);
835 if (XDR_GETLONG(xdrs, (xdrlong_t *)&ul[1]) == FALSE)
836 return (FALSE);
837 *ullp = (u_int64_t)
838 (((u_int64_t)ul[0] << 32) | ((u_int64_t)ul[1]));
839 return (TRUE);
840 case XDR_FREE:
841 return (TRUE);
842 }
843 /* NOTREACHED */
844 return (FALSE);
845 }
846
847
848 /*
849 * XDR hypers
850 */
851 bool_t
852 xdr_hyper(xdrs, llp)
853 XDR *xdrs;
854 longlong_t *llp;
855 {
856 /*
857 * Don't bother open-coding this; it's a fair amount of code. Just
858 * call xdr_int64_t().
859 */
860 return (xdr_int64_t(xdrs, (int64_t *)llp));
861 }
862
863
864 /*
865 * XDR unsigned hypers
866 */
867 bool_t
868 xdr_u_hyper(xdrs, ullp)
869 XDR *xdrs;
870 u_longlong_t *ullp;
871 {
872 /*
873 * Don't bother open-coding this; it's a fair amount of code. Just
874 * call xdr_u_int64_t().
875 */
876 return (xdr_u_int64_t(xdrs, (u_int64_t *)ullp));
877 }
878
879
880 /*
881 * XDR longlong_t's
882 */
883 bool_t
884 xdr_longlong_t(xdrs, llp)
885 XDR *xdrs;
886 longlong_t *llp;
887 {
888 /*
889 * Don't bother open-coding this; it's a fair amount of code. Just
890 * call xdr_int64_t().
891 */
892 return (xdr_int64_t(xdrs, (int64_t *)llp));
893 }
894
895
896 /*
897 * XDR u_longlong_t's
898 */
899 bool_t
900 xdr_u_longlong_t(xdrs, ullp)
901 XDR *xdrs;
902 u_longlong_t *ullp;
903 {
904
905 /*
906 * Don't bother open-coding this; it's a fair amount of code. Just
907 * call xdr_u_int64_t().
908 */
909 return (xdr_u_int64_t(xdrs, (u_int64_t *)ullp));
910 }