Lines Matching full:fd

15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd)
19 if (!tree || !fd)
22 fd->tree = tree;
23 fd->bnode = NULL;
27 fd->search_key = ptr;
28 fd->key = ptr + tree->max_key_len + 2;
47 void hfs_find_exit(struct hfs_find_data *fd)
49 hfs_bnode_put(fd->bnode);
50 kfree(fd->search_key);
52 fd->tree->cnid, __builtin_return_address(0));
53 mutex_unlock(&fd->tree->tree_lock);
54 fd->tree = NULL;
58 int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd)
77 hfs_bnode_read(bnode, fd->key, off, keylen);
78 cmpval = bnode->tree->keycmp(fd->key, fd->search_key);
96 hfs_bnode_read(bnode, fd->key, off, keylen);
99 fd->record = e;
100 fd->keyoffset = off;
101 fd->keylength = keylen;
102 fd->entryoffset = off + keylen;
103 fd->entrylength = len - keylen;
110 int hfs_brec_find(struct hfs_find_data *fd)
118 fd->record = -1;
119 fd->keyoffset = -1;
120 fd->keylength = -1;
121 fd->entryoffset = -1;
122 fd->entrylength = -1;
124 tree = fd->tree;
125 if (fd->bnode)
126 hfs_bnode_put(fd->bnode);
127 fd->bnode = NULL;
147 res = __hfs_brec_find(bnode, fd);
150 if (fd->record < 0)
154 hfs_bnode_read(bnode, &data, fd->entryoffset, 4);
158 fd->bnode = bnode;
170 int hfs_brec_read(struct hfs_find_data *fd, void *rec, u32 rec_len)
174 res = hfs_brec_find(fd);
177 if (fd->entrylength > rec_len)
179 hfs_bnode_read(fd->bnode, rec, fd->entryoffset, fd->entrylength);
183 int hfs_brec_goto(struct hfs_find_data *fd, int cnt)
190 bnode = fd->bnode;
195 while (cnt > fd->record) {
196 cnt -= fd->record + 1;
197 fd->record = bnode->num_recs - 1;
211 fd->record -= cnt;
213 while (cnt >= bnode->num_recs - fd->record) {
214 cnt -= bnode->num_recs - fd->record;
215 fd->record = 0;
229 fd->record += cnt;
232 len = hfs_brec_lenoff(bnode, fd->record, &off);
233 keylen = hfs_brec_keylen(bnode, fd->record);
238 fd->keyoffset = off;
239 fd->keylength = keylen;
240 fd->entryoffset = off + keylen;
241 fd->entrylength = len - keylen;
242 hfs_bnode_read(bnode, fd->key, off, keylen);
244 fd->bnode = bnode;