?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
When printing errors, handle NULL returns from g_type_debug(). (#73559,
[glib.git] / gobject / gtype.c
blob3cac59329f486d426a69c67d931e23e3aa82a550
1 /* GObject - GLib Type, Object, Parameter and Signal Library
2 * Copyright (C) 1998-1999, 2000-2001 Tim Janik and Red Hat, Inc.
3 *
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
8 *
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
13 *
14 * You should have received a copy of the GNU Lesser General
15 * Public License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place, Suite 330,
17 * Boston, MA 02111-1307, USA.
18 */
19 #include "gtype.h"
20
21 /*
22 * MT safe
23 */
24
25 #include "gtypeplugin.h"
26 #include "gvaluecollector.h"
27 #include <string.h>
28
29
30 /* NOTE: some functions (some internal variants and exported ones)
31 * invalidate data portions of the TypeNodes. if external functions/callbacks
32 * are called, pointers to memory maintained by TypeNodes have to be looked up
33 * again. this affects most of the struct TypeNode fields, e.g. ->children or
34 * CLASSED_NODE_IFACES_ENTRIES() respectively IFACE_NODE_PREREQUISITES() (but
35 * not ->supers[]), as all those memory portions can get realloc()ed during
36 * callback invocation.
37 *
38 * TODO:
39 * - g_type_from_name() should do an ordered array lookup after fetching the
40 * the quark, instead of a second hashtable lookup.
41 *
42 * LOCKING:
43 * lock handling issues when calling static functions are indicated by
44 * uppercase letter postfixes, all static functions have to have
45 * one of the below postfixes:
46 * - _I: [Indifferent about locking]
47 * function doesn't care about locks at all
48 * - _U: [Unlocked invocation]
49 * no read or write lock has to be held across function invocation
50 * (locks may be acquired and released during invocation though)
51 * - _L: [Locked invocation]
52 * a write lock or more than 0 read locks have to be held across
53 * function invocation
54 * - _W: [Write-locked invocation]
55 * a write lock has to be held across function invokation
56 * - _Wm: [Write-locked invocation, mutatable]
57 * like _W, but the write lock might be released and reacquired
58 * during invocation, watch your pointers
59 */
60
61 static GStaticRWLock type_rw_lock = G_STATIC_RW_LOCK_INIT;
62 #ifdef LOCK_DEBUG
63 #define G_READ_LOCK(rw_lock) do { g_printerr (G_STRLOC ": readL++\n"); g_static_rw_lock_reader_lock (rw_lock); } while (0)
64 #define G_READ_UNLOCK(rw_lock) do { g_printerr (G_STRLOC ": readL--\n"); g_static_rw_lock_reader_unlock (rw_lock); } while (0)
65 #define G_WRITE_LOCK(rw_lock) do { g_printerr (G_STRLOC ": writeL++\n"); g_static_rw_lock_writer_lock (rw_lock); } while (0)
66 #define G_WRITE_UNLOCK(rw_lock) do { g_printerr (G_STRLOC ": writeL--\n"); g_static_rw_lock_writer_unlock (rw_lock); } while (0)
67 #else
68 #define G_READ_LOCK(rw_lock) g_static_rw_lock_reader_lock (rw_lock)
69 #define G_READ_UNLOCK(rw_lock) g_static_rw_lock_reader_unlock (rw_lock)
70 #define G_WRITE_LOCK(rw_lock) g_static_rw_lock_writer_lock (rw_lock)
71 #define G_WRITE_UNLOCK(rw_lock) g_static_rw_lock_writer_unlock (rw_lock)
72 #endif
73 #define INVALID_RECURSION(func, arg, type_name) G_STMT_START{ \
74 static const gchar *_action = " invalidly modified type "; \
75 gpointer _arg = (gpointer) (arg); const gchar *_tname = (type_name), *_fname = (func); \
76 if (_arg) \
77 g_error ("%s(%p)%s`%s'", _fname, _arg, _action, _tname); \
78 else \
79 g_error ("%s()%s`%s'", _fname, _action, _tname); \
80 }G_STMT_END
81 #define g_return_val_if_uninitialized(condition, init_function, return_value) G_STMT_START{ \
82 if (!(condition)) \
83 { \
84 g_log (G_LOG_DOMAIN, G_LOG_LEVEL_CRITICAL, \
85 "%s: initialization assertion failed, use %s() prior to this function", \
86 G_STRLOC, G_STRINGIFY (init_function)); \
87 return (return_value); \
88 } \
89 }G_STMT_END
90
91 #ifdef G_ENABLE_DEBUG
92 #define DEBUG_CODE(debug_type, code_block) G_STMT_START { \
93 if (_g_type_debug_flags & G_TYPE_DEBUG_ ## debug_type) \
94 { code_block; } \
95 } G_STMT_END
96 #else /* !G_ENABLE_DEBUG */
97 #define DEBUG_CODE(debug_type, code_block) /* code_block */
98 #endif /* G_ENABLE_DEBUG */
99
100 #define TYPE_FUNDAMENTAL_FLAG_MASK (G_TYPE_FLAG_CLASSED | \
101 G_TYPE_FLAG_INSTANTIATABLE | \
102 G_TYPE_FLAG_DERIVABLE | \
103 G_TYPE_FLAG_DEEP_DERIVABLE)
104 #define TYPE_FLAG_MASK (G_TYPE_FLAG_ABSTRACT | G_TYPE_FLAG_VALUE_ABSTRACT)
105 #define SIZEOF_FUNDAMENTAL_INFO ((gssize) MAX (MAX (sizeof (GTypeFundamentalInfo), \
106 sizeof (gpointer)), \
107 sizeof (glong)))
108
109
110 /* --- typedefs --- */
111 typedef struct _TypeNode TypeNode;
112 typedef struct _CommonData CommonData;
113 typedef struct _IFaceData IFaceData;
114 typedef struct _ClassData ClassData;
115 typedef struct _InstanceData InstanceData;
116 typedef union _TypeData TypeData;
117 typedef struct _IFaceEntry IFaceEntry;
118 typedef struct _IFaceHolder IFaceHolder;
119
120
121 /* --- prototypes --- */
122 static inline GTypeFundamentalInfo* type_node_fundamental_info_I (TypeNode *node);
123 static void type_add_flags_W (TypeNode *node,
124 GTypeFlags flags);
125 static void type_data_make_W (TypeNode *node,
126 const GTypeInfo *info,
127 const GTypeValueTable *value_table);
128 static inline void type_data_ref_Wm (TypeNode *node);
129 static inline void type_data_unref_Wm (TypeNode *node,
130 gboolean uncached);
131 static void type_data_last_unref_Wm (GType type,
132 gboolean uncached);
133 static inline gpointer type_get_qdata_L (TypeNode *node,
134 GQuark quark);
135 static inline void type_set_qdata_W (TypeNode *node,
136 GQuark quark,
137 gpointer data);
138 static IFaceHolder* type_iface_peek_holder_L (TypeNode *iface,
139 GType instance_type);
140 static gboolean type_node_is_a_L (TypeNode *node,
141 TypeNode *iface_node);
142
143
144 /* --- structures --- */
145 struct _TypeNode
146 {
147 GTypePlugin *plugin;
148 guint n_children : 12;
149 guint n_supers : 8;
150 guint _prot_n_ifaces_prerequisites : 9;
151 guint is_classed : 1;
152 guint is_instantiatable : 1;
153 guint mutatable_check_cache : 1; /* combines some common path checks */
154 GType *children;
155 TypeData * volatile data;
156 GQuark qname;
157 GData *global_gdata;
158 union {
159 IFaceEntry *iface_entries; /* for !iface types */
160 GType *prerequisistes;
161 } _prot;
162 GType supers[1]; /* flexible array */
163 };
164 #define SIZEOF_BASE_TYPE_NODE() (G_STRUCT_OFFSET (TypeNode, supers))
165 #define MAX_N_SUPERS (255)
166 #define MAX_N_CHILDREN (4095)
167 #define MAX_N_IFACES (511)
168 #define MAX_N_PREREQUISITES (MAX_N_IFACES)
169 #define NODE_TYPE(node) (node->supers[0])
170 #define NODE_PARENT_TYPE(node) (node->supers[1])
171 #define NODE_FUNDAMENTAL_TYPE(node) (node->supers[node->n_supers])
172 #define NODE_NAME(node) (g_quark_to_string (node->qname))
173 #define NODE_IS_IFACE(node) (NODE_FUNDAMENTAL_TYPE (node) == G_TYPE_INTERFACE)
174 #define CLASSED_NODE_N_IFACES(node) ((node)->_prot_n_ifaces_prerequisites)
175 #define CLASSED_NODE_IFACES_ENTRIES(node) ((node)->_prot.iface_entries)
176 #define IFACE_NODE_N_PREREQUISITES(node) ((node)->_prot_n_ifaces_prerequisites)
177 #define IFACE_NODE_PREREQUISITES(node) ((node)->_prot.prerequisistes)
178 #define iface_node_get_holders_L(node) ((IFaceHolder*) type_get_qdata_L ((node), static_quark_iface_holder))
179 #define iface_node_set_holders_W(node, holders) (type_set_qdata_W ((node), static_quark_iface_holder, (holders)))
180 #define iface_node_get_dependants_array_L(n) ((GType*) type_get_qdata_L ((n), static_quark_dependants_array))
181 #define iface_node_set_dependants_array_W(n,d) (type_set_qdata_W ((n), static_quark_dependants_array, (d)))
182 #define TYPE_ID_MASK ((GType) ((1 << G_TYPE_FUNDAMENTAL_SHIFT) - 1))
183
184
185 struct _IFaceHolder
186 {
187 GType instance_type;
188 GInterfaceInfo *info;
189 GTypePlugin *plugin;
190 IFaceHolder *next;
191 };
192 struct _IFaceEntry
193 {
194 GType iface_type;
195 GTypeInterface *vtable;
196 };
197 struct _CommonData
198 {
199 guint ref_count;
200 GTypeValueTable *value_table;
201 };
202 struct _IFaceData
203 {
204 CommonData common;
205 guint16 vtable_size;
206 GBaseInitFunc vtable_init_base;
207 GBaseFinalizeFunc vtable_finalize_base;
208 };
209 struct _ClassData
210 {
211 CommonData common;
212 guint16 class_size;
213 GBaseInitFunc class_init_base;
214 GBaseFinalizeFunc class_finalize_base;
215 GClassInitFunc class_init;
216 GClassFinalizeFunc class_finalize;
217 gconstpointer class_data;
218 gpointer class;
219 };
220 struct _InstanceData
221 {
222 CommonData common;
223 guint16 class_size;
224 GBaseInitFunc class_init_base;
225 GBaseFinalizeFunc class_finalize_base;
226 GClassInitFunc class_init;
227 GClassFinalizeFunc class_finalize;
228 gconstpointer class_data;
229 gpointer class;
230 guint16 instance_size;
231 guint16 n_preallocs;
232 GInstanceInitFunc instance_init;
233 GMemChunk *mem_chunk;
234 };
235 union _TypeData
236 {
237 CommonData common;
238 IFaceData iface;
239 ClassData class;
240 InstanceData instance;
241 };
242 typedef struct {
243 gpointer cache_data;
244 GTypeClassCacheFunc cache_func;
245 } ClassCacheFunc;
246
247
248 /* --- variables --- */
249 static guint static_n_class_cache_funcs = 0;
250 static ClassCacheFunc *static_class_cache_funcs = NULL;
251 static GQuark static_quark_type_flags = 0;
252 static GQuark static_quark_iface_holder = 0;
253 static GQuark static_quark_dependants_array = 0;
254 GTypeDebugFlags _g_type_debug_flags = 0;
255
256
257 /* --- type nodes --- */
258 static GHashTable *static_type_nodes_ht = NULL;
259 static TypeNode *static_fundamental_type_nodes[(G_TYPE_FUNDAMENTAL_MAX >> G_TYPE_FUNDAMENTAL_SHIFT) + 1] = { 0, };
260 static GType static_fundamental_next = G_TYPE_RESERVED_USER_FIRST;
261
262 static inline TypeNode*
263 lookup_type_node_I (register GType utype)
264 {
265 if (utype > G_TYPE_FUNDAMENTAL_MAX)
266 return (TypeNode*) (utype & ~TYPE_ID_MASK);
267 else
268 return static_fundamental_type_nodes[utype >> G_TYPE_FUNDAMENTAL_SHIFT];
269 }
270
271 static TypeNode*
272 type_node_any_new_W (TypeNode *pnode,
273 GType ftype,
274 const gchar *name,
275 GTypePlugin *plugin,
276 GTypeFundamentalFlags type_flags)
277 {
278 guint n_supers;
279 GType type;
280 TypeNode *node;
281 guint i, node_size = 0;
282
283 n_supers = pnode ? pnode->n_supers + 1 : 0;
284
285 if (!pnode)
286 node_size += SIZEOF_FUNDAMENTAL_INFO; /* fundamental type info */
287 node_size += SIZEOF_BASE_TYPE_NODE (); /* TypeNode structure */
288 node_size += (sizeof (GType) * (1 + n_supers + 1)); /* self + ancestors + (0) for ->supers[] */
289 node = g_malloc0 (node_size);
290 if (!pnode) /* offset fundamental types */
291 {
292 node = G_STRUCT_MEMBER_P (node, SIZEOF_FUNDAMENTAL_INFO);
293 static_fundamental_type_nodes[ftype >> G_TYPE_FUNDAMENTAL_SHIFT] = node;
294 type = ftype;
295 }
296 else
297 type = (GType) node;
298
299 g_assert ((type & TYPE_ID_MASK) == 0);
300
301 node->n_supers = n_supers;
302 if (!pnode)
303 {
304 node->supers[0] = type;
305 node->supers[1] = 0;
306
307 node->is_classed = (type_flags & G_TYPE_FLAG_CLASSED) != 0;
308 node->is_instantiatable = (type_flags & G_TYPE_FLAG_INSTANTIATABLE) != 0;
309
310 if (NODE_IS_IFACE (node))
311 {
312 IFACE_NODE_N_PREREQUISITES (node) = 0;
313 IFACE_NODE_PREREQUISITES (node) = NULL;
314 }
315 else
316 {
317 CLASSED_NODE_N_IFACES (node) = 0;
318 CLASSED_NODE_IFACES_ENTRIES (node) = NULL;
319 }
320 }
321 else
322 {
323 node->supers[0] = type;
324 memcpy (node->supers + 1, pnode->supers, sizeof (GType) * (1 + pnode->n_supers + 1));
325
326 node->is_classed = pnode->is_classed;
327 node->is_instantiatable = pnode->is_instantiatable;
328
329 if (NODE_IS_IFACE (node))
330 {
331 IFACE_NODE_N_PREREQUISITES (node) = 0;
332 IFACE_NODE_PREREQUISITES (node) = NULL;
333 }
334 else
335 {
336 guint j;
337
338 CLASSED_NODE_N_IFACES (node) = CLASSED_NODE_N_IFACES (pnode);
339 CLASSED_NODE_IFACES_ENTRIES (node) = g_memdup (CLASSED_NODE_IFACES_ENTRIES (pnode),
340 sizeof (CLASSED_NODE_IFACES_ENTRIES (pnode)[0]) *
341 CLASSED_NODE_N_IFACES (node));
342 for (j = 0; j < CLASSED_NODE_N_IFACES (node); j++)
343 CLASSED_NODE_IFACES_ENTRIES (node)[j].vtable = NULL;
344 }
345
346 i = pnode->n_children++;
347 pnode->children = g_renew (GType, pnode->children, pnode->n_children);
348 pnode->children[i] = type;
349 }
350
351 node->plugin = plugin;
352 node->n_children = 0;
353 node->children = NULL;
354 node->data = NULL;
355 node->qname = g_quark_from_string (name);
356 node->global_gdata = NULL;
357
358 g_hash_table_insert (static_type_nodes_ht,
359 GUINT_TO_POINTER (node->qname),
360 (gpointer) type);
361 return node;
362 }
363
364 static inline GTypeFundamentalInfo*
365 type_node_fundamental_info_I (TypeNode *node)
366 {
367 GType ftype = NODE_FUNDAMENTAL_TYPE (node);
368
369 if (ftype != NODE_TYPE (node))
370 node = lookup_type_node_I (ftype);
371
372 return node ? G_STRUCT_MEMBER_P (node, -SIZEOF_FUNDAMENTAL_INFO) : NULL;
373 }
374
375 static TypeNode*
376 type_node_fundamental_new_W (GType ftype,
377 const gchar *name,
378 GTypeFundamentalFlags type_flags)
379 {
380 GTypeFundamentalInfo *finfo;
381 TypeNode *node;
382
383 g_assert ((ftype & TYPE_ID_MASK) == 0);
384 g_assert (ftype <= G_TYPE_FUNDAMENTAL_MAX);
385
386 if (ftype == static_fundamental_next)
387 static_fundamental_next += 1 << G_TYPE_FUNDAMENTAL_SHIFT;
388
389 type_flags &= TYPE_FUNDAMENTAL_FLAG_MASK;
390
391 node = type_node_any_new_W (NULL, ftype, name, NULL, type_flags);
392
393 finfo = type_node_fundamental_info_I (node);
394 finfo->type_flags = type_flags;
395
396 return node;
397 }
398
399 static TypeNode*
400 type_node_new_W (TypeNode *pnode,
401 const gchar *name,
402 GTypePlugin *plugin)
403
404 {
405 g_assert (pnode);
406 g_assert (pnode->n_supers < MAX_N_SUPERS);
407 g_assert (pnode->n_children < MAX_N_CHILDREN);
408
409 return type_node_any_new_W (pnode, NODE_FUNDAMENTAL_TYPE (pnode), name, plugin, 0);
410 }
411
412 static inline IFaceEntry*
413 type_lookup_iface_entry_L (TypeNode *node,
414 TypeNode *iface_node)
415 {
416 if (NODE_IS_IFACE (iface_node) && CLASSED_NODE_N_IFACES (node))
417 {
418 IFaceEntry *ifaces = CLASSED_NODE_IFACES_ENTRIES (node) - 1;
419 guint n_ifaces = CLASSED_NODE_N_IFACES (node);
420 GType iface_type = NODE_TYPE (iface_node);
421
422 do
423 {
424 guint i;
425 IFaceEntry *check;
426
427 i = (n_ifaces + 1) >> 1;
428 check = ifaces + i;
429 if (iface_type == check->iface_type)
430 return check;
431 else if (iface_type > check->iface_type)
432 {
433 n_ifaces -= i;
434 ifaces = check;
435 }
436 else /* if (iface_type < check->iface_type) */
437 n_ifaces = i - 1;
438 }
439 while (n_ifaces);
440 }
441
442 return NULL;
443 }
444
445 static inline gboolean
446 type_lookup_prerequisite_L (TypeNode *iface,
447 GType prerequisite_type)
448 {
449 if (NODE_IS_IFACE (iface) && IFACE_NODE_N_PREREQUISITES (iface))
450 {
451 GType *prerequisites = IFACE_NODE_PREREQUISITES (iface) - 1;
452 guint n_prerequisites = IFACE_NODE_N_PREREQUISITES (iface);
453
454 do
455 {
456 guint i;
457 GType *check;
458
459 i = (n_prerequisites + 1) >> 1;
460 check = prerequisites + i;
461 if (prerequisite_type == *check)
462 return TRUE;
463 else if (prerequisite_type > *check)
464 {
465 n_prerequisites -= i;
466 prerequisites = check;
467 }
468 else /* if (prerequisite_type < *check) */
469 n_prerequisites = i - 1;
470 }
471 while (n_prerequisites);
472 }
473 return FALSE;
474 }
475
476 static gchar*
477 type_descriptive_name_I (GType type)
478 {
479 if (type)
480 {
481 TypeNode *node = lookup_type_node_I (type);
482
483 return node ? NODE_NAME (node) : "<unknown>";
484 }
485 else
486 return "<invalid>";
487 }
488
489
490 /* --- type consistency checks --- */
491 static gboolean
492 check_plugin_U (GTypePlugin *plugin,
493 gboolean need_complete_type_info,
494 gboolean need_complete_interface_info,
495 const gchar *type_name)
496 {
497 /* G_IS_TYPE_PLUGIN() and G_TYPE_PLUGIN_GET_CLASS() are external calls: _U
498 */
499 if (!plugin)
500 {
501 g_warning ("plugin handle for type `%s' is NULL",
502 type_name);
503 return FALSE;
504 }
505 if (!G_IS_TYPE_PLUGIN (plugin))
506 {
507 g_warning ("plugin pointer (%p) for type `%s' is invalid",
508 plugin, type_name);
509 return FALSE;
510 }
511 if (need_complete_type_info && !G_TYPE_PLUGIN_GET_CLASS (plugin)->complete_type_info)
512 {
513 g_warning ("plugin for type `%s' has no complete_type_info() implementation",
514 type_name);
515 return FALSE;
516 }
517 if (need_complete_interface_info && !G_TYPE_PLUGIN_GET_CLASS (plugin)->complete_interface_info)
518 {
519 g_warning ("plugin for type `%s' has no complete_interface_info() implementation",
520 type_name);
521 return FALSE;
522 }
523 return TRUE;
524 }
525
526 static gboolean
527 check_type_name_I (const gchar *type_name)
528 {
529 static const gchar *extra_chars = "-_+";
530 const gchar *p = type_name;
531 gboolean name_valid;
532
533 if (!type_name[0] || !type_name[1] || !type_name[2])
534 {
535 g_warning ("type name `%s' is too short", type_name);
536 return FALSE;
537 }
538 /* check the first letter */
539 name_valid = (p[0] >= 'A' && p[0] <= 'Z') || (p[0] >= 'a' && p[0] <= 'z') || p[0] == '_';
540 for (p = type_name + 1; *p; p++)
541 name_valid &= ((p[0] >= 'A' && p[0] <= 'Z') ||
542 (p[0] >= 'a' && p[0] <= 'z') ||
543 (p[0] >= '0' && p[0] <= '9') ||
544 strchr (extra_chars, p[0]));
545 if (!name_valid)
546 {
547 g_warning ("type name `%s' contains invalid characters", type_name);
548 return FALSE;
549 }
550 if (g_type_from_name (type_name))
551 {
552 g_warning ("cannot register existing type `%s'", type_name);
553 return FALSE;
554 }
555
556 return TRUE;
557 }
558
559 static gboolean
560 check_derivation_I (GType parent_type,
561 const gchar *type_name)
562 {
563 TypeNode *pnode;
564 GTypeFundamentalInfo* finfo;
565
566 pnode = lookup_type_node_I (parent_type);
567 if (!pnode)
568 {
569 g_warning ("cannot derive type `%s' from invalid parent type `%s'",
570 type_name,
571 type_descriptive_name_I (parent_type));
572 return FALSE;
573 }
574 finfo = type_node_fundamental_info_I (pnode);
575 /* ensure flat derivability */
576 if (!(finfo->type_flags & G_TYPE_FLAG_DERIVABLE))
577 {
578 g_warning ("cannot derive `%s' from non-derivable parent type `%s'",
579 type_name,
580 NODE_NAME (pnode));
581 return FALSE;
582 }
583 /* ensure deep derivability */
584 if (parent_type != NODE_FUNDAMENTAL_TYPE (pnode) &&
585 !(finfo->type_flags & G_TYPE_FLAG_DEEP_DERIVABLE))
586 {
587 g_warning ("cannot derive `%s' from non-fundamental parent type `%s'",
588 type_name,
589 NODE_NAME (pnode));
590 return FALSE;
591 }
592
593 return TRUE;
594 }
595
596 static gboolean
597 check_collect_format_I (const gchar *collect_format)
598 {
599 const gchar *p = collect_format;
600 gchar valid_format[] = { G_VALUE_COLLECT_INT, G_VALUE_COLLECT_LONG,
601 G_VALUE_COLLECT_INT64, G_VALUE_COLLECT_DOUBLE,
602 G_VALUE_COLLECT_POINTER, 0 };
603
604 while (*p)
605 if (!strchr (valid_format, *p++))
606 return FALSE;
607 return p - collect_format <= G_VALUE_COLLECT_FORMAT_MAX_LENGTH;
608 }
609
610 static gboolean
611 check_value_table_I (const gchar *type_name,
612 const GTypeValueTable *value_table)
613 {
614 if (!value_table)
615 return FALSE;
616 else if (value_table->value_init == NULL)
617 {
618 if (value_table->value_free || value_table->value_copy ||
619 value_table->value_peek_pointer ||
620 value_table->collect_format || value_table->collect_value ||
621 value_table->lcopy_format || value_table->lcopy_value)
622 g_warning ("cannot handle uninitializable values of type `%s'",
623 type_name);
624 return FALSE;
625 }
626 else /* value_table->value_init != NULL */
627 {
628 if (!value_table->value_free)
629 {
630 /* +++ optional +++
631 * g_warning ("missing `value_free()' for type `%s'", type_name);
632 * return FALSE;
633 */
634 }
635 if (!value_table->value_copy)
636 {
637 g_warning ("missing `value_copy()' for type `%s'", type_name);
638 return FALSE;
639 }
640 if ((value_table->collect_format || value_table->collect_value) &&
641 (!value_table->collect_format || !value_table->collect_value))
642 {
643 g_warning ("one of `collect_format' and `collect_value()' is unspecified for type `%s'",
644 type_name);
645 return FALSE;
646 }
647 if (value_table->collect_format && !check_collect_format_I (value_table->collect_format))
648 {
649 g_warning ("the `%s' specification for type `%s' is too long or invalid",
650 "collect_format",
651 type_name);
652 return FALSE;
653 }
654 if ((value_table->lcopy_format || value_table->lcopy_value) &&
655 (!value_table->lcopy_format || !value_table->lcopy_value))
656 {
657 g_warning ("one of `lcopy_format' and `lcopy_value()' is unspecified for type `%s'",
658 type_name);
659 return FALSE;
660 }
661 if (value_table->lcopy_format && !check_collect_format_I (value_table->lcopy_format))
662 {
663 g_warning ("the `%s' specification for type `%s' is too long or invalid",
664 "lcopy_format",
665 type_name);
666 return FALSE;
667 }
668 }
669 return TRUE;
670 }
671
672 static gboolean
673 check_type_info_I (TypeNode *pnode,
674 GType ftype,
675 const gchar *type_name,
676 const GTypeInfo *info)
677 {
678 GTypeFundamentalInfo *finfo = type_node_fundamental_info_I (lookup_type_node_I (ftype));
679 gboolean is_interface = ftype == G_TYPE_INTERFACE;
680
681 g_assert (ftype <= G_TYPE_FUNDAMENTAL_MAX && !(ftype & TYPE_ID_MASK));
682
683 /* check instance members */
684 if (!(finfo->type_flags & G_TYPE_FLAG_INSTANTIATABLE) &&
685 (info->instance_size || info->n_preallocs || info->instance_init))
686 {
687 if (pnode)
688 g_warning ("cannot instantiate `%s', derived from non-instantiatable parent type `%s'",
689 type_name,
690 NODE_NAME (pnode));
691 else
692 g_warning ("cannot instantiate `%s' as non-instantiatable fundamental",
693 type_name);
694 return FALSE;
695 }
696 /* check class & interface members */
697 if (!(finfo->type_flags & G_TYPE_FLAG_CLASSED) &&
698 (info->class_init || info->class_finalize || info->class_data ||
699 (!is_interface && (info->class_size || info->base_init || info->base_finalize))))
700 {
701 if (pnode)
702 g_warning ("cannot create class for `%s', derived from non-classed parent type `%s'",
703 type_name,
704 NODE_NAME (pnode));
705 else
706 g_warning ("cannot create class for `%s' as non-classed fundamental",
707 type_name);
708 return FALSE;
709 }
710 /* check interface size */
711 if (is_interface && info->class_size < sizeof (GTypeInterface))
712 {
713 g_warning ("specified interface size for type `%s' is smaller than `GTypeInterface' size",
714 type_name);
715 return FALSE;
716 }
717 /* check class size */
718 if (finfo->type_flags & G_TYPE_FLAG_CLASSED)
719 {
720 if (info->class_size < sizeof (GTypeClass))
721 {
722 g_warning ("specified class size for type `%s' is smaller than `GTypeClass' size",
723 type_name);
724 return FALSE;
725 }
726 if (pnode && info->class_size < pnode->data->class.class_size)
727 {
728 g_warning ("specified class size for type `%s' is smaller "
729 "than the parent type's `%s' class size",
730 type_name,
731 NODE_NAME (pnode));
732 return FALSE;
733 }
734 }
735 /* check instance size */
736 if (finfo->type_flags & G_TYPE_FLAG_INSTANTIATABLE)
737 {
738 if (info->instance_size < sizeof (GTypeInstance))
739 {
740 g_warning ("specified instance size for type `%s' is smaller than `GTypeInstance' size",
741 type_name);
742 return FALSE;
743 }
744 if (pnode && info->instance_size < pnode->data->instance.instance_size)
745 {
746 g_warning ("specified instance size for type `%s' is smaller "
747 "than the parent type's `%s' instance size",
748 type_name,
749 NODE_NAME (pnode));
750 return FALSE;
751 }
752 }
753
754 return TRUE;
755 }
756
757 static TypeNode*
758 find_conforming_child_type_L (TypeNode *pnode,
759 TypeNode *iface)
760 {
761 TypeNode *node = NULL;
762 guint i;
763
764 if (type_lookup_iface_entry_L (pnode, iface))
765 return pnode;
766
767 for (i = 0; i < pnode->n_children && !node; i++)
768 node = find_conforming_child_type_L (lookup_type_node_I (pnode->children[i]), iface);
769
770 return node;
771 }
772
773 static gboolean
774 check_add_interface_L (GType instance_type,
775 GType iface_type)
776 {
777 TypeNode *node = lookup_type_node_I (instance_type);
778 TypeNode *iface = lookup_type_node_I (iface_type);
779 IFaceEntry *entry;
780 TypeNode *tnode;
781 GType *prerequisites;
782 guint i;
783
784
785 if (!node || !node->is_instantiatable)
786 {
787 g_warning ("cannot add interfaces to invalid (non-instantiatable) type `%s'",
788 type_descriptive_name_I (instance_type));
789 return FALSE;
790 }
791 if (!iface || !NODE_IS_IFACE (iface))
792 {
793 g_warning ("cannot add invalid (non-interface) type `%s' to type `%s'",
794 type_descriptive_name_I (iface_type),
795 NODE_NAME (node));
796 return FALSE;
797 }
798 tnode = lookup_type_node_I (NODE_PARENT_TYPE (iface));
799 if (NODE_PARENT_TYPE (tnode) && !type_lookup_iface_entry_L (node, tnode))
800 {
801 /* 2001/7/31:timj: erk, i guess this warning is junk as interface derivation is flat */
802 g_warning ("cannot add sub-interface `%s' to type `%s' which does not conform to super-interface `%s'",
803 NODE_NAME (iface),
804 NODE_NAME (node),
805 NODE_NAME (tnode));
806 return FALSE;
807 }
808 /* allow overriding of interface type introduced for parent type */
809 entry = type_lookup_iface_entry_L (node, iface);
810 if (entry && entry->vtable == NULL && !type_iface_peek_holder_L (iface, NODE_TYPE (node)))
811 {
812 /* ok, we do conform to this interface already, but the interface vtable was not
813 * yet intialized, and we just conform to the interface because it got added to
814 * one of our parents. so we allow overriding of holder info here.
815 */
816 return TRUE;
817 }
818 /* check whether one of our children already conforms (or whether the interface
819 * got added to this node already)
820 */
821 tnode = find_conforming_child_type_L (node, iface); /* tnode is_a node */
822 if (tnode)
823 {
824 g_warning ("cannot add interface type `%s' to type `%s', since type `%s' already conforms to interface",
825 NODE_NAME (iface),
826 NODE_NAME (node),
827 NODE_NAME (tnode));
828 return FALSE;
829 }
830 prerequisites = IFACE_NODE_PREREQUISITES (iface);
831 for (i = 0; i < IFACE_NODE_N_PREREQUISITES (iface); i++)
832 {
833 tnode = lookup_type_node_I (prerequisites[i]);
834 if (!type_node_is_a_L (node, tnode))
835 {
836 g_warning ("cannot add interface type `%s' to type `%s' which does not conform to prerequisite `%s'",
837 NODE_NAME (iface),
838 NODE_NAME (node),
839 NODE_NAME (tnode));
840 return FALSE;
841 }
842 }
843 return TRUE;
844 }
845
846 static gboolean
847 check_interface_info_I (TypeNode *iface,
848 GType instance_type,
849 const GInterfaceInfo *info)
850 {
851 if ((info->interface_finalize || info->interface_data) && !info->interface_init)
852 {
853 g_warning ("interface type `%s' for type `%s' comes without initializer",
854 NODE_NAME (iface),
855 type_descriptive_name_I (instance_type));
856 return FALSE;
857 }
858
859 return TRUE;
860 }
861
862 /* --- type info (type node data) --- */
863 static void
864 type_data_make_W (TypeNode *node,
865 const GTypeInfo *info,
866 const GTypeValueTable *value_table)
867 {
868 TypeData *data;
869 GTypeValueTable *vtable = NULL;
870 guint vtable_size = 0;
871
872 g_assert (node->data == NULL && info != NULL);
873
874 if (!value_table)
875 {
876 TypeNode *pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
877
878 if (pnode)
879 vtable = pnode->data->common.value_table;
880 else
881 {
882 static const GTypeValueTable zero_vtable = { NULL, };
883
884 value_table = &zero_vtable;
885 }
886 }
887 if (value_table)
888 {
889 /* need to setup vtable_size since we have to allocate it with data in one chunk */
890 vtable_size = sizeof (GTypeValueTable);
891 if (value_table->collect_format)
892 vtable_size += strlen (value_table->collect_format);
893 if (value_table->lcopy_format)
894 vtable_size += strlen (value_table->lcopy_format);
895 vtable_size += 2;
896 }
897
898 if (node->is_instantiatable) /* carefull, is_instantiatable is also is_classed */
899 {
900 data = g_malloc0 (sizeof (InstanceData) + vtable_size);
901 if (vtable_size)
902 vtable = G_STRUCT_MEMBER_P (data, sizeof (InstanceData));
903 data->instance.class_size = info->class_size;
904 data->instance.class_init_base = info->base_init;
905 data->instance.class_finalize_base = info->base_finalize;
906 data->instance.class_init = info->class_init;
907 data->instance.class_finalize = info->class_finalize;
908 data->instance.class_data = info->class_data;
909 data->instance.class = NULL;
910 data->instance.instance_size = info->instance_size;
911 #ifdef DISABLE_MEM_POOLS
912 data->instance.n_preallocs = 0;
913 #else /* !DISABLE_MEM_POOLS */
914 data->instance.n_preallocs = MIN (info->n_preallocs, 1024);
915 #endif /* !DISABLE_MEM_POOLS */
916 data->instance.instance_init = info->instance_init;
917 data->instance.mem_chunk = NULL;
918 }
919 else if (node->is_classed) /* only classed */
920 {
921 data = g_malloc0 (sizeof (ClassData) + vtable_size);
922 if (vtable_size)
923 vtable = G_STRUCT_MEMBER_P (data, sizeof (ClassData));
924 data->class.class_size = info->class_size;
925 data->class.class_init_base = info->base_init;
926 data->class.class_finalize_base = info->base_finalize;
927 data->class.class_init = info->class_init;
928 data->class.class_finalize = info->class_finalize;
929 data->class.class_data = info->class_data;
930 data->class.class = NULL;
931 }
932 else if (NODE_IS_IFACE (node))
933 {
934 data = g_malloc0 (sizeof (IFaceData) + vtable_size);
935 if (vtable_size)
936 vtable = G_STRUCT_MEMBER_P (data, sizeof (IFaceData));
937 data->iface.vtable_size = info->class_size;
938 data->iface.vtable_init_base = info->base_init;
939 data->iface.vtable_finalize_base = info->base_finalize;
940 }
941 else
942 {
943 data = g_malloc0 (sizeof (CommonData) + vtable_size);
944 if (vtable_size)
945 vtable = G_STRUCT_MEMBER_P (data, sizeof (CommonData));
946 }
947
948 node->data = data;
949 node->data->common.ref_count = 1;
950
951 if (vtable_size)
952 {
953 gchar *p;
954
955 /* we allocate the vtable and its strings together with the type data, so
956 * children can take over their parent's vtable pointer, and we don't
957 * need to worry freeing it or not when the child data is destroyed
958 */
959 *vtable = *value_table;
960 p = G_STRUCT_MEMBER_P (vtable, sizeof (*vtable));
961 p[0] = 0;
962 vtable->collect_format = p;
963 if (value_table->collect_format)
964 {
965 strcat (p, value_table->collect_format);
966 p += strlen (value_table->collect_format);
967 }
968 p++;
969 p[0] = 0;
970 vtable->lcopy_format = p;
971 if (value_table->lcopy_format)
972 strcat (p, value_table->lcopy_format);
973 }
974 node->data->common.value_table = vtable;
975 node->mutatable_check_cache = (node->data->common.value_table->value_init != NULL &&
976 !((G_TYPE_FLAG_VALUE_ABSTRACT | G_TYPE_FLAG_ABSTRACT) &
977 GPOINTER_TO_UINT (type_get_qdata_L (node, static_quark_type_flags))));
978
979 g_assert (node->data->common.value_table != NULL); /* paranoid */
980 }
981
982 static inline void
983 type_data_ref_Wm (TypeNode *node)
984 {
985 if (!node->data)
986 {
987 TypeNode *pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
988 GTypeInfo tmp_info;
989 GTypeValueTable tmp_value_table;
990
991 g_assert (node->plugin != NULL);
992
993 if (pnode)
994 {
995 type_data_ref_Wm (pnode);
996 if (node->data)
997 INVALID_RECURSION ("g_type_plugin_*", node->plugin, NODE_NAME (node));
998 }
999
1000 memset (&tmp_info, 0, sizeof (tmp_info));
1001 memset (&tmp_value_table, 0, sizeof (tmp_value_table));
1002
1003 G_WRITE_UNLOCK (&type_rw_lock);
1004 g_type_plugin_use (node->plugin);
1005 g_type_plugin_complete_type_info (node->plugin, NODE_TYPE (node), &tmp_info, &tmp_value_table);
1006 G_WRITE_LOCK (&type_rw_lock);
1007 if (node->data)
1008 INVALID_RECURSION ("g_type_plugin_*", node->plugin, NODE_NAME (node));
1009
1010 check_type_info_I (pnode, NODE_FUNDAMENTAL_TYPE (node), NODE_NAME (node), &tmp_info);
1011 type_data_make_W (node, &tmp_info,
1012 check_value_table_I (NODE_NAME (node),
1013 &tmp_value_table) ? &tmp_value_table : NULL);
1014 }
1015 else
1016 {
1017 g_assert (node->data->common.ref_count > 0);
1018
1019 node->data->common.ref_count += 1;
1020 }
1021 }
1022
1023 static inline void
1024 type_data_unref_Wm (TypeNode *node,
1025 gboolean uncached)
1026 {
1027 g_assert (node->data && node->data->common.ref_count);
1028
1029 if (node->data->common.ref_count > 1)
1030 node->data->common.ref_count -= 1;
1031 else
1032 {
1033 if (!node->plugin)
1034 {
1035 g_warning ("static type `%s' unreferenced too often",
1036 NODE_NAME (node));
1037 return;
1038 }
1039
1040 type_data_last_unref_Wm (NODE_TYPE (node), uncached);
1041 }
1042 }
1043
1044 static void
1045 type_node_add_iface_entry_W (TypeNode *node,
1046 GType iface_type)
1047 {
1048 IFaceEntry *entries;
1049 guint i;
1050
1051 g_assert (node->is_instantiatable && CLASSED_NODE_N_IFACES (node) < MAX_N_IFACES);
1052
1053 entries = CLASSED_NODE_IFACES_ENTRIES (node);
1054 for (i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
1055 if (entries[i].iface_type == iface_type)
1056 {
1057 /* this can (should) only happen if our parent type already conformed
1058 * to iface_type and node got it's own holder info. here, our
1059 * children should already have entries with NULL vtables, so
1060 * we're actually done.
1061 */
1062 g_assert (entries[i].vtable == NULL);
1063 return;
1064 }
1065 else if (entries[i].iface_type > iface_type)
1066 break;
1067 CLASSED_NODE_N_IFACES (node) += 1;
1068 CLASSED_NODE_IFACES_ENTRIES (node) = g_renew (IFaceEntry,
1069 CLASSED_NODE_IFACES_ENTRIES (node),
1070 CLASSED_NODE_N_IFACES (node));
1071 entries = CLASSED_NODE_IFACES_ENTRIES (node);
1072 g_memmove (entries + i + 1, entries + i, sizeof (entries[0]) * (CLASSED_NODE_N_IFACES (node) - i - 1));
1073 entries[i].iface_type = iface_type;
1074 entries[i].vtable = NULL;
1075
1076 for (i = 0; i < node->n_children; i++)
1077 type_node_add_iface_entry_W (lookup_type_node_I (node->children[i]), iface_type);
1078 }
1079
1080 static void
1081 type_add_interface_W (TypeNode *node,
1082 TypeNode *iface,
1083 const GInterfaceInfo *info,
1084 GTypePlugin *plugin)
1085 {
1086 IFaceHolder *iholder = g_new0 (IFaceHolder, 1);
1087
1088 /* we must not call any functions of GInterfaceInfo from within here, since
1089 * we got most probably called from _within_ a type registration function
1090 */
1091 g_assert (node->is_instantiatable && NODE_IS_IFACE (iface) && ((info && !plugin) || (!info && plugin)));
1092
1093 iholder->next = iface_node_get_holders_L (iface);
1094 iface_node_set_holders_W (iface, iholder);
1095 iholder->instance_type = NODE_TYPE (node);
1096 iholder->info = info ? g_memdup (info, sizeof (*info)) : NULL;
1097 iholder->plugin = plugin;
1098
1099 type_node_add_iface_entry_W (node, NODE_TYPE (iface));
1100 }
1101
1102 static void
1103 type_iface_add_prerequisite_W (TypeNode *iface,
1104 TypeNode *prerequisite_node)
1105 {
1106 GType prerequisite_type = NODE_TYPE (prerequisite_node);
1107 GType *prerequisites, *dependants;
1108 guint n_dependants, i;
1109
1110 g_assert (NODE_IS_IFACE (iface) &&
1111 IFACE_NODE_N_PREREQUISITES (iface) < MAX_N_PREREQUISITES &&
1112 (prerequisite_node->is_instantiatable || NODE_IS_IFACE (prerequisite_node)));
1113
1114 prerequisites = IFACE_NODE_PREREQUISITES (iface);
1115 for (i = 0; i < IFACE_NODE_N_PREREQUISITES (iface); i++)
1116 if (prerequisites[i] == prerequisite_type)
1117 return; /* we already have that prerequisiste */
1118 else if (prerequisites[i] > prerequisite_type)
1119 break;
1120 IFACE_NODE_N_PREREQUISITES (iface) += 1;
1121 IFACE_NODE_PREREQUISITES (iface) = g_renew (GType,
1122 IFACE_NODE_PREREQUISITES (iface),
1123 IFACE_NODE_N_PREREQUISITES (iface));
1124 prerequisites = IFACE_NODE_PREREQUISITES (iface);
1125 g_memmove (prerequisites + i + 1, prerequisites + i,
1126 sizeof (prerequisites[0]) * (IFACE_NODE_N_PREREQUISITES (iface) - i - 1));
1127 prerequisites[i] = prerequisite_type;
1128
1129 /* we want to get notified when prerequisites get added to prerequisite_node */
1130 if (NODE_IS_IFACE (prerequisite_node))
1131 {
1132 dependants = iface_node_get_dependants_array_L (prerequisite_node);
1133 n_dependants = dependants ? dependants[0] : 0;
1134 n_dependants += 1;
1135 dependants = g_renew (GType, dependants, n_dependants + 1);
1136 dependants[n_dependants] = NODE_TYPE (iface);
1137 dependants[0] = n_dependants;
1138 iface_node_set_dependants_array_W (prerequisite_node, dependants);
1139 }
1140
1141 /* we need to notify all dependants */
1142 dependants = iface_node_get_dependants_array_L (iface);
1143 n_dependants = dependants ? dependants[0] : 0;
1144 for (i = 1; i <= n_dependants; i++)
1145 type_iface_add_prerequisite_W (lookup_type_node_I (dependants[i]), prerequisite_node);
1146 }
1147
1148 void
1149 g_type_interface_add_prerequisite (GType interface_type,
1150 GType prerequisite_type)
1151 {
1152 TypeNode *iface, *prerequisite_node;
1153 IFaceHolder *holders;
1154
1155 g_return_if_fail (G_TYPE_IS_INTERFACE (interface_type)); /* G_TYPE_IS_INTERFACE() is an external call: _U */
1156 g_return_if_fail (!g_type_is_a (interface_type, prerequisite_type));
1157 g_return_if_fail (!g_type_is_a (prerequisite_type, interface_type));
1158
1159 iface = lookup_type_node_I (interface_type);
1160 prerequisite_node = lookup_type_node_I (prerequisite_type);
1161 if (!iface || !prerequisite_node || !NODE_IS_IFACE (iface))
1162 {
1163 g_warning ("interface type `%s' or prerequisite type `%s' invalid",
1164 type_descriptive_name_I (interface_type),
1165 type_descriptive_name_I (prerequisite_type));
1166 return;
1167 }
1168 G_WRITE_LOCK (&type_rw_lock);
1169 holders = iface_node_get_holders_L (iface);
1170 if (holders)
1171 {
1172 G_WRITE_UNLOCK (&type_rw_lock);
1173 g_warning ("unable to add prerequisite `%s' to interface `%s' which is already in use for `%s'",
1174 type_descriptive_name_I (prerequisite_type),
1175 type_descriptive_name_I (interface_type),
1176 type_descriptive_name_I (holders->instance_type));
1177 return;
1178 }
1179 if (prerequisite_node->is_instantiatable)
1180 {
1181 guint i;
1182
1183 /* can have at most one publically installable instantiatable prerequisite */
1184 for (i = 0; i < IFACE_NODE_N_PREREQUISITES (iface); i++)
1185 {
1186 TypeNode *prnode = lookup_type_node_I (IFACE_NODE_PREREQUISITES (iface)[i]);
1187
1188 if (prnode->is_instantiatable)
1189 {
1190 G_WRITE_UNLOCK (&type_rw_lock);
1191 g_warning ("adding prerequisite `%s' to interface `%s' conflicts with existing prerequisite `%s'",
1192 type_descriptive_name_I (prerequisite_type),
1193 type_descriptive_name_I (interface_type),
1194 type_descriptive_name_I (NODE_TYPE (prnode)));
1195 return;
1196 }
1197 }
1198
1199 for (i = 0; i < prerequisite_node->n_supers + 1; i++)
1200 type_iface_add_prerequisite_W (iface, lookup_type_node_I (prerequisite_node->supers[i]));
1201 G_WRITE_UNLOCK (&type_rw_lock);
1202 }
1203 else if (NODE_IS_IFACE (prerequisite_node))
1204 {
1205 GType *dependants;
1206 guint n_dependants, i;
1207
1208 dependants = iface_node_get_dependants_array_L (prerequisite_node);
1209 n_dependants = dependants ? dependants[0] : 0;
1210 for (i = 1; i <= n_dependants; i++)
1211 type_iface_add_prerequisite_W (iface, lookup_type_node_I (dependants[i]));
1212 type_iface_add_prerequisite_W (iface, prerequisite_node);
1213 G_WRITE_UNLOCK (&type_rw_lock);
1214 }
1215 else
1216 {
1217 G_WRITE_UNLOCK (&type_rw_lock);
1218 g_warning ("prerequisite `%s' for interface `%s' is neither instantiatable nor interface",
1219 type_descriptive_name_I (prerequisite_type),
1220 type_descriptive_name_I (interface_type));
1221 }
1222 }
1223
1224 static IFaceHolder*
1225 type_iface_peek_holder_L (TypeNode *iface,
1226 GType instance_type)
1227 {
1228 IFaceHolder *iholder;
1229
1230 g_assert (NODE_IS_IFACE (iface));
1231
1232 iholder = iface_node_get_holders_L (iface);
1233 while (iholder && iholder->instance_type != instance_type)
1234 iholder = iholder->next;
1235 return iholder;
1236 }
1237
1238 static IFaceHolder*
1239 type_iface_retrieve_holder_info_Wm (TypeNode *iface,
1240 GType instance_type,
1241 gboolean need_info)
1242 {
1243 IFaceHolder *iholder = type_iface_peek_holder_L (iface, instance_type);
1244
1245 if (iholder && !iholder->info && need_info)
1246 {
1247 GInterfaceInfo tmp_info;
1248
1249 g_assert (iholder->plugin != NULL);
1250
1251 type_data_ref_Wm (iface);
1252 if (iholder->info)
1253 INVALID_RECURSION ("g_type_plugin_*", iface->plugin, NODE_NAME (iface));
1254
1255 memset (&tmp_info, 0, sizeof (tmp_info));
1256
1257 G_WRITE_UNLOCK (&type_rw_lock);
1258 g_type_plugin_use (iholder->plugin);
1259 g_type_plugin_complete_interface_info (iholder->plugin, instance_type, NODE_TYPE (iface), &tmp_info);
1260 G_WRITE_LOCK (&type_rw_lock);
1261 if (iholder->info)
1262 INVALID_RECURSION ("g_type_plugin_*", iholder->plugin, NODE_NAME (iface));
1263
1264 check_interface_info_I (iface, instance_type, &tmp_info);
1265 iholder->info = g_memdup (&tmp_info, sizeof (tmp_info));
1266 }
1267
1268 return iholder; /* we don't modify write lock upon returning NULL */
1269 }
1270
1271 static void
1272 type_iface_blow_holder_info_Wm (TypeNode *iface,
1273 GType instance_type)
1274 {
1275 IFaceHolder *iholder = iface_node_get_holders_L (iface);
1276
1277 g_assert (NODE_IS_IFACE (iface));
1278
1279 while (iholder->instance_type != instance_type)
1280 iholder = iholder->next;
1281
1282 if (iholder->info && iholder->plugin)
1283 {
1284 g_free (iholder->info);
1285 iholder->info = NULL;
1286
1287 G_WRITE_UNLOCK (&type_rw_lock);
1288 g_type_plugin_unuse (iholder->plugin);
1289 G_WRITE_LOCK (&type_rw_lock);
1290
1291 type_data_unref_Wm (iface, FALSE);
1292 }
1293 }
1294
1295
1296 /* --- type structure creation/destruction --- */
1297 GTypeInstance*
1298 g_type_create_instance (GType type)
1299 {
1300 TypeNode *node;
1301 GTypeInstance *instance;
1302 GTypeClass *class;
1303 guint i;
1304
1305 node = lookup_type_node_I (type);
1306 if (!node || !node->is_instantiatable)
1307 {
1308 g_warning ("cannot create new instance of invalid (non-instantiatable) type `%s'",
1309 type_descriptive_name_I (type));
1310 return NULL;
1311 }
1312 /* G_TYPE_IS_ABSTRACT() is an external call: _U */
1313 if (!node->mutatable_check_cache && G_TYPE_IS_ABSTRACT (type))
1314 {
1315 g_warning ("cannot create instance of abstract (non-instantiatable) type `%s'",
1316 type_descriptive_name_I (type));
1317 return NULL;
1318 }
1319
1320 class = g_type_class_ref (type);
1321
1322 if (node->data->instance.n_preallocs)
1323 {
1324 G_WRITE_LOCK (&type_rw_lock);
1325 if (!node->data->instance.mem_chunk)
1326 node->data->instance.mem_chunk = g_mem_chunk_new (NODE_NAME (node),
1327 node->data->instance.instance_size,
1328 (node->data->instance.instance_size *
1329 node->data->instance.n_preallocs),
1330 G_ALLOC_AND_FREE);
1331 instance = g_chunk_new0 (GTypeInstance, node->data->instance.mem_chunk);
1332 G_WRITE_UNLOCK (&type_rw_lock);
1333 }
1334 else
1335 instance = g_malloc0 (node->data->instance.instance_size); /* fine without read lock */
1336 for (i = node->n_supers; i > 0; i--)
1337 {
1338 TypeNode *pnode;
1339
1340 pnode = lookup_type_node_I (node->supers[i]);
1341 if (pnode->data->instance.instance_init)
1342 {
1343 instance->g_class = pnode->data->instance.class;
1344 pnode->data->instance.instance_init (instance, class);
1345 }
1346 }
1347 instance->g_class = class;
1348
1349 if (node->data->instance.instance_init)
1350 node->data->instance.instance_init (instance, class);
1351
1352 return instance;
1353 }
1354
1355 void
1356 g_type_free_instance (GTypeInstance *instance)
1357 {
1358 TypeNode *node;
1359 GTypeClass *class;
1360
1361 g_return_if_fail (instance != NULL && instance->g_class != NULL);
1362
1363 class = instance->g_class;
1364 node = lookup_type_node_I (class->g_type);
1365 if (!node || !node->is_instantiatable || !node->data || node->data->class.class != (gpointer) class)
1366 {
1367 g_warning ("cannot free instance of invalid (non-instantiatable) type `%s'",
1368 type_descriptive_name_I (class->g_type));
1369 return;
1370 }
1371 /* G_TYPE_IS_ABSTRACT() is an external call: _U */
1372 if (!node->mutatable_check_cache && G_TYPE_IS_ABSTRACT (NODE_TYPE (node)))
1373 {
1374 g_warning ("cannot free instance of abstract (non-instantiatable) type `%s'",
1375 NODE_NAME (node));
1376 return;
1377 }
1378
1379 instance->g_class = NULL;
1380 #ifdef G_ENABLE_DEBUG
1381 memset (instance, 0xaa, node->data->instance.instance_size); /* debugging hack */
1382 #endif
1383 if (node->data->instance.n_preallocs)
1384 {
1385 G_WRITE_LOCK (&type_rw_lock);
1386 g_chunk_free (instance, node->data->instance.mem_chunk);
1387 G_WRITE_UNLOCK (&type_rw_lock);
1388 }
1389 else
1390 g_free (instance);
1391
1392 g_type_class_unref (class);
1393 }
1394
1395 static gboolean
1396 type_iface_vtable_init_Wm (TypeNode *iface,
1397 TypeNode *node)
1398 {
1399 IFaceEntry *entry = type_lookup_iface_entry_L (node, iface);
1400 IFaceHolder *iholder;
1401 GTypeInterface *vtable = NULL;
1402 TypeNode *pnode;
1403
1404 /* type_iface_retrieve_holder_info_Wm() doesn't modify write lock for returning NULL */
1405 iholder = type_iface_retrieve_holder_info_Wm (iface, NODE_TYPE (node), TRUE);
1406 if (!iholder)
1407 return FALSE; /* we don't modify write lock upon FALSE */
1408
1409 g_assert (iface->data && entry && entry->vtable == NULL && iholder && iholder->info);
1410
1411 pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
1412 if (pnode) /* want to copy over parent iface contents */
1413 {
1414 IFaceEntry *pentry = type_lookup_iface_entry_L (pnode, iface);
1415
1416 if (pentry)
1417 vtable = g_memdup (pentry->vtable, iface->data->iface.vtable_size);
1418 }
1419 if (!vtable)
1420 vtable = g_malloc0 (iface->data->iface.vtable_size);
1421 entry->vtable = vtable;
1422 vtable->g_type = NODE_TYPE (iface);
1423 vtable->g_instance_type = NODE_TYPE (node);
1424
1425 if (iface->data->iface.vtable_init_base || iholder->info->interface_init)
1426 {
1427 G_WRITE_UNLOCK (&type_rw_lock);
1428 if (iface->data->iface.vtable_init_base)
1429 iface->data->iface.vtable_init_base (vtable);
1430 if (iholder->info->interface_init)
1431 iholder->info->interface_init (vtable, iholder->info->interface_data);
1432 G_WRITE_LOCK (&type_rw_lock);
1433 }
1434 return TRUE; /* write lock modified */
1435 }
1436
1437 static gboolean
1438 type_iface_vtable_finalize_Wm (TypeNode *iface,
1439 TypeNode *node,
1440 GTypeInterface *vtable)
1441 {
1442 IFaceEntry *entry = type_lookup_iface_entry_L (node, iface);
1443 IFaceHolder *iholder;
1444
1445 /* type_iface_retrieve_holder_info_Wm() doesn't modify write lock for returning NULL */
1446 iholder = type_iface_retrieve_holder_info_Wm (iface, NODE_TYPE (node), FALSE);
1447 if (!iholder)
1448 return FALSE; /* we don't modify write lock upon FALSE */
1449
1450 g_assert (entry && entry->vtable == vtable && iholder->info);
1451
1452 entry->vtable = NULL;
1453 if (iholder->info->interface_finalize || iface->data->iface.vtable_finalize_base)
1454 {
1455 G_WRITE_UNLOCK (&type_rw_lock);
1456 if (iholder->info->interface_finalize)
1457 iholder->info->interface_finalize (vtable, iholder->info->interface_data);
1458 if (iface->data->iface.vtable_finalize_base)
1459 iface->data->iface.vtable_finalize_base (vtable);
1460 G_WRITE_LOCK (&type_rw_lock);
1461 }
1462 vtable->g_type = 0;
1463 vtable->g_instance_type = 0;
1464 g_free (vtable);
1465
1466 type_iface_blow_holder_info_Wm (iface, NODE_TYPE (node));
1467
1468 return TRUE; /* write lock modified */
1469 }
1470
1471 static void
1472 type_class_init_Wm (TypeNode *node,
1473 GTypeClass *pclass)
1474 {
1475 GSList *slist, *init_slist = NULL;
1476 GTypeClass *class;
1477 IFaceEntry *entry;
1478 TypeNode *bnode, *pnode;
1479 guint i;
1480
1481 g_assert (node->is_classed && node->data &&
1482 node->data->class.class_size &&
1483 !node->data->class.class);
1484
1485 class = g_malloc0 (node->data->class.class_size);
1486 node->data->class.class = class;
1487
1488 if (pclass)
1489 {
1490 TypeNode *pnode = lookup_type_node_I (pclass->g_type);
1491
1492 memcpy (class, pclass, pnode->data->class.class_size);
1493 }
1494 class->g_type = NODE_TYPE (node);
1495
1496 G_WRITE_UNLOCK (&type_rw_lock);
1497
1498 /* stack all base class initialization functions, so we
1499 * call them in ascending order.
1500 */
1501 for (bnode = node; bnode; bnode = lookup_type_node_I (NODE_PARENT_TYPE (bnode)))
1502 if (bnode->data->class.class_init_base)
1503 init_slist = g_slist_prepend (init_slist, (gpointer) bnode->data->class.class_init_base);
1504 for (slist = init_slist; slist; slist = slist->next)
1505 {
1506 GBaseInitFunc class_init_base = (GBaseInitFunc) slist->data;
1507
1508 class_init_base (class);
1509 }
1510 g_slist_free (init_slist);
1511
1512 if (node->data->class.class_init)
1513 node->data->class.class_init (class, (gpointer) node->data->class.class_data);
1514
1515 G_WRITE_LOCK (&type_rw_lock);
1516
1517 /* ok, we got the class done, now initialize all interfaces, either
1518 * from parent, or through our holder info
1519 */
1520 pnode = lookup_type_node_I (NODE_PARENT_TYPE (node));
1521 entry = CLASSED_NODE_IFACES_ENTRIES (node) + 0;
1522 while (entry)
1523 {
1524 g_assert (entry->vtable == NULL);
1525
1526 if (!type_iface_vtable_init_Wm (lookup_type_node_I (entry->iface_type), node))
1527 {
1528 guint j;
1529
1530 /* type_iface_vtable_init_Wm() doesn't modify write lock upon FALSE,
1531 * need to get this interface from parent
1532 */
1533 g_assert (pnode != NULL);
1534
1535 for (j = 0; j < CLASSED_NODE_N_IFACES (pnode); j++)
1536 {
1537 IFaceEntry *pentry = CLASSED_NODE_IFACES_ENTRIES (pnode) + j;
1538
1539 if (pentry->iface_type == entry->iface_type)
1540 {
1541 entry->vtable = pentry->vtable;
1542 break;
1543 }
1544 }
1545 g_assert (entry->vtable != NULL);
1546 }
1547
1548 /* refetch entry, IFACES_ENTRIES might be modified */
1549 for (entry = NULL, i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
1550 if (!CLASSED_NODE_IFACES_ENTRIES (node)[i].vtable)
1551 entry = CLASSED_NODE_IFACES_ENTRIES (node) + i;
1552 }
1553 }
1554
1555 static void
1556 type_data_finalize_class_ifaces_Wm (TypeNode *node)
1557 {
1558 IFaceEntry *entry;
1559 guint i;
1560
1561 g_assert (node->is_instantiatable && node->data && node->data->class.class && node->data->common.ref_count == 0);
1562
1563 g_message ("finalizing interfaces for %sClass `%s'",
1564 type_descriptive_name_I (NODE_FUNDAMENTAL_TYPE (node)),
1565 type_descriptive_name_I (NODE_TYPE (node)));
1566
1567 for (entry = NULL, i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
1568 if (CLASSED_NODE_IFACES_ENTRIES (node)[i].vtable &&
1569 CLASSED_NODE_IFACES_ENTRIES (node)[i].vtable->g_instance_type == NODE_TYPE (node))
1570 entry = CLASSED_NODE_IFACES_ENTRIES (node) + i;
1571 while (entry)
1572 {
1573 if (!type_iface_vtable_finalize_Wm (lookup_type_node_I (entry->iface_type), node, entry->vtable))
1574 {
1575 /* type_iface_vtable_finalize_Wm() doesn't modify write lock upon FALSE,
1576 * iface vtable came from parent
1577 */
1578 entry->vtable = NULL;
1579 }
1580
1581 /* refetch entry, IFACES_ENTRIES might be modified */
1582 for (entry = NULL, i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
1583 if (CLASSED_NODE_IFACES_ENTRIES (node)[i].vtable &&
1584 CLASSED_NODE_IFACES_ENTRIES (node)[i].vtable->g_instance_type == NODE_TYPE (node))
1585 entry = CLASSED_NODE_IFACES_ENTRIES (node) + i;
1586 }
1587 }
1588
1589 static void
1590 type_data_finalize_class_U (TypeNode *node,
1591 ClassData *cdata)
1592 {
1593 GTypeClass *class = cdata->class;
1594 TypeNode *bnode;
1595
1596 g_assert (cdata->class && cdata->common.ref_count == 0);
1597
1598 if (cdata->class_finalize)
1599 cdata->class_finalize (class, (gpointer) cdata->class_data);
1600
1601 /* call all base class destruction functions in descending order
1602 */
1603 if (cdata->class_finalize_base)
1604 cdata->class_finalize_base (class);
1605 for (bnode = lookup_type_node_I (NODE_PARENT_TYPE (node)); bnode; bnode = lookup_type_node_I (NODE_PARENT_TYPE (bnode)))
1606 if (bnode->data->class.class_finalize_base)
1607 bnode->data->class.class_finalize_base (class);
1608
1609 class->g_type = 0;
1610 g_free (cdata->class);
1611 }
1612
1613 static void
1614 type_data_last_unref_Wm (GType type,
1615 gboolean uncached)
1616 {
1617 TypeNode *node = lookup_type_node_I (type);
1618
1619 g_return_if_fail (node != NULL && node->plugin != NULL);
1620
1621 if (!node->data || node->data->common.ref_count == 0)
1622 {
1623 g_warning ("cannot drop last reference to unreferenced type `%s'",
1624 type_descriptive_name_I (type));
1625 return;
1626 }
1627
1628 if (node->is_classed && node->data && node->data->class.class && static_n_class_cache_funcs)
1629 {
1630 guint i;
1631
1632 G_WRITE_UNLOCK (&type_rw_lock);
1633 G_READ_LOCK (&type_rw_lock);
1634 for (i = 0; i < static_n_class_cache_funcs; i++)
1635 {
1636 GTypeClassCacheFunc cache_func = static_class_cache_funcs[i].cache_func;
1637 gpointer cache_data = static_class_cache_funcs[i].cache_data;
1638 gboolean need_break;
1639
1640 G_READ_UNLOCK (&type_rw_lock);
1641 need_break = cache_func (cache_data, node->data->class.class);
1642 G_READ_LOCK (&type_rw_lock);
1643 if (!node->data || node->data->common.ref_count == 0)
1644 INVALID_RECURSION ("GType class cache function ", cache_func, NODE_NAME (node));
1645 if (need_break)
1646 break;
1647 }
1648 G_READ_UNLOCK (&type_rw_lock);
1649 G_WRITE_LOCK (&type_rw_lock);
1650 }
1651
1652 if (node->data->common.ref_count > 1) /* may have been re-referenced meanwhile */
1653 node->data->common.ref_count -= 1;
1654 else
1655 {
1656 GType ptype = NODE_PARENT_TYPE (node);
1657 TypeData *tdata;
1658
1659 node->data->common.ref_count = 0;
1660
1661 if (node->is_instantiatable && node->data->instance.mem_chunk)
1662 {
1663 g_mem_chunk_destroy (node->data->instance.mem_chunk);
1664 node->data->instance.mem_chunk = NULL;
1665 }
1666
1667 tdata = node->data;
1668 if (node->is_classed && tdata->class.class)
1669 {
1670 if (CLASSED_NODE_N_IFACES (node))
1671 type_data_finalize_class_ifaces_Wm (node);
1672 node->mutatable_check_cache = FALSE;
1673 node->data = NULL;
1674 G_WRITE_UNLOCK (&type_rw_lock);
1675 type_data_finalize_class_U (node, &tdata->class);
1676 G_WRITE_LOCK (&type_rw_lock);
1677 }
1678 else
1679 {
1680 node->mutatable_check_cache = FALSE;
1681 node->data = NULL;
1682 }
1683
1684 /* freeing tdata->common.value_table and its contents is taking care of
1685 * by allocating it in one chunk with tdata
1686 */
1687 g_free (tdata);
1688
1689 if (ptype)
1690 type_data_unref_Wm (lookup_type_node_I (ptype), FALSE);
1691 G_WRITE_UNLOCK (&type_rw_lock);
1692 g_type_plugin_unuse (node->plugin);
1693 G_WRITE_LOCK (&type_rw_lock);
1694 }
1695 }
1696
1697 void
1698 g_type_add_class_cache_func (gpointer cache_data,
1699 GTypeClassCacheFunc cache_func)
1700 {
1701 guint i;
1702
1703 g_return_if_fail (cache_func != NULL);
1704
1705 G_WRITE_LOCK (&type_rw_lock);
1706 i = static_n_class_cache_funcs++;
1707 static_class_cache_funcs = g_renew (ClassCacheFunc, static_class_cache_funcs, static_n_class_cache_funcs);
1708 static_class_cache_funcs[i].cache_data = cache_data;
1709 static_class_cache_funcs[i].cache_func = cache_func;
1710 G_WRITE_UNLOCK (&type_rw_lock);
1711 }
1712
1713 void
1714 g_type_remove_class_cache_func (gpointer cache_data,
1715 GTypeClassCacheFunc cache_func)
1716 {
1717 gboolean found_it = FALSE;
1718 guint i;
1719
1720 g_return_if_fail (cache_func != NULL);
1721
1722 G_WRITE_LOCK (&type_rw_lock);
1723 for (i = 0; i < static_n_class_cache_funcs; i++)
1724 if (static_class_cache_funcs[i].cache_data == cache_data &&
1725 static_class_cache_funcs[i].cache_func == cache_func)
1726 {
1727 static_n_class_cache_funcs--;
1728 g_memmove (static_class_cache_funcs + i,
1729 static_class_cache_funcs + i + 1,
1730 sizeof (static_class_cache_funcs[0]) * (static_n_class_cache_funcs - i));
1731 static_class_cache_funcs = g_renew (ClassCacheFunc, static_class_cache_funcs, static_n_class_cache_funcs);
1732 found_it = TRUE;
1733 break;
1734 }
1735 G_WRITE_UNLOCK (&type_rw_lock);
1736
1737 if (!found_it)
1738 g_warning (G_STRLOC ": cannot remove unregistered class cache func %p with data %p",
1739 cache_func, cache_data);
1740 }
1741
1742
1743 /* --- type registration --- */
1744 GType
1745 g_type_register_fundamental (GType type_id,
1746 const gchar *type_name,
1747 const GTypeInfo *info,
1748 const GTypeFundamentalInfo *finfo,
1749 GTypeFlags flags)
1750 {
1751 GTypeFundamentalInfo *node_finfo;
1752 TypeNode *node;
1753
1754 g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, 0);
1755 g_return_val_if_fail (type_id > 0, 0);
1756 g_return_val_if_fail (type_name != NULL, 0);
1757 g_return_val_if_fail (info != NULL, 0);
1758 g_return_val_if_fail (finfo != NULL, 0);
1759
1760 if (!check_type_name_I (type_name))
1761 return 0;
1762 if ((type_id & TYPE_ID_MASK) ||
1763 type_id > G_TYPE_FUNDAMENTAL_MAX)
1764 {
1765 g_warning ("attempt to register fundamental type `%s' with invalid type id (%lu)",
1766 type_name,
1767 type_id);
1768 return 0;
1769 }
1770 if ((finfo->type_flags & G_TYPE_FLAG_INSTANTIATABLE) &&
1771 !(finfo->type_flags & G_TYPE_FLAG_CLASSED))
1772 {
1773 g_warning ("cannot register instantiatable fundamental type `%s' as non-classed",
1774 type_name);
1775 return 0;
1776 }
1777 if (lookup_type_node_I (type_id))
1778 {
1779 g_warning ("cannot register existing fundamental type `%s' (as `%s')",
1780 type_descriptive_name_I (type_id),
1781 type_name);
1782 return 0;
1783 }
1784
1785 G_WRITE_LOCK (&type_rw_lock);
1786 node = type_node_fundamental_new_W (type_id, type_name, finfo->type_flags);
1787 node_finfo = type_node_fundamental_info_I (node);
1788 type_add_flags_W (node, flags);
1789
1790 if (check_type_info_I (NULL, NODE_FUNDAMENTAL_TYPE (node), type_name, info))
1791 type_data_make_W (node, info,
1792 check_value_table_I (type_name, info->value_table) ? info->value_table : NULL);
1793 G_WRITE_UNLOCK (&type_rw_lock);
1794
1795 return NODE_TYPE (node);
1796 }
1797
1798 GType
1799 g_type_register_static (GType parent_type,
1800 const gchar *type_name,
1801 const GTypeInfo *info,
1802 GTypeFlags flags)
1803 {
1804 TypeNode *pnode, *node;
1805 GType type = 0;
1806
1807 g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, 0);
1808 g_return_val_if_fail (parent_type > 0, 0);
1809 g_return_val_if_fail (type_name != NULL, 0);
1810 g_return_val_if_fail (info != NULL, 0);
1811
1812 if (!check_type_name_I (type_name) ||
1813 !check_derivation_I (parent_type, type_name))
1814 return 0;
1815 if (info->class_finalize)
1816 {
1817 g_warning ("class finalizer specified for static type `%s'",
1818 type_name);
1819 return 0;
1820 }
1821
1822 pnode = lookup_type_node_I (parent_type);
1823 G_WRITE_LOCK (&type_rw_lock);
1824 type_data_ref_Wm (pnode);
1825 if (check_type_info_I (pnode, NODE_FUNDAMENTAL_TYPE (pnode), type_name, info))
1826 {
1827 node = type_node_new_W (pnode, type_name, NULL);
1828 type_add_flags_W (node, flags);
1829 type = NODE_TYPE (node);
1830 type_data_make_W (node, info,
1831 check_value_table_I (type_name, info->value_table) ? info->value_table : NULL);
1832 }
1833 G_WRITE_UNLOCK (&type_rw_lock);
1834
1835 return type;
1836 }
1837
1838 GType
1839 g_type_register_dynamic (GType parent_type,
1840 const gchar *type_name,
1841 GTypePlugin *plugin,
1842 GTypeFlags flags)
1843 {
1844 TypeNode *pnode, *node;
1845 GType type;
1846
1847 g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, 0);
1848 g_return_val_if_fail (parent_type > 0, 0);
1849 g_return_val_if_fail (type_name != NULL, 0);
1850 g_return_val_if_fail (plugin != NULL, 0);
1851
1852 if (!check_type_name_I (type_name) ||
1853 !check_derivation_I (parent_type, type_name) ||
1854 !check_plugin_U (plugin, TRUE, FALSE, type_name))
1855 return 0;
1856
1857 G_WRITE_LOCK (&type_rw_lock);
1858 pnode = lookup_type_node_I (parent_type);
1859 node = type_node_new_W (pnode, type_name, plugin);
1860 type_add_flags_W (node, flags);
1861 type = NODE_TYPE (node);
1862 G_WRITE_UNLOCK (&type_rw_lock);
1863
1864 return type;
1865 }
1866
1867 void
1868 g_type_add_interface_static (GType instance_type,
1869 GType interface_type,
1870 const GInterfaceInfo *info)
1871 {
1872 /* G_TYPE_IS_INSTANTIATABLE() is an external call: _U */
1873 g_return_if_fail (G_TYPE_IS_INSTANTIATABLE (instance_type));
1874 g_return_if_fail (g_type_parent (interface_type) == G_TYPE_INTERFACE);
1875
1876 G_WRITE_LOCK (&type_rw_lock);
1877 if (check_add_interface_L (instance_type, interface_type))
1878 {
1879 TypeNode *node = lookup_type_node_I (instance_type);
1880 TypeNode *iface = lookup_type_node_I (interface_type);
1881
1882 if (check_interface_info_I (iface, NODE_TYPE (node), info))
1883 {
1884 type_add_interface_W (node, iface, info, NULL);
1885 /* if we have a class already, the interface vtable needs to
1886 * be initialized as well
1887 */
1888 if (node->data && node->data->class.class)
1889 type_iface_vtable_init_Wm (iface, node);
1890 }
1891 }
1892 G_WRITE_UNLOCK (&type_rw_lock);
1893 }
1894
1895 void
1896 g_type_add_interface_dynamic (GType instance_type,
1897 GType interface_type,
1898 GTypePlugin *plugin)
1899 {
1900 TypeNode *node;
1901
1902 /* G_TYPE_IS_INSTANTIATABLE() is an external call: _U */
1903 g_return_if_fail (G_TYPE_IS_INSTANTIATABLE (instance_type));
1904 g_return_if_fail (g_type_parent (interface_type) == G_TYPE_INTERFACE);
1905
1906 node = lookup_type_node_I (instance_type);
1907 if (!check_plugin_U (plugin, FALSE, TRUE, NODE_NAME (node)))
1908 return;
1909
1910 G_WRITE_LOCK (&type_rw_lock);
1911 if (check_add_interface_L (instance_type, interface_type))
1912 {
1913 TypeNode *iface = lookup_type_node_I (interface_type);
1914
1915 type_add_interface_W (node, iface, NULL, plugin);
1916 /* if we have a class already, the interface vtable needs to
1917 * be initialized as well
1918 */
1919 if (node->data && node->data->class.class)
1920 type_iface_vtable_init_Wm (iface, node);
1921 }
1922 G_WRITE_UNLOCK (&type_rw_lock);
1923 }
1924
1925
1926 /* --- public API functions --- */
1927 gpointer
1928 g_type_class_ref (GType type)
1929 {
1930 TypeNode *node;
1931
1932 /* optimize for common code path
1933 */
1934 G_WRITE_LOCK (&type_rw_lock);
1935 node = lookup_type_node_I (type);
1936 if (node && node->is_classed && node->data &&
1937 node->data->class.class && node->data->common.ref_count > 0)
1938 {
1939 type_data_ref_Wm (node);
1940 G_WRITE_UNLOCK (&type_rw_lock);
1941
1942 return node->data->class.class;
1943 }
1944
1945 if (!node || !node->is_classed ||
1946 (node->data && node->data->common.ref_count < 1))
1947 {
1948 G_WRITE_UNLOCK (&type_rw_lock);
1949 g_warning ("cannot retrieve class for invalid (unclassed) type `%s'",
1950 type_descriptive_name_I (type));
1951 return NULL;
1952 }
1953
1954 type_data_ref_Wm (node);
1955
1956 if (!node->data->class.class)
1957 {
1958 GType ptype = NODE_PARENT_TYPE (node);
1959 GTypeClass *pclass = NULL;
1960
1961 if (ptype)
1962 {
1963 G_WRITE_UNLOCK (&type_rw_lock);
1964 pclass = g_type_class_ref (ptype);
1965 if (node->data->class.class)
1966 INVALID_RECURSION ("g_type_plugin_*", node->plugin, NODE_NAME (node));
1967 G_WRITE_LOCK (&type_rw_lock);
1968 }
1969
1970 type_class_init_Wm (node, pclass);
1971 }
1972 G_WRITE_UNLOCK (&type_rw_lock);
1973
1974 return node->data->class.class;
1975 }
1976
1977 void
1978 g_type_class_unref (gpointer g_class)
1979 {
1980 TypeNode *node;
1981 GTypeClass *class = g_class;
1982
1983 g_return_if_fail (g_class != NULL);
1984
1985 node = lookup_type_node_I (class->g_type);
1986 G_WRITE_LOCK (&type_rw_lock);
1987 if (node && node->is_classed && node->data &&
1988 node->data->class.class == class && node->data->common.ref_count > 0)
1989 type_data_unref_Wm (node, FALSE);
1990 else
1991 g_warning ("cannot unreference class of invalid (unclassed) type `%s'",
1992 type_descriptive_name_I (class->g_type));
1993 G_WRITE_UNLOCK (&type_rw_lock);
1994 }
1995
1996 void
1997 g_type_class_unref_uncached (gpointer g_class)
1998 {
1999 TypeNode *node;
2000 GTypeClass *class = g_class;
2001
2002 g_return_if_fail (g_class != NULL);
2003
2004 G_WRITE_LOCK (&type_rw_lock);
2005 node = lookup_type_node_I (class->g_type);
2006 if (node && node->is_classed && node->data &&
2007 node->data->class.class == class && node->data->common.ref_count > 0)
2008 type_data_unref_Wm (node, TRUE);
2009 else
2010 g_warning ("cannot unreference class of invalid (unclassed) type `%s'",
2011 type_descriptive_name_I (class->g_type));
2012 G_WRITE_UNLOCK (&type_rw_lock);
2013 }
2014
2015 gpointer
2016 g_type_class_peek (GType type)
2017 {
2018 TypeNode *node;
2019 gpointer class;
2020
2021 node = lookup_type_node_I (type);
2022 G_READ_LOCK (&type_rw_lock);
2023 if (node && node->is_classed && node->data && node->data->class.class) /* common.ref_count _may_ be 0 */
2024 class = node->data->class.class;
2025 else
2026 class = NULL;
2027 G_READ_UNLOCK (&type_rw_lock);
2028
2029 return class;
2030 }
2031
2032 gpointer
2033 g_type_class_peek_parent (gpointer g_class)
2034 {
2035 TypeNode *node;
2036 gpointer class = NULL;
2037
2038 g_return_val_if_fail (g_class != NULL, NULL);
2039
2040 node = lookup_type_node_I (G_TYPE_FROM_CLASS (g_class));
2041 G_READ_LOCK (&type_rw_lock);
2042 if (node && node->is_classed && node->data && NODE_PARENT_TYPE (node))
2043 {
2044 node = lookup_type_node_I (NODE_PARENT_TYPE (node));
2045 class = node->data->class.class;
2046 }
2047 else if (NODE_PARENT_TYPE (node))
2048 g_warning (G_STRLOC ": invalid class pointer `%p'", g_class);
2049 G_READ_UNLOCK (&type_rw_lock);
2050
2051 return class;
2052 }
2053
2054 gpointer
2055 g_type_interface_peek (gpointer instance_class,
2056 GType iface_type)
2057 {
2058 TypeNode *node;
2059 TypeNode *iface;
2060 gpointer vtable = NULL;
2061 GTypeClass *class = instance_class;
2062
2063 g_return_val_if_fail (instance_class != NULL, NULL);
2064
2065 node = lookup_type_node_I (class->g_type);
2066 iface = lookup_type_node_I (iface_type);
2067 if (node && node->is_instantiatable && iface)
2068 {
2069 IFaceEntry *entry;
2070
2071 G_READ_LOCK (&type_rw_lock);
2072
2073 entry = type_lookup_iface_entry_L (node, iface);
2074 if (entry && entry->vtable) /* entry is relocatable */
2075 vtable = entry->vtable;
2076
2077 G_READ_UNLOCK (&type_rw_lock);
2078 }
2079 else
2080 g_warning (G_STRLOC ": invalid class pointer `%p'", class);
2081
2082 return vtable;
2083 }
2084
2085 gpointer
2086 g_type_interface_peek_parent (gpointer g_iface)
2087 {
2088 TypeNode *node;
2089 TypeNode *iface;
2090 gpointer vtable = NULL;
2091 GTypeInterface *iface_class = g_iface;
2092
2093 g_return_val_if_fail (g_iface != NULL, NULL);
2094
2095 iface = lookup_type_node_I (iface_class->g_type);
2096 node = lookup_type_node_I (iface_class->g_instance_type);
2097 if (node)
2098 node = lookup_type_node_I (NODE_PARENT_TYPE (node));
2099 if (node && node->is_instantiatable && iface)
2100 {
2101 IFaceEntry *entry;
2102
2103 G_READ_LOCK (&type_rw_lock);
2104
2105 entry = type_lookup_iface_entry_L (node, iface);
2106 if (entry && entry->vtable) /* entry is relocatable */
2107 vtable = entry->vtable;
2108
2109 G_READ_UNLOCK (&type_rw_lock);
2110 }
2111 else if (node)
2112 g_warning (G_STRLOC ": invalid interface pointer `%p'", g_iface);
2113
2114 return vtable;
2115 }
2116
2117 G_CONST_RETURN gchar*
2118 g_type_name (GType type)
2119 {
2120 TypeNode *node;
2121
2122 g_return_val_if_uninitialized (static_quark_type_flags, g_type_init, NULL);
2123
2124 node = lookup_type_node_I (type);
2125
2126 return node ? NODE_NAME (node) : NULL;
2127 }
2128
2129 GQuark
2130 g_type_qname (GType type)
2131 {
2132 TypeNode *node;
2133
2134 node = lookup_type_node_I (type);
2135
2136 return node ? node->qname : 0;
2137 }
2138
2139 GType
2140 g_type_from_name (const gchar *name)
2141 {
2142 GType type = 0;
2143 GQuark quark;
2144
2145 g_return_val_if_fail (name != NULL, 0);
2146
2147 quark = g_quark_try_string (name);
2148 if (quark)
2149 {
2150 G_READ_LOCK (&type_rw_lock);
2151 type = (GType) g_hash_table_lookup (static_type_nodes_ht, GUINT_TO_POINTER (quark));
2152 G_READ_UNLOCK (&type_rw_lock);
2153 }
2154
2155 return type;
2156 }
2157
2158 GType
2159 g_type_parent (GType type)
2160 {
2161 TypeNode *node;
2162
2163 node = lookup_type_node_I (type);
2164
2165 return node ? NODE_PARENT_TYPE (node) : 0;
2166 }
2167
2168 guint
2169 g_type_depth (GType type)
2170 {
2171 TypeNode *node;
2172
2173 node = lookup_type_node_I (type);
2174
2175 return node ? node->n_supers + 1 : 0;
2176 }
2177
2178 GType
2179 g_type_next_base (GType type,
2180 GType base_type)
2181 {
2182 GType atype = 0;
2183 TypeNode *node;
2184
2185 node = lookup_type_node_I (type);
2186 if (node)
2187 {
2188 TypeNode *base_node = lookup_type_node_I (base_type);
2189
2190 if (base_node && base_node->n_supers < node->n_supers)
2191 {
2192 guint n = node->n_supers - base_node->n_supers;
2193
2194 if (node->supers[n] == base_type)
2195 atype = node->supers[n - 1];
2196 }
2197 }
2198
2199 return atype;
2200 }
2201
2202 static inline gboolean
2203 type_node_check_conformities_UorL (TypeNode *node,
2204 TypeNode *iface_node,
2205 /* support_inheritance */
2206 gboolean support_interfaces,
2207 gboolean support_prerequisites,
2208 gboolean have_lock)
2209 {
2210 gboolean match;
2211
2212 if (/* support_inheritance && */
2213 iface_node->n_supers <= node->n_supers &&
2214 node->supers[node->n_supers - iface_node->n_supers] == NODE_TYPE (iface_node))
2215 return TRUE;
2216
2217 support_interfaces = support_interfaces && node->is_instantiatable && NODE_IS_IFACE (iface_node);
2218 support_prerequisites = support_prerequisites && NODE_IS_IFACE (node);
2219 match = FALSE;
2220 if (support_interfaces || support_prerequisites)
2221 {
2222 if (!have_lock)
2223 G_READ_LOCK (&type_rw_lock);
2224 if (support_interfaces && type_lookup_iface_entry_L (node, iface_node))
2225 match = TRUE;
2226 else if (support_prerequisites && type_lookup_prerequisite_L (node, NODE_TYPE (iface_node)))
2227 match = TRUE;
2228 if (!have_lock)
2229 G_READ_UNLOCK (&type_rw_lock);
2230 }
2231 return match;
2232 }
2233
2234 static gboolean
2235 type_node_is_a_L (TypeNode *node,
2236 TypeNode *iface_node)
2237 {
2238 return type_node_check_conformities_UorL (node, iface_node, TRUE, TRUE, TRUE);
2239 }
2240
2241 static inline gboolean
2242 type_node_conforms_to_U (TypeNode *node,
2243 TypeNode *iface_node,
2244 gboolean support_interfaces,
2245 gboolean support_prerequisites)
2246 {
2247 return type_node_check_conformities_UorL (node, iface_node, support_interfaces, support_prerequisites, FALSE);
2248 }
2249
2250 gboolean
2251 g_type_is_a (GType type,
2252 GType iface_type)
2253 {
2254 TypeNode *node, *iface_node;
2255 gboolean is_a;
2256
2257 node = lookup_type_node_I (type);
2258 iface_node = lookup_type_node_I (iface_type);
2259 is_a = node && iface_node && type_node_conforms_to_U (node, iface_node, TRUE, TRUE);
2260
2261 return is_a;
2262 }
2263
2264 GType* /* free result */
2265 g_type_children (GType type,
2266 guint *n_children)
2267 {
2268 TypeNode *node;
2269
2270 node = lookup_type_node_I (type);
2271 if (node)
2272 {
2273 GType *children;
2274
2275 G_READ_LOCK (&type_rw_lock); /* ->children is relocatable */
2276 children = g_new (GType, node->n_children + 1);
2277 memcpy (children, node->children, sizeof (GType) * node->n_children);
2278 children[node->n_children] = 0;
2279
2280 if (n_children)
2281 *n_children = node->n_children;
2282 G_READ_UNLOCK (&type_rw_lock);
2283
2284 return children;
2285 }
2286 else
2287 {
2288 if (n_children)
2289 *n_children = 0;
2290
2291 return NULL;
2292 }
2293 }
2294
2295 GType* /* free result */
2296 g_type_interfaces (GType type,
2297 guint *n_interfaces)
2298 {
2299 TypeNode *node;
2300
2301 node = lookup_type_node_I (type);
2302 if (node && node->is_instantiatable)
2303 {
2304 GType *ifaces;
2305 guint i;
2306
2307 G_READ_LOCK (&type_rw_lock);
2308 ifaces = g_new (GType, CLASSED_NODE_N_IFACES (node) + 1);
2309 for (i = 0; i < CLASSED_NODE_N_IFACES (node); i++)
2310 ifaces[i] = CLASSED_NODE_IFACES_ENTRIES (node)[i].iface_type;
2311 ifaces[i] = 0;
2312
2313 if (n_interfaces)
2314 *n_interfaces = CLASSED_NODE_N_IFACES (node);
2315 G_READ_UNLOCK (&type_rw_lock);
2316
2317 return ifaces;
2318 }
2319 else
2320 {
2321 if (n_interfaces)
2322 *n_interfaces = 0;
2323
2324 return NULL;
2325 }
2326 }
2327
2328 typedef struct _QData QData;
2329 struct _GData
2330 {
2331 guint n_qdatas;
2332 QData *qdatas;
2333 };
2334 struct _QData
2335 {
2336 GQuark quark;
2337 gpointer data;
2338 };
2339
2340 static inline gpointer
2341 type_get_qdata_L (TypeNode *node,
2342 GQuark quark)
2343 {
2344 GData *gdata = node->global_gdata;
2345
2346 if (quark && gdata && gdata->n_qdatas)
2347 {
2348 QData *qdatas = gdata->qdatas - 1;
2349 guint n_qdatas = gdata->n_qdatas;
2350
2351 do
2352 {
2353 guint i;
2354 QData *check;
2355
2356 i = (n_qdatas + 1) / 2;
2357 check = qdatas + i;
2358 if (quark == check->quark)
2359 return check->data;
2360 else if (quark > check->quark)
2361 {
2362 n_qdatas -= i;
2363 qdatas = check;
2364 }
2365 else /* if (quark < check->quark) */
2366 n_qdatas = i - 1;
2367 }
2368 while (n_qdatas);
2369 }
2370 return NULL;
2371 }
2372
2373 gpointer
2374 g_type_get_qdata (GType type,
2375 GQuark quark)
2376 {
2377 TypeNode *node;
2378 gpointer data;
2379
2380 node = lookup_type_node_I (type);
2381 if (node)
2382 {
2383 G_READ_LOCK (&type_rw_lock);
2384 data = type_get_qdata_L (node, quark);
2385 G_READ_UNLOCK (&type_rw_lock);
2386 }
2387 else
2388 {
2389 g_return_val_if_fail (node != NULL, NULL);
2390 data = NULL;
2391 }
2392 return data;
2393 }
2394
2395 static inline void
2396 type_set_qdata_W (TypeNode *node,
2397 GQuark quark,
2398 gpointer data)
2399 {
2400 GData *gdata;
2401 QData *qdata;
2402 guint i;
2403
2404 /* setup qdata list if necessary */
2405 if (!node->global_gdata)
2406 node->global_gdata = g_new0 (GData, 1);
2407 gdata = node->global_gdata;
2408
2409 /* try resetting old data */
2410 qdata = gdata->qdatas;
2411 for (i = 0; i < gdata->n_qdatas; i++)
2412 if (qdata[i].quark == quark)
2413 {
2414 qdata[i].data = data;
2415 return;
2416 }
2417
2418 /* add new entry */
2419 gdata->n_qdatas++;
2420 gdata->qdatas = g_renew (QData, gdata->qdatas, gdata->n_qdatas);
2421 qdata = gdata->qdatas;
2422 for (i = 0; i < gdata->n_qdatas - 1; i++)
2423 if (qdata[i].quark > quark)
2424 break;
2425 g_memmove (qdata + i + 1, qdata + i, sizeof (qdata[0]) * (gdata->n_qdatas - i - 1));
2426 qdata[i].quark = quark;
2427 qdata[i].data = data;
2428 }
2429
2430 void
2431 g_type_set_qdata (GType type,
2432 GQuark quark,
2433 gpointer data)
2434 {
2435 TypeNode *node;
2436
2437 g_return_if_fail (quark != 0);
2438
2439 node = lookup_type_node_I (type);
2440 if (node)
2441 {
2442 G_WRITE_LOCK (&type_rw_lock);
2443 type_set_qdata_W (node, quark, data);
2444 G_WRITE_UNLOCK (&type_rw_lock);
2445 }
2446 else
2447 g_return_if_fail (node != NULL);
2448 }
2449
2450 static void
2451 type_add_flags_W (TypeNode *node,
2452 GTypeFlags flags)
2453 {
2454 guint dflags;
2455
2456 g_return_if_fail ((flags & ~TYPE_FLAG_MASK) == 0);
2457 g_return_if_fail (node != NULL);
2458
2459 if ((flags & TYPE_FLAG_MASK) && node->is_classed && node->data && node->data->class.class)
2460 g_warning ("tagging type `%s' as abstract after class initialization", NODE_NAME (node));
2461 dflags = GPOINTER_TO_UINT (type_get_qdata_L (node, static_quark_type_flags));
2462 dflags |= flags;
2463 type_set_qdata_W (node, static_quark_type_flags, GUINT_TO_POINTER (dflags));
2464 }
2465
2466 void
2467 g_type_query (GType type,
2468 GTypeQuery *query)
2469 {
2470 TypeNode *node;
2471
2472 g_return_if_fail (query != NULL);
2473
2474 /* if node is not static and classed, we won't allow query */
2475 query->type = 0;
2476 node = lookup_type_node_I (type);
2477 if (node && node->is_classed && !node->plugin)
2478 {
2479 /* type is classed and probably even instantiatable */
2480 G_READ_LOCK (&type_rw_lock);
2481 if (node->data) /* type is static or referenced */
2482 {
2483 query->type = NODE_TYPE (node);
2484 query->type_name = NODE_NAME (node);
2485 query->class_size = node->data->class.class_size;
2486 query->instance_size = node->is_instantiatable ? node->data->instance.instance_size : 0;
2487 }
2488 G_READ_UNLOCK (&type_rw_lock);
2489 }
2490 }
2491
2492
2493 /* --- implementation details --- */
2494 gboolean
2495 g_type_test_flags (GType type,
2496 guint flags)
2497 {
2498 TypeNode *node;
2499 gboolean result = FALSE;
2500
2501 node = lookup_type_node_I (type);
2502 if (node)
2503 {
2504 guint fflags = flags & TYPE_FUNDAMENTAL_FLAG_MASK;
2505 guint tflags = flags & TYPE_FLAG_MASK;
2506
2507 if (fflags)
2508 {
2509 GTypeFundamentalInfo *finfo = type_node_fundamental_info_I (node);
2510
2511 fflags = (finfo->type_flags & fflags) == fflags;
2512 }
2513 else
2514 fflags = TRUE;
2515
2516 if (tflags)
2517 {
2518 G_READ_LOCK (&type_rw_lock);
2519 tflags = (tflags & GPOINTER_TO_UINT (type_get_qdata_L (node, static_quark_type_flags))) == tflags;
2520 G_READ_UNLOCK (&type_rw_lock);
2521 }
2522 else
2523 tflags = TRUE;
2524
2525 result = tflags && fflags;
2526 }
2527
2528 return result;
2529 }
2530
2531 GTypePlugin*
2532 g_type_get_plugin (GType type)
2533 {
2534 TypeNode *node;
2535
2536 node = lookup_type_node_I (type);
2537
2538 return node ? node->plugin : NULL;
2539 }
2540
2541 GTypePlugin*
2542 g_type_interface_get_plugin (GType instance_type,
2543 GType interface_type)
2544 {
2545 TypeNode *node;
2546 TypeNode *iface;
2547
2548 g_return_val_if_fail (G_TYPE_IS_INTERFACE (interface_type), NULL); /* G_TYPE_IS_INTERFACE() is an external call: _U */
2549
2550 node = lookup_type_node_I (instance_type);
2551 iface = lookup_type_node_I (interface_type);
2552 if (node && iface)
2553 {
2554 IFaceHolder *iholder;
2555 GTypePlugin *plugin;
2556
2557 G_READ_LOCK (&type_rw_lock);
2558
2559 iholder = iface_node_get_holders_L (iface);
2560 while (iholder && iholder->instance_type != instance_type)
2561 iholder = iholder->next;
2562 plugin = iholder ? iholder->plugin : NULL;
2563
2564 G_READ_UNLOCK (&type_rw_lock);
2565
2566 return plugin;
2567 }
2568
2569 g_return_val_if_fail (node == NULL, NULL);
2570 g_return_val_if_fail (iface == NULL, NULL);
2571
2572 g_warning (G_STRLOC ": attempt to look up plugin for invalid instance/interface type pair.");
2573
2574 return NULL;
2575 }
2576
2577 GType
2578 g_type_fundamental_next (void)
2579 {
2580 GType type;
2581
2582 G_READ_LOCK (&type_rw_lock);
2583 type = static_fundamental_next;
2584 G_READ_UNLOCK (&type_rw_lock);
2585
2586 return type <= G_TYPE_FUNDAMENTAL_MAX ? type : 0;
2587 }
2588
2589 GType
2590 g_type_fundamental (GType type_id)
2591 {
2592 TypeNode *node = lookup_type_node_I (type_id);
2593
2594 return node ? NODE_FUNDAMENTAL_TYPE (node) : 0;
2595 }
2596
2597 gboolean
2598 g_type_check_instance_is_a (GTypeInstance *type_instance,
2599 GType iface_type)
2600 {
2601 TypeNode *node, *iface;
2602 gboolean check;
2603
2604 if (!type_instance || !type_instance->g_class)
2605 return FALSE;
2606
2607 node = lookup_type_node_I (type_instance->g_class->g_type);
2608 iface = lookup_type_node_I (iface_type);
2609 check = node && node->is_instantiatable && iface && type_node_conforms_to_U (node, iface, TRUE, FALSE);
2610
2611 return check;
2612 }
2613
2614 gboolean
2615 g_type_check_class_is_a (GTypeClass *type_class,
2616 GType is_a_type)
2617 {
2618 TypeNode *node, *iface;
2619 gboolean check;
2620
2621 if (!type_class)
2622 return FALSE;
2623
2624 node = lookup_type_node_I (type_class->g_type);
2625 iface = lookup_type_node_I (is_a_type);
2626 check = node && node->is_classed && iface && type_node_conforms_to_U (node, iface, FALSE, FALSE);
2627
2628 return check;
2629 }
2630
2631 GTypeInstance*
2632 g_type_check_instance_cast (GTypeInstance *type_instance,
2633 GType iface_type)
2634 {
2635 if (type_instance)
2636 {
2637 if (type_instance->g_class)
2638 {
2639 TypeNode *node, *iface;
2640 gboolean is_instantiatable, check;
2641
2642 node = lookup_type_node_I (type_instance->g_class->g_type);
2643 is_instantiatable = node && node->is_instantiatable;
2644 iface = lookup_type_node_I (iface_type);
2645 check = is_instantiatable && iface && type_node_conforms_to_U (node, iface, TRUE, FALSE);
2646 if (check)
2647 return type_instance;
2648
2649 if (is_instantiatable)
2650 g_warning ("invalid cast from `%s' to `%s'",
2651 type_descriptive_name_I (type_instance->g_class->g_type),
2652 type_descriptive_name_I (iface_type));
2653 else
2654 g_warning ("invalid uninstantiatable type `%s' in cast to `%s'",
2655 type_descriptive_name_I (type_instance->g_class->g_type),
2656 type_descriptive_name_I (iface_type));
2657 }
2658 else
2659 g_warning ("invalid unclassed pointer in cast to `%s'",
2660 type_descriptive_name_I (iface_type));
2661 }
2662 else
2663 g_warning ("invalid cast from (NULL) pointer to `%s'",
2664 type_descriptive_name_I (iface_type));
2665
2666 return type_instance;
2667 }
2668
2669 GTypeClass*
2670 g_type_check_class_cast (GTypeClass *type_class,
2671 GType is_a_type)
2672 {
2673 if (type_class)
2674 {
2675 TypeNode *node, *iface;
2676 gboolean is_classed, check;
2677
2678 node = lookup_type_node_I (type_class->g_type);
2679 is_classed = node && node->is_classed;
2680 iface = lookup_type_node_I (is_a_type);
2681 check = is_classed && iface && type_node_conforms_to_U (node, iface, FALSE, FALSE);
2682 if (check)
2683 return type_class;
2684
2685 if (is_classed)
2686 g_warning ("invalid class cast from `%s' to `%s'",
2687 type_descriptive_name_I (type_class->g_type),
2688 type_descriptive_name_I (is_a_type));
2689 else
2690 g_warning ("invalid unclassed type `%s' in class cast to `%s'",
2691 type_descriptive_name_I (type_class->g_type),
2692 type_descriptive_name_I (is_a_type));
2693 }
2694 else
2695 g_warning ("invalid class cast from (NULL) pointer to `%s'",
2696 type_descriptive_name_I (is_a_type));
2697 return type_class;
2698 }
2699
2700 gboolean
2701 g_type_check_instance (GTypeInstance *type_instance)
2702 {
2703 /* this function is just here to make the signal system
2704 * conveniently elaborated on instance checks
2705 */
2706 if (type_instance)
2707 {
2708 if (type_instance->g_class)
2709 {
2710 TypeNode *node = lookup_type_node_I (type_instance->g_class->g_type);
2711
2712 if (node && node->is_instantiatable)
2713 return TRUE;
2714
2715 g_warning ("instance of invalid non-instantiatable type `%s'",
2716 type_descriptive_name_I (type_instance->g_class->g_type));
2717 }
2718 else
2719 g_warning ("instance with invalid (NULL) class pointer");
2720 }
2721 else
2722 g_warning ("invalid (NULL) pointer instance");
2723
2724 return FALSE;
2725 }
2726
2727 static inline gboolean
2728 type_check_is_value_type_U (GType type)
2729 {
2730 GTypeFlags tflags = G_TYPE_FLAG_VALUE_ABSTRACT;
2731 TypeNode *node;
2732
2733 /* common path speed up */
2734 node = lookup_type_node_I (type);
2735 if (node && node->mutatable_check_cache)
2736 return TRUE;
2737
2738 G_READ_LOCK (&type_rw_lock);
2739 restart_check:
2740 if (node)
2741 {
2742 if (node->data && node->data->common.ref_count > 0 &&
2743 node->data->common.value_table->value_init)
2744 tflags = GPOINTER_TO_UINT (type_get_qdata_L (node, static_quark_type_flags));
2745 else if (NODE_IS_IFACE (node))
2746 {
2747 guint i;
2748
2749 for (i = 0; i < IFACE_NODE_N_PREREQUISITES (node); i++)
2750 {
2751 GType prtype = IFACE_NODE_PREREQUISITES (node)[i];
2752 TypeNode *prnode = lookup_type_node_I (prtype);
2753
2754 if (prnode->is_instantiatable)
2755 {
2756 type = prtype;
2757 node = lookup_type_node_I (type);
2758 goto restart_check;
2759 }
2760 }
2761 }
2762 }
2763 G_READ_UNLOCK (&type_rw_lock);
2764
2765 return !(tflags & G_TYPE_FLAG_VALUE_ABSTRACT);
2766 }
2767
2768 gboolean
2769 g_type_check_is_value_type (GType type)
2770 {
2771 return type_check_is_value_type_U (type);
2772 }
2773
2774 gboolean
2775 g_type_check_value (GValue *value)
2776 {
2777 return value && type_check_is_value_type_U (value->g_type);
2778 }
2779
2780 gboolean
2781 g_type_check_value_holds (GValue *value,
2782 GType type)
2783 {
2784 return value && type_check_is_value_type_U (value->g_type) && g_type_is_a (value->g_type, type);
2785 }
2786
2787 GTypeValueTable*
2788 g_type_value_table_peek (GType type)
2789 {
2790 GTypeValueTable *vtable = NULL;
2791 TypeNode *node = lookup_type_node_I (type);
2792 gboolean has_refed_data, has_table;
2793 TypeData *data;
2794
2795 /* speed up common code path, we're not 100% safe here,
2796 * but we should only get called with referenced types anyway
2797 */
2798 data = node ? node->data : NULL;
2799 if (node && node->mutatable_check_cache)
2800 return data->common.value_table;
2801
2802 G_READ_LOCK (&type_rw_lock);
2803
2804 restart_table_peek:
2805 has_refed_data = node && node->data && node->data->common.ref_count;
2806 has_table = has_refed_data && node->data->common.value_table->value_init;
2807 if (has_refed_data)
2808 {
2809 if (has_table)
2810 vtable = node->data->common.value_table;
2811 else if (NODE_IS_IFACE (node))
2812 {
2813 guint i;
2814
2815 for (i = 0; i < IFACE_NODE_N_PREREQUISITES (node); i++)
2816 {
2817 GType prtype = IFACE_NODE_PREREQUISITES (node)[i];
2818 TypeNode *prnode = lookup_type_node_I (prtype);
2819
2820 if (prnode->is_instantiatable)
2821 {
2822 type = prtype;
2823 node = lookup_type_node_I (type);
2824 goto restart_table_peek;
2825 }
2826 }
2827 }
2828 }
2829
2830 G_READ_UNLOCK (&type_rw_lock);
2831
2832 if (vtable)
2833 return vtable;
2834
2835 if (!node)
2836 g_warning (G_STRLOC ": type id `%lu' is invalid", type);
2837 if (!has_refed_data)
2838 g_warning ("can't peek value table for type `%s' which is not currently referenced",
2839 type_descriptive_name_I (type));
2840
2841 return NULL;
2842 }
2843
2844 G_CONST_RETURN gchar*
2845 g_type_name_from_instance (GTypeInstance *instance)
2846 {
2847 if (!instance)
2848 return "<NULL-instance>";
2849 else
2850 return g_type_name_from_class (instance->g_class);
2851 }
2852
2853 G_CONST_RETURN gchar*
2854 g_type_name_from_class (GTypeClass *g_class)
2855 {
2856 if (!g_class)
2857 return "<NULL-class>";
2858 else
2859 return g_type_name (g_class->g_type);
2860 }
2861
2862
2863 /* --- foreign prototypes --- */
2864 extern void g_value_c_init (void); /* sync with gvalue.c */
2865 extern void g_value_types_init (void); /* sync with gvaluetypes.c */
2866 extern void g_enum_types_init (void); /* sync with genums.c */
2867 extern void g_param_type_init (void); /* sync with gparam.c */
2868 extern void g_boxed_type_init (void); /* sync with gboxed.c */
2869 extern void g_object_type_init (void); /* sync with gobject.c */
2870 extern void g_param_spec_types_init (void); /* sync with gparamspecs.c */
2871 extern void g_value_transforms_init (void); /* sync with gvaluetransform.c */
2872 extern void g_signal_init (void); /* sync with gsignal.c */
2873
2874
2875 /* --- initialization --- */
2876 void
2877 g_type_init_with_debug_flags (GTypeDebugFlags debug_flags)
2878 {
2879 G_LOCK_DEFINE_STATIC (type_init_lock);
2880 const gchar *env_string;
2881 GTypeInfo info;
2882 TypeNode *node;
2883 GType type;
2884
2885 G_LOCK (type_init_lock);
2886
2887 G_WRITE_LOCK (&type_rw_lock);
2888
2889 if (static_quark_type_flags)
2890 {
2891 G_WRITE_UNLOCK (&type_rw_lock);
2892 G_UNLOCK (type_init_lock);
2893 return;
2894 }
2895
2896 /* setup GObject library wide debugging flags */
2897 _g_type_debug_flags = debug_flags & G_TYPE_DEBUG_MASK;
2898 env_string = g_getenv ("GOBJECT_DEBUG");
2899 if (env_string != NULL)
2900 {
2901 static GDebugKey debug_keys[] = {
2902 { "objects", G_TYPE_DEBUG_OBJECTS },
2903 { "signals", G_TYPE_DEBUG_SIGNALS },
2904 };
2905
2906 _g_type_debug_flags |= g_parse_debug_string (env_string,
2907 debug_keys,
2908 sizeof (debug_keys) / sizeof (debug_keys[0]));
2909 env_string = NULL;
2910 }
2911
2912 /* quarks */
2913 static_quark_type_flags = g_quark_from_static_string ("-g-type-private--GTypeFlags");
2914 static_quark_iface_holder = g_quark_from_static_string ("-g-type-private--IFaceHolder");
2915 static_quark_dependants_array = g_quark_from_static_string ("-g-type-private--dependants-array");
2916
2917 /* type qname hash table */
2918 static_type_nodes_ht = g_hash_table_new (g_direct_hash, g_direct_equal);
2919
2920 /* invalid type G_TYPE_INVALID (0)
2921 */
2922 static_fundamental_type_nodes[0] = NULL;
2923
2924 /* void type G_TYPE_NONE
2925 */
2926 node = type_node_fundamental_new_W (G_TYPE_NONE, "void", 0);
2927 type = NODE_TYPE (node);
2928 g_assert (type == G_TYPE_NONE);
2929
2930 /* interface fundamental type G_TYPE_INTERFACE (!classed)
2931 */
2932 memset (&info, 0, sizeof (info));
2933 node = type_node_fundamental_new_W (G_TYPE_INTERFACE, "GInterface", G_TYPE_FLAG_DERIVABLE);
2934 type = NODE_TYPE (node);
2935 type_data_make_W (node, &info, NULL);
2936 g_assert (type == G_TYPE_INTERFACE);
2937
2938 G_WRITE_UNLOCK (&type_rw_lock);
2939
2940 g_value_c_init ();
2941
2942 /* G_TYPE_TYPE_PLUGIN
2943 */
2944 g_type_plugin_get_type ();
2945
2946 /* G_TYPE_* value types
2947 */
2948 g_value_types_init ();
2949
2950 /* G_TYPE_ENUM & G_TYPE_FLAGS
2951 */
2952 g_enum_types_init ();
2953
2954 /* G_TYPE_BOXED
2955 */
2956 g_boxed_type_init ();
2957
2958 /* G_TYPE_PARAM
2959 */
2960 g_param_type_init ();
2961
2962 /* G_TYPE_OBJECT
2963 */
2964 g_object_type_init ();
2965
2966 /* G_TYPE_PARAM_* pspec types
2967 */
2968 g_param_spec_types_init ();
2969
2970 /* Value Transformations
2971 */
2972 g_value_transforms_init ();
2973
2974 /* Signal system
2975 */
2976 g_signal_init ();
2977
2978 G_UNLOCK (type_init_lock);
2979 }
2980
2981 void
2982 g_type_init (void)
2983 {
2984 g_type_init_with_debug_flags (0);
2985 }
glib mirror