| 1 | /*- |
| 2 | * Copyright (c) 1979 The Regents of the University of California. |
| 3 | * All rights reserved. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions |
| 7 | * are met: |
| 8 | * 1. Redistributions of source code must retain the above copyright |
| 9 | * notice, this list of conditions and the following disclaimer. |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer in the |
| 12 | * documentation and/or other materials provided with the distribution. |
| 13 | * 3. All advertising materials mentioning features or use of this software |
| 14 | * must display the following acknowledgement: |
| 15 | * This product includes software developed by the University of |
| 16 | * California, Berkeley and its contributors. |
| 17 | * 4. Neither the name of the University nor the names of its contributors |
| 18 | * may be used to endorse or promote products derived from this software |
| 19 | * without specific prior written permission. |
| 20 | * |
| 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 | * SUCH DAMAGE. |
| 32 | */ |
| 33 | |
| 34 | #ifndef lint |
| 35 | static char sccsid[] = "@(#)UNPACK.c 1.4 (Berkeley) 4/9/90"; |
| 36 | #endif /* not lint */ |
| 37 | |
| 38 | /* |
| 39 | * unpack(z,a,i) |
| 40 | * |
| 41 | * with: z and a as in pack |
| 42 | * |
| 43 | * semantics: for j := u to v do |
| 44 | * a[j-u+i] := z[j] |
| 45 | */ |
| 46 | |
| 47 | UNPACK(i, a, z, size_a, lb_a, ub_a, size_z) |
| 48 | |
| 49 | long i; /* subscript into a to begin packing */ |
| 50 | char *a; /* pointer to structure a */ |
| 51 | char *z; /* pointer to structure z */ |
| 52 | long size_a; /* sizeof(a_type) */ |
| 53 | long lb_a; /* lower bound of structure a */ |
| 54 | long ub_a; /* (upper bound of a) - (lb_a + sizeof(z_type)) */ |
| 55 | long size_z; /* sizeof(z_type) */ |
| 56 | { |
| 57 | int subscr; |
| 58 | register char *cp; |
| 59 | register char *zp = z; |
| 60 | register char *limit; |
| 61 | |
| 62 | subscr = i - lb_a; |
| 63 | if (subscr < 0 || subscr > ub_a) { |
| 64 | ERROR("i = %D: Bad i to unpack(z,a,i)\n", i); |
| 65 | return; |
| 66 | } |
| 67 | cp = &a[subscr * size_a]; |
| 68 | limit = cp + size_z; |
| 69 | do { |
| 70 | *cp++ = *zp++; |
| 71 | } while (cp < limit); |
| 72 | } |