Return to vmparam.h CVS log

Up to [Research Unix] / researchv9 / sys.vax / h

Annotation of researchv9/sys.vax/h/vmparam.h, revision 1.1

1.1     ! root        1: /*
        !             2:  * Machine dependent constants
        !             3:  */
        !             4: #define        NPTEPG          (NBPG/(sizeof (struct pte)))
        !             5:                                        /* number of ptes per page */
        !             6: #define        USRSTACK        (0x80000000-UPAGES*NBPG)
        !             7:                                        /* Start of user stack */
        !             8: #define        P1TOP           0x200000        /* boundary between P0 and P1 regions */
        !             9: 
        !            10: /*
        !            11:  * Virtual memory related constants
        !            12:  */
        !            13: #define        SLOP    32
        !            14: #define        MAXTSIZ         (3*2048-SLOP)           /* max text size (clicks) */
        !            15: #ifdef BIGMEM
        !            16: #define        MAXDSIZ         (56*1024-32-SLOP)       /* max data size (clicks) */
        !            17: #else
        !            18: #define        MAXDSIZ         (24*1024-32-SLOP)       /* max data size (clicks) */
        !            19: #endif
        !            20: #define        MAXSSIZ         (12*1024-32-SLOP)       /* max stack size (clicks) */
        !            21: 
        !            22: /*
        !            23:  * Sizes of the system and user portions of the system page table.
        !            24:  */
        !            25: /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */
        !            26: #define        SYSPTSIZE       (40*NPTEPG)
        !            27: #define        USRPTSIZE       (8*NPTEPG)
        !            28: 
        !            29: /*
        !            30:  * The size of the clock loop.
        !            31:  */
        !            32: #define        LOOPPAGES       (maxfree - firstfree)
        !            33: 
        !            34: /*
        !            35:  * The time for a process to be blocked before being very swappable.
        !            36:  * This is a number of seconds which the system takes as being a non-trivial
        !            37:  * amount of real time.  You probably shouldn't change this;
        !            38:  * it is used in subtle ways (fractions and multiples of it are, that is, like
        !            39:  * half of a ``long time'', almost a long time, etc.)
        !            40:  * It is related to human patience and other factors which don't really
        !            41:  * change over time.
        !            42:  */
        !            43: #define        MAXSLP          20
        !            44: 
        !            45: /*
        !            46:  * A swapped in process is given a small amount of core without being bothered
        !            47:  * by the page replacement algorithm.  Basically this says that if you are
        !            48:  * swapped in you deserve some resources.  We protect the last SAFERSS
        !            49:  * pages against paging and will just swap you out rather than paging you.
        !            50:  * Note that each process has at least UPAGES+CLSIZE pages which are not
        !            51:  * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
        !            52:  * number just means a swapped in process is given around 25k bytes.
        !            53:  * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
        !            54:  * so we loan each swapped in process memory worth 100$, or just admit
        !            55:  * that we don't consider it worthwhile and swap it out to disk which costs
        !            56:  * $30/mb or about $0.75.
        !            57:  */
        !            58: #define        SAFERSS         32              /* nominal ``small'' resident set size
        !            59:                                           protected against replacement */
        !            60: 
        !            61: /*
        !            62:  * DISKRPM is used to estimate the number of paging i/o operations
        !            63:  * which one can expect from a single disk controller.
        !            64:  */
        !            65: #define        DISKRPM         60
        !            66: 
        !            67: /*
        !            68:  * Klustering constants.  Klustering is the gathering
        !            69:  * of pages together for pagein/pageout, while clustering
        !            70:  * is the treatment of hardware page size as though it were
        !            71:  * larger than it really is.
        !            72:  *
        !            73:  * KLMAX gives maximum cluster size in CLSIZE page (cluster-page)
        !            74:  * units.  Note that KLMAX*CLSIZE must be <= DMMIN in dmap.h.
        !            75:  */
        !            76: 
        !            77: #define        KLMAX   (32/CLSIZE)
        !            78: #define        KLSEQL  (16/CLSIZE)             /* in klust if vadvise(VA_SEQL) */
        !            79: #define        KLIN    (8/CLSIZE)              /* default data/stack in klust */
        !            80: #define        KLTXT   (4/CLSIZE)              /* default text in klust */
        !            81: #define        KLOUT   (32/CLSIZE)
        !            82: 
        !            83: /*
        !            84:  * KLSDIST is the advance or retard of the fifo reclaim for sequential
        !            85:  * processes data space.
        !            86:  */
        !            87: #define        KLSDIST 3               /* klusters advance/retard for seq. fifo */
        !            88: 
        !            89: #ifdef KERNEL
        !            90: int    klseql;
        !            91: int    klsdist;
        !            92: int    klin;
        !            93: int    kltxt;
        !            94: int    klout;
        !            95: #endif

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