Searched refs:entry2 (Results 1 - 13 of 13) sorted by path

/freebsd-11-stable/contrib/binutils/bfd/
H A Delf32-score.c905 score_elf_got_entry_eq (const void *entry1, const void *entry2) argument
908 const struct score_got_entry *e2 = (struct score_got_entry *)entry2;
H A Delfxx-ia64.c1960 struct elfNN_ia64_local_hash_entry *entry2
1963 return entry1->id == entry2->id && entry1->r_sym == entry2->r_sym;
1955 struct elfNN_ia64_local_hash_entry *entry2 local
H A Delfxx-mips.c1996 mips_elf_got_entry_eq (const void *entry1, const void *entry2)
1999 const struct mips_got_entry *e2 = (struct mips_got_entry *)entry2;
2033 mips_elf_multi_got_entry_eq (const void *entry1, const void *entry2)
2036 const struct mips_got_entry *e2 = (struct mips_got_entry *)entry2;
2978 mips_elf_bfd2got_entry_eq (const void *entry1, const void *entry2)
2983 = (const struct mips_elf_bfd2got_hash *)entry2;
1984 mips_elf_got_entry_eq(const void *entry1, const void *entry2) argument
2021 mips_elf_multi_got_entry_eq(const void *entry1, const void *entry2) argument
2964 mips_elf_bfd2got_entry_eq(const void *entry1, const void *entry2) argument
/freebsd-11-stable/contrib/gcc/
H A Dcoverage.c154 const counts_entry_t *entry2 = of2;
156 return entry1->ident == entry2->ident && entry1->ctr == entry2->ctr;
152 const counts_entry_t *entry2 = of2; local
H A Ddwarf2out.c6353 const struct die_struct *entry2 = of2;
6355 return !strcmp (entry1->cu->die_symbol, entry2->die_symbol);
6344 const struct die_struct *entry2 = of2; local
H A Dloop-invariant.c411 const struct invariant_expr_entry *entry2 = e2; local
413 if (entry1->mode != entry2->mode)
417 entry2->inv->insn, entry2->expr);
H A Dtree-ssa-loop-ivopts.c3272 mbc_entry_eq (const void *entry1, const void *entry2) argument
3275 const struct mbc_entry *e2 = entry2;
/freebsd-11-stable/crypto/heimdal/lib/krb5/
H A Dtest_keytab.c75 krb5_keytab_entry entry, entry2, entry3; local
102 &entry2);
105 krb5_kt_free_entry(context, &entry2);
115 &entry2);
118 krb5_kt_free_entry(context, &entry2);
151 &entry2);
/freebsd-11-stable/sys/fs/ext2fs/
H A Dext2_htree.c469 const struct ext2fs_htree_sort_entry *entry1, *entry2; local
472 entry2 = (const struct ext2fs_htree_sort_entry *)e2;
474 if (entry1->h_hash < entry2->h_hash)
476 if (entry1->h_hash > entry2->h_hash)
/freebsd-11-stable/sys/mips/rmi/dev/nlge/
H A Dif_nlge.h1037 uint64_t entry2; member in struct:size_3_desc
1043 uint64_t entry2; member in struct:size_4_desc
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_entry.c179 struct archive_entry *entry2; local
188 entry2 = archive_entry_new2(entry->archive);
189 if (entry2 == NULL)
191 entry2->ae_stat = entry->ae_stat;
192 entry2->ae_fflags_set = entry->ae_fflags_set;
193 entry2->ae_fflags_clear = entry->ae_fflags_clear;
197 archive_mstring_copy(&entry2->ae_fflags_text, &entry->ae_fflags_text);
198 archive_mstring_copy(&entry2->ae_gname, &entry->ae_gname);
199 archive_mstring_copy(&entry2->ae_hardlink, &entry->ae_hardlink);
200 archive_mstring_copy(&entry2
[all...]
/freebsd-11-stable/contrib/libarchive/tar/
H A Dwrite.c525 struct archive_entry *entry2; local
551 entry2 = archive_entry_new();
552 r = archive_read_next_header2(disk, entry2);
553 archive_entry_free(entry2);
/freebsd-11-stable/lib/libmt/
H A Dmtlib.c233 struct mt_status_entry *entry2; local
248 STAILQ_FOREACH(entry2, &entry->child_entries, links)
249 mt_status_tree_sbuf(sb, entry2, indent + 2, sbuf_func, arg);
258 struct mt_status_entry *entry2; local
261 STAILQ_FOREACH(entry2, &entry->child_entries, links)
262 mt_status_tree_print(entry2, indent + 2, print_func,
286 struct mt_status_entry *entry2; local
324 STAILQ_FOREACH(entry2, &entry->child_entries, links) {
327 entry3 = mt_entry_find(entry2, name);
343 struct mt_status_entry *entry, *entry2; local
357 struct mt_status_entry *entry2, *entry3; local
383 struct mt_status_entry *entry, *entry2; local
[all...]

Completed in 329 milliseconds