dummy.smaller = smaller;
dummy.larger = larger;
- slot = htab_find_slot (graph->arc_hash_table, (void *) &dummy, 1);
+ slot = htab_find_slot (graph->arc_hash_table, (void *) &dummy, INSERT);
/* If the conflict is already there, do nothing. */
if (*slot != NULL)
TREE_SET_PERMANENT (t);
TREE_OPERAND (t, 0) = node;
- if (node && first_rtl_op (code) != 0)
- {
- if (TREE_SIDE_EFFECTS (node))
- TREE_SIDE_EFFECTS (t) = 1;
- }
+ if (node && first_rtl_op (code) != 0 && TREE_SIDE_EFFECTS (node))
+ TREE_SIDE_EFFECTS (t) = 1;
switch (code)
{
h = (struct type_hash *) permalloc (sizeof (struct type_hash));
h->hash = hashcode;
h->type = type;
- loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, 1);
- *(struct type_hash**)loc = h;
+ loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
+ *(struct type_hash**) loc = h;
}
/* Given TYPE, and HASHCODE its hash code, return the canonical