Commit ab182d4b authored by Matthias Braun's avatar Matthias Braun
Browse files

identifiers starting with _ are reserved; remove this bad practice

[r27924]
parent 60a41f4f
......@@ -28,7 +28,7 @@
#include "../begin.h"
typedef struct _bipartite_t bipartite_t;
typedef struct bipartite_t bipartite_t;
FIRM_API bipartite_t *bipartite_new(int n_left, int n_right);
FIRM_API void bipartite_free(bipartite_t *gr);
......
......@@ -5,7 +5,7 @@
#include "../begin.h"
typedef struct _gs_matrix_t gs_matrix_t;
typedef struct gs_matrix_t gs_matrix_t;
/**
* Allocate a new matrix and init internal data for a matrix of size
......
......@@ -44,7 +44,7 @@
*/
#define is_iterator(ptr) (((const iterator_t *) (ptr))->magic == ITERATOR_MAGIC)
typedef struct _iterator_t {
typedef struct iterator_t {
unsigned magic;
void *(*start)(void *collection);
void *(*next)(void *collection, void *curr);
......
......@@ -40,13 +40,13 @@
#include "../begin.h"
typedef struct _plist_element plist_element_t;
typedef struct _plist plist_t;
typedef struct plist_element plist_element_t;
typedef struct plist plist_t;
/**
* The plist data type.
*/
struct _plist {
struct plist {
/**
* The obstack used for all allocations.
*/
......@@ -81,7 +81,7 @@ struct _plist {
/**
* An element in the pointer list.
*/
struct _plist_element {
struct plist_element {
plist_element_t *next;
plist_element_t *prev;
void *data;
......
......@@ -30,7 +30,7 @@
#include "../begin.h"
typedef struct _pqueue_t pqueue_t;
typedef struct pqueue_t pqueue_t;
/**
* Creates a new priority queue.
......
......@@ -33,7 +33,7 @@
* libFirm initialization parameters.
* @deprecated
*/
struct _firm_parameter_t {
struct firm_parameter_t {
/**
* The size of this structure. init_firm() will only initialize
* this amount of data. This allows to add more fields to this structure
......@@ -84,7 +84,7 @@ struct _firm_parameter_t {
void *dummy;
};
typedef struct _firm_parameter_t firm_parameter_t;
typedef struct firm_parameter_t firm_parameter_t;
/**
* Initialize the firm library.
......
......@@ -34,11 +34,11 @@ typedef unsigned long ir_label_t;
typedef struct dbg_info dbg_info, *dbg_info_ptr;
typedef struct type_dbg_info type_dbg_info, *type_dbg_info_ptr;
typedef const struct _ident ident, *ir_ident_ptr;
typedef const struct ident ident, *ir_ident_ptr;
typedef struct ir_node ir_node, *ir_node_ptr;
typedef struct ir_op ir_op, *ir_op_ptr;
typedef struct ir_mode ir_mode, *ir_mode_ptr;
typedef struct _ir_edge_t ir_edge_t, *ir_edge_ptr;
typedef struct ir_edge_t ir_edge_t, *ir_edge_ptr;
typedef struct tarval tarval, *ir_tarval_ptr;
typedef struct ir_enum_const ir_enum_const, *ir_enum_const_ptr;
typedef struct ir_type ir_type, *ir_type_ptr;
......@@ -48,7 +48,7 @@ typedef struct ir_loop ir_loop, *ir_loop_ptr;
typedef struct ir_region ir_region, *ir_region_ptr;
typedef struct ir_reg_tree ir_reg_tree, *ir_reg_tree_ptr;
typedef struct ir_entity ir_entity, *ir_entity_ptr;
typedef struct _ir_extblk ir_extblk, *ir_extblk_ptr;
typedef struct ir_extblk ir_extblk, *ir_extblk_ptr;
typedef struct ir_exec_freq ir_exec_freq, *ir_exec_freq_ptr;
typedef struct ir_cdep ir_cdep, *ir_cdep_ptr;
typedef struct sn_entry *seqno_t;
......
......@@ -30,7 +30,7 @@
#include "firm_types.h"
#include "begin.h"
typedef struct _heights_t heights_t;
typedef struct heights_t heights_t;
/**
* Get the height of a node inside a basic block.
......
......@@ -29,14 +29,14 @@
#include "begin.h"
/** Supported Edge kinds. */
enum _ir_edge_kind_t {
enum ir_edge_kind_t {
EDGE_KIND_NORMAL, /**< Normal data flow edges. */
EDGE_KIND_BLOCK, /**< Block to Block control flow edges. */
EDGE_KIND_DEP, /**< Dependency edges. */
EDGE_KIND_LAST
};
typedef enum _ir_edge_kind_t ir_edge_kind_t;
typedef enum ir_edge_kind_t ir_edge_kind_t;
#include "end.h"
......
......@@ -286,7 +286,7 @@ FIRM_API void all_optimizations_off(void);
/**
* Possible verification modes.
*/
typedef enum _firm_verification_t {
typedef enum firm_verification_t {
FIRM_VERIFICATION_OFF = 0, /**< do not verify nodes at all */
FIRM_VERIFICATION_ON = 1, /**< do node verification and assert on error in debug version */
FIRM_VERIFICATION_REPORT = 2, /**< do node verification, but report to stderr only */
......
......@@ -66,7 +66,7 @@ typedef enum {
HOOK_OPT_LAST
} hook_opt_kind;
typedef enum _if_result_t {
typedef enum if_result_t {
IF_RESULT_SUCCESS = 0, /**< if conversion could be done */
IF_RESULT_SIDE_EFFECT = 1, /**< if conversion failed because of side effect */
IF_RESULT_SIDE_EFFECT_PHI = 2, /**< if conversion failed because of Phi node found */
......
......@@ -56,7 +56,7 @@
* Avoid floating point constant folding. Useful for frontends which do not
* create arithmetic operations in the backends arithmetic mode.
*/
typedef enum _fp_model_t {
typedef enum fp_model_t {
fp_explicit_rounding = (1u << 0), /**< Explicit rounding at assignments, typecasts, return
and function calls. Conv nodes may NOT be removed, even
if they look useless. */
......
......@@ -55,7 +55,7 @@ FIRM_API int irn_verify_irg_dump(ir_node *checknode, ir_graph *irg, const char *
/**
* Flags for irg_verify().
*/
typedef enum _irg_verify_flags_t {
typedef enum irg_verify_flags_t {
VERIFY_NORMAL = 0, /**< check SSA property only if dominance information is available */
VERIFY_ENFORCE_SSA = 1 /**< check SSA property by enforcing the dominance information recalculation */
} irg_verify_flags_t;
......
......@@ -191,7 +191,7 @@ typedef ir_entity *(create_intrinsic_fkt)(ir_type *method, const ir_op *op,
/**
* The lowering parameter description.
*/
typedef struct _lwrdw_param_t {
typedef struct lwrdw_param_t {
int enable; /**< if true lowering is enabled */
int little_endian; /**< if true should be lowered for little endian, else big endian */
ir_mode *high_signed; /**< the double word signed mode to be lowered, typically Ls */
......@@ -364,7 +364,7 @@ enum ikind {
/**
* An intrinsic call record.
*/
typedef struct _i_call_record {
typedef struct i_call_record {
enum ikind kind; /**< must be INTRINSIC_CALL */
ir_entity *i_ent; /**< the entity representing an intrinsic call */
i_mapper_func i_mapper; /**< the mapper function to call */
......@@ -375,7 +375,7 @@ typedef struct _i_call_record {
/**
* An intrinsic instruction record.
*/
typedef struct _i_instr_record {
typedef struct i_instr_record {
enum ikind kind; /**< must be INTRINSIC_INSTR */
ir_op *op; /**< the opcode that must be mapped. */
i_mapper_func i_mapper; /**< the mapper function to call */
......@@ -386,7 +386,7 @@ typedef struct _i_instr_record {
/**
* An intrinsic record.
*/
typedef union _i_record {
typedef union i_record {
i_call_record i_call;
i_instr_record i_instr;
} i_record;
......@@ -613,7 +613,7 @@ FIRM_API int i_mapper_alloca(ir_node *call, void *ctx);
/**
* A runtime routine description.
*/
typedef struct _runtime_rt {
typedef struct runtime_rt {
ir_entity *ent; /**< The entity representing the runtime routine. */
ir_mode *mode; /**< The operation mode of the mapped instruction. */
ir_mode *res_mode; /**< The result mode of the mapped instruction or NULL. */
......
......@@ -29,7 +29,7 @@
#include "begin.h"
typedef struct _ir_timer_t ir_timer_t;
typedef struct ir_timer_t ir_timer_t;
/**
* Switch to real-time scheduling.
......
......@@ -380,7 +380,7 @@ FIRM_API tarval *get_tarval_minus_inf(ir_mode *mode);
/* ******************** Arithmetic operations on tarvals ******************** */
typedef enum _tarval_int_overflow_mode_t {
typedef enum tarval_int_overflow_mode_t {
TV_OVERFLOW_BAD, /**< tarval module will return tarval_bad if a overflow occurs */
TV_OVERFLOW_WRAP, /**< tarval module will overflow will be ignored, wrap around occurs */
TV_OVERFLOW_SATURATE /**< tarval module will saturate the overflow */
......
......@@ -32,7 +32,7 @@
#include "bipartite.h"
#include "xmalloc.h"
struct _bipartite_t {
struct bipartite_t {
int n_left, n_right;
bitset_t *adj[1];
};
......
......@@ -22,19 +22,19 @@
*/
#define COL_INCREASE 2
typedef struct _col_val_t {
typedef struct col_val_t {
double v;
int col_idx;
} col_val_t;
typedef struct _row_col_t {
typedef struct row_col_t {
int c_cols;
int n_cols;
double diag;
col_val_t *cols;
} row_col_t;
struct _gs_matrix_t {
struct gs_matrix_t {
int initial_col_increase;
int c_rows;
int n_zero_entries; ///< Upper bound on number of entries equal to 0.0
......
......@@ -46,12 +46,12 @@
*
*/
typedef struct _pqueue_el_t {
typedef struct pqueue_el_t {
void *data;
int priority;
} pqueue_el_t;
struct _pqueue_t {
struct pqueue_t {
pqueue_el_t *elems;
};
......
......@@ -35,7 +35,7 @@
#include "obst.h"
typedef struct _absgraph_t {
typedef struct absgraph_t {
void *(*get_root)(void *self);
void (*grow_succs)(void *self, void *node, struct obstack *obst);
void *(*get_end)(void *self);
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment