1998-06-11 01:21:14 +02:00
|
|
|
/* GLIB - Library of useful routines for C programming
|
|
|
|
* Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
|
|
|
|
*
|
|
|
|
* gdataset.c: Generic dataset mechanism, similar to GtkObject data.
|
|
|
|
* Copyright (C) 1998 Tim Janik
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Library General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library 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
|
|
|
|
* Library General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Library General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
*/
|
1998-06-12 03:04:15 +02:00
|
|
|
#include <string.h>
|
1998-06-11 01:21:14 +02:00
|
|
|
#include "glib.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* --- defines --- */
|
1998-06-11 05:38:33 +02:00
|
|
|
#define G_DATASET_BLOCK_SIZE (512)
|
|
|
|
#define G_DATASET_MEM_CHUNK_PREALLOC (64)
|
|
|
|
#define G_DATASET_DATA_MEM_CHUNK_PREALLOC (128)
|
1998-06-11 01:21:14 +02:00
|
|
|
|
|
|
|
|
|
|
|
/* --- structures --- */
|
|
|
|
typedef struct _GDatasetData GDatasetData;
|
|
|
|
typedef struct _GDataset GDataset;
|
|
|
|
struct _GDatasetData
|
|
|
|
{
|
|
|
|
GDatasetData *next;
|
|
|
|
guint id;
|
|
|
|
gpointer data;
|
|
|
|
GDestroyNotify destroy_func;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct _GDataset
|
|
|
|
{
|
|
|
|
gconstpointer location;
|
|
|
|
GDatasetData *data_list;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* --- prototypes --- */
|
|
|
|
static inline GDataset* g_dataset_lookup (gconstpointer dataset_location);
|
|
|
|
static inline void g_dataset_destroy_i (GDataset *dataset);
|
|
|
|
static void g_dataset_initialize (void);
|
1998-06-19 04:00:23 +02:00
|
|
|
static inline GQuark g_quark_new (const gchar *string);
|
|
|
|
|
1998-06-11 01:21:14 +02:00
|
|
|
|
|
|
|
/* --- variables --- */
|
1998-06-19 04:00:23 +02:00
|
|
|
static GHashTable *g_quark_ht = NULL;
|
|
|
|
static gchar **g_quarks = NULL;
|
|
|
|
static GQuark g_quark_seq_id = 0;
|
|
|
|
static GHashTable *g_dataset_location_ht = NULL;
|
|
|
|
static GDataset *g_dataset_cached = NULL;
|
|
|
|
static GMemChunk *g_dataset_mem_chunk = NULL;
|
|
|
|
static GMemChunk *g_dataset_data_mem_chunk = NULL;
|
1998-06-11 05:38:33 +02:00
|
|
|
|
1998-06-11 01:21:14 +02:00
|
|
|
|
|
|
|
|
|
|
|
/* --- functions --- */
|
|
|
|
static inline GDataset*
|
|
|
|
g_dataset_lookup (gconstpointer dataset_location)
|
|
|
|
{
|
|
|
|
register GDataset *dataset;
|
|
|
|
|
|
|
|
if (g_dataset_cached && g_dataset_cached->location == dataset_location)
|
|
|
|
return g_dataset_cached;
|
|
|
|
|
|
|
|
if (!g_dataset_location_ht)
|
|
|
|
g_dataset_initialize ();
|
|
|
|
|
|
|
|
dataset = g_hash_table_lookup (g_dataset_location_ht, dataset_location);
|
|
|
|
if (dataset)
|
|
|
|
g_dataset_cached = dataset;
|
|
|
|
|
|
|
|
return dataset;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
g_dataset_destroy_i (GDataset *dataset)
|
|
|
|
{
|
|
|
|
register GDatasetData *list;
|
|
|
|
|
|
|
|
if (dataset == g_dataset_cached)
|
|
|
|
g_dataset_cached = NULL;
|
|
|
|
g_hash_table_remove (g_dataset_location_ht, dataset->location);
|
|
|
|
|
|
|
|
list = dataset->data_list;
|
|
|
|
g_mem_chunk_free (g_dataset_mem_chunk, dataset);
|
|
|
|
|
|
|
|
while (list)
|
|
|
|
{
|
|
|
|
register GDatasetData *prev;
|
|
|
|
|
|
|
|
prev = list;
|
|
|
|
list = prev->next;
|
|
|
|
|
|
|
|
if (prev->destroy_func)
|
|
|
|
prev->destroy_func (prev->data);
|
|
|
|
|
|
|
|
g_mem_chunk_free (g_dataset_data_mem_chunk, prev);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_dataset_destroy (gconstpointer dataset_location)
|
|
|
|
{
|
|
|
|
register GDataset *dataset;
|
|
|
|
|
|
|
|
g_return_if_fail (dataset_location != NULL);
|
|
|
|
|
|
|
|
dataset = g_dataset_lookup (dataset_location);
|
|
|
|
if (dataset)
|
|
|
|
g_dataset_destroy_i (dataset);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_dataset_id_set_destroy (gconstpointer dataset_location,
|
1998-06-19 04:00:23 +02:00
|
|
|
GQuark key_id,
|
1998-06-11 01:21:14 +02:00
|
|
|
GDestroyNotify destroy_func)
|
|
|
|
{
|
|
|
|
g_return_if_fail (dataset_location != NULL);
|
|
|
|
|
|
|
|
if (key_id)
|
|
|
|
{
|
|
|
|
register GDataset *dataset;
|
|
|
|
|
|
|
|
dataset = g_dataset_lookup (dataset_location);
|
|
|
|
if (dataset)
|
|
|
|
{
|
|
|
|
register GDatasetData *list;
|
|
|
|
|
|
|
|
list = dataset->data_list;
|
|
|
|
while (list)
|
|
|
|
{
|
|
|
|
if (list->id == key_id)
|
|
|
|
{
|
|
|
|
list->destroy_func = destroy_func;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
gpointer
|
|
|
|
g_dataset_id_get_data (gconstpointer dataset_location,
|
1998-06-19 04:00:23 +02:00
|
|
|
GQuark key_id)
|
1998-06-11 01:21:14 +02:00
|
|
|
{
|
|
|
|
g_return_val_if_fail (dataset_location != NULL, NULL);
|
|
|
|
|
|
|
|
if (key_id)
|
|
|
|
{
|
|
|
|
register GDataset *dataset;
|
|
|
|
|
|
|
|
dataset = g_dataset_lookup (dataset_location);
|
|
|
|
if (dataset)
|
|
|
|
{
|
|
|
|
register GDatasetData *list;
|
|
|
|
|
|
|
|
for (list = dataset->data_list; list; list = list->next)
|
|
|
|
if (list->id == key_id)
|
|
|
|
return list->data;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
g_dataset_id_set_data_full (gconstpointer dataset_location,
|
1998-06-19 04:00:23 +02:00
|
|
|
GQuark key_id,
|
1998-06-11 01:21:14 +02:00
|
|
|
gpointer data,
|
|
|
|
GDestroyNotify destroy_func)
|
|
|
|
{
|
|
|
|
register GDataset *dataset;
|
|
|
|
register GDatasetData *list;
|
|
|
|
|
|
|
|
g_return_if_fail (dataset_location != NULL);
|
|
|
|
g_return_if_fail (key_id > 0);
|
|
|
|
|
|
|
|
dataset = g_dataset_lookup (dataset_location);
|
|
|
|
if (!dataset)
|
|
|
|
{
|
|
|
|
dataset = g_chunk_new (GDataset, g_dataset_mem_chunk);
|
|
|
|
dataset->location = dataset_location;
|
|
|
|
dataset->data_list = NULL;
|
|
|
|
g_hash_table_insert (g_dataset_location_ht,
|
|
|
|
(gpointer) dataset->location, /* Yuck */
|
|
|
|
dataset);
|
|
|
|
}
|
|
|
|
|
|
|
|
list = dataset->data_list;
|
|
|
|
if (!data)
|
|
|
|
{
|
|
|
|
register GDatasetData *prev;
|
|
|
|
|
|
|
|
prev = NULL;
|
|
|
|
while (list)
|
|
|
|
{
|
|
|
|
if (list->id == key_id)
|
|
|
|
{
|
|
|
|
if (prev)
|
|
|
|
prev->next = list->next;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
dataset->data_list = list->next;
|
|
|
|
|
|
|
|
if (!dataset->data_list)
|
|
|
|
g_dataset_destroy_i (dataset);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we need to have unlinked before invoking the destroy function
|
|
|
|
*/
|
|
|
|
if (list->destroy_func)
|
|
|
|
list->destroy_func (list->data);
|
|
|
|
|
|
|
|
g_mem_chunk_free (g_dataset_data_mem_chunk, list);
|
1998-06-19 04:00:23 +02:00
|
|
|
|
|
|
|
return;
|
1998-06-11 01:21:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
prev = list;
|
|
|
|
list = list->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
while (list)
|
|
|
|
{
|
|
|
|
if (list->id == key_id)
|
|
|
|
{
|
1998-06-19 04:00:23 +02:00
|
|
|
register GDestroyNotify dfunc;
|
|
|
|
register gpointer ddata;
|
1998-06-11 01:21:14 +02:00
|
|
|
|
1998-06-19 04:00:23 +02:00
|
|
|
dfunc = list->destroy_func;
|
|
|
|
ddata = list->data;
|
|
|
|
list->data = data;
|
|
|
|
list->destroy_func = destroy_func;
|
1998-06-11 01:21:14 +02:00
|
|
|
|
1998-06-19 04:00:23 +02:00
|
|
|
/* we need to have updated all structures prior to
|
|
|
|
* invokation of the destroy function
|
|
|
|
*/
|
|
|
|
if (dfunc)
|
|
|
|
dfunc (ddata);
|
|
|
|
|
|
|
|
return;
|
1998-06-11 01:21:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
list = list->next;
|
|
|
|
}
|
|
|
|
|
1998-06-19 04:00:23 +02:00
|
|
|
list = g_chunk_new (GDatasetData, g_dataset_data_mem_chunk);
|
1998-06-11 01:21:14 +02:00
|
|
|
list->next = dataset->data_list;
|
|
|
|
list->id = key_id;
|
|
|
|
list->data = data;
|
|
|
|
list->destroy_func = destroy_func;
|
|
|
|
dataset->data_list = list;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
g_dataset_initialize (void)
|
|
|
|
{
|
|
|
|
if (!g_dataset_location_ht)
|
|
|
|
{
|
1998-06-19 04:00:23 +02:00
|
|
|
g_quark_ht = g_hash_table_new (g_str_hash, g_str_equal);
|
1998-06-11 01:21:14 +02:00
|
|
|
g_dataset_location_ht = g_hash_table_new (g_direct_hash, NULL);
|
|
|
|
g_dataset_cached = NULL;
|
|
|
|
g_dataset_mem_chunk =
|
|
|
|
g_mem_chunk_new ("GDataset MemChunk",
|
|
|
|
sizeof (GDataset),
|
|
|
|
sizeof (GDataset) * G_DATASET_MEM_CHUNK_PREALLOC,
|
|
|
|
G_ALLOC_AND_FREE);
|
|
|
|
g_dataset_data_mem_chunk =
|
|
|
|
g_mem_chunk_new ("GDatasetData MemChunk",
|
|
|
|
sizeof (GDatasetData),
|
|
|
|
sizeof (GDatasetData) * G_DATASET_DATA_MEM_CHUNK_PREALLOC,
|
|
|
|
G_ALLOC_AND_FREE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1998-06-19 04:00:23 +02:00
|
|
|
GQuark
|
|
|
|
g_quark_try_string (const gchar *string)
|
|
|
|
{
|
|
|
|
g_return_val_if_fail (string != NULL, 0);
|
|
|
|
|
|
|
|
if (g_quark_ht)
|
|
|
|
return (gulong) g_hash_table_lookup (g_quark_ht, string);
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
GQuark
|
|
|
|
g_quark_from_string (const gchar *string)
|
|
|
|
{
|
|
|
|
GQuark quark;
|
|
|
|
|
|
|
|
g_return_val_if_fail (string != NULL, 0);
|
|
|
|
|
|
|
|
if (!g_quark_ht)
|
|
|
|
g_dataset_initialize ();
|
|
|
|
|
|
|
|
quark = (gulong) g_hash_table_lookup (g_quark_ht, string);
|
|
|
|
if (!quark)
|
|
|
|
quark = g_quark_new (g_strdup (string));
|
|
|
|
|
|
|
|
return quark;
|
|
|
|
}
|
|
|
|
|
|
|
|
GQuark
|
|
|
|
g_quark_from_static_string (const gchar *string)
|
|
|
|
{
|
|
|
|
GQuark quark;
|
|
|
|
|
|
|
|
g_return_val_if_fail (string != NULL, 0);
|
|
|
|
|
|
|
|
if (!g_quark_ht)
|
|
|
|
g_dataset_initialize ();
|
|
|
|
|
|
|
|
quark = (gulong) g_hash_table_lookup (g_quark_ht, string);
|
|
|
|
if (!quark)
|
|
|
|
quark = g_quark_new (string);
|
|
|
|
|
|
|
|
return quark;
|
|
|
|
}
|
|
|
|
|
1998-06-11 05:38:33 +02:00
|
|
|
gchar*
|
1998-06-19 04:00:23 +02:00
|
|
|
g_quark_to_string (GQuark quark)
|
1998-06-11 01:21:14 +02:00
|
|
|
{
|
1998-06-19 04:00:23 +02:00
|
|
|
if (quark > 0 && quark <= g_quark_seq_id)
|
|
|
|
return g_quarks[quark - 1];
|
|
|
|
else
|
|
|
|
return NULL;
|
1998-06-11 05:38:33 +02:00
|
|
|
}
|
|
|
|
|
1998-06-19 04:00:23 +02:00
|
|
|
static inline GQuark
|
|
|
|
g_quark_new (const gchar *string)
|
1998-06-11 05:38:33 +02:00
|
|
|
{
|
1998-06-19 04:00:23 +02:00
|
|
|
GQuark quark;
|
|
|
|
|
|
|
|
if (g_quark_seq_id % G_DATASET_BLOCK_SIZE == 0)
|
|
|
|
g_quarks = g_realloc (g_quarks,
|
|
|
|
(g_quark_seq_id + G_DATASET_BLOCK_SIZE) * sizeof (gchar*));
|
|
|
|
|
|
|
|
|
|
|
|
g_quarks[g_quark_seq_id] = (gchar*) string;
|
|
|
|
g_quark_seq_id++;
|
|
|
|
quark = g_quark_seq_id;
|
|
|
|
g_hash_table_insert (g_quark_ht, (gchar*) string, GUINT_TO_POINTER (quark));
|
1998-06-11 01:21:14 +02:00
|
|
|
|
1998-06-19 04:00:23 +02:00
|
|
|
return quark;
|
1998-06-11 01:21:14 +02:00
|
|
|
}
|