5 File name: ir/ana/pto_comp.c
6 Purpose: Main Implementation of PTO
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_comp: Main Implementation of PTO
23 # include <string.h> /* for memset */
25 # include "pto_comp.h"
26 # include "pto_util.h"
27 # include "pto_name.h"
31 # include "irnode_t.h"
34 # include "irmemwalk.h"
36 # include "pto_debug.h"
37 # include "pto_init.h"
43 /* Local Data Types: */
44 typedef struct pto_env_str {
50 /* Local Variables: */
55 /* Local Prototypes: */
56 static pto_t *get_pto (ir_node*, pto_env_t*);
57 static void pto_call (ir_graph*, ir_node*, pto_env_t*);
58 static void pto_raise (ir_node*, pto_env_t*);
59 static void pto_load (ir_node*, pto_env_t*);
60 static void pto_store (ir_node*, pto_env_t*);
61 static void pto_method (ir_node*, pto_env_t*);
62 static void pto_end_block (ir_node*, pto_env_t*);
64 /* ===================================================
66 =================================================== */
67 /* Transfer the actual arguments to the formal arguments */
68 static void set_graph_args (ir_graph *graph, ir_node *call, pto_env_t *env)
70 assert (iro_Call == get_irn_opcode (call));
72 type *meth = get_entity_type (get_irg_entity (graph));
73 ir_node **args = find_irg_args (graph);
74 int n_args = get_Call_n_params (call);
77 for (i = 0; i < n_args; i ++) {
78 if (NULL != args [i]) {
79 if (mode_P == get_type_mode (get_method_param_type (meth, i))) {
80 ir_node *call_arg = get_Call_param (call, i);
81 pto_t *pto = get_pto (call_arg, env);
83 set_node_pto (args [i], pto);
85 DBGPRINT (1, (stdout, "%s: arg [%i]: %s[%li] -> %s[%li] (%i)\n",
88 OPNAME (call_arg), OPNUM (call_arg),
89 OPNAME (args [i]), OPNUM (args [i]),
96 /* Transfer the graph's result to the call */
97 static int set_graph_result (ir_graph *graph, ir_node *call)
99 type *tp = get_entity_type (get_irg_entity (graph));
102 if (0 == get_method_n_ress (tp)) {
106 tp = get_method_res_type (tp, 0);
108 if (mode_P != get_type_mode (tp)) {
109 set_node_pto (call, NULL);
114 ir_node *end_block = get_irg_end_block (graph);
115 pto_t *ret_pto = get_node_pto (end_block);
117 pto_t *call_pto = get_node_pto (call);
121 change |= qset_insert_all (call_pto->values, ret_pto->values);
126 /* Propagation of PTO values */
127 static pto_t *get_pto_proj (ir_node *proj, pto_env_t *env)
129 ir_node *proj_in = get_Proj_pred (proj);
130 const long proj_proj = get_Proj_proj (proj);
131 const opcode in_op = get_irn_opcode (proj_in);
132 pto_t *in_pto = NULL;
133 pto_t *proj_pto = NULL; /* get_node_pto (proj); */
135 ir_node *proj_in_in = NULL;
138 case (iro_Start): /* ProjT (Start) */
139 assert (0 && "pto from ProjT(Start) requested");
142 case (iro_Proj): /* ProjT (Start), ProjT (Call) */
143 proj_in_in = get_Proj_pred (proj_in);
144 const opcode in_in_op = get_irn_opcode (proj_in_in);
145 const long proj_in_proj = get_Proj_proj (proj_in);
147 assert ((pn_Start_T_args == proj_in_proj) ||
148 (pn_Call_T_result == proj_in_proj));
151 case (iro_Start): /* ProjArg (ProjT (Start)) */
152 /* then the pto value must have been set to the node */
153 proj_pto = get_node_pto (proj);
157 case (iro_Call): /* ProjV (ProjT (Call)) */
158 if (NULL != proj_pto) {
161 in_pto = get_pto (proj_in, env);
162 set_node_pto (proj, in_pto);
168 default: assert (0 && "Proj(Proj(?))");
170 /* done with case (in_op == iro_Proj) */
172 case (iro_Load): /* ProjV (Load) */
173 assert (pn_Load_res == proj_proj);
175 case (iro_Call): /* ProjT (Call) */
177 case (iro_Alloc): /* ProjV (Alloc) */
178 if (NULL != proj_pto) {
181 in_pto = get_pto (proj_in, env);
184 set_node_pto (proj, in_pto);
188 fprintf (stderr, "%s: not handled: proj (%s[%li])\n",
190 get_op_name (get_irn_op (proj_in)),
191 get_irn_node_nr (proj_in));
192 assert (0 && "Proj(?)");
197 static pto_t *get_pto_phi (ir_node *phi, pto_env_t *env)
199 assert (mode_P == get_irn_mode (phi));
201 pto_t *pto = get_node_pto (phi);
204 assert (pto); /* must be initialised */
206 int n_ins = get_irn_arity (phi);
209 for (i = 0; i < n_ins; i ++) {
210 ir_node *in = get_irn_n (phi, i);
211 pto_t *in_pto = get_pto (in, env);
215 change |= qset_insert_all (pto->values, in_pto->values);
218 env->change |= change;
223 static pto_t *get_pto_sel (ir_node *sel, pto_env_t *env)
225 pto_t *pto = NULL; /* get_node_pto (sel); */
228 ir_node *in = get_Sel_ptr (sel);
230 pto = get_pto (in, env);
231 set_node_pto (sel, pto);
237 static pto_t *get_pto_ret (ir_node *ret, pto_env_t *env)
239 pto_t *pto = NULL; /* get_node_pto (ret); */
242 ir_node *in = get_Return_res (ret, 0);
244 pto = get_pto (in, env);
245 set_node_pto (ret, pto);
254 /* Dispatch to propagate PTO values */
255 static pto_t *get_pto (ir_node *node, pto_env_t *env)
257 const opcode op = get_irn_opcode (node);
259 DBGPRINT (2, (stdout, "%s (%s[%li])\n", __FUNCTION__,
260 OPNAME (node), OPNUM (node)));
263 case (iro_Cast): return (get_pto (get_Cast_op (node), env));
264 case (iro_Proj): return (get_pto_proj (node, env));
265 case (iro_Phi): return (get_pto_phi (node, env));
266 case (iro_Sel): return (get_pto_sel (node, env));
267 case (iro_Alloc): return (get_alloc_pto (node));
268 case (iro_Return): return (get_pto_ret (node, env));
270 case (iro_Call): /* FALLTHROUGH */
271 case (iro_Load): /* FALLTHROUGH */
272 case (iro_Const): /* FALLTHROUGH */
273 case (iro_SymConst):{
274 pto_t *pto = get_node_pto (node);
280 /* stopgap measure */
281 fprintf (stderr, "%s: not handled: node[%li].op = %s\n",
283 get_irn_node_nr (node),
284 get_op_name (get_irn_op (node)));
285 assert (0 && "something not handled");
291 /* Actions for the nodes: */
292 static void pto_load (ir_node *load, pto_env_t *pto_env)
295 DBGPRINT (2, (stdout, "%s (%s[%li]): pto = %p\n", __FUNCTION__,
296 OPNAME (load), OPNUM (load), (void*) get_node_pto (load)));
298 ir_node *ptr = get_Load_ptr (load);
300 if (is_dummy_load_ptr (ptr)) {
304 /* TODO: ONLY LOAD IFF LOAD.ENT.MODE == MODE_P */
306 entity *ent = get_ptr_ent (ptr);
308 if (mode_P == get_type_mode (get_entity_type (ent))) {
310 pto_t *ptr_pto = get_pto (ptr, pto_env);
314 DBGPRINT (1, (stdout, "%s (%s[%li]): ptr = %p\n", __FUNCTION__,
315 OPNAME (ptr), OPNUM (ptr), (void*) ptr_pto));
317 pto_env->change |= mod_load (load, ent, ptr_pto);
321 static void pto_store (ir_node *store, pto_env_t *pto_env)
324 DBGPRINT (2, (stdout, "%s (%s[%li]) (no pto)\n", __FUNCTION__,
325 OPNAME (store), OPNUM (store)));
327 ir_node *ptr = get_Store_ptr (store);
328 ir_node *val = get_Store_value (store);
330 if (mode_P != get_irn_mode (val)) {
334 entity *ent = get_ptr_ent (ptr);
336 pto_t *ptr_pto = get_pto (ptr, pto_env);
337 pto_t *val_pto = get_pto (val, pto_env);
342 DBGPRINT (2, (stdout, "%s (%s[%li]): ptr_pto = %p\n", __FUNCTION__,
343 OPNAME (ptr), OPNUM (ptr), (void*) ptr_pto));
344 DBGPRINT (2, (stdout, "%s (%s[%li]): val_pto = %p\n", __FUNCTION__,
345 OPNAME (val), OPNUM (val), (void*) val_pto));
347 pto_env->change |= mod_store (store, ent, ptr_pto, val_pto);
350 static void pto_method (ir_node *call, pto_env_t *pto_env)
352 DBGPRINT (2, (stdout, "%s:%i (%s[%li]): pto = %p\n",
353 __FUNCTION__, __LINE__, OPNAME (call), OPNUM (call),
354 (void*) get_node_pto (call)));
356 callEd_info_t *callEd_info = ecg_get_callEd_info (call);
358 if (NULL == callEd_info) {
359 DBGPRINT (2, (stdout, "%s:%i (%s[%li]), no graph\n",
360 __FUNCTION__, __LINE__, OPNAME (call), OPNUM (call)));
364 while (NULL != callEd_info) {
365 DBGPRINT (2, (stdout, "%s:%i (%s[%li]), graph %i\n",
366 __FUNCTION__, __LINE__, OPNAME (call), OPNUM (call), i ++));
368 pto_call (callEd_info->callEd, call, pto_env);
370 callEd_info = callEd_info->prev;
374 /* Perform the appropriate action on the given node */
375 static void pto_node_node (ir_node *node, pto_env_t *pto_env)
377 DBGPRINT (1, (stdout, "%s (%s[%li])\n", __FUNCTION__,
378 OPNAME (node), OPNUM (node)));
380 const opcode op = get_irn_opcode (node);
383 case (iro_Start): /* nothing */ break;
385 pto_load (node, pto_env);
389 pto_store (node, pto_env);
393 pto_method (node, pto_env);
397 pto_raise (node, pto_env);
409 pto_end_block (node, pto_env);
414 assert (mode_M == get_irn_mode (node));
418 /* uninteresting stuff: */
422 case (iro_DivMod): /* nothing to do */ break;
425 /* stopgap measure */
426 fprintf (stderr, "%s: not handled: node[%li].op = %s\n",
428 get_irn_node_nr (node),
429 get_op_name (get_irn_op (node)));
430 assert (0 && "something not handled");
435 /* Callback function to execute in pre-order */
436 static void pto_node_pre (ir_node *node, void *env)
441 /* Callback function to execute in post-order */
442 static void pto_node_post (ir_node *node, void *env)
444 pto_env_t *pto_env = (pto_env_t*) env;
446 pto_node_node (node, pto_env);
449 /* Perform a single pass over the given graph */
450 static void pto_graph_pass (ir_graph *graph, void *pto_env)
452 irg_walk_mem (graph, pto_node_pre, pto_node_post, pto_env);
455 /* Continue PTO for one of the graphs called at a Call */
456 static void pto_call (ir_graph *graph, ir_node *call, pto_env_t *pto_env)
461 DBGPRINT (1, (stdout, "%s:%i (%s[%li])\n",
462 __FUNCTION__, __LINE__, OPNAME (call), OPNUM (call)));
464 /* only for debugging stuff: */
465 entity *ent = get_irg_entity (graph);
466 const char *ent_name = (char*) get_entity_name (ent);
467 const char *own_name = (char*) get_type_name (get_entity_owner (ent));
469 if (! get_irg_is_mem_visited (graph)) {
470 graph_info_t *ginfo = ecg_get_info (graph);
473 int ctx_idx = find_ctx_idx (call, ginfo, get_curr_ctx ());
474 ctx_info_t *call_ctx = get_ctx (ginfo, ctx_idx);
475 ctx_info_t *old_ctx = set_curr_ctx (call_ctx);
476 DBGPRINT (3, (stdout, "%s>CTX: ", -- spaces));
477 DBGEXE (3, ecg_print_ctx (call_ctx, stdout));
479 /* Initialise Alloc Names and Node values */
480 pto_reset_graph_pto (graph, ctx_idx);
482 /* Compute Arguments */
483 set_graph_args (graph, call, pto_env);
485 /* Visit/Iterate Graph */
486 pto_graph (graph, ctx_idx);
489 set_curr_ctx (old_ctx);
491 change |= set_graph_result (graph, call);
493 DBGPRINT (3, (stdout, "%s<CTX: ", spaces ++));
494 DBGEXE (3, ecg_print_ctx (call_ctx, stdout));
496 /* Don't need to reset alloc names unless we handle recursion here */
499 /* Get Return Value from Graph */
501 DBGPRINT (2, (stdout, "%s: recursion into \"%s.%s\"\n",
502 __FUNCTION__, own_name, ent_name));
505 /* Todo: Set 'Unknown' Value as Return Value when the graph is not
508 pto_env->change |= change;
511 static void pto_raise (ir_node *raise, pto_env_t *pto_env)
514 DBGPRINT (2, (stdout, "%s (%s[%li]): pto = %p\n", __FUNCTION__,
515 OPNAME (raise), OPNUM (raise), (void*) get_node_pto (raise)));
518 static void pto_end_block (ir_node *end_block, pto_env_t *pto_env)
520 /* perform end block */
521 type *tp = get_entity_type (get_irg_entity (get_irn_irg (end_block)));
523 if (0 == get_method_n_ress (tp)) {
527 tp = get_method_res_type (tp, 0);
529 if (mode_P != get_type_mode (tp)) {
533 DBGPRINT (2, (stdout, "%s (%s[%li]): pto = %p\n", __FUNCTION__,
534 OPNAME (end_block), OPNUM (end_block),
535 (void*) get_node_pto (end_block)));
537 pto_t *end_pto = get_node_pto (end_block);
541 int n_ins = get_irn_arity (end_block);
543 for (i = 0; i < n_ins; i ++) {
544 ir_node *in = get_irn_n (end_block, i);
546 if (iro_Return == get_irn_opcode (in)) {
547 pto_t *in_pto = get_pto (in, pto_env);
549 pto_env->change |= qset_insert_all (end_pto->values, in_pto->values);
554 /* ===================================================
555 Exported Implementation:
556 =================================================== */
557 /* Main loop: Initialise and iterate over the given graph */
558 void pto_graph (ir_graph *graph, int ctx_idx)
560 /* Also exported, since we need it in 'pto.c' */
561 pto_env_t *pto_env = xmalloc (sizeof (pto_env_t));
562 pto_env->ctx_idx = ctx_idx;
563 pto_env->change = TRUE;
565 /* HERE ("start"); */
567 DBGPRINT (2, (stdout, "%s: start for ctx %i\n",
571 /* todo (here): iterate, obey 'changed' attribute */
573 while (0 != pto_env->change) {
575 pto_env->change = FALSE;
576 pto_graph_pass (graph, pto_env);
579 DBGPRINT (1, (stdout, "%s: %i runs on \"%s.%s\"\n",
582 get_type_name (get_entity_owner (get_irg_entity (graph))),
583 get_entity_name (get_irg_entity (graph))));
586 memset (pto_env, 0x00, sizeof (pto_env_t));
591 /* Set the PTO value for the given non-alloc node */
592 void set_node_pto (ir_node *node, pto_t *pto)
594 assert (iro_Alloc != get_irn_opcode (node));
596 set_irn_link (node, (void*) pto);
599 /*Get the PTO value for the given non-alloc node */
600 pto_t *get_node_pto (ir_node *node)
602 assert (iro_Alloc != get_irn_opcode (node));
604 return ((pto_t*) get_irn_link (node));
607 /* Set the PTO value for the given alloc node */
608 void set_alloc_pto (ir_node *alloc, alloc_pto_t *alloc_pto)
610 assert (iro_Alloc == get_irn_opcode (alloc));
614 set_irn_link (alloc, (void*) alloc_pto);
617 /*Get the current PTO value for the given alloc node */
618 pto_t *get_alloc_pto (ir_node *alloc)
620 alloc_pto_t *alloc_pto = (alloc_pto_t*) get_irn_link (alloc);
622 assert (iro_Alloc == get_irn_opcode (alloc));
624 assert (alloc_pto -> curr_pto);
626 return (alloc_pto -> curr_pto);
632 Revision 1.9 2004/12/15 13:31:18 liekweg
633 remove debugging stuff
635 Revision 1.8 2004/12/15 09:18:18 liekweg
638 Revision 1.7 2004/12/06 12:55:06 liekweg
641 Revision 1.6 2004/12/02 16:17:51 beck
642 fixed config.h include
644 Revision 1.5 2004/11/30 14:47:54 liekweg
645 fix initialisation; do correct iteration
647 Revision 1.4 2004/11/26 15:59:40 liekweg
648 verify pto_{load,store}
650 Revision 1.3 2004/11/24 14:53:55 liekweg
653 Revision 1.2 2004/11/20 21:21:56 liekweg
654 Finalise initialisation
656 Revision 1.1 2004/11/18 16:37:34 liekweg