mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2024-11-11 07:42:18 +00:00
4cef9792f4
They take a pointer to a free-list used for hashlinks so the hashlink pools can be per-thread. However, hash tables that are not updated are always thread-safe, so this affects only updates. progs_t has been set up such that it is easy for multiple progs within one thread can share hashlinks.
93 lines
2 KiB
C
93 lines
2 KiB
C
/*
|
|
pr_resource.c
|
|
|
|
progs resource management
|
|
|
|
Copyright (C) 2001 Bill Currie <bill@taniwha.org>
|
|
|
|
Author: Bill Currie <bill@taniwha.org>
|
|
Date: 2002/1/29
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to:
|
|
|
|
Free Software Foundation, Inc.
|
|
59 Temple Place - Suite 330
|
|
Boston, MA 02111-1307, USA
|
|
|
|
*/
|
|
#ifdef HAVE_CONFIG_H
|
|
# include "config.h"
|
|
#endif
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "QF/hash.h"
|
|
#include "QF/progs.h"
|
|
#include "QF/sys.h"
|
|
|
|
struct pr_resource_s {
|
|
const char *name;
|
|
pr_resource_t *next;
|
|
void *data;
|
|
void (*clear)(progs_t *pr, void *data);
|
|
};
|
|
|
|
static const char *
|
|
resource_get_key (const void *r, void *unused)
|
|
{
|
|
return ((pr_resource_t *)r)->name;
|
|
}
|
|
|
|
VISIBLE void
|
|
PR_Resources_Init (progs_t *pr)
|
|
{
|
|
pr->resource_hash = Hash_NewTable (1021, resource_get_key, 0, 0,
|
|
pr->hashlink_freelist);
|
|
pr->resources = 0;
|
|
}
|
|
|
|
void
|
|
PR_Resources_Clear (progs_t *pr)
|
|
{
|
|
pr_resource_t *res = pr->resources;
|
|
while (res) {
|
|
res->clear (pr, res->data);
|
|
res = res->next;
|
|
}
|
|
}
|
|
|
|
VISIBLE void
|
|
PR_Resources_Register (progs_t *pr, const char *name, void *data,
|
|
void (*clear)(progs_t *, void *))
|
|
{
|
|
pr_resource_t *res = malloc (sizeof (pr_resource_t));
|
|
if (!res)
|
|
Sys_Error ("PR_Resources_Register: out of memory");
|
|
res->name = name;
|
|
res->data = data;
|
|
res->clear = clear;
|
|
res->next = pr->resources;
|
|
pr->resources = res;
|
|
Hash_Add (pr->resource_hash, res);
|
|
}
|
|
|
|
VISIBLE void *
|
|
PR_Resources_Find (progs_t *pr, const char *name)
|
|
{
|
|
pr_resource_t *res = Hash_Find (pr->resource_hash, name);
|
|
if (!res)
|
|
return 0;
|
|
return res->data;
|
|
}
|