map.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305
  1. /*
  2. * linux/fs/hpfs/map.c
  3. *
  4. * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
  5. *
  6. * mapping structures to memory with some minimal checks
  7. */
  8. #include "hpfs_fn.h"
  9. __le32 *hpfs_map_dnode_bitmap(struct super_block *s, struct quad_buffer_head *qbh)
  10. {
  11. return hpfs_map_4sectors(s, hpfs_sb(s)->sb_dmap, qbh, 0);
  12. }
  13. __le32 *hpfs_map_bitmap(struct super_block *s, unsigned bmp_block,
  14. struct quad_buffer_head *qbh, char *id)
  15. {
  16. secno sec;
  17. __le32 *ret;
  18. unsigned n_bands = (hpfs_sb(s)->sb_fs_size + 0x3fff) >> 14;
  19. if (hpfs_sb(s)->sb_chk) if (bmp_block >= n_bands) {
  20. hpfs_error(s, "hpfs_map_bitmap called with bad parameter: %08x at %s", bmp_block, id);
  21. return NULL;
  22. }
  23. sec = le32_to_cpu(hpfs_sb(s)->sb_bmp_dir[bmp_block]);
  24. if (!sec || sec > hpfs_sb(s)->sb_fs_size-4) {
  25. hpfs_error(s, "invalid bitmap block pointer %08x -> %08x at %s", bmp_block, sec, id);
  26. return NULL;
  27. }
  28. ret = hpfs_map_4sectors(s, sec, qbh, 4);
  29. if (ret) hpfs_prefetch_bitmap(s, bmp_block + 1);
  30. return ret;
  31. }
  32. void hpfs_prefetch_bitmap(struct super_block *s, unsigned bmp_block)
  33. {
  34. unsigned to_prefetch, next_prefetch;
  35. unsigned n_bands = (hpfs_sb(s)->sb_fs_size + 0x3fff) >> 14;
  36. if (unlikely(bmp_block >= n_bands))
  37. return;
  38. to_prefetch = le32_to_cpu(hpfs_sb(s)->sb_bmp_dir[bmp_block]);
  39. if (unlikely(bmp_block + 1 >= n_bands))
  40. next_prefetch = 0;
  41. else
  42. next_prefetch = le32_to_cpu(hpfs_sb(s)->sb_bmp_dir[bmp_block + 1]);
  43. hpfs_prefetch_sectors(s, to_prefetch, 4 + 4 * (to_prefetch + 4 == next_prefetch));
  44. }
  45. /*
  46. * Load first code page into kernel memory, return pointer to 256-byte array,
  47. * first 128 bytes are uppercasing table for chars 128-255, next 128 bytes are
  48. * lowercasing table
  49. */
  50. unsigned char *hpfs_load_code_page(struct super_block *s, secno cps)
  51. {
  52. struct buffer_head *bh;
  53. secno cpds;
  54. unsigned cpi;
  55. unsigned char *ptr;
  56. unsigned char *cp_table;
  57. int i;
  58. struct code_page_data *cpd;
  59. struct code_page_directory *cp = hpfs_map_sector(s, cps, &bh, 0);
  60. if (!cp) return NULL;
  61. if (le32_to_cpu(cp->magic) != CP_DIR_MAGIC) {
  62. printk("HPFS: Code page directory magic doesn't match (magic = %08x)\n", le32_to_cpu(cp->magic));
  63. brelse(bh);
  64. return NULL;
  65. }
  66. if (!le32_to_cpu(cp->n_code_pages)) {
  67. printk("HPFS: n_code_pages == 0\n");
  68. brelse(bh);
  69. return NULL;
  70. }
  71. cpds = le32_to_cpu(cp->array[0].code_page_data);
  72. cpi = le16_to_cpu(cp->array[0].index);
  73. brelse(bh);
  74. if (cpi >= 3) {
  75. printk("HPFS: Code page index out of array\n");
  76. return NULL;
  77. }
  78. if (!(cpd = hpfs_map_sector(s, cpds, &bh, 0))) return NULL;
  79. if (le16_to_cpu(cpd->offs[cpi]) > 0x178) {
  80. printk("HPFS: Code page index out of sector\n");
  81. brelse(bh);
  82. return NULL;
  83. }
  84. ptr = (unsigned char *)cpd + le16_to_cpu(cpd->offs[cpi]) + 6;
  85. if (!(cp_table = kmalloc(256, GFP_KERNEL))) {
  86. printk("HPFS: out of memory for code page table\n");
  87. brelse(bh);
  88. return NULL;
  89. }
  90. memcpy(cp_table, ptr, 128);
  91. brelse(bh);
  92. /* Try to build lowercasing table from uppercasing one */
  93. for (i=128; i<256; i++) cp_table[i]=i;
  94. for (i=128; i<256; i++) if (cp_table[i-128]!=i && cp_table[i-128]>=128)
  95. cp_table[cp_table[i-128]] = i;
  96. return cp_table;
  97. }
  98. __le32 *hpfs_load_bitmap_directory(struct super_block *s, secno bmp)
  99. {
  100. struct buffer_head *bh;
  101. int n = (hpfs_sb(s)->sb_fs_size + 0x200000 - 1) >> 21;
  102. int i;
  103. __le32 *b;
  104. if (!(b = kmalloc(n * 512, GFP_KERNEL))) {
  105. printk("HPFS: can't allocate memory for bitmap directory\n");
  106. return NULL;
  107. }
  108. for (i=0;i<n;i++) {
  109. __le32 *d = hpfs_map_sector(s, bmp+i, &bh, n - i - 1);
  110. if (!d) {
  111. kfree(b);
  112. return NULL;
  113. }
  114. memcpy((char *)b + 512 * i, d, 512);
  115. brelse(bh);
  116. }
  117. return b;
  118. }
  119. /*
  120. * Load fnode to memory
  121. */
  122. struct fnode *hpfs_map_fnode(struct super_block *s, ino_t ino, struct buffer_head **bhp)
  123. {
  124. struct fnode *fnode;
  125. if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, ino, 1, "fnode")) {
  126. return NULL;
  127. }
  128. if ((fnode = hpfs_map_sector(s, ino, bhp, FNODE_RD_AHEAD))) {
  129. if (hpfs_sb(s)->sb_chk) {
  130. struct extended_attribute *ea;
  131. struct extended_attribute *ea_end;
  132. if (le32_to_cpu(fnode->magic) != FNODE_MAGIC) {
  133. hpfs_error(s, "bad magic on fnode %08lx",
  134. (unsigned long)ino);
  135. goto bail;
  136. }
  137. if (!fnode_is_dir(fnode)) {
  138. if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes !=
  139. (bp_internal(&fnode->btree) ? 12 : 8)) {
  140. hpfs_error(s,
  141. "bad number of nodes in fnode %08lx",
  142. (unsigned long)ino);
  143. goto bail;
  144. }
  145. if (le16_to_cpu(fnode->btree.first_free) !=
  146. 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) {
  147. hpfs_error(s,
  148. "bad first_free pointer in fnode %08lx",
  149. (unsigned long)ino);
  150. goto bail;
  151. }
  152. }
  153. if (le16_to_cpu(fnode->ea_size_s) && (le16_to_cpu(fnode->ea_offs) < 0xc4 ||
  154. le16_to_cpu(fnode->ea_offs) + le16_to_cpu(fnode->acl_size_s) + le16_to_cpu(fnode->ea_size_s) > 0x200)) {
  155. hpfs_error(s,
  156. "bad EA info in fnode %08lx: ea_offs == %04x ea_size_s == %04x",
  157. (unsigned long)ino,
  158. le16_to_cpu(fnode->ea_offs), le16_to_cpu(fnode->ea_size_s));
  159. goto bail;
  160. }
  161. ea = fnode_ea(fnode);
  162. ea_end = fnode_end_ea(fnode);
  163. while (ea != ea_end) {
  164. if (ea > ea_end) {
  165. hpfs_error(s, "bad EA in fnode %08lx",
  166. (unsigned long)ino);
  167. goto bail;
  168. }
  169. ea = next_ea(ea);
  170. }
  171. }
  172. }
  173. return fnode;
  174. bail:
  175. brelse(*bhp);
  176. return NULL;
  177. }
  178. struct anode *hpfs_map_anode(struct super_block *s, anode_secno ano, struct buffer_head **bhp)
  179. {
  180. struct anode *anode;
  181. if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, ano, 1, "anode")) return NULL;
  182. if ((anode = hpfs_map_sector(s, ano, bhp, ANODE_RD_AHEAD)))
  183. if (hpfs_sb(s)->sb_chk) {
  184. if (le32_to_cpu(anode->magic) != ANODE_MAGIC) {
  185. hpfs_error(s, "bad magic on anode %08x", ano);
  186. goto bail;
  187. }
  188. if (le32_to_cpu(anode->self) != ano) {
  189. hpfs_error(s, "self pointer invalid on anode %08x", ano);
  190. goto bail;
  191. }
  192. if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes !=
  193. (bp_internal(&anode->btree) ? 60 : 40)) {
  194. hpfs_error(s, "bad number of nodes in anode %08x", ano);
  195. goto bail;
  196. }
  197. if (le16_to_cpu(anode->btree.first_free) !=
  198. 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) {
  199. hpfs_error(s, "bad first_free pointer in anode %08x", ano);
  200. goto bail;
  201. }
  202. }
  203. return anode;
  204. bail:
  205. brelse(*bhp);
  206. return NULL;
  207. }
  208. /*
  209. * Load dnode to memory and do some checks
  210. */
  211. struct dnode *hpfs_map_dnode(struct super_block *s, unsigned secno,
  212. struct quad_buffer_head *qbh)
  213. {
  214. struct dnode *dnode;
  215. if (hpfs_sb(s)->sb_chk) {
  216. if (hpfs_chk_sectors(s, secno, 4, "dnode")) return NULL;
  217. if (secno & 3) {
  218. hpfs_error(s, "dnode %08x not byte-aligned", secno);
  219. return NULL;
  220. }
  221. }
  222. if ((dnode = hpfs_map_4sectors(s, secno, qbh, DNODE_RD_AHEAD)))
  223. if (hpfs_sb(s)->sb_chk) {
  224. unsigned p, pp = 0;
  225. unsigned char *d = (unsigned char *)dnode;
  226. int b = 0;
  227. if (le32_to_cpu(dnode->magic) != DNODE_MAGIC) {
  228. hpfs_error(s, "bad magic on dnode %08x", secno);
  229. goto bail;
  230. }
  231. if (le32_to_cpu(dnode->self) != secno)
  232. hpfs_error(s, "bad self pointer on dnode %08x self = %08x", secno, le32_to_cpu(dnode->self));
  233. /* Check dirents - bad dirents would cause infinite
  234. loops or shooting to memory */
  235. if (le32_to_cpu(dnode->first_free) > 2048) {
  236. hpfs_error(s, "dnode %08x has first_free == %08x", secno, le32_to_cpu(dnode->first_free));
  237. goto bail;
  238. }
  239. for (p = 20; p < le32_to_cpu(dnode->first_free); p += d[p] + (d[p+1] << 8)) {
  240. struct hpfs_dirent *de = (struct hpfs_dirent *)((char *)dnode + p);
  241. if (le16_to_cpu(de->length) > 292 || (le16_to_cpu(de->length) < 32) || (le16_to_cpu(de->length) & 3) || p + le16_to_cpu(de->length) > 2048) {
  242. hpfs_error(s, "bad dirent size in dnode %08x, dirent %03x, last %03x", secno, p, pp);
  243. goto bail;
  244. }
  245. if (((31 + de->namelen + de->down*4 + 3) & ~3) != le16_to_cpu(de->length)) {
  246. if (((31 + de->namelen + de->down*4 + 3) & ~3) < le16_to_cpu(de->length) && s->s_flags & MS_RDONLY) goto ok;
  247. hpfs_error(s, "namelen does not match dirent size in dnode %08x, dirent %03x, last %03x", secno, p, pp);
  248. goto bail;
  249. }
  250. ok:
  251. if (hpfs_sb(s)->sb_chk >= 2) b |= 1 << de->down;
  252. if (de->down) if (de_down_pointer(de) < 0x10) {
  253. hpfs_error(s, "bad down pointer in dnode %08x, dirent %03x, last %03x", secno, p, pp);
  254. goto bail;
  255. }
  256. pp = p;
  257. }
  258. if (p != le32_to_cpu(dnode->first_free)) {
  259. hpfs_error(s, "size on last dirent does not match first_free; dnode %08x", secno);
  260. goto bail;
  261. }
  262. if (d[pp + 30] != 1 || d[pp + 31] != 255) {
  263. hpfs_error(s, "dnode %08x does not end with \\377 entry", secno);
  264. goto bail;
  265. }
  266. if (b == 3) printk("HPFS: warning: unbalanced dnode tree, dnode %08x; see hpfs.txt 4 more info\n", secno);
  267. }
  268. return dnode;
  269. bail:
  270. hpfs_brelse4(qbh);
  271. return NULL;
  272. }
  273. dnode_secno hpfs_fnode_dno(struct super_block *s, ino_t ino)
  274. {
  275. struct buffer_head *bh;
  276. struct fnode *fnode;
  277. dnode_secno dno;
  278. fnode = hpfs_map_fnode(s, ino, &bh);
  279. if (!fnode)
  280. return 0;
  281. dno = le32_to_cpu(fnode->u.external[0].disk_secno);
  282. brelse(bh);
  283. return dno;
  284. }