|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * The contents of this file constitute Original Code as defined in and ! 7: * are subject to the Apple Public Source License Version 1.1 (the ! 8: * "License"). You may not use this file except in compliance with the ! 9: * License. Please obtain a copy of the License at ! 10: * http://www.apple.com/publicsource and read it before using this file. ! 11: * ! 12: * This Original Code and all software distributed under the License are ! 13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 17: * License for the specific language governing rights and limitations ! 18: * under the License. ! 19: * ! 20: * @APPLE_LICENSE_HEADER_END@ ! 21: */ ! 22: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */ ! 23: /* ! 24: * Copyright (c) 1990, 1982, 1985, 1986, 1988, 1993, 1994 ! 25: * The Regents of the University of California. All rights reserved. ! 26: * ! 27: * Redistribution and use in source and binary forms, with or without ! 28: * modification, are permitted provided that the following conditions ! 29: * are met: ! 30: * 1. Redistributions of source code must retain the above copyright ! 31: * notice, this list of conditions and the following disclaimer. ! 32: * 2. Redistributions in binary form must reproduce the above copyright ! 33: * notice, this list of conditions and the following disclaimer in the ! 34: * documentation and/or other materials provided with the distribution. ! 35: * 3. All advertising materials mentioning features or use of this software ! 36: * must display the following acknowledgement: ! 37: * This product includes software developed by the University of ! 38: * California, Berkeley and its contributors. ! 39: * 4. Neither the name of the University nor the names of its contributors ! 40: * may be used to endorse or promote products derived from this software ! 41: * without specific prior written permission. ! 42: * ! 43: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 44: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 45: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 46: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 47: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 48: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 49: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 50: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 51: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 52: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 53: * SUCH DAMAGE. ! 54: * ! 55: * @(#)ranlib.h 8.1 (Berkeley) 6/2/93 ! 56: */ ! 57: #ifndef _RANLIB_H_ ! 58: #define _RANLIB_H_ ! 59: ! 60: #include <sys/types.h> /* off_t */ ! 61: ! 62: /* ! 63: * There are two known orders of table of contents for archives. The first is ! 64: * the order ranlib(1) originally produced and still produces without any ! 65: * options. This table of contents has the archive member name "__.SYMDEF" ! 66: * This order has the ranlib structures in the order the objects appear in the ! 67: * archive and the symbol names of those objects in the order of symbol table. ! 68: * The second know order is sorted by symbol name and is produced with the -s ! 69: * option to ranlib(1). This table of contents has the archive member name ! 70: * "__.SYMDEF SORTED" and many programs (notably the 1.0 version of ld(1) can't ! 71: * tell the difference between names because of the imbedded blank in the name ! 72: * and works with either table of contents). This second order is used by the ! 73: * post 1.0 link editor to produce faster linking. The original 1.0 version of ! 74: * ranlib(1) gets confused when it is run on a archive with the second type of ! 75: * table of contents because it and ar(1) which it uses use different ways to ! 76: * determined the member name (ar(1) treats all blanks in the name as ! 77: * significant and ranlib(1) only checks for the first one). ! 78: */ ! 79: #define SYMDEF "__.SYMDEF" ! 80: #define SYMDEF_SORTED "__.SYMDEF SORTED" ! 81: ! 82: #define RANLIBMAG "__.SYMDEF" /* archive file name */ ! 83: #define RANLIBSKEW 3 /* creation time offset */ ! 84: ! 85: /* ! 86: * Structure of the __.SYMDEF table of contents for an archive. ! 87: * __.SYMDEF begins with a long giving the size in bytes of the ranlib ! 88: * structures which immediately follow, and then continues with a string ! 89: * table consisting of a long giving the number of bytes of strings which ! 90: * follow and then the strings themselves. The ran_strx fields index the ! 91: * string table whose first byte is numbered 0. ! 92: */ ! 93: struct ranlib { ! 94: union { ! 95: off_t ran_strx; /* string table index of */ ! 96: char *ran_name; /* symbol defined by */ ! 97: } ran_un; ! 98: off_t ran_off; /* library member at this offset */ ! 99: }; ! 100: #endif /* ! _RANLIB_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.