/linux-2.4.37.9/fs/hfs/ |
D | bnode.c | 51 void hfs_bnode_delete(struct hfs_bnode *bn) in hfs_bnode_delete() argument 57 if (bn->next) { in hfs_bnode_delete() 58 bn->next->prev = bn->prev; in hfs_bnode_delete() 60 if (bn->prev) { in hfs_bnode_delete() 61 bn->prev->next = bn->next; in hfs_bnode_delete() 64 if (bhash(bn->tree, bn->node) == bn) { in hfs_bnode_delete() 65 bhash(bn->tree, bn->node) = bn->next; in hfs_bnode_delete() 68 hfs_buffer_put(bn->buf); /* safe: checks for NULL argument */ in hfs_bnode_delete() 69 HFS_DELETE(bn); in hfs_bnode_delete() 206 struct hfs_bnode *bn = bnr->bn; in hfs_bnode_lock() local [all …]
|
D | balloc.c | 79 if (!HFS_NEW(retval.bn)) { in hfs_bnode_init() 85 memset(retval.bn, 0, sizeof(*retval.bn)); in hfs_bnode_init() 86 retval.bn->magic = HFS_BNODE_MAGIC; in hfs_bnode_init() 87 retval.bn->tree = tree; in hfs_bnode_init() 88 retval.bn->node = node; in hfs_bnode_init() 89 hfs_init_waitqueue(&retval.bn->wqueue); in hfs_bnode_init() 90 hfs_init_waitqueue(&retval.bn->rqueue); in hfs_bnode_init() 93 retval.bn->buf = get_new_node(tree, node); in hfs_bnode_init() 94 if (!hfs_buffer_ok(retval.bn->buf)) { in hfs_bnode_init() 103 memset(hfs_buffer_data(retval.bn->buf), 0, HFS_SECTOR_SIZE); in hfs_bnode_init() [all …]
|
D | bdelete.c | 48 struct hfs_bnode *bnode = belem->bnr.bn; in bdelete_nonempty() 92 struct hfs_btree *tree = root->bn->tree; in del_root() 96 if (root->bn->ndNRecs > 1) { in del_root() 98 } else if (root->bn->ndNRecs == 0) { in del_root() 113 } else if (root->bn->ndType == ndIndxNode) { in del_root() 115 node = hfs_get_hl(bkey_record(bnode_datastart(root->bn))); in del_root() 118 if (!child.bn) { in del_root() 123 child.bn->sticky = HFS_STICKY; in del_root() 124 if (child.bn->next) { in del_root() 125 child.bn->next->prev = child.bn->prev; in del_root() [all …]
|
D | bfind.c | 131 struct hfs_bnode *bn; in hfs_bfind() local 151 bn = curr->bnr.bn; in hfs_bfind() 173 ntype = bn->ndType; in hfs_bfind() 177 if (bn->ndBLink) { in hfs_bfind() 215 "btree %d\n", bn->ndType, bn->node, in hfs_bfind() 271 struct hfs_bnode *bn; in hfs_bsucc() local 274 !(bn = belem->bnr.bn) || (bn->magic != HFS_BNODE_MAGIC) || in hfs_bsucc() 275 !bn->tree || (bn->tree->magic != HFS_BTREE_MAGIC) || in hfs_bsucc() 276 !hfs_buffer_ok(bn->buf)) { in hfs_bsucc() 282 int left = bn->ndNRecs - belem->record; in hfs_bsucc() [all …]
|
D | binsert.c | 66 struct hfs_bnode *bnode = belem->bnr.bn; in binsert_nonfull() 129 if (!(root = bnr.bn)) { in add_root() 212 if (!retval.bn) { in insert_empty_bnode() 216 retval.bn->sticky = HFS_NOT_STICKY; in insert_empty_bnode() 217 if ((retval.bn->next = bhash(tree, retval.bn->node))) { in insert_empty_bnode() 218 retval.bn->next->prev = retval.bn; in insert_empty_bnode() 220 bhash(tree, retval.bn->node) = retval.bn; in insert_empty_bnode() 224 if (!right.bn) { in insert_empty_bnode() 226 hfs_bnode_bitop(tree, retval.bn->node, 0); in insert_empty_bnode() 230 right.bn->ndBLink = retval.bn->node; in insert_empty_bnode() [all …]
|
D | brec.c | 99 overflow(brec->tree, elem->bnr.bn) | in hfs_brec_next() 100 underflow(brec->tree, elem->bnr.bn); in hfs_brec_next() 121 if (!elem->bnr.bn) { in hfs_brec_next() 125 elem->record = elem->bnr.bn->ndNRecs; in hfs_brec_next() 210 if (!head->bnr.bn) { in hfs_brec_init() 215 if (!root->bnr.bn) { in hfs_brec_init() 220 root->record = root->bnr.bn->ndNRecs; in hfs_brec_init() 229 root->flags = overflow(tree, root->bnr.bn); in hfs_brec_init()
|
D | btree.c | 49 static void hfs_bnode_ditch(struct hfs_bnode *bn) { in hfs_bnode_ditch() argument 55 while (bn != NULL) { in hfs_bnode_ditch() 56 tmp = bn->next; in hfs_bnode_ditch() 59 bn->node, (int)ntohl(bn->tree->entry.cnid), bn->count); in hfs_bnode_ditch() 62 hfs_buffer_put(bn->buf); /* safe: checks for NULL argument */ in hfs_bnode_ditch() 65 if (bn->node) { in hfs_bnode_ditch() 66 HFS_DELETE(bn); in hfs_bnode_ditch() 68 bn = tmp; in hfs_bnode_ditch()
|
D | bins_del.c | 55 memcpy(1+bnode_key(belem->bnr.bn, record), key, keysize); in hfs_bnode_update_key() 225 if (belem->bnr.bn && (belem->bnr.bn->node == node)) { in hfs_bnode_in_brec()
|
D | hfs_btree.h | 246 { return bnode_key(elem->bnr.bn, elem->record); } in belem_key()
|
D | hfs.h | 394 struct hfs_bnode *bn; member
|
/linux-2.4.37.9/fs/freevxfs/ |
D | vxfs_bmap.c | 67 vxfs_bmap_ext4(struct inode *ip, long bn) in vxfs_bmap_ext4() argument 80 if (bn >= 0 && bn < d->size) in vxfs_bmap_ext4() 81 return (bn + d->extent); in vxfs_bmap_ext4() 82 bn -= d->size; in vxfs_bmap_ext4() 85 if ((bn / (indsize * indsize * bsize / 4)) == 0) { in vxfs_bmap_ext4() 95 bno = indir[(bn/indsize) % (indsize*bn)] + (bn%indsize); in vxfs_bmap_ext4()
|
/linux-2.4.37.9/fs/jfs/ |
D | jfs_xtree.c | 156 s64 bn; in xtLookup() local 194 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtLookup() 254 s64 bn; in xtLookupList() local 297 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtLookupList() 304 if ((bn = le64_to_cpu(p->header.next)) == 0) in xtLookupList() 310 XT_GETPAGE(ip, bn, mp, PSIZE, p, rc); in xtLookupList() 448 if ((bn = le64_to_cpu(p->header.next)) == 0) in xtLookupList() 454 XT_GETPAGE(ip, bn, mp, PSIZE, p, rc); in xtLookupList() 505 s64 bn; /* block number */ in xtSearch() local 536 for (bn = 0;;) { in xtSearch() [all …]
|
D | jfs_dtree.c | 332 static u32 add_index(tid_t tid, struct inode *ip, s64 bn, int slot) in add_index() argument 370 DTSaddress(dirtab_slot, bn); in add_index() 470 DTSaddress(dirtab_slot, bn); in add_index() 517 static void modify_index(tid_t tid, struct inode *ip, u32 index, s64 bn, in modify_index() argument 527 DTSaddress(dirtab_slot, bn); in modify_index() 578 s64 bn; in dtSearch() local 628 for (bn = 0;;) { in dtSearch() 630 DT_GETPAGE(ip, bn, mp, psize, p, rc); in dtSearch() 700 btsp->bn = bn; in dtSearch() 749 btsp->bn = bn; in dtSearch() [all …]
|
D | jfs_btree.h | 112 s64 bn; /* 8: */ member 133 (BTSTACK)->top->bn = BN;\ 150 (long long)btstack->stack[i].bn, in BT_STACK_DUMP() 157 BN = (LEAF)->bn;\
|
D | jfs_xtree.h | 137 extern int xtDisplayPage(struct inode *ip, s64 bn, xtpage_t * p);
|
D | jfs_dtree.h | 276 extern int dtDisplayPage(struct inode *ip, s64 bn, dtpage_t * p);
|
/linux-2.4.37.9/drivers/video/ |
D | pm3fb.c | 638 static char *pm3fb_boardnum_setup(char *options, unsigned long *bn); 2663 static char *pm3fb_boardnum_setup(char *options, unsigned long *bn) in pm3fb_boardnum_setup() argument 2668 (*bn) = 0; in pm3fb_boardnum_setup() 2672 (*bn) = simple_strtoul(options, &next, 10); in pm3fb_boardnum_setup() 2674 if (next && (next[0] == ':') && ((*bn) >= 0) in pm3fb_boardnum_setup() 2675 && ((*bn) <= PM3_MAX_BOARD)) { in pm3fb_boardnum_setup() 2676 DPRINTK(2, "Board_num seen as %ld\n", (*bn)); in pm3fb_boardnum_setup() 2679 (*bn) = 0; in pm3fb_boardnum_setup() 2680 DPRINTK(2, "Board_num default to %ld\n", (*bn)); in pm3fb_boardnum_setup() 2688 unsigned long i, bn; in pm3fb_real_setup() local [all …]
|
/linux-2.4.37.9/fs/reiserfs/ |
D | journal.c | 120 struct reiserfs_bitmap_node *bn ; in allocate_bitmap_node() local 123 bn = reiserfs_kmalloc(sizeof(struct reiserfs_bitmap_node), GFP_NOFS, p_s_sb) ; in allocate_bitmap_node() 124 if (!bn) { in allocate_bitmap_node() 127 bn->data = reiserfs_kmalloc(p_s_sb->s_blocksize, GFP_NOFS, p_s_sb) ; in allocate_bitmap_node() 128 if (!bn->data) { in allocate_bitmap_node() 129 reiserfs_kfree(bn, sizeof(struct reiserfs_bitmap_node), p_s_sb) ; in allocate_bitmap_node() 132 bn->id = id++ ; in allocate_bitmap_node() 133 memset(bn->data, 0, p_s_sb->s_blocksize) ; in allocate_bitmap_node() 134 INIT_LIST_HEAD(&bn->list) ; in allocate_bitmap_node() 135 return bn ; in allocate_bitmap_node() [all …]
|
/linux-2.4.37.9/fs/xfs/linux-2.4/ |
D | xfs_aops.c | 195 xfs_daddr_t bn; in xfs_map_at_offset() local 210 bn = iomapp->iomap_bn >> sector_shift; in xfs_map_at_offset() 211 bn += delta; in xfs_map_at_offset() 212 BUG_ON(!bn && !(iomapp->iomap_flags & IOMAP_REALTIME)); in xfs_map_at_offset() 213 ASSERT((bn << sector_shift) >= iomapp->iomap_bn); in xfs_map_at_offset() 216 bh->b_blocknr = bn; in xfs_map_at_offset() 882 xfs_daddr_t bn; in linvfs_get_block_core() local 892 bn = iomap.iomap_bn >> (inode->i_blkbits - BBSHIFT); in linvfs_get_block_core() 893 bn += delta; in linvfs_get_block_core() 894 BUG_ON(!bn && !(iomap.iomap_flags & IOMAP_REALTIME)); in linvfs_get_block_core() [all …]
|
D | xfs_buf.c | 1576 xfs_daddr_t bn, /* starting block number */ in _pagebuf_page_io() argument 1603 bn -= (pg_offset >> BBSHIFT); in _pagebuf_page_io() 1618 bh->b_blocknr = bn; in _pagebuf_page_io() 1621 } while ((bn += i), in _pagebuf_page_io() 1650 (((unsigned int) bn) & BN_ALIGN_MASK) == 0) { in _pagebuf_page_io() 1672 for (; blk_length > 0; bn += i, blk_length--, pg_offset += sector) { in _pagebuf_page_io() 1677 bh->b_blocknr = bn; in _pagebuf_page_io() 1734 xfs_daddr_t bn = pb->pb_bn; in _pagebuf_page_apply() local 1745 bn -= (pb->pb_offset >> BBSHIFT); in _pagebuf_page_apply() 1751 bn += (pb_offset + BBMASK) >> BBSHIFT; in _pagebuf_page_apply() [all …]
|
/linux-2.4.37.9/drivers/sbus/char/ |
D | aurora.c | 279 int bn = 0; in aurora_probe() local 294 "do not match.\n", bn); in aurora_probe() 297 bp = &aurora_board[bn]; in aurora_probe() 304 "reg_addrs[0]\n", bn); in aurora_probe() 316 "reg_addrs[1]\n", bn); in aurora_probe() 328 "reg_addrs[2]\n", bn); in aurora_probe() 340 "reg_addrs[3]\n", bn); in aurora_probe() 352 if ((bp->irq=irqs[bn]) && valid_irq(bp->irq) && in aurora_probe() 369 printk(KERN_ERR "aurora%d: Could not get an irq for this board !!!\n",bn); in aurora_probe() 374 printk(KERN_INFO "aurora%d: irq %d\n",bn,bp->irq&0x0f); in aurora_probe() [all …]
|
/linux-2.4.37.9/drivers/cdrom/ |
D | sjcd.c | 1087 int i, bn = CURRENT->sector / 4; in sjcd_transfer() local 1089 i < SJCD_BUF_SIZ && sjcd_buf_bn[i] != bn; in sjcd_transfer() 1097 if (sjcd_buf_bn[i] != bn) { in sjcd_transfer()
|
D | mcd.c | 563 int bn = CURRENT->sector / 4; in mcd_transfer() local 565 for (i = 0; i < MCD_BUF_SIZ && mcd_buf_bn[i] != bn; in mcd_transfer() 572 if (mcd_buf_bn[i] != bn) { in mcd_transfer()
|
D | optcd.c | 1014 int bn = CURRENT -> sector / 4; in transfer() local 1016 for (i = 0; i < N_BUFS && buf_bn[i] != bn; ++i); in transfer() 1030 if (buf_bn[i] != bn) { in transfer()
|
D | aztcd.c | 1559 int bn = CURRENT->sector / 4; in azt_transfer() local 1561 for (i = 0; i < AZT_BUF_SIZ && azt_buf_bn[i] != bn; in azt_transfer() 1569 if (azt_buf_bn[i] != bn) { in azt_transfer()
|