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 * @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, int length)
41 compound_graph_path *res;
43 assert(is_compound_type(tp));
46 res = xmalloc(sizeof(*res) + (length-1) * sizeof(res->list[0]));
47 memset(res, 0, sizeof(*res) + (length-1) * sizeof(res->list[0]));
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, int 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 int 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, int pos)
96 assert(gr && is_compound_graph_path(gr));
97 assert(pos >= 0 && pos < gr->len);
98 return gr->list[pos].node;
101 void set_compound_graph_path_node(compound_graph_path *gr, int pos,
104 assert(gr && is_compound_graph_path(gr));
105 assert(pos >= 0 && pos < gr->len);
106 assert(is_entity(node));
107 gr->list[pos].node = node;
108 assert(is_proper_compound_graph_path(gr, pos));
111 int get_compound_graph_path_array_index(const compound_graph_path *gr, int pos)
113 assert(gr && is_compound_graph_path(gr));
114 assert(pos >= 0 && pos < gr->len);
115 return gr->list[pos].index;
118 void set_compound_graph_path_array_index(compound_graph_path *gr, int pos,
121 assert(gr && is_compound_graph_path(gr));
122 assert(pos >= 0 && 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, int pos)
154 assert(is_compound_entity(ent));
155 assert(is_compound_graph_path(path));
156 assert(0 <= pos && 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, int pos)
163 assert(is_compound_entity(ent));
164 assert(ent->initializer == NULL);
165 assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.val_paths));
166 return ent->attr.cmpd_attr.val_paths[pos];
170 * Returns non-zero, if two compound_graph_pathes are equal
172 * @param path1 the first path
173 * @param path2 the second path
175 static int equal_paths(compound_graph_path *path1, compound_graph_path *path2)
178 int len1 = get_compound_graph_path_length(path1);
179 int len2 = get_compound_graph_path_length(path2);
181 if (len2 != len1) return 0;
183 for (i = 0; i < len1; i++) {
185 ir_entity *node1 = get_compound_graph_path_node(path1, i);
186 ir_entity *node2 = get_compound_graph_path_node(path2, i);
188 if (node1 != node2) return 0;
190 tp = get_entity_owner(node1);
191 if (is_Array_type(tp)) {
192 int index1 = get_compound_graph_path_array_index(path1, i);
193 int index2 = get_compound_graph_path_array_index(path2, i);
194 if (index1 != index2)
202 * Returns the position of a value with the given path.
203 * The path must contain array indices for all array element entities.
205 * @todo This implementation is very slow (O(number of initializers * |path|)
206 * and should be replaced when the new tree oriented
207 * value representation is finally implemented.
209 static int get_compound_ent_pos_by_path(const ir_entity *ent,
210 compound_graph_path *path)
212 int i, n_paths = get_compound_ent_n_values(ent);
214 for (i = 0; i < n_paths; i ++) {
215 compound_graph_path *gr = get_compound_ent_value_path(ent, i);
216 if (equal_paths(gr, path))
222 ir_node *get_compound_ent_value_by_path(const ir_entity *ent,
223 compound_graph_path *path)
225 int pos = get_compound_ent_pos_by_path(ent, path);
227 return get_compound_ent_value(ent, pos);
231 void remove_compound_ent_value(ir_entity *ent, ir_entity *value_ent)
234 assert(is_compound_entity(ent));
236 n = ARR_LEN(ent->attr.cmpd_attr.val_paths);
237 for (i = 0; i < n; ++i) {
238 compound_graph_path *path = ent->attr.cmpd_attr.val_paths[i];
239 if (path->list[path->len-1].node == value_ent) {
240 for (; i < n - 1; ++i) {
241 ent->attr.cmpd_attr.val_paths[i] = ent->attr.cmpd_attr.val_paths[i+1];
242 ent->attr.cmpd_attr.values[i] = ent->attr.cmpd_attr.values[i+1];
244 ARR_SETLEN(ir_entity*, ent->attr.cmpd_attr.val_paths, n - 1);
245 ARR_SETLEN(ir_node*, ent->attr.cmpd_attr.values, n - 1);
251 void add_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member)
253 compound_graph_path *path;
254 ir_type *owner_tp = get_entity_owner(member);
255 assert(is_compound_entity(ent));
256 allocate_values(ent);
257 path = new_compound_graph_path(get_entity_type(ent), 1);
258 path->list[0].node = member;
259 if (is_Array_type(owner_tp)) {
263 assert(get_array_n_dimensions(owner_tp) == 1 && has_array_lower_bound(owner_tp, 0));
264 max = get_array_lower_bound_int(owner_tp, 0) -1;
265 for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
266 int index = get_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0);
271 path->list[0].index = max + 1;
273 add_compound_ent_value_w_path(ent, val, path);
276 ir_entity *get_compound_ent_value_member(const ir_entity *ent, int pos)
278 compound_graph_path *path;
279 assert(is_compound_entity(ent));
280 path = get_compound_ent_value_path(ent, pos);
282 return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
285 void set_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member,
288 compound_graph_path *path;
289 assert(is_compound_entity(ent));
290 path = get_compound_ent_value_path(ent, pos);
291 set_compound_graph_path_node(path, 0, member);
292 set_compound_ent_value_w_path(ent, val, path, pos);
295 void set_array_entity_values(ir_entity *ent, tarval **values, int num_vals)
298 ir_graph *rem = current_ir_graph;
299 ir_type *arrtp = get_entity_type(ent);
301 ir_type *elttp = get_array_element_type(arrtp);
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));
308 current_ir_graph = get_const_code_irg();
310 for (i = 0; i < num_vals; i++) {
311 val = new_Const_type(values[i], elttp);
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);
315 current_ir_graph = rem;
318 unsigned get_compound_ent_value_offset_bytes(const ir_entity *ent, int pos)
320 compound_graph_path *path;
325 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
327 path = get_compound_ent_value_path(ent, pos);
328 path_len = get_compound_graph_path_length(path);
331 for (i = 0; i < path_len; ++i) {
332 if (is_Array_type(curr_tp)) {
333 ir_type *elem_type = get_array_element_type(curr_tp);
334 unsigned size = get_type_size_bytes(elem_type);
335 unsigned align = get_type_alignment_bytes(elem_type);
339 if (size % align > 0) {
340 size += align - (size % align);
342 idx = get_compound_graph_path_array_index(path, i);
344 offset += size * idx;
347 ir_entity *node = get_compound_graph_path_node(path, i);
348 offset += get_entity_offset(node);
349 curr_tp = get_entity_type(node);
356 unsigned get_compound_ent_value_offset_bit_remainder(const ir_entity *ent,
359 compound_graph_path *path;
361 ir_entity *last_node;
363 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
365 path = get_compound_ent_value_path(ent, pos);
366 path_len = get_compound_graph_path_length(path);
367 last_node = get_compound_graph_path_node(path, path_len - 1);
369 if (last_node == NULL)
372 return get_entity_offset_bits_remainder(last_node);
375 int get_compound_ent_n_values(const ir_entity *ent)
377 assert(ent->initializer == NULL);
378 assert(is_compound_entity(ent));
379 allocate_values((ir_entity*) ent);
380 return ARR_LEN(ent->attr.cmpd_attr.values);
383 ir_node *get_compound_ent_value(const ir_entity *ent, int pos)
385 assert(is_compound_entity(ent));
386 assert(ent->initializer == NULL);
387 assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values));
388 return skip_Id(ent->attr.cmpd_attr.values[pos]);
391 int entity_has_compound_ent_values(const ir_entity *entity)
393 if (!is_compound_entity(entity))
396 return entity->attr.cmpd_attr.values != NULL;