|
|
1.1 ! root 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 are permitted ! 6: * provided that: (1) source distributions retain this entire copyright ! 7: * notice and comment, and (2) distributions including binaries display ! 8: * the following acknowledgement: ``This product includes software ! 9: * developed by the University of California, Berkeley and its contributors'' ! 10: * in the documentation or other materials provided with the distribution ! 11: * and in all advertising materials mentioning features or use of this ! 12: * software. Neither the name of the University nor the names of its ! 13: * contributors may be used to endorse or promote products derived ! 14: * from this software without specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: */ ! 19: ! 20: #ifndef lint ! 21: static char sccsid[] = "@(#)UNPACK.c 1.4 (Berkeley) 4/9/90"; ! 22: #endif /* not lint */ ! 23: ! 24: /* ! 25: * unpack(z,a,i) ! 26: * ! 27: * with: z and a as in pack ! 28: * ! 29: * semantics: for j := u to v do ! 30: * a[j-u+i] := z[j] ! 31: */ ! 32: ! 33: UNPACK(i, a, z, size_a, lb_a, ub_a, size_z) ! 34: ! 35: long i; /* subscript into a to begin packing */ ! 36: char *a; /* pointer to structure a */ ! 37: char *z; /* pointer to structure z */ ! 38: long size_a; /* sizeof(a_type) */ ! 39: long lb_a; /* lower bound of structure a */ ! 40: long ub_a; /* (upper bound of a) - (lb_a + sizeof(z_type)) */ ! 41: long size_z; /* sizeof(z_type) */ ! 42: { ! 43: int subscr; ! 44: register char *cp; ! 45: register char *zp = z; ! 46: register char *limit; ! 47: ! 48: subscr = i - lb_a; ! 49: if (subscr < 0 || subscr > ub_a) { ! 50: ERROR("i = %D: Bad i to unpack(z,a,i)\n", i); ! 51: return; ! 52: } ! 53: cp = &a[subscr * size_a]; ! 54: limit = cp + size_z; ! 55: do { ! 56: *cp++ = *zp++; ! 57: } while (cp < limit); ! 58: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.