Lines Matching full:num_entries
3092 unsigned int num_entries, num_ids;
3098 num_entries = (int) bfd_get_16 (abfd, data + 12);
3101 num_entries += num_ids;
3105 while (num_entries --)
3109 entry_end = rsrc_count_entries (abfd, num_entries >= num_ids,
3122 unsigned int num_entries;
3264 if (chain->num_entries == 0)
3276 for (i = chain->num_entries; i--;)
3321 table->names.num_entries = bfd_get_16 (abfd, data + 12);
3322 table->ids.num_entries = bfd_get_16 (abfd, data + 14);
3329 data += table->names.num_entries * 8;
3333 data += table->ids.num_entries * 8;
3459 bfd_put_16 (data->abfd, dir->names.num_entries, data->next_table + 12);
3460 bfd_put_16 (data->abfd, dir->ids.num_entries, data->next_table + 14);
3464 data->next_table = next_entry + (dir->names.num_entries * 8)
3465 + (dir->ids.num_entries * 8);
3469 for (i = dir->names.num_entries, entry = dir->names.first_entry;
3480 for (i = dir->ids.num_entries, entry = dir->ids.first_entry;
3835 if (chain->num_entries < 2)
3879 if (next->value.directory->names.num_entries == 0
3880 && next->value.directory->ids.num_entries == 1
3885 else if (entry->value.directory->names.num_entries == 0
3886 && entry->value.directory->ids.num_entries == 1
3908 chain->num_entries --;
3909 if (chain->num_entries < 2)
3971 chain->num_entries --;
3972 if (chain->num_entries < 2)
3994 if (bchain->num_entries == 0)
3997 achain->num_entries += bchain->num_entries;
4010 bchain->num_entries = 0;
4077 new_table.names.num_entries = 0;
4078 new_table.ids.num_entries = 0;
