]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * QEMU Module Infrastructure | |
3 | * | |
4 | * Copyright IBM, Corp. 2009 | |
5 | * | |
6 | * Authors: | |
7 | * Anthony Liguori <aliguori@us.ibm.com> | |
8 | * | |
9 | * This work is licensed under the terms of the GNU GPL, version 2. See | |
10 | * the COPYING file in the top-level directory. | |
11 | * | |
12 | * Contributions after 2012-01-13 are licensed under the terms of the | |
13 | * GNU GPL, version 2 or (at your option) any later version. | |
14 | */ | |
15 | ||
16 | #include "qemu-common.h" | |
17 | #include "qemu-queue.h" | |
18 | #include "module.h" | |
19 | ||
20 | typedef struct ModuleEntry | |
21 | { | |
22 | module_init_type type; | |
23 | void (*init)(void); | |
24 | QTAILQ_ENTRY(ModuleEntry) node; | |
25 | } ModuleEntry; | |
26 | ||
27 | typedef QTAILQ_HEAD(, ModuleEntry) ModuleTypeList; | |
28 | ||
29 | static ModuleTypeList init_type_list[MODULE_INIT_MAX]; | |
30 | ||
31 | static void init_types(void) | |
32 | { | |
33 | static int inited; | |
34 | int i; | |
35 | ||
36 | if (inited) { | |
37 | return; | |
38 | } | |
39 | ||
40 | for (i = 0; i < MODULE_INIT_MAX; i++) { | |
41 | QTAILQ_INIT(&init_type_list[i]); | |
42 | } | |
43 | ||
44 | inited = 1; | |
45 | } | |
46 | ||
47 | ||
48 | static ModuleTypeList *find_type(module_init_type type) | |
49 | { | |
50 | ModuleTypeList *l; | |
51 | ||
52 | init_types(); | |
53 | ||
54 | l = &init_type_list[type]; | |
55 | ||
56 | return l; | |
57 | } | |
58 | ||
59 | void register_module_init(void (*fn)(void), module_init_type type) | |
60 | { | |
61 | ModuleEntry *e; | |
62 | ModuleTypeList *l; | |
63 | ||
64 | e = g_malloc0(sizeof(*e)); | |
65 | e->init = fn; | |
66 | ||
67 | l = find_type(type); | |
68 | ||
69 | QTAILQ_INSERT_TAIL(l, e, node); | |
70 | } | |
71 | ||
72 | void module_call_init(module_init_type type) | |
73 | { | |
74 | ModuleTypeList *l; | |
75 | ModuleEntry *e; | |
76 | ||
77 | l = find_type(type); | |
78 | ||
79 | QTAILQ_FOREACH(e, l, node) { | |
80 | e->init(); | |
81 | } | |
82 | } |