[unix-history] / usr / src / sys / vax / include / vmparam.h

/*	vmparam.h	6.4	85/03/07	*/

/*
 * Machine dependent constants for VAX
 */
/*
 * USRTEXT is the start of the user text/data space, while USRSTACK
 * is the top (end) of the user stack.  LOWPAGES and HIGHPAGES are
 * the number of pages from the beginning of the P0 region to the
 * beginning of the text and from the beginning of the P1 region to the
 * beginning of the stack respectively.
 */
#define	USRTEXT		0
#define	USRSTACK	(0x80000000-UPAGES*NBPG) /* Start of user stack */
#define	BTOPUSRSTACK	(0x400000 - UPAGES)	 /* btop(USRSTACK) */
/* number of ptes per page */
#define	P1PAGES		0x200000	/* number of pages in P1 region */
#define	LOWPAGES	0
#define	HIGHPAGES	UPAGES

/*
 * Virtual memory related constants
 */
#define	SLOP	32
#define	MAXTSIZ		(6*2048-SLOP)		/* max text size (clicks) */
#ifndef MAXDSIZ
#define	MAXDSIZ		(12*1024-32-SLOP)	/* max data size (clicks) */
#endif
#define	MAXSSIZ		(12*1024-32-SLOP)	/* max stack size (clicks) */

/*
 * Sizes of the system and user portions of the system page table.
 */
/* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */
#define	SYSPTSIZE	((20+MAXUSERS)*NPTEPG)
#define	USRPTSIZE 	(8*NPTEPG)

/*
 * The size of the clock loop.
 */
#define	LOOPPAGES	(maxfree - firstfree)

/*
 * The time for a process to be blocked before being very swappable.
 * This is a number of seconds which the system takes as being a non-trivial
 * amount of real time.  You probably shouldn't change this;
 * it is used in subtle ways (fractions and multiples of it are, that is, like
 * half of a ``long time'', almost a long time, etc.)
 * It is related to human patience and other factors which don't really
 * change over time.
 */
#define	MAXSLP 		20

/*
 * A swapped in process is given a small amount of core without being bothered
 * by the page replacement algorithm.  Basically this says that if you are
 * swapped in you deserve some resources.  We protect the last SAFERSS
 * pages against paging and will just swap you out rather than paging you.
 * Note that each process has at least UPAGES+CLSIZE pages which are not
 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
 * number just means a swapped in process is given around 25k bytes.
 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
 * so we loan each swapped in process memory worth 100$, or just admit
 * that we don't consider it worthwhile and swap it out to disk which costs
 * $30/mb or about $0.75.
 */
#define	SAFERSS		32		/* nominal ``small'' resident set size
					   protected against replacement */

/*
 * DISKRPM is used to estimate the number of paging i/o operations
 * which one can expect from a single disk controller.
 */
#define	DISKRPM		60

/*
 * Klustering constants.  Klustering is the gathering
 * of pages together for pagein/pageout, while clustering
 * is the treatment of hardware page size as though it were
 * larger than it really is.
 *
 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page)
 * units.  Note that KLMAX*CLSIZE must be <= DMMIN in dmap.h.
 */

#define	KLMAX	(32/CLSIZE)
#define	KLSEQL	(16/CLSIZE)		/* in klust if vadvise(VA_SEQL) */
#define	KLIN	(8/CLSIZE)		/* default data/stack in klust */
#define	KLTXT	(4/CLSIZE)		/* default text in klust */
#define	KLOUT	(32/CLSIZE)

/*
 * KLSDIST is the advance or retard of the fifo reclaim for sequential
 * processes data space.
 */
#define	KLSDIST	3		/* klusters advance/retard for seq. fifo */

/*
 * Paging thresholds (see vm_sched.c).
 * Strategy of 1/19/85:
 *	lotsfree is 512k bytes, but at most 1/4 of memory
 *	desfree is 200k bytes, but at most 1/8 of memory
 *	minfree is 64k bytes, but at most 1/2 of desfree
 */
#define	LOTSFREE	(512 * 1024)
#define	LOTSFREEFRACT	4
#define	DESFREE		(200 * 1024)
#define	DESFREEFRACT	8
#define	MINFREE		(64 * 1024)
#define	MINFREEFRACT	2

/*
 * There are two clock hands, initially separated by HANDSPREAD bytes
 * (but at most all of user memory).  The amount of time to reclaim
 * a page once the pageout process examines it increases with this
 * distance and decreases as the scan rate rises.
 */
#define	HANDSPREAD	(2 * 1024 * 1024)

/*
 * The number of times per second to recompute the desired paging rate
 * and poke the pagedaemon.
 */
#define	RATETOSCHEDPAGING	4

/*
 * Believed threshold (in megabytes) for which interleaved
 * swapping area is desirable.
 */
#define	LOTSOFMEM	2

/*
 * BEWARE THIS DEFINITION WORKS ONLY WITH COUNT OF 1
 */
#define	mapin(pte, v, pfnum, count, prot) \
	(*(int *)(pte) = (pfnum) | (prot), mtpr(TBIS, ptob(v)))
Commit	Line	Data
00c24382	1	/* vmparam.h 6.4 85/03/07 */
f9390752 SL	2
	3	/*
	4	* Machine dependent constants for VAX
	5	*/
	6	/*
	7	* USRTEXT is the start of the user text/data space, while USRSTACK
	8	* is the top (end) of the user stack. LOWPAGES and HIGHPAGES are
	9	* the number of pages from the beginning of the P0 region to the
	10	* beginning of the text and from the beginning of the P1 region to the
	11	* beginning of the stack respectively.
	12	*/
