2 * Copyright (C) 1995-2011 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 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
30 #include "firm_types.h"
32 #include "compound_path_t.h"
36 #include "irgraph_t.h"
39 compound_graph_path *new_compound_graph_path(ir_type *tp, size_t length)
41 compound_graph_path *res;
43 assert(is_compound_type(tp) || is_Array_type(tp));
46 res = XMALLOCFZ(compound_graph_path, list, length);
47 res->kind = k_ir_compound_graph_path;
54 void free_compound_graph_path(compound_graph_path *gr)
56 assert(gr && is_compound_graph_path(gr));
61 int is_compound_graph_path(const void *thing)
63 return get_kind(thing) == k_ir_compound_graph_path;
66 int is_proper_compound_graph_path(compound_graph_path *gr, size_t pos)
70 ir_type *owner = gr->tp;
72 for (i = 0; i <= pos; i++) {
73 node = get_compound_graph_path_node(gr, i);
75 /* Path not yet complete. */
77 if (get_entity_owner(node) != owner)
79 owner = get_entity_type(node);
81 if (pos == get_compound_graph_path_length(gr))
82 if (!is_atomic_type(owner))
87 size_t get_compound_graph_path_length(const compound_graph_path *gr)
89 assert(gr && is_compound_graph_path(gr));
93 ir_entity *get_compound_graph_path_node(const compound_graph_path *gr,
96 assert(gr && is_compound_graph_path(gr));
97 assert(pos < gr->len);
98 return gr->list[pos].node;
101 void set_compound_graph_path_node(compound_graph_path *gr, size_t pos,
104 assert(gr && is_compound_graph_path(gr));
105 assert(pos < gr->len);
106 assert(is_entity(node));
107 gr->list[pos].node = node;
108 assert(is_proper_compound_graph_path(gr, pos));
111 long get_compound_graph_path_array_index(const compound_graph_path *gr, size_t pos)
113 assert(gr && is_compound_graph_path(gr));
114 assert(pos < gr->len);
115 return gr->list[pos].index;
118 void set_compound_graph_path_array_index(compound_graph_path *gr, size_t pos,
121 assert(gr && is_compound_graph_path(gr));
122 assert(pos < gr->len);
123 gr->list[pos].index = index;
126 ir_type *get_compound_graph_path_type(const compound_graph_path *gr)
128 assert(gr && is_compound_graph_path(gr));
132 static void allocate_values(ir_entity *ent)
134 if (ent->attr.cmpd_attr.values == NULL) {
135 ent->attr.cmpd_attr.values = NEW_ARR_F(ir_node*, 0);
136 assert(ent->attr.cmpd_attr.val_paths == NULL);
137 ent->attr.cmpd_attr.val_paths = NEW_ARR_F(compound_graph_path*, 0);
141 void add_compound_ent_value_w_path(ir_entity *ent, ir_node *val,
142 compound_graph_path *path)
144 assert(is_compound_entity(ent));
145 assert(is_compound_graph_path(path));
146 allocate_values(ent);
147 ARR_APP1(ir_node *, ent->attr.cmpd_attr.values, val);
148 ARR_APP1(compound_graph_path *, ent->attr.cmpd_attr.val_paths, path);
151 void set_compound_ent_value_w_path(ir_entity *ent, ir_node *val,
152 compound_graph_path *path, size_t pos)
154 assert(is_compound_entity(ent));
155 assert(is_compound_graph_path(path));
156 assert(pos < ARR_LEN(ent->attr.cmpd_attr.values));
157 ent->attr.cmpd_attr.values[pos] = val;
158 ent->attr.cmpd_attr.val_paths[pos] = path;
161 compound_graph_path *get_compound_ent_value_path(const ir_entity *ent,
164 assert(is_compound_entity(ent));
165 assert(ent->initializer == NULL);
166 assert(pos < ARR_LEN(ent->attr.cmpd_attr.val_paths));
167 return ent->attr.cmpd_attr.val_paths[pos];
171 * Returns non-zero, if two compound_graph_pathes are equal
173 * @param path1 the first path
174 * @param path2 the second path
176 static bool equal_paths(compound_graph_path *path1, compound_graph_path *path2)
179 size_t len1 = get_compound_graph_path_length(path1);
180 size_t len2 = get_compound_graph_path_length(path2);
182 if (len2 != len1) return false;
184 for (i = 0; i < len1; i++) {
186 ir_entity *node1 = get_compound_graph_path_node(path1, i);
187 ir_entity *node2 = get_compound_graph_path_node(path2, i);
189 if (node1 != node2) return false;
191 tp = get_entity_owner(node1);
192 if (is_Array_type(tp)) {
193 size_t index1 = get_compound_graph_path_array_index(path1, i);
194 size_t index2 = get_compound_graph_path_array_index(path2, i);
195 if (index1 != index2)
203 * Returns the position of a value with the given path.
204 * The path must contain array indices for all array element entities.
206 * @todo This implementation is very slow (O(number of initializers * |path|)
207 * and should be replaced when the new tree oriented
208 * value representation is finally implemented.
210 static size_t get_compound_ent_pos_by_path(const ir_entity *ent,
211 compound_graph_path *path)
213 size_t i, n_paths = get_compound_ent_n_values(ent);
215 for (i = 0; i < n_paths; i ++) {
216 compound_graph_path *gr = get_compound_ent_value_path(ent, i);
217 if (equal_paths(gr, path))
223 ir_node *get_compound_ent_value_by_path(const ir_entity *ent,
224 compound_graph_path *path)
226 size_t pos = get_compound_ent_pos_by_path(ent, path);
227 if (pos != (size_t)-1)
228 return get_compound_ent_value(ent, pos);
232 void remove_compound_ent_value(ir_entity *ent, ir_entity *value_ent)
235 assert(is_compound_entity(ent));
237 n = ARR_LEN(ent->attr.cmpd_attr.val_paths);
238 for (i = 0; i < n; ++i) {
239 compound_graph_path *path = ent->attr.cmpd_attr.val_paths[i];
240 if (path->list[path->len-1].node == value_ent) {
241 for (; i < n - 1; ++i) {
242 ent->attr.cmpd_attr.val_paths[i] = ent->attr.cmpd_attr.val_paths[i+1];
243 ent->attr.cmpd_attr.values[i] = ent->attr.cmpd_attr.values[i+1];
245 ARR_SETLEN(compound_graph_path*, ent->attr.cmpd_attr.val_paths, n - 1);
246 ARR_SETLEN(ir_node*, ent->attr.cmpd_attr.values, n - 1);
252 void add_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member)
254 compound_graph_path *path;
255 ir_type *owner_tp = get_entity_owner(member);
256 assert(is_compound_entity(ent));
257 allocate_values(ent);
258 path = new_compound_graph_path(get_entity_type(ent), 1);
259 path->list[0].node = member;
260 if (is_Array_type(owner_tp)) {
264 assert(get_array_n_dimensions(owner_tp) == 1 && has_array_lower_bound(owner_tp, 0));
265 max = get_array_lower_bound_int(owner_tp, 0) -1;
266 for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
267 long index = get_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0);
272 path->list[0].index = max + 1;
274 add_compound_ent_value_w_path(ent, val, path);
277 ir_entity *get_compound_ent_value_member(const ir_entity *ent, size_t pos)
279 compound_graph_path *path;
280 assert(is_compound_entity(ent));
281 path = get_compound_ent_value_path(ent, pos);
283 return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
286 void set_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member,
289 compound_graph_path *path;
290 assert(is_compound_entity(ent));
291 path = get_compound_ent_value_path(ent, pos);
292 set_compound_graph_path_node(path, 0, member);
293 set_compound_ent_value_w_path(ent, val, path, pos);
296 void set_array_entity_values(ir_entity *ent, ir_tarval **values, size_t num_vals)
299 ir_type *arrtp = get_entity_type(ent);
301 ir_graph *irg = get_const_code_irg();
303 assert(is_Array_type(arrtp));
304 assert(get_array_n_dimensions(arrtp) == 1);
305 /* One bound is sufficient, the number of constant fields makes the
307 assert(get_array_lower_bound (arrtp, 0) || get_array_upper_bound (arrtp, 0));
309 for (i = 0; i < num_vals; i++) {
310 val = new_r_Const(irg, values[i]);
311 add_compound_ent_value(ent, val, get_array_element_entity(arrtp));
312 set_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0, i);
316 unsigned get_compound_ent_value_offset_bytes(const ir_entity *ent, size_t pos)
318 compound_graph_path *path;
323 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
325 path = get_compound_ent_value_path(ent, pos);
326 path_len = get_compound_graph_path_length(path);
329 for (i = 0; i < path_len; ++i) {
330 if (is_Array_type(curr_tp)) {
331 ir_type *elem_type = get_array_element_type(curr_tp);
332 unsigned size = get_type_size_bytes(elem_type);
333 unsigned align = get_type_alignment_bytes(elem_type);
337 if (size % align > 0) {
338 size += align - (size % align);
340 idx = get_compound_graph_path_array_index(path, i);
341 assert(idx != (size_t)-1);
342 offset += size * idx;
345 ir_entity *node = get_compound_graph_path_node(path, i);
346 offset += get_entity_offset(node);
347 curr_tp = get_entity_type(node);
354 unsigned get_compound_ent_value_offset_bit_remainder(const ir_entity *ent,
357 compound_graph_path *path;
359 ir_entity *last_node;
361 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
363 path = get_compound_ent_value_path(ent, pos);
364 path_len = get_compound_graph_path_length(path);
365 last_node = get_compound_graph_path_node(path, path_len - 1);
367 if (last_node == NULL)
370 return get_entity_offset_bits_remainder(last_node);
373 size_t get_compound_ent_n_values(const ir_entity *ent)
375 assert(ent->initializer == NULL);
376 assert(is_compound_entity(ent));
377 allocate_values((ir_entity*) ent);
378 return ARR_LEN(ent->attr.cmpd_attr.values);
381 ir_node *get_compound_ent_value(const ir_entity *ent, size_t pos)
383 assert(is_compound_entity(ent));
384 assert(ent->initializer == NULL);
385 assert(pos < ARR_LEN(ent->attr.cmpd_attr.values));
386 return skip_Id(ent->attr.cmpd_attr.values[pos]);
389 int entity_has_compound_ent_values(const ir_entity *entity)
391 if (!is_compound_entity(entity))
394 return entity->attr.cmpd_attr.values != NULL;