s32 build_deps (dictionary *dict, s32 A, s32 B, char *refstr, ocrMappable_t ***all_instances, ocrParamList_t ***inst_params) {
s32 i, j, k;
s32 low, high;
s32 l, h;
for (i = 0; i < iniparser_getnsec(dict); i++) {
// Go thru the secnames looking for instances of A
if (strncasecmp(inst_str[A], iniparser_getsecname(dict, i), strlen(inst_str[A]))==0) {
// For each secname, look up corresponding instance of A through id
read_range(dict, iniparser_getsecname(dict, i), "id", &low, &high);
for (j = low; j <= high; j++) {
// Parse corresponding dependences from secname
read_range(dict, iniparser_getsecname(dict, i), refstr, &l, &h);
// Connect A with B
// Using a rough heuristic for now: if |from| == |to| then 1:1, else all:all TODO: What else makes sense here?
if (h-l == high-low) {
k = l+j-low;
add_dependence(A, B, all_instances[A][j], inst_params[A][j], all_instances[B][k], inst_params[B][k], 0, 1);
} else {
for (k = l; k <= h; k++) {
add_dependence(A, B, all_instances[A][j], inst_params[A][j], all_instances[B][k], inst_params[B][k], k-l, h-l+1);
}
}
}
}
}
return 0;
}
static void
process_replaceable (temp_expr_table_p tab, gimple stmt)
{
tree var, def, basevar;
int version;
ssa_op_iter iter;
bitmap def_vars, use_vars;
#ifdef ENABLE_CHECKING
gcc_assert (is_replaceable_p (stmt));
#endif
def = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_DEF);
version = SSA_NAME_VERSION (def);
basevar = SSA_NAME_VAR (def);
def_vars = BITMAP_ALLOC (NULL);
bitmap_set_bit (def_vars, DECL_UID (basevar));
/* Add this expression to the dependency list for each use partition. */
FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_USE)
{
int var_version = SSA_NAME_VERSION (var);
use_vars = tab->expr_decl_uids[var_version];
add_dependence (tab, version, var);
if (use_vars)
{
bitmap_ior_into (def_vars, use_vars);
BITMAP_FREE (tab->expr_decl_uids[var_version]);
}
else
bitmap_set_bit (def_vars, DECL_UID (SSA_NAME_VAR (var)));
}
