Annotation of 43BSDTahoe/sys/h/dmap.h, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1982, 1986 Regents of the University of California.
                      3:  * All rights reserved.  The Berkeley software License Agreement
                      4:  * specifies the terms and conditions for redistribution.
                      5:  *
                      6:  *     @(#)dmap.h      7.1 (Berkeley) 6/4/86
                      7:  */
                      8: 
                      9: /*
                     10:  * Definitions for the mapping of vitual swap
                     11:  * space to the physical swap area - the disk map.
                     12:  */
                     13: 
                     14: #define        NDMAP           38      /* size of the swap area map */
                     15: 
                     16: struct dmap
                     17: {
                     18:        swblk_t dm_size;        /* current size used by process */
                     19:        swblk_t dm_alloc;       /* amount of physical swap space allocated */
                     20:        swblk_t dm_map[NDMAP];  /* first disk block number in each chunk */
                     21: };
                     22: #ifdef KERNEL
                     23: struct dmap zdmap;
                     24: int    dmmin, dmmax, dmtext;
                     25: #endif
                     26: 
                     27: /*
                     28:  * The following structure is that ``returned''
                     29:  * from a call to vstodb().
                     30:  */
                     31: struct dblock
                     32: {
                     33:        swblk_t db_base;        /* base of physical contig drum block */
                     34:        swblk_t db_size;        /* size of block */
                     35: };

unix.superglobalmegacorp.com

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