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
31 #include "firm_types.h"
33 #include "compound_path_t.h"
37 #include "irgraph_t.h"
40 compound_graph_path *new_compound_graph_path(ir_type *tp, size_t length)
42 compound_graph_path *res;
44 assert(is_compound_type(tp) || is_Array_type(tp));
47 res = XMALLOCFZ(compound_graph_path, list, length);
48 res->kind = k_ir_compound_graph_path;
55 void free_compound_graph_path(compound_graph_path *gr)
57 assert(gr && is_compound_graph_path(gr));
62 int is_compound_graph_path(const void *thing)
64 return get_kind(thing) == k_ir_compound_graph_path;
67 int is_proper_compound_graph_path(compound_graph_path *gr, size_t pos)
71 ir_type *owner = gr->tp;
73 for (i = 0; i <= pos; i++) {
74 node = get_compound_graph_path_node(gr, i);
76 /* Path not yet complete. */
78 if (get_entity_owner(node) != owner)
80 owner = get_entity_type(node);
82 if (pos == get_compound_graph_path_length(gr))
83 if (!is_atomic_type(owner))
88 size_t get_compound_graph_path_length(const compound_graph_path *gr)
90 assert(gr && is_compound_graph_path(gr));
94 ir_entity *get_compound_graph_path_node(const compound_graph_path *gr,
97 assert(gr && is_compound_graph_path(gr));
98 assert(pos < gr->len);
99 return gr->list[pos].node;
102 void set_compound_graph_path_node(compound_graph_path *gr, size_t pos,
105 assert(gr && is_compound_graph_path(gr));
106 assert(pos < gr->len);
107 assert(is_entity(node));
108 gr->list[pos].node = node;
109 assert(is_proper_compound_graph_path(gr, pos));
112 long get_compound_graph_path_array_index(const compound_graph_path *gr, size_t pos)
114 assert(gr && is_compound_graph_path(gr));
115 assert(pos < gr->len);
116 return gr->list[pos].index;
119 void set_compound_graph_path_array_index(compound_graph_path *gr, size_t pos,
122 assert(gr && is_compound_graph_path(gr));
123 assert(pos < gr->len);
124 gr->list[pos].index = index;
127 ir_type *get_compound_graph_path_type(const compound_graph_path *gr)
129 assert(gr && is_compound_graph_path(gr));
133 static void allocate_values(ir_entity *ent)
135 if (ent->attr.cmpd_attr.values == NULL) {
136 ent->attr.cmpd_attr.values = NEW_ARR_F(ir_node*, 0);
137 assert(ent->attr.cmpd_attr.val_paths == NULL);
138 ent->attr.cmpd_attr.val_paths = NEW_ARR_F(compound_graph_path*, 0);
142 void add_compound_ent_value_w_path(ir_entity *ent, ir_node *val,
143 compound_graph_path *path)
145 assert(is_compound_entity(ent));
146 assert(is_compound_graph_path(path));
147 allocate_values(ent);
148 ARR_APP1(ir_node *, ent->attr.cmpd_attr.values, val);
149 ARR_APP1(compound_graph_path *, ent->attr.cmpd_attr.val_paths, path);
152 void set_compound_ent_value_w_path(ir_entity *ent, ir_node *val,
153 compound_graph_path *path, size_t pos)
155 assert(is_compound_entity(ent));
156 assert(is_compound_graph_path(path));
157 assert(pos < ARR_LEN(ent->attr.cmpd_attr.values));
158 ent->attr.cmpd_attr.values[pos] = val;
159 ent->attr.cmpd_attr.val_paths[pos] = path;
162 compound_graph_path *get_compound_ent_value_path(const ir_entity *ent,
165 assert(is_compound_entity(ent));
166 assert(ent->initializer == NULL);
167 assert(pos < ARR_LEN(ent->attr.cmpd_attr.val_paths));
168 return ent->attr.cmpd_attr.val_paths[pos];
172 * Returns non-zero, if two compound_graph_pathes are equal
174 * @param path1 the first path
175 * @param path2 the second path
177 static bool equal_paths(compound_graph_path *path1, compound_graph_path *path2)
180 size_t len1 = get_compound_graph_path_length(path1);
181 size_t len2 = get_compound_graph_path_length(path2);
183 if (len2 != len1) return false;
185 for (i = 0; i < len1; i++) {
187 ir_entity *node1 = get_compound_graph_path_node(path1, i);
188 ir_entity *node2 = get_compound_graph_path_node(path2, i);
190 if (node1 != node2) return false;
192 tp = get_entity_owner(node1);
193 if (is_Array_type(tp)) {
194 size_t index1 = get_compound_graph_path_array_index(path1, i);
195 size_t index2 = get_compound_graph_path_array_index(path2, i);
196 if (index1 != index2)
204 * Returns the position of a value with the given path.
205 * The path must contain array indices for all array element entities.
207 * @todo This implementation is very slow (O(number of initializers * |path|)
208 * and should be replaced when the new tree oriented
209 * value representation is finally implemented.
211 static size_t get_compound_ent_pos_by_path(const ir_entity *ent,
212 compound_graph_path *path)
214 size_t i, n_paths = get_compound_ent_n_values(ent);
216 for (i = 0; i < n_paths; i ++) {
217 compound_graph_path *gr = get_compound_ent_value_path(ent, i);
218 if (equal_paths(gr, path))
224 ir_node *get_compound_ent_value_by_path(const ir_entity *ent,
225 compound_graph_path *path)
227 size_t pos = get_compound_ent_pos_by_path(ent, path);
228 if (pos != (size_t)-1)
229 return get_compound_ent_value(ent, pos);
233 void remove_compound_ent_value(ir_entity *ent, ir_entity *value_ent)
236 assert(is_compound_entity(ent));
238 n = ARR_LEN(ent->attr.cmpd_attr.val_paths);
239 for (i = 0; i < n; ++i) {
240 compound_graph_path *path = ent->attr.cmpd_attr.val_paths[i];
241 if (path->list[path->len-1].node == value_ent) {
242 for (; i < n - 1; ++i) {
243 ent->attr.cmpd_attr.val_paths[i] = ent->attr.cmpd_attr.val_paths[i+1];
244 ent->attr.cmpd_attr.values[i] = ent->attr.cmpd_attr.values[i+1];
246 ARR_SETLEN(compound_graph_path*, ent->attr.cmpd_attr.val_paths, n - 1);
247 ARR_SETLEN(ir_node*, ent->attr.cmpd_attr.values, n - 1);
253 void add_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member)
255 compound_graph_path *path;
256 ir_type *owner_tp = get_entity_owner(member);
257 assert(is_compound_entity(ent));
258 allocate_values(ent);
259 path = new_compound_graph_path(get_entity_type(ent), 1);
260 path->list[0].node = member;
261 if (is_Array_type(owner_tp)) {
265 assert(get_array_n_dimensions(owner_tp) == 1 && has_array_lower_bound(owner_tp, 0));
266 max = get_array_lower_bound_int(owner_tp, 0) -1;
267 for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
268 long index = get_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0);
273 path->list[0].index = max + 1;
275 add_compound_ent_value_w_path(ent, val, path);
278 ir_entity *get_compound_ent_value_member(const ir_entity *ent, size_t pos)
280 compound_graph_path *path;
281 assert(is_compound_entity(ent));
282 path = get_compound_ent_value_path(ent, pos);
284 return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
287 void set_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member,
290 compound_graph_path *path;
291 assert(is_compound_entity(ent));
292 path = get_compound_ent_value_path(ent, pos);
293 set_compound_graph_path_node(path, 0, member);
294 set_compound_ent_value_w_path(ent, val, path, pos);
297 void set_array_entity_values(ir_entity *ent, ir_tarval **values, size_t num_vals)
300 ir_type *arrtp = get_entity_type(ent);
302 ir_graph *irg = get_const_code_irg();
304 assert(is_Array_type(arrtp));
305 assert(get_array_n_dimensions(arrtp) == 1);
306 /* One bound is sufficient, the number of constant fields makes the
308 assert(get_array_lower_bound (arrtp, 0) || get_array_upper_bound (arrtp, 0));
310 for (i = 0; i < num_vals; i++) {
311 val = new_r_Const(irg, values[i]);
312 add_compound_ent_value(ent, val, get_array_element_entity(arrtp));
313 set_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0, i);
317 unsigned get_compound_ent_value_offset_bytes(const ir_entity *ent, size_t pos)
319 compound_graph_path *path;
324 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
326 path = get_compound_ent_value_path(ent, pos);
327 path_len = get_compound_graph_path_length(path);
330 for (i = 0; i < path_len; ++i) {
331 if (is_Array_type(curr_tp)) {
332 ir_type *elem_type = get_array_element_type(curr_tp);
333 unsigned size = get_type_size_bytes(elem_type);
334 unsigned align = get_type_alignment_bytes(elem_type);
338 if (size % align > 0) {
339 size += align - (size % align);
341 idx = get_compound_graph_path_array_index(path, i);
342 assert(idx != (size_t)-1);
343 offset += size * idx;
346 ir_entity *node = get_compound_graph_path_node(path, i);
347 offset += get_entity_offset(node);
348 curr_tp = get_entity_type(node);
355 unsigned get_compound_ent_value_offset_bit_remainder(const ir_entity *ent,
358 compound_graph_path *path;
360 ir_entity *last_node;
362 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
364 path = get_compound_ent_value_path(ent, pos);
365 path_len = get_compound_graph_path_length(path);
366 last_node = get_compound_graph_path_node(path, path_len - 1);
368 if (last_node == NULL)
371 return get_entity_offset_bits_remainder(last_node);
374 size_t get_compound_ent_n_values(const ir_entity *ent)
376 assert(ent->initializer == NULL);
377 assert(is_compound_entity(ent));
378 allocate_values((ir_entity*) ent);
379 return ARR_LEN(ent->attr.cmpd_attr.values);
382 ir_node *get_compound_ent_value(const ir_entity *ent, size_t pos)
384 assert(is_compound_entity(ent));
385 assert(ent->initializer == NULL);
386 assert(pos < ARR_LEN(ent->attr.cmpd_attr.values));
387 return skip_Id(ent->attr.cmpd_attr.values[pos]);
390 int entity_has_compound_ent_values(const ir_entity *entity)
392 if (!is_compound_entity(entity))
395 return entity->attr.cmpd_attr.values != NULL;