Home
last modified time | relevance | path

Searched refs:binfo (Results 1 – 25 of 55) sorted by relevance

123

/freebsd-12.1/contrib/jemalloc/src/
H A Dbitmap.c24 binfo->levels[0].group_offset = 0; in bitmap_info_init()
28 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset in bitmap_info_init()
32 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset in bitmap_info_init()
35 binfo->nlevels = i; in bitmap_info_init()
36 binfo->nbits = nbits; in bitmap_info_init()
41 return binfo->levels[binfo->nlevels].group_offset; in bitmap_info_ngroups()
56 memset(bitmap, 0, bitmap_size(binfo)); in bitmap_init()
72 for (i = 1; i < binfo->nlevels; i++) { in bitmap_init()
74 binfo->levels[i-1].group_offset; in bitmap_init()
91 binfo->nbits = nbits; in bitmap_info_init()
[all …]
/freebsd-12.1/contrib/gcc/cp/
H A Dsearch.c106 data->binfo = binfo; in dfs_lookup_base()
123 gcc_assert (binfo != data->binfo); in dfs_lookup_base()
137 data->binfo = binfo; in dfs_lookup_base()
193 tree binfo; in lookup_base() local
230 binfo = data.binfo; in lookup_base()
288 return binfo; in lookup_base()
837 return binfo; in dfs_accessible_post()
854 tree binfo; in accessible_p() local
2475 for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo)) in binfo_from_vbase()
2495 binfo = BINFO_INHERITANCE_CHAIN (binfo)) in binfo_via_virtual()
[all …]
H A Dclass.c72 tree binfo; member
238 tree binfo, in build_base_path() argument
497 tree binfo; in convert_to_base() local
511 if (!binfo || binfo == error_mark_node) in convert_to_base()
773 if (binfo) in build_primary_vtable()
1234 tree binfo; in check_bases() local
2257 binfo, in dfs_modify_vtables()
3501 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo))) in layout_nonempty_base_or_field()
6708 dump_vtable (BINFO_TYPE (binfo), binfo, decl); in initialize_vtable()
6923 binfo = BINFO_INHERITANCE_CHAIN (binfo); in dfs_build_secondary_vptr_vtt_inits()
[all …]
H A Dcvt.c137 tree binfo; in cp_convert_to_pointer() local
147 binfo = NULL_TREE; in cp_convert_to_pointer()
151 if (!same_p && !binfo) in cp_convert_to_pointer()
159 if (binfo || same_p) in cp_convert_to_pointer()
161 if (binfo) in cp_convert_to_pointer()
181 tree binfo; in cp_convert_to_pointer() local
188 if (!binfo) in cp_convert_to_pointer()
215 if (binfo && !integer_zerop (BINFO_OFFSET (binfo))) in cp_convert_to_pointer()
312 tree binfo; in convert_to_pointer_force() local
316 if (!binfo) in convert_to_pointer_force()
[all …]
H A Dtypeck2.c65 else if (!binfo) in binfo_or_else()
67 return binfo; in binfo_or_else()
1112 tree binfo; in build_scoped_ref() local
1117 binfo = *binfo_p; in build_scoped_ref()
1121 if (!binfo || binfo == error_mark_node) in build_scoped_ref()
1124 if (!binfo) in build_scoped_ref()
1129 *binfo_p = binfo; in build_scoped_ref()
1221 tree binfo; in build_m_component_ref() local
1252 binfo = NULL; in build_m_component_ref()
1258 if (!binfo) in build_m_component_ref()
[all …]
H A Dinit.c106 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo)) in dfs_initialize_vtbl_ptrs()
473 tree base, binfo, base_binfo; in sort_mem_initializers() local
492 for (binfo = TYPE_BINFO (t), i = 0; in sort_mem_initializers()
735 build_vtbl_address (tree binfo) in build_vtbl_address() argument
737 tree binfo_for = binfo; in build_vtbl_address()
740 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo)) in build_vtbl_address()
776 vtbl = build_vtbl_address (binfo); in expand_virtual_init()
780 vtt_index = BINFO_VPTR_INDEX (binfo); in expand_virtual_init()
808 TREE_TYPE (binfo)); in expand_virtual_init()
834 binfo, in expand_cleanup_for_base()
[all …]
H A Dmethod.c558 tree binfo, base_binfo; in do_build_copy_constructor() local
567 VEC_iterate (tree, vbases, i, binfo); i++) in do_build_copy_constructor()
570 = tree_cons (binfo, in do_build_copy_constructor()
573 binfo, 1)), in do_build_copy_constructor()
577 for (binfo = TYPE_BINFO (current_class_type), i = 0; in do_build_copy_constructor()
578 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) in do_build_copy_constructor()
658 tree binfo, base_binfo; in do_build_assign_ref() local
662 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) in do_build_assign_ref()
831 tree binfo, base_binfo; in synthesize_exception_spec() local
834 for (binfo = TYPE_BINFO (type), i = 0; in synthesize_exception_spec()
[all …]
H A Drtti.c551 tree binfo; in build_dynamic_cast_1() local
556 if (binfo) in build_dynamic_cast_1()
559 binfo, 0); in build_dynamic_cast_1()
1038 tree binfo = TYPE_BINFO (type); in get_pseudo_ti_init() local
1039 int nbases = BINFO_N_BASE_BINFOS (binfo); in get_pseudo_ti_init()
1040 VEC(tree,gc) *base_accesses = BINFO_BASE_ACCESSES (binfo); in get_pseudo_ti_init()
1049 tree base_binfo = BINFO_BASE_BINFO (binfo, ix); in get_pseudo_ti_init()
1212 tree binfo = TYPE_BINFO (type); in get_pseudo_ti_index() local
1213 VEC(tree,gc) *base_accesses = BINFO_BASE_ACCESSES (binfo); in get_pseudo_ti_index()
1214 tree base_binfo = BINFO_BASE_BINFO (binfo, 0); in get_pseudo_ti_index()
[all …]
H A Dtree.c630 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt) in copy_binfo() argument
642 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0); in copy_binfo()
649 if (binfo) in copy_binfo()
654 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo)); in copy_binfo()
655 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type)); in copy_binfo()
657 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo); in copy_binfo()
658 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo); in copy_binfo()
1697 tree binfo; in maybe_dummy_object() local
1700 && (binfo = lookup_base (current_class_type, type, in maybe_dummy_object()
1707 binfo = TYPE_BINFO (type); in maybe_dummy_object()
[all …]
H A Ddump.c271 tree binfo; in cp_dump_tree() local
274 for (binfo = TYPE_BINFO (t), i = 0; in cp_dump_tree()
275 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) in cp_dump_tree()
H A Dsemantics.c248 if (probe->binfo == chk->binfo && in pop_to_parent_deferring_access_checks()
276 enforce_access (chk->binfo, chk->decl, chk->diag_decl); in perform_access_checks()
305 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl) in perform_or_defer_access_check() argument
318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO); in perform_or_defer_access_check()
325 enforce_access (binfo, decl, diag_decl); in perform_or_defer_access_check()
335 if (chk->decl == decl && chk->binfo == binfo && in perform_or_defer_access_check()
345 new_access->binfo = binfo; in perform_or_defer_access_check()
1484 tree binfo = NULL_TREE; in finish_non_static_data_member() local
1486 &binfo); in finish_non_static_data_member()
H A Dcall.c5061 gcc_assert (binfo && binfo != error_mark_node); in build_over_call()
5218 tree binfo, int flags) in build_special_member_call() argument
5230 if (TYPE_P (binfo)) in build_special_member_call()
5236 binfo = TYPE_BINFO (binfo); in build_special_member_call()
5239 gcc_assert (binfo != NULL_TREE); in build_special_member_call()
5241 class_type = BINFO_TYPE (binfo); in build_special_member_call()
5258 (TREE_TYPE (instance), BINFO_TYPE (binfo))) in build_special_member_call()
5271 binfo, /*nonnull=*/1); in build_special_member_call()
5277 fns = lookup_fnfields (binfo, name, 1); in build_special_member_call()
5301 BINFO_SUBVTT_INDEX (binfo)); in build_special_member_call()
[all …]
H A Dname-lookup.c2801 tree binfo; in do_class_using_decl() local
2839 for (binfo = TYPE_BINFO (current_class_type), i = 0; in do_class_using_decl()
2840 BINFO_BASE_ITERATE (binfo, i, base_binfo); in do_class_using_decl()
2863 binfo = lookup_base (current_class_type, scope, ba_any, &b_kind); in do_class_using_decl()
2874 decl = lookup_member (binfo, name, 0, false); in do_class_using_decl()
4371 tree binfo, base_binfo; in friend_of_associated_class_p() local
4374 for (binfo = TYPE_BINFO (type), i = 0; in friend_of_associated_class_p()
4375 BINFO_BASE_ITERATE (binfo, i, base_binfo); in friend_of_associated_class_p()
4507 tree binfo, base_binfo; in arg_assoc_class() local
4509 for (binfo = TYPE_BINFO (type), i = 0; in arg_assoc_class()
[all …]
/freebsd-12.1/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h178 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1; in bitmap_full()
199 assert(bit < binfo->nbits); in bitmap_get()
211 assert(bit < binfo->nbits); in bitmap_set()
243 assert(min_bit < binfo->nbits); in bitmap_ffu()
259 return binfo->nbits; in bitmap_ffu()
272 return binfo->nbits; in bitmap_ffu()
280 assert(bit < binfo->nbits); in bitmap_ffu()
294 } while (i < binfo->ngroups); in bitmap_ffu()
295 return binfo->nbits; in bitmap_ffu()
309 i = binfo->nlevels - 1; in bitmap_sfu()
[all …]
/freebsd-12.1/sys/fs/nandfs/
H A Dnandfs_segment.c370 union nandfs_binfo *binfo; in nandfs_add_blocks() local
395 binfo->bi_v.bi_ino = node->nn_ino; in nandfs_add_blocks()
398 binfo->bi_dat.bi_ino = node->nn_ino; in nandfs_add_blocks()
400 binfo->bi_dat.bi_level = 1; in nandfs_add_blocks()
402 binfo->bi_dat.bi_level = 0; in nandfs_add_blocks()
404 binfo++; in nandfs_add_blocks()
552 binfo->bi_v.bi_ino = node->nn_ino; in nandfs_update_phys_block()
566 binfo->bi_dat.bi_level = 1; in nandfs_update_phys_block()
568 binfo->bi_dat.bi_level = 0; in nandfs_update_phys_block()
579 union nandfs_binfo *binfo; in nandfs_segment_assign_pblk() local
[all …]
H A Dnandfs_cleaner.c214 struct nandfs_segment_summary *segsum, union nandfs_binfo *binfo, in nandfs_cleaner_iterate_psegment() argument
221 if (binfo[i].bi_v.bi_ino == NANDFS_DAT_INO) { in nandfs_cleaner_iterate_psegment()
229 (*bdpp)->bd_level = binfo[i].bi_dat.bi_level; in nandfs_cleaner_iterate_psegment()
230 (*bdpp)->bd_offset = binfo[i].bi_dat.bi_blkoff; in nandfs_cleaner_iterate_psegment()
233 (*vipp)->nvi_ino = binfo[i].bi_v.bi_ino; in nandfs_cleaner_iterate_psegment()
234 (*vipp)->nvi_vblocknr = binfo[i].bi_v.bi_vblocknr; in nandfs_cleaner_iterate_psegment()
245 union nandfs_binfo *binfo; in nandfs_cleaner_iterate_segment() local
268 binfo = (union nandfs_binfo *)(bp->b_data + segsum->ss_bytes); in nandfs_cleaner_iterate_segment()
280 nandfs_cleaner_iterate_psegment(fsdev, segsum, binfo, curr, in nandfs_cleaner_iterate_segment()
/freebsd-12.1/sbin/newfs_nandfs/
H A Dnewfs_nandfs.c449 binfo->bi_v.bi_vblocknr = vblock; in update_block_info()
450 binfo->bi_v.bi_blkoff = i; in update_block_info()
451 binfo->bi_v.bi_ino = file->ino; in update_block_info()
454 binfo->bi_dat.bi_blkoff = i; in update_block_info()
458 binfo++; in update_block_info()
461 return (binfo); in update_block_info()
467 union nandfs_binfo *binfo; in save_segsum() local
493 binfo = update_block_info(binfo, &user_files[i]); in save_segsum()
496 binfo = update_block_info(binfo, &ifile); in save_segsum()
497 binfo = update_block_info(binfo, &cpfile); in save_segsum()
[all …]
/freebsd-12.1/contrib/binutils/bfd/
H A Dfreebsd.h91 long binfo = bfd_getb32(ext); in freebsd_swap_magic() local
93 int bmagic = binfo & 0xffff; in freebsd_swap_magic()
99 return bmagic_ok && !lmagic_ok ? binfo : linfo; in freebsd_swap_magic()
/freebsd-12.1/contrib/gcc/
H A Dipa-type-escape.c526 tree binfo, base_binfo; in parent_type_p() local
528 for (binfo = TYPE_BINFO (parent), i = 0; in parent_type_p()
529 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) in parent_type_p()
1448 tree binfo, base_binfo; in close_type_seen() local
1464 for (binfo = TYPE_BINFO (type), i = 0; in close_type_seen()
1465 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) in close_type_seen()
1551 tree binfo, base_binfo; in close_type_full_escape() local
1571 for (binfo = TYPE_BINFO (type), i = 0; in close_type_full_escape()
1572 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) in close_type_full_escape()
H A Dtree.h1966 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1969 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2174 tree binfo; member
2219 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2226 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2231 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2257 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2271 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2275 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2282 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
[all …]
H A Dtreestruct.def58 DEFTREESTRUCT(TS_BINFO, "binfo")
H A Ddbxout.c2009 tree binfo = TYPE_BINFO (type); in dbxout_type() local
2046 if (binfo) in dbxout_type()
2050 VEC(tree,gc) *accesses = BINFO_BASE_ACCESSES (binfo); in dbxout_type()
2054 if (BINFO_N_BASE_BINFOS (binfo)) in dbxout_type()
2057 stabstr_U (BINFO_N_BASE_BINFOS (binfo)); in dbxout_type()
2061 for (i = 0; BINFO_BASE_ITERATE (binfo, i, child); i++) in dbxout_type()
/freebsd-12.1/sys/dev/firewire/
H A Dfirewire.c1519 struct bus_info *binfo; in fw_explore_node() local
1549 binfo = (struct bus_info *)&csr[1]; in fw_explore_node()
1550 if (binfo->bus_name != CSR_BUS_NAME_IEEE1394) { in fw_explore_node()
1561 binfo->irmc, binfo->cmc, binfo->isc, in fw_explore_node()
1562 binfo->bmc, binfo->pmc, binfo->cyc_clk_acc, in fw_explore_node()
1563 binfo->max_rec, binfo->max_rom, in fw_explore_node()
1564 binfo->generation, binfo->link_spd); in fw_explore_node()
1567 if (FW_EUI64_EQUAL(fwdev->eui, binfo->eui64)) in fw_explore_node()
1579 fwdev->eui = binfo->eui64; in fw_explore_node()
1592 if (binfo->link_spd == FWSPD_S100 /* 0 */) { in fw_explore_node()
[all …]
/freebsd-12.1/sys/dev/sound/pci/
H A Dcsa.c78 struct csa_bridgeinfo binfo; /* The state of this bridge. */ member
263 scp->binfo.card = scp->card; in csa_attach()
308 func->varinfo = &scp->binfo; in csa_attach()
319 func->varinfo = &scp->binfo; in csa_attach()
557 scp->binfo.hisr = hisr; in csa_intr()
H A Dcsapcm.c69 struct csa_bridgeinfo *binfo; /* The state of the parent. */ member
646 if ((csa->binfo->hisr & HISR_VC0) != 0) in csa_intr()
648 if ((csa->binfo->hisr & HISR_VC1) != 0) in csa_intr()
788 csa->binfo = func->varinfo; in pcmcsa_attach()
796 csa->card = csa->binfo->card; in pcmcsa_attach()

123