Searched refs:bn (Results 1 - 25 of 40) sorted by relevance

12

/linux-master/fs/xfs/scrub/
H A Dbitmap.c61 #define for_each_xbitmap64_extent(bn, bitmap) \
62 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \
64 (bn) != NULL; \
65 (bn) = rb_entry_safe(rb_next(&(bn)->bn_rbnode), \
75 struct xbitmap64_node *bn; local
79 while ((bn = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last))) {
80 if (bn->bn_start < start && bn->bn_last > last) {
81 uint64_t old_last = bn
182 struct xbitmap64_node *bn; local
217 struct xbitmap64_node *bn; local
238 struct xbitmap64_node *bn; local
254 struct xbitmap64_node *bn; local
281 struct xbitmap64_node *bn; local
349 struct xbitmap32_node *bn; local
456 struct xbitmap32_node *bn; local
491 struct xbitmap32_node *bn; local
512 struct xbitmap32_node *bn; local
528 struct xbitmap32_node *bn; local
555 struct xbitmap32_node *bn; local
575 struct xbitmap32_node *bn; local
[all...]
/linux-master/fs/bcachefs/
H A Dbtree_io.h109 struct btree_node *bn = container_of(i, struct btree_node, keys); local
110 unsigned bytes = (void *) &bn->keys - (void *) &bn->flags;
113 &bn->flags, bytes);
197 struct btree_node *bn)
201 !bpos_eq(bn->min_key, POS_MIN) &&
203 bn->min_key = bpos_nosnap_predecessor(bn->min_key);
207 bn->max_key.snapshot = 0;
209 compat_bpos(level, btree_id, version, big_endian, write, &bn
194 compat_btree_node(unsigned level, enum btree_id btree_id, unsigned version, unsigned big_endian, int write, struct btree_node *bn) argument
[all...]
H A Dbtree_node_scan.c119 struct bio *bio, struct btree_node *bn, u64 offset)
125 bch2_bio_map(bio, bn, PAGE_SIZE);
133 if (le64_to_cpu(bn->magic) != bset_magic(c))
136 if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(&bn->keys))) {
137 struct nonce nonce = btree_nonce(&bn->keys, 0);
138 unsigned bytes = (void *) &bn->keys - (void *) &bn->flags;
140 bch2_encrypt(c, BSET_CSUM_TYPE(&bn->keys), nonce, &bn->flags, bytes);
143 if (btree_id_is_alloc(BTREE_NODE_ID(bn)))
118 try_read_btree_node(struct find_btree_nodes *f, struct bch_dev *ca, struct bio *bio, struct btree_node *bn, u64 offset) argument
[all...]
H A Dbtree_io.c740 struct btree_node *bn = local
749 btree_err_on(bp->seq != bn->keys.seq,
756 btree_err_on(BTREE_NODE_ID(bn) != b->c.btree_id,
762 btree_err_on(BTREE_NODE_LEVEL(bn) != b->c.level,
770 BSET_BIG_ENDIAN(i), write, bn);
787 bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf),
792 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p),
798 bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf));
802 BSET_BIG_ENDIAN(i), write, bn);
804 btree_err_on(bch2_bkey_format_invalid(c, &bn
1386 struct btree_node *bn = data; local
1409 struct btree_node *bn = data; local
1441 struct btree_node *bn = ra->buf[i]; local
1482 struct btree_node *bn = ra->buf[i]; local
1974 struct btree_node *bn = NULL; local
[all...]
/linux-master/drivers/net/bonding/
H A Dbond_procfs.c286 struct bond_net *bn = net_generic(dev_net(bond_dev), bond_net_id); local
288 if (bn->proc_dir) {
290 bn->proc_dir, &bond_info_seq_ops, bond);
302 struct bond_net *bn = net_generic(dev_net(bond_dev), bond_net_id); local
304 if (bn->proc_dir && bond->proc_entry) {
305 remove_proc_entry(bond->proc_file_name, bn->proc_dir);
314 void __net_init bond_create_proc_dir(struct bond_net *bn) argument
316 if (!bn->proc_dir) {
317 bn->proc_dir = proc_mkdir(DRV_NAME, bn
326 bond_destroy_proc_dir(struct bond_net *bn) argument
[all...]
H A Dbond_sysfs.c38 const struct bond_net *bn = local
45 list_for_each_entry(bond, &bn->dev_list, bond_list) {
62 static struct net_device *bond_get_by_name(const struct bond_net *bn, const char *ifname) argument
66 list_for_each_entry(bond, &bn->dev_list, bond_list) {
82 const struct bond_net *bn = local
96 rv = bond_create(bn->net, ifname);
108 bond_dev = bond_get_by_name(bn, ifname);
806 int __net_init bond_create_sysfs(struct bond_net *bn) argument
810 bn->class_attr_bonding_masters = class_attr_bonding_masters;
811 sysfs_attr_init(&bn
839 bond_destroy_sysfs(struct bond_net *bn) argument
[all...]
/linux-master/drivers/char/
H A Dbsr.c169 static int bsr_add_node(struct device_node *bn) argument
177 bsr_stride = of_get_property(bn, "ibm,lock-stride", &bsr_stride_len);
178 bsr_bytes = of_get_property(bn, "ibm,#lock-bytes", &bsr_bytes_len);
200 result = of_address_to_resource(bn, i, &res);
274 static int bsr_create_devs(struct device_node *bn) argument
278 while (bn) {
279 ret = bsr_add_node(bn);
281 of_node_put(bn);
284 bn = of_find_compatible_node(bn, NUL
[all...]
/linux-master/fs/jfs/
H A Djfs_btree.h18 s64 next; right sibling bn
19 s64 prev; left sibling bn
99 s64 bn; /* 8: */ member in struct:btframe
120 (BTSTACK)->top->bn = BN;\
136 printk(KERN_ERR "bn = %Lx, index = %d\n",
137 (long long)btstack->stack[i].bn,
144 BN = (LEAF)->bn;\
H A Djfs_xtree.c128 s64 bn; local
164 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
211 * btstack contains (bn, index) of search path traversed to the entry.
221 s64 bn; /* block number */ local
251 * by convention, root bn = 0.
253 for (bn = 0;;) {
255 XT_GETPAGE(ip, bn, mp, PSIZE, p, rc);
336 btsp->bn = bn;
383 btsp->bn
521 s64 bn; local
1345 s64 bn; local
1504 s64 bn; local
1950 s64 bn, xaddr; local
2194 s64 bn; local
2746 s64 bn; local
[all...]
H A Djfs_dtree.c321 static u32 add_index(tid_t tid, struct inode *ip, s64 bn, int slot) argument
359 DTSaddress(dirtab_slot, bn);
464 DTSaddress(dirtab_slot, bn);
511 static void modify_index(tid_t tid, struct inode *ip, u32 index, s64 bn, argument
521 DTSaddress(dirtab_slot, bn);
572 s64 bn; local
619 * by convention, root bn = 0.
621 for (bn = 0;;) {
623 DT_GETPAGE(ip, bn, mp, psize, p, rc);
698 btsp->bn
820 s64 bn; local
2079 s64 bn; local
2613 add_missing_indices(struct inode *inode, s64 bn) argument
2711 s64 bn; local
3040 s64 bn; local
3118 s64 bn; local
3614 s64 bn = 0; local
4218 s64 bn; local
[all...]
/linux-master/fs/freevxfs/
H A Dvxfs_bmap.c32 * @bn: logical block.
43 vxfs_bmap_ext4(struct inode *ip, long bn) argument
57 if (bn >= 0 && bn < fs32_to_cpu(sbi, d->size))
58 return (bn + fs32_to_cpu(sbi, d->extent));
59 bn -= fs32_to_cpu(sbi, d->size);
62 if ((bn / (indsize * indsize * bsize / 4)) == 0) {
73 bno = fs32_to_cpu(sbi, indir[(bn / indsize) % (indsize * bn)]) +
74 (bn
[all...]
/linux-master/lib/
H A Dmaple_tree.c149 struct maple_big_node *bn; member in struct:maple_subtree_state
1847 * @bn: The maple_big_node with the data
1853 struct maple_big_node *bn, unsigned char *mid_split, unsigned long min)
1855 unsigned char b_end = bn->b_end;
1857 unsigned char slot_min, slot_count = mt_slots[bn->type];
1867 split = b_end - mt_min_slots[bn->type];
1869 if (!ma_is_leaf(bn->type))
1873 if (!bn->slot[split])
1886 if (unlikely(mab_middle_node(bn, split, slot_count))) {
1890 slot_min = mt_min_slots[bn
1852 mab_calc_split(struct ma_state *mas, struct maple_big_node *bn, unsigned char *mid_split, unsigned long min) argument
3408 mas_reuse_node(struct ma_wr_state *wr_mas, struct maple_big_node *bn, unsigned char end) argument
[all...]
/linux-master/fs/gfs2/
H A Dxattr.c149 u64 bn; local
153 bn = be64_to_cpu(*eablk);
155 error = gfs2_meta_read(ip->i_gl, bn, DIO_WAIT, 0, &eabh);
238 u64 bn = 0; local
256 bn = be64_to_cpu(*dataptrs);
262 rgd = gfs2_blk2rgrpd(sdp, bn, 1);
284 bn = be64_to_cpu(*dataptrs);
286 if (bstart + blen == bn)
291 bstart = bn;
1295 u64 bn; local
1340 u64 bn; local
[all...]
H A Drgrp.h44 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n,
H A Ddir.c864 u64 bn; local
871 error = gfs2_alloc_blocks(ip, &bn, &n, 0);
874 bh = gfs2_meta_new(ip->i_gl, bn);
878 gfs2_trans_remove_revoke(GFS2_SB(inode), bn, 1);
915 u64 bn; local
927 bn = bh->b_blocknr;
974 *lp = cpu_to_be64(bn);
1005 u64 bn, leaf_no; local
1034 bn = nbh->b_blocknr;
1060 lp[x] = cpu_to_be64(bn);
1731 u64 bn; local
[all...]
H A Dbmap.c610 unsigned offset, u64 bn)
617 mp->mp_bh[i] = gfs2_meta_new(gl, bn);
622 *ptr = cpu_to_be64(bn);
667 u64 bn; local
708 ret = gfs2_alloc_blocks(ip, &bn, &n, 0);
713 gfs2_trans_remove_revoke(sdp, bn, n);
724 gfs2_indirect_init(mp, ip->i_gl, i, 0, bn++);
753 mp->mp_list[i-1], bn++);
765 iomap->addr = bn << inode->i_blkbits;
768 *ptr++ = cpu_to_be64(bn
608 gfs2_indirect_init(struct metapath *mp, struct gfs2_glock *gl, unsigned int i, unsigned offset, u64 bn) argument
1462 u64 bn, bstart, isize_blks; local
[all...]
/linux-master/drivers/usb/storage/
H A Dene_ub6250.c678 u32 bn = ((cdb[2] << 24) & 0xff000000) | ((cdb[3] << 16) & 0x00ff0000) | local
681 u32 bnByte = bn * 0x200;
684 if (bn > info->bl_num)
694 bnByte = bn;
718 u32 bn = ((cdb[2] << 24) & 0xff000000) | ((cdb[3] << 16) & 0x00ff0000) | local
721 u32 bnByte = bn * 0x200;
724 if (bn > info->bl_num)
734 bnByte = bn;
877 u32 bn = PhyBlockAddr * 0x20 + PageNum; local
892 bcb->CDB[5] = (unsigned char)(bn);
1190 u32 bn = PhyBlockAddr; local
1642 u32 bn = ((cdb[2] << 24) & 0xff000000) | ((cdb[3] << 16) & 0x00ff0000) | local
1741 u32 bn = ((cdb[2] << 24) & 0xff000000) | local
[all...]
/linux-master/drivers/accessibility/speakup/
H A Dmain.c864 static int bn; variable
869 bn = currbuf;
871 if (prev && --bn == -1)
872 bn = 1;
874 if (num > numsentences[bn])
877 spkup_write(sentmarks[bn][num], sentbufend[bn] - sentmarks[bn][num]);
884 int i, bn; local
890 bn
[all...]
/linux-master/drivers/md/persistent-data/
H A Ddm-btree.c1472 struct btree_node *bn = dm_block_data(n->b); local
1477 nr = le32_to_cpu(bn->header.nr_entries);
1479 memcpy(&value_le, value_ptr(bn, i), sizeof(value_le));
1487 struct btree_node *bn = dm_block_data(n->b); local
1489 return le32_to_cpu(bn->header.flags) & LEAF_NODE;
1524 struct btree_node *bn; local
1531 bn = dm_block_data(n->b);
1534 if (n->index < le32_to_cpu(bn->header.nr_entries))
1547 struct btree_node *bn; local
1552 bn
1625 struct btree_node *bn = dm_block_data(n->b); local
[all...]
/linux-master/drivers/net/
H A Dbareudp.c603 static struct bareudp_dev *bareudp_find_dev(struct bareudp_net *bn, argument
608 list_for_each_entry(bareudp, &bn->bareudp_list, next) {
619 struct bareudp_net *bn = net_generic(net, bareudp_net_id); local
625 t = bareudp_find_dev(bn, conf);
647 list_add(&bareudp->next, &bn->bareudp_list);
742 struct bareudp_net *bn = net_generic(net, bareudp_net_id); local
744 INIT_LIST_HEAD(&bn->bareudp_list);
750 struct bareudp_net *bn = net_generic(net, bareudp_net_id); local
753 list_for_each_entry_safe(bareudp, next, &bn->bareudp_list, next)
/linux-master/fs/reiserfs/
H A Djournal.c137 struct reiserfs_bitmap_node *bn; local
140 bn = kmalloc(sizeof(struct reiserfs_bitmap_node), GFP_NOFS);
141 if (!bn) {
144 bn->data = kzalloc(sb->s_blocksize, GFP_NOFS);
145 if (!bn->data) {
146 kfree(bn);
149 bn->id = id++;
150 INIT_LIST_HEAD(&bn->list);
151 return bn;
157 struct reiserfs_bitmap_node *bn local
177 free_bitmap_node(struct super_block *sb, struct reiserfs_bitmap_node *bn) argument
195 struct reiserfs_bitmap_node *bn = NULL; local
259 struct reiserfs_bitmap_node *bn; local
973 b_blocknr_t bn; local
[all...]
/linux-master/drivers/nvme/target/
H A Dnvmet.h438 static inline void nvmet_clear_aen_bit(struct nvmet_req *req, u32 bn) argument
443 clear_bit(bn, &req->sq->ctrl->aen_masked);
446 static inline bool nvmet_aen_bit_disabled(struct nvmet_ctrl *ctrl, u32 bn) argument
448 if (!(READ_ONCE(ctrl->aen_enabled) & (1 << bn)))
450 return test_and_set_bit(bn, &ctrl->aen_masked);
/linux-master/include/net/
H A Dbonding.h714 void bond_create_proc_dir(struct bond_net *bn);
715 void bond_destroy_proc_dir(struct bond_net *bn);
725 static inline void bond_create_proc_dir(struct bond_net *bn) argument
729 static inline void bond_destroy_proc_dir(struct bond_net *bn) argument
/linux-master/drivers/net/ethernet/chelsio/cxgb/
H A Dvsc7326_reg.h84 * bn = bucket number 0-10 (yes, 11 buckets)
87 #define REG_TRAFFIC_SHAPER_BUCKET(ie,bn) CRA(0x2,ie&1,0x0a + (bn>7) | ((bn&7)<<4))
/linux-master/drivers/net/ethernet/chelsio/cxgb4/
H A Dcudbg_entity.h228 u8 bn[PN_LEN + 1]; member in struct:cudbg_vpd_data

Completed in 855 milliseconds

12