ntfs/libntfs/cache.c

47  *	A compare function must be provided for finding a wanted entry
49  *	an entry to facilitate multiple invalidation.
82 				link->entry = current;
114 			while (link && (link->entry != current)) {
141  *		Fetch an entry from cache
143  *	returns the cache entry, or NULL if not available
144  *	The returned entry may be modified, but not freed
160 			 * locate the entry if present
164 			while (link && compare(link->entry, wanted))
167 				current = link->entry;
209  *	returns the cache entry or NULL if not possible
226 			 * find out whether the entry if present
230 			while (link && compare(link->entry, item))
233 				current = link->entry;
239 			 * and find out whether the entry is already in list
252 			 * Not in list, get a free entry or reuse the
253 			 * last entry, and relink as head of list
256 			 * an entry is reused.
271 				/* reusing the oldest entry */
309 					 * recycle entry in free list
330  *		Invalidate a cache entry
331  *	The entry is moved to the free entry list
332  *	A specific function may be called for entry deletion
370  *	the caller to signal a cache corruption if the entry was
390 			 * find out whether the entry if present
395 				if (compare(link->entry, item))
398 					current = link->entry;
453 	struct CACHED_GENERIC *entry;
456 		for (entry=cache->most_recent_entry; entry; entry=entry->next) {
458 				cache->dofree(entry);
459 			if (entry->variable)
460 				free(entry->variable);
506 		/* chain the data entries, and mark an invalid entry */
509 		cache->free_entry = &cache->entry[0];
510 		pc = &cache->entry[0];
519 			/* special for the last entry */
533 				/* special for the last entry */