espressif/binutils-gdb
1
0
Fork 0
mirror of https://github.com/espressif/binutils-gdb.git synced 2025-06-24 12:23:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

(build_hash_table): Allocate all entries at once.

Browse Source
This commit is contained in:
David Edelsohn
1995-08-02 16:48:02 +00:00
parent f069afb4eb
commit 1a67b3b682
1 changed files with 5 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
opcodes/sparc-dis.c
View File

@ -759,8 +759,9 @@ build_hash_table (table, hash_table, num_opcodes)
struct opcode_hash **hash_table; struct opcode_hash **hash_table;
int num_opcodes; int num_opcodes;
{ {
int i; register int i;
int hash_count[HASH_SIZE]; int hash_count[HASH_SIZE];
struct opcode_hash *hash_buf;
/* Start at the end of the table and work backwards so that each /* Start at the end of the table and work backwards so that each
chain is sorted. */ chain is sorted. */
@ -768,10 +769,11 @@ build_hash_table (table, hash_table, num_opcodes)
memset (hash_table, 0, HASH_SIZE * sizeof (hash_table[0])); memset (hash_table, 0, HASH_SIZE * sizeof (hash_table[0]));
memset (hash_count, 0, HASH_SIZE * sizeof (hash_count[0])); memset (hash_count, 0, HASH_SIZE * sizeof (hash_count[0]));
hash_buf = (struct opcode_hash *) xmalloc (sizeof (struct opcode_hash) * num_opcodes);
for (i = num_opcodes - 1; i >= 0; --i) for (i = num_opcodes - 1; i >= 0; --i)
{ {
int hash = HASH_INSN (sparc_opcodes[i].match); register int hash = HASH_INSN (sparc_opcodes[i].match);
struct opcode_hash *h = (struct opcode_hash *) xmalloc (sizeof (struct opcode_hash)); register struct opcode_hash *h = &hash_buf[i];
h->next = hash_table[hash]; h->next = hash_table[hash];
h->opcode = &sparc_opcodes[i]; h->opcode = &sparc_opcodes[i];
hash_table[hash] = h; hash_table[hash] = h;