aboutsummaryrefslogtreecommitdiff
path: root/bfd/hash.c
diff options
context:
space:
mode:
Diffstat (limited to 'bfd/hash.c')
-rw-r--r--bfd/hash.c40
1 files changed, 20 insertions, 20 deletions
diff --git a/bfd/hash.c b/bfd/hash.c
index 81c941e..0093d63 100644
--- a/bfd/hash.c
+++ b/bfd/hash.c
@@ -364,7 +364,7 @@ static unsigned long bfd_default_hash_table_size = DEFAULT_SIZE;
/* Create a new hash table, given a number of entries. */
-bfd_boolean
+bool
bfd_hash_table_init_n (struct bfd_hash_table *table,
struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *,
struct bfd_hash_table *,
@@ -379,14 +379,14 @@ bfd_hash_table_init_n (struct bfd_hash_table *table,
if (alloc / sizeof (struct bfd_hash_entry *) != size)
{
bfd_set_error (bfd_error_no_memory);
- return FALSE;
+ return false;
}
table->memory = (void *) objalloc_create ();
if (table->memory == NULL)
{
bfd_set_error (bfd_error_no_memory);
- return FALSE;
+ return false;
}
table->table = (struct bfd_hash_entry **)
objalloc_alloc ((struct objalloc *) table->memory, alloc);
@@ -394,7 +394,7 @@ bfd_hash_table_init_n (struct bfd_hash_table *table,
{
bfd_hash_table_free (table);
bfd_set_error (bfd_error_no_memory);
- return FALSE;
+ return false;
}
memset ((void *) table->table, 0, alloc);
table->size = size;
@@ -402,12 +402,12 @@ bfd_hash_table_init_n (struct bfd_hash_table *table,
table->count = 0;
table->frozen = 0;
table->newfunc = newfunc;
- return TRUE;
+ return true;
}
/* Create a new hash table with the default number of entries. */
-bfd_boolean
+bool
bfd_hash_table_init (struct bfd_hash_table *table,
struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *,
struct bfd_hash_table *,
@@ -457,8 +457,8 @@ bfd_hash_hash (const char *string, unsigned int *lenp)
struct bfd_hash_entry *
bfd_hash_lookup (struct bfd_hash_table *table,
const char *string,
- bfd_boolean create,
- bfd_boolean copy)
+ bool create,
+ bool copy)
{
unsigned long hash;
struct bfd_hash_entry *hashp;
@@ -643,7 +643,7 @@ bfd_hash_newfunc (struct bfd_hash_entry *entry,
void
bfd_hash_traverse (struct bfd_hash_table *table,
- bfd_boolean (*func) (struct bfd_hash_entry *, void *),
+ bool (*func) (struct bfd_hash_entry *, void *),
void * info)
{
unsigned int i;
@@ -715,7 +715,7 @@ struct bfd_strtab_hash
struct strtab_hash_entry *last;
/* Whether to precede strings with a two byte length, as in the
XCOFF .debug section. */
- bfd_boolean xcoff;
+ bool xcoff;
};
/* Routine to create an entry in a strtab. */
@@ -777,7 +777,7 @@ _bfd_stringtab_init (void)
table->size = 0;
table->first = NULL;
table->last = NULL;
- table->xcoff = FALSE;
+ table->xcoff = false;
return table;
}
@@ -793,7 +793,7 @@ _bfd_xcoff_stringtab_init (void)
ret = _bfd_stringtab_init ();
if (ret != NULL)
- ret->xcoff = TRUE;
+ ret->xcoff = true;
return ret;
}
@@ -814,14 +814,14 @@ _bfd_stringtab_free (struct bfd_strtab_hash *table)
bfd_size_type
_bfd_stringtab_add (struct bfd_strtab_hash *tab,
const char *str,
- bfd_boolean hash,
- bfd_boolean copy)
+ bool hash,
+ bool copy)
{
struct strtab_hash_entry *entry;
if (hash)
{
- entry = strtab_hash_lookup (tab, str, TRUE, copy);
+ entry = strtab_hash_lookup (tab, str, true, copy);
if (entry == NULL)
return (bfd_size_type) -1;
}
@@ -878,10 +878,10 @@ _bfd_stringtab_size (struct bfd_strtab_hash *tab)
/* Write out a strtab. ABFD must already be at the right location in
the file. */
-bfd_boolean
+bool
_bfd_stringtab_emit (bfd *abfd, struct bfd_strtab_hash *tab)
{
- bfd_boolean xcoff;
+ bool xcoff;
struct strtab_hash_entry *entry;
xcoff = tab->xcoff;
@@ -901,12 +901,12 @@ _bfd_stringtab_emit (bfd *abfd, struct bfd_strtab_hash *tab)
/* The output length includes the null byte. */
bfd_put_16 (abfd, (bfd_vma) len, buf);
if (bfd_bwrite ((void *) buf, (bfd_size_type) 2, abfd) != 2)
- return FALSE;
+ return false;
}
if (bfd_bwrite ((void *) str, (bfd_size_type) len, abfd) != len)
- return FALSE;
+ return false;
}
- return TRUE;
+ return true;
}