2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Construction and removal of interprocedural representation
23 * (explicit interprocedural dependencies).
24 * @author Hubert Schmid
30 #ifdef INTERPROCEDURAL_VIEW
46 /* Return the current state of the interprocedural view. */
47 ip_view_state get_irp_ip_view_state(void) {
51 /* Set the current state of the interprocedural view. */
52 static void set_irp_ip_view(ip_view_state state) {
56 /* Set the state of the interprocedural view to invalid. */
57 void set_irp_ip_view_invalid(void) {
58 set_irp_ip_view(ip_view_invalid);
62 /* Data for each method */
64 int count; /* Number of calleers. */
65 bool open; /* Open method: called by an unknown caller */
66 ir_node * reg, * mem, ** res; /* EndReg, Mem and Method return values */
67 ir_node * except, * except_mem; /* EndExcept and Mem for exception return */
70 static irg_data_t * irg_data_create(void)
72 return XMALLOCZ(irg_data_t);
75 /** Count the number of callers of each method and mark open methods.
77 * Fills the irg_data data structure.
78 * Open methods are methods with an unknown caller, I.e., methods that
79 * - are external visible
80 * - are dereferenced somewhere within the program (i.e., the address of the
81 * method is stored somewhere). */
82 static void caller_init(int arr_length, ir_entity ** free_methods) {
84 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
85 set_entity_link(get_irg_entity(get_irp_irg(i)), irg_data_create());
87 for (i = arr_length - 1; i >= 0; --i) {
88 irg_data_t * data = get_entity_link(free_methods[i]);
91 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
92 ir_graph * irg = get_irp_irg(i);
94 /* We collected all call nodes in a link list at the end node. */
95 for (call = get_irn_link(get_irg_end(irg)); call; call = get_irn_link(call)) {
96 if (!is_Call(call)) continue;
97 for (j = get_Call_n_callees(call) - 1; j >= 0; --j) {
98 ir_entity * ent = get_Call_callee(call, j);
99 if (get_entity_irg(ent)) {
100 irg_data_t * data = get_entity_link(ent);
102 assert(get_entity_irg(ent) && data);
104 # endif /* ndef CATE_jni */
106 set_entity_link(ent, NULL);
114 static inline ir_node * tail(ir_node * node) {
116 for (; (link = get_irn_link(node)); node = link) ;
121 /* Call-Operationen an die "link"-Liste von "call_tail" anhängen (und
122 * "call_tail" aktualisieren), Proj-Operationen in die Liste ihrer Definition
123 * (auch bei Proj->Call Operationen) und Phi-Operationen in die Liste ihres
124 * Grundblocks einfügen. */
125 static void collect_phicallproj_walker(ir_node * node, ir_node ** call_tail) {
127 /* Die Liste von Call an call_tail anhängen. */
129 assert(get_irn_link(*call_tail) == NULL);
130 set_irn_link(*call_tail, node);
131 /* call_tail aktualisieren: */
132 for (link = get_irn_link(*call_tail); link; *call_tail = link, link = get_irn_link(link)) ;
133 } else if (get_irn_op(node) == op_Proj) {
134 ir_node * head = skip_Proj(get_Proj_pred(node));
135 set_irn_link(node, get_irn_link(head));
136 set_irn_link(head, node);
137 /* call_tail gegebenenfalls aktualisieren: */
138 if (head == *call_tail) {
141 } else if (get_irn_op(node) == op_Phi) {
142 ir_node * block = get_nodes_block(node);
143 set_irn_link(node, get_irn_link(block));
144 set_irn_link(block, node);
149 static void link(ir_node * head, ir_node * node) {
151 set_irn_link(node, get_irn_link(head));
152 set_irn_link(head, node);
157 /* Die Call-Operationen aller Graphen an den End-Operationen
158 * verlinken, die Proj-Operationen an ihren Definitionen und die
159 * Phi-Operationen an ihren Grundblöcken. Die Liste der Calls sieht
160 * dann so aus: End -> Call -> Proj -> ... -> Proj -> Call -> Proj ->
161 * ... -> Proj -> NULL. */
162 static void collect_phicallproj(void) {
165 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
166 ir_graph * irg = get_irp_irg(i);
167 ir_node * start = get_irg_start(irg);
168 ir_node * end = get_irg_end(irg);
169 current_ir_graph = irg;
170 assert(irg && start);
172 set_using_irn_link(irg);
174 /* Die speziellen Parameter der Start-Operation extra verlinken,
175 * auch wenn sie nicht im intraprozeduralen Graphen erreichbar
177 link(start, get_irg_frame(irg));
179 irg_walk_graph(irg, firm_clear_link, (irg_walk_func *) collect_phicallproj_walker, &end);
181 clear_using_irn_link(irg);
186 /* Proj-Operation durch Filter-Operation im aktuellen Block ersetzen. */
187 static ir_node * exchange_proj(ir_node * proj) {
189 assert(get_irn_op(proj) == op_Proj);
190 filter = new_Filter(get_Proj_pred(proj), get_irn_mode(proj), get_Proj_proj(proj));
191 /* Die Proj- (Id-) Operation sollte im gleichen Grundblock stehen, wie die
192 * Filter-Operation. */
193 set_nodes_block(proj, get_nodes_block(filter));
194 exchange(proj, filter);
199 /* Echt neue Block-Operation erzeugen. CSE abschalten! */
200 static ir_node * create_Block(int n, ir_node ** in) {
201 /* Turn off optimizations so that blocks are not merged again. */
202 int rem_opt = get_opt_optimize();
205 block = new_Block(n, in);
206 set_optimize(rem_opt);
211 static void prepare_irg_end(ir_graph * irg, irg_data_t * data);
212 static void prepare_irg_end_except(ir_graph * irg, irg_data_t * data);
215 /* If we use new_Unknown we get the Unknown of a graph. This can
216 * cause cycles we don't want to see, as Unknwon is in the Start Block
217 * of the procedure. Use unknown of outermost irg where the start
218 * block has no predecessors. */
219 static inline ir_node *get_cg_Unknown(ir_mode *m) {
220 assert((get_Block_n_cfgpreds(get_irg_start_block(get_irp_main_irg())) == 1) &&
221 (get_nodes_block(get_Block_cfgpred(get_irg_start_block(get_irp_main_irg()), 0)) ==
222 get_irg_start_block(get_irp_main_irg())));
223 return new_r_Unknown(get_irp_main_irg(), m);
227 /* IRG vorbereiten. Proj-Operationen der Start-Operation in Filter-Operationen
228 * umwandeln. Die künstlichen Steuerzusammenflüsse EndReg und EndExcept
229 * einfügen. An der Start-Operation hängt nach dem Aufruf eine Liste der
230 * entsprechenden Filter-Knoten. */
231 static void prepare_irg(ir_graph * irg, irg_data_t * data) {
232 ir_node * start_block = get_irg_start_block(irg);
233 ir_node * link, * proj;
234 int n_callers = data->count + (data->open ? 1 : 0);
235 ir_node ** in = NEW_ARR_F(ir_node *, n_callers);
237 current_ir_graph = irg;
238 set_irg_current_block(irg, start_block);
240 /* Grundblock interprozedural machen. */
241 /* "in" ist nicht initialisiert. Das passiert erst in "construct_start". */
242 set_Block_cg_cfgpred_arr(start_block, n_callers, in);
243 /* Proj-Operationen durch Filter-Operationen ersetzen und (sonst) in
244 * den Start-Block verschieben. */
245 for (proj = get_irn_link(get_irg_start(irg)); proj; proj = get_irn_link(proj)) {
246 if (get_Proj_pred(proj) != get_irg_start(irg)
247 || (get_Proj_proj(proj) != pn_Start_X_initial_exec && get_Proj_proj(proj) != pn_Start_T_args)) {
248 ir_node * filter = exchange_proj(proj);
249 set_Filter_cg_pred_arr(filter, n_callers, in);
251 set_nodes_block(proj, start_block);
257 /* Liste der Filter-Operationen herstellen. Dabei muss man beachten,
258 * dass oben für "verschiedene" Proj-Operationen wegen CSE nur eine
259 * Filter-Operation erzeugt worden sein kann. */
260 for (link = get_irg_start(irg), proj = get_irn_link(link); proj; proj = get_irn_link(proj)) {
261 if (is_Id(proj)) { /* replaced with filter */
262 ir_node * filter = get_Id_pred(proj);
263 assert(is_Filter(filter));
264 if (filter != link && get_irn_link(filter) == NULL) {
265 set_irn_link(link, filter);
270 /* Globle Einträge für ersetzte Operationen korrigieren. */
271 set_irg_initial_exec(irg, skip_Id(get_irg_initial_exec(irg)));
272 set_irg_frame (irg, skip_Id(get_irg_frame(irg)));
273 set_irg_initial_mem (irg, skip_Id(get_irg_initial_mem(irg)));
275 /* Unbekannten Aufrufer sofort eintragen. */
277 set_Block_cg_cfgpred(start_block, 0, get_cg_Unknown(mode_X));
278 for (proj = get_irn_link(get_irg_start(irg)); proj; proj = get_irn_link(proj)) {
279 if (is_Filter(proj)) {
280 set_Filter_cg_pred(proj, 0, get_cg_Unknown(get_irn_mode(proj)));
288 prepare_irg_end(irg, data);
289 prepare_irg_end_except(irg, data);
293 /* Künstlicher Steuerzusammenfluss EndReg einfügen. */
294 static void prepare_irg_end(ir_graph * irg, irg_data_t * data) {
295 ir_node * end_block = get_irg_end_block(irg);
296 ir_node * end = get_irg_end(irg);
297 ir_node **ret_arr = NULL;
298 ir_node **cfgpred_arr = get_Block_cfgpred_arr(end_block);
302 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
303 if (is_Return(cfgpred_arr[i])) {
305 ARR_APP1(ir_node *, ret_arr, cfgpred_arr[i]);
307 ret_arr = NEW_ARR_F(ir_node *, 1);
308 ret_arr[0] = cfgpred_arr[i];
315 int n_res = get_method_n_ress(get_entity_type(get_irg_entity(irg)));
316 ir_node ** in = NEW_ARR_F(ir_node *, n_ret);
319 for (i = n_ret - 1; i >= 0; --i) {
320 set_irg_current_block(irg, get_nodes_block(ret_arr[i]));
323 create_Block(n_ret, in);
326 data->reg = new_EndReg();
329 for (i = n_ret - 1; i >= 0; --i) {
330 in[i] = get_Return_mem(ret_arr[i]);
332 data->mem = new_Phi(n_ret, in, mode_M);
333 /* This Phi is a merge, therefore needs not be kept alive.
334 It might be optimized away, though. */
335 if (get_End_keepalive(end, get_End_n_keepalives(end)-1 ) == data->mem)
336 set_End_keepalive(end, get_End_n_keepalives(end)-1, new_Bad());
339 data->res = NEW_ARR_F(ir_node *, n_res);
340 for (j = n_res - 1; j >= 0; --j) {
341 ir_mode *mode = NULL;
342 /* In[0] could be a Bad node with wrong mode. */
343 for (i = n_ret - 1; i >= 0; --i) {
344 in[i] = get_Return_res(ret_arr[i], j);
345 if (!mode && get_irn_mode(in[i]) != mode_T)
346 mode = get_irn_mode(in[i]);
349 data->res[j] = new_Phi(n_ret, in, mode);
350 else /* All preds are Bad */
351 data->res[j] = new_Bad();
357 if (ret_arr) DEL_ARR_F(ret_arr);
361 /* Künstlicher Steuerzusammenfluss EndExcept einfügen. */
362 static void prepare_irg_end_except(ir_graph * irg, irg_data_t * data) {
363 ir_node * end_block = get_irg_end_block(irg);
364 ir_node * end = get_irg_end(irg);
365 ir_node ** except_arr = NULL;
368 ir_node ** cfgpred_arr = get_Block_cfgpred_arr(end_block);
369 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
370 if (! is_Return(cfgpred_arr[i])) {
372 ARR_APP1(ir_node *, except_arr, cfgpred_arr[i]);
374 except_arr = NEW_ARR_F(ir_node *, 1);
375 except_arr[0] = cfgpred_arr[i];
381 ir_node ** in = NEW_ARR_F(ir_node *, n_except);
383 create_Block(n_except, except_arr);
385 data->except = new_EndExcept();
387 for (i = n_except - 1; i >= 0; --i) {
388 ir_node *node = skip_Proj(skip_Tuple(except_arr[i]));
389 ir_op *op = get_irn_op(node);
391 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_Call_M_except);
392 } else if (op == op_Raise) {
393 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_Raise_M);
394 } else if (op == op_CopyB) {
395 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_CopyB_M_except);
397 assert(is_fragile_op(node));
398 /* We rely that all cfops have the memory output at the same position. */
399 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, 0);
402 data->except_mem = new_Phi(n_except, in, mode_M);
403 /* This Phi is a merge, therefor needs not be kept alive.
404 It might be optimized away, though. */
405 if (get_End_keepalive(end, get_End_n_keepalives(end)-1 )
407 set_End_keepalive(end, get_End_n_keepalives(end)-1, new_Bad());
410 if (except_arr) DEL_ARR_F(except_arr);
414 /* Zwischengespeicherte Daten wieder freigeben. */
415 static void cleanup_irg(ir_graph * irg) {
416 ir_entity * ent = get_irg_entity(irg);
417 irg_data_t * data = get_entity_link(ent);
419 if (data->res) DEL_ARR_F(data->res);
420 set_entity_link(ent, NULL);
425 /* Alle Phi-Operationen aus "from_block" nach "to_block"
426 * verschieben. Die Phi-Operationen müssen am zugehörigen Grundblock
427 * verlinkt sein. Danach sind sie am neuen Grundblock verlinkt. */
428 static void move_phis(ir_node * from_block, ir_node * to_block) {
430 for (phi = get_irn_link(from_block); phi != NULL; phi = get_irn_link(phi)) {
431 set_nodes_block(phi, to_block);
433 assert(get_irn_link(to_block) == NULL);
434 set_irn_link(to_block, get_irn_link(from_block));
435 set_irn_link(from_block, NULL);
439 /* Rekursiv die Operation "node" und alle ihre Vorgänger aus dem Block
440 * "from_block" nach "to_block" verschieben.
441 * Verschiebe ebenfalls die Projs aus diesen Operationen. */
442 static void move_nodes(ir_node * from_block, ir_node * to_block, ir_node * node) {
443 int i, arity = get_irn_arity(node);
446 for (i = arity - 1; i >= 0; --i) {
447 ir_node * pred = get_irn_n(node, i);
448 if (get_nodes_block(pred) == from_block) {
449 move_nodes(from_block, to_block, pred);
452 set_nodes_block(node, to_block);
454 /* Move projs of this node. */
455 proj = get_irn_link(node);
456 for (; proj; proj = skip_Id(get_irn_link(proj))) {
457 if (get_irn_op(proj) != op_Proj && !is_Filter(proj)) continue;
458 if ((get_nodes_block(proj) == from_block) && (skip_Proj(get_irn_n(proj, 0)) == node))
459 set_nodes_block(proj, to_block);
464 /* Abhängigkeiten vom Start-Block und den Filter-Operationen im
465 * Start-Block auf den Aufrufer hinzufügen. */
466 static void construct_start(ir_entity * caller, ir_entity * callee,
467 ir_node * call, ir_node * exec)
469 irg_data_t *data = get_entity_link(callee);
470 ir_graph *irg = get_entity_irg(callee);
471 ir_node *start = get_irg_start(irg);
476 assert(get_entity_peculiarity(callee) == peculiarity_existent); /* Else data is not initalized. */
477 assert((0 <= data->count) &&
478 (data->count < get_Block_cg_n_cfgpreds(get_nodes_block(start))));
480 set_Block_cg_cfgpred(get_nodes_block(start), data->count, exec);
481 for (filter = get_irn_link(start); filter; filter = get_irn_link(filter)) {
482 if (!is_Filter(filter)) continue;
483 if (get_Proj_pred(filter) == start) {
484 switch ((int) get_Proj_proj(filter)) {
486 set_Filter_cg_pred(filter, data->count, get_Call_mem(call));
488 case pn_Start_P_frame_base:
489 /* "frame_base" wird nur durch Unknown dargestellt. Man kann ihn aber
490 * auch explizit darstellen, wenn sich daraus Vorteile für die
491 * Datenflussanalyse ergeben. */
492 set_Filter_cg_pred(filter, data->count, get_cg_Unknown(get_irn_mode(filter)));
494 case pn_Start_P_globals:
495 /* "globals" wird nur durch Unknown dargestellt. Man kann ihn aber auch
496 * explizit darstellen, wenn sich daraus Vorteile für die
497 * Datenflussanalyse ergeben. */
498 set_Filter_cg_pred(filter, data->count, get_cg_Unknown(get_irn_mode(filter)));
502 assert(0 && "not reached");
506 set_Filter_cg_pred(filter, data->count, get_Call_param(call, get_Proj_proj(filter)));
513 /* Abhängigkeiten für den Speicherzustand über alle aufgerufenen
514 * Methoden bestimmen. */
515 static void fill_mem(int length, irg_data_t * data[], ir_node * in[]) {
517 for (i = 0; i < length; ++i) {
518 if (data[i]) { /* explicit */
520 in[i] = data[i]->mem;
524 } else { /* unknown */
525 in[i] = get_cg_Unknown(mode_M);
531 /* Abhängigkeiten für den Ausnahme-Speicherzustand über alle
532 * aufgerufenen Methoden bestimmen. */
533 static void fill_except_mem(int length, irg_data_t * data[], ir_node * in[]) {
535 for (i = 0; i < length; ++i) {
536 if (data[i]) { /* explicit */
537 if (data[i]->except) {
538 in[i] = data[i]->except_mem;
542 } else { /* unknown */
543 in[i] = get_cg_Unknown(mode_M);
549 /* Abhängigkeiten für ein Ergebnis über alle aufgerufenen Methoden
551 static void fill_result(int pos, int length, irg_data_t * data[], ir_node * in[], ir_mode *m) {
553 for (i = 0; i < length; ++i) {
554 if (data[i]) { /* explicit */
556 in[i] = data[i]->res[pos];
560 } else { /* unknown */
561 in[i] = get_cg_Unknown(m);
567 /* Proj auf Except-X einer Call-Operation (aus der Link-Liste) bestimmen. */
568 static ir_node * get_except(ir_node * call) {
569 /* Mit CSE könnte man das effizienter machen! Die Methode wird aber für jede
570 * Aufrufstelle nur ein einziges Mal aufgerufen. */
572 for (proj = get_irn_link(call); proj && get_irn_op(proj) == op_Proj; proj = get_irn_link(proj)) {
573 if (get_Proj_proj(proj) == 1 && is_Call(get_Proj_pred(proj))) {
580 /* Returns true if control flow operation exc is predecessor of end
581 block in irg. Works also for Return nodes, not only exceptions. */
582 static bool exc_branches_to_end(ir_graph *irg, ir_node *exc) {
584 ir_node *end = get_irg_end_block(irg);
585 for (i = get_Block_n_cfgpreds(end) -1; i >= 0; --i)
586 if (get_Block_cfgpred(end, i) == exc) return true;
590 /* Returns true if only caller of irg is "Unknown". */
591 static bool is_outermost_graph(ir_graph *irg) {
592 irg_data_t * data = get_entity_link(get_irg_entity(irg));
595 } else if (data->open) {
596 /* Die Methode wird nur von "der" unbekannten Aufrufstelle
597 * aufgerufen. Darstellung wird für diese Methode nicht
600 /* Methode kann nicht aufgerufen werden. Die Darstellung wird
601 * für diese Methode nicht geändert. Das kann nicht vorkommen,
602 * wenn zuvor "gc_irgs()" aufgerufen wurde. */
607 #ifdef INTERPROCEDURAL_VIEW
608 /* Grundblock der Call-Operation aufteilen. CallBegin- und Filter-Operationen
609 * einfügen. Die Steuer- und Datenflussabhängigkeiten von den aufgerufenen
610 * Methoden auf die CallBegin-Operation, und von der Aufrufstelle auf die
611 * aufgerufenen Methoden eintragen. */
612 static void construct_call(ir_node * call) {
614 ir_node *post_block, *pre_block, *except_block, * proj, *jmp, *call_begin;
617 ir_entity ** callees;
621 n_callees = get_Call_n_callees(call);
622 post_block = get_nodes_block(call); /* block nach dem Aufruf */
623 pre_block = create_Block(get_Block_n_cfgpreds(post_block),
624 get_Block_cfgpred_arr(post_block)); /* block vor dem Aufruf (mit CallBegin) */
626 jmp = new_Break(); /* Sprung für intraprozedurale Darstellung (in * pre_block) */
627 call_begin = new_CallBegin(call); /* (in pre_block) */
628 /* CallBegin might be entry to endless recursion. */
629 add_End_keepalive(get_irg_end(get_irn_irg(pre_block)), pre_block);
631 in = NEW_ARR_F(ir_node *, n_callees);
632 caller = get_irg_entity(current_ir_graph); /* entity des aktuellen ir_graph */
633 callees = NEW_ARR_F(ir_entity *, n_callees); /* aufgerufene Methoden: entity */
634 irgs = NEW_ARR_F(ir_graph *, n_callees); /* aufgerufene Methoden: ir_graph */
635 data = NEW_ARR_F(irg_data_t *, n_callees); /* aufgerufene Methoden: irg_data_t */
637 /* post_block kann bereits interprozedurale Steuerflussvorgänger
638 * besitzen. Diese müssen dann auch noch für den pre_block gesetzt werden. */
639 if (get_Block_cg_cfgpred_arr(post_block)) {
640 set_Block_cg_cfgpred_arr(pre_block, get_Block_cg_n_cfgpreds(post_block),
641 get_Block_cg_cfgpred_arr(post_block));
642 remove_Block_cg_cfgpred_arr(post_block);
645 /* Operationen verschieben */
646 move_phis(post_block, pre_block);
647 move_nodes(post_block, pre_block, call);
648 set_irn_in(post_block, 1, &jmp);
650 /* Wiederverwendete Daten initialisieren. */
651 for (i = 0; i < n_callees; ++i) {
652 callees[i] = get_Call_callee(call, i);
653 irgs[i] = get_entity_irg(callees[i]);
654 data[i] = get_entity_link(callees[i]);
655 /* Only entities that have an irg got a irg_data data structure.
656 In others there is some arbitrary garbage in the link field. */
657 if (!irgs[i]) { assert(!data[i]); data[i] = NULL; }
661 * Set flag to suppress verifying placement on proper irg:
662 * optimization can return block on other irg.
664 set_interprocedural_view(1);
666 /* Die interprozeduralen Steuerflussvorgänger des post_block
668 for (i = 0; i < n_callees; ++i) {
669 if (data[i]) { /* explicit */
671 in[i] = new_r_Proj(irgs[i], get_nodes_block(data[i]->reg),
672 data[i]->reg, mode_X, data[i]->count);
676 } else { /* unknown */
677 in[i] = get_cg_Unknown(mode_X);
680 set_interprocedural_view(0);
682 set_Block_cg_cfgpred_arr(post_block, n_callees, in);
684 /* Die interprozeduralen Steuerflussvorgänger des except_block
686 if ((proj = get_except(call)) != NULL) {
688 bool exc_to_end = false;
689 if (exc_branches_to_end(current_ir_graph, proj)) {
690 /* The Call aborts the procedure if it returns with an exception.
691 If this is an outermost procedure, the normal handling of exceptions
692 will generate a Break that goes to the end block. This is illegal
693 Frim. So directly branch to the end block with all exceptions. */
695 if (is_outermost_graph(current_ir_graph)) {
696 except_block = get_irg_end_block(current_ir_graph);
698 irg_data_t * tmp_data = get_entity_link(get_irg_entity(current_ir_graph));
699 except_block = get_nodes_block(tmp_data->except);
702 except_block = create_Block(1, &proj);
703 set_nodes_block(proj, except_block);
704 exchange(proj, new_Break());
705 set_irg_current_block(current_ir_graph, pre_block);
706 set_irn_n(except_block, 0, new_Proj(call, mode_X, pn_Call_X_except));
707 set_irg_current_block(current_ir_graph, post_block);
711 * Set flag to suppress verifying placement on proper irg:
712 * optimization can return block on other irg.
714 set_interprocedural_view(1);
716 for (i = 0; i < n_callees; ++i) {
717 ir_entity * callee = get_Call_callee(call, i);
718 if (data[i]) { /* explicit */
719 if (data[i]->except) {
720 in[i] = new_r_Proj(get_entity_irg(callee), get_nodes_block(data[i]->except),
721 data[i]->except, mode_X, data[i]->count);
725 } else { /* unknown */
726 in[i] = get_cg_Unknown(mode_X);
732 /* append all existing preds of the end block to new in array.
733 * Normal access routine guarantees that with first visit we
734 * get the normal preds, and from then on the _cg_ preds.
735 * (interprocedural view is set!)
736 * Do not add the exc pred of end we are replacing! */
737 for (i = get_Block_n_cfgpreds(except_block)-1; i >= 0; --i) {
738 ir_node *pred = get_Block_cfgpred(except_block, i);
740 ARR_APP1(ir_node *, in, pred);
745 set_Block_cg_cfgpred_arr(except_block, preds, in);
747 set_interprocedural_view(0);
749 /* Diesen Vorgänger in den Start-Blöcken der aufgerufenen Methoden
751 set_irg_current_block(current_ir_graph, pre_block);
752 for (i = 0; i < n_callees; ++i) {
753 if (irgs[i]) /* Else there is not graph to call */
754 construct_start(caller, callees[i], call, new_Proj(call_begin, mode_X, i));
757 /* Proj-Operationen in Filter-Operationen umwandeln und
758 * interprozedurale Vorgänger einfügen. */
759 set_irg_current_block(current_ir_graph, post_block);
760 for (proj = get_irn_link(call); proj; proj = get_irn_link(proj)) {
761 if (get_irn_op(proj) != op_Proj) continue;
762 if (skip_Proj(get_Proj_pred(proj)) != call) continue;
763 if (get_Proj_pred(proj) == call) {
764 if (get_Proj_proj(proj) == pn_Call_M_regular) { /* memory */
767 set_nodes_block(proj, post_block);
768 filter = exchange_proj(proj);
769 /* filter in die Liste der Phis aufnehmen */
770 if (get_irn_link(filter) == NULL) { /* note CSE */
771 set_irn_link(filter, get_irn_link(post_block));
772 set_irn_link(post_block, filter);
774 fill_mem(n_callees, data, in);
775 set_Filter_cg_pred_arr(filter, n_callees, in);
776 } else if (get_Proj_proj(proj) == pn_Call_X_except) { /* except */
777 /* nothing: siehe oben */
778 } else if (get_Proj_proj(proj) == pn_Call_T_result) { /* results */
780 } else if (get_Proj_proj(proj) == pn_Call_M_except) { /* except_mem */
783 set_nodes_block(proj, post_block);
784 assert(except_block);
785 set_irg_current_block(current_ir_graph, except_block);
786 filter = exchange_proj(proj);
787 /* filter in die Liste der Phis aufnehmen */
788 if (get_irn_link(filter) == NULL) { /* note CSE */
789 set_irn_link(filter, get_irn_link(except_block));
790 set_irn_link(except_block, filter);
792 set_irg_current_block(current_ir_graph, post_block);
793 fill_except_mem(n_callees, data, in);
794 set_Filter_cg_pred_arr(filter, n_callees, in);
796 assert(0 && "not reached");
798 } else { /* result */
801 assert(is_Proj(get_Proj_pred(proj)) && get_Proj_pred(get_Proj_pred(proj)) == call);
802 set_nodes_block(proj, post_block);
803 filter = exchange_proj(proj);
804 /* filter in die Liste der Phis aufnehmen */
805 if (get_irn_link(filter) == NULL) { /* not CSE */
806 set_irn_link(filter, get_irn_link(post_block));
807 set_irn_link(post_block, filter);
809 fill_result(get_Proj_proj(filter), n_callees, data, in, get_irn_mode(filter));
810 set_Filter_cg_pred_arr(filter, n_callees, in);
821 void cg_construct(int arr_len, ir_entity ** free_methods_arr) {
824 if (get_irp_ip_view_state() == ip_view_valid) return;
825 if (get_irp_ip_view_state() == ip_view_invalid) cg_destruct();
826 set_irp_ip_view(ip_view_valid);
828 collect_phicallproj();
831 caller_init(arr_len, free_methods_arr);
834 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
835 ir_graph * irg = get_irp_irg(i);
836 ir_entity * ent = get_irg_entity(irg);
837 irg_data_t * data = get_entity_link(ent);
839 prepare_irg(irg, data);
840 } else if (data->open) {
841 /* Die Methode wird nur von "der" unbekannten Aufrufstelle
842 * aufgerufen. Darstellung wird für diese Methode nicht
845 /* Methode kann nicht aufgerufen werden. Die Darstellung wird
846 * für diese Methode nicht geändert. Das kann nicht vorkommen,
847 * wenn zuvor "gc_irgs()" aufgerufen wurde. */
851 /* construct calls */
852 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
855 current_ir_graph = get_irp_irg(i);
856 for (node = get_irn_link(get_irg_end(current_ir_graph)); node; node = get_irn_link(node)) {
858 int j, n_callees = get_Call_n_callees(node);
859 for (j = 0; j < n_callees; ++j)
860 if (get_entity_irg(get_Call_callee(node, j)))
862 if (j < n_callees) /* There is an entity with a graph */
863 construct_call(node);
868 /* cleanup irgs: Abschlussarbeiten: Die Vorgänger der Methoden noch
869 * explizit setzen und die zwischengespeicherten Daten wieder
871 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
872 cleanup_irg(get_irp_irg(i));
878 static void destruct_walker(ir_node * node, void * env)
881 if (is_Block(node)) {
882 remove_Block_cg_cfgpred_arr(node);
883 /* Do not turn Break into Jmp. Better: merge blocks right away.
884 Well, but there are Breaks left.
885 See exc1 from ajacs-rts/Exceptions.java. */
886 if (get_Block_n_cfgpreds(node) == 1) {
887 ir_node *pred = get_Block_cfgpred(node, 0);
888 if (get_irn_op(pred) == op_Break)
889 exchange(node, get_nodes_block(pred));
891 } else if (is_Filter(node)) {
892 set_irg_current_block(current_ir_graph, get_nodes_block(node));
893 exchange(node, new_Proj(get_Filter_pred(node), get_irn_mode(node), get_Filter_proj(node)));
894 } else if (get_irn_op(node) == op_Break) {
895 set_irg_current_block(current_ir_graph, get_nodes_block(node));
896 exchange(node, new_Jmp());
897 } else if (is_Call(node)) {
898 remove_Call_callee_arr(node);
899 } else if (get_irn_op(node) == op_Proj) {
900 /* some ProjX end up in strange blocks. */
901 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
906 void cg_destruct(void) {
908 if (get_irp_ip_view_state() != ip_view_no) {
909 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
910 ir_graph * irg = get_irp_irg(i);
911 irg_walk_graph(irg, destruct_walker, firm_clear_link, NULL);
913 set_irg_initial_exec(irg, skip_Id(get_irg_initial_exec(irg)));
914 set_irg_frame (irg, skip_Id(get_irg_frame(irg)));
915 set_irg_initial_mem (irg, skip_Id(get_irg_initial_mem(irg)));
916 set_irg_end_reg (irg, get_irg_end(irg));
917 set_irg_end_except (irg, get_irg_end(irg));
919 set_irg_callee_info_state(irg, irg_callee_info_none);
922 set_irp_ip_view(ip_view_no);