Searched refs:binfo (Results 1 - 25 of 37) sorted by relevance

12

/freebsd-11-stable/contrib/jemalloc/src/
H A Dbitmap.c9 bitmap_info_init(bitmap_info_t *binfo, size_t nbits) argument
22 binfo->levels[0].group_offset = 0;
26 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
30 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
32 assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX);
33 binfo->nlevels = i;
34 binfo->nbits = nbits;
38 bitmap_info_ngroups(const bitmap_info_t *binfo) argument
45 bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo) argument
75 bitmap_info_init(bitmap_info_t *binfo, size_t nbits) argument
86 bitmap_info_ngroups(const bitmap_info_t *binfo) argument
93 bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo) argument
107 bitmap_size(const bitmap_info_t *binfo) argument
[all...]
/freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h117 void bitmap_info_init(bitmap_info_t *binfo, size_t nbits);
118 void bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo);
119 size_t bitmap_size(const bitmap_info_t *binfo);
126 bool bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo);
127 bool bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
128 void bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
129 size_t bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo);
130 void bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
135 bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo) argument
138 size_t rgoff = binfo
154 bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
166 bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
202 bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo) argument
233 bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) argument
[all...]
/freebsd-11-stable/contrib/gcc/cp/
H A Dsearch.c88 tree binfo; /* Found binfo. */
93 bool want_any; /* Whether we want any matching binfo. */
100 dfs_lookup_base (tree binfo, void *data_)
104 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->base))
106 if (!data->binfo)
108 data->binfo = binfo;
110 = binfo_via_virtual (data->binfo, data->t) != NULL_TREE;
114 return binfo;
86 tree binfo; /* Found binfo. */ member in struct:lookup_base_data_s
98 dfs_lookup_base(tree binfo, void *data_) argument
193 tree binfo; local
307 dfs_dcast_hint_pre(tree binfo, void *data_) argument
335 dfs_dcast_hint_post(tree binfo, void *data_) argument
597 dfs_access_in_type(tree binfo, void *data) argument
693 tree binfo = TYPE_BINFO (type); local
715 protected_accessible_p(tree decl, tree derived, tree binfo) argument
775 friend_accessible_p(tree scope, tree decl, tree binfo) argument
830 dfs_accessible_post(tree binfo, void *data ATTRIBUTE_UNUSED) argument
854 tree binfo; local
1015 is_subobject_of_p(tree parent, tree binfo) argument
1036 lookup_field_r(tree binfo, void *data) argument
1154 build_baselink(tree binfo, tree access_binfo, tree functions, tree optype) argument
1541 dfs_walk_all(tree binfo, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1584 dfs_walk_once_r(tree binfo, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1635 dfs_unmark_r(tree binfo) argument
1661 dfs_walk_once(tree binfo, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1706 dfs_walk_once_accessible_r(tree binfo, bool friends_p, bool once, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1776 dfs_walk_once_accessible(tree binfo, bool friends_p, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1847 tree binfo = lookup_base (over_return, base_return, local
1918 tree binfo = TYPE_BINFO (type); local
2009 dfs_get_pure_virtuals(tree binfo, void *data) argument
2094 dfs_debug_mark(tree binfo, void *data ATTRIBUTE_UNUSED) argument
2164 check_hidden_convs(tree binfo, int virtual_depth, int virtualness, tree to_type, tree parent_convs, tree other_convs) argument
2285 lookup_conversions_r(tree binfo, int virtual_depth, int virtualness, tree parent_convs, tree parent_tpl_convs, tree other_convs, tree other_tpl_convs, tree *convs, tree *tpl_convs) argument
2473 binfo_from_vbase(tree binfo) argument
2488 binfo_via_virtual(tree binfo, tree limit) argument
2508 copied_binfo(tree binfo, tree here) argument
2550 tree binfo; local
2566 original_binfo(tree binfo, tree here) argument
[all...]
H A Dclass.c72 tree binfo; member in struct:vtbl_init_data_s
75 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
83 /* The binfo for the virtual base for which we're building
137 static tree build_simple_base_path (tree expr, tree binfo);
227 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
229 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
238 tree binfo,
253 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
256 for (probe = binfo; prob
236 build_base_path(enum tree_code code, tree expr, tree binfo, int nonnull) argument
429 build_simple_base_path(tree expr, tree binfo) argument
497 tree binfo; local
596 tree binfo = lookup_base (fixed_type, basetype, local
766 build_primary_vtable(tree binfo, tree type) argument
819 build_secondary_vtable(tree binfo) argument
843 make_new_vtable(tree t, tree binfo) argument
865 modify_vtable_entry(tree t, tree binfo, tree fndecl, tree delta, tree *virtuals) argument
1234 tree binfo; local
1565 tree binfo = TYPE_BINFO (t); local
1763 layout_vtable_decl(tree binfo, int n) argument
1854 dfs_find_final_overrider_1(tree binfo, find_final_overrider_data *ffod, unsigned depth) argument
1900 dfs_find_final_overrider_pre(tree binfo, void *data) argument
1926 find_final_overrider(tree derived, tree binfo, tree fn) argument
1993 update_vtable_entry_for_fn(tree t, tree binfo, tree fn, tree* virtuals, unsigned ix) argument
2222 dfs_modify_vtables(tree binfo, void* data) argument
2276 tree binfo = TYPE_BINFO (t); local
2408 tree binfo; local
2570 tree binfo; local
3190 tree binfo; local
3420 layout_nonempty_base_or_field(record_layout_info rli, tree decl, tree binfo, splay_tree offsets) argument
3529 layout_empty_base(tree binfo, tree eoc, splay_tree offsets) argument
3588 build_base_field(record_layout_info rli, tree binfo, splay_tree offsets, tree *next_field) argument
4310 propagate_binfo_offsets(tree binfo, tree offset) argument
4426 end_of_base(tree binfo) argument
4450 tree binfo; local
4498 tree binfo; local
6196 tree binfo, base_binfo; local
6290 tree binfo; local
6372 get_vtbl_decl_for_binfo(tree binfo) argument
6395 get_primary_binfo(tree binfo) argument
6422 dump_class_hierarchy_r(FILE *stream, int flags, tree binfo, tree igo, int indent) argument
6575 dump_vtable(tree t, tree binfo, tree vtable) argument
6701 initialize_vtable(tree binfo, tree inits) argument
6708 dump_vtable (BINFO_TYPE (binfo), binfo, decl); local
6761 binfo_ctor_vtable(tree binfo) argument
6804 build_vtt_inits(tree binfo, tree t, tree *inits, tree *index) argument
6887 dfs_build_secondary_vptr_vtt_inits(tree binfo, void *data_) argument
6943 dfs_fixup_binfo_vtbls(tree binfo, void* data) argument
6969 build_ctor_vtbl_group(tree binfo, tree t) argument
7031 accumulate_vtbl_inits(tree binfo, tree orig_binfo, tree rtti_binfo, tree t, tree inits) argument
7081 dfs_accumulate_vtbl_inits(tree binfo, tree orig_binfo, tree rtti_binfo, tree t, tree l) argument
7212 build_vtbl_initializer(tree binfo, tree orig_binfo, tree t, tree rtti_binfo, int* non_fn_entries_p) argument
7395 build_vcall_and_vbase_vtbl_entries(tree binfo, vtbl_init_data* vid) argument
7417 build_vbase_offset_vtbl_entries(tree binfo, vtbl_init_data* vid) argument
7511 build_vcall_offset_vtbl_entries(tree binfo, vtbl_init_data* vid) argument
7549 add_vcall_offset_vtbl_entries_r(tree binfo, vtbl_init_data* vid) argument
7579 add_vcall_offset_vtbl_entries_1(tree binfo, vtbl_init_data* vid) argument
7664 add_vcall_offset(tree orig_fn, tree binfo, vtbl_init_data *vid) argument
7738 build_rtti_vtbl_entries(tree binfo, vtbl_init_data* vid) argument
[all...]
H A Dcvt.c138 tree binfo;
148 binfo = NULL_TREE;
151 binfo = lookup_base (intype_class, type_class, ba_check, NULL);
152 if (!same_p && !binfo)
155 binfo = lookup_base (type_class, intype_class, ba_check, NULL);
158 if (binfo == error_mark_node)
160 if (binfo || same_p)
162 if (binfo)
163 expr = build_base_path (code, expr, binfo, 0);
182 tree binfo;
137 tree binfo; local
181 tree binfo; local
312 tree binfo; local
387 tree binfo = lookup_base (argtype, target_type, ba_check, NULL); local
[all...]
H A Dtypeck2.c61 tree binfo = lookup_base (type, base, ba_unique, NULL); local
63 if (binfo == error_mark_node)
65 else if (!binfo)
67 return binfo;
1112 binfo for the specific base subobject we want to convert to. */ local
1117 tree binfo;
1122 binfo = *binfo_p;
1124 binfo = lookup_base (TREE_TYPE (datum), basetype, ba_check, NULL);
1126 if (!binfo || binfo
1221 tree binfo; local
[all...]
H A Dinit.c101 dfs_initialize_vtbl_ptrs (tree binfo, void *data) argument
103 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
106 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo))
110 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
112 expand_virtual_init (binfo, base_ptr);
473 tree base, binfo, base_binfo; local
492 for (binfo = TYPE_BINFO (t), i = 0;
493 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
735 build_vtbl_address (tree binfo) argument
770 expand_virtual_init(tree binfo, tree decl) argument
823 expand_cleanup_for_base(tree binfo, tree flag) argument
1153 expand_default_init(tree binfo, tree true_exp, tree exp, tree init, int flags) argument
1246 expand_aggr_init_1(tree binfo, tree true_exp, tree exp, tree init, int flags) argument
2870 tree binfo, base_binfo; local
[all...]
H A Dmethod.c84 thunks VIRTUAL_OFFSET is the virtual binfo. You must post process
560 tree binfo, base_binfo;
566 deal with the binfo's directly as a direct base might be
569 VEC_iterate (tree, vbases, i, binfo); i++)
572 = tree_cons (binfo,
575 binfo, 1)),
579 for (binfo = TYPE_BINFO (current_class_type), i = 0;
580 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
660 tree binfo, base_binfo;
663 for (binfo
558 tree binfo, base_binfo; local
658 tree binfo, base_binfo; local
831 tree binfo, base_binfo; local
[all...]
H A Drtti.c553 tree binfo;
555 binfo = lookup_base (TREE_TYPE (exprtype), TREE_TYPE (type),
558 if (binfo)
561 binfo, 0);
1041 tree binfo = TYPE_BINFO (type);
1042 int nbases = BINFO_N_BASE_BINFOS (binfo);
1043 VEC(tree,gc) *base_accesses = BINFO_BASE_ACCESSES (binfo);
1052 tree base_binfo = BINFO_BASE_BINFO (binfo, ix);
1215 tree binfo = TYPE_BINFO (type);
1216 VEC(tree,gc) *base_accesses = BINFO_BASE_ACCESSES (binfo);
551 tree binfo; local
1038 tree binfo = TYPE_BINFO (type); local
1212 tree binfo = TYPE_BINFO (type); local
[all...]
H A Ddump.c271 tree binfo; local
274 for (binfo = TYPE_BINFO (t), i = 0;
275 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
H A Dtree.c618 IGO_PREV points at the previous binfo of the inheritance graph
619 order chain. The newly copied binfo's TREE_CHAIN forms this
626 The BINFO_INHERITANCE of a virtual base class points to the binfo
633 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
645 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
652 if (binfo)
657 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
658 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
660 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
630 copy_binfo(tree binfo, tree type, tree t, tree *igo_prev, int virt) argument
1697 tree binfo; local
[all...]
H A Dsemantics.c248 if (probe->binfo == chk->binfo &&
276 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
305 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl) argument
318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
325 enforce_access (binfo, decl, diag_decl);
335 if (chk->decl == decl && chk->binfo == binfo &&
345 new_access->binfo = binfo;
1484 tree binfo = NULL_TREE; local
[all...]
H A Dcall.c402 /* If FN is a member function, the binfo indicating the path used to
406 (possibly improper) base of this binfo. */
408 /* If FN is a non-static member function, the binfo indicating the
5058 tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (*p)), local
5061 gcc_assert (binfo && binfo != error_mark_node);
5063 *p = build_base_path (PLUS_EXPR, *p, binfo, 1);
5218 tree binfo, int flags)
5230 if (TYPE_P (binfo))
5233 if (!complete_type_or_else (binfo, NULL_TRE
5217 build_special_member_call(tree instance, tree name, tree args, tree binfo, int flags) argument
[all...]
/freebsd-11-stable/contrib/binutils/bfd/
H A Dfreebsd.h91 long binfo = bfd_getb32(ext); local
93 int bmagic = binfo & 0xffff;
99 return bmagic_ok && !lmagic_ok ? binfo : linfo;
/freebsd-11-stable/sbin/newfs_nandfs/
H A Dnewfs_nandfs.c440 update_block_info(union nandfs_binfo *binfo, struct file_info *file) argument
449 binfo->bi_v.bi_vblocknr = vblock;
450 binfo->bi_v.bi_blkoff = i;
451 binfo->bi_v.bi_ino = file->ino;
454 binfo->bi_dat.bi_blkoff = i;
455 binfo->bi_dat.bi_ino = file->ino;
458 binfo++;
461 return (binfo);
467 union nandfs_binfo *binfo; local
490 binfo
[all...]
/freebsd-11-stable/sys/fs/nandfs/
H A Dnandfs_segment.c368 union nandfs_binfo *binfo; local
389 binfo = (union nandfs_binfo *)seginfo->curseg->current_off;
392 binfo->bi_v.bi_blkoff = bp->b_lblkno;
393 binfo->bi_v.bi_ino = node->nn_ino;
395 binfo->bi_dat.bi_blkoff = bp->b_lblkno;
396 binfo->bi_dat.bi_ino = node->nn_ino;
398 binfo->bi_dat.bi_level = 1;
400 binfo->bi_dat.bi_level = 0;
402 binfo++;
406 seginfo->curseg->current_off = (char *)binfo;
527 nandfs_update_phys_block(struct nandfs_device *fsdev, struct buf *bp, uint64_t phys_blknr, union nandfs_binfo *binfo) argument
577 union nandfs_binfo *binfo; local
[all...]
H A Dnandfs_cleaner.c212 struct nandfs_segment_summary *segsum, union nandfs_binfo *binfo,
219 if (binfo[i].bi_v.bi_ino == NANDFS_DAT_INO) {
227 (*bdpp)->bd_level = binfo[i].bi_dat.bi_level;
228 (*bdpp)->bd_offset = binfo[i].bi_dat.bi_blkoff;
231 (*vipp)->nvi_ino = binfo[i].bi_v.bi_ino;
232 (*vipp)->nvi_vblocknr = binfo[i].bi_v.bi_vblocknr;
243 union nandfs_binfo *binfo; local
266 binfo = (union nandfs_binfo *)(bp->b_data + segsum->ss_bytes);
278 nandfs_cleaner_iterate_psegment(fsdev, segsum, binfo, curr,
211 nandfs_cleaner_iterate_psegment(struct nandfs_device *fsdev, struct nandfs_segment_summary *segsum, union nandfs_binfo *binfo, nandfs_daddr_t blk, struct nandfs_vinfo **vipp, struct nandfs_bdesc **bdpp) argument
/freebsd-11-stable/contrib/gcc/
H A Dipa-type-escape.c526 tree binfo, base_binfo; local
528 for (binfo = TYPE_BINFO (parent), i = 0;
529 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1449 tree binfo, base_binfo;
1465 for (binfo = TYPE_BINFO (type), i = 0;
1466 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1552 tree binfo, base_binfo;
1572 for (binfo = TYPE_BINFO (type), i = 0;
1573 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1448 tree binfo, base_binfo; local
1551 tree binfo, base_binfo; local
H A Ddbxout.c2016 tree binfo = TYPE_BINFO (type);
2053 if (binfo)
2057 VEC(tree,gc) *accesses = BINFO_BASE_ACCESSES (binfo);
2061 if (BINFO_N_BASE_BINFOS (binfo))
2064 stabstr_U (BINFO_N_BASE_BINFOS (binfo));
2068 for (i = 0; BINFO_BASE_ITERATE (binfo, i, child); i++)
2009 tree binfo = TYPE_BINFO (type); local
H A Dtree.h1977 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1980 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2185 tree binfo;
2197 in another type. Each such basetype usage has its own "binfo"
2198 object to describe it. The binfo object is a TREE_VEC node.
2200 Inheritance is represented by the binfo nodes allocated for a
2202 inherited by C, 3 binfo nodes will be allocated: one for describing
2203 the binfo properties of C, similarly one for D, and one for
2204 describing the binfo properties of D as a base type for C.
2205 Thus, given a pointer to class C, one can get a pointer to the binfo
2174 tree binfo; local
[all...]
H A Dsdbout.c1146 tree binfo, child; local
1148 for (binfo = TYPE_BINFO (type), i = 0;
1149 BINFO_BASE_ITERATE (binfo, i, child); i++)
/freebsd-11-stable/sys/dev/firewire/
H A Dfirewire.c1517 struct bus_info *binfo; local
1547 binfo = (struct bus_info *)&csr[1];
1548 if (binfo->bus_name != CSR_BUS_NAME_IEEE1394) {
1559 binfo->irmc, binfo->cmc, binfo->isc,
1560 binfo->bmc, binfo->pmc, binfo->cyc_clk_acc,
1561 binfo
[all...]
/freebsd-11-stable/sys/dev/sound/pci/
H A Dcsapcm.c67 struct csa_bridgeinfo *binfo; /* The state of the parent. */ member in struct:csa_info
644 if ((csa->binfo->hisr & HISR_VC0) != 0)
646 if ((csa->binfo->hisr & HISR_VC1) != 0)
786 csa->binfo = func->varinfo;
794 csa->card = csa->binfo->card;
H A Dcsa.c76 struct csa_bridgeinfo binfo; /* The state of this bridge. */ member in struct:csa_softc
261 scp->binfo.card = scp->card;
306 func->varinfo = &scp->binfo;
317 func->varinfo = &scp->binfo;
555 scp->binfo.hisr = hisr;
/freebsd-11-stable/usr.sbin/btxld/
H A Dbtxld.c86 static const char binfo[] = variable
292 printf(binfo, btx.btx_majver, btx.btx_minver, btx.btx_textsz,

Completed in 264 milliseconds

12