xattr.c 28 KB

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