bfind.c (c2b3e1f76e5c90215bc7f740b376c0220eb8a8e3) bfind.c (d614267329f2bee7a082ed8781c581c0f3aaa808)
1/*
2 * linux/fs/hfsplus/bfind.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Search routines for btrees

--- 194 unchanged lines hidden (view full) ---

203 hfs_bnode_read(bnode, &data, fd->entryoffset, 4);
204 nidx = be32_to_cpu(data);
205 hfs_bnode_put(bnode);
206 }
207 fd->bnode = bnode;
208 return res;
209
210invalid:
1/*
2 * linux/fs/hfsplus/bfind.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Search routines for btrees

--- 194 unchanged lines hidden (view full) ---

203 hfs_bnode_read(bnode, &data, fd->entryoffset, 4);
204 nidx = be32_to_cpu(data);
205 hfs_bnode_put(bnode);
206 }
207 fd->bnode = bnode;
208 return res;
209
210invalid:
211 printk(KERN_ERR "hfs: inconsistency in B*Tree (%d,%d,%d,%u,%u)\n",
211 pr_err("inconsistency in B*Tree (%d,%d,%d,%u,%u)\n",
212 height, bnode->height, bnode->type, nidx, parent);
213 res = -EIO;
214release:
215 hfs_bnode_put(bnode);
216 return res;
217}
218
219int hfs_brec_read(struct hfs_find_data *fd, void *rec, int rec_len)

--- 76 unchanged lines hidden --- 		212 height, bnode->height, bnode->type, nidx, parent);
213 res = -EIO;
214release:
215 hfs_bnode_put(bnode);
216 return res;
217}
218
219int hfs_brec_read(struct hfs_find_data *fd, void *rec, int rec_len)

--- 76 unchanged lines hidden ---