minix/servers/vm/yielded.h


#ifndef _YIELDED_H 
#define _YIELDED_H 1

#include <minix/type.h>

typedef struct block_id {
	u64_t		id;
	endpoint_t	owner;
} block_id_t;

typedef struct yielded {
	/* the owner-given id and owner together
	 * uniquely identify a yielded block.
	 */
	block_id_t	id;
	phys_bytes	physaddr;
	int		pages;

	/* LRU fields */
	struct yielded	*younger, *older;

	/* AVL fields */
	struct yielded	*less, *greater;
	int		factor;
} yielded_t;

#endif
secondary cache feature in vm. A new call to vm lets processes yield a part of their memory to vm, together with an id, getting newly allocated memory in return. vm is allowed to forget about it if it runs out of memory. processes can ask for it back using the same id. (These two operations are normally combined in a single call.) It can be used as a as-big-as-memory-will-allow block cache for filesystems, which is how mfs now uses it. 2010-05-05 13:35:04 +02:00
			`#ifndef _YIELDED_H`
			`#define _YIELDED_H 1`

			`#include <minix/type.h>`

vm - hash table for block cache 2010-10-15 11:10:14 +02:00			`typedef struct block_id {`
secondary cache feature in vm. A new call to vm lets processes yield a part of their memory to vm, together with an id, getting newly allocated memory in return. vm is allowed to forget about it if it runs out of memory. processes can ask for it back using the same id. (These two operations are normally combined in a single call.) It can be used as a as-big-as-memory-will-allow block cache for filesystems, which is how mfs now uses it. 2010-05-05 13:35:04 +02:00			`u64_t id;`
			`endpoint_t owner;`
vm - hash table for block cache 2010-10-15 11:10:14 +02:00			`} block_id_t;`

			`typedef struct yielded {`
			`/* the owner-given id and owner together`
			`* uniquely identify a yielded block.`
			`*/`
			`block_id_t id;`
VM: restore >4k secondary cache functionality . by storing length in the yielded blocks node again 2012-09-18 13:17:52 +02:00			`phys_bytes physaddr;`
			`int pages;`
secondary cache feature in vm. A new call to vm lets processes yield a part of their memory to vm, together with an id, getting newly allocated memory in return. vm is allowed to forget about it if it runs out of memory. processes can ask for it back using the same id. (These two operations are normally combined in a single call.) It can be used as a as-big-as-memory-will-allow block cache for filesystems, which is how mfs now uses it. 2010-05-05 13:35:04 +02:00
			`/* LRU fields */`
			`struct yielded younger, older;`

			`/* AVL fields */`
			`struct yielded less, greater;`
			`int factor;`
			`} yielded_t;`

			`#endif`