anode.c 14 KB

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