/**
* Reasons for node number breakpoints.
*/
-typedef enum _bp_reasons_t {
+typedef enum bp_reasons_t {
BP_ON_NEW_NODE, /**< break if node with number is created */
BP_ON_REPLACE, /**< break if node with number is replaced */
BP_ON_LOWER, /**< break if node with number is lowered */
} bp_reasons_t;
/** A breakpoint. */
-typedef struct _breakpoint {
+typedef struct breakpoint {
bp_kind kind; /**< the kind of this break point */
unsigned bpnr; /**< break point number */
int active; /**< non-zero, if this break point is active */
bp_reasons_t reason; /**< reason for the breakpoint */
- struct _breakpoint *next; /**< link to the next one */
+ struct breakpoint *next; /**< link to the next one */
} breakpoint;
/** A number breakpoint. */
key.nr = get_irn_node_nr(node);
key.bp.reason = BP_ON_NEW_NODE;
- elem = set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem && elem->bp.active) {
dbg_printf("Firm BP %u reached, %+F created\n", elem->bp.bpnr, node);
firm_debug_break();
key.nr = get_irn_node_nr(old);
key.bp.reason = BP_ON_REPLACE;
- elem = set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem && elem->bp.active) {
dbg_printf("Firm BP %u reached, %+F will be replaced by %+F\n", elem->bp.bpnr, old, nw);
firm_debug_break();
key.nr = get_irn_node_nr(node);
key.bp.reason = BP_ON_LOWER;
- elem = set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem && elem->bp.active) {
dbg_printf("Firm BP %u reached, %+F will be lowered\n", elem->bp.bpnr, node);
firm_debug_break();
key.nr = get_irg_graph_nr(irg);
key.bp.reason = BP_ON_REMIRG;
- elem = set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem && elem->bp.active) {
ir_printf("Firm BP %u reached, %+F will be deleted\n", elem->bp.bpnr, irg);
firm_debug_break();
key.id = get_entity_ident(ent);
key.bp.reason = BP_ON_REMIRG;
- elem = set_find(bp_idents, &key, sizeof(key), HASH_IDENT_BP(key));
+ elem = (bp_ident_t*)set_find(bp_idents, &key, sizeof(key), HASH_IDENT_BP(key));
if (elem && elem->bp.active) {
dbg_printf("Firm BP %u reached, %+F will be deleted\n", elem->bp.bpnr, ent);
firm_debug_break();
key.id = get_entity_ident(ent);
key.bp.reason = BP_ON_NEW_ENT;
- elem = set_find(bp_idents, &key, sizeof(key), HASH_IDENT_BP(key));
+ elem = (bp_ident_t*)set_find(bp_idents, &key, sizeof(key), HASH_IDENT_BP(key));
if (elem && elem->bp.active) {
ir_printf("Firm BP %u reached, %+F was created\n", elem->bp.bpnr, ent);
firm_debug_break();
key.nr = get_entity_nr(ent);
key.bp.reason = BP_ON_NEW_ENT;
- elem = set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem && elem->bp.active) {
dbg_printf("Firm BP %u reached, %+F was created\n", elem->bp.bpnr, ent);
firm_debug_break();
key.nr = get_type_nr(tp);
key.bp.reason = BP_ON_NEW_TYPE;
- elem = set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_find(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem && elem->bp.active) {
ir_printf("Firm BP %u reached, %+F was created\n", elem->bp.bpnr, tp);
firm_debug_break();
*/
static int cmp_nr_bp(const void *elt, const void *key, size_t size)
{
- const bp_nr_t *e1 = elt;
- const bp_nr_t *e2 = key;
+ const bp_nr_t *e1 = (const bp_nr_t*)elt;
+ const bp_nr_t *e2 = (const bp_nr_t*)key;
(void) size;
return (e1->nr - e2->nr) | (e1->bp.reason - e2->bp.reason);
*/
static int cmp_ident_bp(const void *elt, const void *key, size_t size)
{
- const bp_ident_t *e1 = elt;
- const bp_ident_t *e2 = key;
+ const bp_ident_t *e1 = (const bp_ident_t*)elt;
+ const bp_ident_t *e2 = (const bp_ident_t*)key;
(void) size;
return (e1->id != e2->id) | (e1->bp.reason - e2->bp.reason);
key.bp.reason = reason;
key.nr = nr;
- elem = set_insert(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
+ elem = (bp_nr_t*)set_insert(bp_numbers, &key, sizeof(key), HASH_NR_BP(key));
if (elem->bp.bpnr == 0) {
/* new break point */
key.bp.reason = reason;
key.id = new_id_from_str(name);
- elem = set_insert(bp_idents, &key, sizeof(key), HASH_IDENT_BP(key));
+ elem = (bp_ident_t*)set_insert(bp_idents, &key, sizeof(key), HASH_IDENT_BP(key));
if (elem->bp.bpnr == 0) {
/* new break point */
fprintf(f, "BAD: (%p)\n", firm_thing);
break;
case k_entity:
- dump_entity_to_file(f, firm_thing, dump_verbosity_max);
+ dump_entity_to_file(f, (ir_entity*)firm_thing);
break;
case k_type:
- dump_type_to_file(f, firm_thing, dump_verbosity_max);
+ dump_type_to_file(f, (ir_type*)firm_thing);
break;
case k_ir_graph:
case k_ir_node:
*/
static void check_ent_nr(type_or_ent tore, void *ctx)
{
- find_env_t *env = ctx;
+ find_env_t *env = (find_env_t*)ctx;
if (is_entity(tore.ent)) {
if (get_entity_nr(tore.ent) == env->u.nr) {
*/
static void check_ent_name(type_or_ent tore, void *ctx)
{
- find_env_t *env = ctx;
+ find_env_t *env = (find_env_t*)ctx;
if (is_entity(tore.ent))
if (strcmp(get_entity_name(tore.ent), env->u.name) == 0) {
return *lexer.curr_pos++;
} /* next_char */
-#define unput() if (lexer.curr_pos < lexer.end_pos) --lexer.curr_pos
+#define unput() if (lexer.curr_pos < lexer.end_pos) --lexer.curr_pos
#undef MIN
#define MIN(a, b) (a) < (b) ? (a) : (b)