f9390752	13	#define USRTEXT 0
35495388 KM	14	#define USRSTACK (0x80000000-UPAGESNBPG) / Start of user stack */
	15	#define BTOPUSRSTACK (0x400000 - UPAGES) /* btop(USRSTACK) */
	16	/* number of ptes per page */
f9390752 SL	17	#define P1PAGES 0x200000 /* number of pages in P1 region */
	18	#define LOWPAGES 0
	19	#define HIGHPAGES UPAGES
	20
	21	/*
	22	* Virtual memory related constants
	23	*/
	24	#define SLOP 32
	25	#define MAXTSIZ (62048-SLOP) / max text size (clicks) */
	26	#ifndef MAXDSIZ
	27	#define MAXDSIZ (121024-32-SLOP) / max data size (clicks) */
	28	#endif
	29	#define MAXSSIZ (121024-32-SLOP) / max stack size (clicks) */
	30
	31	/*
	32	* Sizes of the system and user portions of the system page table.
	33	*/
	34	/* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */
57be5610	35	#define SYSPTSIZE ((20+MAXUSERS)*NPTEPG)
f9390752 SL	36	#define USRPTSIZE (8*NPTEPG)
	37
	38	/*
	39	* The size of the clock loop.
	40	*/
	41	#define LOOPPAGES (maxfree - firstfree)
	42
	43	/*
	44	* The time for a process to be blocked before being very swappable.
	45	* This is a number of seconds which the system takes as being a non-trivial
	46	* amount of real time. You probably shouldn't change this;
	47	* it is used in subtle ways (fractions and multiples of it are, that is, like
	48	* half of a ``long time'', almost a long time, etc.)
	49	* It is related to human patience and other factors which don't really
	50	* change over time.
	51	*/
	52	#define MAXSLP 20
	53
	54	/*
	55	* A swapped in process is given a small amount of core without being bothered
	56	* by the page replacement algorithm. Basically this says that if you are
	57	* swapped in you deserve some resources. We protect the last SAFERSS
	58	* pages against paging and will just swap you out rather than paging you.
	59	* Note that each process has at least UPAGES+CLSIZE pages which are not
	60	* paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
	61	* number just means a swapped in process is given around 25k bytes.
	62	* Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
	63	* so we loan each swapped in process memory worth 100$, or just admit
	64	* that we don't consider it worthwhile and swap it out to disk which costs
	65	* $30/mb or about $0.75.
	66	*/
	67	#define SAFERSS 32 /* nominal ``small'' resident set size
	68	protected against replacement */
	69
	70	/*
	71	* DISKRPM is used to estimate the number of paging i/o operations
	72	* which one can expect from a single disk controller.
	73	*/
	74	#define DISKRPM 60
	75
	76	/*
	77	* Klustering constants. Klustering is the gathering
	78	* of pages together for pagein/pageout, while clustering
	79	* is the treatment of hardware page size as though it were
	80	* larger than it really is.
	81	*
	82	* KLMAX gives maximum cluster size in CLSIZE page (cluster-page)
	83	* units. Note that KLMAX*CLSIZE must be <= DMMIN in dmap.h.
	84	*/
	85
	86	#define KLMAX (32/CLSIZE)
	87	#define KLSEQL (16/CLSIZE) /* in klust if vadvise(VA_SEQL) */
	88	#define KLIN (8/CLSIZE) /* default data/stack in klust */
	89	#define KLTXT (4/CLSIZE) /* default text in klust */
	90	#define KLOUT (32/CLSIZE)
	91
	92	/*
	93	* KLSDIST is the advance or retard of the fifo reclaim for sequential
	94	* processes data space.
	95	*/
	96	#define KLSDIST 3 /* klusters advance/retard for seq. fifo */
299bcbab SL	97
	98	/*
	99	* Paging thresholds (see vm_sched.c).
a5ab28fa KM	100	* Strategy of 1/19/85:
a5ab28fa KM	101	* lotsfree is 512k bytes, but at most 1/4 of memory
299bcbab SL	102	* desfree is 200k bytes, but at most 1/8 of memory
	103	* minfree is 64k bytes, but at most 1/2 of desfree
	104	*/
a5ab28fa	105	#define LOTSFREE (512 * 1024)
299bcbab SL	106	#define LOTSFREEFRACT 4
	107	#define DESFREE (200 * 1024)
	108	#define DESFREEFRACT 8
	109	#define MINFREE (64 * 1024)
	110	#define MINFREEFRACT 2
	111
00c24382 KM	112	/*
	113	* There are two clock hands, initially separated by HANDSPREAD bytes
	114	* (but at most all of user memory). The amount of time to reclaim
	115	* a page once the pageout process examines it increases with this
	116	* distance and decreases as the scan rate rises.
	117	*/
	118	#define HANDSPREAD (2 * 1024 * 1024)
	119
	120	/*
	121	* The number of times per second to recompute the desired paging rate
	122	* and poke the pagedaemon.
	123	*/
	124	#define RATETOSCHEDPAGING 4
	125
299bcbab SL	126	/*
	127	* Believed threshold (in megabytes) for which interleaved
	128	* swapping area is desirable.
	129	*/
	130	#define LOTSOFMEM 2
5862de34 SL	131
	132	/*
	133	* BEWARE THIS DEFINITION WORKS ONLY WITH COUNT OF 1
	134	*/
	135	#define mapin(pte, v, pfnum, count, prot) \
	136	((int )(pte) = (pfnum) \| (prot), mtpr(TBIS, ptob(v)))