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 parallelizing Load/Store optimisation
23 * @author Christoph Mallon
30 #include "iroptimize.h"
41 #include "irnodeset.h"
48 #define OPTIMISE_LOAD_AFTER_LOAD
51 #define UNIMPLEMENTED abort();
54 DEBUG_ONLY(static firm_dbg_module_t *dbg);
57 static struct obstack obst;
58 static size_t count_addrs;
59 static ir_node** addrs;
62 static void AddressCollector(ir_node* node, void* env)
64 ir_nodeset_t* addrs_set = env;
67 addr = get_Load_ptr(node);
68 } else if (is_Store(node)) {
69 addr = get_Store_ptr(node);
73 ir_nodeset_insert(addrs_set, addr);
77 /* Collects all unique addresses used by load and store nodes of a graph and
78 * puts them into an array for later use */
79 static void CollectAddresses(ir_graph* irg)
81 ir_nodeset_t addrs_set;
83 ir_nodeset_init(&addrs_set);
84 irg_walk_graph(irg, AddressCollector, NULL, &addrs_set);
86 count_addrs = ir_nodeset_size(&addrs_set);
87 DB((dbg, LEVEL_1, "===> %+F uses %u unique addresses\n", irg, (unsigned int)count_addrs));
88 if (count_addrs != 0) {
89 ir_nodeset_iterator_t addr_iter;
92 addrs = NEW_ARR_D(ir_node*, &obst, count_addrs);
93 ir_nodeset_iterator_init(&addr_iter, &addrs_set);
94 for (i = 0; i < count_addrs; i++) {
95 ir_node* addr = ir_nodeset_iterator_next(&addr_iter);
97 set_irn_link(addr, (void *)i);
99 DB((dbg, LEVEL_2, "===> Collected unique symbolic address %+F\n", addr));
105 static void AliasSetAdder(ir_node* block, void* env)
107 ir_nodeset_t* alias_set;
111 alias_set = NEW_ARR_D(ir_nodeset_t, &obst, count_addrs);
112 for (i = 0; i < count_addrs; i++) {
113 ir_nodeset_init(&alias_set[i]);
115 set_irn_link(block, alias_set);
119 static void SetStartAddressesTop(ir_graph* irg)
121 ir_node* initial_mem;
122 ir_node* start_block;
123 ir_nodeset_t* start_addrs;
126 initial_mem = get_irg_initial_mem(irg);
127 start_block = get_irg_start_block(irg);
128 start_addrs = get_irn_link(start_block);
129 for (i = 0; i < count_addrs; i++) {
130 ir_nodeset_insert(&start_addrs[i], initial_mem);
132 mark_Block_block_visited(start_block);
136 static void AliasSetDestroyer(ir_node* block, void* env)
138 ir_nodeset_t* alias_set = get_irn_link(block);
142 for (i = 0; i < count_addrs; i++) {
143 ir_nodeset_destroy(&alias_set[i]);
148 static ir_alias_relation AliasTest(ir_graph* irg, ir_node* addr, ir_mode* mode, ir_node* other)
153 if (is_Proj(other)) other = get_Proj_pred(other);
155 if (is_Load(other)) {
156 other_addr = get_Load_ptr(other);
157 } else if (is_Store(other)) {
158 other_addr = get_Store_ptr(other);
163 other_mode = get_irn_mode(other);
164 return get_alias_relation(irg, addr, mode, other_addr, other_mode);
168 static ir_node* GenerateSync(ir_graph* irg, ir_node* block, ir_nodeset_t* after_set)
170 size_t set_size = ir_nodeset_size(after_set);
171 ir_nodeset_iterator_t iter;
173 assert(set_size != 0);
175 ir_nodeset_iterator_init(&iter, after_set);
177 return ir_nodeset_iterator_next(&iter);
182 NEW_ARR_A(ir_node*, in, set_size);
183 for (i = 0; i < set_size; i++) {
184 in[i] = ir_nodeset_iterator_next(&iter);
186 return new_r_Sync(irg, block, set_size, in);
191 static ir_node** unfinished_phis;
194 static void PlaceMemPhis(ir_graph* irg, ir_node* block, ir_node* phi)
197 size_t block_n_preds = get_Block_n_cfgpreds(block);
198 ir_nodeset_t* thissets;
203 thissets = get_irn_link(block);
204 NEW_ARR_A(ir_node*, in, block_n_preds);
205 for (j = 0; j < count_addrs; j++) {
208 for (i = 0; i < block_n_preds; i++) {
209 ir_node* pred_block = get_nodes_block(get_Phi_pred(phi, i)); // TODO get_Block_cfgpred_block(block, i);
210 ir_nodeset_t* predsets = get_irn_link(pred_block);
211 size_t predset_size = ir_nodeset_size(&predsets[j]);
213 if (predset_size == 0) {
214 in[i] = new_r_Unknown(irg, mode_M);
217 in[i] = GenerateSync(irg, pred_block, &predsets[j]);
220 new_phi = new_r_Phi(irg, block, block_n_preds, in, mode_M);
222 set_irn_link(new_phi, unfinished_phis[j]);
223 unfinished_phis[j] = new_phi;
225 ir_nodeset_insert(&thissets[j], new_phi);
230 static int WalkMem(ir_graph* irg, ir_node* node, ir_node* last_block);
233 static void WalkMemPhi(ir_graph* irg, ir_node* block, ir_node* phi)
235 size_t n = get_Phi_n_preds(phi);
238 for (i = 0; i < n; i++) {
239 WalkMem(irg, get_Phi_pred(phi, i), block);
242 PlaceMemPhis(irg, block, phi);
243 exchange(phi, new_Bad());
247 static void PlaceLoad(ir_graph* irg, ir_node* block, ir_node* load, ir_node* memory)
249 ir_node* addr = get_Load_ptr(load);
250 size_t addr_idx = (size_t)get_irn_link(addr);
251 ir_nodeset_t* interfere_sets = get_irn_link(block);
252 ir_nodeset_t* interfere_set = &interfere_sets[addr_idx];
253 size_t size = ir_nodeset_size(interfere_set);
254 ir_nodeset_iterator_t interfere_iter;
258 ir_nodeset_iterator_init(&interfere_iter, interfere_set);
260 ir_node* after = ir_nodeset_iterator_next(&interfere_iter);
261 assert(!is_Proj(after) || !is_Load(get_Proj_pred(after)));
262 DB((dbg, LEVEL_3, "===> %+F must be executed after %+F\n", load, after));
263 set_Load_mem(load, after);
270 NEW_ARR_A(ir_node*, after_set, size);
272 while ((mem = ir_nodeset_iterator_next(&interfere_iter)) != NULL) {
274 ir_node* pred = get_Proj_pred(mem);
276 #ifdef OPTIMISE_LOAD_AFTER_LOAD
277 if (get_Load_ptr(pred) == addr && get_Load_mode(pred) == get_Load_mode(load)) {
278 exchange(load, pred);
285 DB((dbg, LEVEL_3, "===> %+F must be executed after %+F\n", load, mem));
286 after_set[i++] = mem;
290 after = after_set[0];
292 after = new_r_Sync(irg, block, i, after_set);
294 set_Load_mem(load, after);
297 for (i = 0; i < count_addrs; i++) {
298 ir_mode* mode = get_Load_mode(load);
299 ir_node* other_addr = addrs[i];
300 ir_mode* other_mode = mode; // XXX second mode is nonsense
301 ir_alias_relation rel = get_alias_relation(irg, addr, mode, other_addr, other_mode);
303 DB((dbg, LEVEL_3, "===> Testing for alias between %+F and %+F. Relation is %d\n", addr, other_addr, rel));
304 if (rel == no_alias) {
307 DB((dbg, LEVEL_3, "===> %+F potentially aliases address %+F\n", load, other_addr));
309 ir_nodeset_insert(&interfere_sets[i], memory);
314 static void PlaceStore(ir_graph* irg, ir_node* block, ir_node* store, ir_node* memory)
316 ir_node* addr = get_Store_ptr(store);
317 size_t addr_idx = (size_t)get_irn_link(addr);
318 ir_nodeset_t* interfere_sets = get_irn_link(block);
319 ir_nodeset_t* interfere_set = &interfere_sets[addr_idx];
323 after = GenerateSync(irg, block, interfere_set);
324 set_Store_mem(store, after);
326 for (i = 0; i < count_addrs; i++) {
327 ir_nodeset_iterator_t interfere_iter;
328 ir_mode* mode = get_irn_mode(get_Store_value(store));
329 ir_node* other_addr = addrs[i];
330 ir_mode* other_mode = mode; // XXX second mode is nonsense
331 ir_alias_relation rel = get_alias_relation(irg, addr, mode, other_addr, other_mode);
334 DB((dbg, LEVEL_3, "===> Testing for alias between %+F and %+F. Relation is %d\n", addr, other_addr, rel));
335 if (rel == no_alias) {
338 DB((dbg, LEVEL_3, "===> %+F potentially aliases address %+F\n", store, other_addr));
340 ir_nodeset_iterator_init(&interfere_iter, &interfere_sets[i]);
341 while ((other_node = ir_nodeset_iterator_next(&interfere_iter)) != NULL) {
342 if (AliasTest(irg, addr, mode, other_node) != no_alias) {
343 DB((dbg, LEVEL_3, "===> Removing %+F from execute-after set of %+F due to %+F\n", other_node, addrs[i], store));
344 ir_nodeset_remove_iterator(&interfere_sets[i], &interfere_iter);
348 ir_nodeset_insert(&interfere_sets[i], memory);
353 static int WalkMem(ir_graph* irg, ir_node* node, ir_node* last_block)
355 int block_change = 0;
356 ir_node* block = get_nodes_block(node);
358 ir_node* memory = node;
359 ir_nodeset_t* addr_sets;
361 if (block != last_block) {
362 DB((dbg, LEVEL_3, "===> Changing block from %+F to %+F\n", last_block, block));
364 if (Block_not_block_visited(block)) {
365 mark_Block_block_visited(block);
367 DB((dbg, LEVEL_2, "===> Hit already visited block at %+F\n", node));
373 if (is_Proj(node)) node = get_Proj_pred(node);
376 WalkMemPhi(irg, block, node);
378 } else if (is_Sync(node)) {
380 } else if (is_Return(node)) {
381 pred = get_Return_mem(node);
383 pred = get_fragile_op_mem(node);
386 if (WalkMem(irg, pred, block)) {
387 // There was a block change
388 size_t block_arity = get_Block_n_cfgpreds(block);
390 DB((dbg, LEVEL_3, "===> There is a block change before %+F\n", node));
391 if (block_arity == 1) {
392 // Just one predecessor, inherit its alias sets
393 ir_node* pred_block = get_nodes_block(pred);
394 ir_nodeset_t* predsets = get_irn_link(pred_block);
395 ir_nodeset_t* thissets = get_irn_link(block);
398 DB((dbg, LEVEL_3, "===> Copying the only predecessor's address sets\n"));
400 if (ir_nodeset_size(&predsets[0]) == 0) {
403 DB((dbg, LEVEL_3, "===> The predecessor was not finished yet\n"));
404 assert(!Block_not_block_visited(pred_block));
406 unknown = new_r_Unknown(irg, mode_M);
407 for (i = 0; i < count_addrs; i++) {
408 ir_node* phi_unk = new_r_Phi(irg, block, 1, &unknown, mode_M);
409 DB((dbg, LEVEL_3, "===> Placing unfinished %+F for %+F in %+F\n", phi_unk, addrs[i], block));
410 set_irn_link(phi_unk, unfinished_phis[i]);
411 unfinished_phis[i] = phi_unk;
412 ir_nodeset_insert(&thissets[i], phi_unk);
415 for (i = 0; i < count_addrs; i++) {
416 ir_nodeset_iterator_t prediter;
419 ir_nodeset_iterator_init(&prediter, &predsets[i]);
420 while ((addr = ir_nodeset_iterator_next(&prediter)) != NULL) {
421 ir_nodeset_insert(&thissets[i], addr);
428 DB((dbg, LEVEL_3, "===> Detotalising %+F\n", node));
430 addr_sets = get_irn_link(block);
433 PlaceLoad(irg, block, node, memory);
434 } else if (is_Store(node)) {
435 PlaceStore(irg, block, node, memory);
437 ir_nodeset_t sync_set;
441 DB((dbg, LEVEL_3, "===> Fallback: %+F aliases everything\n", node));
443 ir_nodeset_init(&sync_set);
444 for (i = 0; i < count_addrs; i++) {
445 ir_nodeset_iterator_t iter;
448 ir_nodeset_iterator_init(&iter, &addr_sets[i]);
449 while ((mem = ir_nodeset_iterator_next(&iter)) != NULL) {
450 ir_nodeset_insert(&sync_set, mem);
454 after = GenerateSync(irg, block, &sync_set);
455 set_irn_n(node, 0, after); // XXX unnice way to set the memory input
457 for (i = 0; i < count_addrs; i++) {
458 ir_nodeset_iterator_t iter;
459 ir_nodeset_iterator_init(&iter, &addr_sets[i]);
460 while (ir_nodeset_iterator_next(&iter) != NULL) {
461 ir_nodeset_remove_iterator(&addr_sets[i], &iter);
463 ir_nodeset_insert(&addr_sets[i], memory);
471 static void FinalisePhis(ir_graph* irg)
475 for (i = 0; i < count_addrs; i++) {
479 for (phi = unfinished_phis[i]; phi != NULL; phi = next_phi) {
480 ir_node* block = get_nodes_block(phi);
481 size_t block_n_preds = get_Block_n_cfgpreds(block);
483 next_phi = get_irn_link(phi);
485 DB((dbg, LEVEL_4, "===> Finialising phi %+F in %+F\n", phi, block));
487 if (block_n_preds == 1) {
488 ir_node* pred_block = get_Block_cfgpred_block(block, 0);
489 ir_nodeset_t* pred_sets = get_irn_link(pred_block);
490 ir_node* after = GenerateSync(irg, pred_block, &pred_sets[i]);
492 assert(is_Unknown(get_Phi_pred(phi, 0)));
493 exchange(phi, after);
498 NEW_ARR_A(ir_node*, in, block_n_preds);
499 for (j = 0; j < block_n_preds; j++) {
500 ir_node* pred_block = get_Block_cfgpred_block(block, j);
501 ir_nodeset_t* pred_sets = get_irn_link(pred_block);
503 if (is_Unknown(get_Phi_pred(phi, j))) {
504 set_Phi_pred(phi, j, GenerateSync(irg, pred_block, &pred_sets[i]));
513 static void Detotalise(ir_graph* irg)
515 ir_node* end_block = get_irg_end_block(irg);
516 size_t npreds = get_Block_n_cfgpreds(end_block);
519 unfinished_phis = xmalloc(sizeof(*unfinished_phis) * count_addrs);
520 for (i = 0; i < count_addrs; i++) {
521 unfinished_phis[i] = NULL;
524 for (i = 0; i < npreds; i++) {
525 ir_node* pred = get_Block_cfgpred(end_block, i);
526 assert(is_Return(pred));
527 DB((dbg, LEVEL_2, "===> Starting memory walk at %+F\n", pred));
528 WalkMem(irg, pred, NULL);
532 xfree(unfinished_phis);
537 static void AddSyncPreds(ir_nodeset_t* preds, ir_node* sync)
539 size_t n = get_Sync_n_preds(sync);
542 for (i = 0; i < n; i++) {
543 ir_node* pred = get_Sync_pred(sync, i);
545 AddSyncPreds(preds, pred);
547 ir_nodeset_insert(preds, pred);
553 static void NormaliseSync(ir_node* node, void* env)
556 ir_nodeset_iterator_t iter;
562 if (!is_Sync(node)) return;
564 ir_nodeset_init(&preds);
565 AddSyncPreds(&preds, node);
567 count_preds = ir_nodeset_size(&preds);
568 if (count_preds != (unsigned)get_Sync_n_preds(node)) {
569 NEW_ARR_A(ir_node*, in, count_preds);
570 ir_nodeset_iterator_init(&iter, &preds);
571 for (i = 0; i < count_preds; i++) {
572 ir_node* pred = ir_nodeset_iterator_next(&iter);
573 assert(pred != NULL);
576 set_irn_in(node, count_preds, in);
579 ir_nodeset_destroy(&preds);
584 void opt_ldst2(ir_graph* irg)
586 FIRM_DBG_REGISTER(dbg, "firm.opt.ldst2");
587 DB((dbg, LEVEL_1, "===> Performing load/store optimisation on %+F\n", irg));
589 normalize_one_return(irg);
590 dump_ir_block_graph(irg, "-prefluffig");
594 if (1 /* XXX */ || get_opt_alias_analysis()) {
595 assure_irg_address_taken_computed(irg);
596 assure_irp_globals_address_taken_computed();
600 CollectAddresses(irg);
601 if (count_addrs == 0) return;
603 irg_block_walk_graph(irg, AliasSetAdder, NULL, NULL);
604 inc_irg_block_visited(irg);
605 SetStartAddressesTop(irg);
607 dump_ir_block_graph(irg, "-fluffig");
609 irg_block_walk_graph(irg, AliasSetDestroyer, NULL, NULL);
610 obstack_free(&obst, NULL);
612 normalize_proj_nodes(irg);
613 irg_walk_graph(irg, NormaliseSync, NULL, NULL);
614 optimize_graph_df(irg);
615 irg_walk_graph(irg, NormaliseSync, NULL, NULL);
616 dump_ir_block_graph(irg, "-postfluffig");
621 typedef struct parallelise_info
623 ir_node *origin_block;
625 ir_mode *origin_mode;
626 ir_nodeset_t this_mem;
627 ir_nodeset_t user_mem;
631 static void parallelise_load(parallelise_info *pi, ir_node *irn)
633 //ir_fprintf(stderr, "considering %+F\n", irn);
634 if (get_nodes_block(irn) == pi->origin_block) {
636 ir_node *pred = get_Proj_pred(irn);
638 get_Load_volatility(pred) == volatility_non_volatile) {
639 ir_node *mem = get_Load_mem(pred);
640 //ir_nodeset_insert(&pi->this_mem, mem);
641 ir_nodeset_insert(&pi->user_mem, irn);
642 //ir_fprintf(stderr, "adding %+F to user set\n", irn);
643 parallelise_load(pi, mem);
645 } else if (is_Store(pred) &&
646 get_Store_volatility(pred) == volatility_non_volatile) {
647 ir_mode *org_mode = pi->origin_mode;
648 ir_node *org_ptr = pi->origin_ptr;
649 ir_mode *store_mode = get_irn_mode(get_Store_value(pred));
650 ir_node *store_ptr = get_Store_ptr(pred);
651 if (get_alias_relation(current_ir_graph, org_ptr, org_mode, store_ptr, store_mode) == no_alias) {
652 ir_node *mem = get_Store_mem(pred);
653 ir_fprintf(stderr, "Ld after St: %+F (%+F) does not alias %+F (%+F)\n", org_ptr, org_mode, store_ptr, store_mode);
654 ir_nodeset_insert(&pi->user_mem, irn);
655 //ir_fprintf(stderr, "adding %+F to user set\n", irn);
656 parallelise_load(pi, mem);
660 } else if (is_Sync(irn)) {
661 int n = get_Sync_n_preds(irn);
664 for (i = 0; i < n; ++i) {
665 ir_node *sync_pred = get_Sync_pred(irn, i);
666 parallelise_load(pi, sync_pred);
671 ir_nodeset_insert(&pi->this_mem, irn);
672 //ir_fprintf(stderr, "adding %+F to this set\n", irn);
676 static void parallelise_store(parallelise_info *pi, ir_node *irn)
678 //ir_fprintf(stderr, "considering %+F\n", irn);
679 if (get_nodes_block(irn) == pi->origin_block) {
681 ir_node *pred = get_Proj_pred(irn);
683 get_Load_volatility(pred) == volatility_non_volatile) {
684 ir_mode *org_mode = pi->origin_mode;
685 ir_node *org_ptr = pi->origin_ptr;
686 ir_mode *load_mode = get_Load_mode(pred);
687 ir_node *load_ptr = get_Load_ptr(pred);
688 if (get_alias_relation(current_ir_graph, org_ptr, org_mode, load_ptr, load_mode) == no_alias) {
689 ir_node *mem = get_Load_mem(pred);
690 ir_fprintf(stderr, "St after Ld: %+F (%+F) does not alias %+F (%+F)\n", org_ptr, org_mode, load_ptr, load_mode);
691 ir_nodeset_insert(&pi->user_mem, irn);
692 //ir_fprintf(stderr, "adding %+F to user set\n", irn);
693 parallelise_store(pi, mem);
696 } else if (is_Store(pred) &&
697 get_Store_volatility(pred) == volatility_non_volatile) {
698 ir_mode *org_mode = pi->origin_mode;
699 ir_node *org_ptr = pi->origin_ptr;
700 ir_mode *store_mode = get_irn_mode(get_Store_value(pred));
701 ir_node *store_ptr = get_Store_ptr(pred);
702 if (get_alias_relation(current_ir_graph, org_ptr, org_mode, store_ptr, store_mode) == no_alias) {
705 ir_fprintf(stderr, "St after St: %+F (%+F) does not alias %+F (%+F)\n", org_ptr, org_mode, store_ptr, store_mode);
706 ir_nodeset_insert(&pi->user_mem, irn);
707 //ir_fprintf(stderr, "adding %+F to user set\n", irn);
708 mem = get_Store_mem(pred);
709 parallelise_store(pi, mem);
713 } else if (is_Sync(irn)) {
714 int n = get_Sync_n_preds(irn);
717 for (i = 0; i < n; ++i) {
718 ir_node *sync_pred = get_Sync_pred(irn, i);
719 parallelise_store(pi, sync_pred);
724 ir_nodeset_insert(&pi->this_mem, irn);
725 //ir_fprintf(stderr, "adding %+F to this set\n", irn);
729 static void walker(ir_node *proj, void *env)
739 if (!is_Proj(proj)) return;
740 if (get_irn_mode(proj) != mode_M) return;
742 mem_op = get_Proj_pred(proj);
743 if (is_Load(mem_op)) {
744 if (get_Load_volatility(mem_op) != volatility_non_volatile) return;
746 block = get_nodes_block(mem_op);
747 pred = get_Load_mem(mem_op);
748 //ir_fprintf(stderr, "starting parallelise at %+F for %+F\n", pred, proj);
750 pi.origin_block = block,
751 pi.origin_ptr = get_Load_ptr(mem_op);
752 pi.origin_mode = get_Load_mode(mem_op);
753 ir_nodeset_init(&pi.this_mem);
754 ir_nodeset_init(&pi.user_mem);
756 parallelise_load(&pi, pred);
757 } else if (is_Store(mem_op)) {
758 if (get_Store_volatility(mem_op) != volatility_non_volatile) return;
760 block = get_nodes_block(mem_op);
761 pred = get_Store_mem(mem_op);
762 //ir_fprintf(stderr, "starting parallelise at %+F for %+F\n", pred, proj);
764 pi.origin_block = block,
765 pi.origin_ptr = get_Store_ptr(mem_op);
766 pi.origin_mode = get_irn_mode(get_Store_value(mem_op));
767 ir_nodeset_init(&pi.this_mem);
768 ir_nodeset_init(&pi.user_mem);
770 parallelise_store(&pi, pred);
775 n = ir_nodeset_size(&pi.user_mem);
776 if (n != 0) { /* nothing happend otherwise */
777 ir_graph *irg = current_ir_graph;
780 ir_nodeset_iterator_t iter;
784 //ir_fprintf(stderr, "creating sync for users of %+F with %d inputs\n", proj, n);
785 NEW_ARR_A(ir_node*, in, n);
787 in[i++] = new_r_Unknown(irg, mode_M);
788 ir_nodeset_iterator_init(&iter, &pi.user_mem);
790 ir_node* p = ir_nodeset_iterator_next(&iter);
791 if (p == NULL) break;
795 sync = new_r_Sync(irg, block, n, in);
796 exchange(proj, sync);
798 assert(pn_Load_M == pn_Store_M);
799 proj = new_r_Proj(irg, block, mem_op, mode_M, pn_Load_M);
800 set_Sync_pred(sync, 0, proj);
802 n = ir_nodeset_size(&pi.this_mem);
803 //ir_fprintf(stderr, "creating sync for %+F with %d inputs\n", mem_op, n);
804 ir_nodeset_iterator_init(&iter, &pi.this_mem);
806 sync = ir_nodeset_iterator_next(&iter);
808 NEW_ARR_A(ir_node*, in, n);
811 ir_node* p = ir_nodeset_iterator_next(&iter);
812 if (p == NULL) break;
816 sync = new_r_Sync(irg, block, n, in);
818 set_memop_mem(mem_op, sync);
821 ir_nodeset_destroy(&pi.this_mem);
822 ir_nodeset_destroy(&pi.user_mem);
826 void opt_ldst2(ir_graph *irg)
828 assure_irg_address_taken_computed(irg);
829 assure_irp_globals_address_taken_computed();
831 irg_walk_graph(irg, NULL, walker, NULL);
832 //optimize_graph_df(irg);
833 //irg_walk_graph(irg, NormaliseSync, NULL, NULL);