| /linux-2.4.37.9/fs/hfsplus/ |
| D | bfind.c | 15 void hfsplus_find_rec(hfsplus_bnode *bnode, struct hfsplus_find_data *fd) in hfsplus_find_rec() argument
23 e = bnode->num_recs - 1; in hfsplus_find_rec()
26 len = hfsplus_brec_lenoff(bnode, rec, &off); in hfsplus_find_rec()
27 keylen = hfsplus_brec_keylen(bnode, rec); in hfsplus_find_rec()
28 hfsplus_bnode_readbytes(bnode, fd->key, off, keylen); in hfsplus_find_rec()
29 cmpval = bnode->tree->keycmp(fd->key, fd->search_key); in hfsplus_find_rec()
42 len = hfsplus_brec_lenoff(bnode, e, &off); in hfsplus_find_rec()
43 keylen = hfsplus_brec_keylen(bnode, e); in hfsplus_find_rec()
44 hfsplus_bnode_readbytes(bnode, fd->key, off, keylen); in hfsplus_find_rec()
58 hfsplus_bnode *bnode; in hfsplus_btree_find() local
[all …]
|
| D | catalog.c | 211 hfsplus_bnode_readbytes(fd.bnode, &fd.search_key->cat.name.length, off, 2); in hfsplus_delete_cat()
213 hfsplus_bnode_readbytes(fd.bnode, &fd.search_key->cat.name.unicode, off + 2, len); in hfsplus_delete_cat()
222 type = hfsplus_bnode_read_u16(fd.bnode, fd.entryoffset); in hfsplus_delete_cat()
226 hfsplus_bnode_readbytes(fd.bnode, &fork, off, sizeof(fork)); in hfsplus_delete_cat()
231 hfsplus_bnode_readbytes(fd.bnode, &fork, off, sizeof(fork)); in hfsplus_delete_cat()
285 hfsplus_bnode_readbytes(src_fd.bnode, &entry, src_fd.entryoffset, in hfsplus_rename_cat()
319 type = hfsplus_bnode_read_u16(src_fd.bnode, src_fd.entryoffset); in hfsplus_rename_cat()
335 hfsplus_put_bnode(dst_fd.bnode); in hfsplus_rename_cat()
|
| D | bnode.c | 383 node = fd->bnode; in hfsplus_bnode_split()
423 fd->bnode = new_node; in hfsplus_bnode_split()
494 if (!fd->bnode) { in hfsplus_bnode_insert_rec()
497 fd->bnode = hfsplus_find_bnode(tree, tree->leaf_head); in hfsplus_bnode_insert_rec()
507 node = fd->bnode; in hfsplus_bnode_insert_rec()
555 hfsplus_put_bnode(fd->bnode); in hfsplus_bnode_insert_rec()
560 fd->bnode = hfsplus_find_bnode(tree, new_node->parent); in hfsplus_bnode_insert_rec()
569 hfsplus_find_rec(fd->bnode, fd); in hfsplus_bnode_insert_rec()
591 node = fd->bnode; in hfsplus_update_idx_rec()
616 fd->bnode = parent; in hfsplus_update_idx_rec()
[all …]
|
| D | inode.c | 362 type = hfsplus_bnode_read_u16(fd->bnode, fd->entryoffset); in hfsplus_cat_read_inode()
371 hfsplus_bnode_readbytes(fd->bnode, &entry, fd->entryoffset, in hfsplus_cat_read_inode()
390 hfsplus_bnode_readbytes(fd->bnode, &entry, fd->entryoffset, in hfsplus_cat_read_inode()
446 hfsplus_bnode_readbytes(fd.bnode, &entry, fd.entryoffset, in hfsplus_cat_write_inode()
454 hfsplus_bnode_writebytes(fd.bnode, &entry, fd.entryoffset, in hfsplus_cat_write_inode()
461 hfsplus_bnode_readbytes(fd.bnode, &entry, fd.entryoffset, in hfsplus_cat_write_inode()
474 hfsplus_bnode_writebytes(fd.bnode, &entry, fd.entryoffset, in hfsplus_cat_write_inode()
|
| D | Makefile | 13 bnode.o brec.o bfind.o tables.o unicode.o wrapper.o
|
| D | extents.c | 81 hfsplus_bnode_readbytes(fd->bnode, extent, fd->entryoffset, fd->entrylength); in hfsplus_find_extentry()
412 hfsplus_bnode_writebytes(fd.bnode, &ext_entry, in hfsplus_extend_file()
500 hfsplus_bnode_writebytes(fd.bnode, &ext_entry, in hfsplus_truncate()
|
| D | dir.c | 128 hfsplus_bnode_readbytes(fd.bnode, &entry, fd.entryoffset, fd.entrylength); in hfsplus_readdir()
158 hfsplus_bnode_readbytes(fd.bnode, &entry, fd.entryoffset, fd.entrylength); in hfsplus_readdir()
|
| D | hfsplus_fs.h | 201 hfsplus_bnode *bnode; member
|
| /linux-2.4.37.9/fs/hfs/ |
| D | bnode.c | 113 void hfs_bnode_read(struct hfs_bnode *bnode, struct hfs_btree *tree, in hfs_bnode_read() argument
121 memset(bnode, 0, sizeof(*bnode)); in hfs_bnode_read()
122 bnode->magic = HFS_BNODE_MAGIC; in hfs_bnode_read()
123 bnode->tree = tree; in hfs_bnode_read()
124 bnode->node = node; in hfs_bnode_read()
125 bnode->sticky = sticky; in hfs_bnode_read()
126 hfs_init_waitqueue(&bnode->rqueue); in hfs_bnode_read()
127 hfs_init_waitqueue(&bnode->wqueue); in hfs_bnode_read()
131 if ((bnode->next = bhash(tree, node))) { in hfs_bnode_read()
132 bnode->next->prev = bnode; in hfs_bnode_read()
[all …]
|
| D | bdelete.c | 48 struct hfs_bnode *bnode = belem->bnr.bn; in bdelete_nonempty() local
51 nrecs = bnode->ndNRecs; in bdelete_nonempty()
52 size = bnode_rsize(bnode, rec); in bdelete_nonempty()
53 tomove = bnode_offset(bnode, nrecs+1) - bnode_offset(bnode, rec+1); in bdelete_nonempty()
57 hfs_put_hs(bnode_offset(bnode,i+1) - size, RECTBL(bnode,i)); in bdelete_nonempty()
61 start = bnode_key(bnode, rec); in bdelete_nonempty()
65 --bnode->ndNRecs; in bdelete_nonempty()
207 struct hfs_bnode *bnode = center->bn; in delete_empty_bnode() local
211 } else if (bnode->ndType == ndLeafNode) { in delete_empty_bnode()
212 bnode->tree->bthFNode = right_node; in delete_empty_bnode()
[all …]
|
| D | hfs_btree.h | 216 extern inline hfs_u16 bnode_offset(const struct hfs_bnode *bnode, int n) in bnode_offset() argument
217 { return hfs_get_hs(RECTBL(bnode,n)); } in bnode_offset()
221 extern inline hfs_u16 bnode_rsize(const struct hfs_bnode *bnode, int n) in bnode_rsize() argument
222 { return bnode_offset(bnode, n+1) - bnode_offset(bnode, n); } in bnode_rsize()
225 extern inline hfs_u16 bnode_end(const struct hfs_bnode *bnode) in bnode_end() argument
226 { return bnode_offset(bnode, bnode->ndNRecs + 1); } in bnode_end()
229 extern inline hfs_u16 bnode_freespace(const struct hfs_bnode *bnode) in bnode_freespace() argument
230 { return HFS_SECTOR_SIZE - bnode_end(bnode) in bnode_freespace()
231 - (bnode->ndNRecs + 1)*sizeof(hfs_u16); } in bnode_freespace()
235 extern inline void *bnode_datastart(const struct hfs_bnode *bnode) in bnode_datastart() argument
[all …]
|
| D | binsert.c | 66 struct hfs_bnode *bnode = belem->bnr.bn; in binsert_nonfull() local
70 nrecs = bnode->ndNRecs + 1; in binsert_nonfull()
71 tomove = bnode_offset(bnode, nrecs) - bnode_offset(bnode, rec); in binsert_nonfull()
75 hfs_put_hs(bnode_offset(bnode,i) + size, RECTBL(bnode,i+1)); in binsert_nonfull()
79 start = bnode_key(bnode, rec); in binsert_nonfull()
89 ++bnode->ndNRecs; in binsert_nonfull()
276 struct hfs_bnode *bnode = elem->bnr.bn; in split() local
280 right = insert_empty_bnode(bnode->tree, bnode); in split()
282 nrecs = bnode->ndNRecs; in split()
283 cutoff = (size + bnode_end(bnode) - in split()
[all …]
|
| D | brec.c | 37 const struct hfs_bnode *bnode) in overflow() argument
41 (bnode_end(bnode) + (2+bnode->ndNRecs)*sizeof(hfs_u16) + in overflow()
52 const struct hfs_bnode *bnode) in underflow() argument
54 return ((bnode->ndNRecs * sizeof(hfs_u16) + in underflow()
55 bnode_offset(bnode, bnode->ndNRecs)) < in underflow()
|
| D | ChangeLog | 338 * bnode.c:
339 Check the record table in each bnode as we read it from disk.
434 btree.c, bnode.c, brec.c, bitmap.c, bitops.c, bins_del.c, binsert.c,
502 catalog.c, btree.c, bnode.c, brec.c, bitmap.c, binsert.c,
509 dir.c, brec.c, btree.c, bitmap.c, bnode.c, bdelete.c, bins_del.c,
848 balloc.c, bnode.c:
867 bfind.c, bnode.c, balloc.c:
903 catalog.c, dir_cap.c, brec.c, btree.c, binsert.c, bnode.c, bdelete.c,
935 * bnode.c:
1033 * btree.c, extent.c, bnode.c:
[all …]
|
| D | bins_del.c | 48 struct hfs_bnode *bnode, int offset) in hfs_bnode_update_key() argument
51 void *key = bnode_datastart(bnode) + 1; in hfs_bnode_update_key()
|
| D | Makefile | 13 bnode.o brec.o btree.o catalog.o dir.o dir_cap.o dir_dbl.o \
|
| /linux-2.4.37.9/drivers/sbus/char/ |
| D | pcikbd.c | 1306 int kbnode = 0, msnode = 0, bnode = 0; in ps2kbd_probe() local
1376 bnode = prom_searchsiblings(node, "beeper"); in ps2kbd_probe()
|