* ia64-gen.c (parse_resource_users, print_dependency_table,
add_dis_table_ent, finish_distable, insert_bit_table_ent,
add_dis_entry, compact_distree, gen_dis_table, completer_entries_eq,
get_prefix_len, compute_completer_bits, insert_opcode_dependencies,
insert_completer_entry, print_completer_entry, print_completer_table,
opcodes_eq, add_opcode_entry, shrink): Use ISO C syntax for functions.
+2009-06-02 Tristan Gingold <gingold@adacore.com>
+
+ * ia64-gen.c (parse_resource_users, print_dependency_table,
+ add_dis_table_ent, finish_distable, insert_bit_table_ent,
+ add_dis_entry, compact_distree, gen_dis_table, completer_entries_eq,
+ get_prefix_len, compute_completer_bits, insert_opcode_dependencies,
+ insert_completer_entry, print_completer_entry, print_completer_table,
+ opcodes_eq, add_opcode_entry, shrink): Use ISO C syntax for functions.
+
2009-05-28 DJ Delorie <dj@redhat.com>
* mep-asm.c: Regenerate.
2009-05-28 DJ Delorie <dj@redhat.com>
* mep-asm.c: Regenerate.
/* Extract the insn classes from the given line. */
static void
/* Extract the insn classes from the given line. */
static void
-parse_resource_users (ref, usersp, nusersp, notesp)
- const char *ref;
- int **usersp;
- int *nusersp;
- int **notesp;
+parse_resource_users (const char *ref, int **usersp, int *nusersp,
+ int **notesp)
{
int c;
char *line = xstrdup (ref);
{
int c;
char *line = xstrdup (ref);
-print_dependency_table ()
+print_dependency_table (void)
\f
static struct disent *
\f
static struct disent *
-add_dis_table_ent (which, insn, order, completer_index)
- struct disent *which;
- int insn;
- int order;
- int completer_index;
+add_dis_table_ent (struct disent *which, int insn, int order,
+ int completer_index)
{
int ci = 0;
struct disent *ent;
{
int ci = 0;
struct disent *ent;
{
struct disent *ent = disinsntable;
struct disent *prev = ent;
{
struct disent *ent = disinsntable;
struct disent *prev = ent;
-insert_bit_table_ent (curr_ent, bit, opcode, mask,
- opcodenum, order, completer_index)
- struct bittree *curr_ent;
- int bit;
- ia64_insn opcode;
- ia64_insn mask;
- int opcodenum;
- int order;
- int completer_index;
+insert_bit_table_ent (struct bittree *curr_ent, int bit, ia64_insn opcode,
+ ia64_insn mask, int opcodenum, int order,
+ int completer_index)
-add_dis_entry (first, opcode, mask, opcodenum, ent, completer_index)
- struct bittree *first;
- ia64_insn opcode;
- ia64_insn mask;
- int opcodenum;
- struct completer_entry *ent;
- int completer_index;
+add_dis_entry (struct bittree *first, ia64_insn opcode, ia64_insn mask,
+ int opcodenum, struct completer_entry *ent, int completer_index)
{
if (completer_index & (1 << 20))
abort ();
{
if (completer_index & (1 << 20))
abort ();
\f
/* This optimization pass combines multiple "don't care" nodes. */
static void
\f
/* This optimization pass combines multiple "don't care" nodes. */
static void
-compact_distree (ent)
- struct bittree *ent;
+compact_distree (struct bittree *ent)
{
#define IS_SKIP(ent) \
((ent->bits[2] !=NULL) \
{
#define IS_SKIP(ent) \
((ent->bits[2] !=NULL) \
/* Generate the disassembler state machine corresponding to the tree
in ENT. */
static void
/* Generate the disassembler state machine corresponding to the tree
in ENT. */
static void
-gen_dis_table (ent)
- struct bittree *ent;
+gen_dis_table (struct bittree *ent)
{
int x;
int our_offset = insn_list_len;
{
int x;
int our_offset = insn_list_len;
/* If the completer trees ENT1 and ENT2 are equal, return 1. */
static int
/* If the completer trees ENT1 and ENT2 are equal, return 1. */
static int
-completer_entries_eq (ent1, ent2)
- struct completer_entry *ent1, *ent2;
+completer_entries_eq (struct completer_entry *ent1,
+ struct completer_entry *ent2)
{
while (ent1 != NULL && ent2 != NULL)
{
{
while (ent1 != NULL && ent2 != NULL)
{
-get_prefix_len (name)
- const char *name;
+get_prefix_len (const char *name)
-compute_completer_bits (ment, ent)
- struct main_entry *ment;
- struct completer_entry *ent;
+compute_completer_bits (struct main_entry *ment, struct completer_entry *ent)
2) all resources which must be marked in use when this opcode is used
(regs). */
static int
2) all resources which must be marked in use when this opcode is used
(regs). */
static int
-insert_opcode_dependencies (opc, cmp)
- struct ia64_opcode *opc;
- struct completer_entry *cmp ATTRIBUTE_UNUSED;
+insert_opcode_dependencies (struct ia64_opcode *opc,
+ struct completer_entry *cmp ATTRIBUTE_UNUSED)
{
/* Note all resources which point to this opcode. rfi has the most chks
(79) and cmpxchng has the most regs (54) so 100 here should be enough. */
{
/* Note all resources which point to this opcode. rfi has the most chks
(79) and cmpxchng has the most regs (54) so 100 here should be enough. */
-insert_completer_entry (opc, tabent, order)
- struct ia64_opcode *opc;
- struct main_entry *tabent;
- int order;
+insert_completer_entry (struct ia64_opcode *opc, struct main_entry *tabent,
+ int order)
{
struct completer_entry **ptr = &tabent->completers;
struct completer_entry *parent = NULL;
{
struct completer_entry **ptr = &tabent->completers;
struct completer_entry *parent = NULL;
-print_completer_entry (ent)
- struct completer_entry *ent;
+print_completer_entry (struct completer_entry *ent)
{
int moffset = 0;
ia64_insn mask = ent->mask, bits = ent->bits;
{
int moffset = 0;
ia64_insn mask = ent->mask, bits = ent->bits;
-print_completer_table ()
+print_completer_table (void)
-opcodes_eq (opc1, opc2)
- struct ia64_opcode *opc1;
- struct ia64_opcode *opc2;
+opcodes_eq (struct ia64_opcode *opc1, struct ia64_opcode *opc2)
{
int x;
int plen1, plen2;
{
int x;
int plen1, plen2;
-add_opcode_entry (opc)
- struct ia64_opcode *opc;
+add_opcode_entry (struct ia64_opcode *opc)
{
struct main_entry **place;
struct string_entry *name;
{
struct main_entry **place;
struct string_entry *name;
-shrink (table)
- struct ia64_opcode *table;
+shrink (struct ia64_opcode *table)