Memory Algorithms

typedef struct {					/* This struct is all
							   that we know about
							   each algorithm */
	gchar * name;
	void (*select) (void);
	void (*unselect) (void);			/* These two functions
							   will be called before
							   and after the use of
							   an algorithm to let
							   it keep a low memory
							   usage when not in
							   use.*/
	GtkWidget * properties;				/* Each algorithm will
							   maintain it's own
							   properties widget.
							   NULL means "no
							   properties".  It
							   should be set to NULL
							   when destroyed. If
							   not destroyed in
							   "unselect" the system
							   will destroy it.*/
	void (*page_access) (gint pid, gint page);	/* lets the algorithm
							   keep track of page
							   accesses */
	gint (*select_frame) (void);			/* it should return a
							   frame to be assigned
							   when out of memory */
} mem_algorithm_t;

mem_algorithm_t* get_MEM_current_algorithm  (void);

GSList*     init_MEM_algorithms             (void);

void        register_MEM_algorithm          (mem_algorithm_t *algorithm);