/*
* Copyright (c) 2008 Hypertriton, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
* USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include
#include
#include "view.h"
#include "text.h"
#include "widget.h"
#include "text_cache.h"
/* #define TEXTCACHE_DEBUG */
AG_TextCache *
AG_TextCacheNew(void *widget, Uint nBuckets, Uint nToExpire)
{
AG_TextCache *tc;
Uint i;
#ifdef TEXTCACHE_DEBUG
Debug(widget, "TextCacheNew(): %d buckets, %d expire queue\n",
nBuckets, nToExpire);
#endif
tc = Malloc(sizeof(AG_TextCache));
tc->widget = widget;
tc->curEnts = 0;
tc->buckets = Malloc(nBuckets*sizeof(AG_TextCacheBucket));
tc->nBuckets = nBuckets;
tc->toExpire = Malloc(nBuckets*sizeof(AG_CachedText *));
tc->toExpireHashes = Malloc(nBuckets*sizeof(Uint));
tc->nToExpire = nToExpire;
for (i = 0; i < nBuckets; i++) {
SLIST_INIT(&tc->buckets[i].ents);
}
return (tc);
}
static __inline__ void
DeleteEntry(AG_TextCache *tc, Uint h, AG_CachedText *ct)
{
#ifdef TEXTCACHE_DEBUG
Debug(NULL, "TextCache: removing entry #%u (\"%s\")\n", h,
ct->text);
#endif
SLIST_REMOVE(&tc->buckets[h].ents, ct, ag_cached_text, ents);
AG_WidgetUnmapSurface(tc->widget, ct->surface);
free(ct->text);
free(ct);
tc->curEnts--;
}
void
AG_TextCacheDestroy(AG_TextCache *tc)
{
Uint i;
#ifdef TEXTCACHE_DEBUG
Debug(NULL, "TextCacheDestroy: freeing %d buckets\n", tc->nBuckets);
#endif
for (i = 0; i < tc->nBuckets; i++) {
while (!SLIST_EMPTY(&tc->buckets[i].ents))
DeleteEntry(tc, i, SLIST_FIRST(&tc->buckets[i].ents));
}
Free(tc->buckets);
Free(tc->toExpire);
Free(tc->toExpireHashes);
}
static void
ExpireEntries(AG_TextCache *tc)
{
AG_CachedText *ct;
Uint i, j;
for (i = 0; i < tc->nToExpire; i++) {
tc->toExpire[i] = NULL;
}
for (i = 0; i < tc->nBuckets; i++) {
SLIST_FOREACH(ct, &tc->buckets[i].ents, ents) {
for (j = 0; j < tc->nToExpire; j++) {
if (tc->toExpire[j] == NULL ||
ct->stamp < tc->toExpire[j]->stamp) {
tc->toExpire[j] = ct;
tc->toExpireHashes[j] = i;
break;
}
}
}
}
for (i = 0; i < tc->nToExpire; i++) {
if (tc->toExpire[i] == NULL) {
continue;
}
DeleteEntry(tc, tc->toExpireHashes[i], tc->toExpire[i]);
}
}
int
AG_TextCacheGet(AG_TextCache *tc, const char *text)
{
AG_TextCacheBucket *bucket;
AG_CachedText *ct;
Uint h;
h = AG_TextCacheHash(tc, text);
#ifdef TEXTCACHE_DEBUG
Debug(NULL, "TextCacheLookup: string \"%s\" = %u...", text, h);
#endif
bucket = &tc->buckets[h];
SLIST_FOREACH(ct, &bucket->ents, ents) {
if (strcmp(ct->text, text) == 0 &&
AG_TextStateCompare(&ct->state, agTextState) == 0)
break;
}
if (ct == NULL) {
#ifdef TEXTCACHE_DEBUG
Debug(NULL, "MISS (ent %u)\n", tc->curEnts+1);
#endif
ct = Malloc(sizeof(AG_TextCache));
ct->text = Strdup(text);
ct->surface = AG_WidgetMapSurface(tc->widget,
AG_TextRender(text));
ct->stamp = SDL_GetTicks();
ct->state = *agTextState;
tc->curEnts++;
SLIST_INSERT_HEAD(&bucket->ents, ct, ents);
if (tc->curEnts > tc->nBuckets) {
#ifdef TEXTCACHE_DEBUG
Debug(NULL, "TextCache: Expiring entries "
"(%u > %u)...\n", tc->curEnts, tc->nBuckets);
#endif
ExpireEntries(tc);
}
} else {
ct->stamp = SDL_GetTicks();
#ifdef TEXTCACHE_DEBUG
Debug(NULL, "HIT (%u)\n", (unsigned)ct->stamp);
#endif
}
return (ct->surface);
}