misc.c 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. /*
  2. * misc.c
  3. *
  4. * PURPOSE
  5. * Miscellaneous routines for the OSTA-UDF(tm) filesystem.
  6. *
  7. * COPYRIGHT
  8. * This file is distributed under the terms of the GNU General Public
  9. * License (GPL). Copies of the GPL can be obtained from:
  10. * ftp://prep.ai.mit.edu/pub/gnu/GPL
  11. * Each contributing author retains all rights to their own work.
  12. *
  13. * (C) 1998 Dave Boynton
  14. * (C) 1998-2004 Ben Fennema
  15. * (C) 1999-2000 Stelias Computing Inc
  16. *
  17. * HISTORY
  18. *
  19. * 04/19/99 blf partial support for reading/writing specific EA's
  20. */
  21. #include "udfdecl.h"
  22. #include <linux/fs.h>
  23. #include <linux/string.h>
  24. #include <linux/udf_fs.h>
  25. #include <linux/buffer_head.h>
  26. #include "udf_i.h"
  27. #include "udf_sb.h"
  28. struct buffer_head *udf_tgetblk(struct super_block *sb, int block)
  29. {
  30. if (UDF_QUERY_FLAG(sb, UDF_FLAG_VARCONV))
  31. return sb_getblk(sb, udf_fixed_to_variable(block));
  32. else
  33. return sb_getblk(sb, block);
  34. }
  35. struct buffer_head *udf_tread(struct super_block *sb, int block)
  36. {
  37. if (UDF_QUERY_FLAG(sb, UDF_FLAG_VARCONV))
  38. return sb_bread(sb, udf_fixed_to_variable(block));
  39. else
  40. return sb_bread(sb, block);
  41. }
  42. struct genericFormat *udf_add_extendedattr(struct inode *inode, uint32_t size,
  43. uint32_t type, uint8_t loc)
  44. {
  45. uint8_t *ea = NULL, *ad = NULL;
  46. int offset;
  47. uint16_t crclen;
  48. int i;
  49. ea = UDF_I_DATA(inode);
  50. if (UDF_I_LENEATTR(inode)) {
  51. ad = UDF_I_DATA(inode) + UDF_I_LENEATTR(inode);
  52. } else {
  53. ad = ea;
  54. size += sizeof(struct extendedAttrHeaderDesc);
  55. }
  56. offset = inode->i_sb->s_blocksize - udf_file_entry_alloc_offset(inode) -
  57. UDF_I_LENALLOC(inode);
  58. /* TODO - Check for FreeEASpace */
  59. if (loc & 0x01 && offset >= size) {
  60. struct extendedAttrHeaderDesc *eahd;
  61. eahd = (struct extendedAttrHeaderDesc *)ea;
  62. if (UDF_I_LENALLOC(inode)) {
  63. memmove(&ad[size], ad, UDF_I_LENALLOC(inode));
  64. }
  65. if (UDF_I_LENEATTR(inode)) {
  66. /* check checksum/crc */
  67. if (le16_to_cpu(eahd->descTag.tagIdent) != TAG_IDENT_EAHD ||
  68. le32_to_cpu(eahd->descTag.tagLocation) != UDF_I_LOCATION(inode).logicalBlockNum) {
  69. return NULL;
  70. }
  71. } else {
  72. struct udf_sb_info *sbi = UDF_SB(inode->i_sb);
  73. size -= sizeof(struct extendedAttrHeaderDesc);
  74. UDF_I_LENEATTR(inode) += sizeof(struct extendedAttrHeaderDesc);
  75. eahd->descTag.tagIdent = cpu_to_le16(TAG_IDENT_EAHD);
  76. if (sbi->s_udfrev >= 0x0200)
  77. eahd->descTag.descVersion = cpu_to_le16(3);
  78. else
  79. eahd->descTag.descVersion = cpu_to_le16(2);
  80. eahd->descTag.tagSerialNum = cpu_to_le16(sbi->s_serial_number);
  81. eahd->descTag.tagLocation = cpu_to_le32(UDF_I_LOCATION(inode).logicalBlockNum);
  82. eahd->impAttrLocation = cpu_to_le32(0xFFFFFFFF);
  83. eahd->appAttrLocation = cpu_to_le32(0xFFFFFFFF);
  84. }
  85. offset = UDF_I_LENEATTR(inode);
  86. if (type < 2048) {
  87. if (le32_to_cpu(eahd->appAttrLocation) < UDF_I_LENEATTR(inode)) {
  88. uint32_t aal = le32_to_cpu(eahd->appAttrLocation);
  89. memmove(&ea[offset - aal + size],
  90. &ea[aal], offset - aal);
  91. offset -= aal;
  92. eahd->appAttrLocation = cpu_to_le32(aal + size);
  93. }
  94. if (le32_to_cpu(eahd->impAttrLocation) < UDF_I_LENEATTR(inode)) {
  95. uint32_t ial = le32_to_cpu(eahd->impAttrLocation);
  96. memmove(&ea[offset - ial + size],
  97. &ea[ial], offset - ial);
  98. offset -= ial;
  99. eahd->impAttrLocation = cpu_to_le32(ial + size);
  100. }
  101. } else if (type < 65536) {
  102. if (le32_to_cpu(eahd->appAttrLocation) < UDF_I_LENEATTR(inode)) {
  103. uint32_t aal = le32_to_cpu(eahd->appAttrLocation);
  104. memmove(&ea[offset - aal + size],
  105. &ea[aal], offset - aal);
  106. offset -= aal;
  107. eahd->appAttrLocation = cpu_to_le32(aal + size);
  108. }
  109. }
  110. /* rewrite CRC + checksum of eahd */
  111. crclen = sizeof(struct extendedAttrHeaderDesc) - sizeof(tag);
  112. eahd->descTag.descCRCLength = cpu_to_le16(crclen);
  113. eahd->descTag.descCRC = cpu_to_le16(udf_crc((char *)eahd +
  114. sizeof(tag), crclen, 0));
  115. eahd->descTag.tagChecksum = 0;
  116. for (i = 0; i < 16; i++)
  117. if (i != 4)
  118. eahd->descTag.tagChecksum += ((uint8_t *)&(eahd->descTag))[i];
  119. UDF_I_LENEATTR(inode) += size;
  120. return (struct genericFormat *)&ea[offset];
  121. }
  122. if (loc & 0x02) {
  123. }
  124. return NULL;
  125. }
  126. struct genericFormat *udf_get_extendedattr(struct inode *inode, uint32_t type,
  127. uint8_t subtype)
  128. {
  129. struct genericFormat *gaf;
  130. uint8_t *ea = NULL;
  131. uint32_t offset;
  132. ea = UDF_I_DATA(inode);
  133. if (UDF_I_LENEATTR(inode)) {
  134. struct extendedAttrHeaderDesc *eahd;
  135. eahd = (struct extendedAttrHeaderDesc *)ea;
  136. /* check checksum/crc */
  137. if (le16_to_cpu(eahd->descTag.tagIdent) != TAG_IDENT_EAHD ||
  138. le32_to_cpu(eahd->descTag.tagLocation) != UDF_I_LOCATION(inode).logicalBlockNum) {
  139. return NULL;
  140. }
  141. if (type < 2048)
  142. offset = sizeof(struct extendedAttrHeaderDesc);
  143. else if (type < 65536)
  144. offset = le32_to_cpu(eahd->impAttrLocation);
  145. else
  146. offset = le32_to_cpu(eahd->appAttrLocation);
  147. while (offset < UDF_I_LENEATTR(inode)) {
  148. gaf = (struct genericFormat *)&ea[offset];
  149. if (le32_to_cpu(gaf->attrType) == type && gaf->attrSubtype == subtype)
  150. return gaf;
  151. else
  152. offset += le32_to_cpu(gaf->attrLength);
  153. }
  154. }
  155. return NULL;
  156. }
  157. /*
  158. * udf_read_tagged
  159. *
  160. * PURPOSE
  161. * Read the first block of a tagged descriptor.
  162. *
  163. * HISTORY
  164. * July 1, 1997 - Andrew E. Mileski
  165. * Written, tested, and released.
  166. */
  167. struct buffer_head *udf_read_tagged(struct super_block *sb, uint32_t block,
  168. uint32_t location, uint16_t * ident)
  169. {
  170. tag *tag_p;
  171. struct buffer_head *bh = NULL;
  172. register uint8_t checksum;
  173. register int i;
  174. struct udf_sb_info *sbi = UDF_SB(sb);
  175. /* Read the block */
  176. if (block == 0xFFFFFFFF)
  177. return NULL;
  178. bh = udf_tread(sb, block + sbi->s_session);
  179. if (!bh) {
  180. udf_debug("block=%d, location=%d: read failed\n",
  181. block + sbi->s_session, location);
  182. return NULL;
  183. }
  184. tag_p = (tag *)(bh->b_data);
  185. *ident = le16_to_cpu(tag_p->tagIdent);
  186. if (location != le32_to_cpu(tag_p->tagLocation)) {
  187. udf_debug("location mismatch block %u, tag %u != %u\n",
  188. block + sbi->s_session, le32_to_cpu(tag_p->tagLocation), location);
  189. goto error_out;
  190. }
  191. /* Verify the tag checksum */
  192. checksum = 0U;
  193. for (i = 0; i < 4; i++)
  194. checksum += (uint8_t)(bh->b_data[i]);
  195. for (i = 5; i < 16; i++)
  196. checksum += (uint8_t)(bh->b_data[i]);
  197. if (checksum != tag_p->tagChecksum) {
  198. printk(KERN_ERR "udf: tag checksum failed block %d\n", block);
  199. goto error_out;
  200. }
  201. /* Verify the tag version */
  202. if (le16_to_cpu(tag_p->descVersion) != 0x0002U &&
  203. le16_to_cpu(tag_p->descVersion) != 0x0003U) {
  204. udf_debug("tag version 0x%04x != 0x0002 || 0x0003 block %d\n",
  205. le16_to_cpu(tag_p->descVersion), block);
  206. goto error_out;
  207. }
  208. /* Verify the descriptor CRC */
  209. if (le16_to_cpu(tag_p->descCRCLength) + sizeof(tag) > sb->s_blocksize ||
  210. le16_to_cpu(tag_p->descCRC) == udf_crc(bh->b_data + sizeof(tag),
  211. le16_to_cpu(tag_p->descCRCLength), 0)) {
  212. return bh;
  213. }
  214. udf_debug("Crc failure block %d: crc = %d, crclen = %d\n",
  215. block + sbi->s_session, le16_to_cpu(tag_p->descCRC),
  216. le16_to_cpu(tag_p->descCRCLength));
  217. error_out:
  218. brelse(bh);
  219. return NULL;
  220. }
  221. struct buffer_head *udf_read_ptagged(struct super_block *sb, kernel_lb_addr loc,
  222. uint32_t offset, uint16_t * ident)
  223. {
  224. return udf_read_tagged(sb, udf_get_lb_pblock(sb, loc, offset),
  225. loc.logicalBlockNum + offset, ident);
  226. }
  227. void udf_update_tag(char *data, int length)
  228. {
  229. tag *tptr = (tag *)data;
  230. int i;
  231. length -= sizeof(tag);
  232. tptr->tagChecksum = 0;
  233. tptr->descCRCLength = cpu_to_le16(length);
  234. tptr->descCRC = cpu_to_le16(udf_crc(data + sizeof(tag), length, 0));
  235. for (i = 0; i < 16; i++)
  236. if (i != 4)
  237. tptr->tagChecksum += (uint8_t)(data[i]);
  238. }
  239. void udf_new_tag(char *data, uint16_t ident, uint16_t version, uint16_t snum,
  240. uint32_t loc, int length)
  241. {
  242. tag *tptr = (tag *)data;
  243. tptr->tagIdent = cpu_to_le16(ident);
  244. tptr->descVersion = cpu_to_le16(version);
  245. tptr->tagSerialNum = cpu_to_le16(snum);
  246. tptr->tagLocation = cpu_to_le32(loc);
  247. udf_update_tag(data, length);
  248. }