dir_f.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * linux/fs/adfs/dir_f.c
  4. *
  5. * Copyright (C) 1997-1999 Russell King
  6. *
  7. * E and F format directory handling
  8. */
  9. #include "adfs.h"
  10. #include "dir_f.h"
  11. /*
  12. * Read an (unaligned) value of length 1..4 bytes
  13. */
  14. static inline unsigned int adfs_readval(unsigned char *p, int len)
  15. {
  16. unsigned int val = 0;
  17. switch (len) {
  18. case 4: val |= p[3] << 24;
  19. fallthrough;
  20. case 3: val |= p[2] << 16;
  21. fallthrough;
  22. case 2: val |= p[1] << 8;
  23. fallthrough;
  24. default: val |= p[0];
  25. }
  26. return val;
  27. }
  28. static inline void adfs_writeval(unsigned char *p, int len, unsigned int val)
  29. {
  30. switch (len) {
  31. case 4: p[3] = val >> 24;
  32. fallthrough;
  33. case 3: p[2] = val >> 16;
  34. fallthrough;
  35. case 2: p[1] = val >> 8;
  36. fallthrough;
  37. default: p[0] = val;
  38. }
  39. }
  40. #define ror13(v) ((v >> 13) | (v << 19))
  41. #define dir_u8(idx) \
  42. ({ int _buf = idx >> blocksize_bits; \
  43. int _off = idx - (_buf << blocksize_bits);\
  44. *(u8 *)(bh[_buf]->b_data + _off); \
  45. })
  46. #define dir_u32(idx) \
  47. ({ int _buf = idx >> blocksize_bits; \
  48. int _off = idx - (_buf << blocksize_bits);\
  49. *(__le32 *)(bh[_buf]->b_data + _off); \
  50. })
  51. #define bufoff(_bh,_idx) \
  52. ({ int _buf = _idx >> blocksize_bits; \
  53. int _off = _idx - (_buf << blocksize_bits);\
  54. (void *)(_bh[_buf]->b_data + _off); \
  55. })
  56. /*
  57. * There are some algorithms that are nice in
  58. * assembler, but a bitch in C... This is one
  59. * of them.
  60. */
  61. static u8
  62. adfs_dir_checkbyte(const struct adfs_dir *dir)
  63. {
  64. struct buffer_head * const *bh = dir->bh;
  65. const int blocksize_bits = dir->sb->s_blocksize_bits;
  66. union { __le32 *ptr32; u8 *ptr8; } ptr, end;
  67. u32 dircheck = 0;
  68. int last = 5 - 26;
  69. int i = 0;
  70. /*
  71. * Accumulate each word up to the last whole
  72. * word of the last directory entry. This
  73. * can spread across several buffer heads.
  74. */
  75. do {
  76. last += 26;
  77. do {
  78. dircheck = le32_to_cpu(dir_u32(i)) ^ ror13(dircheck);
  79. i += sizeof(u32);
  80. } while (i < (last & ~3));
  81. } while (dir_u8(last) != 0);
  82. /*
  83. * Accumulate the last few bytes. These
  84. * bytes will be within the same bh.
  85. */
  86. if (i != last) {
  87. ptr.ptr8 = bufoff(bh, i);
  88. end.ptr8 = ptr.ptr8 + last - i;
  89. do {
  90. dircheck = *ptr.ptr8++ ^ ror13(dircheck);
  91. } while (ptr.ptr8 < end.ptr8);
  92. }
  93. /*
  94. * The directory tail is in the final bh
  95. * Note that contary to the RISC OS PRMs,
  96. * the first few bytes are NOT included
  97. * in the check. All bytes are in the
  98. * same bh.
  99. */
  100. ptr.ptr8 = bufoff(bh, 2008);
  101. end.ptr8 = ptr.ptr8 + 36;
  102. do {
  103. __le32 v = *ptr.ptr32++;
  104. dircheck = le32_to_cpu(v) ^ ror13(dircheck);
  105. } while (ptr.ptr32 < end.ptr32);
  106. return (dircheck ^ (dircheck >> 8) ^ (dircheck >> 16) ^ (dircheck >> 24)) & 0xff;
  107. }
  108. static int adfs_f_validate(struct adfs_dir *dir)
  109. {
  110. struct adfs_dirheader *head = dir->dirhead;
  111. struct adfs_newdirtail *tail = dir->newtail;
  112. if (head->startmasseq != tail->endmasseq ||
  113. tail->dirlastmask || tail->reserved[0] || tail->reserved[1] ||
  114. (memcmp(&head->startname, "Nick", 4) &&
  115. memcmp(&head->startname, "Hugo", 4)) ||
  116. memcmp(&head->startname, &tail->endname, 4) ||
  117. adfs_dir_checkbyte(dir) != tail->dircheckbyte)
  118. return -EIO;
  119. return 0;
  120. }
  121. /* Read and check that a directory is valid */
  122. static int adfs_f_read(struct super_block *sb, u32 indaddr, unsigned int size,
  123. struct adfs_dir *dir)
  124. {
  125. const unsigned int blocksize_bits = sb->s_blocksize_bits;
  126. int ret;
  127. if (size && size != ADFS_NEWDIR_SIZE)
  128. return -EIO;
  129. ret = adfs_dir_read_buffers(sb, indaddr, ADFS_NEWDIR_SIZE, dir);
  130. if (ret)
  131. return ret;
  132. dir->dirhead = bufoff(dir->bh, 0);
  133. dir->newtail = bufoff(dir->bh, 2007);
  134. if (adfs_f_validate(dir))
  135. goto bad_dir;
  136. dir->parent_id = adfs_readval(dir->newtail->dirparent, 3);
  137. return 0;
  138. bad_dir:
  139. adfs_error(sb, "dir %06x is corrupted", indaddr);
  140. adfs_dir_relse(dir);
  141. return -EIO;
  142. }
  143. /*
  144. * convert a disk-based directory entry to a Linux ADFS directory entry
  145. */
  146. static inline void
  147. adfs_dir2obj(struct adfs_dir *dir, struct object_info *obj,
  148. struct adfs_direntry *de)
  149. {
  150. unsigned int name_len;
  151. for (name_len = 0; name_len < ADFS_F_NAME_LEN; name_len++) {
  152. if (de->dirobname[name_len] < ' ')
  153. break;
  154. obj->name[name_len] = de->dirobname[name_len];
  155. }
  156. obj->name_len = name_len;
  157. obj->indaddr = adfs_readval(de->dirinddiscadd, 3);
  158. obj->loadaddr = adfs_readval(de->dirload, 4);
  159. obj->execaddr = adfs_readval(de->direxec, 4);
  160. obj->size = adfs_readval(de->dirlen, 4);
  161. obj->attr = de->newdiratts;
  162. adfs_object_fixup(dir, obj);
  163. }
  164. /*
  165. * convert a Linux ADFS directory entry to a disk-based directory entry
  166. */
  167. static inline void
  168. adfs_obj2dir(struct adfs_direntry *de, struct object_info *obj)
  169. {
  170. adfs_writeval(de->dirinddiscadd, 3, obj->indaddr);
  171. adfs_writeval(de->dirload, 4, obj->loadaddr);
  172. adfs_writeval(de->direxec, 4, obj->execaddr);
  173. adfs_writeval(de->dirlen, 4, obj->size);
  174. de->newdiratts = obj->attr;
  175. }
  176. /*
  177. * get a directory entry. Note that the caller is responsible
  178. * for holding the relevant locks.
  179. */
  180. static int
  181. __adfs_dir_get(struct adfs_dir *dir, int pos, struct object_info *obj)
  182. {
  183. struct adfs_direntry de;
  184. int ret;
  185. ret = adfs_dir_copyfrom(&de, dir, pos, 26);
  186. if (ret)
  187. return ret;
  188. if (!de.dirobname[0])
  189. return -ENOENT;
  190. adfs_dir2obj(dir, obj, &de);
  191. return 0;
  192. }
  193. static int
  194. adfs_f_setpos(struct adfs_dir *dir, unsigned int fpos)
  195. {
  196. if (fpos >= ADFS_NUM_DIR_ENTRIES)
  197. return -ENOENT;
  198. dir->pos = 5 + fpos * 26;
  199. return 0;
  200. }
  201. static int
  202. adfs_f_getnext(struct adfs_dir *dir, struct object_info *obj)
  203. {
  204. unsigned int ret;
  205. ret = __adfs_dir_get(dir, dir->pos, obj);
  206. if (ret == 0)
  207. dir->pos += 26;
  208. return ret;
  209. }
  210. static int adfs_f_iterate(struct adfs_dir *dir, struct dir_context *ctx)
  211. {
  212. struct object_info obj;
  213. int pos = 5 + (ctx->pos - 2) * 26;
  214. while (ctx->pos < 2 + ADFS_NUM_DIR_ENTRIES) {
  215. if (__adfs_dir_get(dir, pos, &obj))
  216. break;
  217. if (!dir_emit(ctx, obj.name, obj.name_len,
  218. obj.indaddr, DT_UNKNOWN))
  219. break;
  220. pos += 26;
  221. ctx->pos++;
  222. }
  223. return 0;
  224. }
  225. static int adfs_f_update(struct adfs_dir *dir, struct object_info *obj)
  226. {
  227. struct adfs_direntry de;
  228. int offset, ret;
  229. offset = 5 - (int)sizeof(de);
  230. do {
  231. offset += sizeof(de);
  232. ret = adfs_dir_copyfrom(&de, dir, offset, sizeof(de));
  233. if (ret) {
  234. adfs_error(dir->sb, "error reading directory entry");
  235. return -ENOENT;
  236. }
  237. if (!de.dirobname[0]) {
  238. adfs_error(dir->sb, "unable to locate entry to update");
  239. return -ENOENT;
  240. }
  241. } while (adfs_readval(de.dirinddiscadd, 3) != obj->indaddr);
  242. /* Update the directory entry with the new object state */
  243. adfs_obj2dir(&de, obj);
  244. /* Write the directory entry back to the directory */
  245. return adfs_dir_copyto(dir, offset, &de, 26);
  246. }
  247. static int adfs_f_commit(struct adfs_dir *dir)
  248. {
  249. int ret;
  250. /* Increment directory sequence number */
  251. dir->dirhead->startmasseq += 1;
  252. dir->newtail->endmasseq += 1;
  253. /* Update directory check byte */
  254. dir->newtail->dircheckbyte = adfs_dir_checkbyte(dir);
  255. /* Make sure the directory still validates correctly */
  256. ret = adfs_f_validate(dir);
  257. if (ret)
  258. adfs_msg(dir->sb, KERN_ERR, "error: update broke directory");
  259. return ret;
  260. }
  261. const struct adfs_dir_ops adfs_f_dir_ops = {
  262. .read = adfs_f_read,
  263. .iterate = adfs_f_iterate,
  264. .setpos = adfs_f_setpos,
  265. .getnext = adfs_f_getnext,
  266. .update = adfs_f_update,
  267. .commit = adfs_f_commit,
  268. };