* Free Software Foundation, Inc., 59 Temple Place, Suite 330,
* Boston, MA 02111-1307, USA.
*/
-#include <config.h>
-#include "gtype.h"
/*
* MT safe
*/
-#include "gtypeplugin.h"
-#include "gvaluecollector.h"
-#include <string.h>
+#include "config.h"
+
+#include <string.h>
+
+#include "gtype.h"
+#include "gtype-private.h"
+#include "gtypeplugin.h"
+#include "gvaluecollector.h"
+#include "gbsearcharray.h"
+#include "gatomicarray.h"
+#include "gobject_trace.h"
+
+
+/**
+ * SECTION:gtype
+ * @short_description: The GLib Runtime type identification and
+ * management system
+ * @title:Type Information
+ *
+ * The GType API is the foundation of the GObject system. It provides the
+ * facilities for registering and managing all fundamental data types,
+ * user-defined object and interface types. Before using any GType
+ * or GObject functions, g_type_init() must be called to initialize the
+ * type system.
+ *
+ * For type creation and registration purposes, all types fall into one of
+ * two categories: static or dynamic. Static types are never loaded or
+ * unloaded at run-time as dynamic types may be. Static types are created
+ * with g_type_register_static() that gets type specific information passed
+ * in via a #GTypeInfo structure.
+ * Dynamic types are created with g_type_register_dynamic() which takes a
+ * #GTypePlugin structure instead. The remaining type information (the
+ * #GTypeInfo structure) is retrieved during runtime through #GTypePlugin
+ * and the g_type_plugin_*() API.
+ * These registration functions are usually called only once from a
+ * function whose only purpose is to return the type identifier for a
+ * specific class. Once the type (or class or interface) is registered,
+ * it may be instantiated, inherited, or implemented depending on exactly
+ * what sort of type it is.
+ * There is also a third registration function for registering fundamental
+ * types called g_type_register_fundamental() which requires both a #GTypeInfo
+ * structure and a #GTypeFundamentalInfo structure but it is seldom used
+ * since most fundamental types are predefined rather than user-defined.
+ *
+ * A final word about type names.
+ * Such an identifier needs to be at least three characters long. There is no
+ * upper length limit. The first character needs to be a letter (a-z or A-Z)
+ * or an underscore '_'. Subsequent characters can be letters, numbers or
+ * any of '-_+'.
+ */
/* NOTE: some functions (some internal variants and exported ones)
* a write lock or more than 0 read locks have to be held across
* function invocation
* - _W: [Write-locked invocation]
- * a write lock has to be held across function invokation
+ * a write lock has to be held across function invocation
* - _Wm: [Write-locked invocation, mutatable]
* like _W, but the write lock might be released and reacquired
* during invocation, watch your pointers
+ * - _WmREC: [Write-locked invocation, mutatable, recursive]
+ * like _Wm, but also acquires recursive mutex class_init_rec_mutex
*/
-static GStaticRWLock type_rw_lock = G_STATIC_RW_LOCK_INIT;
#ifdef LOCK_DEBUG
#define G_READ_LOCK(rw_lock) do { g_printerr (G_STRLOC ": readL++\n"); g_static_rw_lock_reader_lock (rw_lock); } while (0)
#define G_READ_UNLOCK(rw_lock) do { g_printerr (G_STRLOC ": readL--\n"); g_static_rw_lock_reader_unlock (rw_lock); } while (0)
#define G_WRITE_UNLOCK(rw_lock) g_static_rw_lock_writer_unlock (rw_lock)
#endif
#define INVALID_RECURSION(func, arg, type_name) G_STMT_START{ \
- static const gchar *_action = " invalidly modified type "; \
+ static const gchar _action[] = " invalidly modified type "; \
gpointer _arg = (gpointer) (arg); const gchar *_tname = (type_name), *_fname = (func); \
if (_arg) \
g_error ("%s(%p)%s`%s'", _fname, _arg, _action, _tname); \
else \
g_error ("%s()%s`%s'", _fname, _action, _tname); \
}G_STMT_END
-#define g_return_val_if_uninitialized(condition, init_function, return_value) G_STMT_START{ \
- if (!(condition)) \
- { \
- g_log (G_LOG_DOMAIN, G_LOG_LEVEL_CRITICAL, \
- "%s: initialization assertion failed, use %s() prior to this function", \
- G_STRLOC, G_STRINGIFY (init_function)); \
- return (return_value); \
- } \
+#define g_return_val_if_type_system_uninitialized(return_value) G_STMT_START{ \
+ if (G_UNLIKELY (!static_quark_type_flags)) \
+ { \
+ g_log (G_LOG_DOMAIN, G_LOG_LEVEL_CRITICAL, \
+ "%s: You forgot to call g_type_init()", \
+ G_STRLOC); \
+ return (return_value); \
+ } \
}G_STMT_END
#ifdef G_ENABLE_DEBUG
sizeof (gpointer)), \
sizeof (glong)))
+/* The 2*sizeof(size_t) alignment here is borrowed from
+ * GNU libc, so it should be good most everywhere.
+ * It is more conservative than is needed on some 64-bit
+ * platforms, but ia64 does require a 16-byte alignment.
+ * The SIMD extensions for x86 and ppc32 would want a
+ * larger alignment than this, but we don't need to
+ * do better than malloc.
+ */
+#define STRUCT_ALIGNMENT (2 * sizeof (gsize))
+#define ALIGN_STRUCT(offset) \
+ ((offset + (STRUCT_ALIGNMENT - 1)) & -STRUCT_ALIGNMENT)
+
/* --- typedefs --- */
typedef struct _TypeNode TypeNode;
typedef struct _CommonData CommonData;
+typedef struct _BoxedData BoxedData;
typedef struct _IFaceData IFaceData;
typedef struct _ClassData ClassData;
typedef struct _InstanceData InstanceData;
typedef union _TypeData TypeData;
+typedef struct _IFaceEntries IFaceEntries;
typedef struct _IFaceEntry IFaceEntry;
typedef struct _IFaceHolder IFaceHolder;
const GTypeInfo *info,
const GTypeValueTable *value_table);
static inline void type_data_ref_Wm (TypeNode *node);
-static inline void type_data_unref_Wm (TypeNode *node,
+static inline void type_data_unref_U (TypeNode *node,
gboolean uncached);
-static void type_data_last_unref_Wm (GType type,
+static void type_data_last_unref_Wm (TypeNode * node,
gboolean uncached);
static inline gpointer type_get_qdata_L (TypeNode *node,
GQuark quark);
gpointer data);
static IFaceHolder* type_iface_peek_holder_L (TypeNode *iface,
GType instance_type);
+static gboolean type_iface_vtable_base_init_Wm (TypeNode *iface,
+ TypeNode *node);
+static void type_iface_vtable_iface_init_Wm (TypeNode *iface,
+ TypeNode *node);
static gboolean type_node_is_a_L (TypeNode *node,
TypeNode *iface_node);
+/* --- enumeration --- */
+
+/* The InitState enumeration is used to track the progress of initializing
+ * both classes and interface vtables. Keeping the state of initialization
+ * is necessary to handle new interfaces being added while we are initializing
+ * the class or other interfaces.
+ */
+typedef enum
+{
+ UNINITIALIZED,
+ BASE_CLASS_INIT,
+ BASE_IFACE_INIT,
+ CLASS_INIT,
+ IFACE_INIT,
+ INITIALIZED
+} InitState;
+
/* --- structures --- */
struct _TypeNode
{
+ guint volatile ref_count;
GTypePlugin *plugin;
- guint n_children : 12;
+ guint n_children; /* writable with lock */
guint n_supers : 8;
- guint _prot_n_ifaces_prerequisites : 9;
+ guint n_prerequisites : 9;
guint is_classed : 1;
guint is_instantiatable : 1;
guint mutatable_check_cache : 1; /* combines some common path checks */
- GType *children;
+ GType *children; /* writable with lock */
TypeData * volatile data;
GQuark qname;
GData *global_gdata;
union {
- IFaceEntry *iface_entries; /* for !iface types */
- GType *prerequisistes;
+ GAtomicArray iface_entries; /* for !iface types */
+ GAtomicArray offsets;
} _prot;
+ GType *prerequisites;
GType supers[1]; /* flexible array */
};
+
#define SIZEOF_BASE_TYPE_NODE() (G_STRUCT_OFFSET (TypeNode, supers))
#define MAX_N_SUPERS (255)
#define MAX_N_CHILDREN (4095)
-#define MAX_N_IFACES (511)
-#define MAX_N_PREREQUISITES (MAX_N_IFACES)
+#define MAX_N_INTERFACES (255) /* Limited by offsets being 8 bits */
+#define MAX_N_PREREQUISITES (511)
#define NODE_TYPE(node) (node->supers[0])
#define NODE_PARENT_TYPE(node) (node->supers[1])
#define NODE_FUNDAMENTAL_TYPE(node) (node->supers[node->n_supers])
#define NODE_NAME(node) (g_quark_to_string (node->qname))
+#define NODE_REFCOUNT(node) ((guint) g_atomic_int_get ((int *) &(node)->ref_count))
+#define NODE_IS_BOXED(node) (NODE_FUNDAMENTAL_TYPE (node) == G_TYPE_BOXED)
#define NODE_IS_IFACE(node) (NODE_FUNDAMENTAL_TYPE (node) == G_TYPE_INTERFACE)
-#define CLASSED_NODE_N_IFACES(node) ((node)->_prot_n_ifaces_prerequisites)
-#define CLASSED_NODE_IFACES_ENTRIES(node) ((node)->_prot.iface_entries)
-#define IFACE_NODE_N_PREREQUISITES(node) ((node)->_prot_n_ifaces_prerequisites)
-#define IFACE_NODE_PREREQUISITES(node) ((node)->_prot.prerequisistes)
+#define CLASSED_NODE_IFACES_ENTRIES(node) (&(node)->_prot.iface_entries)
+#define CLASSED_NODE_IFACES_ENTRIES_LOCKED(node)(G_ATOMIC_ARRAY_GET_LOCKED(CLASSED_NODE_IFACES_ENTRIES((node)), IFaceEntries))
+#define IFACE_NODE_N_PREREQUISITES(node) ((node)->n_prerequisites)
+#define IFACE_NODE_PREREQUISITES(node) ((node)->prerequisites)
#define iface_node_get_holders_L(node) ((IFaceHolder*) type_get_qdata_L ((node), static_quark_iface_holder))
#define iface_node_set_holders_W(node, holders) (type_set_qdata_W ((node), static_quark_iface_holder, (holders)))
#define iface_node_get_dependants_array_L(n) ((GType*) type_get_qdata_L ((n), static_quark_dependants_array))
#define iface_node_set_dependants_array_W(n,d) (type_set_qdata_W ((n), static_quark_dependants_array, (d)))
#define TYPE_ID_MASK ((GType) ((1 << G_TYPE_FUNDAMENTAL_SHIFT) - 1))
+#define NODE_IS_ANCESTOR(ancestor, node) \
+ ((ancestor)->n_supers <= (node)->n_supers && \
+ (node)->supers[(node)->n_supers - (ancestor)->n_supers] == NODE_TYPE (ancestor))
struct _IFaceHolder
{
GTypePlugin *plugin;
IFaceHolder *next;
};
+
struct _IFaceEntry
{
GType iface_type;
GTypeInterface *vtable;
+ InitState init_state;
+};
+
+struct _IFaceEntries {
+ guint offset_index;
+ IFaceEntry entry[1];
};
+
+#define IFACE_ENTRIES_HEADER_SIZE (sizeof(IFaceEntries) - sizeof(IFaceEntry))
+#define IFACE_ENTRIES_N_ENTRIES(_entries) ( (G_ATOMIC_ARRAY_DATA_SIZE((_entries)) - IFACE_ENTRIES_HEADER_SIZE) / sizeof(IFaceEntry) )
+
struct _CommonData
{
- guint ref_count;
GTypeValueTable *value_table;
};
+
+struct _BoxedData
+{
+ CommonData data;
+ GBoxedCopyFunc copy_func;
+ GBoxedFreeFunc free_func;
+};
+
struct _IFaceData
{
CommonData common;
guint16 vtable_size;
GBaseInitFunc vtable_init_base;
GBaseFinalizeFunc vtable_finalize_base;
+ GClassInitFunc dflt_init;
+ GClassFinalizeFunc dflt_finalize;
+ gconstpointer dflt_data;
+ gpointer dflt_vtable;
};
+
struct _ClassData
{
CommonData common;
guint16 class_size;
+ guint16 class_private_size;
+ int volatile init_state; /* atomic - g_type_class_ref reads it unlocked */
GBaseInitFunc class_init_base;
GBaseFinalizeFunc class_finalize_base;
GClassInitFunc class_init;
gconstpointer class_data;
gpointer class;
};
+
struct _InstanceData
{
CommonData common;
guint16 class_size;
+ guint16 class_private_size;
+ int volatile init_state; /* atomic - g_type_class_ref reads it unlocked */
GBaseInitFunc class_init_base;
GBaseFinalizeFunc class_finalize_base;
GClassInitFunc class_init;
gconstpointer class_data;
gpointer class;
guint16 instance_size;
+ guint16 private_size;
guint16 n_preallocs;
GInstanceInitFunc instance_init;
- GMemChunk *mem_chunk;
};
+
union _TypeData
{
CommonData common;
+ BoxedData boxed;
IFaceData iface;
ClassData class;
InstanceData instance;
};
+
typedef struct {
gpointer cache_data;
GTypeClassCacheFunc cache_func;
} ClassCacheFunc;
+typedef struct {
+ gpointer check_data;
+ GTypeInterfaceCheckFunc check_func;
+} IFaceCheckFunc;
+
/* --- variables --- */
+static GStaticRWLock type_rw_lock = G_STATIC_RW_LOCK_INIT;
+static GStaticRecMutex class_init_rec_mutex = G_STATIC_REC_MUTEX_INIT;
static guint static_n_class_cache_funcs = 0;
static ClassCacheFunc *static_class_cache_funcs = NULL;
+static guint static_n_iface_check_funcs = 0;
+static IFaceCheckFunc *static_iface_check_funcs = NULL;
static GQuark static_quark_type_flags = 0;
static GQuark static_quark_iface_holder = 0;
static GQuark static_quark_dependants_array = 0;
GTypeDebugFlags _g_type_debug_flags = 0;
-
/* --- type nodes --- */
static GHashTable *static_type_nodes_ht = NULL;
-static TypeNode *static_fundamental_type_nodes[(G_TYPE_FUNDAMENTAL_MAX >> G_TYPE_FUNDAMENTAL_SHIFT) + 1] = { 0, };
+static TypeNode *static_fundamental_type_nodes[(G_TYPE_FUNDAMENTAL_MAX >> G_TYPE_FUNDAMENTAL_SHIFT) + 1] = { NULL, };
static GType static_fundamental_next = G_TYPE_RESERVED_USER_FIRST;
static inline TypeNode*
GType type;
TypeNode *node;
guint i, node_size = 0;
-
+
n_supers = pnode ? pnode->n_supers + 1 : 0;
if (!pnode)
IFACE_NODE_PREREQUISITES (node) = NULL;
}
else
- {
- CLASSED_NODE_N_IFACES (node) = 0;
- CLASSED_NODE_IFACES_ENTRIES (node) = NULL;
- }
+ _g_atomic_array_init (CLASSED_NODE_IFACES_ENTRIES (node));
}
else
{
else
{
guint j;
-
- CLASSED_NODE_N_IFACES (node) = CLASSED_NODE_N_IFACES (pnode);
- CLASSED_NODE_IFACES_ENTRIES (node) = g_memdup (CLASSED_NODE_IFACES_ENTRIES (pnode),
- sizeof (CLASSED_NODE_IFACES_ENTRIES (pnode)[0]) *
- CLASSED_NODE_N_IFACES (node));
- for (j = 0; j < CLASSED_NODE_N_IFACES (node); j++)
- CLASSED_NODE_IFACES_ENTRIES (node)[j].vtable = NULL;
+ IFaceEntries *entries;
+
+ entries = _g_atomic_array_copy (CLASSED_NODE_IFACES_ENTRIES (pnode),
+ IFACE_ENTRIES_HEADER_SIZE,
+ 0);
+ if (entries)
+ {
+ for (j = 0; j < IFACE_ENTRIES_N_ENTRIES (entries); j++)
+ {
+ entries->entry[j].vtable = NULL;
+ entries->entry[j].init_state = UNINITIALIZED;
+ }
+ _g_atomic_array_update (CLASSED_NODE_IFACES_ENTRIES (node),
+ entries);
+ }
}
-
+
i = pnode->n_children++;
pnode->children = g_renew (GType, pnode->children, pnode->n_children);
pnode->children[i] = type;
}
-
+
+ TRACE(GOBJECT_TYPE_NEW(name, node->supers[1], type));
+
node->plugin = plugin;
node->n_children = 0;
node->children = NULL;
}
static inline IFaceEntry*
+lookup_iface_entry_I (volatile IFaceEntries *entries,
+ TypeNode *iface_node)
+{
+ guint8 *offsets;
+ guint offset_index;
+ IFaceEntry *check;
+ int index;
+ IFaceEntry *entry;
+
+ if (entries == NULL)
+ return NULL;
+
+ G_ATOMIC_ARRAY_DO_TRANSACTION
+ (&iface_node->_prot.offsets, guint8,
+
+ entry = NULL;
+ offsets = transaction_data;
+ offset_index = entries->offset_index;
+ if (offsets != NULL &&
+ offset_index < G_ATOMIC_ARRAY_DATA_SIZE(offsets))
+ {
+ index = offsets[offset_index];
+ if (index > 0)
+ {
+ /* zero means unset, subtract one to get real index */
+ index -= 1;
+
+ if (index < IFACE_ENTRIES_N_ENTRIES (entries))
+ {
+ check = (IFaceEntry *)&entries->entry[index];
+ if (check->iface_type == NODE_TYPE (iface_node))
+ entry = check;
+ }
+ }
+ }
+ );
+
+ return entry;
+}
+
+static inline IFaceEntry*
type_lookup_iface_entry_L (TypeNode *node,
TypeNode *iface_node)
{
- if (NODE_IS_IFACE (iface_node) && CLASSED_NODE_N_IFACES (node))
+ if (!NODE_IS_IFACE (iface_node))
+ return NULL;
+
+ return lookup_iface_entry_I (CLASSED_NODE_IFACES_ENTRIES_LOCKED (node),
+ iface_node);
+}
+
+
+static inline gboolean
+type_lookup_iface_vtable_I (TypeNode *node,
+ TypeNode *iface_node,
+ gpointer *vtable_ptr)
+{
+ IFaceEntry *entry;
+ gboolean res;
+
+ if (!NODE_IS_IFACE (iface_node))
{
- IFaceEntry *ifaces = CLASSED_NODE_IFACES_ENTRIES (node) - 1;
- guint n_ifaces = CLASSED_NODE_N_IFACES (node);
- GType iface_type = NODE_TYPE (iface_node);
-
- do
- {
- guint i;
- IFaceEntry *check;
-
- i = (n_ifaces + 1) >> 1;
- check = ifaces + i;
- if (iface_type == check->iface_type)
- return check;
- else if (iface_type > check->iface_type)
- {
- n_ifaces -= i;
- ifaces = check;
- }
- else /* if (iface_type < check->iface_type) */
- n_ifaces = i - 1;
- }
- while (n_ifaces);
+ if (vtable_ptr)
+ *vtable_ptr = NULL;
+ return FALSE;
}
-
- return NULL;
+
+ G_ATOMIC_ARRAY_DO_TRANSACTION
+ (CLASSED_NODE_IFACES_ENTRIES (node), IFaceEntries,
+
+ entry = lookup_iface_entry_I (transaction_data, iface_node);
+ res = entry != NULL;
+ if (vtable_ptr)
+ {
+ if (entry)
+ *vtable_ptr = entry->vtable;
+ else
+ *vtable_ptr = NULL;
+ }
+ );
+
+ return res;
}
static inline gboolean
return FALSE;
}
-static gchar*
+static const gchar*
type_descriptive_name_I (GType type)
{
if (type)
static gboolean
check_type_name_I (const gchar *type_name)
{
- static const gchar *extra_chars = "-_+";
+ static const gchar extra_chars[] = "-_+";
const gchar *p = type_name;
gboolean name_valid;
return FALSE;
}
/* check class & interface members */
- if (!(finfo->type_flags & G_TYPE_FLAG_CLASSED) &&
+ if (!((finfo->type_flags & G_TYPE_FLAG_CLASSED) || is_interface) &&
(info->class_init || info->class_finalize || info->class_data ||
- (!is_interface && (info->class_size || info->base_init || info->base_finalize))))
+ info->class_size || info->base_init || info->base_finalize))
{
if (pnode)
g_warning ("cannot create class for `%s', derived from non-classed parent type `%s'",
vtable_size += strlen (value_table->lcopy_format);
vtable_size += 2;
}
-
+
if (node->is_instantiatable) /* carefull, is_instantiatable is also is_classed */
{
+ TypeNode *pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
+
data = g_malloc0 (sizeof (InstanceData) + vtable_size);
if (vtable_size)
vtable = G_STRUCT_MEMBER_P (data, sizeof (InstanceData));
data->instance.class_finalize = info->class_finalize;
data->instance.class_data = info->class_data;
data->instance.class = NULL;
+ data->instance.init_state = UNINITIALIZED;
data->instance.instance_size = info->instance_size;
+ /* We'll set the final value for data->instance.private size
+ * after the parent class has been initialized
+ */
+ data->instance.private_size = 0;
+ data->instance.class_private_size = 0;
+ if (pnode)
+ data->instance.class_private_size = pnode->data->instance.class_private_size;
#ifdef DISABLE_MEM_POOLS
data->instance.n_preallocs = 0;
#else /* !DISABLE_MEM_POOLS */
data->instance.n_preallocs = MIN (info->n_preallocs, 1024);
#endif /* !DISABLE_MEM_POOLS */
data->instance.instance_init = info->instance_init;
- data->instance.mem_chunk = NULL;
}
else if (node->is_classed) /* only classed */
{
+ TypeNode *pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
+
data = g_malloc0 (sizeof (ClassData) + vtable_size);
if (vtable_size)
vtable = G_STRUCT_MEMBER_P (data, sizeof (ClassData));
data->class.class_finalize = info->class_finalize;
data->class.class_data = info->class_data;
data->class.class = NULL;
+ data->class.class_private_size = 0;
+ if (pnode)
+ data->class.class_private_size = pnode->data->class.class_private_size;
+ data->class.init_state = UNINITIALIZED;
}
else if (NODE_IS_IFACE (node))
{
data->iface.vtable_size = info->class_size;
data->iface.vtable_init_base = info->base_init;
data->iface.vtable_finalize_base = info->base_finalize;
+ data->iface.dflt_init = info->class_init;
+ data->iface.dflt_finalize = info->class_finalize;
+ data->iface.dflt_data = info->class_data;
+ data->iface.dflt_vtable = NULL;
+ }
+ else if (NODE_IS_BOXED (node))
+ {
+ data = g_malloc0 (sizeof (BoxedData) + vtable_size);
+ if (vtable_size)
+ vtable = G_STRUCT_MEMBER_P (data, sizeof (BoxedData));
}
else
{
}
node->data = data;
- node->data->common.ref_count = 1;
if (vtable_size)
{
GPOINTER_TO_UINT (type_get_qdata_L (node, static_quark_type_flags))));
g_assert (node->data->common.value_table != NULL); /* paranoid */
+
+ g_atomic_int_set ((int *) &node->ref_count, 1);
}
static inline void
}
else
{
- g_assert (node->data->common.ref_count > 0);
+ g_assert (NODE_REFCOUNT (node) > 0);
- node->data->common.ref_count += 1;
+ g_atomic_int_inc ((int *) &node->ref_count);
}
}
-static inline void
-type_data_unref_Wm (TypeNode *node,
- gboolean uncached)
+static inline gboolean
+type_data_ref_U (TypeNode *node)
{
- g_assert (node->data && node->data->common.ref_count);
-
- if (node->data->common.ref_count > 1)
- node->data->common.ref_count -= 1;
- else
+ guint current;
+
+ do {
+ current = NODE_REFCOUNT (node);
+
+ if (current < 1)
+ return FALSE;
+ } while (!g_atomic_int_compare_and_exchange ((int *) &node->ref_count, current, current + 1));
+
+ return TRUE;
+}
+
+static gboolean
+iface_node_has_available_offset_L (TypeNode *iface_node,
+ int offset,
+ int for_index)
+{
+ guint8 *offsets;
+
+ offsets = G_ATOMIC_ARRAY_GET_LOCKED (&iface_node->_prot.offsets, guint8);
+ if (offsets == NULL)
+ return TRUE;
+
+ if (G_ATOMIC_ARRAY_DATA_SIZE (offsets) <= offset)
+ return TRUE;
+
+ if (offsets[offset] == 0 ||
+ offsets[offset] == for_index+1)
+ return TRUE;
+
+ return FALSE;
+}
+
+static int
+find_free_iface_offset_L (IFaceEntries *entries)
+{
+ IFaceEntry *entry;
+ TypeNode *iface_node;
+ int offset;
+ int i;
+ int n_entries;
+
+ n_entries = IFACE_ENTRIES_N_ENTRIES (entries);
+ offset = -1;
+ do
{
- if (!node->plugin)
+ offset++;
+ for (i = 0; i < n_entries; i++)
{
- g_warning ("static type `%s' unreferenced too often",
- NODE_NAME (node));
- return;
+ entry = &entries->entry[i];
+ iface_node = lookup_type_node_I (entry->iface_type);
+
+ if (!iface_node_has_available_offset_L (iface_node, offset, i))
+ break;
}
-
- type_data_last_unref_Wm (NODE_TYPE (node), uncached);
}
+ while (i != n_entries);
+
+ return offset;
}
static void
-type_node_add_iface_entry_W (TypeNode *node,
- GType iface_type)
+iface_node_set_offset_L (TypeNode *iface_node,
+ int offset,
+ int index)
{
- IFaceEntry *entries;
- guint i;
-
- g_assert (node->is_instantiatable && CLASSED_NODE_N_IFACES (node) < MAX_N_IFACES);
-
- entries = CLASSED_NODE_IFACES_ENTRIES (node);
- for (i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
- if (entries[i].iface_type == iface_type)
- {
- /* this can (should) only happen if our parent type already conformed
- * to iface_type and node got it's own holder info. here, our
- * children should already have entries with NULL vtables, so
- * we're actually done.
- */
- g_assert (entries[i].vtable == NULL);
- return;
- }
- else if (entries[i].iface_type > iface_type)
- break;
- CLASSED_NODE_N_IFACES (node) += 1;
- CLASSED_NODE_IFACES_ENTRIES (node) = g_renew (IFaceEntry,
- CLASSED_NODE_IFACES_ENTRIES (node),
- CLASSED_NODE_N_IFACES (node));
- entries = CLASSED_NODE_IFACES_ENTRIES (node);
- g_memmove (entries + i + 1, entries + i, sizeof (entries[0]) * (CLASSED_NODE_N_IFACES (node) - i - 1));
- entries[i].iface_type = iface_type;
- entries[i].vtable = NULL;
-
- for (i = 0; i < node->n_children; i++)
- type_node_add_iface_entry_W (lookup_type_node_I (node->children[i]), iface_type);
+ guint8 *offsets, *old_offsets;
+ int new_size, old_size;
+ int i;
+
+ old_offsets = G_ATOMIC_ARRAY_GET_LOCKED (&iface_node->_prot.offsets, guint8);
+ if (old_offsets == NULL)
+ old_size = 0;
+ else
+ {
+ old_size = G_ATOMIC_ARRAY_DATA_SIZE (old_offsets);
+ if (offset < old_size &&
+ old_offsets[offset] == index + 1)
+ return; /* Already set to this index, return */
+ }
+ new_size = MAX (old_size, offset + 1);
+
+ offsets = _g_atomic_array_copy (&iface_node->_prot.offsets,
+ 0, new_size - old_size);
+
+ /* Mark new area as unused */
+ for (i = old_size; i < new_size; i++)
+ offsets[i] = 0;
+
+ offsets[offset] = index + 1;
+
+ _g_atomic_array_update (&iface_node->_prot.offsets, offsets);
+}
+
+static void
+type_node_add_iface_entry_W (TypeNode *node,
+ GType iface_type,
+ IFaceEntry *parent_entry)
+{
+ IFaceEntries *entries;
+ IFaceEntry *entry;
+ TypeNode *iface_node;
+ guint i, j;
+ int num_entries;
+
+ g_assert (node->is_instantiatable);
+
+ entries = CLASSED_NODE_IFACES_ENTRIES_LOCKED (node);
+ if (entries != NULL)
+ {
+ num_entries = IFACE_ENTRIES_N_ENTRIES (entries);
+
+ g_assert (num_entries < MAX_N_INTERFACES);
+
+ for (i = 0; i < num_entries; i++)
+ {
+ entry = &entries->entry[i];
+ if (entry->iface_type == iface_type)
+ {
+ /* this can happen in two cases:
+ * - our parent type already conformed to iface_type and node
+ * got its own holder info. here, our children already have
+ * entries and NULL vtables, since this will only work for
+ * uninitialized classes.
+ * - an interface type is added to an ancestor after it was
+ * added to a child type.
+ */
+ if (!parent_entry)
+ g_assert (entry->vtable == NULL && entry->init_state == UNINITIALIZED);
+ else
+ {
+ /* sick, interface is added to ancestor *after* child type;
+ * nothing todo, the entry and our children were already setup correctly
+ */
+ }
+ return;
+ }
+ }
+ }
+
+ entries = _g_atomic_array_copy (CLASSED_NODE_IFACES_ENTRIES (node),
+ IFACE_ENTRIES_HEADER_SIZE,
+ sizeof (IFaceEntry));
+ num_entries = IFACE_ENTRIES_N_ENTRIES (entries);
+ i = num_entries - 1;
+ if (i == 0)
+ entries->offset_index = 0;
+ entries->entry[i].iface_type = iface_type;
+ entries->entry[i].vtable = NULL;
+ entries->entry[i].init_state = UNINITIALIZED;
+
+ if (parent_entry)
+ {
+ if (node->data && node->data->class.init_state >= BASE_IFACE_INIT)
+ {
+ entries->entry[i].init_state = INITIALIZED;
+ entries->entry[i].vtable = parent_entry->vtable;
+ }
+ }
+
+ /* Update offsets in iface */
+ iface_node = lookup_type_node_I (iface_type);
+
+ if (iface_node_has_available_offset_L (iface_node,
+ entries->offset_index,
+ i))
+ {
+ iface_node_set_offset_L (iface_node,
+ entries->offset_index, i);
+ }
+ else
+ {
+ entries->offset_index =
+ find_free_iface_offset_L (entries);
+ for (j = 0; j < IFACE_ENTRIES_N_ENTRIES (entries); j++)
+ {
+ entry = &entries->entry[j];
+ iface_node =
+ lookup_type_node_I (entry->iface_type);
+ iface_node_set_offset_L (iface_node,
+ entries->offset_index, j);
+ }
+ }
+
+ _g_atomic_array_update (CLASSED_NODE_IFACES_ENTRIES (node), entries);
+
+ if (parent_entry)
+ {
+ for (i = 0; i < node->n_children; i++)
+ type_node_add_iface_entry_W (lookup_type_node_I (node->children[i]), iface_type, &entries->entry[i]);
+ }
}
static void
-type_add_interface_W (TypeNode *node,
- TypeNode *iface,
- const GInterfaceInfo *info,
- GTypePlugin *plugin)
+type_add_interface_Wm (TypeNode *node,
+ TypeNode *iface,
+ const GInterfaceInfo *info,
+ GTypePlugin *plugin)
{
IFaceHolder *iholder = g_new0 (IFaceHolder, 1);
-
- /* we must not call any functions of GInterfaceInfo from within here, since
- * we got most probably called from _within_ a type registration function
- */
+ IFaceEntry *entry;
+ guint i;
+
g_assert (node->is_instantiatable && NODE_IS_IFACE (iface) && ((info && !plugin) || (!info && plugin)));
iholder->next = iface_node_get_holders_L (iface);
iholder->instance_type = NODE_TYPE (node);
iholder->info = info ? g_memdup (info, sizeof (*info)) : NULL;
iholder->plugin = plugin;
+
+ /* create an iface entry for this type */
+ type_node_add_iface_entry_W (node, NODE_TYPE (iface), NULL);
+
+ /* if the class is already (partly) initialized, we may need to base
+ * initalize and/or initialize the new interface.
+ */
+ if (node->data)
+ {
+ InitState class_state = node->data->class.init_state;
+
+ if (class_state >= BASE_IFACE_INIT)
+ type_iface_vtable_base_init_Wm (iface, node);
+
+ if (class_state >= IFACE_INIT)
+ type_iface_vtable_iface_init_Wm (iface, node);
+ }
- type_node_add_iface_entry_W (node, NODE_TYPE (iface));
+ /* create iface entries for children of this type */
+ entry = type_lookup_iface_entry_L (node, iface);
+ for (i = 0; i < node->n_children; i++)
+ type_node_add_iface_entry_W (lookup_type_node_I (node->children[i]), NODE_TYPE (iface), entry);
}
static void
* g_type_interface_add_prerequisite:
* @interface_type: #GType value of an interface type.
* @prerequisite_type: #GType value of an interface or instantiatable type.
- *
+ *
* Adds @prerequisite_type to the list of prerequisites of @interface_type.
* This means that any type implementing @interface_type must also implement
* @prerequisite_type. Prerequisites can be thought of as an alternative to
* interface derivation (which GType doesn't support). An interface can have
* at most one instantiatable prerequisite type.
- **/
+ */
void
g_type_interface_add_prerequisite (GType interface_type,
GType prerequisite_type)
/**
* g_type_interface_prerequisites:
* @interface_type: an interface type
- * @n_prerequisites: location to return the number of prerequisites, or %NULL
- *
+ * @n_prerequisites: (out) (allow-none): location to return the number
+ * of prerequisites, or %NULL
+ *
* Returns the prerequisites of an interfaces type.
- *
- * Return value: a newly-allocated zero-terminated array of #GType containing
- * the prerequisites of @interface_type
*
* Since: 2.2
- **/
-GType* /* free result */
+ *
+ * Returns: (array length=n_prerequisites) (transfer full): a
+ * newly-allocated zero-terminated array of #GType containing
+ * the prerequisites of @interface_type
+ */
+GType*
g_type_interface_prerequisites (GType interface_type,
guint *n_prerequisites)
{
{
GType prerequisite = IFACE_NODE_PREREQUISITES (iface)[i];
TypeNode *node = lookup_type_node_I (prerequisite);
- if (node->is_instantiatable &&
- (!inode || type_node_is_a_L (node, inode)))
- inode = node;
+ if (node->is_instantiatable)
+ {
+ if (!inode || type_node_is_a_L (node, inode))
+ inode = node;
+ }
else
types[n++] = NODE_TYPE (node);
}
G_WRITE_UNLOCK (&type_rw_lock);
g_type_plugin_unuse (iholder->plugin);
+ type_data_unref_U (iface, FALSE);
G_WRITE_LOCK (&type_rw_lock);
-
- type_data_unref_Wm (iface, FALSE);
}
}
+/* Assumes type's class already exists
+ */
+static inline size_t
+type_total_instance_size_I (TypeNode *node)
+{
+ gsize total_instance_size;
+
+ total_instance_size = node->data->instance.instance_size;
+ if (node->data->instance.private_size != 0)
+ total_instance_size = ALIGN_STRUCT (total_instance_size) + node->data->instance.private_size;
+
+ return total_instance_size;
+}
/* --- type structure creation/destruction --- */
+typedef struct {
+ gpointer instance;
+ gpointer class;
+} InstanceRealClass;
+
+static gint
+instance_real_class_cmp (gconstpointer p1,
+ gconstpointer p2)
+{
+ const InstanceRealClass *irc1 = p1;
+ const InstanceRealClass *irc2 = p2;
+ guint8 *i1 = irc1->instance;
+ guint8 *i2 = irc2->instance;
+ return G_BSEARCH_ARRAY_CMP (i1, i2);
+}
+
+G_LOCK_DEFINE_STATIC (instance_real_class);
+static GBSearchArray *instance_real_class_bsa = NULL;
+static GBSearchConfig instance_real_class_bconfig = {
+ sizeof (InstanceRealClass),
+ instance_real_class_cmp,
+ 0,
+};
+
+static inline void
+instance_real_class_set (gpointer instance,
+ GTypeClass *class)
+{
+ InstanceRealClass key;
+ key.instance = instance;
+ key.class = class;
+ G_LOCK (instance_real_class);
+ if (!instance_real_class_bsa)
+ instance_real_class_bsa = g_bsearch_array_create (&instance_real_class_bconfig);
+ instance_real_class_bsa = g_bsearch_array_replace (instance_real_class_bsa, &instance_real_class_bconfig, &key);
+ G_UNLOCK (instance_real_class);
+}
+
+static inline void
+instance_real_class_remove (gpointer instance)
+{
+ InstanceRealClass key, *node;
+ guint index;
+ key.instance = instance;
+ G_LOCK (instance_real_class);
+ node = g_bsearch_array_lookup (instance_real_class_bsa, &instance_real_class_bconfig, &key);
+ index = g_bsearch_array_get_index (instance_real_class_bsa, &instance_real_class_bconfig, node);
+ instance_real_class_bsa = g_bsearch_array_remove (instance_real_class_bsa, &instance_real_class_bconfig, index);
+ if (!g_bsearch_array_get_n_nodes (instance_real_class_bsa))
+ {
+ g_bsearch_array_free (instance_real_class_bsa, &instance_real_class_bconfig);
+ instance_real_class_bsa = NULL;
+ }
+ G_UNLOCK (instance_real_class);
+}
+
+static inline GTypeClass*
+instance_real_class_get (gpointer instance)
+{
+ InstanceRealClass key, *node;
+ GTypeClass *class;
+ key.instance = instance;
+ G_LOCK (instance_real_class);
+ node = instance_real_class_bsa ? g_bsearch_array_lookup (instance_real_class_bsa, &instance_real_class_bconfig, &key) : NULL;
+ class = node ? node->class : NULL;
+ G_UNLOCK (instance_real_class);
+ return class;
+}
+
+/**
+ * g_type_create_instance: (skip)
+ * @type: An instantiatable type to create an instance for.
+ *
+ * Creates and initializes an instance of @type if @type is valid and
+ * can be instantiated. The type system only performs basic allocation
+ * and structure setups for instances: actual instance creation should
+ * happen through functions supplied by the type's fundamental type
+ * implementation. So use of g_type_create_instance() is reserved for
+ * implementators of fundamental types only. E.g. instances of the
+ * #GObject hierarchy should be created via g_object_new() and
+ * <emphasis>never</emphasis> directly through
+ * g_type_create_instance() which doesn't handle things like singleton
+ * objects or object construction. Note: Do <emphasis>not</emphasis>
+ * use this function, unless you're implementing a fundamental
+ * type. Also language bindings should <emphasis>not</emphasis> use
+ * this function but g_object_new() instead.
+ *
+ * Returns: An allocated and initialized instance, subject to further
+ * treatment by the fundamental type implementation.
+ */
GTypeInstance*
g_type_create_instance (GType type)
{
TypeNode *node;
GTypeInstance *instance;
GTypeClass *class;
- guint i;
+ guint i, total_size;
node = lookup_type_node_I (type);
if (!node || !node->is_instantiatable)
}
class = g_type_class_ref (type);
-
- if (node->data->instance.n_preallocs)
- {
- G_WRITE_LOCK (&type_rw_lock);
- if (!node->data->instance.mem_chunk)
- node->data->instance.mem_chunk = g_mem_chunk_new (NODE_NAME (node),
- node->data->instance.instance_size,
- (node->data->instance.instance_size *
- node->data->instance.n_preallocs),
- G_ALLOC_AND_FREE);
- instance = g_chunk_new0 (GTypeInstance, node->data->instance.mem_chunk);
- G_WRITE_UNLOCK (&type_rw_lock);
- }
- else
- instance = g_malloc0 (node->data->instance.instance_size); /* fine without read lock */
+ total_size = type_total_instance_size_I (node);
+
+ instance = g_slice_alloc0 (total_size);
+
+ if (node->data->instance.private_size)
+ instance_real_class_set (instance, class);
for (i = node->n_supers; i > 0; i--)
{
TypeNode *pnode;
pnode->data->instance.instance_init (instance, class);
}
}
+ if (node->data->instance.private_size)
+ instance_real_class_remove (instance);
+
instance->g_class = class;
-
if (node->data->instance.instance_init)
node->data->instance.instance_init (instance, class);
-
+
+ TRACE(GOBJECT_OBJECT_NEW(instance, type));
+
return instance;
}
+/**
+ * g_type_free_instance:
+ * @instance: an instance of a type.
+ *
+ * Frees an instance of a type, returning it to the instance pool for
+ * the type, if there is one.
+ *
+ * Like g_type_create_instance(), this function is reserved for
+ * implementors of fundamental types.
+ */
void
g_type_free_instance (GTypeInstance *instance)
{
instance->g_class = NULL;
#ifdef G_ENABLE_DEBUG
- memset (instance, 0xaa, node->data->instance.instance_size); /* debugging hack */
-#endif
- if (node->data->instance.n_preallocs)
- {
- G_WRITE_LOCK (&type_rw_lock);
- g_chunk_free (instance, node->data->instance.mem_chunk);
- G_WRITE_UNLOCK (&type_rw_lock);
- }
- else
- g_free (instance);
-
+ memset (instance, 0xaa, type_total_instance_size_I (node));
+#endif
+ g_slice_free1 (type_total_instance_size_I (node), instance);
+
g_type_class_unref (class);
}
+static void
+type_iface_ensure_dflt_vtable_Wm (TypeNode *iface)
+{
+ g_assert (iface->data);
+
+ if (!iface->data->iface.dflt_vtable)
+ {
+ GTypeInterface *vtable = g_malloc0 (iface->data->iface.vtable_size);
+ iface->data->iface.dflt_vtable = vtable;
+ vtable->g_type = NODE_TYPE (iface);
+ vtable->g_instance_type = 0;
+ if (iface->data->iface.vtable_init_base ||
+ iface->data->iface.dflt_init)
+ {
+ G_WRITE_UNLOCK (&type_rw_lock);
+ if (iface->data->iface.vtable_init_base)
+ iface->data->iface.vtable_init_base (vtable);
+ if (iface->data->iface.dflt_init)
+ iface->data->iface.dflt_init (vtable, (gpointer) iface->data->iface.dflt_data);
+ G_WRITE_LOCK (&type_rw_lock);
+ }
+ }
+}
+
+
+/* This is called to allocate and do the first part of initializing
+ * the interface vtable; type_iface_vtable_iface_init_Wm() does the remainder.
+ *
+ * A FALSE return indicates that we didn't find an init function for
+ * this type/iface pair, so the vtable from the parent type should
+ * be used. Note that the write lock is not modified upon a FALSE
+ * return.
+ */
static gboolean
-type_iface_vtable_init_Wm (TypeNode *iface,
- TypeNode *node)
+type_iface_vtable_base_init_Wm (TypeNode *iface,
+ TypeNode *node)
{
- IFaceEntry *entry = type_lookup_iface_entry_L (node, iface);
+ IFaceEntry *entry;
IFaceHolder *iholder;
GTypeInterface *vtable = NULL;
TypeNode *pnode;
iholder = type_iface_retrieve_holder_info_Wm (iface, NODE_TYPE (node), TRUE);
if (!iholder)
return FALSE; /* we don't modify write lock upon FALSE */
-
+
+ type_iface_ensure_dflt_vtable_Wm (iface);
+
+ entry = type_lookup_iface_entry_L (node, iface);
+
g_assert (iface->data && entry && entry->vtable == NULL && iholder && iholder->info);
+ entry->init_state = IFACE_INIT;
+
pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
if (pnode) /* want to copy over parent iface contents */
{
vtable = g_memdup (pentry->vtable, iface->data->iface.vtable_size);
}
if (!vtable)
- vtable = g_malloc0 (iface->data->iface.vtable_size);
+ vtable = g_memdup (iface->data->iface.dflt_vtable, iface->data->iface.vtable_size);
entry->vtable = vtable;
vtable->g_type = NODE_TYPE (iface);
vtable->g_instance_type = NODE_TYPE (node);
- if (iface->data->iface.vtable_init_base || iholder->info->interface_init)
+ if (iface->data->iface.vtable_init_base)
+ {
+ G_WRITE_UNLOCK (&type_rw_lock);
+ iface->data->iface.vtable_init_base (vtable);
+ G_WRITE_LOCK (&type_rw_lock);
+ }
+ return TRUE; /* initialized the vtable */
+}
+
+/* Finishes what type_iface_vtable_base_init_Wm started by
+ * calling the interface init function.
+ * this function may only be called for types with their
+ * own interface holder info, i.e. types for which
+ * g_type_add_interface*() was called and not children thereof.
+ */
+static void
+type_iface_vtable_iface_init_Wm (TypeNode *iface,
+ TypeNode *node)
+{
+ IFaceEntry *entry = type_lookup_iface_entry_L (node, iface);
+ IFaceHolder *iholder = type_iface_peek_holder_L (iface, NODE_TYPE (node));
+ GTypeInterface *vtable = NULL;
+ guint i;
+
+ /* iholder->info should have been filled in by type_iface_vtable_base_init_Wm() */
+ g_assert (iface->data && entry && iholder && iholder->info);
+ g_assert (entry->init_state == IFACE_INIT); /* assert prior base_init() */
+
+ entry->init_state = INITIALIZED;
+
+ vtable = entry->vtable;
+
+ if (iholder->info->interface_init)
{
G_WRITE_UNLOCK (&type_rw_lock);
- if (iface->data->iface.vtable_init_base)
- iface->data->iface.vtable_init_base (vtable);
if (iholder->info->interface_init)
iholder->info->interface_init (vtable, iholder->info->interface_data);
G_WRITE_LOCK (&type_rw_lock);
}
- return TRUE; /* write lock modified */
+
+ for (i = 0; i < static_n_iface_check_funcs; i++)
+ {
+ GTypeInterfaceCheckFunc check_func = static_iface_check_funcs[i].check_func;
+ gpointer check_data = static_iface_check_funcs[i].check_data;
+
+ G_WRITE_UNLOCK (&type_rw_lock);
+ check_func (check_data, (gpointer)vtable);
+ G_WRITE_LOCK (&type_rw_lock);
+ }
}
static gboolean
g_assert (entry && entry->vtable == vtable && iholder->info);
entry->vtable = NULL;
+ entry->init_state = UNINITIALIZED;
if (iholder->info->interface_finalize || iface->data->iface.vtable_finalize_base)
{
G_WRITE_UNLOCK (&type_rw_lock);
{
GSList *slist, *init_slist = NULL;
GTypeClass *class;
+ IFaceEntries *entries;
IFaceEntry *entry;
TypeNode *bnode, *pnode;
guint i;
+ /* Accessing data->class will work for instantiable types
+ * too because ClassData is a subset of InstanceData
+ */
g_assert (node->is_classed && node->data &&
node->data->class.class_size &&
- !node->data->class.class);
-
- class = g_malloc0 (node->data->class.class_size);
+ !node->data->class.class &&
+ node->data->class.init_state == UNINITIALIZED);
+ if (node->data->class.class_private_size)
+ class = g_malloc0 (ALIGN_STRUCT (node->data->class.class_size) + node->data->class.class_private_size);
+ else
+ class = g_malloc0 (node->data->class.class_size);
node->data->class.class = class;
+ g_atomic_int_set (&node->data->class.init_state, BASE_CLASS_INIT);
if (pclass)
{
TypeNode *pnode = lookup_type_node_I (pclass->g_type);
memcpy (class, pclass, pnode->data->class.class_size);
+ memcpy (G_STRUCT_MEMBER_P (class, ALIGN_STRUCT (node->data->class.class_size)), G_STRUCT_MEMBER_P (pclass, ALIGN_STRUCT (pnode->data->class.class_size)), pnode->data->class.class_private_size);
+
+ if (node->is_instantiatable)
+ {
+ /* We need to initialize the private_size here rather than in
+ * type_data_make_W() since the class init for the parent
+ * class may have changed pnode->data->instance.private_size.
+ */
+ node->data->instance.private_size = pnode->data->instance.private_size;
+ }
}
class->g_type = NODE_TYPE (node);
}
g_slist_free (init_slist);
- if (node->data->class.class_init)
- node->data->class.class_init (class, (gpointer) node->data->class.class_data);
-
G_WRITE_LOCK (&type_rw_lock);
+
+ g_atomic_int_set (&node->data->class.init_state, BASE_IFACE_INIT);
- /* ok, we got the class done, now initialize all interfaces, either
+ /* Before we initialize the class, base initialize all interfaces, either
* from parent, or through our holder info
*/
pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
- entry = CLASSED_NODE_IFACES_ENTRIES (node) + 0;
- while (entry)
+
+ i = 0;
+ while ((entries = CLASSED_NODE_IFACES_ENTRIES_LOCKED (node)) != NULL &&
+ i < IFACE_ENTRIES_N_ENTRIES (entries))
{
- g_assert (entry->vtable == NULL);
-
- if (!type_iface_vtable_init_Wm (lookup_type_node_I (entry->iface_type), node))
+ entry = &entries->entry[i];
+ while (i < IFACE_ENTRIES_N_ENTRIES (entries) &&
+ entry->init_state == IFACE_INIT)
+ {
+ entry++;
+ i++;
+ }
+
+ if (i == IFACE_ENTRIES_N_ENTRIES (entries))
+ break;
+
+ if (!type_iface_vtable_base_init_Wm (lookup_type_node_I (entry->iface_type), node))
{
guint j;
+ IFaceEntries *pentries = CLASSED_NODE_IFACES_ENTRIES_LOCKED (pnode);
- /* type_iface_vtable_init_Wm() doesn't modify write lock upon FALSE,
- * need to get this interface from parent
+ /* need to get this interface from parent, type_iface_vtable_base_init_Wm()
+ * doesn't modify write lock upon FALSE, so entry is still valid;
*/
g_assert (pnode != NULL);
-
- for (j = 0; j < CLASSED_NODE_N_IFACES (pnode); j++)
- {
- IFaceEntry *pentry = CLASSED_NODE_IFACES_ENTRIES (pnode) + j;
-
- if (pentry->iface_type == entry->iface_type)
- {
- entry->vtable = pentry->vtable;
- break;
- }
- }
+
+ if (pentries)
+ for (j = 0; j < IFACE_ENTRIES_N_ENTRIES (pentries); j++)
+ {
+ IFaceEntry *pentry = &pentries->entry[j];
+
+ if (pentry->iface_type == entry->iface_type)
+ {
+ entry->vtable = pentry->vtable;
+ entry->init_state = INITIALIZED;
+ break;
+ }
+ }
g_assert (entry->vtable != NULL);
}
+
+ /* If the write lock was released, additional interface entries might
+ * have been inserted into CLASSED_NODE_IFACES_ENTRIES (node); they'll
+ * be base-initialized when inserted, so we don't have to worry that
+ * we might miss them. Uninitialized entries can only be moved higher
+ * when new ones are inserted.
+ */
+ i++;
+ }
+
+ g_atomic_int_set (&node->data->class.init_state, CLASS_INIT);
+
+ G_WRITE_UNLOCK (&type_rw_lock);
+
+ if (node->data->class.class_init)
+ node->data->class.class_init (class, (gpointer) node->data->class.class_data);
+
+ G_WRITE_LOCK (&type_rw_lock);
+
+ g_atomic_int_set (&node->data->class.init_state, IFACE_INIT);
+
+ /* finish initializing the interfaces through our holder info.
+ * inherited interfaces are already init_state == INITIALIZED, because
+ * they either got setup in the above base_init loop, or during
+ * class_init from within type_add_interface_Wm() for this or
+ * an anchestor type.
+ */
+ i = 0;
+ while ((entries = CLASSED_NODE_IFACES_ENTRIES_LOCKED (node)) != NULL)
+ {
+ entry = &entries->entry[i];
+ while (i < IFACE_ENTRIES_N_ENTRIES (entries) &&
+ entry->init_state == INITIALIZED)
+ {
+ entry++;
+ i++;
+ }
+
+ if (i == IFACE_ENTRIES_N_ENTRIES (entries))
+ break;
+
+ type_iface_vtable_iface_init_Wm (lookup_type_node_I (entry->iface_type), node);
- /* refetch entry, IFACES_ENTRIES might be modified */
- for (entry = NULL, i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
- if (!CLASSED_NODE_IFACES_ENTRIES (node)[i].vtable)
- entry = CLASSED_NODE_IFACES_ENTRIES (node) + i;
+ /* As in the loop above, additional initialized entries might be inserted
+ * if the write lock is released, but that's harmless because the entries
+ * we need to initialize only move higher in the list.
+ */
+ i++;
}
+
+ g_atomic_int_set (&node->data->class.init_state, INITIALIZED);
}
static void
type_data_finalize_class_ifaces_Wm (TypeNode *node)
{
guint i;
+ IFaceEntries *entries;
- g_assert (node->is_instantiatable && node->data && node->data->class.class && node->data->common.ref_count == 0);
-
- g_message ("finalizing interfaces for %sClass `%s'",
- type_descriptive_name_I (NODE_FUNDAMENTAL_TYPE (node)),
- type_descriptive_name_I (NODE_TYPE (node)));
+ g_assert (node->is_instantiatable && node->data && node->data->class.class && NODE_REFCOUNT (node) == 0);
reiterate:
- for (i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
+ entries = CLASSED_NODE_IFACES_ENTRIES_LOCKED (node);
+ for (i = 0; entries != NULL && i < IFACE_ENTRIES_N_ENTRIES (entries); i++)
{
- IFaceEntry *entry = CLASSED_NODE_IFACES_ENTRIES (node) + i;
+ IFaceEntry *entry = &entries->entry[i];
if (entry->vtable)
{
if (type_iface_vtable_finalize_Wm (lookup_type_node_I (entry->iface_type), node, entry->vtable))
* iface vtable came from parent
*/
entry->vtable = NULL;
+ entry->init_state = UNINITIALIZED;
}
}
}
GTypeClass *class = cdata->class;
TypeNode *bnode;
- g_assert (cdata->class && cdata->common.ref_count == 0);
+ g_assert (cdata->class && NODE_REFCOUNT (node) == 0);
if (cdata->class_finalize)
cdata->class_finalize (class, (gpointer) cdata->class_data);
if (bnode->data->class.class_finalize_base)
bnode->data->class.class_finalize_base (class);
- class->g_type = 0;
g_free (cdata->class);
}
static void
-type_data_last_unref_Wm (GType type,
- gboolean uncached)
+type_data_last_unref_Wm (TypeNode *node,
+ gboolean uncached)
{
- TypeNode *node = lookup_type_node_I (type);
-
g_return_if_fail (node != NULL && node->plugin != NULL);
- if (!node->data || node->data->common.ref_count == 0)
+ if (!node->data || NODE_REFCOUNT (node) == 0)
{
g_warning ("cannot drop last reference to unreferenced type `%s'",
- type_descriptive_name_I (type));
+ NODE_NAME (node));
return;
}
-
- if (node->is_classed && node->data && node->data->class.class && static_n_class_cache_funcs)
+
+ /* call class cache hooks */
+ if (node->is_classed && node->data && node->data->class.class && static_n_class_cache_funcs && !uncached)
{
guint i;
G_READ_UNLOCK (&type_rw_lock);
need_break = cache_func (cache_data, node->data->class.class);
G_READ_LOCK (&type_rw_lock);
- if (!node->data || node->data->common.ref_count == 0)
+ if (!node->data || NODE_REFCOUNT (node) == 0)
INVALID_RECURSION ("GType class cache function ", cache_func, NODE_NAME (node));
if (need_break)
break;
G_WRITE_LOCK (&type_rw_lock);
}
- if (node->data->common.ref_count > 1) /* may have been re-referenced meanwhile */
- node->data->common.ref_count -= 1;
- else
+ /* may have been re-referenced meanwhile */
+ if (g_atomic_int_dec_and_test ((int *) &node->ref_count))
{
GType ptype = NODE_PARENT_TYPE (node);
TypeData *tdata;
- node->data->common.ref_count = 0;
-
- if (node->is_instantiatable && node->data->instance.mem_chunk)
+ if (node->is_instantiatable)
{
- g_mem_chunk_destroy (node->data->instance.mem_chunk);
- node->data->instance.mem_chunk = NULL;
+ /* destroy node->data->instance.mem_chunk */
}
tdata = node->data;
if (node->is_classed && tdata->class.class)
{
- if (CLASSED_NODE_N_IFACES (node))
+ if (CLASSED_NODE_IFACES_ENTRIES_LOCKED (node) != NULL)
type_data_finalize_class_ifaces_Wm (node);
node->mutatable_check_cache = FALSE;
node->data = NULL;
type_data_finalize_class_U (node, &tdata->class);
G_WRITE_LOCK (&type_rw_lock);
}
+ else if (NODE_IS_IFACE (node) && tdata->iface.dflt_vtable)
+ {
+ node->mutatable_check_cache = FALSE;
+ node->data = NULL;
+ if (tdata->iface.dflt_finalize || tdata->iface.vtable_finalize_base)
+ {
+ G_WRITE_UNLOCK (&type_rw_lock);
+ if (tdata->iface.dflt_finalize)
+ tdata->iface.dflt_finalize (tdata->iface.dflt_vtable, (gpointer) tdata->iface.dflt_data);
+ if (tdata->iface.vtable_finalize_base)
+ tdata->iface.vtable_finalize_base (tdata->iface.dflt_vtable);
+ G_WRITE_LOCK (&type_rw_lock);
+ }
+ g_free (tdata->iface.dflt_vtable);
+ }
else
- {
- node->mutatable_check_cache = FALSE;
- node->data = NULL;
- }
-
- /* freeing tdata->common.value_table and its contents is taking care of
+ {
+ node->mutatable_check_cache = FALSE;
+ node->data = NULL;
+ }
+
+ /* freeing tdata->common.value_table and its contents is taken care of
* by allocating it in one chunk with tdata
*/
g_free (tdata);
- if (ptype)
- type_data_unref_Wm (lookup_type_node_I (ptype), FALSE);
G_WRITE_UNLOCK (&type_rw_lock);
g_type_plugin_unuse (node->plugin);
+ if (ptype)
+ type_data_unref_U (lookup_type_node_I (ptype), FALSE);
G_WRITE_LOCK (&type_rw_lock);
}
}
+static inline void
+type_data_unref_U (TypeNode *node,
+ gboolean uncached)
+{
+ guint current;
+
+ do {
+ current = NODE_REFCOUNT (node);
+
+ if (current <= 1)
+ {
+ if (!node->plugin)
+ {
+ g_warning ("static type `%s' unreferenced too often",
+ NODE_NAME (node));
+ return;
+ }
+
+ g_assert (current > 0);
+
+ g_static_rec_mutex_lock (&class_init_rec_mutex); /* required locking order: 1) class_init_rec_mutex, 2) type_rw_lock */
+ G_WRITE_LOCK (&type_rw_lock);
+ type_data_last_unref_Wm (node, uncached);
+ G_WRITE_UNLOCK (&type_rw_lock);
+ g_static_rec_mutex_unlock (&class_init_rec_mutex);
+ return;
+ }
+ } while (!g_atomic_int_compare_and_exchange ((int *) &node->ref_count, current, current - 1));
+}
+
+/**
+ * g_type_add_class_cache_func: (skip)
+ * @cache_data: data to be passed to @cache_func
+ * @cache_func: a #GTypeClassCacheFunc
+ *
+ * Adds a #GTypeClassCacheFunc to be called before the reference count of a
+ * class goes from one to zero. This can be used to prevent premature class
+ * destruction. All installed #GTypeClassCacheFunc functions will be chained
+ * until one of them returns %TRUE. The functions have to check the class id
+ * passed in to figure whether they actually want to cache the class of this
+ * type, since all classes are routed through the same #GTypeClassCacheFunc
+ * chain.
+ */
void
g_type_add_class_cache_func (gpointer cache_data,
GTypeClassCacheFunc cache_func)
G_WRITE_UNLOCK (&type_rw_lock);
}
+/**
+ * g_type_remove_class_cache_func: (skip)
+ * @cache_data: data that was given when adding @cache_func
+ * @cache_func: a #GTypeClassCacheFunc
+ *
+ * Removes a previously installed #GTypeClassCacheFunc. The cache
+ * maintained by @cache_func has to be empty when calling
+ * g_type_remove_class_cache_func() to avoid leaks.
+ */
void
g_type_remove_class_cache_func (gpointer cache_data,
GTypeClassCacheFunc cache_func)
}
+/**
+ * g_type_add_interface_check: (skip)
+ * @check_data: data to pass to @check_func
+ * @check_func: function to be called after each interface
+ * is initialized.
+ *
+ * Adds a function to be called after an interface vtable is
+ * initialized for any class (i.e. after the @interface_init member of
+ * #GInterfaceInfo has been called).
+ *
+ * This function is useful when you want to check an invariant that
+ * depends on the interfaces of a class. For instance, the
+ * implementation of #GObject uses this facility to check that an
+ * object implements all of the properties that are defined on its
+ * interfaces.
+ *
+ * Since: 2.4
+ */
+void
+g_type_add_interface_check (gpointer check_data,
+ GTypeInterfaceCheckFunc check_func)
+{
+ guint i;
+
+ g_return_if_fail (check_func != NULL);
+
+ G_WRITE_LOCK (&type_rw_lock);
+ i = static_n_iface_check_funcs++;
+ static_iface_check_funcs = g_renew (IFaceCheckFunc, static_iface_check_funcs, static_n_iface_check_funcs);
+ static_iface_check_funcs[i].check_data = check_data;
+ static_iface_check_funcs[i].check_func = check_func;
+ G_WRITE_UNLOCK (&type_rw_lock);
+}
+
+/**
+ * g_type_remove_interface_check: (skip)
+ * @check_data: callback data passed to g_type_add_interface_check()
+ * @check_func: callback function passed to g_type_add_interface_check()
+ *
+ * Removes an interface check function added with
+ * g_type_add_interface_check().
+ *
+ * Since: 2.4
+ */
+void
+g_type_remove_interface_check (gpointer check_data,
+ GTypeInterfaceCheckFunc check_func)
+{
+ gboolean found_it = FALSE;
+ guint i;
+
+ g_return_if_fail (check_func != NULL);
+
+ G_WRITE_LOCK (&type_rw_lock);
+ for (i = 0; i < static_n_iface_check_funcs; i++)
+ if (static_iface_check_funcs[i].check_data == check_data &&
+ static_iface_check_funcs[i].check_func == check_func)
+ {
+ static_n_iface_check_funcs--;
+ g_memmove (static_iface_check_funcs + i,
+ static_iface_check_funcs + i + 1,
+ sizeof (static_iface_check_funcs[0]) * (static_n_iface_check_funcs - i));
+ static_iface_check_funcs = g_renew (IFaceCheckFunc, static_iface_check_funcs, static_n_iface_check_funcs);
+ found_it = TRUE;
+ break;
+ }
+ G_WRITE_UNLOCK (&type_rw_lock);
+
+ if (!found_it)
+ g_warning (G_STRLOC ": cannot remove unregistered class check func %p with data %p",
+ check_func, check_data);
+}
+
/* --- type registration --- */
+/**
+ * g_type_register_fundamental:
+ * @type_id: A predefined type identifier.
+ * @type_name: 0-terminated string used as the name of the new type.
+ * @info: The #GTypeInfo structure for this type.
+ * @finfo: The #GTypeFundamentalInfo structure for this type.
+ * @flags: Bitwise combination of #GTypeFlags values.
+ *
+ * Registers @type_id as the predefined identifier and @type_name as the
+ * name of a fundamental type. The type system uses the information
+ * contained in the #GTypeInfo structure pointed to by @info and the
+ * #GTypeFundamentalInfo structure pointed to by @finfo to manage the
+ * type and its instances. The value of @flags determines additional
+ * characteristics of the fundamental type.
+ *
+ * Returns: The predefined type identifier.
+ */
GType
g_type_register_fundamental (GType type_id,
const gchar *type_name,
const GTypeFundamentalInfo *finfo,
GTypeFlags flags)
{
- GTypeFundamentalInfo *node_finfo;
TypeNode *node;
- g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, 0);
+ g_return_val_if_type_system_uninitialized (0);
g_return_val_if_fail (type_id > 0, 0);
g_return_val_if_fail (type_name != NULL, 0);
g_return_val_if_fail (info != NULL, 0);
if ((type_id & TYPE_ID_MASK) ||
type_id > G_TYPE_FUNDAMENTAL_MAX)
{
- g_warning ("attempt to register fundamental type `%s' with invalid type id (%lu)",
+ g_warning ("attempt to register fundamental type `%s' with invalid type id (%" G_GSIZE_FORMAT ")",
type_name,
type_id);
return 0;
G_WRITE_LOCK (&type_rw_lock);
node = type_node_fundamental_new_W (type_id, type_name, finfo->type_flags);
- node_finfo = type_node_fundamental_info_I (node);
type_add_flags_W (node, flags);
if (check_type_info_I (NULL, NODE_FUNDAMENTAL_TYPE (node), type_name, info))
return NODE_TYPE (node);
}
+/**
+ * g_type_register_static_simple: (skip)
+ * @parent_type: Type from which this type will be derived.
+ * @type_name: 0-terminated string used as the name of the new type.
+ * @class_size: Size of the class structure (see #GTypeInfo)
+ * @class_init: Location of the class initialization function (see #GTypeInfo)
+ * @instance_size: Size of the instance structure (see #GTypeInfo)
+ * @instance_init: Location of the instance initialization function (see #GTypeInfo)
+ * @flags: Bitwise combination of #GTypeFlags values.
+ *
+ * Registers @type_name as the name of a new static type derived from
+ * @parent_type. The value of @flags determines the nature (e.g.
+ * abstract or not) of the type. It works by filling a #GTypeInfo
+ * struct and calling g_type_register_static().
+ *
+ * Since: 2.12
+ *
+ * Returns: The new type identifier.
+ */
+GType
+g_type_register_static_simple (GType parent_type,
+ const gchar *type_name,
+ guint class_size,
+ GClassInitFunc class_init,
+ guint instance_size,
+ GInstanceInitFunc instance_init,
+ GTypeFlags flags)
+{
+ GTypeInfo info;
+
+ info.class_size = class_size;
+ info.base_init = NULL;
+ info.base_finalize = NULL;
+ info.class_init = class_init;
+ info.class_finalize = NULL;
+ info.class_data = NULL;
+ info.instance_size = instance_size;
+ info.n_preallocs = 0;
+ info.instance_init = instance_init;
+ info.value_table = NULL;
+
+ return g_type_register_static (parent_type, type_name, &info, flags);
+}
+
+/**
+ * g_type_register_static:
+ * @parent_type: Type from which this type will be derived.
+ * @type_name: 0-terminated string used as the name of the new type.
+ * @info: The #GTypeInfo structure for this type.
+ * @flags: Bitwise combination of #GTypeFlags values.
+ *
+ * Registers @type_name as the name of a new static type derived from
+ * @parent_type. The type system uses the information contained in the
+ * #GTypeInfo structure pointed to by @info to manage the type and its
+ * instances (if not abstract). The value of @flags determines the nature
+ * (e.g. abstract or not) of the type.
+ *
+ * Returns: The new type identifier.
+ */
GType
g_type_register_static (GType parent_type,
const gchar *type_name,
TypeNode *pnode, *node;
GType type = 0;
- g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, 0);
+ g_return_val_if_type_system_uninitialized (0);
g_return_val_if_fail (parent_type > 0, 0);
g_return_val_if_fail (type_name != NULL, 0);
g_return_val_if_fail (info != NULL, 0);
return type;
}
+/**
+ * g_type_register_dynamic:
+ * @parent_type: Type from which this type will be derived.
+ * @type_name: 0-terminated string used as the name of the new type.
+ * @plugin: The #GTypePlugin structure to retrieve the #GTypeInfo from.
+ * @flags: Bitwise combination of #GTypeFlags values.
+ *
+ * Registers @type_name as the name of a new dynamic type derived from
+ * @parent_type. The type system uses the information contained in the
+ * #GTypePlugin structure pointed to by @plugin to manage the type and its
+ * instances (if not abstract). The value of @flags determines the nature
+ * (e.g. abstract or not) of the type.
+ *
+ * Returns: The new type identifier or #G_TYPE_INVALID if registration failed.
+ */
GType
g_type_register_dynamic (GType parent_type,
const gchar *type_name,
TypeNode *pnode, *node;
GType type;
- g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, 0);
+ g_return_val_if_type_system_uninitialized (0);
g_return_val_if_fail (parent_type > 0, 0);
g_return_val_if_fail (type_name != NULL, 0);
g_return_val_if_fail (plugin != NULL, 0);
return type;
}
+/**
+ * g_type_add_interface_static:
+ * @instance_type: #GType value of an instantiable type.
+ * @interface_type: #GType value of an interface type.
+ * @info: The #GInterfaceInfo structure for this
+ * (@instance_type, @interface_type) combination.
+ *
+ * Adds the static @interface_type to @instantiable_type. The information
+ * contained in the #GTypeInterfaceInfo structure pointed to by @info
+ * is used to manage the relationship.
+ */
void
g_type_add_interface_static (GType instance_type,
GType interface_type,
/* G_TYPE_IS_INSTANTIATABLE() is an external call: _U */
g_return_if_fail (G_TYPE_IS_INSTANTIATABLE (instance_type));
g_return_if_fail (g_type_parent (interface_type) == G_TYPE_INTERFACE);
-
+
+ /* we only need to lock class_init_rec_mutex if instance_type already has its
+ * class initialized, however this function is rarely enough called to take
+ * the simple route and always acquire class_init_rec_mutex.
+ */
+ g_static_rec_mutex_lock (&class_init_rec_mutex); /* required locking order: 1) class_init_rec_mutex, 2) type_rw_lock */
G_WRITE_LOCK (&type_rw_lock);
if (check_add_interface_L (instance_type, interface_type))
{
TypeNode *node = lookup_type_node_I (instance_type);
TypeNode *iface = lookup_type_node_I (interface_type);
-
if (check_interface_info_I (iface, NODE_TYPE (node), info))
- {
- type_add_interface_W (node, iface, info, NULL);
- /* if we have a class already, the interface vtable needs to
- * be initialized as well
- */
- if (node->data && node->data->class.class)
- type_iface_vtable_init_Wm (iface, node);
- }
+ type_add_interface_Wm (node, iface, info, NULL);
}
G_WRITE_UNLOCK (&type_rw_lock);
+ g_static_rec_mutex_unlock (&class_init_rec_mutex);
}
/**
* @instance_type: the #GType value of an instantiable type.
* @interface_type: the #GType value of an interface type.
* @plugin: the #GTypePlugin structure to retrieve the #GInterfaceInfo from.
- *
+ *
* Adds the dynamic @interface_type to @instantiable_type. The information
* contained in the #GTypePlugin structure pointed to by @plugin
* is used to manage the relationship.
- **/
+ */
void
g_type_add_interface_dynamic (GType instance_type,
GType interface_type,
GTypePlugin *plugin)
{
TypeNode *node;
-
/* G_TYPE_IS_INSTANTIATABLE() is an external call: _U */
g_return_if_fail (G_TYPE_IS_INSTANTIATABLE (instance_type));
g_return_if_fail (g_type_parent (interface_type) == G_TYPE_INTERFACE);
-
+
node = lookup_type_node_I (instance_type);
if (!check_plugin_U (plugin, FALSE, TRUE, NODE_NAME (node)))
return;
-
+
+ /* see comment in g_type_add_interface_static() about class_init_rec_mutex */
+ g_static_rec_mutex_lock (&class_init_rec_mutex); /* required locking order: 1) class_init_rec_mutex, 2) type_rw_lock */
G_WRITE_LOCK (&type_rw_lock);
if (check_add_interface_L (instance_type, interface_type))
{
TypeNode *iface = lookup_type_node_I (interface_type);
-
- type_add_interface_W (node, iface, NULL, plugin);
- /* if we have a class already, the interface vtable needs to
- * be initialized as well
- */
- if (node->data && node->data->class.class)
- type_iface_vtable_init_Wm (iface, node);
+ type_add_interface_Wm (node, iface, NULL, plugin);
}
G_WRITE_UNLOCK (&type_rw_lock);
+ g_static_rec_mutex_unlock (&class_init_rec_mutex);
}
/* --- public API functions --- */
+/**
+ * g_type_class_ref:
+ * @type: Type ID of a classed type.
+ *
+ * Increments the reference count of the class structure belonging to
+ * @type. This function will demand-create the class if it doesn't
+ * exist already.
+ *
+ * Returns: (type GObject.TypeClass) (transfer none): The #GTypeClass
+ * structure for the given type ID.
+ */
gpointer
g_type_class_ref (GType type)
{
TypeNode *node;
-
- /* optimize for common code path
- */
- G_WRITE_LOCK (&type_rw_lock);
+ GType ptype;
+ gboolean holds_ref;
+ GTypeClass *pclass;
+
+ /* optimize for common code path */
node = lookup_type_node_I (type);
- if (node && node->is_classed && node->data &&
- node->data->class.class && node->data->common.ref_count > 0)
+ if (!node || !node->is_classed)
{
- type_data_ref_Wm (node);
- G_WRITE_UNLOCK (&type_rw_lock);
-
- return node->data->class.class;
- }
-
- if (!node || !node->is_classed ||
- (node->data && node->data->common.ref_count < 1))
- {
- G_WRITE_UNLOCK (&type_rw_lock);
g_warning ("cannot retrieve class for invalid (unclassed) type `%s'",
type_descriptive_name_I (type));
return NULL;
}
-
- type_data_ref_Wm (node);
-
- if (!node->data->class.class)
+
+ if (G_LIKELY (type_data_ref_U (node)))
{
- GType ptype = NODE_PARENT_TYPE (node);
- GTypeClass *pclass = NULL;
-
- if (ptype)
- {
- G_WRITE_UNLOCK (&type_rw_lock);
- pclass = g_type_class_ref (ptype);
- if (node->data->class.class)
- INVALID_RECURSION ("g_type_plugin_*", node->plugin, NODE_NAME (node));
- G_WRITE_LOCK (&type_rw_lock);
- }
-
- type_class_init_Wm (node, pclass);
+ if (G_LIKELY (g_atomic_int_get (&node->data->class.init_state) == INITIALIZED))
+ return node->data->class.class;
+ holds_ref = TRUE;
}
- G_WRITE_UNLOCK (&type_rw_lock);
+ else
+ holds_ref = FALSE;
+ /* here, we either have node->data->class.class == NULL, or a recursive
+ * call to g_type_class_ref() with a partly initialized class, or
+ * node->data->class.init_state == INITIALIZED, because any
+ * concurrently running initialization was guarded by class_init_rec_mutex.
+ */
+ g_static_rec_mutex_lock (&class_init_rec_mutex); /* required locking order: 1) class_init_rec_mutex, 2) type_rw_lock */
+
+ /* we need an initialized parent class for initializing derived classes */
+ ptype = NODE_PARENT_TYPE (node);
+ pclass = ptype ? g_type_class_ref (ptype) : NULL;
+
+ G_WRITE_LOCK (&type_rw_lock);
+
+ if (!holds_ref)
+ type_data_ref_Wm (node);
+
+ if (!node->data->class.class) /* class uninitialized */
+ type_class_init_Wm (node, pclass);
+
+ G_WRITE_UNLOCK (&type_rw_lock);
+
+ if (pclass)
+ g_type_class_unref (pclass);
+
+ g_static_rec_mutex_unlock (&class_init_rec_mutex);
+
return node->data->class.class;
}
+/**
+ * g_type_class_unref:
+ * @g_class: (type GObject.TypeClass): The #GTypeClass structure to
+ * unreference.
+ *
+ * Decrements the reference count of the class structure being passed in.
+ * Once the last reference count of a class has been released, classes
+ * may be finalized by the type system, so further dereferencing of a
+ * class pointer after g_type_class_unref() are invalid.
+ */
void
g_type_class_unref (gpointer g_class)
{
g_return_if_fail (g_class != NULL);
node = lookup_type_node_I (class->g_type);
- G_WRITE_LOCK (&type_rw_lock);
- if (node && node->is_classed && node->data &&
- node->data->class.class == class && node->data->common.ref_count > 0)
- type_data_unref_Wm (node, FALSE);
+ if (node && node->is_classed && NODE_REFCOUNT (node))
+ type_data_unref_U (node, FALSE);
else
g_warning ("cannot unreference class of invalid (unclassed) type `%s'",
type_descriptive_name_I (class->g_type));
- G_WRITE_UNLOCK (&type_rw_lock);
}
+/**
+ * g_type_class_unref_uncached: (skip)
+ * @g_class: (type GObject.TypeClass): The #GTypeClass structure to
+ * unreference.
+ *
+ * A variant of g_type_class_unref() for use in #GTypeClassCacheFunc
+ * implementations. It unreferences a class without consulting the chain
+ * of #GTypeClassCacheFunc<!-- -->s, avoiding the recursion which would occur
+ * otherwise.
+ */
void
g_type_class_unref_uncached (gpointer g_class)
{
g_return_if_fail (g_class != NULL);
- G_WRITE_LOCK (&type_rw_lock);
node = lookup_type_node_I (class->g_type);
- if (node && node->is_classed && node->data &&
- node->data->class.class == class && node->data->common.ref_count > 0)
- type_data_unref_Wm (node, TRUE);
+ if (node && node->is_classed && NODE_REFCOUNT (node))
+ type_data_unref_U (node, TRUE);
else
g_warning ("cannot unreference class of invalid (unclassed) type `%s'",
type_descriptive_name_I (class->g_type));
- G_WRITE_UNLOCK (&type_rw_lock);
}
+/**
+ * g_type_class_peek:
+ * @type: Type ID of a classed type.
+ *
+ * This function is essentially the same as g_type_class_ref(), except that
+ * the classes reference count isn't incremented. As a consequence, this function
+ * may return %NULL if the class of the type passed in does not currently
+ * exist (hasn't been referenced before).
+ *
+ * Returns: (type GObject.TypeClass) (transfer none): The #GTypeClass
+ * structure for the given type ID or %NULL if the class does not
+ * currently exist.
+ */
gpointer
g_type_class_peek (GType type)
{
gpointer class;
node = lookup_type_node_I (type);
- G_READ_LOCK (&type_rw_lock);
- if (node && node->is_classed && node->data && node->data->class.class) /* common.ref_count _may_ be 0 */
+ if (node && node->is_classed && NODE_REFCOUNT (node) &&
+ g_atomic_int_get (&node->data->class.init_state) == INITIALIZED)
+ /* ref_count _may_ be 0 */
class = node->data->class.class;
else
class = NULL;
- G_READ_UNLOCK (&type_rw_lock);
return class;
}
+/**
+ * g_type_class_peek_static:
+ * @type: Type ID of a classed type.
+ *
+ * A more efficient version of g_type_class_peek() which works only for
+ * static types.
+ *
+ * Since: 2.4
+ * Returns: (type GObject.TypeClass) (transfer none): The #GTypeClass
+ * structure for the given type ID or %NULL if the class does not
+ * currently exist or is dynamically loaded.
+ */
+gpointer
+g_type_class_peek_static (GType type)
+{
+ TypeNode *node;
+ gpointer class;
+
+ node = lookup_type_node_I (type);
+ if (node && node->is_classed && NODE_REFCOUNT (node) &&
+ /* peek only static types: */ node->plugin == NULL &&
+ g_atomic_int_get (&node->data->class.init_state) == INITIALIZED)
+ /* ref_count _may_ be 0 */
+ class = node->data->class.class;
+ else
+ class = NULL;
+
+ return class;
+}
+
+/**
+ * g_type_class_peek_parent:
+ * @g_class: (type GObject.TypeClass): The #GTypeClass structure to
+ * retrieve the parent class for.
+ *
+ * This is a convenience function often needed in class initializers.
+ * It returns the class structure of the immediate parent type of the
+ * class passed in. Since derived classes hold a reference count on
+ * their parent classes as long as they are instantiated, the returned
+ * class will always exist. This function is essentially equivalent
+ * to:
+ *
+ * <programlisting>
+ * g_type_class_peek (g_type_parent (G_TYPE_FROM_CLASS (g_class)));
+ * </programlisting>
+ *
+ * Returns: (type GObject.TypeClass) (transfer none): The parent class
+ * of @g_class.
+ */
gpointer
g_type_class_peek_parent (gpointer g_class)
{
g_return_val_if_fail (g_class != NULL, NULL);
node = lookup_type_node_I (G_TYPE_FROM_CLASS (g_class));
- G_READ_LOCK (&type_rw_lock);
+ /* We used to acquire a read lock here. That is not necessary, since
+ * parent->data->class.class is constant as long as the derived class
+ * exists.
+ */
if (node && node->is_classed && node->data && NODE_PARENT_TYPE (node))
{
node = lookup_type_node_I (NODE_PARENT_TYPE (node));
}
else if (NODE_PARENT_TYPE (node))
g_warning (G_STRLOC ": invalid class pointer `%p'", g_class);
- G_READ_UNLOCK (&type_rw_lock);
return class;
}
+/**
+ * g_type_interface_peek:
+ * @instance_class: (type GObject.TypeClass): A #GTypeClass structure.
+ * @iface_type: An interface ID which this class conforms to.
+ *
+ * Returns the #GTypeInterface structure of an interface to which the
+ * passed in class conforms.
+ *
+ * Returns: (type GObject.TypeInterface) (transfer none): The GTypeInterface
+ * structure of iface_type if implemented by @instance_class, %NULL
+ * otherwise
+ */
gpointer
g_type_interface_peek (gpointer instance_class,
GType iface_type)
node = lookup_type_node_I (class->g_type);
iface = lookup_type_node_I (iface_type);
if (node && node->is_instantiatable && iface)
- {
- IFaceEntry *entry;
-
- G_READ_LOCK (&type_rw_lock);
-
- entry = type_lookup_iface_entry_L (node, iface);
- if (entry && entry->vtable) /* entry is relocatable */
- vtable = entry->vtable;
-
- G_READ_UNLOCK (&type_rw_lock);
- }
+ type_lookup_iface_vtable_I (node, iface, &vtable);
else
g_warning (G_STRLOC ": invalid class pointer `%p'", class);
/**
* g_type_interface_peek_parent:
- * @g_iface: A #GTypeInterface structure.
- *
+ * @g_iface: (type GObject.TypeInterface): A #GTypeInterface structure.
+ *
* Returns the corresponding #GTypeInterface structure of the parent type
- * of the instance type to which @g_iface belongs. This is useful when
- * deriving the implementation of an interface from the parent type and
- * then possibly overriding some methods.
- *
- * Return value: The corresponding #GTypeInterface structure of the parent type
- * of the instance type to which @g_iface belongs, or %NULL if the parent type
- * doesn't conform to the interface.
- **/
+ * of the instance type to which @g_iface belongs. This is useful when
+ * deriving the implementation of an interface from the parent type and
+ * then possibly overriding some methods.
+ *
+ * Returns: (transfer none) (type GObject.TypeInterface): The
+ * corresponding #GTypeInterface structure of the parent type of the
+ * instance type to which @g_iface belongs, or %NULL if the parent
+ * type doesn't conform to the interface.
+ */
gpointer
g_type_interface_peek_parent (gpointer g_iface)
{
if (node)
node = lookup_type_node_I (NODE_PARENT_TYPE (node));
if (node && node->is_instantiatable && iface)
- {
- IFaceEntry *entry;
-
- G_READ_LOCK (&type_rw_lock);
-
- entry = type_lookup_iface_entry_L (node, iface);
- if (entry && entry->vtable) /* entry is relocatable */
- vtable = entry->vtable;
-
- G_READ_UNLOCK (&type_rw_lock);
- }
+ type_lookup_iface_vtable_I (node, iface, &vtable);
else if (node)
g_warning (G_STRLOC ": invalid interface pointer `%p'", g_iface);
return vtable;
}
+/**
+ * g_type_default_interface_ref:
+ * @g_type: an interface type
+ *
+ * Increments the reference count for the interface type @g_type,
+ * and returns the default interface vtable for the type.
+ *
+ * If the type is not currently in use, then the default vtable
+ * for the type will be created and initalized by calling
+ * the base interface init and default vtable init functions for
+ * the type (the @<structfield>base_init</structfield>
+ * and <structfield>class_init</structfield> members of #GTypeInfo).
+ * Calling g_type_default_interface_ref() is useful when you
+ * want to make sure that signals and properties for an interface
+ * have been installed.
+ *
+ * Since: 2.4
+ *
+ * Returns: (type GObject.TypeInterface) (transfer none): the default
+ * vtable for the interface; call g_type_default_interface_unref()
+ * when you are done using the interface.
+ */
+gpointer
+g_type_default_interface_ref (GType g_type)
+{
+ TypeNode *node;
+ gpointer dflt_vtable;
+
+ G_WRITE_LOCK (&type_rw_lock);
+
+ node = lookup_type_node_I (g_type);
+ if (!node || !NODE_IS_IFACE (node) ||
+ (node->data && NODE_REFCOUNT (node) == 0))
+ {
+ G_WRITE_UNLOCK (&type_rw_lock);
+ g_warning ("cannot retrieve default vtable for invalid or non-interface type '%s'",
+ type_descriptive_name_I (g_type));
+ return NULL;
+ }
+
+ if (!node->data || !node->data->iface.dflt_vtable)
+ {
+ G_WRITE_UNLOCK (&type_rw_lock);
+ g_static_rec_mutex_lock (&class_init_rec_mutex); /* required locking order: 1) class_init_rec_mutex, 2) type_rw_lock */
+ G_WRITE_LOCK (&type_rw_lock);
+ node = lookup_type_node_I (g_type);
+ type_data_ref_Wm (node);
+ type_iface_ensure_dflt_vtable_Wm (node);
+ g_static_rec_mutex_unlock (&class_init_rec_mutex);
+ }
+ else
+ type_data_ref_Wm (node); /* ref_count >= 1 already */
+
+ dflt_vtable = node->data->iface.dflt_vtable;
+ G_WRITE_UNLOCK (&type_rw_lock);
+
+ return dflt_vtable;
+}
+
+/**
+ * g_type_default_interface_peek:
+ * @g_type: an interface type
+ *
+ * If the interface type @g_type is currently in use, returns its
+ * default interface vtable.
+ *
+ * Since: 2.4
+ *
+ * Returns: (type GObject.TypeInterface) (transfer none): the default
+ * vtable for the interface, or %NULL if the type is not currently in
+ * use.
+ */
+gpointer
+g_type_default_interface_peek (GType g_type)
+{
+ TypeNode *node;
+ gpointer vtable;
+
+ node = lookup_type_node_I (g_type);
+ if (node && NODE_IS_IFACE (node) && NODE_REFCOUNT (node))
+ vtable = node->data->iface.dflt_vtable;
+ else
+ vtable = NULL;
+
+ return vtable;
+}
+
+/**
+ * g_type_default_interface_unref:
+ * @g_iface: (type GObject.TypeInterface): the default vtable
+ * structure for a interface, as returned by
+ * g_type_default_interface_ref()
+ *
+ * Decrements the reference count for the type corresponding to the
+ * interface default vtable @g_iface. If the type is dynamic, then
+ * when no one is using the interface and all references have
+ * been released, the finalize function for the interface's default
+ * vtable (the <structfield>class_finalize</structfield> member of
+ * #GTypeInfo) will be called.
+ *
+ * Since: 2.4
+ */
+void
+g_type_default_interface_unref (gpointer g_iface)
+{
+ TypeNode *node;
+ GTypeInterface *vtable = g_iface;
+
+ g_return_if_fail (g_iface != NULL);
+
+ node = lookup_type_node_I (vtable->g_type);
+ if (node && NODE_IS_IFACE (node))
+ type_data_unref_U (node, FALSE);
+ else
+ g_warning ("cannot unreference invalid interface default vtable for '%s'",
+ type_descriptive_name_I (vtable->g_type));
+}
+
+/**
+ * g_type_name:
+ * @type: Type to return name for.
+ *
+ * Get the unique name that is assigned to a type ID. Note that this
+ * function (like all other GType API) cannot cope with invalid type
+ * IDs. %G_TYPE_INVALID may be passed to this function, as may be any
+ * other validly registered type ID, but randomized type IDs should
+ * not be passed in and will most likely lead to a crash.
+ *
+ * Returns: Static type name or %NULL.
+ */
G_CONST_RETURN gchar*
g_type_name (GType type)
{
TypeNode *node;
- g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, NULL);
+ g_return_val_if_type_system_uninitialized (NULL);
node = lookup_type_node_I (type);
return node ? NODE_NAME (node) : NULL;
}
+/**
+ * g_type_qname:
+ * @type: Type to return quark of type name for.
+ *
+ * Get the corresponding quark of the type IDs name.
+ *
+ * Returns: The type names quark or 0.
+ */
GQuark
g_type_qname (GType type)
{
return node ? node->qname : 0;
}
+/**
+ * g_type_from_name:
+ * @name: Type name to lookup.
+ *
+ * Lookup the type ID from a given type name, returning 0 if no type
+ * has been registered under this name (this is the preferred method
+ * to find out by name whether a specific type has been registered
+ * yet).
+ *
+ * Returns: Corresponding type ID or 0.
+ */
GType
g_type_from_name (const gchar *name)
{
return type;
}
+/**
+ * g_type_parent:
+ * @type: The derived type.
+ *
+ * Return the direct parent type of the passed in type. If the passed
+ * in type has no parent, i.e. is a fundamental type, 0 is returned.
+ *
+ * Returns: The parent type.
+ */
GType
g_type_parent (GType type)
{
return node ? NODE_PARENT_TYPE (node) : 0;
}
+/**
+ * g_type_depth:
+ * @type: A #GType value.
+ *
+ * Returns the length of the ancestry of the passed in type. This
+ * includes the type itself, so that e.g. a fundamental type has depth 1.
+ *
+ * Returns: The depth of @type.
+ */
guint
g_type_depth (GType type)
{
return node ? node->n_supers + 1 : 0;
}
+/**
+ * g_type_next_base:
+ * @leaf_type: Descendant of @root_type and the type to be returned.
+ * @root_type: Immediate parent of the returned type.
+ *
+ * Given a @leaf_type and a @root_type which is contained in its
+ * anchestry, return the type that @root_type is the immediate parent
+ * of. In other words, this function determines the type that is
+ * derived directly from @root_type which is also a base class of
+ * @leaf_type. Given a root type and a leaf type, this function can
+ * be used to determine the types and order in which the leaf type is
+ * descended from the root type.
+ *
+ * Returns: Immediate child of @root_type and anchestor of @leaf_type.
+ */
GType
g_type_next_base (GType type,
GType base_type)
gboolean have_lock)
{
gboolean match;
-
+
if (/* support_inheritance && */
- iface_node->n_supers <= node->n_supers &&
- node->supers[node->n_supers - iface_node->n_supers] == NODE_TYPE (iface_node))
+ NODE_IS_ANCESTOR (iface_node, node))
return TRUE;
-
+
support_interfaces = support_interfaces && node->is_instantiatable && NODE_IS_IFACE (iface_node);
support_prerequisites = support_prerequisites && NODE_IS_IFACE (node);
match = FALSE;
- if (support_interfaces || support_prerequisites)
+ if (support_interfaces)
+ {
+ if (have_lock)
+ {
+ if (type_lookup_iface_entry_L (node, iface_node))
+ match = TRUE;
+ }
+ else
+ {
+ if (type_lookup_iface_vtable_I (node, iface_node, NULL))
+ match = TRUE;
+ }
+ }
+ if (!match &&
+ support_prerequisites)
{
if (!have_lock)
G_READ_LOCK (&type_rw_lock);
- if (support_interfaces && type_lookup_iface_entry_L (node, iface_node))
- match = TRUE;
- else if (support_prerequisites && type_lookup_prerequisite_L (node, NODE_TYPE (iface_node)))
+ if (support_prerequisites && type_lookup_prerequisite_L (node, NODE_TYPE (iface_node)))
match = TRUE;
if (!have_lock)
G_READ_UNLOCK (&type_rw_lock);
return type_node_check_conformities_UorL (node, iface_node, support_interfaces, support_prerequisites, FALSE);
}
+/**
+ * g_type_is_a:
+ * @type: Type to check anchestry for.
+ * @is_a_type: Possible anchestor of @type or interface @type could conform to.
+ *
+ * If @is_a_type is a derivable type, check whether @type is a
+ * descendant of @is_a_type. If @is_a_type is an interface, check
+ * whether @type conforms to it.
+ *
+ * Returns: %TRUE if @type is_a @is_a_type holds true.
+ */
gboolean
g_type_is_a (GType type,
GType iface_type)
return is_a;
}
-GType* /* free result */
+/**
+ * g_type_children:
+ * @type: The parent type.
+ * @n_children: (out) (allow-none): Optional #guint pointer to contain
+ * the number of child types.
+ *
+ * Return a newly allocated and 0-terminated array of type IDs, listing the
+ * child types of @type. The return value has to be g_free()ed after use.
+ *
+ * Returns: (array length=n_children) (transfer full): Newly allocated
+ * and 0-terminated array of child types.
+ */
+GType*
g_type_children (GType type,
guint *n_children)
{
}
}
-GType* /* free result */
+/**
+ * g_type_interfaces:
+ * @type: The type to list interface types for.
+ * @n_interfaces: (out) (allow-none): Optional #guint pointer to
+ * contain the number of interface types.
+ *
+ * Return a newly allocated and 0-terminated array of type IDs, listing the
+ * interface types that @type conforms to. The return value has to be
+ * g_free()ed after use.
+ *
+ * Returns: (array length=n_interfaces) (transfer full): Newly
+ * allocated and 0-terminated array of interface types.
+ */
+GType*
g_type_interfaces (GType type,
guint *n_interfaces)
{
node = lookup_type_node_I (type);
if (node && node->is_instantiatable)
{
+ IFaceEntries *entries;
GType *ifaces;
guint i;
G_READ_LOCK (&type_rw_lock);
- ifaces = g_new (GType, CLASSED_NODE_N_IFACES (node) + 1);
- for (i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
- ifaces[i] = CLASSED_NODE_IFACES_ENTRIES (node)[i].iface_type;
+ entries = CLASSED_NODE_IFACES_ENTRIES_LOCKED (node);
+ if (entries)
+ {
+ ifaces = g_new (GType, IFACE_ENTRIES_N_ENTRIES (entries) + 1);
+ for (i = 0; i < IFACE_ENTRIES_N_ENTRIES (entries); i++)
+ ifaces[i] = entries->entry[i].iface_type;
+ }
+ else
+ {
+ ifaces = g_new (GType, 1);
+ i = 0;
+ }
ifaces[i] = 0;
if (n_interfaces)
- *n_interfaces = CLASSED_NODE_N_IFACES (node);
+ *n_interfaces = i;
G_READ_UNLOCK (&type_rw_lock);
return ifaces;
* g_type_get_qdata:
* @type: a #GType
* @quark: a #GQuark id to identify the data
- *
+ *
* Obtains data which has previously been attached to @type
* with g_type_set_qdata().
- *
- * Return value: the data, or %NULL if no data was found
- **/
+ *
+ * Returns: (transfer none): the data, or %NULL if no data was found
+ */
gpointer
g_type_get_qdata (GType type,
GQuark quark)
/**
* g_type_set_qdata:
- * @type: a #GType
+ * @type: a #GType
* @quark: a #GQuark id to identify the data
* @data: the data
- *
+ *
* Attaches arbitrary data to a type.
- **/
+ */
void
g_type_set_qdata (GType type,
GQuark quark,
/**
* g_type_query:
* @type: the #GType value of a static, classed type.
- * @query: A user provided structure that is filled in with constant values
- * upon success.
- *
- * Queries the type system for information about a specific type.
- * This function will fill in a user-provided structure to hold type-specific
- * information. If an invalid #GType is passed in, the @type member of the
- * #GTypeQuery is 0. All members filled into the #GTypeQuery structure should
- * be considered constant and have to be left untouched.
- **/
+ * @query: (out caller-allocates): A user provided structure that is
+ * filled in with constant values upon success.
+ *
+ * Queries the type system for information about a specific type.
+ * This function will fill in a user-provided structure to hold
+ * type-specific information. If an invalid #GType is passed in, the
+ * @type member of the #GTypeQuery is 0. All members filled into the
+ * #GTypeQuery structure should be considered constant and have to be
+ * left untouched.
+ */
void
g_type_query (GType type,
GTypeQuery *query)
return result;
}
+/**
+ * g_type_get_plugin:
+ * @type: The #GType to retrieve the plugin for.
+ *
+ * Returns the #GTypePlugin structure for @type or
+ * %NULL if @type does not have a #GTypePlugin structure.
+ *
+ * Returns: (transfer none): The corresponding plugin if @type is a
+ * dynamic type, %NULL otherwise.
+ */
GTypePlugin*
g_type_get_plugin (GType type)
{
* g_type_interface_get_plugin:
* @instance_type: the #GType value of an instantiatable type.
* @interface_type: the #GType value of an interface type.
- *
- * Returns the #GTypePlugin structure for the dynamic interface
- * @interface_type which has been added to @instance_type, or
- * %NULL if @interface_type has not been added to @instance_type or does
- * not have a #GTypePlugin structure. See g_type_add_interface_dynamic().
- *
- * Return value: the #GTypePlugin for the dynamic interface @interface_type
- * of @instance_type.
- **/
+ *
+ * Returns the #GTypePlugin structure for the dynamic interface
+ * @interface_type which has been added to @instance_type, or %NULL if
+ * @interface_type has not been added to @instance_type or does not
+ * have a #GTypePlugin structure. See g_type_add_interface_dynamic().
+ *
+ * Returns: (transfer none): the #GTypePlugin for the dynamic
+ * interface @interface_type of @instance_type.
+ */
GTypePlugin*
g_type_interface_get_plugin (GType instance_type,
GType interface_type)
return NULL;
}
+/**
+ * g_type_fundamental_next:
+ *
+ * Returns the next free fundamental type id which can be used to
+ * register a new fundamental type with g_type_register_fundamental().
+ * The returned type ID represents the highest currently registered
+ * fundamental type identifier.
+ *
+ * Returns: The nextmost fundamental type ID to be registered,
+ * or 0 if the type system ran out of fundamental type IDs.
+ */
GType
g_type_fundamental_next (void)
{
return type <= G_TYPE_FUNDAMENTAL_MAX ? type : 0;
}
+/**
+ * g_type_fundamental:
+ * @type_id: valid type ID
+ *
+ * Internal function, used to extract the fundamental type ID portion.
+ * use G_TYPE_FUNDAMENTAL() instead.
+ *
+ * Returns: fundamental type ID
+ */
GType
g_type_fundamental (GType type_id)
{
return type_class;
}
+/**
+ * g_type_check_instance:
+ * @instance: A valid #GTypeInstance structure.
+ *
+ * Private helper function to aid implementation of the G_TYPE_CHECK_INSTANCE()
+ * macro.
+ *
+ * @Returns: #TRUE if @instance is valid, #FALSE otherwise.
+ */
gboolean
g_type_check_instance (GTypeInstance *type_instance)
{
restart_check:
if (node)
{
- if (node->data && node->data->common.ref_count > 0 &&
+ if (node->data && NODE_REFCOUNT (node) > 0 &&
node->data->common.value_table->value_init)
tflags = GPOINTER_TO_UINT (type_get_qdata_L (node, static_quark_type_flags));
else if (NODE_IS_IFACE (node))
return value && type_check_is_value_type_U (value->g_type) && g_type_is_a (value->g_type, type);
}
+/**
+ * g_type_value_table_peek: (skip)
+ * @type: A #GType value.
+ *
+ * Returns the location of the #GTypeValueTable associated with @type.
+ * <emphasis>Note that this function should only be used from source code
+ * that implements or has internal knowledge of the implementation of
+ * @type.</emphasis>
+ *
+ * Returns: Location of the #GTypeValueTable associated with @type or
+ * %NULL if there is no #GTypeValueTable associated with @type.
+ */
GTypeValueTable*
g_type_value_table_peek (GType type)
{
GTypeValueTable *vtable = NULL;
TypeNode *node = lookup_type_node_I (type);
gboolean has_refed_data, has_table;
- TypeData *data;
- /* speed up common code path, we're not 100% safe here,
- * but we should only get called with referenced types anyway
- */
- data = node ? node->data : NULL;
- if (node && node->mutatable_check_cache)
- return data->common.value_table;
+ if (node && NODE_REFCOUNT (node) && node->mutatable_check_cache)
+ return node->data->common.value_table;
G_READ_LOCK (&type_rw_lock);
restart_table_peek:
- has_refed_data = node && node->data && node->data->common.ref_count;
+ has_refed_data = node && node->data && NODE_REFCOUNT (node) > 0;
has_table = has_refed_data && node->data->common.value_table->value_init;
if (has_refed_data)
{
return vtable;
if (!node)
- g_warning (G_STRLOC ": type id `%lu' is invalid", type);
+ g_warning (G_STRLOC ": type id `%" G_GSIZE_FORMAT "' is invalid", type);
if (!has_refed_data)
g_warning ("can't peek value table for type `%s' which is not currently referenced",
type_descriptive_name_I (type));
}
-/* --- foreign prototypes --- */
-extern void g_value_c_init (void); /* sync with gvalue.c */
-extern void g_value_types_init (void); /* sync with gvaluetypes.c */
-extern void g_enum_types_init (void); /* sync with genums.c */
-extern void g_param_type_init (void); /* sync with gparam.c */
-extern void g_boxed_type_init (void); /* sync with gboxed.c */
-extern void g_object_type_init (void); /* sync with gobject.c */
-extern void g_param_spec_types_init (void); /* sync with gparamspecs.c */
-extern void g_value_transforms_init (void); /* sync with gvaluetransform.c */
-extern void g_signal_init (void); /* sync with gsignal.c */
+/* --- private api for gboxed.c --- */
+gpointer
+_g_type_boxed_copy (GType type, gpointer value)
+{
+ TypeNode *node = lookup_type_node_I (type);
+
+ return node->data->boxed.copy_func (value);
+}
+
+void
+_g_type_boxed_free (GType type, gpointer value)
+{
+ TypeNode *node = lookup_type_node_I (type);
+
+ node->data->boxed.free_func (value);
+}
+
+void
+_g_type_boxed_init (GType type,
+ GBoxedCopyFunc copy_func,
+ GBoxedFreeFunc free_func)
+{
+ TypeNode *node = lookup_type_node_I (type);
+ node->data->boxed.copy_func = copy_func;
+ node->data->boxed.free_func = free_func;
+}
/* --- initialization --- */
+/**
+ * g_type_init_with_debug_flags:
+ * @debug_flags: Bitwise combination of #GTypeDebugFlags values for
+ * debugging purposes.
+ *
+ * Similar to g_type_init(), but additionally sets debug flags.
+ */
void
g_type_init_with_debug_flags (GTypeDebugFlags debug_flags)
{
const gchar *env_string;
GTypeInfo info;
TypeNode *node;
- GType type;
-
+ volatile GType votype;
+
+#ifdef G_THREADS_ENABLED
+ if (!g_thread_get_initialized())
+ g_thread_init (NULL);
+#endif
+
G_LOCK (type_init_lock);
G_WRITE_LOCK (&type_rw_lock);
/* void type G_TYPE_NONE
*/
- node = type_node_fundamental_new_W (G_TYPE_NONE, "void", 0);
- type = NODE_TYPE (node);
- g_assert (type == G_TYPE_NONE);
+ node = type_node_fundamental_new_W (G_TYPE_NONE, g_intern_static_string ("void"), 0);
+ votype = NODE_TYPE (node);
+ g_assert (votype == G_TYPE_NONE);
/* interface fundamental type G_TYPE_INTERFACE (!classed)
*/
memset (&info, 0, sizeof (info));
- node = type_node_fundamental_new_W (G_TYPE_INTERFACE, "GInterface", G_TYPE_FLAG_DERIVABLE);
- type = NODE_TYPE (node);
+ node = type_node_fundamental_new_W (G_TYPE_INTERFACE, g_intern_static_string ("GInterface"), G_TYPE_FLAG_DERIVABLE);
+ votype = NODE_TYPE (node);
type_data_make_W (node, &info, NULL);
- g_assert (type == G_TYPE_INTERFACE);
+ g_assert (votype == G_TYPE_INTERFACE);
G_WRITE_UNLOCK (&type_rw_lock);
/* G_TYPE_TYPE_PLUGIN
*/
- g_type_plugin_get_type ();
+ votype = g_type_plugin_get_type ();
/* G_TYPE_* value types
*/
G_UNLOCK (type_init_lock);
}
-void
+/**
+ * g_type_init:
+ *
+ * Prior to any use of the type system, g_type_init() has to be called
+ * to initialize the type system and assorted other code portions
+ * (such as the various fundamental type implementations or the signal
+ * system).
+ *
+ * Since version 2.24 this also initializes the thread system
+ */
+void
g_type_init (void)
{
g_type_init_with_debug_flags (0);
}
+
+/**
+ * g_type_class_add_private:
+ * @g_class: class structure for an instantiatable type
+ * @private_size: size of private structure.
+ *
+ * Registers a private structure for an instantiatable type.
+ *
+ * When an object is allocated, the private structures for
+ * the type and all of its parent types are allocated
+ * sequentially in the same memory block as the public
+ * structures.
+ *
+ * Note that the accumulated size of the private structures of
+ * a type and all its parent types cannot excced 64kB.
+ *
+ * This function should be called in the type's class_init() function.
+ * The private structure can be retrieved using the
+ * G_TYPE_INSTANCE_GET_PRIVATE() macro.
+ *
+ * The following example shows attaching a private structure
+ * <structname>MyObjectPrivate</structname> to an object
+ * <structname>MyObject</structname> defined in the standard GObject
+ * fashion.
+ * type's class_init() function.
+ *
+ * |[
+ * typedef struct _MyObject MyObject;
+ * typedef struct _MyObjectPrivate MyObjectPrivate;
+ *
+ * struct _MyObject {
+ * GObject parent;
+ *
+ * MyObjectPrivate *priv;
+ * };
+ *
+ * struct _MyObjectPrivate {
+ * int some_field;
+ * };
+ *
+ * static void
+ * my_object_class_init (MyObjectClass *klass)
+ * {
+ * g_type_class_add_private (klass, sizeof (MyObjectPrivate));
+ * }
+ *
+ * static void
+ * my_object_init (MyObject *my_object)
+ * {
+ * my_object->priv = G_TYPE_INSTANCE_GET_PRIVATE (my_object,
+ * MY_TYPE_OBJECT,
+ * MyObjectPrivate);
+ * }
+ *
+ * static int
+ * my_object_get_some_field (MyObject *my_object)
+ * {
+ * MyObjectPrivate *priv = my_object->priv;
+ *
+ * return priv->some_field;
+ * }
+ * ]|
+ *
+ * Since: 2.4
+ */
+void
+g_type_class_add_private (gpointer g_class,
+ gsize private_size)
+{
+ GType instance_type = ((GTypeClass *)g_class)->g_type;
+ TypeNode *node = lookup_type_node_I (instance_type);
+ gsize offset;
+
+ g_return_if_fail (private_size > 0);
+ g_return_if_fail (private_size <= 0xffff);
+
+ if (!node || !node->is_instantiatable || !node->data || node->data->class.class != g_class)
+ {
+ g_warning ("cannot add private field to invalid (non-instantiatable) type '%s'",
+ type_descriptive_name_I (instance_type));
+ return;
+ }
+
+ if (NODE_PARENT_TYPE (node))
+ {
+ TypeNode *pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
+ if (node->data->instance.private_size != pnode->data->instance.private_size)
+ {
+ g_warning ("g_type_add_private() called multiple times for the same type");
+ return;
+ }
+ }
+
+ G_WRITE_LOCK (&type_rw_lock);
+
+ offset = ALIGN_STRUCT (node->data->instance.private_size);
+
+ g_assert (offset + private_size <= 0xffff);
+
+ node->data->instance.private_size = offset + private_size;
+
+ G_WRITE_UNLOCK (&type_rw_lock);
+}
+
+gpointer
+g_type_instance_get_private (GTypeInstance *instance,
+ GType private_type)
+{
+ TypeNode *instance_node;
+ TypeNode *private_node;
+ TypeNode *parent_node;
+ GTypeClass *class;
+ gsize offset;
+
+ g_return_val_if_fail (instance != NULL && instance->g_class != NULL, NULL);
+
+ /* while instances are initialized, their class pointers change,
+ * so figure the instances real class first
+ */
+ class = instance_real_class_get (instance);
+ if (!class)
+ class = instance->g_class;
+
+ instance_node = lookup_type_node_I (class->g_type);
+ if (G_UNLIKELY (!instance_node || !instance_node->is_instantiatable))
+ {
+ g_warning ("instance of invalid non-instantiatable type `%s'",
+ type_descriptive_name_I (instance->g_class->g_type));
+ return NULL;
+ }
+
+ private_node = lookup_type_node_I (private_type);
+ if (G_UNLIKELY (!private_node || !NODE_IS_ANCESTOR (private_node, instance_node)))
+ {
+ g_warning ("attempt to retrieve private data for invalid type '%s'",
+ type_descriptive_name_I (private_type));
+ return NULL;
+ }
+
+ /* Note that we don't need a read lock, since instance existing
+ * means that the instance class and all parent classes
+ * exist, so the node->data, node->data->instance.instance_size,
+ * and node->data->instance.private_size are not going to be changed.
+ * for any of the relevant types.
+ */
+
+ offset = ALIGN_STRUCT (instance_node->data->instance.instance_size);
+
+ if (NODE_PARENT_TYPE (private_node))
+ {
+ parent_node = lookup_type_node_I (NODE_PARENT_TYPE (private_node));
+ g_assert (parent_node->data && NODE_REFCOUNT (parent_node) > 0);
+
+ if (G_UNLIKELY (private_node->data->instance.private_size == parent_node->data->instance.private_size))
+ {
+ g_warning ("g_type_instance_get_private() requires a prior call to g_type_class_add_private()");
+ return NULL;
+ }
+
+ offset += ALIGN_STRUCT (parent_node->data->instance.private_size);
+ }
+
+ return G_STRUCT_MEMBER_P (instance, offset);
+}
+
+/**
+ * g_type_add_class_private:
+ * @class_type: GType of an classed type.
+ * @private_size: size of private structure.
+ *
+ * Registers a private class structure for a classed type;
+ * when the class is allocated, the private structures for
+ * the class and all of its parent types are allocated
+ * sequentially in the same memory block as the public
+ * structures. This function should be called in the
+ * type's get_type() function after the type is registered.
+ * The private structure can be retrieved using the
+ * G_TYPE_CLASS_GET_PRIVATE() macro.
+ *
+ * Since: 2.24
+ */
+void
+g_type_add_class_private (GType class_type,
+ gsize private_size)
+{
+ TypeNode *node = lookup_type_node_I (class_type);
+ gsize offset;
+
+ g_return_if_fail (private_size > 0);
+
+ if (!node || !node->is_classed || !node->data)
+ {
+ g_warning ("cannot add class private field to invalid type '%s'",
+ type_descriptive_name_I (class_type));
+ return;
+ }
+
+ if (NODE_PARENT_TYPE (node))
+ {
+ TypeNode *pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
+ if (node->data->class.class_private_size != pnode->data->class.class_private_size)
+ {
+ g_warning ("g_type_add_class_private() called multiple times for the same type");
+ return;
+ }
+ }
+
+ G_WRITE_LOCK (&type_rw_lock);
+
+ offset = ALIGN_STRUCT (node->data->class.class_private_size);
+ node->data->class.class_private_size = offset + private_size;
+
+ G_WRITE_UNLOCK (&type_rw_lock);
+}
+
+gpointer
+g_type_class_get_private (GTypeClass *klass,
+ GType private_type)
+{
+ TypeNode *class_node;
+ TypeNode *private_node;
+ TypeNode *parent_node;
+ gsize offset;
+
+ g_return_val_if_fail (klass != NULL, NULL);
+
+ class_node = lookup_type_node_I (klass->g_type);
+ if (G_UNLIKELY (!class_node || !class_node->is_classed))
+ {
+ g_warning ("class of invalid type `%s'",
+ type_descriptive_name_I (klass->g_type));
+ return NULL;
+ }
+
+ private_node = lookup_type_node_I (private_type);
+ if (G_UNLIKELY (!private_node || !NODE_IS_ANCESTOR (private_node, class_node)))
+ {
+ g_warning ("attempt to retrieve private data for invalid type '%s'",
+ type_descriptive_name_I (private_type));
+ return NULL;
+ }
+
+ offset = ALIGN_STRUCT (class_node->data->class.class_size);
+
+ if (NODE_PARENT_TYPE (private_node))
+ {
+ parent_node = lookup_type_node_I (NODE_PARENT_TYPE (private_node));
+ g_assert (parent_node->data && NODE_REFCOUNT (parent_node) > 0);
+
+ if (G_UNLIKELY (private_node->data->class.class_private_size == parent_node->data->class.class_private_size))
+ {
+ g_warning ("g_type_instance_get_class_private() requires a prior call to g_type_class_add_class_private()");
+ return NULL;
+ }
+
+ offset += ALIGN_STRUCT (parent_node->data->class.class_private_size);
+ }
+
+ return G_STRUCT_MEMBER_P (klass, offset);
+}
projects / platform / upstream / glib.git / blobdiff