Blame view
fs/hpfs/anode.c
15.3 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
/* * linux/fs/hpfs/anode.c * * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999 * * handling HPFS anode tree that contains file allocation info */ #include "hpfs_fn.h" /* Find a sector in allocation tree */ secno hpfs_bplus_lookup(struct super_block *s, struct inode *inode, struct bplus_header *btree, unsigned sec, struct buffer_head *bh) { anode_secno a = -1; struct anode *anode; int i; int c1, c2 = 0; go_down: if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_bplus_lookup")) return -1; if (btree->internal) { for (i = 0; i < btree->n_used_nodes; i++) |
0b69760be HPFS: Fix endiani... |
25 26 |
if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) { a = le32_to_cpu(btree->u.internal[i].down); |
1da177e4c Linux-2.6.12-rc2 |
27 28 29 30 31 32 33 34 35 36 |
brelse(bh); if (!(anode = hpfs_map_anode(s, a, &bh))) return -1; btree = &anode->btree; goto go_down; } hpfs_error(s, "sector %08x not found in internal anode %08x", sec, a); brelse(bh); return -1; } for (i = 0; i < btree->n_used_nodes; i++) |
0b69760be HPFS: Fix endiani... |
37 38 39 |
if (le32_to_cpu(btree->u.external[i].file_secno) <= sec && le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > sec) { a = le32_to_cpu(btree->u.external[i].disk_secno) + sec - le32_to_cpu(btree->u.external[i].file_secno); |
1da177e4c Linux-2.6.12-rc2 |
40 41 42 43 44 45 |
if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, a, 1, "data")) { brelse(bh); return -1; } if (inode) { struct hpfs_inode_info *hpfs_inode = hpfs_i(inode); |
0b69760be HPFS: Fix endiani... |
46 47 48 |
hpfs_inode->i_file_sec = le32_to_cpu(btree->u.external[i].file_secno); hpfs_inode->i_disk_sec = le32_to_cpu(btree->u.external[i].disk_secno); hpfs_inode->i_n_secs = le32_to_cpu(btree->u.external[i].length); |
1da177e4c Linux-2.6.12-rc2 |
49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 |
} brelse(bh); return a; } hpfs_error(s, "sector %08x not found in external anode %08x", sec, a); brelse(bh); return -1; } /* Add a sector to tree */ secno hpfs_add_sector_to_btree(struct super_block *s, secno node, int fnod, unsigned fsecno) { struct bplus_header *btree; struct anode *anode = NULL, *ranode = NULL; struct fnode *fnode; anode_secno a, na = -1, ra, up = -1; secno se; struct buffer_head *bh, *bh1, *bh2; int n; unsigned fs; int c1, c2 = 0; if (fnod) { if (!(fnode = hpfs_map_fnode(s, node, &bh))) return -1; btree = &fnode->btree; } else { if (!(anode = hpfs_map_anode(s, node, &bh))) return -1; btree = &anode->btree; } a = node; go_down: if ((n = btree->n_used_nodes - 1) < -!!fnod) { hpfs_error(s, "anode %08x has no entries", a); brelse(bh); return -1; } if (btree->internal) { |
0b69760be HPFS: Fix endiani... |
86 87 |
a = le32_to_cpu(btree->u.internal[n].down); btree->u.internal[n].file_secno = cpu_to_le32(-1); |
1da177e4c Linux-2.6.12-rc2 |
88 89 90 91 92 93 94 95 96 |
mark_buffer_dirty(bh); brelse(bh); if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_add_sector_to_btree #1")) return -1; if (!(anode = hpfs_map_anode(s, a, &bh))) return -1; btree = &anode->btree; goto go_down; } if (n >= 0) { |
0b69760be HPFS: Fix endiani... |
97 |
if (le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length) != fsecno) { |
1da177e4c Linux-2.6.12-rc2 |
98 |
hpfs_error(s, "allocated size %08x, trying to add sector %08x, %cnode %08x", |
0b69760be HPFS: Fix endiani... |
99 |
le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length), fsecno, |
1da177e4c Linux-2.6.12-rc2 |
100 101 102 103 |
fnod?'f':'a', node); brelse(bh); return -1; } |
0b69760be HPFS: Fix endiani... |
104 105 |
if (hpfs_alloc_if_possible(s, se = le32_to_cpu(btree->u.external[n].disk_secno) + le32_to_cpu(btree->u.external[n].length))) { btree->u.external[n].length = cpu_to_le32(le32_to_cpu(btree->u.external[n].length) + 1); |
1da177e4c Linux-2.6.12-rc2 |
106 107 108 109 110 111 112 113 114 115 116 117 |
mark_buffer_dirty(bh); brelse(bh); return se; } } else { if (fsecno) { hpfs_error(s, "empty file %08x, trying to add sector %08x", node, fsecno); brelse(bh); return -1; } se = !fnod ? node : (node + 16384) & ~16383; } |
7d23ce36e HPFS: Remove rema... |
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))) { |
1da177e4c Linux-2.6.12-rc2 |
119 120 121 |
brelse(bh); return -1; } |
0b69760be HPFS: Fix endiani... |
122 |
fs = n < 0 ? 0 : le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length); |
1da177e4c Linux-2.6.12-rc2 |
123 |
if (!btree->n_free_nodes) { |
0b69760be HPFS: Fix endiani... |
124 |
up = a != node ? le32_to_cpu(anode->up) : -1; |
1da177e4c Linux-2.6.12-rc2 |
125 126 127 128 129 130 |
if (!(anode = hpfs_alloc_anode(s, a, &na, &bh1))) { brelse(bh); hpfs_free_sectors(s, se, 1); return -1; } if (a == node && fnod) { |
0b69760be HPFS: Fix endiani... |
131 |
anode->up = cpu_to_le32(node); |
1da177e4c Linux-2.6.12-rc2 |
132 133 134 135 136 137 138 139 |
anode->btree.fnode_parent = 1; anode->btree.n_used_nodes = btree->n_used_nodes; anode->btree.first_free = btree->first_free; anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes; memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12); btree->internal = 1; btree->n_free_nodes = 11; btree->n_used_nodes = 1; |
0b69760be HPFS: Fix endiani... |
140 141 142 |
btree->first_free = cpu_to_le16((char *)&(btree->u.internal[1]) - (char *)btree); btree->u.internal[0].file_secno = cpu_to_le32(-1); btree->u.internal[0].down = cpu_to_le32(na); |
1da177e4c Linux-2.6.12-rc2 |
143 144 145 146 147 148 149 150 151 152 153 154 155 |
mark_buffer_dirty(bh); } else if (!(ranode = hpfs_alloc_anode(s, /*a*/0, &ra, &bh2))) { brelse(bh); brelse(bh1); hpfs_free_sectors(s, se, 1); hpfs_free_sectors(s, na, 1); return -1; } brelse(bh); bh = bh1; btree = &anode->btree; } btree->n_free_nodes--; n = btree->n_used_nodes++; |
0b69760be HPFS: Fix endiani... |
156 157 158 159 |
btree->first_free = cpu_to_le16(le16_to_cpu(btree->first_free) + 12); btree->u.external[n].disk_secno = cpu_to_le32(se); btree->u.external[n].file_secno = cpu_to_le32(fs); btree->u.external[n].length = cpu_to_le32(1); |
1da177e4c Linux-2.6.12-rc2 |
160 161 162 163 |
mark_buffer_dirty(bh); brelse(bh); if ((a == node && fnod) || na == -1) return se; c2 = 0; |
0b69760be HPFS: Fix endiani... |
164 |
while (up != (anode_secno)-1) { |
1da177e4c Linux-2.6.12-rc2 |
165 166 167 168 169 170 171 172 173 174 175 176 |
struct anode *new_anode; if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, up, &c1, &c2, "hpfs_add_sector_to_btree #2")) return -1; if (up != node || !fnod) { if (!(anode = hpfs_map_anode(s, up, &bh))) return -1; btree = &anode->btree; } else { if (!(fnode = hpfs_map_fnode(s, up, &bh))) return -1; btree = &fnode->btree; } if (btree->n_free_nodes) { btree->n_free_nodes--; n = btree->n_used_nodes++; |
0b69760be HPFS: Fix endiani... |
177 178 179 180 |
btree->first_free = cpu_to_le16(le16_to_cpu(btree->first_free) + 8); btree->u.internal[n].file_secno = cpu_to_le32(-1); btree->u.internal[n].down = cpu_to_le32(na); btree->u.internal[n-1].file_secno = cpu_to_le32(fs); |
1da177e4c Linux-2.6.12-rc2 |
181 182 183 184 185 |
mark_buffer_dirty(bh); brelse(bh); brelse(bh2); hpfs_free_sectors(s, ra, 1); if ((anode = hpfs_map_anode(s, na, &bh))) { |
0b69760be HPFS: Fix endiani... |
186 |
anode->up = cpu_to_le32(up); |
1da177e4c Linux-2.6.12-rc2 |
187 188 189 190 191 192 |
anode->btree.fnode_parent = up == node && fnod; mark_buffer_dirty(bh); brelse(bh); } return se; } |
0b69760be HPFS: Fix endiani... |
193 194 |
up = up != node ? le32_to_cpu(anode->up) : -1; btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/*fs*/-1); |
1da177e4c Linux-2.6.12-rc2 |
195 196 197 198 199 |
mark_buffer_dirty(bh); brelse(bh); a = na; if ((new_anode = hpfs_alloc_anode(s, a, &na, &bh))) { anode = new_anode; |
0b69760be HPFS: Fix endiani... |
200 |
/*anode->up = cpu_to_le32(up != -1 ? up : ra);*/ |
1da177e4c Linux-2.6.12-rc2 |
201 202 203 |
anode->btree.internal = 1; anode->btree.n_used_nodes = 1; anode->btree.n_free_nodes = 59; |
0b69760be HPFS: Fix endiani... |
204 205 206 |
anode->btree.first_free = cpu_to_le16(16); anode->btree.u.internal[0].down = cpu_to_le32(a); anode->btree.u.internal[0].file_secno = cpu_to_le32(-1); |
1da177e4c Linux-2.6.12-rc2 |
207 208 209 |
mark_buffer_dirty(bh); brelse(bh); if ((anode = hpfs_map_anode(s, a, &bh))) { |
0b69760be HPFS: Fix endiani... |
210 |
anode->up = cpu_to_le32(na); |
1da177e4c Linux-2.6.12-rc2 |
211 212 213 214 215 216 |
mark_buffer_dirty(bh); brelse(bh); } } else na = a; } if ((anode = hpfs_map_anode(s, na, &bh))) { |
0b69760be HPFS: Fix endiani... |
217 |
anode->up = cpu_to_le32(node); |
1da177e4c Linux-2.6.12-rc2 |
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 |
if (fnod) anode->btree.fnode_parent = 1; mark_buffer_dirty(bh); brelse(bh); } if (!fnod) { if (!(anode = hpfs_map_anode(s, node, &bh))) { brelse(bh2); return -1; } btree = &anode->btree; } else { if (!(fnode = hpfs_map_fnode(s, node, &bh))) { brelse(bh2); return -1; } btree = &fnode->btree; } |
0b69760be HPFS: Fix endiani... |
235 236 |
ranode->up = cpu_to_le32(node); memcpy(&ranode->btree, btree, le16_to_cpu(btree->first_free)); |
1da177e4c Linux-2.6.12-rc2 |
237 238 239 240 |
if (fnod) ranode->btree.fnode_parent = 1; ranode->btree.n_free_nodes = (ranode->btree.internal ? 60 : 40) - ranode->btree.n_used_nodes; if (ranode->btree.internal) for (n = 0; n < ranode->btree.n_used_nodes; n++) { struct anode *unode; |
0b69760be HPFS: Fix endiani... |
241 242 |
if ((unode = hpfs_map_anode(s, le32_to_cpu(ranode->u.internal[n].down), &bh1))) { unode->up = cpu_to_le32(ra); |
1da177e4c Linux-2.6.12-rc2 |
243 244 245 246 247 248 249 250 |
unode->btree.fnode_parent = 0; mark_buffer_dirty(bh1); brelse(bh1); } } btree->internal = 1; btree->n_free_nodes = fnod ? 10 : 58; btree->n_used_nodes = 2; |
0b69760be HPFS: Fix endiani... |
251 252 253 254 255 |
btree->first_free = cpu_to_le16((char *)&btree->u.internal[2] - (char *)btree); btree->u.internal[0].file_secno = cpu_to_le32(fs); btree->u.internal[0].down = cpu_to_le32(ra); btree->u.internal[1].file_secno = cpu_to_le32(-1); btree->u.internal[1].down = cpu_to_le32(na); |
1da177e4c Linux-2.6.12-rc2 |
256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 |
mark_buffer_dirty(bh); brelse(bh); mark_buffer_dirty(bh2); brelse(bh2); return se; } /* * Remove allocation tree. Recursion would look much nicer but * I want to avoid it because it can cause stack overflow. */ void hpfs_remove_btree(struct super_block *s, struct bplus_header *btree) { struct bplus_header *btree1 = btree; struct anode *anode = NULL; anode_secno ano = 0, oano; struct buffer_head *bh; int level = 0; int pos = 0; int i; int c1, c2 = 0; int d1, d2; go_down: d2 = 0; while (btree1->internal) { |
0b69760be HPFS: Fix endiani... |
282 |
ano = le32_to_cpu(btree1->u.internal[pos].down); |
1da177e4c Linux-2.6.12-rc2 |
283 284 285 286 287 288 289 290 291 292 |
if (level) brelse(bh); if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, ano, &d1, &d2, "hpfs_remove_btree #1")) return; if (!(anode = hpfs_map_anode(s, ano, &bh))) return; btree1 = &anode->btree; level++; pos = 0; } for (i = 0; i < btree1->n_used_nodes; i++) |
0b69760be HPFS: Fix endiani... |
293 |
hpfs_free_sectors(s, le32_to_cpu(btree1->u.external[i].disk_secno), le32_to_cpu(btree1->u.external[i].length)); |
1da177e4c Linux-2.6.12-rc2 |
294 295 296 297 298 299 300 |
go_up: if (!level) return; brelse(bh); if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, ano, &c1, &c2, "hpfs_remove_btree #2")) return; hpfs_free_sectors(s, ano, 1); oano = ano; |
0b69760be HPFS: Fix endiani... |
301 |
ano = le32_to_cpu(anode->up); |
1da177e4c Linux-2.6.12-rc2 |
302 303 304 305 306 |
if (--level) { if (!(anode = hpfs_map_anode(s, ano, &bh))) return; btree1 = &anode->btree; } else btree1 = btree; for (i = 0; i < btree1->n_used_nodes; i++) { |
0b69760be HPFS: Fix endiani... |
307 |
if (le32_to_cpu(btree1->u.internal[i].down) == oano) { |
1da177e4c Linux-2.6.12-rc2 |
308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 |
if ((pos = i + 1) < btree1->n_used_nodes) goto go_down; else goto go_up; } } hpfs_error(s, "reference to anode %08x not found in anode %08x " "(probably bad up pointer)", oano, level ? ano : -1); if (level) brelse(bh); } /* Just a wrapper around hpfs_bplus_lookup .. used for reading eas */ static secno anode_lookup(struct super_block *s, anode_secno a, unsigned sec) { struct anode *anode; struct buffer_head *bh; if (!(anode = hpfs_map_anode(s, a, &bh))) return -1; return hpfs_bplus_lookup(s, NULL, &anode->btree, sec, bh); } int hpfs_ea_read(struct super_block *s, secno a, int ano, unsigned pos, unsigned len, char *buf) { struct buffer_head *bh; char *data; secno sec; unsigned l; while (len) { if (ano) { if ((sec = anode_lookup(s, a, pos >> 9)) == -1) return -1; } else sec = a + (pos >> 9); if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #1")) return -1; if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9))) return -1; l = 0x200 - (pos & 0x1ff); if (l > len) l = len; memcpy(buf, data + (pos & 0x1ff), l); brelse(bh); buf += l; pos += l; len -= l; } return 0; } int hpfs_ea_write(struct super_block *s, secno a, int ano, unsigned pos, |
7e7742ee0 sanitize signedne... |
356 |
unsigned len, const char *buf) |
1da177e4c Linux-2.6.12-rc2 |
357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 |
{ struct buffer_head *bh; char *data; secno sec; unsigned l; while (len) { if (ano) { if ((sec = anode_lookup(s, a, pos >> 9)) == -1) return -1; } else sec = a + (pos >> 9); if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #2")) return -1; if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9))) return -1; l = 0x200 - (pos & 0x1ff); if (l > len) l = len; memcpy(data + (pos & 0x1ff), buf, l); mark_buffer_dirty(bh); brelse(bh); buf += l; pos += l; len -= l; } return 0; } void hpfs_ea_remove(struct super_block *s, secno a, int ano, unsigned len) { struct anode *anode; struct buffer_head *bh; if (ano) { if (!(anode = hpfs_map_anode(s, a, &bh))) return; hpfs_remove_btree(s, &anode->btree); brelse(bh); hpfs_free_sectors(s, a, 1); } else hpfs_free_sectors(s, a, (len + 511) >> 9); } /* Truncate allocation tree. Doesn't join anodes - I hope it doesn't matter */ void hpfs_truncate_btree(struct super_block *s, secno f, int fno, unsigned secs) { struct fnode *fnode; struct anode *anode; struct buffer_head *bh; struct bplus_header *btree; anode_secno node = f; int i, j, nodes; int c1, c2 = 0; if (fno) { if (!(fnode = hpfs_map_fnode(s, f, &bh))) return; btree = &fnode->btree; } else { if (!(anode = hpfs_map_anode(s, f, &bh))) return; btree = &anode->btree; } if (!secs) { hpfs_remove_btree(s, btree); if (fno) { btree->n_free_nodes = 8; btree->n_used_nodes = 0; |
0b69760be HPFS: Fix endiani... |
414 |
btree->first_free = cpu_to_le16(8); |
1da177e4c Linux-2.6.12-rc2 |
415 416 417 418 419 420 421 422 423 |
btree->internal = 0; mark_buffer_dirty(bh); } else hpfs_free_sectors(s, f, 1); brelse(bh); return; } while (btree->internal) { nodes = btree->n_used_nodes + btree->n_free_nodes; for (i = 0; i < btree->n_used_nodes; i++) |
0b69760be HPFS: Fix endiani... |
424 |
if (le32_to_cpu(btree->u.internal[i].file_secno) >= secs) goto f; |
1da177e4c Linux-2.6.12-rc2 |
425 426 427 428 429 |
brelse(bh); hpfs_error(s, "internal btree %08x doesn't end with -1", node); return; f: for (j = i + 1; j < btree->n_used_nodes; j++) |
0b69760be HPFS: Fix endiani... |
430 |
hpfs_ea_remove(s, le32_to_cpu(btree->u.internal[j].down), 1, 0); |
1da177e4c Linux-2.6.12-rc2 |
431 432 |
btree->n_used_nodes = i + 1; btree->n_free_nodes = nodes - btree->n_used_nodes; |
0b69760be HPFS: Fix endiani... |
433 |
btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes); |
1da177e4c Linux-2.6.12-rc2 |
434 |
mark_buffer_dirty(bh); |
0b69760be HPFS: Fix endiani... |
435 |
if (btree->u.internal[i].file_secno == cpu_to_le32(secs)) { |
1da177e4c Linux-2.6.12-rc2 |
436 437 438 |
brelse(bh); return; } |
0b69760be HPFS: Fix endiani... |
439 |
node = le32_to_cpu(btree->u.internal[i].down); |
1da177e4c Linux-2.6.12-rc2 |
440 441 442 443 444 445 446 447 448 |
brelse(bh); if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, node, &c1, &c2, "hpfs_truncate_btree")) return; if (!(anode = hpfs_map_anode(s, node, &bh))) return; btree = &anode->btree; } nodes = btree->n_used_nodes + btree->n_free_nodes; for (i = 0; i < btree->n_used_nodes; i++) |
0b69760be HPFS: Fix endiani... |
449 |
if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) >= secs) goto ff; |
1da177e4c Linux-2.6.12-rc2 |
450 451 452 |
brelse(bh); return; ff: |
0b69760be HPFS: Fix endiani... |
453 |
if (secs <= le32_to_cpu(btree->u.external[i].file_secno)) { |
1da177e4c Linux-2.6.12-rc2 |
454 455 456 |
hpfs_error(s, "there is an allocation error in file %08x, sector %08x", f, secs); if (i) i--; } |
0b69760be HPFS: Fix endiani... |
457 458 459 460 461 |
else if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > secs) { hpfs_free_sectors(s, le32_to_cpu(btree->u.external[i].disk_secno) + secs - le32_to_cpu(btree->u.external[i].file_secno), le32_to_cpu(btree->u.external[i].length) - secs + le32_to_cpu(btree->u.external[i].file_secno)); /* I hope gcc optimizes this :-) */ btree->u.external[i].length = cpu_to_le32(secs - le32_to_cpu(btree->u.external[i].file_secno)); |
1da177e4c Linux-2.6.12-rc2 |
462 463 |
} for (j = i + 1; j < btree->n_used_nodes; j++) |
0b69760be HPFS: Fix endiani... |
464 |
hpfs_free_sectors(s, le32_to_cpu(btree->u.external[j].disk_secno), le32_to_cpu(btree->u.external[j].length)); |
1da177e4c Linux-2.6.12-rc2 |
465 466 |
btree->n_used_nodes = i + 1; btree->n_free_nodes = nodes - btree->n_used_nodes; |
0b69760be HPFS: Fix endiani... |
467 |
btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes); |
1da177e4c Linux-2.6.12-rc2 |
468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 |
mark_buffer_dirty(bh); brelse(bh); } /* Remove file or directory and it's eas - note that directory must be empty when this is called. */ void hpfs_remove_fnode(struct super_block *s, fnode_secno fno) { struct buffer_head *bh; struct fnode *fnode; struct extended_attribute *ea; struct extended_attribute *ea_end; if (!(fnode = hpfs_map_fnode(s, fno, &bh))) return; if (!fnode->dirflag) hpfs_remove_btree(s, &fnode->btree); |
0b69760be HPFS: Fix endiani... |
483 |
else hpfs_remove_dtree(s, le32_to_cpu(fnode->u.external[0].disk_secno)); |
1da177e4c Linux-2.6.12-rc2 |
484 485 486 487 |
ea_end = fnode_end_ea(fnode); for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea)) if (ea->indirect) hpfs_ea_remove(s, ea_sec(ea), ea->anode, ea_len(ea)); |
0b69760be HPFS: Fix endiani... |
488 |
hpfs_ea_ext_remove(s, le32_to_cpu(fnode->ea_secno), fnode->ea_anode, le32_to_cpu(fnode->ea_size_l)); |
1da177e4c Linux-2.6.12-rc2 |
489 490 491 |
brelse(bh); hpfs_free_sectors(s, fno, 1); } |