|
|
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: #define KSTART 0x80000000 /* beginning of system space */
10:
11: /*
12: * Virtual memory related (configured) constants
13: */
14: #ifdef KERNEL
15: extern int maxtsize, maxdsize, maxssize; /* max seg sizes, in clicks */
16: #endif
17:
18: /*
19: * space allocated to user page table
20: */
21: #define USRPTSIZE (32*NPTEPG)
22:
23: /*
24: * The size of the clock loop.
25: */
26: #define LOOPPAGES (maxfree - firstfree)
27:
28: /*
29: * The time for a process to be blocked before being very swappable.
30: * This is a number of seconds which the system takes as being a non-trivial
31: * amount of real time. You probably shouldn't change this;
32: * it is used in subtle ways (fractions and multiples of it are, that is, like
33: * half of a ``long time'', almost a long time, etc.)
34: * It is related to human patience and other factors which don't really
35: * change over time.
36: */
37: #define MAXSLP 20
38:
39: /*
40: * A swapped in process is given a small amount of core without being bothered
41: * by the page replacement algorithm. Basically this says that if you are
42: * swapped in you deserve some resources. We protect the last SAFERSS
43: * pages against paging and will just swap you out rather than paging you.
44: * Note that each process has at least UPAGES+CLSIZE pages which are not
45: * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
46: * number just means a swapped in process is given around 25k bytes.
47: * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
48: * so we loan each swapped in process memory worth 100$, or just admit
49: * that we don't consider it worthwhile and swap it out to disk which costs
50: * $30/mb or about $0.75.
51: */
52: #define SAFERSS 32 /* nominal ``small'' resident set size
53: protected against replacement */
54:
55: /*
56: * DISKRPM is used to estimate the number of paging i/o operations
57: * which one can expect from a single disk controller.
58: */
59: #define DISKRPM 60
60:
61: /*
62: * minimum swap allocation piece
63: * perhaps configurable later; for now, fixed
64: */
65: #define DMMIN 32
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. KLMAX*CLSIZE must be <= DMMIN.
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.