5 File name: ir/ana/pto_init.c
6 Purpose: Initialisation Functions
9 Created: Sat Nov 13 19:35:27 CET 2004
11 Copyright: (c) 1999-2004 Universität Karlsruhe
12 Licence: This file is protected by the GPL - GNU GENERAL PUBLIC LICENSE.
20 pto_init: Initialisation Functions
27 # include "pto_init.h"
28 # include "pto_debug.h"
29 # include "pto_comp.h"
30 # include "pto_name.h"
31 # include "pto_util.h"
33 # include "typewalk.h"
38 # define obstack_chunk_alloc xmalloc
39 # define obstack_chunk_free free
41 /* Local Data Types: */
42 typedef struct init_env_str
47 typedef struct reset_env_str
52 /* Local Variables: */
53 extern struct obstack *qset_obst; /* from pto_name */
55 static struct obstack *pto_obst = NULL; /* all pto_t's go onto this one */
57 /* Local Prototypes: */
59 /* ===================================================
61 =================================================== */
62 /* Allocate a new pto */
63 static pto_t *new_pto (ir_node *node)
65 pto_t *pto = obstack_alloc (pto_obst, sizeof (pto_t));
66 pto->values = qset_new (N_INITIAL_OJBS, qset_obst);
71 /* Allocate a new alloc_pto */
72 static alloc_pto_t *new_alloc_pto (ir_node *alloc, int n_ctxs)
74 assert (iro_Alloc == get_irn_opcode (alloc));
77 alloc_pto_t *alloc_pto = obstack_alloc (pto_obst, sizeof (alloc_pto_t));
78 type *tp = get_Alloc_type (alloc);
80 alloc_pto->ptos = (pto_t**) obstack_alloc (pto_obst, n_ctxs * sizeof (pto_t*));
82 for (i = 0; i < n_ctxs; i ++) {
83 desc_t *desc = new_name (tp, alloc, i);
84 alloc_pto->ptos [i] = new_pto (alloc);
85 qset_insert (alloc_pto->ptos [i]->values, desc);
91 /* Allocate a new pto for a symconst */
92 static pto_t* new_symconst_pto (ir_node *symconst)
94 assert (iro_SymConst == get_irn_opcode (symconst));
96 pto_t *pto = new_pto (symconst);
97 entity *ent = get_SymConst_entity (symconst);
101 const char *ent_name = (char*) get_entity_name (ent);
102 const char *own_name = (char*) get_type_name (get_entity_owner (ent));
103 HERE3 ("start", own_name, ent_name);
105 /* Ok, so if the symconst has a pointer-to-mumble, it's some address
106 calculation, but if it's the mumble itself, it's just the same,
107 except it's presumably a constant of mumble. In any case, we need to
108 branch on this. "How's that for object fucking oriented? --jwz" */
109 if (is_pointer_type (get_entity_type (ent))) {
110 desc = new_ent_name (ent);
111 } else if (is_class_type (get_entity_type (ent))) {
112 desc = new_name (get_entity_type (ent), symconst, -1);
114 fprintf (stderr, "%s: not handled: %s[%li] (\"%s\")\n",
116 get_op_name (get_irn_op (symconst)),
117 get_irn_node_nr (symconst),
118 get_entity_name (ent));
119 assert (0 && "something not handled");
122 qset_insert (pto->values, desc);
124 /* HERE3 ("end", own_name, ent_name); */
129 /* Allocate a new pto for a constant */
130 static pto_t *new_const_pto (ir_node *cnst)
132 assert (iro_Const == get_irn_opcode (cnst));
133 assert (mode_P == get_irn_mode (cnst));
135 static pto_t *cnst_pto = NULL;
137 /* since 'store's and 'load's via a NULL pointer are hardly ever
138 successful, we get away with an empty set */
140 tarval *tv = get_Const_tarval (cnst);
142 assert (tv == get_tarval_null (mode_P));
144 if (NULL == cnst_pto) {
145 cnst_pto = new_pto (cnst);
152 /* Helper to pto_init --- clear the link fields of class types */
153 static void clear_type_link (type_or_ent *thing, void *__unused)
155 if (is_type (thing)) {
156 type *tp = (type*) thing;
158 if (is_class_type (tp)) {
159 DBGPRINT (1, (stdout, "%s (\"%s\")\n",
160 __FUNCTION__, get_type_name (tp)));
162 set_type_link (tp, NULL);
164 } else if (is_entity (thing)) {
165 entity *ent = (entity*) thing;
167 DBGPRINT (1, (stdout, "%s (\"%s\")\n",
168 __FUNCTION__, get_entity_name (ent)));
170 set_entity_link (ent, NULL);
174 /* Helper to pto_init_graph --- clear the links of the given node */
175 static void clear_node_link (ir_node *node, void *__unused)
177 set_irn_link (node, NULL);
180 /* Helper to pto_init_graph --- clear the links of all nodes */
181 static void clear_graph_links (ir_graph *graph)
183 irg_walk_graph (graph, clear_node_link, NULL, NULL);
186 /* Reset ALL the pto values for a new pass */
187 static void reset_node_pto (ir_node *node, void *env)
189 reset_env_t *reset_env = (reset_env_t*) env;
190 int ctx_idx = reset_env->ctx_idx;
191 const opcode op = get_irn_opcode (node);
193 /* HERE ("start"); */
198 case (iro_Block): /* END BLOCK only */
200 /* allocate 'empty' pto values */
201 pto_t *pto = new_pto (node);
202 set_node_pto (node, pto);
206 /* set alloc to 'right' current pto */
207 alloc_pto_t *alloc_pto = (alloc_pto_t*) get_irn_link (node);
208 alloc_pto->curr_pto = alloc_pto->ptos [ctx_idx];
210 DBGPRINT (1, (stdout, "%s: setting pto of \"%s[%li]\" for ctx %i\n",
216 assert (alloc_pto->curr_pto);
219 case (iro_SymConst): {
220 /* nothing, leave as-is */
224 /* basically, nothing */
225 DBGPRINT (2, (stdout, "%s: resetting pto of \"%s[%li]\"\n",
229 set_node_pto (node, NULL);
236 /* Initialise primary name sources */
237 static void init_pto (ir_node *node, void *env)
239 init_env_t *init_env = (init_env_t*) env;
240 int n_ctxs = init_env->n_ctxs;
242 const opcode op = get_irn_opcode (node);
245 case (iro_SymConst): {
246 if (mode_P == get_irn_mode (node)) {
247 entity *ent = get_SymConst_entity (node);
248 type *tp = get_entity_type (ent);
249 if (is_class_type (tp) || is_pointer_type (tp)) {
250 pto_t *symconst_pto = new_symconst_pto (node);
251 set_node_pto (node, symconst_pto);
254 DBGPRINT (1, (stdout, "%s: new name \"%s\" for \"%s[%li]\"\n",
256 get_entity_name (ent),
264 alloc_pto_t *alloc_pto = new_alloc_pto (node, n_ctxs);
265 set_alloc_pto (node, alloc_pto);
267 type *tp = get_Alloc_type (node); /* debugging only */
268 DBGPRINT (1, (stdout, "%s: %i names \"%s\" for \"%s[%li]\"\n",
277 if (mode_P == get_irn_mode (node)) {
278 pto_t *pto = new_const_pto (node);
279 set_node_pto (node, pto);
286 /* nothing --- handled by reset_node_pto on each pass */
295 /* Initialise the given graph for a new pass run */
296 static void pto_init_graph_allocs (ir_graph *graph)
298 graph_info_t *ginfo = ecg_get_info (graph);
299 int n_ctxs = ginfo->n_ctxs;
301 init_env_t *init_env = xmalloc (sizeof (init_env_t));
302 init_env->n_ctxs = n_ctxs;
304 /* HERE ("start"); */
306 irg_walk_graph (graph, init_pto, NULL, init_env);
308 memset (init_env, 0x00, sizeof (init_env_t));
314 /* ===================================================
315 Exported Implementation:
316 =================================================== */
317 /* "Fake" the arguments to the main method */
318 void fake_main_args (ir_graph *graph)
320 /* HERE ("start"); */
322 entity *ent = get_irg_entity (graph);
323 type *mtp = get_entity_type (ent);
324 ir_node **args = find_irg_args (graph);
325 type *ctp = get_method_param_type (mtp, 1); /* ctp == char[]*[]* */
327 /* 'main' has signature 'void(int, char[]*[]*)' */
328 assert (NULL == args [2]);
330 assert (is_pointer_type (ctp));
332 ctp = get_pointer_points_to_type (ctp); /* ctp == char[]*[] */
334 assert (is_array_type (ctp));
336 desc_t *arg_desc = new_name (ctp, args [1], -1);
337 pto_t *arg_pto = new_pto (args [1]);
338 /* todo: simulate 'store' to arg1[] ?!? */
339 qset_insert (arg_pto->values, arg_desc);
341 set_node_pto (args [1], arg_pto);
343 DBGPRINT (1, (stdout, "%s:%i (%s[%li])\n",
344 __FUNCTION__, __LINE__, OPNAME (args [1]), OPNUM (args [1])));
346 # ifdef TEST_MAIN_TYPE
347 ctp = get_array_element_type (ctp); /* ctp == char[]* */
349 assert (is_pointer_type (ctp));
351 ctp = get_pointer_points_to_type (ctp); /* ctp == char[] */
353 assert (is_array_type (ctp));
355 ctp = get_array_element_type (ctp); /* ctp == char */
357 assert (is_primitive_type (ctp));
358 # endif /* defined TEST_MAIN_TYPE */
363 /* Initialise the Init module */
364 void pto_init_init ()
366 pto_obst = (struct obstack*) xmalloc (sizeof (struct obstack));
368 obstack_init (pto_obst);
371 /* Cleanup the Init module */
372 void pto_init_cleanup ()
374 obstack_free (pto_obst, NULL);
375 memset (pto_obst, 0x00, sizeof (struct obstack));
381 /* Initialise the Names of the Types/Entities */
382 void pto_init_type_names ()
384 /* HERE ("start"); */
385 type_walk (clear_type_link, NULL, NULL);
389 /* Initialise the given graph for a new pass run */
390 void pto_init_graph (ir_graph *graph)
392 graph_info_t *ginfo = ecg_get_info (graph);
393 const int n_ctxs = ginfo->n_ctxs;
395 /* only for debugging stuff: */
396 entity *ent = get_irg_entity (graph);
397 const char *ent_name = (char*) get_entity_name (ent);
398 const char *own_name = (char*) get_type_name (get_entity_owner (ent));
400 DBGPRINT (2, (stdout, "%s: init \"%s.%s\" for %i ctxs\n", __FUNCTION__,
401 own_name, ent_name, n_ctxs));
403 /* HERE ("start"); */
405 clear_graph_links (graph);
406 pto_init_graph_allocs (graph);
410 assert (NULL == get_irg_proj_args (graph));
411 ir_node **proj_args = find_irg_args (graph);
412 set_irg_proj_args (graph, proj_args);
413 assert (proj_args == get_irg_proj_args (graph));
416 /* Reset the given graph for a new pass run */
417 void pto_reset_graph_pto (ir_graph *graph, int ctx_idx)
419 /* HERE ("start"); */
421 reset_env_t *reset_env = (reset_env_t*) xmalloc (sizeof (reset_env_t));
422 reset_env->ctx_idx = ctx_idx;
424 irg_walk_graph (graph, reset_node_pto, NULL, reset_env);
426 memset (reset_env, 0x00, sizeof (reset_env_t));
434 Revision 1.11 2004/12/20 17:34:35 liekweg
435 fix recursion handling
437 Revision 1.10 2004/12/15 13:31:00 liekweg
438 store ctx idx in names
440 Revision 1.9 2004/12/15 09:18:18 liekweg
443 Revision 1.8 2004/12/02 16:17:51 beck
444 fixed config.h include
446 Revision 1.7 2004/11/30 14:47:54 liekweg
447 fix initialisation; do correct iteration
449 Revision 1.6 2004/11/26 16:00:41 liekweg
450 recognize class consts vs. ptr-to-class consts
452 Revision 1.5 2004/11/24 14:53:56 liekweg
455 Revision 1.4 2004/11/20 21:21:56 liekweg
456 Finalise initialisation
458 Revision 1.3 2004/11/18 16:37:07 liekweg