Lines Matching defs:off
17 int off, int len)
21 off += node->page_offset;
24 memcpy(buf, kmap(page) + off, len);
28 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
32 hfs_bnode_read(node, &data, off, 2);
36 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
40 hfs_bnode_read(node, &data, off, 1);
44 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off)
52 key_len = hfs_bnode_read_u8(node, off) + 1;
56 hfs_bnode_read(node, key, off, key_len);
59 void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len)
63 off += node->page_offset;
66 memcpy(kmap(page) + off, buf, len);
71 void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
75 hfs_bnode_write(node, &v, off, 2);
78 void hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data)
81 hfs_bnode_write(node, &data, off, 1);
84 void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
88 off += node->page_offset;
91 memset(kmap(page) + off, 0, len);
138 int i, off, key_off;
146 off = node->tree->node_size - 2;
147 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
148 key_off = hfs_bnode_read_u16(node, off);
242 loff_t off;
278 off = (loff_t)cnid * tree->node_size;
279 block = off >> PAGE_CACHE_SHIFT;
280 node->page_offset = off & ~PAGE_CACHE_MASK;
318 int i, rec_off, off, next_off;
367 off = hfs_bnode_read_u16(node, rec_off);
368 if (off != sizeof(struct hfs_bnode_desc))
370 for (i = 1; i <= node->num_recs; off = next_off, i++) {
373 if (next_off <= off ||
377 entry_size = next_off - off;
381 key_size = hfs_bnode_read_u8(node, off) + 1;