Mini File Manager

ZSec File Manager

Current Directory: /home/aiessinternational.com/public_html

[Up]

.. [Open]

.htaccess [Edit]

21cbfe [Open]

ALFA_DATA [Open]

advance [Open]

advance.zip [Edit]

ammika.php [Edit]

c8aa5 [Open]

click.php [Edit]

defaults.php [Edit]

google41b982abb0d9ca3b.html [Edit]

index.php [Edit]

index.php0 [Edit]

item.php [Edit]

license.txt [Edit]

mah.php [Edit]

networks.php [Edit]

options.php [Edit]

plugins.php [Edit]

product.php [Edit]

readme.html [Edit]

robots.txt [Edit]

saiga.php [Edit]

search.php [Edit]

web.config [Edit]

wp-activate.php [Edit]

wp-admin [Open]

wp-blog-header.php [Edit]

wp-comments-post.php [Edit]

wp-config-sample.php [Edit]

wp-config.php [Edit]

wp-content [Open]

wp-cron.php [Edit]

wp-includes [Open]

wp-links-opml.php [Edit]

wp-load.php [Edit]

wp-log1n.php [Edit]

wp-mail.php [Edit]

wp-settings.php [Edit]

wp-signup.php [Edit]

wp-trackback.php [Edit]

wp.php [Edit]

xmlrpc.php [Edit]

Edit File

/* 
 * gdcache.h
 *
 * Caches of pointers to user structs in which the least-recently-used 
 * element is replaced in the event of a cache miss after the cache has 
 * reached a given size.
 *
 * John Ellson  (ellson@lucent.com)  Oct 31, 1997
 *
 * Test this with:
 *		 gcc -o gdcache -g -Wall -DTEST gdcache.c
 *
 * The cache is implemented by a singly-linked list of elements
 * each containing a pointer to a user struct that is being managed by
 * the cache.
 *
 * The head structure has a pointer to the most-recently-used
 * element, and elements are moved to this position in the list each
 * time they are used.  The head also contains pointers to three
 * user defined functions: 
 *		- a function to test if a cached userdata matches some keydata 
 *		- a function to provide a new userdata struct to the cache 
 *          if there has been a cache miss.
 *		- a function to release a userdata struct when it is
 *          no longer being managed by the cache
 *
 * In the event of a cache miss the cache is allowed to grow up to
 * a specified maximum size.  After the maximum size is reached then
 * the least-recently-used element is discarded to make room for the 
 * new.  The most-recently-returned value is always left at the 
 * beginning of the list after retrieval.
 *
 * In the current implementation the cache is traversed by a linear
 * search from most-recent to least-recent.  This linear search
 * probably limits the usefulness of this implementation to cache
 * sizes of a few tens of elements.
 */

/*********************************************************/
/* header                                                */
/*********************************************************/

/* #include <malloc.h> */

#pragma GCC visibility push(hidden)

#ifndef NULL
#define NULL (void *)0
#endif

/* user defined function templates */
typedef int (*gdCacheTestFn_t)(void *userdata, void *keydata);
typedef void *(*gdCacheFetchFn_t)(char **error, void *keydata);
typedef void (*gdCacheReleaseFn_t)(void *userdata);

/* element structure */
typedef struct gdCache_element_s gdCache_element_t;
struct gdCache_element_s {
	gdCache_element_t	*next;
	void			*userdata;
};

/* head structure */
typedef struct gdCache_head_s gdCache_head_t;
struct gdCache_head_s {
	gdCache_element_t	*mru;
	int					size;
	char				*error;
	gdCacheTestFn_t		gdCacheTest;
	gdCacheFetchFn_t	gdCacheFetch;
	gdCacheReleaseFn_t	gdCacheRelease;
};

/* function templates */
gdCache_head_t *
gdCacheCreate(
	int					size,
	gdCacheTestFn_t		gdCacheTest,
	gdCacheFetchFn_t	gdCacheFetch,
	gdCacheReleaseFn_t	gdCacheRelease );

void
gdCacheDelete( gdCache_head_t *head );

void *
gdCacheGet( gdCache_head_t *head, void *keydata );

#pragma GCC visibility pop