2 * Copyright (C) 1995-2007 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 Lower small CopyB nodes into a series of Load/store
23 * @author Michael Beck, Matthias Braun
39 typedef struct entry entry_t;
41 struct list_head list;
45 typedef struct walk_env {
47 struct obstack obst; /**< the obstack where data is allocated on */
48 struct list_head list; /**< the list of copyb nodes */
51 static ir_mode *get_ir_mode(unsigned bytes)
54 case 1: return mode_Bu;
55 case 2: return mode_Hu;
56 case 4: return mode_Iu;
57 case 8: return mode_Lu;
58 case 16: return mode_LLu;
60 panic("unexpected mode size requested in copyb lowering");
67 static void lower_copyb_nodes(ir_node *irn, unsigned mode_bytes)
69 ir_graph *irg = current_ir_graph;
80 addr_src = get_CopyB_src(irn);
81 addr_dst = get_CopyB_dst(irn);
82 mem = get_CopyB_mem(irn);
83 addr_mode = get_irn_mode(addr_src);
84 block = get_nodes_block(irn);
86 tp = get_CopyB_type(irn);
87 size = get_type_size_bytes(tp);
90 while (offset < size) {
91 mode = get_ir_mode(mode_bytes);
92 for (; offset + mode_bytes <= size; offset += mode_bytes) {
93 /* construct offset */
102 addr_const = new_r_Const_long(irg, mode_Iu, offset);
103 add = new_r_Add(block, addr_src, addr_const, addr_mode);
105 load = new_r_Load(block, mem, add, mode, 0);
106 load_res = new_r_Proj(load, mode, pn_Load_res);
107 load_mem = new_r_Proj(load, mode_M, pn_Load_M);
109 addr_const = new_r_Const_long(irg, mode_Iu, offset);
110 add = new_r_Add(block, addr_dst, addr_const, addr_mode);
112 store = new_r_Store(block, load_mem, add, load_res, 0);
113 store_mem = new_r_Proj(store, mode_M, pn_Store_M);
121 turn_into_tuple(irn, pn_CopyB_max);
122 set_Tuple_pred(irn, pn_CopyB_M, mem);
123 set_Tuple_pred(irn, pn_CopyB_X_regular, get_irg_bad(irg));
124 set_Tuple_pred(irn, pn_CopyB_X_except, get_irg_bad(irg));
128 * Post-Walker: find small CopyB nodes.
130 static void find_copyb_nodes(ir_node *irn, void *ctx)
132 walk_env_t *env = ctx;
138 ir_node *pred = get_Proj_pred(irn);
140 if (is_CopyB(pred) && get_Proj_proj(irn) != pn_CopyB_M) {
141 /* found an exception Proj: remove it from the list again */
142 entry = get_irn_link(pred);
143 list_del(&entry->list);
151 tp = get_CopyB_type(irn);
152 if (get_type_state(tp) != layout_fixed)
155 size = get_type_size_bytes(tp);
156 if (size > env->max_size)
160 entry = OALLOC(&env->obst, entry_t);
162 INIT_LIST_HEAD(&entry->list);
163 set_irn_link(irn, entry);
164 list_add_tail(&entry->list, &env->list);
167 void lower_CopyB(ir_graph *irg, unsigned max_size, unsigned native_mode_bytes)
171 ir_graph *rem = current_ir_graph;
173 current_ir_graph = irg;
175 obstack_init(&env.obst);
176 env.max_size = max_size;
177 INIT_LIST_HEAD(&env.list);
178 irg_walk_graph(irg, NULL, find_copyb_nodes, &env);
180 list_for_each_entry(entry_t, entry, &env.list, list) {
181 lower_copyb_nodes(entry->copyb, native_mode_bytes);
184 obstack_free(&env.obst, NULL);
185 current_ir_graph = rem;