2 * linux/fs/hpfs/anode.c
4 * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
6 * handling HPFS anode tree that contains file allocation info
11 /* Find a sector in allocation tree */
13 secno hpfs_bplus_lookup(struct super_block *s, struct inode *inode,
14 struct bplus_header *btree, unsigned sec,
15 struct buffer_head *bh)
22 if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_bplus_lookup")) return -1;
23 if (btree->internal) {
24 for (i = 0; i < btree->n_used_nodes; i++)
25 if (btree->u.internal[i].file_secno > sec) {
26 a = btree->u.internal[i].down;
28 if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
29 btree = &anode->btree;
32 hpfs_error(s, "sector %08x not found in internal anode %08x", sec, a);
36 for (i = 0; i < btree->n_used_nodes; i++)
37 if (btree->u.external[i].file_secno <= sec &&
38 btree->u.external[i].file_secno + btree->u.external[i].length > sec) {
39 a = btree->u.external[i].disk_secno + sec - btree->u.external[i].file_secno;
40 if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, a, 1, "data")) {
45 struct hpfs_inode_info *hpfs_inode = hpfs_i(inode);
46 hpfs_inode->i_file_sec = btree->u.external[i].file_secno;
47 hpfs_inode->i_disk_sec = btree->u.external[i].disk_secno;
48 hpfs_inode->i_n_secs = btree->u.external[i].length;
53 hpfs_error(s, "sector %08x not found in external anode %08x", sec, a);
58 /* Add a sector to tree */
60 secno hpfs_add_sector_to_btree(struct super_block *s, secno node, int fnod, unsigned fsecno)
62 struct bplus_header *btree;
63 struct anode *anode = NULL, *ranode = NULL;
65 anode_secno a, na = -1, ra, up = -1;
67 struct buffer_head *bh, *bh1, *bh2;
72 if (!(fnode = hpfs_map_fnode(s, node, &bh))) return -1;
73 btree = &fnode->btree;
75 if (!(anode = hpfs_map_anode(s, node, &bh))) return -1;
76 btree = &anode->btree;
80 if ((n = btree->n_used_nodes - 1) < -!!fnod) {
81 hpfs_error(s, "anode %08x has no entries", a);
85 if (btree->internal) {
86 a = btree->u.internal[n].down;
87 btree->u.internal[n].file_secno = -1;
88 mark_buffer_dirty(bh);
90 if (hpfs_sb(s)->sb_chk)
91 if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_add_sector_to_btree #1")) return -1;
92 if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
93 btree = &anode->btree;
97 if (btree->u.external[n].file_secno + btree->u.external[n].length != fsecno) {
98 hpfs_error(s, "allocated size %08x, trying to add sector %08x, %cnode %08x",
99 btree->u.external[n].file_secno + btree->u.external[n].length, fsecno,
104 if (hpfs_alloc_if_possible(s, se = btree->u.external[n].disk_secno + btree->u.external[n].length)) {
105 btree->u.external[n].length++;
106 mark_buffer_dirty(bh);
112 hpfs_error(s, "empty file %08x, trying to add sector %08x", node, fsecno);
118 if (!(se = hpfs_alloc_sector(s, se, 1, fsecno*ALLOC_M>ALLOC_FWD_MAX ? ALLOC_FWD_MAX : fsecno*ALLOC_M<ALLOC_FWD_MIN ? ALLOC_FWD_MIN : fsecno*ALLOC_M, 1))) {
122 fs = n < 0 ? 0 : btree->u.external[n].file_secno + btree->u.external[n].length;
123 if (!btree->n_free_nodes) {
124 up = a != node ? anode->up : -1;
125 if (!(anode = hpfs_alloc_anode(s, a, &na, &bh1))) {
127 hpfs_free_sectors(s, se, 1);
130 if (a == node && fnod) {
132 anode->btree.fnode_parent = 1;
133 anode->btree.n_used_nodes = btree->n_used_nodes;
134 anode->btree.first_free = btree->first_free;
135 anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
136 memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);
138 btree->n_free_nodes = 11;
139 btree->n_used_nodes = 1;
140 btree->first_free = (char *)&(btree->u.internal[1]) - (char *)btree;
141 btree->u.internal[0].file_secno = -1;
142 btree->u.internal[0].down = na;
143 mark_buffer_dirty(bh);
144 } else if (!(ranode = hpfs_alloc_anode(s, /*a*/0, &ra, &bh2))) {
147 hpfs_free_sectors(s, se, 1);
148 hpfs_free_sectors(s, na, 1);
153 btree = &anode->btree;
155 btree->n_free_nodes--; n = btree->n_used_nodes++;
156 btree->first_free += 12;
157 btree->u.external[n].disk_secno = se;
158 btree->u.external[n].file_secno = fs;
159 btree->u.external[n].length = 1;
160 mark_buffer_dirty(bh);
162 if ((a == node && fnod) || na == -1) return se;
165 struct anode *new_anode;
166 if (hpfs_sb(s)->sb_chk)
167 if (hpfs_stop_cycles(s, up, &c1, &c2, "hpfs_add_sector_to_btree #2")) return -1;
168 if (up != node || !fnod) {
169 if (!(anode = hpfs_map_anode(s, up, &bh))) return -1;
170 btree = &anode->btree;
172 if (!(fnode = hpfs_map_fnode(s, up, &bh))) return -1;
173 btree = &fnode->btree;
175 if (btree->n_free_nodes) {
176 btree->n_free_nodes--; n = btree->n_used_nodes++;
177 btree->first_free += 8;
178 btree->u.internal[n].file_secno = -1;
179 btree->u.internal[n].down = na;
180 btree->u.internal[n-1].file_secno = fs;
181 mark_buffer_dirty(bh);
184 hpfs_free_sectors(s, ra, 1);
185 if ((anode = hpfs_map_anode(s, na, &bh))) {
187 anode->btree.fnode_parent = up == node && fnod;
188 mark_buffer_dirty(bh);
193 up = up != node ? anode->up : -1;
194 btree->u.internal[btree->n_used_nodes - 1].file_secno = /*fs*/-1;
195 if (up == -1) anode->up = ra;
196 mark_buffer_dirty(bh);
199 if ((new_anode = hpfs_alloc_anode(s, a, &na, &bh))) {
201 /*anode->up = up != -1 ? up : ra;*/
202 anode->btree.internal = 1;
203 anode->btree.n_used_nodes = 1;
204 anode->btree.n_free_nodes = 59;
205 anode->btree.first_free = 16;
206 anode->btree.u.internal[0].down = a;
207 anode->btree.u.internal[0].file_secno = -1;
208 mark_buffer_dirty(bh);
210 if ((anode = hpfs_map_anode(s, a, &bh))) {
212 mark_buffer_dirty(bh);
217 if ((anode = hpfs_map_anode(s, na, &bh))) {
219 if (fnod) anode->btree.fnode_parent = 1;
220 mark_buffer_dirty(bh);
224 if (!(anode = hpfs_map_anode(s, node, &bh))) {
228 btree = &anode->btree;
230 if (!(fnode = hpfs_map_fnode(s, node, &bh))) {
234 btree = &fnode->btree;
237 memcpy(&ranode->btree, btree, btree->first_free);
238 if (fnod) ranode->btree.fnode_parent = 1;
239 ranode->btree.n_free_nodes = (ranode->btree.internal ? 60 : 40) - ranode->btree.n_used_nodes;
240 if (ranode->btree.internal) for (n = 0; n < ranode->btree.n_used_nodes; n++) {
242 if ((unode = hpfs_map_anode(s, ranode->u.internal[n].down, &bh1))) {
244 unode->btree.fnode_parent = 0;
245 mark_buffer_dirty(bh1);
250 btree->n_free_nodes = fnod ? 10 : 58;
251 btree->n_used_nodes = 2;
252 btree->first_free = (char *)&btree->u.internal[2] - (char *)btree;
253 btree->u.internal[0].file_secno = fs;
254 btree->u.internal[0].down = ra;
255 btree->u.internal[1].file_secno = -1;
256 btree->u.internal[1].down = na;
257 mark_buffer_dirty(bh);
259 mark_buffer_dirty(bh2);
265 * Remove allocation tree. Recursion would look much nicer but
266 * I want to avoid it because it can cause stack overflow.
269 void hpfs_remove_btree(struct super_block *s, struct bplus_header *btree)
271 struct bplus_header *btree1 = btree;
272 struct anode *anode = NULL;
273 anode_secno ano = 0, oano;
274 struct buffer_head *bh;
282 while (btree1->internal) {
283 ano = btree1->u.internal[pos].down;
284 if (level) brelse(bh);
285 if (hpfs_sb(s)->sb_chk)
286 if (hpfs_stop_cycles(s, ano, &d1, &d2, "hpfs_remove_btree #1"))
288 if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
289 btree1 = &anode->btree;
293 for (i = 0; i < btree1->n_used_nodes; i++)
294 hpfs_free_sectors(s, btree1->u.external[i].disk_secno, btree1->u.external[i].length);
298 if (hpfs_sb(s)->sb_chk)
299 if (hpfs_stop_cycles(s, ano, &c1, &c2, "hpfs_remove_btree #2")) return;
300 hpfs_free_sectors(s, ano, 1);
304 if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
305 btree1 = &anode->btree;
306 } else btree1 = btree;
307 for (i = 0; i < btree1->n_used_nodes; i++) {
308 if (btree1->u.internal[i].down == oano) {
309 if ((pos = i + 1) < btree1->n_used_nodes)
316 "reference to anode %08x not found in anode %08x "
317 "(probably bad up pointer)",
318 oano, level ? ano : -1);
323 /* Just a wrapper around hpfs_bplus_lookup .. used for reading eas */
325 static secno anode_lookup(struct super_block *s, anode_secno a, unsigned sec)
328 struct buffer_head *bh;
329 if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
330 return hpfs_bplus_lookup(s, NULL, &anode->btree, sec, bh);
333 int hpfs_ea_read(struct super_block *s, secno a, int ano, unsigned pos,
334 unsigned len, char *buf)
336 struct buffer_head *bh;
342 if ((sec = anode_lookup(s, a, pos >> 9)) == -1)
344 } else sec = a + (pos >> 9);
345 if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #1")) return -1;
346 if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9)))
348 l = 0x200 - (pos & 0x1ff); if (l > len) l = len;
349 memcpy(buf, data + (pos & 0x1ff), l);
351 buf += l; pos += l; len -= l;
356 int hpfs_ea_write(struct super_block *s, secno a, int ano, unsigned pos,
357 unsigned len, char *buf)
359 struct buffer_head *bh;
365 if ((sec = anode_lookup(s, a, pos >> 9)) == -1)
367 } else sec = a + (pos >> 9);
368 if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #2")) return -1;
369 if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9)))
371 l = 0x200 - (pos & 0x1ff); if (l > len) l = len;
372 memcpy(data + (pos & 0x1ff), buf, l);
373 mark_buffer_dirty(bh);
375 buf += l; pos += l; len -= l;
380 void hpfs_ea_remove(struct super_block *s, secno a, int ano, unsigned len)
383 struct buffer_head *bh;
385 if (!(anode = hpfs_map_anode(s, a, &bh))) return;
386 hpfs_remove_btree(s, &anode->btree);
388 hpfs_free_sectors(s, a, 1);
389 } else hpfs_free_sectors(s, a, (len + 511) >> 9);
392 /* Truncate allocation tree. Doesn't join anodes - I hope it doesn't matter */
394 void hpfs_truncate_btree(struct super_block *s, secno f, int fno, unsigned secs)
398 struct buffer_head *bh;
399 struct bplus_header *btree;
400 anode_secno node = f;
404 if (!(fnode = hpfs_map_fnode(s, f, &bh))) return;
405 btree = &fnode->btree;
407 if (!(anode = hpfs_map_anode(s, f, &bh))) return;
408 btree = &anode->btree;
411 hpfs_remove_btree(s, btree);
413 btree->n_free_nodes = 8;
414 btree->n_used_nodes = 0;
415 btree->first_free = 8;
417 mark_buffer_dirty(bh);
418 } else hpfs_free_sectors(s, f, 1);
422 while (btree->internal) {
423 nodes = btree->n_used_nodes + btree->n_free_nodes;
424 for (i = 0; i < btree->n_used_nodes; i++)
425 if (btree->u.internal[i].file_secno >= secs) goto f;
427 hpfs_error(s, "internal btree %08x doesn't end with -1", node);
430 for (j = i + 1; j < btree->n_used_nodes; j++)
431 hpfs_ea_remove(s, btree->u.internal[j].down, 1, 0);
432 btree->n_used_nodes = i + 1;
433 btree->n_free_nodes = nodes - btree->n_used_nodes;
434 btree->first_free = 8 + 8 * btree->n_used_nodes;
435 mark_buffer_dirty(bh);
436 if (btree->u.internal[i].file_secno == secs) {
440 node = btree->u.internal[i].down;
442 if (hpfs_sb(s)->sb_chk)
443 if (hpfs_stop_cycles(s, node, &c1, &c2, "hpfs_truncate_btree"))
445 if (!(anode = hpfs_map_anode(s, node, &bh))) return;
446 btree = &anode->btree;
448 nodes = btree->n_used_nodes + btree->n_free_nodes;
449 for (i = 0; i < btree->n_used_nodes; i++)
450 if (btree->u.external[i].file_secno + btree->u.external[i].length >= secs) goto ff;
454 if (secs <= btree->u.external[i].file_secno) {
455 hpfs_error(s, "there is an allocation error in file %08x, sector %08x", f, secs);
458 else if (btree->u.external[i].file_secno + btree->u.external[i].length > secs) {
459 hpfs_free_sectors(s, btree->u.external[i].disk_secno + secs -
460 btree->u.external[i].file_secno, btree->u.external[i].length
461 - secs + btree->u.external[i].file_secno); /* I hope gcc optimizes this :-) */
462 btree->u.external[i].length = secs - btree->u.external[i].file_secno;
464 for (j = i + 1; j < btree->n_used_nodes; j++)
465 hpfs_free_sectors(s, btree->u.external[j].disk_secno, btree->u.external[j].length);
466 btree->n_used_nodes = i + 1;
467 btree->n_free_nodes = nodes - btree->n_used_nodes;
468 btree->first_free = 8 + 12 * btree->n_used_nodes;
469 mark_buffer_dirty(bh);
473 /* Remove file or directory and it's eas - note that directory must
474 be empty when this is called. */
476 void hpfs_remove_fnode(struct super_block *s, fnode_secno fno)
478 struct buffer_head *bh;
480 struct extended_attribute *ea;
481 struct extended_attribute *ea_end;
482 if (!(fnode = hpfs_map_fnode(s, fno, &bh))) return;
483 if (!fnode->dirflag) hpfs_remove_btree(s, &fnode->btree);
484 else hpfs_remove_dtree(s, fnode->u.external[0].disk_secno);
485 ea_end = fnode_end_ea(fnode);
486 for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea))
488 hpfs_ea_remove(s, ea_sec(ea), ea->anode, ea_len(ea));
489 hpfs_ea_ext_remove(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l);
491 hpfs_free_sectors(s, fno, 1);