ea.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. /*
  2. * linux/fs/hpfs/ea.c
  3. *
  4. * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
  5. *
  6. * handling extended attributes
  7. */
  8. #include "hpfs_fn.h"
  9. /* Remove external extended attributes. ano specifies whether a is a
  10. direct sector where eas starts or an anode */
  11. void hpfs_ea_ext_remove(struct super_block *s, secno a, int ano, unsigned len)
  12. {
  13. unsigned pos = 0;
  14. while (pos < len) {
  15. char ex[4 + 255 + 1 + 8];
  16. struct extended_attribute *ea = (struct extended_attribute *)ex;
  17. if (pos + 4 > len) {
  18. hpfs_error(s, "EAs don't end correctly, %s %08x, len %08x",
  19. ano ? "anode" : "sectors", a, len);
  20. return;
  21. }
  22. if (hpfs_ea_read(s, a, ano, pos, 4, ex)) return;
  23. if (ea->indirect) {
  24. if (ea->valuelen != 8) {
  25. hpfs_error(s, "ea->indirect set while ea->valuelen!=8, %s %08x, pos %08x",
  26. ano ? "anode" : "sectors", a, pos);
  27. return;
  28. }
  29. if (hpfs_ea_read(s, a, ano, pos + 4, ea->namelen + 9, ex+4))
  30. return;
  31. hpfs_ea_remove(s, ea_sec(ea), ea->anode, ea_len(ea));
  32. }
  33. pos += ea->namelen + ea->valuelen + 5;
  34. }
  35. if (!ano) hpfs_free_sectors(s, a, (len+511) >> 9);
  36. else {
  37. struct buffer_head *bh;
  38. struct anode *anode;
  39. if ((anode = hpfs_map_anode(s, a, &bh))) {
  40. hpfs_remove_btree(s, &anode->btree);
  41. brelse(bh);
  42. hpfs_free_sectors(s, a, 1);
  43. }
  44. }
  45. }
  46. static char *get_indirect_ea(struct super_block *s, int ano, secno a, int size)
  47. {
  48. char *ret;
  49. if (!(ret = kmalloc(size + 1, GFP_NOFS))) {
  50. printk("HPFS: out of memory for EA\n");
  51. return NULL;
  52. }
  53. if (hpfs_ea_read(s, a, ano, 0, size, ret)) {
  54. kfree(ret);
  55. return NULL;
  56. }
  57. ret[size] = 0;
  58. return ret;
  59. }
  60. static void set_indirect_ea(struct super_block *s, int ano, secno a, char *data,
  61. int size)
  62. {
  63. hpfs_ea_write(s, a, ano, 0, size, data);
  64. }
  65. /* Read an extended attribute named 'key' into the provided buffer */
  66. int hpfs_read_ea(struct super_block *s, struct fnode *fnode, char *key,
  67. char *buf, int size)
  68. {
  69. unsigned pos;
  70. int ano, len;
  71. secno a;
  72. struct extended_attribute *ea;
  73. struct extended_attribute *ea_end = fnode_end_ea(fnode);
  74. for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea))
  75. if (!strcmp(ea->name, key)) {
  76. if (ea->indirect)
  77. goto indirect;
  78. if (ea->valuelen >= size)
  79. return -EINVAL;
  80. memcpy(buf, ea_data(ea), ea->valuelen);
  81. buf[ea->valuelen] = 0;
  82. return 0;
  83. }
  84. a = fnode->ea_secno;
  85. len = fnode->ea_size_l;
  86. ano = fnode->ea_anode;
  87. pos = 0;
  88. while (pos < len) {
  89. char ex[4 + 255 + 1 + 8];
  90. ea = (struct extended_attribute *)ex;
  91. if (pos + 4 > len) {
  92. hpfs_error(s, "EAs don't end correctly, %s %08x, len %08x",
  93. ano ? "anode" : "sectors", a, len);
  94. return -EIO;
  95. }
  96. if (hpfs_ea_read(s, a, ano, pos, 4, ex)) return -EIO;
  97. if (hpfs_ea_read(s, a, ano, pos + 4, ea->namelen + 1 + (ea->indirect ? 8 : 0), ex + 4))
  98. return -EIO;
  99. if (!strcmp(ea->name, key)) {
  100. if (ea->indirect)
  101. goto indirect;
  102. if (ea->valuelen >= size)
  103. return -EINVAL;
  104. if (hpfs_ea_read(s, a, ano, pos + 4 + ea->namelen + 1, ea->valuelen, buf))
  105. return -EIO;
  106. buf[ea->valuelen] = 0;
  107. return 0;
  108. }
  109. pos += ea->namelen + ea->valuelen + 5;
  110. }
  111. return -ENOENT;
  112. indirect:
  113. if (ea_len(ea) >= size)
  114. return -EINVAL;
  115. if (hpfs_ea_read(s, ea_sec(ea), ea->anode, 0, ea_len(ea), buf))
  116. return -EIO;
  117. buf[ea_len(ea)] = 0;
  118. return 0;
  119. }
  120. /* Read an extended attribute named 'key' */
  121. char *hpfs_get_ea(struct super_block *s, struct fnode *fnode, char *key, int *size)
  122. {
  123. char *ret;
  124. unsigned pos;
  125. int ano, len;
  126. secno a;
  127. struct extended_attribute *ea;
  128. struct extended_attribute *ea_end = fnode_end_ea(fnode);
  129. for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea))
  130. if (!strcmp(ea->name, key)) {
  131. if (ea->indirect)
  132. return get_indirect_ea(s, ea->anode, ea_sec(ea), *size = ea_len(ea));
  133. if (!(ret = kmalloc((*size = ea->valuelen) + 1, GFP_NOFS))) {
  134. printk("HPFS: out of memory for EA\n");
  135. return NULL;
  136. }
  137. memcpy(ret, ea_data(ea), ea->valuelen);
  138. ret[ea->valuelen] = 0;
  139. return ret;
  140. }
  141. a = fnode->ea_secno;
  142. len = fnode->ea_size_l;
  143. ano = fnode->ea_anode;
  144. pos = 0;
  145. while (pos < len) {
  146. char ex[4 + 255 + 1 + 8];
  147. ea = (struct extended_attribute *)ex;
  148. if (pos + 4 > len) {
  149. hpfs_error(s, "EAs don't end correctly, %s %08x, len %08x",
  150. ano ? "anode" : "sectors", a, len);
  151. return NULL;
  152. }
  153. if (hpfs_ea_read(s, a, ano, pos, 4, ex)) return NULL;
  154. if (hpfs_ea_read(s, a, ano, pos + 4, ea->namelen + 1 + (ea->indirect ? 8 : 0), ex + 4))
  155. return NULL;
  156. if (!strcmp(ea->name, key)) {
  157. if (ea->indirect)
  158. return get_indirect_ea(s, ea->anode, ea_sec(ea), *size = ea_len(ea));
  159. if (!(ret = kmalloc((*size = ea->valuelen) + 1, GFP_NOFS))) {
  160. printk("HPFS: out of memory for EA\n");
  161. return NULL;
  162. }
  163. if (hpfs_ea_read(s, a, ano, pos + 4 + ea->namelen + 1, ea->valuelen, ret)) {
  164. kfree(ret);
  165. return NULL;
  166. }
  167. ret[ea->valuelen] = 0;
  168. return ret;
  169. }
  170. pos += ea->namelen + ea->valuelen + 5;
  171. }
  172. return NULL;
  173. }
  174. /*
  175. * Update or create extended attribute 'key' with value 'data'. Note that
  176. * when this ea exists, it MUST have the same size as size of data.
  177. * This driver can't change sizes of eas ('cause I just don't need it).
  178. */
  179. void hpfs_set_ea(struct inode *inode, struct fnode *fnode, char *key, char *data, int size)
  180. {
  181. fnode_secno fno = inode->i_ino;
  182. struct super_block *s = inode->i_sb;
  183. unsigned pos;
  184. int ano, len;
  185. secno a;
  186. unsigned char h[4];
  187. struct extended_attribute *ea;
  188. struct extended_attribute *ea_end = fnode_end_ea(fnode);
  189. for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea))
  190. if (!strcmp(ea->name, key)) {
  191. if (ea->indirect) {
  192. if (ea_len(ea) == size)
  193. set_indirect_ea(s, ea->anode, ea_sec(ea), data, size);
  194. } else if (ea->valuelen == size) {
  195. memcpy(ea_data(ea), data, size);
  196. }
  197. return;
  198. }
  199. a = fnode->ea_secno;
  200. len = fnode->ea_size_l;
  201. ano = fnode->ea_anode;
  202. pos = 0;
  203. while (pos < len) {
  204. char ex[4 + 255 + 1 + 8];
  205. ea = (struct extended_attribute *)ex;
  206. if (pos + 4 > len) {
  207. hpfs_error(s, "EAs don't end correctly, %s %08x, len %08x",
  208. ano ? "anode" : "sectors", a, len);
  209. return;
  210. }
  211. if (hpfs_ea_read(s, a, ano, pos, 4, ex)) return;
  212. if (hpfs_ea_read(s, a, ano, pos + 4, ea->namelen + 1 + (ea->indirect ? 8 : 0), ex + 4))
  213. return;
  214. if (!strcmp(ea->name, key)) {
  215. if (ea->indirect) {
  216. if (ea_len(ea) == size)
  217. set_indirect_ea(s, ea->anode, ea_sec(ea), data, size);
  218. }
  219. else {
  220. if (ea->valuelen == size)
  221. hpfs_ea_write(s, a, ano, pos + 4 + ea->namelen + 1, size, data);
  222. }
  223. return;
  224. }
  225. pos += ea->namelen + ea->valuelen + 5;
  226. }
  227. if (!fnode->ea_offs) {
  228. /*if (fnode->ea_size_s) {
  229. hpfs_error(s, "fnode %08x: ea_size_s == %03x, ea_offs == 0",
  230. inode->i_ino, fnode->ea_size_s);
  231. return;
  232. }*/
  233. fnode->ea_offs = 0xc4;
  234. }
  235. if (fnode->ea_offs < 0xc4 || fnode->ea_offs + fnode->acl_size_s + fnode->ea_size_s > 0x200) {
  236. hpfs_error(s, "fnode %08lx: ea_offs == %03x, ea_size_s == %03x",
  237. (unsigned long)inode->i_ino,
  238. fnode->ea_offs, fnode->ea_size_s);
  239. return;
  240. }
  241. if ((fnode->ea_size_s || !fnode->ea_size_l) &&
  242. fnode->ea_offs + fnode->acl_size_s + fnode->ea_size_s + strlen(key) + size + 5 <= 0x200) {
  243. ea = fnode_end_ea(fnode);
  244. *(char *)ea = 0;
  245. ea->namelen = strlen(key);
  246. ea->valuelen = size;
  247. strcpy(ea->name, key);
  248. memcpy(ea_data(ea), data, size);
  249. fnode->ea_size_s += strlen(key) + size + 5;
  250. goto ret;
  251. }
  252. /* Most the code here is 99.9993422% unused. I hope there are no bugs.
  253. But what .. HPFS.IFS has also bugs in ea management. */
  254. if (fnode->ea_size_s && !fnode->ea_size_l) {
  255. secno n;
  256. struct buffer_head *bh;
  257. char *data;
  258. if (!(n = hpfs_alloc_sector(s, fno, 1, 0, 1))) return;
  259. if (!(data = hpfs_get_sector(s, n, &bh))) {
  260. hpfs_free_sectors(s, n, 1);
  261. return;
  262. }
  263. memcpy(data, fnode_ea(fnode), fnode->ea_size_s);
  264. fnode->ea_size_l = fnode->ea_size_s;
  265. fnode->ea_size_s = 0;
  266. fnode->ea_secno = n;
  267. fnode->ea_anode = 0;
  268. mark_buffer_dirty(bh);
  269. brelse(bh);
  270. }
  271. pos = fnode->ea_size_l + 5 + strlen(key) + size;
  272. len = (fnode->ea_size_l + 511) >> 9;
  273. if (pos >= 30000) goto bail;
  274. while (((pos + 511) >> 9) > len) {
  275. if (!len) {
  276. if (!(fnode->ea_secno = hpfs_alloc_sector(s, fno, 1, 0, 1)))
  277. goto bail;
  278. fnode->ea_anode = 0;
  279. len++;
  280. } else if (!fnode->ea_anode) {
  281. if (hpfs_alloc_if_possible(s, fnode->ea_secno + len)) {
  282. len++;
  283. } else {
  284. /* Aargh... don't know how to create ea anodes :-( */
  285. /*struct buffer_head *bh;
  286. struct anode *anode;
  287. anode_secno a_s;
  288. if (!(anode = hpfs_alloc_anode(s, fno, &a_s, &bh)))
  289. goto bail;
  290. anode->up = fno;
  291. anode->btree.fnode_parent = 1;
  292. anode->btree.n_free_nodes--;
  293. anode->btree.n_used_nodes++;
  294. anode->btree.first_free += 12;
  295. anode->u.external[0].disk_secno = fnode->ea_secno;
  296. anode->u.external[0].file_secno = 0;
  297. anode->u.external[0].length = len;
  298. mark_buffer_dirty(bh);
  299. brelse(bh);
  300. fnode->ea_anode = 1;
  301. fnode->ea_secno = a_s;*/
  302. secno new_sec;
  303. int i;
  304. if (!(new_sec = hpfs_alloc_sector(s, fno, 1, 1 - ((pos + 511) >> 9), 1)))
  305. goto bail;
  306. for (i = 0; i < len; i++) {
  307. struct buffer_head *bh1, *bh2;
  308. void *b1, *b2;
  309. if (!(b1 = hpfs_map_sector(s, fnode->ea_secno + i, &bh1, len - i - 1))) {
  310. hpfs_free_sectors(s, new_sec, (pos + 511) >> 9);
  311. goto bail;
  312. }
  313. if (!(b2 = hpfs_get_sector(s, new_sec + i, &bh2))) {
  314. brelse(bh1);
  315. hpfs_free_sectors(s, new_sec, (pos + 511) >> 9);
  316. goto bail;
  317. }
  318. memcpy(b2, b1, 512);
  319. brelse(bh1);
  320. mark_buffer_dirty(bh2);
  321. brelse(bh2);
  322. }
  323. hpfs_free_sectors(s, fnode->ea_secno, len);
  324. fnode->ea_secno = new_sec;
  325. len = (pos + 511) >> 9;
  326. }
  327. }
  328. if (fnode->ea_anode) {
  329. if (hpfs_add_sector_to_btree(s, fnode->ea_secno,
  330. 0, len) != -1) {
  331. len++;
  332. } else {
  333. goto bail;
  334. }
  335. }
  336. }
  337. h[0] = 0;
  338. h[1] = strlen(key);
  339. h[2] = size & 0xff;
  340. h[3] = size >> 8;
  341. if (hpfs_ea_write(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l, 4, h)) goto bail;
  342. if (hpfs_ea_write(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l + 4, h[1] + 1, key)) goto bail;
  343. if (hpfs_ea_write(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l + 5 + h[1], size, data)) goto bail;
  344. fnode->ea_size_l = pos;
  345. ret:
  346. hpfs_i(inode)->i_ea_size += 5 + strlen(key) + size;
  347. return;
  348. bail:
  349. if (fnode->ea_secno)
  350. if (fnode->ea_anode) hpfs_truncate_btree(s, fnode->ea_secno, 1, (fnode->ea_size_l + 511) >> 9);
  351. else hpfs_free_sectors(s, fnode->ea_secno + ((fnode->ea_size_l + 511) >> 9), len - ((fnode->ea_size_l + 511) >> 9));
  352. else fnode->ea_secno = fnode->ea_size_l = 0;
  353. }