/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2010 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include <windows.h>
#endif
+#include "debugger.h"
+
#include <stdlib.h>
#include <stdio.h>
#include <signal.h>
#include <string.h>
-
-#ifdef HAVE_STRINGS_H
#include <strings.h>
-#endif
#include <ctype.h>
/**
* 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. */
do { \
debugger_hooks[h].hook._##h = fkt; \
register_hook(h, &debugger_hooks[h]); \
-} while(0)
+} while (0)
/** unhook the hook h */
#define UNHOOK(h) \
do { \
unregister_hook(h, &debugger_hooks[h]); \
debugger_hooks[h].hook._##h = NULL; \
-} while(0)
+} while (0)
/** returns non-zero if a entry hook h is used */
#define IS_HOOKED(h) (debugger_hooks[h].hook._##h != NULL)
#define FIRM_DBG_MINOR 0
/** for automatic detection of the debug extension */
-static const char firm_debug_info_string[] =
+static const char __attribute__((used)) firm_debug_info_string[] =
API_VERSION(FIRM_DBG_MAJOR, FIRM_DBG_MINOR);
-/**
- * Returns non-zero, if the debug extension is active
- */
int firm_debug_active(void)
{
return is_active;
firm_dbg_msg_buf[0] = '\0';
} /* reset_dbg_buf */
-/**
- * Add text to the debug text buffer.
- */
static void add_to_dbg_buf(const char *buf)
{
strncat(firm_dbg_msg_buf, buf, sizeof(firm_dbg_msg_buf));
} /* add_to_dbg_buf */
-/**
- * Return the content of the debug text buffer.
- *
- * To be called from the debugger.
- */
const char *firm_debug_text(void)
{
firm_dbg_msg_buf[sizeof(firm_dbg_msg_buf) - 1] = '\0';
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);
CASE_ON(BP_ON_NEW_ENT, new_entity);
CASE_ON(BP_ON_NEW_TYPE, new_type);
default:
- ;
+ break;
}
}
else {
CASE_OFF(BP_ON_NEW_ENT, new_entity);
CASE_OFF(BP_ON_NEW_TYPE, new_type);
default:
- ;
+ break;
}
}
#undef CASE_ON
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) {
unsigned cur_token; /**< current token. */
unsigned number; /**< current token attribute. */
const char *s; /**< current token attribute. */
- unsigned len; /**< current token attribute. */
+ size_t len; /**< current token attribute. */
const char *curr_pos;
const char *end_pos;
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)
return c;
} /* get_token */
-/**
- * High level function to use from debugger interface
- *
- * See show_commands() for supported commands.
- */
void firm_debug(const char *cmd)
{
char name[1024], fname[1024];
- int len;
+ size_t len;
init_lexer(cmd);
;
} /* firm_debug */
-/* creates the debugger tables */
void firm_init_debugger(void)
{
char *env;
return buf;
}
-/**
- * A gdb helper function to print tarvals.
- */
const char *gdb_tarval_helper(void *tv_object)
{
static char buf[1024];
projects / libfirm / blobdiff