xattr.c 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031
  1. /*
  2. * linux/fs/ext2/xattr.c
  3. *
  4. * Copyright (C) 2001-2003 Andreas Gruenbacher <agruen@suse.de>
  5. *
  6. * Fix by Harrison Xing <harrison@mountainviewdata.com>.
  7. * Extended attributes for symlinks and special files added per
  8. * suggestion of Luka Renko <luka.renko@hermes.si>.
  9. * xattr consolidation Copyright (c) 2004 James Morris <jmorris@redhat.com>,
  10. * Red Hat Inc.
  11. *
  12. */
  13. /*
  14. * Extended attributes are stored on disk blocks allocated outside of
  15. * any inode. The i_file_acl field is then made to point to this allocated
  16. * block. If all extended attributes of an inode are identical, these
  17. * inodes may share the same extended attribute block. Such situations
  18. * are automatically detected by keeping a cache of recent attribute block
  19. * numbers and hashes over the block's contents in memory.
  20. *
  21. *
  22. * Extended attribute block layout:
  23. *
  24. * +------------------+
  25. * | header |
  26. * | entry 1 | |
  27. * | entry 2 | | growing downwards
  28. * | entry 3 | v
  29. * | four null bytes |
  30. * | . . . |
  31. * | value 1 | ^
  32. * | value 3 | | growing upwards
  33. * | value 2 | |
  34. * +------------------+
  35. *
  36. * The block header is followed by multiple entry descriptors. These entry
  37. * descriptors are variable in size, and aligned to EXT2_XATTR_PAD
  38. * byte boundaries. The entry descriptors are sorted by attribute name,
  39. * so that two extended attribute blocks can be compared efficiently.
  40. *
  41. * Attribute values are aligned to the end of the block, stored in
  42. * no specific order. They are also padded to EXT2_XATTR_PAD byte
  43. * boundaries. No additional gaps are left between them.
  44. *
  45. * Locking strategy
  46. * ----------------
  47. * EXT2_I(inode)->i_file_acl is protected by EXT2_I(inode)->xattr_sem.
  48. * EA blocks are only changed if they are exclusive to an inode, so
  49. * holding xattr_sem also means that nothing but the EA block's reference
  50. * count will change. Multiple writers to an EA block are synchronized
  51. * by the bh lock. No more than a single bh lock is held at any time
  52. * to avoid deadlocks.
  53. */
  54. #include <linux/buffer_head.h>
  55. #include <linux/module.h>
  56. #include <linux/init.h>
  57. #include <linux/slab.h>
  58. #include <linux/mbcache.h>
  59. #include <linux/quotaops.h>
  60. #include <linux/rwsem.h>
  61. #include <linux/security.h>
  62. #include "ext2.h"
  63. #include "xattr.h"
  64. #include "acl.h"
  65. #define HDR(bh) ((struct ext2_xattr_header *)((bh)->b_data))
  66. #define ENTRY(ptr) ((struct ext2_xattr_entry *)(ptr))
  67. #define FIRST_ENTRY(bh) ENTRY(HDR(bh)+1)
  68. #define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0)
  69. #ifdef EXT2_XATTR_DEBUG
  70. # define ea_idebug(inode, f...) do { \
  71. printk(KERN_DEBUG "inode %s:%ld: ", \
  72. inode->i_sb->s_id, inode->i_ino); \
  73. printk(f); \
  74. printk("\n"); \
  75. } while (0)
  76. # define ea_bdebug(bh, f...) do { \
  77. char b[BDEVNAME_SIZE]; \
  78. printk(KERN_DEBUG "block %s:%lu: ", \
  79. bdevname(bh->b_bdev, b), \
  80. (unsigned long) bh->b_blocknr); \
  81. printk(f); \
  82. printk("\n"); \
  83. } while (0)
  84. #else
  85. # define ea_idebug(f...)
  86. # define ea_bdebug(f...)
  87. #endif
  88. static int ext2_xattr_set2(struct inode *, struct buffer_head *,
  89. struct ext2_xattr_header *);
  90. static int ext2_xattr_cache_insert(struct buffer_head *);
  91. static struct buffer_head *ext2_xattr_cache_find(struct inode *,
  92. struct ext2_xattr_header *);
  93. static void ext2_xattr_rehash(struct ext2_xattr_header *,
  94. struct ext2_xattr_entry *);
  95. static struct mb_cache *ext2_xattr_cache;
  96. static const struct xattr_handler *ext2_xattr_handler_map[] = {
  97. [EXT2_XATTR_INDEX_USER] = &ext2_xattr_user_handler,
  98. #ifdef CONFIG_EXT2_FS_POSIX_ACL
  99. [EXT2_XATTR_INDEX_POSIX_ACL_ACCESS] = &ext2_xattr_acl_access_handler,
  100. [EXT2_XATTR_INDEX_POSIX_ACL_DEFAULT] = &ext2_xattr_acl_default_handler,
  101. #endif
  102. [EXT2_XATTR_INDEX_TRUSTED] = &ext2_xattr_trusted_handler,
  103. #ifdef CONFIG_EXT2_FS_SECURITY
  104. [EXT2_XATTR_INDEX_SECURITY] = &ext2_xattr_security_handler,
  105. #endif
  106. };
  107. const struct xattr_handler *ext2_xattr_handlers[] = {
  108. &ext2_xattr_user_handler,
  109. &ext2_xattr_trusted_handler,
  110. #ifdef CONFIG_EXT2_FS_POSIX_ACL
  111. &ext2_xattr_acl_access_handler,
  112. &ext2_xattr_acl_default_handler,
  113. #endif
  114. #ifdef CONFIG_EXT2_FS_SECURITY
  115. &ext2_xattr_security_handler,
  116. #endif
  117. NULL
  118. };
  119. static inline const struct xattr_handler *
  120. ext2_xattr_handler(int name_index)
  121. {
  122. const struct xattr_handler *handler = NULL;
  123. if (name_index > 0 && name_index < ARRAY_SIZE(ext2_xattr_handler_map))
  124. handler = ext2_xattr_handler_map[name_index];
  125. return handler;
  126. }
  127. /*
  128. * ext2_xattr_get()
  129. *
  130. * Copy an extended attribute into the buffer
  131. * provided, or compute the buffer size required.
  132. * Buffer is NULL to compute the size of the buffer required.
  133. *
  134. * Returns a negative error number on failure, or the number of bytes
  135. * used / required on success.
  136. */
  137. int
  138. ext2_xattr_get(struct inode *inode, int name_index, const char *name,
  139. void *buffer, size_t buffer_size)
  140. {
  141. struct buffer_head *bh = NULL;
  142. struct ext2_xattr_entry *entry;
  143. size_t name_len, size;
  144. char *end;
  145. int error;
  146. ea_idebug(inode, "name=%d.%s, buffer=%p, buffer_size=%ld",
  147. name_index, name, buffer, (long)buffer_size);
  148. if (name == NULL)
  149. return -EINVAL;
  150. name_len = strlen(name);
  151. if (name_len > 255)
  152. return -ERANGE;
  153. down_read(&EXT2_I(inode)->xattr_sem);
  154. error = -ENODATA;
  155. if (!EXT2_I(inode)->i_file_acl)
  156. goto cleanup;
  157. ea_idebug(inode, "reading block %d", EXT2_I(inode)->i_file_acl);
  158. bh = sb_bread(inode->i_sb, EXT2_I(inode)->i_file_acl);
  159. error = -EIO;
  160. if (!bh)
  161. goto cleanup;
  162. ea_bdebug(bh, "b_count=%d, refcount=%d",
  163. atomic_read(&(bh->b_count)), le32_to_cpu(HDR(bh)->h_refcount));
  164. end = bh->b_data + bh->b_size;
  165. if (HDR(bh)->h_magic != cpu_to_le32(EXT2_XATTR_MAGIC) ||
  166. HDR(bh)->h_blocks != cpu_to_le32(1)) {
  167. bad_block: ext2_error(inode->i_sb, "ext2_xattr_get",
  168. "inode %ld: bad block %d", inode->i_ino,
  169. EXT2_I(inode)->i_file_acl);
  170. error = -EIO;
  171. goto cleanup;
  172. }
  173. /* find named attribute */
  174. entry = FIRST_ENTRY(bh);
  175. while (!IS_LAST_ENTRY(entry)) {
  176. struct ext2_xattr_entry *next =
  177. EXT2_XATTR_NEXT(entry);
  178. if ((char *)next >= end)
  179. goto bad_block;
  180. if (name_index == entry->e_name_index &&
  181. name_len == entry->e_name_len &&
  182. memcmp(name, entry->e_name, name_len) == 0)
  183. goto found;
  184. entry = next;
  185. }
  186. if (ext2_xattr_cache_insert(bh))
  187. ea_idebug(inode, "cache insert failed");
  188. error = -ENODATA;
  189. goto cleanup;
  190. found:
  191. /* check the buffer size */
  192. if (entry->e_value_block != 0)
  193. goto bad_block;
  194. size = le32_to_cpu(entry->e_value_size);
  195. if (size > inode->i_sb->s_blocksize ||
  196. le16_to_cpu(entry->e_value_offs) + size > inode->i_sb->s_blocksize)
  197. goto bad_block;
  198. if (ext2_xattr_cache_insert(bh))
  199. ea_idebug(inode, "cache insert failed");
  200. if (buffer) {
  201. error = -ERANGE;
  202. if (size > buffer_size)
  203. goto cleanup;
  204. /* return value of attribute */
  205. memcpy(buffer, bh->b_data + le16_to_cpu(entry->e_value_offs),
  206. size);
  207. }
  208. error = size;
  209. cleanup:
  210. brelse(bh);
  211. up_read(&EXT2_I(inode)->xattr_sem);
  212. return error;
  213. }
  214. /*
  215. * ext2_xattr_list()
  216. *
  217. * Copy a list of attribute names into the buffer
  218. * provided, or compute the buffer size required.
  219. * Buffer is NULL to compute the size of the buffer required.
  220. *
  221. * Returns a negative error number on failure, or the number of bytes
  222. * used / required on success.
  223. */
  224. static int
  225. ext2_xattr_list(struct dentry *dentry, char *buffer, size_t buffer_size)
  226. {
  227. struct inode *inode = dentry->d_inode;
  228. struct buffer_head *bh = NULL;
  229. struct ext2_xattr_entry *entry;
  230. char *end;
  231. size_t rest = buffer_size;
  232. int error;
  233. ea_idebug(inode, "buffer=%p, buffer_size=%ld",
  234. buffer, (long)buffer_size);
  235. down_read(&EXT2_I(inode)->xattr_sem);
  236. error = 0;
  237. if (!EXT2_I(inode)->i_file_acl)
  238. goto cleanup;
  239. ea_idebug(inode, "reading block %d", EXT2_I(inode)->i_file_acl);
  240. bh = sb_bread(inode->i_sb, EXT2_I(inode)->i_file_acl);
  241. error = -EIO;
  242. if (!bh)
  243. goto cleanup;
  244. ea_bdebug(bh, "b_count=%d, refcount=%d",
  245. atomic_read(&(bh->b_count)), le32_to_cpu(HDR(bh)->h_refcount));
  246. end = bh->b_data + bh->b_size;
  247. if (HDR(bh)->h_magic != cpu_to_le32(EXT2_XATTR_MAGIC) ||
  248. HDR(bh)->h_blocks != cpu_to_le32(1)) {
  249. bad_block: ext2_error(inode->i_sb, "ext2_xattr_list",
  250. "inode %ld: bad block %d", inode->i_ino,
  251. EXT2_I(inode)->i_file_acl);
  252. error = -EIO;
  253. goto cleanup;
  254. }
  255. /* check the on-disk data structure */
  256. entry = FIRST_ENTRY(bh);
  257. while (!IS_LAST_ENTRY(entry)) {
  258. struct ext2_xattr_entry *next = EXT2_XATTR_NEXT(entry);
  259. if ((char *)next >= end)
  260. goto bad_block;
  261. entry = next;
  262. }
  263. if (ext2_xattr_cache_insert(bh))
  264. ea_idebug(inode, "cache insert failed");
  265. /* list the attribute names */
  266. for (entry = FIRST_ENTRY(bh); !IS_LAST_ENTRY(entry);
  267. entry = EXT2_XATTR_NEXT(entry)) {
  268. const struct xattr_handler *handler =
  269. ext2_xattr_handler(entry->e_name_index);
  270. if (handler) {
  271. size_t size = handler->list(dentry, buffer, rest,
  272. entry->e_name,
  273. entry->e_name_len,
  274. handler->flags);
  275. if (buffer) {
  276. if (size > rest) {
  277. error = -ERANGE;
  278. goto cleanup;
  279. }
  280. buffer += size;
  281. }
  282. rest -= size;
  283. }
  284. }
  285. error = buffer_size - rest; /* total size */
  286. cleanup:
  287. brelse(bh);
  288. up_read(&EXT2_I(inode)->xattr_sem);
  289. return error;
  290. }
  291. /*
  292. * Inode operation listxattr()
  293. *
  294. * dentry->d_inode->i_mutex: don't care
  295. */
  296. ssize_t
  297. ext2_listxattr(struct dentry *dentry, char *buffer, size_t size)
  298. {
  299. return ext2_xattr_list(dentry, buffer, size);
  300. }
  301. /*
  302. * If the EXT2_FEATURE_COMPAT_EXT_ATTR feature of this file system is
  303. * not set, set it.
  304. */
  305. static void ext2_xattr_update_super_block(struct super_block *sb)
  306. {
  307. if (EXT2_HAS_COMPAT_FEATURE(sb, EXT2_FEATURE_COMPAT_EXT_ATTR))
  308. return;
  309. spin_lock(&EXT2_SB(sb)->s_lock);
  310. EXT2_SET_COMPAT_FEATURE(sb, EXT2_FEATURE_COMPAT_EXT_ATTR);
  311. spin_unlock(&EXT2_SB(sb)->s_lock);
  312. sb->s_dirt = 1;
  313. mark_buffer_dirty(EXT2_SB(sb)->s_sbh);
  314. }
  315. /*
  316. * ext2_xattr_set()
  317. *
  318. * Create, replace or remove an extended attribute for this inode. Value
  319. * is NULL to remove an existing extended attribute, and non-NULL to
  320. * either replace an existing extended attribute, or create a new extended
  321. * attribute. The flags XATTR_REPLACE and XATTR_CREATE
  322. * specify that an extended attribute must exist and must not exist
  323. * previous to the call, respectively.
  324. *
  325. * Returns 0, or a negative error number on failure.
  326. */
  327. int
  328. ext2_xattr_set(struct inode *inode, int name_index, const char *name,
  329. const void *value, size_t value_len, int flags)
  330. {
  331. struct super_block *sb = inode->i_sb;
  332. struct buffer_head *bh = NULL;
  333. struct ext2_xattr_header *header = NULL;
  334. struct ext2_xattr_entry *here, *last;
  335. size_t name_len, free, min_offs = sb->s_blocksize;
  336. int not_found = 1, error;
  337. char *end;
  338. /*
  339. * header -- Points either into bh, or to a temporarily
  340. * allocated buffer.
  341. * here -- The named entry found, or the place for inserting, within
  342. * the block pointed to by header.
  343. * last -- Points right after the last named entry within the block
  344. * pointed to by header.
  345. * min_offs -- The offset of the first value (values are aligned
  346. * towards the end of the block).
  347. * end -- Points right after the block pointed to by header.
  348. */
  349. ea_idebug(inode, "name=%d.%s, value=%p, value_len=%ld",
  350. name_index, name, value, (long)value_len);
  351. if (value == NULL)
  352. value_len = 0;
  353. if (name == NULL)
  354. return -EINVAL;
  355. name_len = strlen(name);
  356. if (name_len > 255 || value_len > sb->s_blocksize)
  357. return -ERANGE;
  358. down_write(&EXT2_I(inode)->xattr_sem);
  359. if (EXT2_I(inode)->i_file_acl) {
  360. /* The inode already has an extended attribute block. */
  361. bh = sb_bread(sb, EXT2_I(inode)->i_file_acl);
  362. error = -EIO;
  363. if (!bh)
  364. goto cleanup;
  365. ea_bdebug(bh, "b_count=%d, refcount=%d",
  366. atomic_read(&(bh->b_count)),
  367. le32_to_cpu(HDR(bh)->h_refcount));
  368. header = HDR(bh);
  369. end = bh->b_data + bh->b_size;
  370. if (header->h_magic != cpu_to_le32(EXT2_XATTR_MAGIC) ||
  371. header->h_blocks != cpu_to_le32(1)) {
  372. bad_block: ext2_error(sb, "ext2_xattr_set",
  373. "inode %ld: bad block %d", inode->i_ino,
  374. EXT2_I(inode)->i_file_acl);
  375. error = -EIO;
  376. goto cleanup;
  377. }
  378. /* Find the named attribute. */
  379. here = FIRST_ENTRY(bh);
  380. while (!IS_LAST_ENTRY(here)) {
  381. struct ext2_xattr_entry *next = EXT2_XATTR_NEXT(here);
  382. if ((char *)next >= end)
  383. goto bad_block;
  384. if (!here->e_value_block && here->e_value_size) {
  385. size_t offs = le16_to_cpu(here->e_value_offs);
  386. if (offs < min_offs)
  387. min_offs = offs;
  388. }
  389. not_found = name_index - here->e_name_index;
  390. if (!not_found)
  391. not_found = name_len - here->e_name_len;
  392. if (!not_found)
  393. not_found = memcmp(name, here->e_name,name_len);
  394. if (not_found <= 0)
  395. break;
  396. here = next;
  397. }
  398. last = here;
  399. /* We still need to compute min_offs and last. */
  400. while (!IS_LAST_ENTRY(last)) {
  401. struct ext2_xattr_entry *next = EXT2_XATTR_NEXT(last);
  402. if ((char *)next >= end)
  403. goto bad_block;
  404. if (!last->e_value_block && last->e_value_size) {
  405. size_t offs = le16_to_cpu(last->e_value_offs);
  406. if (offs < min_offs)
  407. min_offs = offs;
  408. }
  409. last = next;
  410. }
  411. /* Check whether we have enough space left. */
  412. free = min_offs - ((char*)last - (char*)header) - sizeof(__u32);
  413. } else {
  414. /* We will use a new extended attribute block. */
  415. free = sb->s_blocksize -
  416. sizeof(struct ext2_xattr_header) - sizeof(__u32);
  417. here = last = NULL; /* avoid gcc uninitialized warning. */
  418. }
  419. if (not_found) {
  420. /* Request to remove a nonexistent attribute? */
  421. error = -ENODATA;
  422. if (flags & XATTR_REPLACE)
  423. goto cleanup;
  424. error = 0;
  425. if (value == NULL)
  426. goto cleanup;
  427. } else {
  428. /* Request to create an existing attribute? */
  429. error = -EEXIST;
  430. if (flags & XATTR_CREATE)
  431. goto cleanup;
  432. if (!here->e_value_block && here->e_value_size) {
  433. size_t size = le32_to_cpu(here->e_value_size);
  434. if (le16_to_cpu(here->e_value_offs) + size >
  435. sb->s_blocksize || size > sb->s_blocksize)
  436. goto bad_block;
  437. free += EXT2_XATTR_SIZE(size);
  438. }
  439. free += EXT2_XATTR_LEN(name_len);
  440. }
  441. error = -ENOSPC;
  442. if (free < EXT2_XATTR_LEN(name_len) + EXT2_XATTR_SIZE(value_len))
  443. goto cleanup;
  444. /* Here we know that we can set the new attribute. */
  445. if (header) {
  446. struct mb_cache_entry *ce;
  447. /* assert(header == HDR(bh)); */
  448. ce = mb_cache_entry_get(ext2_xattr_cache, bh->b_bdev,
  449. bh->b_blocknr);
  450. lock_buffer(bh);
  451. if (header->h_refcount == cpu_to_le32(1)) {
  452. ea_bdebug(bh, "modifying in-place");
  453. if (ce)
  454. mb_cache_entry_free(ce);
  455. /* keep the buffer locked while modifying it. */
  456. } else {
  457. int offset;
  458. if (ce)
  459. mb_cache_entry_release(ce);
  460. unlock_buffer(bh);
  461. ea_bdebug(bh, "cloning");
  462. header = kmalloc(bh->b_size, GFP_KERNEL);
  463. error = -ENOMEM;
  464. if (header == NULL)
  465. goto cleanup;
  466. memcpy(header, HDR(bh), bh->b_size);
  467. header->h_refcount = cpu_to_le32(1);
  468. offset = (char *)here - bh->b_data;
  469. here = ENTRY((char *)header + offset);
  470. offset = (char *)last - bh->b_data;
  471. last = ENTRY((char *)header + offset);
  472. }
  473. } else {
  474. /* Allocate a buffer where we construct the new block. */
  475. header = kzalloc(sb->s_blocksize, GFP_KERNEL);
  476. error = -ENOMEM;
  477. if (header == NULL)
  478. goto cleanup;
  479. end = (char *)header + sb->s_blocksize;
  480. header->h_magic = cpu_to_le32(EXT2_XATTR_MAGIC);
  481. header->h_blocks = header->h_refcount = cpu_to_le32(1);
  482. last = here = ENTRY(header+1);
  483. }
  484. /* Iff we are modifying the block in-place, bh is locked here. */
  485. if (not_found) {
  486. /* Insert the new name. */
  487. size_t size = EXT2_XATTR_LEN(name_len);
  488. size_t rest = (char *)last - (char *)here;
  489. memmove((char *)here + size, here, rest);
  490. memset(here, 0, size);
  491. here->e_name_index = name_index;
  492. here->e_name_len = name_len;
  493. memcpy(here->e_name, name, name_len);
  494. } else {
  495. if (!here->e_value_block && here->e_value_size) {
  496. char *first_val = (char *)header + min_offs;
  497. size_t offs = le16_to_cpu(here->e_value_offs);
  498. char *val = (char *)header + offs;
  499. size_t size = EXT2_XATTR_SIZE(
  500. le32_to_cpu(here->e_value_size));
  501. if (size == EXT2_XATTR_SIZE(value_len)) {
  502. /* The old and the new value have the same
  503. size. Just replace. */
  504. here->e_value_size = cpu_to_le32(value_len);
  505. memset(val + size - EXT2_XATTR_PAD, 0,
  506. EXT2_XATTR_PAD); /* Clear pad bytes. */
  507. memcpy(val, value, value_len);
  508. goto skip_replace;
  509. }
  510. /* Remove the old value. */
  511. memmove(first_val + size, first_val, val - first_val);
  512. memset(first_val, 0, size);
  513. here->e_value_offs = 0;
  514. min_offs += size;
  515. /* Adjust all value offsets. */
  516. last = ENTRY(header+1);
  517. while (!IS_LAST_ENTRY(last)) {
  518. size_t o = le16_to_cpu(last->e_value_offs);
  519. if (!last->e_value_block && o < offs)
  520. last->e_value_offs =
  521. cpu_to_le16(o + size);
  522. last = EXT2_XATTR_NEXT(last);
  523. }
  524. }
  525. if (value == NULL) {
  526. /* Remove the old name. */
  527. size_t size = EXT2_XATTR_LEN(name_len);
  528. last = ENTRY((char *)last - size);
  529. memmove(here, (char*)here + size,
  530. (char*)last - (char*)here);
  531. memset(last, 0, size);
  532. }
  533. }
  534. if (value != NULL) {
  535. /* Insert the new value. */
  536. here->e_value_size = cpu_to_le32(value_len);
  537. if (value_len) {
  538. size_t size = EXT2_XATTR_SIZE(value_len);
  539. char *val = (char *)header + min_offs - size;
  540. here->e_value_offs =
  541. cpu_to_le16((char *)val - (char *)header);
  542. memset(val + size - EXT2_XATTR_PAD, 0,
  543. EXT2_XATTR_PAD); /* Clear the pad bytes. */
  544. memcpy(val, value, value_len);
  545. }
  546. }
  547. skip_replace:
  548. if (IS_LAST_ENTRY(ENTRY(header+1))) {
  549. /* This block is now empty. */
  550. if (bh && header == HDR(bh))
  551. unlock_buffer(bh); /* we were modifying in-place. */
  552. error = ext2_xattr_set2(inode, bh, NULL);
  553. } else {
  554. ext2_xattr_rehash(header, here);
  555. if (bh && header == HDR(bh))
  556. unlock_buffer(bh); /* we were modifying in-place. */
  557. error = ext2_xattr_set2(inode, bh, header);
  558. }
  559. cleanup:
  560. brelse(bh);
  561. if (!(bh && header == HDR(bh)))
  562. kfree(header);
  563. up_write(&EXT2_I(inode)->xattr_sem);
  564. return error;
  565. }
  566. /*
  567. * Second half of ext2_xattr_set(): Update the file system.
  568. */
  569. static int
  570. ext2_xattr_set2(struct inode *inode, struct buffer_head *old_bh,
  571. struct ext2_xattr_header *header)
  572. {
  573. struct super_block *sb = inode->i_sb;
  574. struct buffer_head *new_bh = NULL;
  575. int error;
  576. if (header) {
  577. new_bh = ext2_xattr_cache_find(inode, header);
  578. if (new_bh) {
  579. /* We found an identical block in the cache. */
  580. if (new_bh == old_bh) {
  581. ea_bdebug(new_bh, "keeping this block");
  582. } else {
  583. /* The old block is released after updating
  584. the inode. */
  585. ea_bdebug(new_bh, "reusing block");
  586. error = dquot_alloc_block(inode, 1);
  587. if (error) {
  588. unlock_buffer(new_bh);
  589. goto cleanup;
  590. }
  591. le32_add_cpu(&HDR(new_bh)->h_refcount, 1);
  592. ea_bdebug(new_bh, "refcount now=%d",
  593. le32_to_cpu(HDR(new_bh)->h_refcount));
  594. }
  595. unlock_buffer(new_bh);
  596. } else if (old_bh && header == HDR(old_bh)) {
  597. /* Keep this block. No need to lock the block as we
  598. don't need to change the reference count. */
  599. new_bh = old_bh;
  600. get_bh(new_bh);
  601. ext2_xattr_cache_insert(new_bh);
  602. } else {
  603. /* We need to allocate a new block */
  604. ext2_fsblk_t goal = ext2_group_first_block_no(sb,
  605. EXT2_I(inode)->i_block_group);
  606. int block = ext2_new_block(inode, goal, &error);
  607. if (error)
  608. goto cleanup;
  609. ea_idebug(inode, "creating block %d", block);
  610. new_bh = sb_getblk(sb, block);
  611. if (!new_bh) {
  612. ext2_free_blocks(inode, block, 1);
  613. mark_inode_dirty(inode);
  614. error = -EIO;
  615. goto cleanup;
  616. }
  617. lock_buffer(new_bh);
  618. memcpy(new_bh->b_data, header, new_bh->b_size);
  619. set_buffer_uptodate(new_bh);
  620. unlock_buffer(new_bh);
  621. ext2_xattr_cache_insert(new_bh);
  622. ext2_xattr_update_super_block(sb);
  623. }
  624. mark_buffer_dirty(new_bh);
  625. if (IS_SYNC(inode)) {
  626. sync_dirty_buffer(new_bh);
  627. error = -EIO;
  628. if (buffer_req(new_bh) && !buffer_uptodate(new_bh))
  629. goto cleanup;
  630. }
  631. }
  632. /* Update the inode. */
  633. EXT2_I(inode)->i_file_acl = new_bh ? new_bh->b_blocknr : 0;
  634. inode->i_ctime = CURRENT_TIME_SEC;
  635. if (IS_SYNC(inode)) {
  636. error = sync_inode_metadata(inode, 1);
  637. /* In case sync failed due to ENOSPC the inode was actually
  638. * written (only some dirty data were not) so we just proceed
  639. * as if nothing happened and cleanup the unused block */
  640. if (error && error != -ENOSPC) {
  641. if (new_bh && new_bh != old_bh) {
  642. dquot_free_block_nodirty(inode, 1);
  643. mark_inode_dirty(inode);
  644. }
  645. goto cleanup;
  646. }
  647. } else
  648. mark_inode_dirty(inode);
  649. error = 0;
  650. if (old_bh && old_bh != new_bh) {
  651. struct mb_cache_entry *ce;
  652. /*
  653. * If there was an old block and we are no longer using it,
  654. * release the old block.
  655. */
  656. ce = mb_cache_entry_get(ext2_xattr_cache, old_bh->b_bdev,
  657. old_bh->b_blocknr);
  658. lock_buffer(old_bh);
  659. if (HDR(old_bh)->h_refcount == cpu_to_le32(1)) {
  660. /* Free the old block. */
  661. if (ce)
  662. mb_cache_entry_free(ce);
  663. ea_bdebug(old_bh, "freeing");
  664. ext2_free_blocks(inode, old_bh->b_blocknr, 1);
  665. mark_inode_dirty(inode);
  666. /* We let our caller release old_bh, so we
  667. * need to duplicate the buffer before. */
  668. get_bh(old_bh);
  669. bforget(old_bh);
  670. } else {
  671. /* Decrement the refcount only. */
  672. le32_add_cpu(&HDR(old_bh)->h_refcount, -1);
  673. if (ce)
  674. mb_cache_entry_release(ce);
  675. dquot_free_block_nodirty(inode, 1);
  676. mark_inode_dirty(inode);
  677. mark_buffer_dirty(old_bh);
  678. ea_bdebug(old_bh, "refcount now=%d",
  679. le32_to_cpu(HDR(old_bh)->h_refcount));
  680. }
  681. unlock_buffer(old_bh);
  682. }
  683. cleanup:
  684. brelse(new_bh);
  685. return error;
  686. }
  687. /*
  688. * ext2_xattr_delete_inode()
  689. *
  690. * Free extended attribute resources associated with this inode. This
  691. * is called immediately before an inode is freed.
  692. */
  693. void
  694. ext2_xattr_delete_inode(struct inode *inode)
  695. {
  696. struct buffer_head *bh = NULL;
  697. struct mb_cache_entry *ce;
  698. down_write(&EXT2_I(inode)->xattr_sem);
  699. if (!EXT2_I(inode)->i_file_acl)
  700. goto cleanup;
  701. bh = sb_bread(inode->i_sb, EXT2_I(inode)->i_file_acl);
  702. if (!bh) {
  703. ext2_error(inode->i_sb, "ext2_xattr_delete_inode",
  704. "inode %ld: block %d read error", inode->i_ino,
  705. EXT2_I(inode)->i_file_acl);
  706. goto cleanup;
  707. }
  708. ea_bdebug(bh, "b_count=%d", atomic_read(&(bh->b_count)));
  709. if (HDR(bh)->h_magic != cpu_to_le32(EXT2_XATTR_MAGIC) ||
  710. HDR(bh)->h_blocks != cpu_to_le32(1)) {
  711. ext2_error(inode->i_sb, "ext2_xattr_delete_inode",
  712. "inode %ld: bad block %d", inode->i_ino,
  713. EXT2_I(inode)->i_file_acl);
  714. goto cleanup;
  715. }
  716. ce = mb_cache_entry_get(ext2_xattr_cache, bh->b_bdev, bh->b_blocknr);
  717. lock_buffer(bh);
  718. if (HDR(bh)->h_refcount == cpu_to_le32(1)) {
  719. if (ce)
  720. mb_cache_entry_free(ce);
  721. ext2_free_blocks(inode, EXT2_I(inode)->i_file_acl, 1);
  722. get_bh(bh);
  723. bforget(bh);
  724. unlock_buffer(bh);
  725. } else {
  726. le32_add_cpu(&HDR(bh)->h_refcount, -1);
  727. if (ce)
  728. mb_cache_entry_release(ce);
  729. ea_bdebug(bh, "refcount now=%d",
  730. le32_to_cpu(HDR(bh)->h_refcount));
  731. unlock_buffer(bh);
  732. mark_buffer_dirty(bh);
  733. if (IS_SYNC(inode))
  734. sync_dirty_buffer(bh);
  735. dquot_free_block_nodirty(inode, 1);
  736. }
  737. EXT2_I(inode)->i_file_acl = 0;
  738. cleanup:
  739. brelse(bh);
  740. up_write(&EXT2_I(inode)->xattr_sem);
  741. }
  742. /*
  743. * ext2_xattr_put_super()
  744. *
  745. * This is called when a file system is unmounted.
  746. */
  747. void
  748. ext2_xattr_put_super(struct super_block *sb)
  749. {
  750. mb_cache_shrink(sb->s_bdev);
  751. }
  752. /*
  753. * ext2_xattr_cache_insert()
  754. *
  755. * Create a new entry in the extended attribute cache, and insert
  756. * it unless such an entry is already in the cache.
  757. *
  758. * Returns 0, or a negative error number on failure.
  759. */
  760. static int
  761. ext2_xattr_cache_insert(struct buffer_head *bh)
  762. {
  763. __u32 hash = le32_to_cpu(HDR(bh)->h_hash);
  764. struct mb_cache_entry *ce;
  765. int error;
  766. ce = mb_cache_entry_alloc(ext2_xattr_cache, GFP_NOFS);
  767. if (!ce)
  768. return -ENOMEM;
  769. error = mb_cache_entry_insert(ce, bh->b_bdev, bh->b_blocknr, hash);
  770. if (error) {
  771. mb_cache_entry_free(ce);
  772. if (error == -EBUSY) {
  773. ea_bdebug(bh, "already in cache (%d cache entries)",
  774. atomic_read(&ext2_xattr_cache->c_entry_count));
  775. error = 0;
  776. }
  777. } else {
  778. ea_bdebug(bh, "inserting [%x] (%d cache entries)", (int)hash,
  779. atomic_read(&ext2_xattr_cache->c_entry_count));
  780. mb_cache_entry_release(ce);
  781. }
  782. return error;
  783. }
  784. /*
  785. * ext2_xattr_cmp()
  786. *
  787. * Compare two extended attribute blocks for equality.
  788. *
  789. * Returns 0 if the blocks are equal, 1 if they differ, and
  790. * a negative error number on errors.
  791. */
  792. static int
  793. ext2_xattr_cmp(struct ext2_xattr_header *header1,
  794. struct ext2_xattr_header *header2)
  795. {
  796. struct ext2_xattr_entry *entry1, *entry2;
  797. entry1 = ENTRY(header1+1);
  798. entry2 = ENTRY(header2+1);
  799. while (!IS_LAST_ENTRY(entry1)) {
  800. if (IS_LAST_ENTRY(entry2))
  801. return 1;
  802. if (entry1->e_hash != entry2->e_hash ||
  803. entry1->e_name_index != entry2->e_name_index ||
  804. entry1->e_name_len != entry2->e_name_len ||
  805. entry1->e_value_size != entry2->e_value_size ||
  806. memcmp(entry1->e_name, entry2->e_name, entry1->e_name_len))
  807. return 1;
  808. if (entry1->e_value_block != 0 || entry2->e_value_block != 0)
  809. return -EIO;
  810. if (memcmp((char *)header1 + le16_to_cpu(entry1->e_value_offs),
  811. (char *)header2 + le16_to_cpu(entry2->e_value_offs),
  812. le32_to_cpu(entry1->e_value_size)))
  813. return 1;
  814. entry1 = EXT2_XATTR_NEXT(entry1);
  815. entry2 = EXT2_XATTR_NEXT(entry2);
  816. }
  817. if (!IS_LAST_ENTRY(entry2))
  818. return 1;
  819. return 0;
  820. }
  821. /*
  822. * ext2_xattr_cache_find()
  823. *
  824. * Find an identical extended attribute block.
  825. *
  826. * Returns a locked buffer head to the block found, or NULL if such
  827. * a block was not found or an error occurred.
  828. */
  829. static struct buffer_head *
  830. ext2_xattr_cache_find(struct inode *inode, struct ext2_xattr_header *header)
  831. {
  832. __u32 hash = le32_to_cpu(header->h_hash);
  833. struct mb_cache_entry *ce;
  834. if (!header->h_hash)
  835. return NULL; /* never share */
  836. ea_idebug(inode, "looking for cached blocks [%x]", (int)hash);
  837. again:
  838. ce = mb_cache_entry_find_first(ext2_xattr_cache, inode->i_sb->s_bdev,
  839. hash);
  840. while (ce) {
  841. struct buffer_head *bh;
  842. if (IS_ERR(ce)) {
  843. if (PTR_ERR(ce) == -EAGAIN)
  844. goto again;
  845. break;
  846. }
  847. bh = sb_bread(inode->i_sb, ce->e_block);
  848. if (!bh) {
  849. ext2_error(inode->i_sb, "ext2_xattr_cache_find",
  850. "inode %ld: block %ld read error",
  851. inode->i_ino, (unsigned long) ce->e_block);
  852. } else {
  853. lock_buffer(bh);
  854. if (le32_to_cpu(HDR(bh)->h_refcount) >
  855. EXT2_XATTR_REFCOUNT_MAX) {
  856. ea_idebug(inode, "block %ld refcount %d>%d",
  857. (unsigned long) ce->e_block,
  858. le32_to_cpu(HDR(bh)->h_refcount),
  859. EXT2_XATTR_REFCOUNT_MAX);
  860. } else if (!ext2_xattr_cmp(header, HDR(bh))) {
  861. ea_bdebug(bh, "b_count=%d",
  862. atomic_read(&(bh->b_count)));
  863. mb_cache_entry_release(ce);
  864. return bh;
  865. }
  866. unlock_buffer(bh);
  867. brelse(bh);
  868. }
  869. ce = mb_cache_entry_find_next(ce, inode->i_sb->s_bdev, hash);
  870. }
  871. return NULL;
  872. }
  873. #define NAME_HASH_SHIFT 5
  874. #define VALUE_HASH_SHIFT 16
  875. /*
  876. * ext2_xattr_hash_entry()
  877. *
  878. * Compute the hash of an extended attribute.
  879. */
  880. static inline void ext2_xattr_hash_entry(struct ext2_xattr_header *header,
  881. struct ext2_xattr_entry *entry)
  882. {
  883. __u32 hash = 0;
  884. char *name = entry->e_name;
  885. int n;
  886. for (n=0; n < entry->e_name_len; n++) {
  887. hash = (hash << NAME_HASH_SHIFT) ^
  888. (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
  889. *name++;
  890. }
  891. if (entry->e_value_block == 0 && entry->e_value_size != 0) {
  892. __le32 *value = (__le32 *)((char *)header +
  893. le16_to_cpu(entry->e_value_offs));
  894. for (n = (le32_to_cpu(entry->e_value_size) +
  895. EXT2_XATTR_ROUND) >> EXT2_XATTR_PAD_BITS; n; n--) {
  896. hash = (hash << VALUE_HASH_SHIFT) ^
  897. (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT)) ^
  898. le32_to_cpu(*value++);
  899. }
  900. }
  901. entry->e_hash = cpu_to_le32(hash);
  902. }
  903. #undef NAME_HASH_SHIFT
  904. #undef VALUE_HASH_SHIFT
  905. #define BLOCK_HASH_SHIFT 16
  906. /*
  907. * ext2_xattr_rehash()
  908. *
  909. * Re-compute the extended attribute hash value after an entry has changed.
  910. */
  911. static void ext2_xattr_rehash(struct ext2_xattr_header *header,
  912. struct ext2_xattr_entry *entry)
  913. {
  914. struct ext2_xattr_entry *here;
  915. __u32 hash = 0;
  916. ext2_xattr_hash_entry(header, entry);
  917. here = ENTRY(header+1);
  918. while (!IS_LAST_ENTRY(here)) {
  919. if (!here->e_hash) {
  920. /* Block is not shared if an entry's hash value == 0 */
  921. hash = 0;
  922. break;
  923. }
  924. hash = (hash << BLOCK_HASH_SHIFT) ^
  925. (hash >> (8*sizeof(hash) - BLOCK_HASH_SHIFT)) ^
  926. le32_to_cpu(here->e_hash);
  927. here = EXT2_XATTR_NEXT(here);
  928. }
  929. header->h_hash = cpu_to_le32(hash);
  930. }
  931. #undef BLOCK_HASH_SHIFT
  932. int __init
  933. init_ext2_xattr(void)
  934. {
  935. ext2_xattr_cache = mb_cache_create("ext2_xattr", 6);
  936. if (!ext2_xattr_cache)
  937. return -ENOMEM;
  938. return 0;
  939. }
  940. void
  941. exit_ext2_xattr(void)
  942. {
  943. mb_cache_destroy(ext2_xattr_cache);
  944. }