/*
- * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @brief Memory disambiguator
* @author Michael Beck
* @date 27.12.2006
- * @version $Id$
*/
#include "config.h"
/** The global memory disambiguator options. */
static unsigned global_mem_disamgig_opt = aa_opt_no_opt;
-/* Returns a human readable name for an alias relation. */
const char *get_ir_alias_relation_name(ir_alias_relation rel)
{
#define X(a) case a: return #a
#undef X
}
-/* Get the memory disambiguator options for a graph. */
unsigned get_irg_memory_disambiguator_options(const ir_graph *irg)
{
unsigned opt = irg->mem_disambig_opt;
if (opt & aa_opt_inherited)
return global_mem_disamgig_opt;
return opt;
-} /* get_irg_memory_disambiguator_options */
+}
-/* Set the memory disambiguator options for a graph. */
void set_irg_memory_disambiguator_options(ir_graph *irg, unsigned options)
{
irg->mem_disambig_opt = options & ~aa_opt_inherited;
-} /* set_irg_memory_disambiguator_options */
+}
-/* Set the global disambiguator options for all graphs not having local options. */
void set_irp_memory_disambiguator_options(unsigned options)
{
global_mem_disamgig_opt = options;
-} /* set_irp_memory_disambiguator_options */
+}
-/* Get the base storage class (ignore modifier) */
ir_storage_class_class_t get_base_sc(ir_storage_class_class_t x)
{
return x & ~ir_sc_modifiers;
-} /* get_base_sc */
+}
/**
* Find the base address and entity of an Sel node.
}
*pEnt = get_Sel_entity(sel);
return ptr;
-} /* find_base_adr */
+}
/**
* Check if a given Const node is greater or equal a given size.
return tarval_is_null(tv) ? ir_may_alias : ir_no_alias;
tv_size = new_tarval_from_long(size, get_tarval_mode(tv));
return tarval_cmp(tv_size, tv) & (ir_relation_less_equal) ? ir_no_alias : ir_may_alias;
-} /* check_const */
+}
/**
* Treat idx1 and idx2 as integer indexes and check if they differ always more than size.
}
return ir_may_alias;
-} /* different_index */
+}
/**
- * Two Sel addresses have the same base address, check if there offsets are
+ * Two Sel addresses have the same base address, check if their offsets are
* different.
*
* @param adr1 The first address.
*/
static ir_alias_relation different_sel_offsets(const ir_node *sel1, const ir_node *sel2)
{
- /* seems to be broken */
+ /* TODO: fix */
(void) sel1;
(void) sel2;
#if 0
(void) different_index;
#endif
return ir_may_alias;
-} /* different_sel_offsets */
+}
/**
* Determine the alias relation by checking if adr1 and adr2 are pointer
{
ir_entity *ent1 = NULL, *ent2 = NULL;
- if (is_Global(adr1))
- ent1 = get_Global_entity(adr1);
+ if (is_SymConst_addr_ent(adr1))
+ ent1 = get_SymConst_entity(adr1);
else if (is_Sel(adr1))
ent1 = get_Sel_entity(adr1);
- if (is_Global(adr2))
- ent2 = get_Global_entity(adr2);
+ if (is_SymConst_addr_ent(adr2))
+ ent2 = get_SymConst_entity(adr2);
else if (is_Sel(adr2))
ent2 = get_Sel_entity(adr2);
}
}
return ir_may_alias;
-} /* different_types */
+}
/**
* Returns non-zero if a node is a result on a malloc-like routine.
if (! is_Call(node))
return 0;
node = get_Call_ptr(node);
- if (is_Global(node)) {
- ir_entity *ent = get_Global_entity(node);
+ if (is_SymConst_addr_ent(node)) {
+ ir_entity *ent = get_SymConst_entity(node);
if (get_entity_additional_properties(ent) & mtp_property_malloc)
return 1;
return 0;
}
return 0;
-} /* is_malloc_Result */
+}
ir_storage_class_class_t classify_pointer(const ir_node *irn,
const ir_entity *ent)
{
ir_graph *irg = get_irn_irg(irn);
ir_storage_class_class_t res = ir_sc_pointer;
- if (is_Global(irn)) {
- ir_entity *entity = get_Global_entity(irn);
+ if (is_SymConst_addr_ent(irn)) {
+ ir_entity *entity = get_SymConst_entity(irn);
ir_type *owner = get_entity_owner(entity);
res = owner == get_tls_type() ? ir_sc_tls : ir_sc_globalvar;
if (! (get_entity_usage(entity) & ir_usage_address_taken))
/* access points-to information here */
return ir_may_alias;
-} /* _get_alias_relation */
+}
-/*
- * Determine the alias relation between two addresses.
- */
ir_alias_relation get_alias_relation(
const ir_node *adr1, const ir_mode *mode1,
const ir_node *adr2, const ir_mode *mode2)
ir_alias_relation rel = _get_alias_relation(adr1, mode1, adr2, mode2);
DB((dbg, LEVEL_1, "alias(%+F, %+F) = %s\n", adr1, adr2, get_ir_alias_relation_name(rel)));
return rel;
-} /* get_alias_relation */
+}
-/* Set a source language specific memory disambiguator function. */
void set_language_memory_disambiguator(DISAMBIGUATOR_FUNC func)
{
language_disambuigator = func;
-} /* set_language_memory_disambiguator */
+}
/** The result cache for the memory disambiguator. */
static set *result_cache = NULL;
ir_alias_relation result; /**< The alias relation result. */
} mem_disambig_entry;
-#define HASH_ENTRY(adr1, adr2) (HASH_PTR(adr1) ^ HASH_PTR(adr2))
+#define HASH_ENTRY(adr1, adr2) (hash_ptr(adr1) ^ hash_ptr(adr2))
/**
* Compare two relation cache entries.
return p1->adr1 == p2->adr1 && p1->adr2 == p2->adr2 &&
p1->mode1 == p2->mode1 && p1->mode2 == p2->mode2;
-} /* cmp_mem_disambig_entry */
+}
-/**
- * Initialize the relation cache.
- */
void mem_disambig_init(void)
{
result_cache = new_set(cmp_mem_disambig_entry, 8);
-} /* mem_disambig_init */
+}
-/*
- * Determine the alias relation between two addresses.
- */
ir_alias_relation get_alias_relation_ex(
const ir_node *adr1, const ir_mode *mode1,
const ir_node *adr2, const ir_mode *mode2)
key.adr2 = adr2;
key.mode1 = mode1;
key.mode2 = mode2;
- entry = (mem_disambig_entry*) set_find(result_cache, &key, sizeof(key), HASH_ENTRY(adr1, adr2));
+ entry = set_find(mem_disambig_entry, result_cache, &key, sizeof(key), HASH_ENTRY(adr1, adr2));
if (entry != NULL)
return entry->result;
key.result = get_alias_relation(adr1, mode1, adr2, mode2);
- set_insert(result_cache, &key, sizeof(key), HASH_ENTRY(adr1, adr2));
+ (void)set_insert(mem_disambig_entry, result_cache, &key, sizeof(key), HASH_ENTRY(adr1, adr2));
return key.result;
-} /* get_alias_relation_ex */
+}
-/* Free the relation cache. */
void mem_disambig_term(void)
{
if (result_cache != NULL) {
del_set(result_cache);
result_cache = NULL;
}
-} /* mem_disambig_term */
+}
/**
* Check the mode of a Load/Store with the mode of the entity
if (ent_mode != mode) {
if (ent_mode == NULL ||
get_mode_size_bits(ent_mode) != get_mode_size_bits(mode) ||
- get_mode_sort(ent_mode) != get_mode_sort(mode) ||
get_mode_arithmetic(ent_mode) != irma_twos_complement ||
get_mode_arithmetic(mode) != irma_twos_complement)
return true;
}
return false;
-} /* is_hidden_cast */
+}
/**
* Determine the usage state of a node (or its successor Sels).
size_t i, n;
int j, k, static_link_arg;
+ assure_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
+
/* set initial state to not_taken, as this is the "smallest" state */
for (i = 0, n = get_class_n_members(ft); i < n; ++i) {
ir_entity *ent = get_class_member(ft, i);
}
}
- assure_irg_outs(irg);
-
irg_frame = get_irg_frame(irg);
for (j = get_irn_n_outs(irg_frame) - 1; j >= 0; --j) {
}
}
-
/* now computed */
- set_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE);
+ add_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_ENTITY_USAGE);
}
void assure_irg_entity_usage_computed(ir_graph *irg)
{
- if (is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE))
+ if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_ENTITY_USAGE))
return;
analyse_irg_entity_usage(irg);
case IR_INITIALIZER_CONST:
/* let's check if it's an address */
n = initializer->consti.value;
- if (is_Global(n)) {
- ir_entity *ent = get_Global_entity(n);
+ if (is_SymConst_addr_ent(n)) {
+ ir_entity *ent = get_SymConst_entity(n);
set_entity_usage(ent, ir_usage_unknown);
}
return;
return;
}
panic("invalid initializer found");
-} /* check_initializer_nodes */
+}
/**
* Mark all entities used in the initializer for the given entity as unknown
if (ent->initializer != NULL) {
check_initializer_nodes(ent->initializer);
- } else if (entity_has_compound_ent_values(ent)) {
- size_t i, n;
-
- for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
- ir_node *irn = get_compound_ent_value(ent, i);
-
- /* let's check if it's an address */
- if (is_Global(irn)) {
- ir_entity *symconst_ent = get_Global_entity(irn);
- set_entity_usage(symconst_ent, ir_usage_unknown);
- }
- }
}
}
check_initializer(ent);
}
-} /* check_initializers */
+}
#ifdef DEBUG_libfirm
/**
unsigned flags;
(void) data;
- if (is_Global(irn)) {
+ if (is_SymConst_addr_ent(irn)) {
/* A global. */
- ent = get_Global_entity(irn);
+ ent = get_SymConst_entity(irn);
} else
return;
flags = get_entity_usage(ent);
flags |= determine_entity_usage(irn, ent);
set_entity_usage(ent, (ir_entity_usage) flags);
-} /* check_global_address */
+}
/**
* Update the entity usage flags of all global entities.
irp->globals_entity_usage_state = ir_entity_usage_computed;
}
-/* Returns the current address taken state of the globals. */
ir_entity_usage_computed_state get_irp_globals_entity_usage_state(void)
{
return irp->globals_entity_usage_state;
}
-/* Sets the current address taken state of the graph. */
void set_irp_globals_entity_usage_state(ir_entity_usage_computed_state state)
{
irp->globals_entity_usage_state = state;
}
-/* Assure that the address taken flag is computed for the globals. */
void assure_irp_globals_entity_usage_computed(void)
{
if (irp->globals_entity_usage_state != ir_entity_usage_not_computed)
*/
static ir_type *clone_type_and_cache(ir_type *tp)
{
- ir_type *res;
- pmap_entry *e = pmap_find(mtp_map, tp);
-
- if (e != NULL)
- return (ir_type*) e->value;
+ ir_type *res = pmap_get(ir_type, mtp_map, tp);
- res = clone_type_method(tp);
- pmap_insert(mtp_map, tp, res);
+ if (res == NULL) {
+ res = clone_type_method(tp);
+ pmap_insert(mtp_map, tp, res);
+ }
return res;
-} /* clone_type_and_cache */
+}
/**
* Walker: clone all call types of Calls to methods having the
}
}
}
-} /* update_calls_to_private */
+}
-/* Mark all private methods, i.e. those of which all call sites are known. */
void mark_private_methods(void)
{
size_t i, n;
all_irg_walk(NULL, update_calls_to_private, NULL);
pmap_destroy(mtp_map);
-} /* mark_private_methods */
+}
-/* create a pass for mark_private_methods() */
ir_prog_pass_t *mark_private_methods_pass(const char *name)
{
return def_prog_pass(name ? name : "mark_private_methods", mark_private_methods);
-} /* mark_private_methods_pass */
+}
projects / libfirm / blobdiff