Return to map.h CVS log

Up to [Net/2] / Net2 / sys

Annotation of Net2/sys/map.h, revision 1.1.1.2

1.1       root        1: /*-
                      2:  * Copyright (c) 1982, 1986, 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:  *
1.1.1.2 ! root       33:  *     from: @(#)map.h 7.5 (Berkeley) 5/7/91
        !            34:  *     map.h,v 1.1 1993/07/06 00:25:46 cgd Exp
1.1       root       35:  */
                     36: 
                     37: /*
                     38:  * Resource allocation maps.
                     39:  *
                     40:  * Associated routines manage sub-allocation of an address space using
                     41:  * an array of segment descriptors.  The first element of this array
                     42:  * is a map structure, describing the arrays extent and the name
                     43:  * of the controlled object.  Each additional structure represents
                     44:  * a free segment of the address space.
                     45:  *
                     46:  * A call to rminit initializes a resource map and may also be used
                     47:  * to free some address space for the map.  Subsequent calls to rmalloc
                     48:  * and rmfree allocate and free space in the resource map.  If the resource
                     49:  * map becomes too fragmented to be described in the available space,
                     50:  * then some of the resource is discarded.  This may lead to critical
                     51:  * shortages, but is better than not checking (as the previous versions
                     52:  * of these routines did) or giving up and calling panic().  The routines
                     53:  * could use linked lists and call a memory allocator when they run
                     54:  * out of space, but that would not solve the out of space problem when
                     55:  * called at interrupt time.
                     56:  *
                     57:  * N.B.: The address 0 in the resource address space is not available
                     58:  * as it is used internally by the resource map routines.
                     59:  */
                     60: struct map {
                     61:        struct  mapent *m_limit;        /* address of last slot in map */
                     62:        char    *m_name;                /* name of resource, for messages */
                     63: };
                     64: 
                     65: struct mapent {
                     66:        int     m_size;                 /* size of this segment of the map */
                     67:        int     m_addr;                 /* start of segment */
                     68: };
                     69: 
                     70: #ifdef KERNEL
                     71: #define        ARGMAPSIZE      16
                     72: struct map *kmemmap, *mbmap, *swapmap;
                     73: int    nswapmap;
                     74: #endif

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.