5 * File name: ir/ana2/pto.c
9 * Created: Mon 18 Oct 2004
11 * Copyright: (c) 1999-2004 Universität Karlsruhe
12 * Licence: This file is protected by GPL - GNU GENERAL PUBLIC LICENSE.
20 # include "typalise.h"
25 # endif /* not defined TRUE */
33 # include "irnode_t.h"
42 static long ta_id = 0;
47 static typalise_t *typalise_proj (ir_node*);
51 Ctors, Dtors for typalise_t-s
53 static typalise_t *ta_exact (type *tp)
55 typalise_t *ta = (typalise_t*) xmalloc (sizeof (typalise_t));
56 ta->kind = type_exact;
60 assert (is_class_type (tp));
65 static typalise_t *ta_types (lset_t *set)
67 typalise_t *ta = (typalise_t*) xmalloc (sizeof (typalise_t));
68 ta->kind = type_types;
75 static typalise_t *ta_type (type *tp)
77 typalise_t *ta = (typalise_t*) xmalloc (sizeof (typalise_t));
82 assert (is_class_type (tp));
87 static void ta_delete (typalise_t *ta)
89 if (type_types == ta->kind) {
90 lset_destroy (ta->res.types);
96 ta->kind = type_invalid;
102 Helpers for inheritance, overwriting and stuff
105 Find out whether otype is a subtype of stype.
106 Return non-zero iff otype is a subtype of stype.
108 static int is_subtype (type *otype, type *stype)
110 int n_sub = get_class_n_subtypes (stype);
114 if (otype == stype) {
118 for (i = 0; (!is_sub) && (i < n_sub); i ++) {
119 type *sub = get_class_subtype (stype, i);
121 is_sub |= is_subtype (otype, sub);
130 Compute the closure of all subtypes of otype (including otype
133 static void _collect_subtypes (type *otype, lset_t *set)
137 lset_insert (set, otype);
139 n_sub = get_class_n_subtypes (otype);
140 for (i = 0; i < n_sub; i ++) {
141 type *sub = get_class_subtype (otype, i);
143 _collect_subtypes (sub, set);
147 static lset_t *subtype_closure (type *otype)
149 lset_t *set = lset_create ();
151 _collect_subtypes (otype, set);
157 Helper method for get_owner_types
159 static void _collect_owner_types (entity *method, ir_graph *graph, lset_t *tps)
163 /* search DOWNwards in clazz hierarchy */
165 if ((peculiarity_description == get_entity_peculiarity (method)) ||
166 (peculiarity_inherited == get_entity_peculiarity (method))) {
167 lset_insert (tps, get_entity_owner (method));
168 } else if (peculiarity_existent == get_entity_peculiarity (method)) {
169 ir_graph *ex_graph = get_entity_irg (method);
171 if ((NULL == ex_graph) || (ex_graph == graph)) {
172 /* wtf? they define the same graph again? well, whatever: */
173 lset_insert (tps, get_entity_owner (method));
175 /* aha: they define a new graph. can't have that, so bail out */
180 n_over = get_entity_n_overwrittenby (method);
181 for (i = 0; i < n_over; i ++) {
182 entity *ometh = get_entity_overwrittenby (method, i);
184 _collect_owner_types (ometh, graph, tps);
190 Collect all classes that use the given implementation of a method.
192 static lset_t *get_owner_types (ir_graph *graph)
194 lset_t *tps = lset_create ();
195 entity *meth = get_irg_entity (graph);
197 _collect_owner_types (meth, graph, tps);
203 Return a list containing all types of 'set' which are a subtype of 'type'.
205 static lset_t *filter_for_type (lset_t *set, type *stype)
207 type *curs = (type*) lset_first (set);
208 lset_t *lset = lset_create ();
210 while (NULL != curs) {
211 if (is_subtype (curs, stype)) {
212 lset_insert (lset, curs);
215 curs = lset_next (set);
225 Join 'one' and 'two'; both args are deallocated, result is freshly
228 static typalise_t *ta_join (typalise_t *one, typalise_t *two)
230 typalise_t *res = NULL;
233 case (type_invalid): { /* shut up, gcc */ }
236 case (type_invalid): { /* shut up, gcc */ }
238 if (one->res.type == two->res.type) {
241 lset_t *set = lset_create ();
242 lset_insert (set, one->res.type);
243 lset_insert (set, two->res.type);
244 res = ta_types (set);
252 lset_insert (two->res.types, one->res.type);
258 if (is_subtype (one->res.type, two->res.type)) {
262 lset_t *closure = subtype_closure (two->res.type);
263 lset_insert (closure, one->res.type);
274 case (type_invalid): { /* shut up, gcc */ }
276 res = ta_join (two, one);
279 lset_insert_all (one->res.types, two->res.types);
285 lset_t *closure = subtype_closure (two->res.type);
286 lset_append (one->res.types, closure);
296 case (type_invalid): { /* shut up, gcc */ }
298 res = ta_join (two, one);
301 res = ta_join (two, one);
304 type *one_type = one->res.type;
305 type *two_type = two->res.type;
307 if (is_subtype (one_type, two_type)) {
310 } else if (is_subtype (two_type, one_type)) {
314 lset_t *one_closure = subtype_closure (one->res.type);
315 lset_t *two_closure = subtype_closure (two->res.type);
317 lset_append (one_closure, two_closure);
322 res = ta_types (one_closure);
329 assert (res && "no result");
336 static const char *ta_name (typalise_t *ta)
338 # define BUF_SIZE 1024
339 static char buf [BUF_SIZE];
341 int len = sprintf (buf, "[%d] ", ta->id);
344 case (type_invalid): { /* shut up, gcc */ }
346 len += sprintf (buf+len, "only ");
347 strncat (buf, get_type_name (ta->res.type), BUF_SIZE);
350 len += sprintf (buf+len, "one_of ");
352 type *iter = lset_first (ta->res.types);
354 int size = BUF_SIZE - len - 1;
355 while ((NULL != iter) && (0 < size)) {
356 char *dest = strncat (buf, get_type_name (iter), size);
359 iter = lset_next (ta->res.types);
363 len += sprintf (buf+len, "poly ");
364 strncat (buf, get_type_name (ta->res.type), BUF_SIZE);
369 /* # undef BUF_SIZE */
371 # endif /* SHUT_UP_GCC */
374 Find out whether the given clazz uses the given implementation of a
375 method. Presumably, this is because clazz inherits the graph as
376 the implementation for a method.
378 static int uses_graph (type *clazz, entity *meth, ir_graph *graph)
380 type *g_clazz = get_entity_owner (meth);
381 int i, n_over, use = FALSE;
383 if (g_clazz == clazz) {
387 if (peculiarity_existent == get_entity_peculiarity (meth)) {
388 ir_graph *g_graph = get_entity_irg (meth);
390 if (g_graph != graph) {
395 /* else inherited or description */
396 n_over = get_entity_n_overwrittenby (meth); /* DOWN-wards */
397 for (i = 0; (i < n_over) && (!use); i ++) {
398 entity *over = get_entity_overwrittenby (meth, i);
400 use |= uses_graph (clazz, over, graph);
407 Check whether the given typalise_t includes the given type.
409 static int ta_supports (typalise_t *ta, ir_graph *graph)
412 case (type_invalid): { /* shut up, gcc */ }
415 lset_t *tps = get_owner_types (graph);
417 if (lset_contains (tps, ta->res.type)) {
426 entity *meth = get_irg_entity (graph);
427 type *tp = get_entity_owner (meth);
428 int res = is_subtype (tp, ta->res.type);
433 res = uses_graph (ta->res.type, meth, graph);
439 type *tp = get_entity_owner (get_irg_entity (graph));
441 return (lset_contains (ta->res.types, tp));
445 assert (0 && "invalid ta");
450 /* =========== WHAT ELSE ? =========== */
453 Helper to typalise (ir_node*)
456 Find an approximation to the given proj node's value's types
458 static typalise_t *typalise_proj (ir_node *proj)
460 typalise_t *res = NULL;
461 ir_node *proj_in = get_Proj_pred (proj);
463 if (iro_Proj == get_irn_opcode (proj_in)) {
464 /* fprintf (stdout, "\tProj (Proj)\n"); */
466 proj_in = get_Proj_pred (proj_in);
467 if (iro_Start == get_irn_opcode (proj_in)) {
468 ir_graph *graph = get_irn_irg (proj);
469 entity *meth = get_irg_entity (graph);
471 long n = get_Proj_proj (proj);
475 type *tp = get_entity_owner (meth);
477 /* res = ta_exact (tp); */
478 res = ta_type (tp); /* TODO */
481 type *tp = get_method_param_type (get_entity_type (meth), n);
482 if (is_pointer_type (tp)) {
483 tp = get_pointer_points_to_type (tp);
488 } else if (iro_Call == get_irn_opcode (proj_in)) {
489 /* call result ... 'whatever' */
490 /* hey, this is redundant (or the check for iro_Call further down) */
491 ir_node *call_ptr = get_Call_ptr (proj_in);
493 res = typalise (call_ptr);
495 fprintf (stdout, "\n Proj (Proj (%s)) not handled\n",
496 get_op_name (get_irn_op (proj_in)));
500 opcode op = get_irn_opcode (proj_in);
501 if ((iro_Load != op) && (iro_Alloc != op) && (iro_Call != op)) {
502 fprintf (stdout, "\n Proj (%s) not handled\n",
503 get_op_name (get_irn_op (proj_in)));
506 res = typalise (proj_in); /* everything else */
507 /* Proj (Load), Proj (New), Proj (Call) */
519 Given a set of graphs and a typalise_t, return the method (s) in
520 the set that are supported by the typalise_t. Also, deallocates
523 lset_t *filter_for_ta (lset_t *set, typalise_t *ta)
525 lset_t *res = lset_create ();
526 ir_graph *curs = (ir_graph*) lset_first (set);
528 while (NULL != curs) {
529 if (ta_supports (ta, curs)) {
530 lset_insert (res, curs);
533 curs = lset_next (set);
542 For the given ptr, do a quick check about what (class) types may be
545 typalise_t *typalise (ir_node *node)
547 opcode op = get_irn_opcode (node);
548 typalise_t *res = NULL;
552 /* casts always succeed */
553 typalise_t *ta = NULL;
554 type *tp = get_Cast_type (node);
556 if (is_pointer_type (tp)) {
557 tp = get_pointer_points_to_type (tp);
559 assert (is_class_type (tp));
561 ta = typalise (get_Cast_op (node));
563 if (NULL == ta) { /* no type found */
565 } else if (type_exact == ta->kind) { /* one type found */
566 /* nothing (maybe check cast? */
567 } else if (type_type == ta->kind) { /* some types found */
568 if (is_subtype (tp, ta->res.type)) {
569 ta->res.type = tp; /* assume cast is correct */
571 /* should assert (is_subtype (ta->res.type, tp)) */
573 } else if (type_types == ta->kind) {
574 lset_t *ftp = filter_for_type (ta->res.types, tp);
575 lset_destroy (ta->res.types);
583 res = typalise_proj (node);
587 ir_node *load_ptr = get_Load_ptr (node);
589 res = typalise (load_ptr);
594 /* it's call (sel (ptr)) or load (sel (ptr)) */
595 entity *ent = get_Sel_entity (node);
596 type *tp = get_entity_type (ent);
598 if (is_method_type (tp)) {
599 tp = get_entity_type (ent);
600 tp = get_method_res_type (tp, 0);
602 if (is_pointer_type (tp)) {
603 tp = get_pointer_points_to_type (tp);
607 } else if (is_class_type (tp)) {
608 tp = get_entity_type (ent);
610 if (is_pointer_type (tp)) {
611 tp = get_pointer_points_to_type (tp);
615 } else if (is_pointer_type (tp)) {
616 tp = get_pointer_points_to_type (tp);
619 assert (0 && "select not handled");
624 int n_ins = get_irn_arity (node);
626 ir_node *phi_in = NULL;
627 typalise_t *ta = NULL;
628 /* assert (0 && "Do we ever get here?"); */ /* apparently, we do. */
630 for (i = 0; i < n_ins; i ++) {
631 phi_in = get_irn_n (node, i);
632 ta = (NULL == ta) ? typalise (phi_in) : ta_join (ta, typalise (phi_in));
639 type *type = get_Alloc_type (node);
640 res = ta_exact (type);
644 /* presumably call (sel (proj (call))) */
645 ir_node *ptr = get_Call_ptr (node);
647 if (iro_Sel == get_irn_opcode (ptr)) {
648 meth = get_Sel_entity (ptr);
649 } else if (iro_SymConst == get_irn_opcode (ptr)) {
650 if (get_SymConst_kind (ptr) == symconst_addr_ent) {
651 meth = get_SymConst_entity (ptr);
653 meth = NULL; /* WTF? */
658 type *tp = get_method_res_type ((type*) meth, 0);
661 /* could be anything */
662 /* fprintf (stdout, "meth= (null)"); */
666 fprintf (stdout, "]\n");
670 case (iro_SymConst): {
671 if (get_SymConst_kind (node) == symconst_type_tag) {
672 type *tp = get_SymConst_type (node);
675 } else if (get_SymConst_kind (node) == symconst_addr_ent) {
676 entity *ent = get_SymConst_entity (node);
677 type *tp = get_entity_type (ent);
678 tp = get_pointer_points_to_type (tp);
679 assert (is_class_type (tp));
681 res = ta_type (tp); /* can't use ta_exact */
683 fprintf (stdout, "can't handle SymConst %s?\n",
684 get_op_name (get_irn_op (node)));
695 fprintf (stdout, "what's with %s?\n", get_op_name (get_irn_op (node)));
709 Revision 1.4 2004/12/21 15:50:18 beck
710 removed C99 constructs
712 Revision 1.3 2004/12/02 16:17:51 beck
713 fixed config.h include
715 Revision 1.2 2004/10/22 09:53:10 liekweg
716 Correctly handle proj_args
718 Revision 1.1 2004/10/21 11:09:37 liekweg
719 Moved memwalk stuf into irmemwalk
720 Moved lset stuff into lset
721 Moved typalise stuff into typalise