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
32 #ifdef INTERPROCEDURAL_VIEW
48 /* Return the current state of the interprocedural view. */
49 ip_view_state get_irp_ip_view_state(void) {
53 /* Set the current state of the interprocedural view. */
54 static void set_irp_ip_view(ip_view_state state) {
58 /* Set the state of the interprocedural view to invalid. */
59 void set_irp_ip_view_invalid(void) {
60 set_irp_ip_view(ip_view_invalid);
64 /* Data for each method */
66 int count; /* Number of calleers. */
67 bool open; /* Open method: called by an unknown caller */
68 ir_node * reg, * mem, ** res; /* EndReg, Mem and Method return values */
69 ir_node * except, * except_mem; /* EndExcept and Mem for exception return */
72 static irg_data_t * irg_data_create(void)
74 return XMALLOCZ(irg_data_t);
77 /** Count the number of callers of each method and mark open methods.
79 * Fills the irg_data data structure.
80 * Open methods are methods with an unknown caller, I.e., methods that
81 * - are external visible
82 * - are dereferenced somewhere within the program (i.e., the address of the
83 * method is stored somewhere). */
84 static void caller_init(int arr_length, ir_entity ** free_methods) {
86 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
87 set_entity_link(get_irg_entity(get_irp_irg(i)), irg_data_create());
89 for (i = arr_length - 1; i >= 0; --i) {
90 irg_data_t * data = get_entity_link(free_methods[i]);
93 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
94 ir_graph * irg = get_irp_irg(i);
96 /* We collected all call nodes in a link list at the end node. */
97 for (call = get_irn_link(get_irg_end(irg)); call; call = get_irn_link(call)) {
98 if (!is_Call(call)) continue;
99 for (j = get_Call_n_callees(call) - 1; j >= 0; --j) {
100 ir_entity * ent = get_Call_callee(call, j);
101 if (get_entity_irg(ent)) {
102 irg_data_t * data = get_entity_link(ent);
104 assert(get_entity_irg(ent) && data);
106 # endif /* ndef CATE_jni */
108 set_entity_link(ent, NULL);
116 static INLINE ir_node * tail(ir_node * node) {
118 for (; (link = get_irn_link(node)); node = link) ;
123 /* Call-Operationen an die "link"-Liste von "call_tail" anhängen (und
124 * "call_tail" aktualisieren), Proj-Operationen in die Liste ihrer Definition
125 * (auch bei Proj->Call Operationen) und Phi-Operationen in die Liste ihres
126 * Grundblocks einfügen. */
127 static void collect_phicallproj_walker(ir_node * node, ir_node ** call_tail) {
129 /* Die Liste von Call an call_tail anhängen. */
131 assert(get_irn_link(*call_tail) == NULL);
132 set_irn_link(*call_tail, node);
133 /* call_tail aktualisieren: */
134 for (link = get_irn_link(*call_tail); link; *call_tail = link, link = get_irn_link(link)) ;
135 } else if (get_irn_op(node) == op_Proj) {
136 ir_node * head = skip_Proj(get_Proj_pred(node));
137 set_irn_link(node, get_irn_link(head));
138 set_irn_link(head, node);
139 /* call_tail gegebenenfalls aktualisieren: */
140 if (head == *call_tail) {
143 } else if (get_irn_op(node) == op_Phi) {
144 ir_node * block = get_nodes_block(node);
145 set_irn_link(node, get_irn_link(block));
146 set_irn_link(block, node);
151 static void link(ir_node * head, ir_node * node) {
153 set_irn_link(node, get_irn_link(head));
154 set_irn_link(head, node);
159 /* Die Call-Operationen aller Graphen an den End-Operationen
160 * verlinken, die Proj-Operationen an ihren Definitionen und die
161 * Phi-Operationen an ihren Grundblöcken. Die Liste der Calls sieht
162 * dann so aus: End -> Call -> Proj -> ... -> Proj -> Call -> Proj ->
163 * ... -> Proj -> NULL. */
164 static void collect_phicallproj(void) {
167 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
168 ir_graph * irg = get_irp_irg(i);
169 ir_node * start = get_irg_start(irg);
170 ir_node * end = get_irg_end(irg);
171 current_ir_graph = irg;
172 assert(irg && start);
174 set_using_irn_link(irg);
176 /* Die speziellen Parameter der Start-Operation extra verlinken,
177 * auch wenn sie nicht im intraprozeduralen Graphen erreichbar
179 link(start, get_irg_frame(irg));
181 irg_walk_graph(irg, firm_clear_link, (irg_walk_func *) collect_phicallproj_walker, &end);
183 clear_using_irn_link(irg);
188 /* Proj-Operation durch Filter-Operation im aktuellen Block ersetzen. */
189 static ir_node * exchange_proj(ir_node * proj) {
191 assert(get_irn_op(proj) == op_Proj);
192 filter = new_Filter(get_Proj_pred(proj), get_irn_mode(proj), get_Proj_proj(proj));
193 /* Die Proj- (Id-) Operation sollte im gleichen Grundblock stehen, wie die
194 * Filter-Operation. */
195 set_nodes_block(proj, get_nodes_block(filter));
196 exchange(proj, filter);
201 /* Echt neue Block-Operation erzeugen. CSE abschalten! */
202 static ir_node * create_Block(int n, ir_node ** in) {
203 /* Turn off optimizations so that blocks are not merged again. */
204 int rem_opt = get_opt_optimize();
207 block = new_Block(n, in);
208 set_optimize(rem_opt);
213 static void prepare_irg_end(ir_graph * irg, irg_data_t * data);
214 static void prepare_irg_end_except(ir_graph * irg, irg_data_t * data);
217 /* If we use new_Unknown we get the Unknown of a graph. This can
218 * cause cycles we don't want to see, as Unknwon is in the Start Block
219 * of the procedure. Use unknown of outermost irg where the start
220 * block has no predecessors. */
221 static INLINE ir_node *get_cg_Unknown(ir_mode *m) {
222 assert((get_Block_n_cfgpreds(get_irg_start_block(get_irp_main_irg())) == 1) &&
223 (get_nodes_block(get_Block_cfgpred(get_irg_start_block(get_irp_main_irg()), 0)) ==
224 get_irg_start_block(get_irp_main_irg())));
225 return new_r_Unknown(get_irp_main_irg(), m);
229 /* IRG vorbereiten. Proj-Operationen der Start-Operation in Filter-Operationen
230 * umwandeln. Die künstlichen Steuerzusammenflüsse EndReg und EndExcept
231 * einfügen. An der Start-Operation hängt nach dem Aufruf eine Liste der
232 * entsprechenden Filter-Knoten. */
233 static void prepare_irg(ir_graph * irg, irg_data_t * data) {
234 ir_node * start_block = get_irg_start_block(irg);
235 ir_node * link, * proj;
236 int n_callers = data->count + (data->open ? 1 : 0);
237 ir_node ** in = NEW_ARR_F(ir_node *, n_callers);
239 current_ir_graph = irg;
240 set_irg_current_block(irg, start_block);
242 /* Grundblock interprozedural machen. */
243 /* "in" ist nicht initialisiert. Das passiert erst in "construct_start". */
244 set_Block_cg_cfgpred_arr(start_block, n_callers, in);
245 /* Proj-Operationen durch Filter-Operationen ersetzen und (sonst) in
246 * den Start-Block verschieben. */
247 for (proj = get_irn_link(get_irg_start(irg)); proj; proj = get_irn_link(proj)) {
248 if (get_Proj_pred(proj) != get_irg_start(irg)
249 || (get_Proj_proj(proj) != pn_Start_X_initial_exec && get_Proj_proj(proj) != pn_Start_T_args)) {
250 ir_node * filter = exchange_proj(proj);
251 set_Filter_cg_pred_arr(filter, n_callers, in);
253 set_nodes_block(proj, start_block);
259 /* Liste der Filter-Operationen herstellen. Dabei muss man beachten,
260 * dass oben für "verschiedene" Proj-Operationen wegen CSE nur eine
261 * Filter-Operation erzeugt worden sein kann. */
262 for (link = get_irg_start(irg), proj = get_irn_link(link); proj; proj = get_irn_link(proj)) {
263 if (is_Id(proj)) { /* replaced with filter */
264 ir_node * filter = get_Id_pred(proj);
265 assert(is_Filter(filter));
266 if (filter != link && get_irn_link(filter) == NULL) {
267 set_irn_link(link, filter);
272 /* Globle Einträge für ersetzte Operationen korrigieren. */
273 set_irg_initial_exec(irg, skip_Id(get_irg_initial_exec(irg)));
274 set_irg_frame (irg, skip_Id(get_irg_frame(irg)));
275 set_irg_initial_mem (irg, skip_Id(get_irg_initial_mem(irg)));
277 /* Unbekannten Aufrufer sofort eintragen. */
279 set_Block_cg_cfgpred(start_block, 0, get_cg_Unknown(mode_X));
280 for (proj = get_irn_link(get_irg_start(irg)); proj; proj = get_irn_link(proj)) {
281 if (is_Filter(proj)) {
282 set_Filter_cg_pred(proj, 0, get_cg_Unknown(get_irn_mode(proj)));
290 prepare_irg_end(irg, data);
291 prepare_irg_end_except(irg, data);
295 /* Künstlicher Steuerzusammenfluss EndReg einfügen. */
296 static void prepare_irg_end(ir_graph * irg, irg_data_t * data) {
297 ir_node * end_block = get_irg_end_block(irg);
298 ir_node * end = get_irg_end(irg);
299 ir_node **ret_arr = NULL;
300 ir_node **cfgpred_arr = get_Block_cfgpred_arr(end_block);
304 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
305 if (is_Return(cfgpred_arr[i])) {
307 ARR_APP1(ir_node *, ret_arr, cfgpred_arr[i]);
309 ret_arr = NEW_ARR_F(ir_node *, 1);
310 ret_arr[0] = cfgpred_arr[i];
317 int n_res = get_method_n_ress(get_entity_type(get_irg_entity(irg)));
318 ir_node ** in = NEW_ARR_F(ir_node *, n_ret);
321 for (i = n_ret - 1; i >= 0; --i) {
322 set_irg_current_block(irg, get_nodes_block(ret_arr[i]));
325 create_Block(n_ret, in);
328 data->reg = new_EndReg();
331 for (i = n_ret - 1; i >= 0; --i) {
332 in[i] = get_Return_mem(ret_arr[i]);
334 data->mem = new_Phi(n_ret, in, mode_M);
335 /* This Phi is a merge, therefore needs not be kept alive.
336 It might be optimized away, though. */
337 if (get_End_keepalive(end, get_End_n_keepalives(end)-1 ) == data->mem)
338 set_End_keepalive(end, get_End_n_keepalives(end)-1, new_Bad());
341 data->res = NEW_ARR_F(ir_node *, n_res);
342 for (j = n_res - 1; j >= 0; --j) {
343 ir_mode *mode = NULL;
344 /* In[0] could be a Bad node with wrong mode. */
345 for (i = n_ret - 1; i >= 0; --i) {
346 in[i] = get_Return_res(ret_arr[i], j);
347 if (!mode && get_irn_mode(in[i]) != mode_T)
348 mode = get_irn_mode(in[i]);
351 data->res[j] = new_Phi(n_ret, in, mode);
352 else /* All preds are Bad */
353 data->res[j] = new_Bad();
359 if (ret_arr) DEL_ARR_F(ret_arr);
363 /* Künstlicher Steuerzusammenfluss EndExcept einfügen. */
364 static void prepare_irg_end_except(ir_graph * irg, irg_data_t * data) {
365 ir_node * end_block = get_irg_end_block(irg);
366 ir_node * end = get_irg_end(irg);
367 ir_node ** except_arr = NULL;
370 ir_node ** cfgpred_arr = get_Block_cfgpred_arr(end_block);
371 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
372 if (! is_Return(cfgpred_arr[i])) {
374 ARR_APP1(ir_node *, except_arr, cfgpred_arr[i]);
376 except_arr = NEW_ARR_F(ir_node *, 1);
377 except_arr[0] = cfgpred_arr[i];
383 ir_node ** in = NEW_ARR_F(ir_node *, n_except);
385 create_Block(n_except, except_arr);
387 data->except = new_EndExcept();
389 for (i = n_except - 1; i >= 0; --i) {
390 ir_node *node = skip_Proj(skip_Tuple(except_arr[i]));
391 ir_op *op = get_irn_op(node);
393 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_Call_M_except);
394 } else if (op == op_Raise) {
395 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_Raise_M);
396 } else if (op == op_CopyB) {
397 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, pn_CopyB_M_except);
399 assert(is_fragile_op(node));
400 /* We rely that all cfops have the memory output at the same position. */
401 in[i] = new_r_Proj(irg, get_nodes_block(node), node, mode_M, 0);
404 data->except_mem = new_Phi(n_except, in, mode_M);
405 /* This Phi is a merge, therefor needs not be kept alive.
406 It might be optimized away, though. */
407 if (get_End_keepalive(end, get_End_n_keepalives(end)-1 )
409 set_End_keepalive(end, get_End_n_keepalives(end)-1, new_Bad());
412 if (except_arr) DEL_ARR_F(except_arr);
416 /* Zwischengespeicherte Daten wieder freigeben. */
417 static void cleanup_irg(ir_graph * irg) {
418 ir_entity * ent = get_irg_entity(irg);
419 irg_data_t * data = get_entity_link(ent);
421 if (data->res) DEL_ARR_F(data->res);
422 set_entity_link(ent, NULL);
427 /* Alle Phi-Operationen aus "from_block" nach "to_block"
428 * verschieben. Die Phi-Operationen müssen am zugehörigen Grundblock
429 * verlinkt sein. Danach sind sie am neuen Grundblock verlinkt. */
430 static void move_phis(ir_node * from_block, ir_node * to_block) {
432 for (phi = get_irn_link(from_block); phi != NULL; phi = get_irn_link(phi)) {
433 set_nodes_block(phi, to_block);
435 assert(get_irn_link(to_block) == NULL);
436 set_irn_link(to_block, get_irn_link(from_block));
437 set_irn_link(from_block, NULL);
441 /* Rekursiv die Operation "node" und alle ihre Vorgänger aus dem Block
442 * "from_block" nach "to_block" verschieben.
443 * Verschiebe ebenfalls die Projs aus diesen Operationen. */
444 static void move_nodes(ir_node * from_block, ir_node * to_block, ir_node * node) {
445 int i, arity = get_irn_arity(node);
448 for (i = arity - 1; i >= 0; --i) {
449 ir_node * pred = get_irn_n(node, i);
450 if (get_nodes_block(pred) == from_block) {
451 move_nodes(from_block, to_block, pred);
454 set_nodes_block(node, to_block);
456 /* Move projs of this node. */
457 proj = get_irn_link(node);
458 for (; proj; proj = skip_Id(get_irn_link(proj))) {
459 if (get_irn_op(proj) != op_Proj && !is_Filter(proj)) continue;
460 if ((get_nodes_block(proj) == from_block) && (skip_Proj(get_irn_n(proj, 0)) == node))
461 set_nodes_block(proj, to_block);
466 /* Abhängigkeiten vom Start-Block und den Filter-Operationen im
467 * Start-Block auf den Aufrufer hinzufügen. */
468 static void construct_start(ir_entity * caller, ir_entity * callee,
469 ir_node * call, ir_node * exec)
471 irg_data_t *data = get_entity_link(callee);
472 ir_graph *irg = get_entity_irg(callee);
473 ir_node *start = get_irg_start(irg);
478 assert(get_entity_peculiarity(callee) == peculiarity_existent); /* Else data is not initalized. */
479 assert((0 <= data->count) &&
480 (data->count < get_Block_cg_n_cfgpreds(get_nodes_block(start))));
482 set_Block_cg_cfgpred(get_nodes_block(start), data->count, exec);
483 for (filter = get_irn_link(start); filter; filter = get_irn_link(filter)) {
484 if (!is_Filter(filter)) continue;
485 if (get_Proj_pred(filter) == start) {
486 switch ((int) get_Proj_proj(filter)) {
488 set_Filter_cg_pred(filter, data->count, get_Call_mem(call));
490 case pn_Start_P_frame_base:
491 /* "frame_base" wird nur durch Unknown dargestellt. Man kann ihn aber
492 * auch explizit darstellen, wenn sich daraus Vorteile für die
493 * Datenflussanalyse ergeben. */
494 set_Filter_cg_pred(filter, data->count, get_cg_Unknown(get_irn_mode(filter)));
496 case pn_Start_P_globals:
497 /* "globals" wird nur durch Unknown dargestellt. Man kann ihn aber auch
498 * explizit darstellen, wenn sich daraus Vorteile für die
499 * Datenflussanalyse ergeben. */
500 set_Filter_cg_pred(filter, data->count, get_cg_Unknown(get_irn_mode(filter)));
504 assert(0 && "not reached");
508 set_Filter_cg_pred(filter, data->count, get_Call_param(call, get_Proj_proj(filter)));
515 /* Abhängigkeiten für den Speicherzustand über alle aufgerufenen
516 * Methoden bestimmen. */
517 static void fill_mem(int length, irg_data_t * data[], ir_node * in[]) {
519 for (i = 0; i < length; ++i) {
520 if (data[i]) { /* explicit */
522 in[i] = data[i]->mem;
526 } else { /* unknown */
527 in[i] = get_cg_Unknown(mode_M);
533 /* Abhängigkeiten für den Ausnahme-Speicherzustand über alle
534 * aufgerufenen Methoden bestimmen. */
535 static void fill_except_mem(int length, irg_data_t * data[], ir_node * in[]) {
537 for (i = 0; i < length; ++i) {
538 if (data[i]) { /* explicit */
539 if (data[i]->except) {
540 in[i] = data[i]->except_mem;
544 } else { /* unknown */
545 in[i] = get_cg_Unknown(mode_M);
551 /* Abhängigkeiten für ein Ergebnis über alle aufgerufenen Methoden
553 static void fill_result(int pos, int length, irg_data_t * data[], ir_node * in[], ir_mode *m) {
555 for (i = 0; i < length; ++i) {
556 if (data[i]) { /* explicit */
558 in[i] = data[i]->res[pos];
562 } else { /* unknown */
563 in[i] = get_cg_Unknown(m);
569 /* Proj auf Except-X einer Call-Operation (aus der Link-Liste) bestimmen. */
570 static ir_node * get_except(ir_node * call) {
571 /* Mit CSE könnte man das effizienter machen! Die Methode wird aber für jede
572 * Aufrufstelle nur ein einziges Mal aufgerufen. */
574 for (proj = get_irn_link(call); proj && get_irn_op(proj) == op_Proj; proj = get_irn_link(proj)) {
575 if (get_Proj_proj(proj) == 1 && is_Call(get_Proj_pred(proj))) {
582 /* Returns true if control flow operation exc is predecessor of end
583 block in irg. Works also for Return nodes, not only exceptions. */
584 static bool exc_branches_to_end(ir_graph *irg, ir_node *exc) {
586 ir_node *end = get_irg_end_block(irg);
587 for (i = get_Block_n_cfgpreds(end) -1; i >= 0; --i)
588 if (get_Block_cfgpred(end, i) == exc) return true;
592 /* Returns true if only caller of irg is "Unknown". */
593 static bool is_outermost_graph(ir_graph *irg) {
594 irg_data_t * data = get_entity_link(get_irg_entity(irg));
597 } else if (data->open) {
598 /* Die Methode wird nur von "der" unbekannten Aufrufstelle
599 * aufgerufen. Darstellung wird für diese Methode nicht
602 /* Methode kann nicht aufgerufen werden. Die Darstellung wird
603 * für diese Methode nicht geändert. Das kann nicht vorkommen,
604 * wenn zuvor "gc_irgs()" aufgerufen wurde. */
609 #ifdef INTERPROCEDURAL_VIEW
610 /* Grundblock der Call-Operation aufteilen. CallBegin- und Filter-Operationen
611 * einfügen. Die Steuer- und Datenflussabhängigkeiten von den aufgerufenen
612 * Methoden auf die CallBegin-Operation, und von der Aufrufstelle auf die
613 * aufgerufenen Methoden eintragen. */
614 static void construct_call(ir_node * call) {
616 ir_node *post_block, *pre_block, *except_block, * proj, *jmp, *call_begin;
619 ir_entity ** callees;
623 n_callees = get_Call_n_callees(call);
624 post_block = get_nodes_block(call); /* block nach dem Aufruf */
625 pre_block = create_Block(get_Block_n_cfgpreds(post_block),
626 get_Block_cfgpred_arr(post_block)); /* block vor dem Aufruf (mit CallBegin) */
628 jmp = new_Break(); /* Sprung für intraprozedurale Darstellung (in * pre_block) */
629 call_begin = new_CallBegin(call); /* (in pre_block) */
630 /* CallBegin might be entry to endless recursion. */
631 add_End_keepalive(get_irg_end(get_irn_irg(pre_block)), pre_block);
633 in = NEW_ARR_F(ir_node *, n_callees);
634 caller = get_irg_entity(current_ir_graph); /* entity des aktuellen ir_graph */
635 callees = NEW_ARR_F(ir_entity *, n_callees); /* aufgerufene Methoden: entity */
636 irgs = NEW_ARR_F(ir_graph *, n_callees); /* aufgerufene Methoden: ir_graph */
637 data = NEW_ARR_F(irg_data_t *, n_callees); /* aufgerufene Methoden: irg_data_t */
639 /* post_block kann bereits interprozedurale Steuerflussvorgänger
640 * besitzen. Diese müssen dann auch noch für den pre_block gesetzt werden. */
641 if (get_Block_cg_cfgpred_arr(post_block)) {
642 set_Block_cg_cfgpred_arr(pre_block, get_Block_cg_n_cfgpreds(post_block),
643 get_Block_cg_cfgpred_arr(post_block));
644 remove_Block_cg_cfgpred_arr(post_block);
647 /* Operationen verschieben */
648 move_phis(post_block, pre_block);
649 move_nodes(post_block, pre_block, call);
650 set_irn_in(post_block, 1, &jmp);
652 /* Wiederverwendete Daten initialisieren. */
653 for (i = 0; i < n_callees; ++i) {
654 callees[i] = get_Call_callee(call, i);
655 irgs[i] = get_entity_irg(callees[i]);
656 data[i] = get_entity_link(callees[i]);
657 /* Only entities that have an irg got a irg_data data structure.
658 In others there is some arbitrary garbage in the link field. */
659 if (!irgs[i]) { assert(!data[i]); data[i] = NULL; }
663 * Set flag to suppress verifying placement on proper irg:
664 * optimization can return block on other irg.
666 set_interprocedural_view(1);
668 /* Die interprozeduralen Steuerflussvorgänger des post_block
670 for (i = 0; i < n_callees; ++i) {
671 if (data[i]) { /* explicit */
673 in[i] = new_r_Proj(irgs[i], get_nodes_block(data[i]->reg),
674 data[i]->reg, mode_X, data[i]->count);
678 } else { /* unknown */
679 in[i] = get_cg_Unknown(mode_X);
682 set_interprocedural_view(0);
684 set_Block_cg_cfgpred_arr(post_block, n_callees, in);
686 /* Die interprozeduralen Steuerflussvorgänger des except_block
688 if ((proj = get_except(call)) != NULL) {
690 bool exc_to_end = false;
691 if (exc_branches_to_end(current_ir_graph, proj)) {
692 /* The Call aborts the procedure if it returns with an exception.
693 If this is an outermost procedure, the normal handling of exceptions
694 will generate a Break that goes to the end block. This is illegal
695 Frim. So directly branch to the end block with all exceptions. */
697 if (is_outermost_graph(current_ir_graph)) {
698 except_block = get_irg_end_block(current_ir_graph);
700 irg_data_t * tmp_data = get_entity_link(get_irg_entity(current_ir_graph));
701 except_block = get_nodes_block(tmp_data->except);
704 except_block = create_Block(1, &proj);
705 set_nodes_block(proj, except_block);
706 exchange(proj, new_Break());
707 set_irg_current_block(current_ir_graph, pre_block);
708 set_irn_n(except_block, 0, new_Proj(call, mode_X, pn_Call_X_except));
709 set_irg_current_block(current_ir_graph, post_block);
713 * Set flag to suppress verifying placement on proper irg:
714 * optimization can return block on other irg.
716 set_interprocedural_view(1);
718 for (i = 0; i < n_callees; ++i) {
719 ir_entity * callee = get_Call_callee(call, i);
720 if (data[i]) { /* explicit */
721 if (data[i]->except) {
722 in[i] = new_r_Proj(get_entity_irg(callee), get_nodes_block(data[i]->except),
723 data[i]->except, mode_X, data[i]->count);
727 } else { /* unknown */
728 in[i] = get_cg_Unknown(mode_X);
734 /* append all existing preds of the end block to new in array.
735 * Normal access routine guarantees that with first visit we
736 * get the normal preds, and from then on the _cg_ preds.
737 * (interprocedural view is set!)
738 * Do not add the exc pred of end we are replacing! */
739 for (i = get_Block_n_cfgpreds(except_block)-1; i >= 0; --i) {
740 ir_node *pred = get_Block_cfgpred(except_block, i);
742 ARR_APP1(ir_node *, in, pred);
747 set_Block_cg_cfgpred_arr(except_block, preds, in);
749 set_interprocedural_view(0);
751 /* Diesen Vorgänger in den Start-Blöcken der aufgerufenen Methoden
753 set_irg_current_block(current_ir_graph, pre_block);
754 for (i = 0; i < n_callees; ++i) {
755 if (irgs[i]) /* Else there is not graph to call */
756 construct_start(caller, callees[i], call, new_Proj(call_begin, mode_X, i));
759 /* Proj-Operationen in Filter-Operationen umwandeln und
760 * interprozedurale Vorgänger einfügen. */
761 set_irg_current_block(current_ir_graph, post_block);
762 for (proj = get_irn_link(call); proj; proj = get_irn_link(proj)) {
763 if (get_irn_op(proj) != op_Proj) continue;
764 if (skip_Proj(get_Proj_pred(proj)) != call) continue;
765 if (get_Proj_pred(proj) == call) {
766 if (get_Proj_proj(proj) == pn_Call_M_regular) { /* memory */
769 set_nodes_block(proj, post_block);
770 filter = exchange_proj(proj);
771 /* filter in die Liste der Phis aufnehmen */
772 if (get_irn_link(filter) == NULL) { /* note CSE */
773 set_irn_link(filter, get_irn_link(post_block));
774 set_irn_link(post_block, filter);
776 fill_mem(n_callees, data, in);
777 set_Filter_cg_pred_arr(filter, n_callees, in);
778 } else if (get_Proj_proj(proj) == pn_Call_X_except) { /* except */
779 /* nothing: siehe oben */
780 } else if (get_Proj_proj(proj) == pn_Call_T_result) { /* results */
782 } else if (get_Proj_proj(proj) == pn_Call_M_except) { /* except_mem */
785 set_nodes_block(proj, post_block);
786 assert(except_block);
787 set_irg_current_block(current_ir_graph, except_block);
788 filter = exchange_proj(proj);
789 /* filter in die Liste der Phis aufnehmen */
790 if (get_irn_link(filter) == NULL) { /* note CSE */
791 set_irn_link(filter, get_irn_link(except_block));
792 set_irn_link(except_block, filter);
794 set_irg_current_block(current_ir_graph, post_block);
795 fill_except_mem(n_callees, data, in);
796 set_Filter_cg_pred_arr(filter, n_callees, in);
798 assert(0 && "not reached");
800 } else { /* result */
803 assert(is_Proj(get_Proj_pred(proj)) && get_Proj_pred(get_Proj_pred(proj)) == call);
804 set_nodes_block(proj, post_block);
805 filter = exchange_proj(proj);
806 /* filter in die Liste der Phis aufnehmen */
807 if (get_irn_link(filter) == NULL) { /* not CSE */
808 set_irn_link(filter, get_irn_link(post_block));
809 set_irn_link(post_block, filter);
811 fill_result(get_Proj_proj(filter), n_callees, data, in, get_irn_mode(filter));
812 set_Filter_cg_pred_arr(filter, n_callees, in);
823 void cg_construct(int arr_len, ir_entity ** free_methods_arr) {
826 if (get_irp_ip_view_state() == ip_view_valid) return;
827 if (get_irp_ip_view_state() == ip_view_invalid) cg_destruct();
828 set_irp_ip_view(ip_view_valid);
830 collect_phicallproj();
833 caller_init(arr_len, free_methods_arr);
836 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
837 ir_graph * irg = get_irp_irg(i);
838 ir_entity * ent = get_irg_entity(irg);
839 irg_data_t * data = get_entity_link(ent);
841 prepare_irg(irg, data);
842 } else if (data->open) {
843 /* Die Methode wird nur von "der" unbekannten Aufrufstelle
844 * aufgerufen. Darstellung wird für diese Methode nicht
847 /* Methode kann nicht aufgerufen werden. Die Darstellung wird
848 * für diese Methode nicht geändert. Das kann nicht vorkommen,
849 * wenn zuvor "gc_irgs()" aufgerufen wurde. */
853 /* construct calls */
854 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
857 current_ir_graph = get_irp_irg(i);
858 for (node = get_irn_link(get_irg_end(current_ir_graph)); node; node = get_irn_link(node)) {
860 int j, n_callees = get_Call_n_callees(node);
861 for (j = 0; j < n_callees; ++j)
862 if (get_entity_irg(get_Call_callee(node, j)))
864 if (j < n_callees) /* There is an entity with a graph */
865 construct_call(node);
870 /* cleanup irgs: Abschlussarbeiten: Die Vorgänger der Methoden noch
871 * explizit setzen und die zwischengespeicherten Daten wieder
873 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
874 cleanup_irg(get_irp_irg(i));
880 static void destruct_walker(ir_node * node, void * env)
883 if (is_Block(node)) {
884 remove_Block_cg_cfgpred_arr(node);
885 /* Do not turn Break into Jmp. Better: merge blocks right away.
886 Well, but there are Breaks left.
887 See exc1 from ajacs-rts/Exceptions.java. */
888 if (get_Block_n_cfgpreds(node) == 1) {
889 ir_node *pred = get_Block_cfgpred(node, 0);
890 if (get_irn_op(pred) == op_Break)
891 exchange(node, get_nodes_block(pred));
893 } else if (is_Filter(node)) {
894 set_irg_current_block(current_ir_graph, get_nodes_block(node));
895 exchange(node, new_Proj(get_Filter_pred(node), get_irn_mode(node), get_Filter_proj(node)));
896 } else if (get_irn_op(node) == op_Break) {
897 set_irg_current_block(current_ir_graph, get_nodes_block(node));
898 exchange(node, new_Jmp());
899 } else if (is_Call(node)) {
900 remove_Call_callee_arr(node);
901 } else if (get_irn_op(node) == op_Proj) {
902 /* some ProjX end up in strange blocks. */
903 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
908 void cg_destruct(void) {
910 if (get_irp_ip_view_state() != ip_view_no) {
911 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
912 ir_graph * irg = get_irp_irg(i);
913 irg_walk_graph(irg, destruct_walker, firm_clear_link, NULL);
915 set_irg_initial_exec(irg, skip_Id(get_irg_initial_exec(irg)));
916 set_irg_frame (irg, skip_Id(get_irg_frame(irg)));
917 set_irg_initial_mem (irg, skip_Id(get_irg_initial_mem(irg)));
918 set_irg_end_reg (irg, get_irg_end(irg));
919 set_irg_end_except (irg, get_irg_end(irg));
921 set_irg_callee_info_state(irg, irg_callee_info_none);
924 set_irp_ip_view(ip_view_no);