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_cur_block(block);
207 set_optimize(rem_opt);
212 static void prepare_irg_end(ir_graph * irg, irg_data_t * data);
213 static void prepare_irg_end_except(ir_graph * irg, irg_data_t * data);
216 /* If we use new_Unknown we get the Unknown of a graph. This can
217 * cause cycles we don't want to see, as Unknwon is in the Start Block
218 * of the procedure. Use unknown of outermost irg where the start
219 * block has no predecessors. */
220 static inline ir_node *get_cg_Unknown(ir_mode *m) {
221 assert((get_Block_n_cfgpreds(get_irg_start_block(get_irp_main_irg())) == 1) &&
222 (get_nodes_block(get_Block_cfgpred(get_irg_start_block(get_irp_main_irg()), 0)) ==
223 get_irg_start_block(get_irp_main_irg())));
224 return new_r_Unknown(get_irp_main_irg(), m);
228 /* IRG vorbereiten. Proj-Operationen der Start-Operation in Filter-Operationen
229 * umwandeln. Die künstlichen Steuerzusammenflüsse EndReg und EndExcept
230 * einfügen. An der Start-Operation hängt nach dem Aufruf eine Liste der
231 * entsprechenden Filter-Knoten. */
232 static void prepare_irg(ir_graph * irg, irg_data_t * data) {
233 ir_node * start_block = get_irg_start_block(irg);
234 ir_node * link, * proj;
235 int n_callers = data->count + (data->open ? 1 : 0);
236 ir_node ** in = NEW_ARR_F(ir_node *, n_callers);
238 current_ir_graph = irg;
239 set_irg_current_block(irg, start_block);
241 /* Grundblock interprozedural machen. */
242 /* "in" ist nicht initialisiert. Das passiert erst in "construct_start". */
243 set_Block_cg_cfgpred_arr(start_block, n_callers, in);
244 /* Proj-Operationen durch Filter-Operationen ersetzen und (sonst) in
245 * den Start-Block verschieben. */
246 for (proj = get_irn_link(get_irg_start(irg)); proj; proj = get_irn_link(proj)) {
247 if (get_Proj_pred(proj) != get_irg_start(irg)
248 || (get_Proj_proj(proj) != pn_Start_X_initial_exec && get_Proj_proj(proj) != pn_Start_T_args)) {
249 ir_node * filter = exchange_proj(proj);
250 set_Filter_cg_pred_arr(filter, n_callers, in);
252 set_nodes_block(proj, start_block);
258 /* Liste der Filter-Operationen herstellen. Dabei muss man beachten,
259 * dass oben für "verschiedene" Proj-Operationen wegen CSE nur eine
260 * Filter-Operation erzeugt worden sein kann. */
261 for (link = get_irg_start(irg), proj = get_irn_link(link); proj; proj = get_irn_link(proj)) {
262 if (is_Id(proj)) { /* replaced with filter */
263 ir_node * filter = get_Id_pred(proj);
264 assert(is_Filter(filter));
265 if (filter != link && get_irn_link(filter) == NULL) {
266 set_irn_link(link, filter);
271 /* Globle Einträge für ersetzte Operationen korrigieren. */
272 set_irg_initial_exec(irg, skip_Id(get_irg_initial_exec(irg)));
273 set_irg_frame (irg, skip_Id(get_irg_frame(irg)));
274 set_irg_initial_mem (irg, skip_Id(get_irg_initial_mem(irg)));
276 /* Unbekannten Aufrufer sofort eintragen. */
278 set_Block_cg_cfgpred(start_block, 0, get_cg_Unknown(mode_X));
279 for (proj = get_irn_link(get_irg_start(irg)); proj; proj = get_irn_link(proj)) {
280 if (is_Filter(proj)) {
281 set_Filter_cg_pred(proj, 0, get_cg_Unknown(get_irn_mode(proj)));
289 prepare_irg_end(irg, data);
290 prepare_irg_end_except(irg, data);
294 /* Künstlicher Steuerzusammenfluss EndReg einfügen. */
295 static void prepare_irg_end(ir_graph * irg, irg_data_t * data) {
296 ir_node * end_block = get_irg_end_block(irg);
297 ir_node * end = get_irg_end(irg);
298 ir_node **ret_arr = NULL;
299 ir_node **cfgpred_arr = get_Block_cfgpred_arr(end_block);
303 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
304 if (is_Return(cfgpred_arr[i])) {
306 ARR_APP1(ir_node *, ret_arr, cfgpred_arr[i]);
308 ret_arr = NEW_ARR_F(ir_node *, 1);
309 ret_arr[0] = cfgpred_arr[i];
316 int n_res = get_method_n_ress(get_entity_type(get_irg_entity(irg)));
317 ir_node ** in = NEW_ARR_F(ir_node *, n_ret);
320 for (i = n_ret - 1; i >= 0; --i) {
321 set_irg_current_block(irg, get_nodes_block(ret_arr[i]));
324 create_Block(n_ret, in);
327 data->reg = new_EndReg();
330 for (i = n_ret - 1; i >= 0; --i) {
331 in[i] = get_Return_mem(ret_arr[i]);
333 data->mem = new_Phi(n_ret, in, mode_M);
334 /* This Phi is a merge, therefore needs not be kept alive.
335 It might be optimized away, though. */
336 if (get_End_keepalive(end, get_End_n_keepalives(end)-1 ) == data->mem)
337 set_End_keepalive(end, get_End_n_keepalives(end)-1, new_Bad());
340 data->res = NEW_ARR_F(ir_node *, n_res);
341 for (j = n_res - 1; j >= 0; --j) {
342 ir_mode *mode = NULL;
343 /* In[0] could be a Bad node with wrong mode. */
344 for (i = n_ret - 1; i >= 0; --i) {
345 in[i] = get_Return_res(ret_arr[i], j);
346 if (!mode && get_irn_mode(in[i]) != mode_T)
347 mode = get_irn_mode(in[i]);
350 data->res[j] = new_Phi(n_ret, in, mode);
351 else /* All preds are Bad */
352 data->res[j] = new_Bad();
358 if (ret_arr) DEL_ARR_F(ret_arr);
362 /* Künstlicher Steuerzusammenfluss EndExcept einfügen. */
363 static void prepare_irg_end_except(ir_graph * irg, irg_data_t * data) {
364 ir_node * end_block = get_irg_end_block(irg);
365 ir_node * end = get_irg_end(irg);
366 ir_node ** except_arr = NULL;
369 ir_node ** cfgpred_arr = get_Block_cfgpred_arr(end_block);
370 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
371 if (! is_Return(cfgpred_arr[i])) {
373 ARR_APP1(ir_node *, except_arr, cfgpred_arr[i]);
375 except_arr = NEW_ARR_F(ir_node *, 1);
376 except_arr[0] = cfgpred_arr[i];
382 ir_node ** in = NEW_ARR_F(ir_node *, n_except);
384 create_Block(n_except, except_arr);
386 data->except = new_EndExcept();
388 for (i = n_except - 1; i >= 0; --i) {
389 ir_node *node = skip_Proj(skip_Tuple(except_arr[i]));
390 ir_op *op = get_irn_op(node);
392 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_Call_M_except);
393 } else if (op == op_Raise) {
394 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_Raise_M);
395 } else if (op == op_CopyB) {
396 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_CopyB_M_except);
398 assert(is_fragile_op(node));
399 /* We rely that all cfops have the memory output at the same position. */
400 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, 0);
403 data->except_mem = new_Phi(n_except, in, mode_M);
404 /* This Phi is a merge, therefor needs not be kept alive.
405 It might be optimized away, though. */
406 if (get_End_keepalive(end, get_End_n_keepalives(end)-1 )
408 set_End_keepalive(end, get_End_n_keepalives(end)-1, new_Bad());
411 if (except_arr) DEL_ARR_F(except_arr);
415 /* Zwischengespeicherte Daten wieder freigeben. */
416 static void cleanup_irg(ir_graph * irg) {
417 ir_entity * ent = get_irg_entity(irg);
418 irg_data_t * data = get_entity_link(ent);
420 if (data->res) DEL_ARR_F(data->res);
421 set_entity_link(ent, NULL);
426 /* Alle Phi-Operationen aus "from_block" nach "to_block"
427 * verschieben. Die Phi-Operationen müssen am zugehörigen Grundblock
428 * verlinkt sein. Danach sind sie am neuen Grundblock verlinkt. */
429 static void move_phis(ir_node * from_block, ir_node * to_block) {
431 for (phi = get_irn_link(from_block); phi != NULL; phi = get_irn_link(phi)) {
432 set_nodes_block(phi, to_block);
434 assert(get_irn_link(to_block) == NULL);
435 set_irn_link(to_block, get_irn_link(from_block));
436 set_irn_link(from_block, NULL);
440 /* Rekursiv die Operation "node" und alle ihre Vorgänger aus dem Block
441 * "from_block" nach "to_block" verschieben.
442 * Verschiebe ebenfalls die Projs aus diesen Operationen. */
443 static void move_nodes(ir_node * from_block, ir_node * to_block, ir_node * node) {
444 int i, arity = get_irn_arity(node);
447 for (i = arity - 1; i >= 0; --i) {
448 ir_node * pred = get_irn_n(node, i);
449 if (get_nodes_block(pred) == from_block) {
450 move_nodes(from_block, to_block, pred);
453 set_nodes_block(node, to_block);
455 /* Move projs of this node. */
456 proj = get_irn_link(node);
457 for (; proj; proj = skip_Id(get_irn_link(proj))) {
458 if (get_irn_op(proj) != op_Proj && !is_Filter(proj)) continue;
459 if ((get_nodes_block(proj) == from_block) && (skip_Proj(get_irn_n(proj, 0)) == node))
460 set_nodes_block(proj, to_block);
465 /* Abhängigkeiten vom Start-Block und den Filter-Operationen im
466 * Start-Block auf den Aufrufer hinzufügen. */
467 static void construct_start(ir_entity * caller, ir_entity * callee,
468 ir_node * call, ir_node * exec)
470 irg_data_t *data = get_entity_link(callee);
471 ir_graph *irg = get_entity_irg(callee);
472 ir_node *start = get_irg_start(irg);
477 assert(get_entity_peculiarity(callee) == peculiarity_existent); /* Else data is not initalized. */
478 assert((0 <= data->count) &&
479 (data->count < get_Block_cg_n_cfgpreds(get_nodes_block(start))));
481 set_Block_cg_cfgpred(get_nodes_block(start), data->count, exec);
482 for (filter = get_irn_link(start); filter; filter = get_irn_link(filter)) {
483 if (!is_Filter(filter)) continue;
484 if (get_Proj_pred(filter) == start) {
485 switch ((int) get_Proj_proj(filter)) {
487 set_Filter_cg_pred(filter, data->count, get_Call_mem(call));
489 case pn_Start_P_frame_base:
490 /* "frame_base" wird nur durch Unknown dargestellt. Man kann ihn aber
491 * auch explizit darstellen, wenn sich daraus Vorteile für die
492 * Datenflussanalyse ergeben. */
493 set_Filter_cg_pred(filter, data->count, get_cg_Unknown(get_irn_mode(filter)));
495 case pn_Start_P_globals:
496 /* "globals" wird nur durch Unknown dargestellt. Man kann ihn aber auch
497 * explizit darstellen, wenn sich daraus Vorteile für die
498 * Datenflussanalyse ergeben. */
499 set_Filter_cg_pred(filter, data->count, get_cg_Unknown(get_irn_mode(filter)));
503 assert(0 && "not reached");
507 set_Filter_cg_pred(filter, data->count, get_Call_param(call, get_Proj_proj(filter)));
514 /* Abhängigkeiten für den Speicherzustand über alle aufgerufenen
515 * Methoden bestimmen. */
516 static void fill_mem(int length, irg_data_t * data[], ir_node * in[]) {
518 for (i = 0; i < length; ++i) {
519 if (data[i]) { /* explicit */
521 in[i] = data[i]->mem;
525 } else { /* unknown */
526 in[i] = get_cg_Unknown(mode_M);
532 /* Abhängigkeiten für den Ausnahme-Speicherzustand über alle
533 * aufgerufenen Methoden bestimmen. */
534 static void fill_except_mem(int length, irg_data_t * data[], ir_node * in[]) {
536 for (i = 0; i < length; ++i) {
537 if (data[i]) { /* explicit */
538 if (data[i]->except) {
539 in[i] = data[i]->except_mem;
543 } else { /* unknown */
544 in[i] = get_cg_Unknown(mode_M);
550 /* Abhängigkeiten für ein Ergebnis über alle aufgerufenen Methoden
552 static void fill_result(int pos, int length, irg_data_t * data[], ir_node * in[], ir_mode *m) {
554 for (i = 0; i < length; ++i) {
555 if (data[i]) { /* explicit */
557 in[i] = data[i]->res[pos];
561 } else { /* unknown */
562 in[i] = get_cg_Unknown(m);
568 /* Proj auf Except-X einer Call-Operation (aus der Link-Liste) bestimmen. */
569 static ir_node * get_except(ir_node * call) {
570 /* Mit CSE könnte man das effizienter machen! Die Methode wird aber für jede
571 * Aufrufstelle nur ein einziges Mal aufgerufen. */
573 for (proj = get_irn_link(call); proj && get_irn_op(proj) == op_Proj; proj = get_irn_link(proj)) {
574 if (get_Proj_proj(proj) == 1 && is_Call(get_Proj_pred(proj))) {
581 /* Returns true if control flow operation exc is predecessor of end
582 block in irg. Works also for Return nodes, not only exceptions. */
583 static bool exc_branches_to_end(ir_graph *irg, ir_node *exc) {
585 ir_node *end = get_irg_end_block(irg);
586 for (i = get_Block_n_cfgpreds(end) -1; i >= 0; --i)
587 if (get_Block_cfgpred(end, i) == exc) return true;
591 /* Returns true if only caller of irg is "Unknown". */
592 static bool is_outermost_graph(ir_graph *irg) {
593 irg_data_t * data = get_entity_link(get_irg_entity(irg));
596 } else if (data->open) {
597 /* Die Methode wird nur von "der" unbekannten Aufrufstelle
598 * aufgerufen. Darstellung wird für diese Methode nicht
601 /* Methode kann nicht aufgerufen werden. Die Darstellung wird
602 * für diese Methode nicht geändert. Das kann nicht vorkommen,
603 * wenn zuvor "gc_irgs()" aufgerufen wurde. */
608 #ifdef INTERPROCEDURAL_VIEW
609 /* Grundblock der Call-Operation aufteilen. CallBegin- und Filter-Operationen
610 * einfügen. Die Steuer- und Datenflussabhängigkeiten von den aufgerufenen
611 * Methoden auf die CallBegin-Operation, und von der Aufrufstelle auf die
612 * aufgerufenen Methoden eintragen. */
613 static void construct_call(ir_node * call) {
615 ir_node *post_block, *pre_block, *except_block, * proj, *jmp, *call_begin;
618 ir_entity ** callees;
622 n_callees = get_Call_n_callees(call);
623 post_block = get_nodes_block(call); /* block nach dem Aufruf */
624 pre_block = create_Block(get_Block_n_cfgpreds(post_block),
625 get_Block_cfgpred_arr(post_block)); /* block vor dem Aufruf (mit CallBegin) */
627 jmp = new_Break(); /* Sprung für intraprozedurale Darstellung (in * pre_block) */
628 call_begin = new_CallBegin(call); /* (in pre_block) */
629 /* CallBegin might be entry to endless recursion. */
630 add_End_keepalive(get_irg_end(get_irn_irg(pre_block)), pre_block);
632 in = NEW_ARR_F(ir_node *, n_callees);
633 caller = get_irg_entity(current_ir_graph); /* entity des aktuellen ir_graph */
634 callees = NEW_ARR_F(ir_entity *, n_callees); /* aufgerufene Methoden: entity */
635 irgs = NEW_ARR_F(ir_graph *, n_callees); /* aufgerufene Methoden: ir_graph */
636 data = NEW_ARR_F(irg_data_t *, n_callees); /* aufgerufene Methoden: irg_data_t */
638 /* post_block kann bereits interprozedurale Steuerflussvorgänger
639 * besitzen. Diese müssen dann auch noch für den pre_block gesetzt werden. */
640 if (get_Block_cg_cfgpred_arr(post_block)) {
641 set_Block_cg_cfgpred_arr(pre_block, get_Block_cg_n_cfgpreds(post_block),
642 get_Block_cg_cfgpred_arr(post_block));
643 remove_Block_cg_cfgpred_arr(post_block);
646 /* Operationen verschieben */
647 move_phis(post_block, pre_block);
648 move_nodes(post_block, pre_block, call);
649 set_irn_in(post_block, 1, &jmp);
651 /* Wiederverwendete Daten initialisieren. */
652 for (i = 0; i < n_callees; ++i) {
653 callees[i] = get_Call_callee(call, i);
654 irgs[i] = get_entity_irg(callees[i]);
655 data[i] = get_entity_link(callees[i]);
656 /* Only entities that have an irg got a irg_data data structure.
657 In others there is some arbitrary garbage in the link field. */
658 if (!irgs[i]) { assert(!data[i]); data[i] = NULL; }
662 * Set flag to suppress verifying placement on proper irg:
663 * optimization can return block on other irg.
665 set_interprocedural_view(1);
667 /* Die interprozeduralen Steuerflussvorgänger des post_block
669 for (i = 0; i < n_callees; ++i) {
670 if (data[i]) { /* explicit */
672 in[i] = new_r_Proj(irgs[i], get_nodes_block(data[i]->reg),
673 data[i]->reg, mode_X, data[i]->count);
677 } else { /* unknown */
678 in[i] = get_cg_Unknown(mode_X);
681 set_interprocedural_view(0);
683 set_Block_cg_cfgpred_arr(post_block, n_callees, in);
685 /* Die interprozeduralen Steuerflussvorgänger des except_block
687 if ((proj = get_except(call)) != NULL) {
689 bool exc_to_end = false;
690 if (exc_branches_to_end(current_ir_graph, proj)) {
691 /* The Call aborts the procedure if it returns with an exception.
692 If this is an outermost procedure, the normal handling of exceptions
693 will generate a Break that goes to the end block. This is illegal
694 Frim. So directly branch to the end block with all exceptions. */
696 if (is_outermost_graph(current_ir_graph)) {
697 except_block = get_irg_end_block(current_ir_graph);
699 irg_data_t * tmp_data = get_entity_link(get_irg_entity(current_ir_graph));
700 except_block = get_nodes_block(tmp_data->except);
703 except_block = create_Block(1, &proj);
704 set_nodes_block(proj, except_block);
705 exchange(proj, new_Break());
706 set_irg_current_block(current_ir_graph, pre_block);
707 set_irn_n(except_block, 0, new_Proj(call, mode_X, pn_Call_X_except));
708 set_irg_current_block(current_ir_graph, post_block);
712 * Set flag to suppress verifying placement on proper irg:
713 * optimization can return block on other irg.
715 set_interprocedural_view(1);
717 for (i = 0; i < n_callees; ++i) {
718 ir_entity * callee = get_Call_callee(call, i);
719 if (data[i]) { /* explicit */
720 if (data[i]->except) {
721 in[i] = new_r_Proj(get_entity_irg(callee), get_nodes_block(data[i]->except),
722 data[i]->except, mode_X, data[i]->count);
726 } else { /* unknown */
727 in[i] = get_cg_Unknown(mode_X);
733 /* append all existing preds of the end block to new in array.
734 * Normal access routine guarantees that with first visit we
735 * get the normal preds, and from then on the _cg_ preds.
736 * (interprocedural view is set!)
737 * Do not add the exc pred of end we are replacing! */
738 for (i = get_Block_n_cfgpreds(except_block)-1; i >= 0; --i) {
739 ir_node *pred = get_Block_cfgpred(except_block, i);
741 ARR_APP1(ir_node *, in, pred);
746 set_Block_cg_cfgpred_arr(except_block, preds, in);
748 set_interprocedural_view(0);
750 /* Diesen Vorgänger in den Start-Blöcken der aufgerufenen Methoden
752 set_irg_current_block(current_ir_graph, pre_block);
753 for (i = 0; i < n_callees; ++i) {
754 if (irgs[i]) /* Else there is not graph to call */
755 construct_start(caller, callees[i], call, new_Proj(call_begin, mode_X, i));
758 /* Proj-Operationen in Filter-Operationen umwandeln und
759 * interprozedurale Vorgänger einfügen. */
760 set_irg_current_block(current_ir_graph, post_block);
761 for (proj = get_irn_link(call); proj; proj = get_irn_link(proj)) {
762 if (get_irn_op(proj) != op_Proj) continue;
763 if (skip_Proj(get_Proj_pred(proj)) != call) continue;
764 if (get_Proj_pred(proj) == call) {
765 if (get_Proj_proj(proj) == pn_Call_M_regular) { /* memory */
768 set_nodes_block(proj, post_block);
769 filter = exchange_proj(proj);
770 /* filter in die Liste der Phis aufnehmen */
771 if (get_irn_link(filter) == NULL) { /* note CSE */
772 set_irn_link(filter, get_irn_link(post_block));
773 set_irn_link(post_block, filter);
775 fill_mem(n_callees, data, in);
776 set_Filter_cg_pred_arr(filter, n_callees, in);
777 } else if (get_Proj_proj(proj) == pn_Call_X_except) { /* except */
778 /* nothing: siehe oben */
779 } else if (get_Proj_proj(proj) == pn_Call_T_result) { /* results */
781 } else if (get_Proj_proj(proj) == pn_Call_M_except) { /* except_mem */
784 set_nodes_block(proj, post_block);
785 assert(except_block);
786 set_irg_current_block(current_ir_graph, except_block);
787 filter = exchange_proj(proj);
788 /* filter in die Liste der Phis aufnehmen */
789 if (get_irn_link(filter) == NULL) { /* note CSE */
790 set_irn_link(filter, get_irn_link(except_block));
791 set_irn_link(except_block, filter);
793 set_irg_current_block(current_ir_graph, post_block);
794 fill_except_mem(n_callees, data, in);
795 set_Filter_cg_pred_arr(filter, n_callees, in);
797 assert(0 && "not reached");
799 } else { /* result */
802 assert(is_Proj(get_Proj_pred(proj)) && get_Proj_pred(get_Proj_pred(proj)) == call);
803 set_nodes_block(proj, post_block);
804 filter = exchange_proj(proj);
805 /* filter in die Liste der Phis aufnehmen */
806 if (get_irn_link(filter) == NULL) { /* not CSE */
807 set_irn_link(filter, get_irn_link(post_block));
808 set_irn_link(post_block, filter);
810 fill_result(get_Proj_proj(filter), n_callees, data, in, get_irn_mode(filter));
811 set_Filter_cg_pred_arr(filter, n_callees, in);
822 void cg_construct(int arr_len, ir_entity ** free_methods_arr) {
825 if (get_irp_ip_view_state() == ip_view_valid) return;
826 if (get_irp_ip_view_state() == ip_view_invalid) cg_destruct();
827 set_irp_ip_view(ip_view_valid);
829 collect_phicallproj();
832 caller_init(arr_len, free_methods_arr);
835 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
836 ir_graph * irg = get_irp_irg(i);
837 ir_entity * ent = get_irg_entity(irg);
838 irg_data_t * data = get_entity_link(ent);
840 prepare_irg(irg, data);
841 } else if (data->open) {
842 /* Die Methode wird nur von "der" unbekannten Aufrufstelle
843 * aufgerufen. Darstellung wird für diese Methode nicht
846 /* Methode kann nicht aufgerufen werden. Die Darstellung wird
847 * für diese Methode nicht geändert. Das kann nicht vorkommen,
848 * wenn zuvor "gc_irgs()" aufgerufen wurde. */
852 /* construct calls */
853 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
856 current_ir_graph = get_irp_irg(i);
857 for (node = get_irn_link(get_irg_end(current_ir_graph)); node; node = get_irn_link(node)) {
859 int j, n_callees = get_Call_n_callees(node);
860 for (j = 0; j < n_callees; ++j)
861 if (get_entity_irg(get_Call_callee(node, j)))
863 if (j < n_callees) /* There is an entity with a graph */
864 construct_call(node);
869 /* cleanup irgs: Abschlussarbeiten: Die Vorgänger der Methoden noch
870 * explizit setzen und die zwischengespeicherten Daten wieder
872 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
873 cleanup_irg(get_irp_irg(i));
879 static void destruct_walker(ir_node * node, void * env)
882 if (is_Block(node)) {
883 remove_Block_cg_cfgpred_arr(node);
884 /* Do not turn Break into Jmp. Better: merge blocks right away.
885 Well, but there are Breaks left.
886 See exc1 from ajacs-rts/Exceptions.java. */
887 if (get_Block_n_cfgpreds(node) == 1) {
888 ir_node *pred = get_Block_cfgpred(node, 0);
889 if (get_irn_op(pred) == op_Break)
890 exchange(node, get_nodes_block(pred));
892 } else if (is_Filter(node)) {
893 set_irg_current_block(current_ir_graph, get_nodes_block(node));
894 exchange(node, new_Proj(get_Filter_pred(node), get_irn_mode(node), get_Filter_proj(node)));
895 } else if (get_irn_op(node) == op_Break) {
896 set_irg_current_block(current_ir_graph, get_nodes_block(node));
897 exchange(node, new_Jmp());
898 } else if (is_Call(node)) {
899 remove_Call_callee_arr(node);
900 } else if (get_irn_op(node) == op_Proj) {
901 /* some ProjX end up in strange blocks. */
902 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
907 void cg_destruct(void) {
909 if (get_irp_ip_view_state() != ip_view_no) {
910 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
911 ir_graph * irg = get_irp_irg(i);
912 irg_walk_graph(irg, destruct_walker, firm_clear_link, NULL);
914 set_irg_initial_exec(irg, skip_Id(get_irg_initial_exec(irg)));
915 set_irg_frame (irg, skip_Id(get_irg_frame(irg)));
916 set_irg_initial_mem (irg, skip_Id(get_irg_initial_mem(irg)));
917 set_irg_end_reg (irg, get_irg_end(irg));
918 set_irg_end_except (irg, get_irg_end(irg));
920 set_irg_callee_info_state(irg, irg_callee_info_none);
923 set_irp_ip_view(ip_view_no);