dir_f.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469
  1. /*
  2. * linux/fs/adfs/dir_f.c
  3. *
  4. * Copyright (C) 1997-1999 Russell King
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License version 2 as
  8. * published by the Free Software Foundation.
  9. *
  10. * E and F format directory handling
  11. */
  12. #include <linux/buffer_head.h>
  13. #include "adfs.h"
  14. #include "dir_f.h"
  15. static void adfs_f_free(struct adfs_dir *dir);
  16. /*
  17. * Read an (unaligned) value of length 1..4 bytes
  18. */
  19. static inline unsigned int adfs_readval(unsigned char *p, int len)
  20. {
  21. unsigned int val = 0;
  22. switch (len) {
  23. case 4: val |= p[3] << 24;
  24. case 3: val |= p[2] << 16;
  25. case 2: val |= p[1] << 8;
  26. default: val |= p[0];
  27. }
  28. return val;
  29. }
  30. static inline void adfs_writeval(unsigned char *p, int len, unsigned int val)
  31. {
  32. switch (len) {
  33. case 4: p[3] = val >> 24;
  34. case 3: p[2] = val >> 16;
  35. case 2: p[1] = val >> 8;
  36. default: p[0] = val;
  37. }
  38. }
  39. static inline int adfs_readname(char *buf, char *ptr, int maxlen)
  40. {
  41. char *old_buf = buf;
  42. while ((unsigned char)*ptr >= ' ' && maxlen--) {
  43. if (*ptr == '/')
  44. *buf++ = '.';
  45. else
  46. *buf++ = *ptr;
  47. ptr++;
  48. }
  49. *buf = '\0';
  50. return buf - old_buf;
  51. }
  52. #define ror13(v) ((v >> 13) | (v << 19))
  53. #define dir_u8(idx) \
  54. ({ int _buf = idx >> blocksize_bits; \
  55. int _off = idx - (_buf << blocksize_bits);\
  56. *(u8 *)(bh[_buf]->b_data + _off); \
  57. })
  58. #define dir_u32(idx) \
  59. ({ int _buf = idx >> blocksize_bits; \
  60. int _off = idx - (_buf << blocksize_bits);\
  61. *(__le32 *)(bh[_buf]->b_data + _off); \
  62. })
  63. #define bufoff(_bh,_idx) \
  64. ({ int _buf = _idx >> blocksize_bits; \
  65. int _off = _idx - (_buf << blocksize_bits);\
  66. (u8 *)(_bh[_buf]->b_data + _off); \
  67. })
  68. /*
  69. * There are some algorithms that are nice in
  70. * assembler, but a bitch in C... This is one
  71. * of them.
  72. */
  73. static u8
  74. adfs_dir_checkbyte(const struct adfs_dir *dir)
  75. {
  76. struct buffer_head * const *bh = dir->bh;
  77. const int blocksize_bits = dir->sb->s_blocksize_bits;
  78. union { __le32 *ptr32; u8 *ptr8; } ptr, end;
  79. u32 dircheck = 0;
  80. int last = 5 - 26;
  81. int i = 0;
  82. /*
  83. * Accumulate each word up to the last whole
  84. * word of the last directory entry. This
  85. * can spread across several buffer heads.
  86. */
  87. do {
  88. last += 26;
  89. do {
  90. dircheck = le32_to_cpu(dir_u32(i)) ^ ror13(dircheck);
  91. i += sizeof(u32);
  92. } while (i < (last & ~3));
  93. } while (dir_u8(last) != 0);
  94. /*
  95. * Accumulate the last few bytes. These
  96. * bytes will be within the same bh.
  97. */
  98. if (i != last) {
  99. ptr.ptr8 = bufoff(bh, i);
  100. end.ptr8 = ptr.ptr8 + last - i;
  101. do {
  102. dircheck = *ptr.ptr8++ ^ ror13(dircheck);
  103. } while (ptr.ptr8 < end.ptr8);
  104. }
  105. /*
  106. * The directory tail is in the final bh
  107. * Note that contary to the RISC OS PRMs,
  108. * the first few bytes are NOT included
  109. * in the check. All bytes are in the
  110. * same bh.
  111. */
  112. ptr.ptr8 = bufoff(bh, 2008);
  113. end.ptr8 = ptr.ptr8 + 36;
  114. do {
  115. __le32 v = *ptr.ptr32++;
  116. dircheck = le32_to_cpu(v) ^ ror13(dircheck);
  117. } while (ptr.ptr32 < end.ptr32);
  118. return (dircheck ^ (dircheck >> 8) ^ (dircheck >> 16) ^ (dircheck >> 24)) & 0xff;
  119. }
  120. /*
  121. * Read and check that a directory is valid
  122. */
  123. static int
  124. adfs_dir_read(struct super_block *sb, unsigned long object_id,
  125. unsigned int size, struct adfs_dir *dir)
  126. {
  127. const unsigned int blocksize_bits = sb->s_blocksize_bits;
  128. int blk = 0;
  129. /*
  130. * Directories which are not a multiple of 2048 bytes
  131. * are considered bad v2 [3.6]
  132. */
  133. if (size & 2047)
  134. goto bad_dir;
  135. size >>= blocksize_bits;
  136. dir->nr_buffers = 0;
  137. dir->sb = sb;
  138. for (blk = 0; blk < size; blk++) {
  139. int phys;
  140. phys = __adfs_block_map(sb, object_id, blk);
  141. if (!phys) {
  142. adfs_error(sb, "dir object %lX has a hole at offset %d",
  143. object_id, blk);
  144. goto release_buffers;
  145. }
  146. dir->bh[blk] = sb_bread(sb, phys);
  147. if (!dir->bh[blk])
  148. goto release_buffers;
  149. }
  150. memcpy(&dir->dirhead, bufoff(dir->bh, 0), sizeof(dir->dirhead));
  151. memcpy(&dir->dirtail, bufoff(dir->bh, 2007), sizeof(dir->dirtail));
  152. if (dir->dirhead.startmasseq != dir->dirtail.new.endmasseq ||
  153. memcmp(&dir->dirhead.startname, &dir->dirtail.new.endname, 4))
  154. goto bad_dir;
  155. if (memcmp(&dir->dirhead.startname, "Nick", 4) &&
  156. memcmp(&dir->dirhead.startname, "Hugo", 4))
  157. goto bad_dir;
  158. if (adfs_dir_checkbyte(dir) != dir->dirtail.new.dircheckbyte)
  159. goto bad_dir;
  160. dir->nr_buffers = blk;
  161. return 0;
  162. bad_dir:
  163. adfs_error(sb, "corrupted directory fragment %lX",
  164. object_id);
  165. release_buffers:
  166. for (blk -= 1; blk >= 0; blk -= 1)
  167. brelse(dir->bh[blk]);
  168. dir->sb = NULL;
  169. return -EIO;
  170. }
  171. /*
  172. * convert a disk-based directory entry to a Linux ADFS directory entry
  173. */
  174. static inline void
  175. adfs_dir2obj(struct object_info *obj, struct adfs_direntry *de)
  176. {
  177. obj->name_len = adfs_readname(obj->name, de->dirobname, ADFS_F_NAME_LEN);
  178. obj->file_id = adfs_readval(de->dirinddiscadd, 3);
  179. obj->loadaddr = adfs_readval(de->dirload, 4);
  180. obj->execaddr = adfs_readval(de->direxec, 4);
  181. obj->size = adfs_readval(de->dirlen, 4);
  182. obj->attr = de->newdiratts;
  183. }
  184. /*
  185. * convert a Linux ADFS directory entry to a disk-based directory entry
  186. */
  187. static inline void
  188. adfs_obj2dir(struct adfs_direntry *de, struct object_info *obj)
  189. {
  190. adfs_writeval(de->dirinddiscadd, 3, obj->file_id);
  191. adfs_writeval(de->dirload, 4, obj->loadaddr);
  192. adfs_writeval(de->direxec, 4, obj->execaddr);
  193. adfs_writeval(de->dirlen, 4, obj->size);
  194. de->newdiratts = obj->attr;
  195. }
  196. /*
  197. * get a directory entry. Note that the caller is responsible
  198. * for holding the relevant locks.
  199. */
  200. static int
  201. __adfs_dir_get(struct adfs_dir *dir, int pos, struct object_info *obj)
  202. {
  203. struct super_block *sb = dir->sb;
  204. struct adfs_direntry de;
  205. int thissize, buffer, offset;
  206. buffer = pos >> sb->s_blocksize_bits;
  207. if (buffer > dir->nr_buffers)
  208. return -EINVAL;
  209. offset = pos & (sb->s_blocksize - 1);
  210. thissize = sb->s_blocksize - offset;
  211. if (thissize > 26)
  212. thissize = 26;
  213. memcpy(&de, dir->bh[buffer]->b_data + offset, thissize);
  214. if (thissize != 26)
  215. memcpy(((char *)&de) + thissize, dir->bh[buffer + 1]->b_data,
  216. 26 - thissize);
  217. if (!de.dirobname[0])
  218. return -ENOENT;
  219. adfs_dir2obj(obj, &de);
  220. return 0;
  221. }
  222. static int
  223. __adfs_dir_put(struct adfs_dir *dir, int pos, struct object_info *obj)
  224. {
  225. struct super_block *sb = dir->sb;
  226. struct adfs_direntry de;
  227. int thissize, buffer, offset;
  228. buffer = pos >> sb->s_blocksize_bits;
  229. if (buffer > dir->nr_buffers)
  230. return -EINVAL;
  231. offset = pos & (sb->s_blocksize - 1);
  232. thissize = sb->s_blocksize - offset;
  233. if (thissize > 26)
  234. thissize = 26;
  235. /*
  236. * Get the entry in total
  237. */
  238. memcpy(&de, dir->bh[buffer]->b_data + offset, thissize);
  239. if (thissize != 26)
  240. memcpy(((char *)&de) + thissize, dir->bh[buffer + 1]->b_data,
  241. 26 - thissize);
  242. /*
  243. * update it
  244. */
  245. adfs_obj2dir(&de, obj);
  246. /*
  247. * Put the new entry back
  248. */
  249. memcpy(dir->bh[buffer]->b_data + offset, &de, thissize);
  250. if (thissize != 26)
  251. memcpy(dir->bh[buffer + 1]->b_data, ((char *)&de) + thissize,
  252. 26 - thissize);
  253. return 0;
  254. }
  255. /*
  256. * the caller is responsible for holding the necessary
  257. * locks.
  258. */
  259. static int
  260. adfs_dir_find_entry(struct adfs_dir *dir, unsigned long object_id)
  261. {
  262. int pos, ret;
  263. ret = -ENOENT;
  264. for (pos = 5; pos < ADFS_NUM_DIR_ENTRIES * 26 + 5; pos += 26) {
  265. struct object_info obj;
  266. if (!__adfs_dir_get(dir, pos, &obj))
  267. break;
  268. if (obj.file_id == object_id) {
  269. ret = pos;
  270. break;
  271. }
  272. }
  273. return ret;
  274. }
  275. static int
  276. adfs_f_read(struct super_block *sb, unsigned int id, unsigned int sz, struct adfs_dir *dir)
  277. {
  278. int ret;
  279. if (sz != ADFS_NEWDIR_SIZE)
  280. return -EIO;
  281. ret = adfs_dir_read(sb, id, sz, dir);
  282. if (ret)
  283. adfs_error(sb, "unable to read directory");
  284. else
  285. dir->parent_id = adfs_readval(dir->dirtail.new.dirparent, 3);
  286. return ret;
  287. }
  288. static int
  289. adfs_f_setpos(struct adfs_dir *dir, unsigned int fpos)
  290. {
  291. if (fpos >= ADFS_NUM_DIR_ENTRIES)
  292. return -ENOENT;
  293. dir->pos = 5 + fpos * 26;
  294. return 0;
  295. }
  296. static int
  297. adfs_f_getnext(struct adfs_dir *dir, struct object_info *obj)
  298. {
  299. unsigned int ret;
  300. ret = __adfs_dir_get(dir, dir->pos, obj);
  301. if (ret == 0)
  302. dir->pos += 26;
  303. return ret;
  304. }
  305. static int
  306. adfs_f_update(struct adfs_dir *dir, struct object_info *obj)
  307. {
  308. struct super_block *sb = dir->sb;
  309. int ret, i;
  310. ret = adfs_dir_find_entry(dir, obj->file_id);
  311. if (ret < 0) {
  312. adfs_error(dir->sb, "unable to locate entry to update");
  313. goto out;
  314. }
  315. __adfs_dir_put(dir, ret, obj);
  316. /*
  317. * Increment directory sequence number
  318. */
  319. dir->bh[0]->b_data[0] += 1;
  320. dir->bh[dir->nr_buffers - 1]->b_data[sb->s_blocksize - 6] += 1;
  321. ret = adfs_dir_checkbyte(dir);
  322. /*
  323. * Update directory check byte
  324. */
  325. dir->bh[dir->nr_buffers - 1]->b_data[sb->s_blocksize - 1] = ret;
  326. #if 1
  327. {
  328. const unsigned int blocksize_bits = sb->s_blocksize_bits;
  329. memcpy(&dir->dirhead, bufoff(dir->bh, 0), sizeof(dir->dirhead));
  330. memcpy(&dir->dirtail, bufoff(dir->bh, 2007), sizeof(dir->dirtail));
  331. if (dir->dirhead.startmasseq != dir->dirtail.new.endmasseq ||
  332. memcmp(&dir->dirhead.startname, &dir->dirtail.new.endname, 4))
  333. goto bad_dir;
  334. if (memcmp(&dir->dirhead.startname, "Nick", 4) &&
  335. memcmp(&dir->dirhead.startname, "Hugo", 4))
  336. goto bad_dir;
  337. if (adfs_dir_checkbyte(dir) != dir->dirtail.new.dircheckbyte)
  338. goto bad_dir;
  339. }
  340. #endif
  341. for (i = dir->nr_buffers - 1; i >= 0; i--)
  342. mark_buffer_dirty(dir->bh[i]);
  343. ret = 0;
  344. out:
  345. return ret;
  346. #if 1
  347. bad_dir:
  348. adfs_error(dir->sb, "whoops! I broke a directory!");
  349. return -EIO;
  350. #endif
  351. }
  352. static int
  353. adfs_f_sync(struct adfs_dir *dir)
  354. {
  355. int err = 0;
  356. int i;
  357. for (i = dir->nr_buffers - 1; i >= 0; i--) {
  358. struct buffer_head *bh = dir->bh[i];
  359. sync_dirty_buffer(bh);
  360. if (buffer_req(bh) && !buffer_uptodate(bh))
  361. err = -EIO;
  362. }
  363. return err;
  364. }
  365. static void
  366. adfs_f_free(struct adfs_dir *dir)
  367. {
  368. int i;
  369. for (i = dir->nr_buffers - 1; i >= 0; i--) {
  370. brelse(dir->bh[i]);
  371. dir->bh[i] = NULL;
  372. }
  373. dir->nr_buffers = 0;
  374. dir->sb = NULL;
  375. }
  376. struct adfs_dir_ops adfs_f_dir_ops = {
  377. .read = adfs_f_read,
  378. .setpos = adfs_f_setpos,
  379. .getnext = adfs_f_getnext,
  380. .update = adfs_f_update,
  381. .sync = adfs_f_sync,
  382. .free = adfs_f_free
  383. };