6 * File name: ir/ana/irtypeinfo.c
7 * Purpose: Data structure to hold type information for nodes.
8 * Author: Goetz Lindenmaier
12 * Copyright: (c) 2003 Universität Karlsruhe
13 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
15 * Data structure to hold type information for nodes.
17 * This module defines a field "type" of type "type *" for each ir node.
18 * It defines a flag for irgraphs to mark whether the type info of the
19 * graph is valid. Further it defines an auxiliary type "initial_type".
21 * The module defines a map that contains pairs (irnode, type). If an irnode
22 * is not in the map it is assumed to be initialized, i.e., the initialization
23 * requires no compute time. As firm nodes can not be freed and reallocated
24 * pointers for nodes are unique (until a call of dead_node_elimination).
28 #include "irtypeinfo.h"
32 #include "irgraph_t.h" /* for setting the state flag. */
36 /* ------------ The map. ---------------------------------------------- */
39 static pmap *type_node_map = NULL;
42 /* ------------ Auxiliary type. --------------------------------------- */
44 /* This auxiliary type expresses that a field is uninitialized. The
45 * variable is set by init_irtypeinfo. The type is freed by
48 type *initial_type = NULL;
51 /* ------------ Initializing this module. ----------------------------- */
53 /* Initializes the type information module.
54 * Generates a type "initial_type" and sets the type of all nodes to this type.
55 * Calling set/get_irn_type is invalid before calling init. Requires memory
56 * in the order of MIN(<calls to set_irn_type>, #irnodes).
58 void init_irtypeinfo(void) {
62 initial_type = new_type_class(new_id_from_str("initial_type"));
64 /* We need a new, empty map. */
65 if (type_node_map) pmap_destroy(type_node_map);
66 type_node_map = pmap_create();
68 for (i = 0; i < get_irp_n_irgs(); ++i)
69 set_irg_typeinfo_state(get_irp_irg(i), irg_typeinfo_none);
73 void free_irtypeinfo(void) {
77 free_type(initial_type);
80 assert(0 && "call init_type_info before freeing");
84 pmap_destroy(type_node_map);
87 assert(0 && "call init_type_info before freeing");
89 for (i = 0; i < get_irp_n_irgs(); ++i)
90 set_irg_typeinfo_state(get_irp_irg(i), irg_typeinfo_none);
94 /* ------------ Irgraph state handling. ------------------------------- */
96 void set_irg_typeinfo_state(ir_graph *irg, irg_typeinfo_state s) {
97 assert(is_ir_graph(irg));
98 irg->typeinfo_state = s;
101 irg_typeinfo_state get_irg_typeinfo_state(ir_graph *irg) {
102 assert(is_ir_graph(irg));
103 return irg->typeinfo_state;
106 /* ------------ Irnode type information. ------------------------------ */
108 /* These routines only work properly if the ir_graph is in state
109 * irg_typeinfo_consistent or irg_typeinfo_inconsistent. They
110 * assume current_ir_graph set properly.
112 type *get_irn_type(ir_node *n) {
113 type *res = initial_type;
114 assert(get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_consistent ||
115 get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_inconsistent );
117 if (pmap_contains(type_node_map, (void *)n))
118 res = (type *) pmap_get(type_node_map, (void *)n);
123 void set_irn_type(ir_node *n, type *tp) {
124 assert(get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_consistent ||
125 get_irg_typeinfo_state(current_ir_graph) == irg_typeinfo_inconsistent );
127 pmap_insert(type_node_map, (void *)n, (void *)tp);