xattr.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501
  1. /*
  2. * fs/f2fs/xattr.c
  3. *
  4. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  5. * http://www.samsung.com/
  6. *
  7. * Portions of this code from linux/fs/ext2/xattr.c
  8. *
  9. * Copyright (C) 2001-2003 Andreas Gruenbacher <agruen@suse.de>
  10. *
  11. * Fix by Harrison Xing <harrison@mountainviewdata.com>.
  12. * Extended attributes for symlinks and special files added per
  13. * suggestion of Luka Renko <luka.renko@hermes.si>.
  14. * xattr consolidation Copyright (c) 2004 James Morris <jmorris@redhat.com>,
  15. * Red Hat Inc.
  16. *
  17. * This program is free software; you can redistribute it and/or modify
  18. * it under the terms of the GNU General Public License version 2 as
  19. * published by the Free Software Foundation.
  20. */
  21. #include <linux/rwsem.h>
  22. #include <linux/f2fs_fs.h>
  23. #include <linux/security.h>
  24. #include "f2fs.h"
  25. #include "xattr.h"
  26. static size_t f2fs_xattr_generic_list(struct dentry *dentry, char *list,
  27. size_t list_size, const char *name, size_t name_len, int type)
  28. {
  29. struct f2fs_sb_info *sbi = F2FS_SB(dentry->d_sb);
  30. int total_len, prefix_len = 0;
  31. const char *prefix = NULL;
  32. switch (type) {
  33. case F2FS_XATTR_INDEX_USER:
  34. if (!test_opt(sbi, XATTR_USER))
  35. return -EOPNOTSUPP;
  36. prefix = XATTR_USER_PREFIX;
  37. prefix_len = XATTR_USER_PREFIX_LEN;
  38. break;
  39. case F2FS_XATTR_INDEX_TRUSTED:
  40. if (!capable(CAP_SYS_ADMIN))
  41. return -EPERM;
  42. prefix = XATTR_TRUSTED_PREFIX;
  43. prefix_len = XATTR_TRUSTED_PREFIX_LEN;
  44. break;
  45. case F2FS_XATTR_INDEX_SECURITY:
  46. prefix = XATTR_SECURITY_PREFIX;
  47. prefix_len = XATTR_SECURITY_PREFIX_LEN;
  48. break;
  49. default:
  50. return -EINVAL;
  51. }
  52. total_len = prefix_len + name_len + 1;
  53. if (list && total_len <= list_size) {
  54. memcpy(list, prefix, prefix_len);
  55. memcpy(list + prefix_len, name, name_len);
  56. list[prefix_len + name_len] = '\0';
  57. }
  58. return total_len;
  59. }
  60. static int f2fs_xattr_generic_get(struct dentry *dentry, const char *name,
  61. void *buffer, size_t size, int type)
  62. {
  63. struct f2fs_sb_info *sbi = F2FS_SB(dentry->d_sb);
  64. switch (type) {
  65. case F2FS_XATTR_INDEX_USER:
  66. if (!test_opt(sbi, XATTR_USER))
  67. return -EOPNOTSUPP;
  68. break;
  69. case F2FS_XATTR_INDEX_TRUSTED:
  70. if (!capable(CAP_SYS_ADMIN))
  71. return -EPERM;
  72. break;
  73. case F2FS_XATTR_INDEX_SECURITY:
  74. break;
  75. default:
  76. return -EINVAL;
  77. }
  78. if (strcmp(name, "") == 0)
  79. return -EINVAL;
  80. return f2fs_getxattr(dentry->d_inode, type, name, buffer, size);
  81. }
  82. static int f2fs_xattr_generic_set(struct dentry *dentry, const char *name,
  83. const void *value, size_t size, int flags, int type)
  84. {
  85. struct f2fs_sb_info *sbi = F2FS_SB(dentry->d_sb);
  86. switch (type) {
  87. case F2FS_XATTR_INDEX_USER:
  88. if (!test_opt(sbi, XATTR_USER))
  89. return -EOPNOTSUPP;
  90. break;
  91. case F2FS_XATTR_INDEX_TRUSTED:
  92. if (!capable(CAP_SYS_ADMIN))
  93. return -EPERM;
  94. break;
  95. case F2FS_XATTR_INDEX_SECURITY:
  96. break;
  97. default:
  98. return -EINVAL;
  99. }
  100. if (strcmp(name, "") == 0)
  101. return -EINVAL;
  102. return f2fs_setxattr(dentry->d_inode, type, name, value, size, NULL);
  103. }
  104. static size_t f2fs_xattr_advise_list(struct dentry *dentry, char *list,
  105. size_t list_size, const char *name, size_t name_len, int type)
  106. {
  107. const char *xname = F2FS_SYSTEM_ADVISE_PREFIX;
  108. size_t size;
  109. if (type != F2FS_XATTR_INDEX_ADVISE)
  110. return 0;
  111. size = strlen(xname) + 1;
  112. if (list && size <= list_size)
  113. memcpy(list, xname, size);
  114. return size;
  115. }
  116. static int f2fs_xattr_advise_get(struct dentry *dentry, const char *name,
  117. void *buffer, size_t size, int type)
  118. {
  119. struct inode *inode = dentry->d_inode;
  120. if (strcmp(name, "") != 0)
  121. return -EINVAL;
  122. *((char *)buffer) = F2FS_I(inode)->i_advise;
  123. return sizeof(char);
  124. }
  125. static int f2fs_xattr_advise_set(struct dentry *dentry, const char *name,
  126. const void *value, size_t size, int flags, int type)
  127. {
  128. struct inode *inode = dentry->d_inode;
  129. if (strcmp(name, "") != 0)
  130. return -EINVAL;
  131. if (!inode_owner_or_capable(inode))
  132. return -EPERM;
  133. if (value == NULL)
  134. return -EINVAL;
  135. F2FS_I(inode)->i_advise |= *(char *)value;
  136. return 0;
  137. }
  138. #ifdef CONFIG_F2FS_FS_SECURITY
  139. static int f2fs_initxattrs(struct inode *inode, const struct xattr *xattr_array,
  140. void *page)
  141. {
  142. const struct xattr *xattr;
  143. int err = 0;
  144. for (xattr = xattr_array; xattr->name != NULL; xattr++) {
  145. err = f2fs_setxattr(inode, F2FS_XATTR_INDEX_SECURITY,
  146. xattr->name, xattr->value,
  147. xattr->value_len, (struct page *)page);
  148. if (err < 0)
  149. break;
  150. }
  151. return err;
  152. }
  153. int f2fs_init_security(struct inode *inode, struct inode *dir,
  154. const struct qstr *qstr, struct page *ipage)
  155. {
  156. return security_inode_init_security(inode, dir, qstr,
  157. &f2fs_initxattrs, ipage);
  158. }
  159. #endif
  160. const struct xattr_handler f2fs_xattr_user_handler = {
  161. .prefix = XATTR_USER_PREFIX,
  162. .flags = F2FS_XATTR_INDEX_USER,
  163. .list = f2fs_xattr_generic_list,
  164. .get = f2fs_xattr_generic_get,
  165. .set = f2fs_xattr_generic_set,
  166. };
  167. const struct xattr_handler f2fs_xattr_trusted_handler = {
  168. .prefix = XATTR_TRUSTED_PREFIX,
  169. .flags = F2FS_XATTR_INDEX_TRUSTED,
  170. .list = f2fs_xattr_generic_list,
  171. .get = f2fs_xattr_generic_get,
  172. .set = f2fs_xattr_generic_set,
  173. };
  174. const struct xattr_handler f2fs_xattr_advise_handler = {
  175. .prefix = F2FS_SYSTEM_ADVISE_PREFIX,
  176. .flags = F2FS_XATTR_INDEX_ADVISE,
  177. .list = f2fs_xattr_advise_list,
  178. .get = f2fs_xattr_advise_get,
  179. .set = f2fs_xattr_advise_set,
  180. };
  181. const struct xattr_handler f2fs_xattr_security_handler = {
  182. .prefix = XATTR_SECURITY_PREFIX,
  183. .flags = F2FS_XATTR_INDEX_SECURITY,
  184. .list = f2fs_xattr_generic_list,
  185. .get = f2fs_xattr_generic_get,
  186. .set = f2fs_xattr_generic_set,
  187. };
  188. static const struct xattr_handler *f2fs_xattr_handler_map[] = {
  189. [F2FS_XATTR_INDEX_USER] = &f2fs_xattr_user_handler,
  190. #ifdef CONFIG_F2FS_FS_POSIX_ACL
  191. [F2FS_XATTR_INDEX_POSIX_ACL_ACCESS] = &f2fs_xattr_acl_access_handler,
  192. [F2FS_XATTR_INDEX_POSIX_ACL_DEFAULT] = &f2fs_xattr_acl_default_handler,
  193. #endif
  194. [F2FS_XATTR_INDEX_TRUSTED] = &f2fs_xattr_trusted_handler,
  195. #ifdef CONFIG_F2FS_FS_SECURITY
  196. [F2FS_XATTR_INDEX_SECURITY] = &f2fs_xattr_security_handler,
  197. #endif
  198. [F2FS_XATTR_INDEX_ADVISE] = &f2fs_xattr_advise_handler,
  199. };
  200. const struct xattr_handler *f2fs_xattr_handlers[] = {
  201. &f2fs_xattr_user_handler,
  202. #ifdef CONFIG_F2FS_FS_POSIX_ACL
  203. &f2fs_xattr_acl_access_handler,
  204. &f2fs_xattr_acl_default_handler,
  205. #endif
  206. &f2fs_xattr_trusted_handler,
  207. #ifdef CONFIG_F2FS_FS_SECURITY
  208. &f2fs_xattr_security_handler,
  209. #endif
  210. &f2fs_xattr_advise_handler,
  211. NULL,
  212. };
  213. static inline const struct xattr_handler *f2fs_xattr_handler(int name_index)
  214. {
  215. const struct xattr_handler *handler = NULL;
  216. if (name_index > 0 && name_index < ARRAY_SIZE(f2fs_xattr_handler_map))
  217. handler = f2fs_xattr_handler_map[name_index];
  218. return handler;
  219. }
  220. int f2fs_getxattr(struct inode *inode, int name_index, const char *name,
  221. void *buffer, size_t buffer_size)
  222. {
  223. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  224. struct f2fs_inode_info *fi = F2FS_I(inode);
  225. struct f2fs_xattr_entry *entry;
  226. struct page *page;
  227. void *base_addr;
  228. int error = 0, found = 0;
  229. size_t value_len, name_len;
  230. if (name == NULL)
  231. return -EINVAL;
  232. name_len = strlen(name);
  233. if (!fi->i_xattr_nid)
  234. return -ENODATA;
  235. page = get_node_page(sbi, fi->i_xattr_nid);
  236. if (IS_ERR(page))
  237. return PTR_ERR(page);
  238. base_addr = page_address(page);
  239. list_for_each_xattr(entry, base_addr) {
  240. if (entry->e_name_index != name_index)
  241. continue;
  242. if (entry->e_name_len != name_len)
  243. continue;
  244. if (!memcmp(entry->e_name, name, name_len)) {
  245. found = 1;
  246. break;
  247. }
  248. }
  249. if (!found) {
  250. error = -ENODATA;
  251. goto cleanup;
  252. }
  253. value_len = le16_to_cpu(entry->e_value_size);
  254. if (buffer && value_len > buffer_size) {
  255. error = -ERANGE;
  256. goto cleanup;
  257. }
  258. if (buffer) {
  259. char *pval = entry->e_name + entry->e_name_len;
  260. memcpy(buffer, pval, value_len);
  261. }
  262. error = value_len;
  263. cleanup:
  264. f2fs_put_page(page, 1);
  265. return error;
  266. }
  267. ssize_t f2fs_listxattr(struct dentry *dentry, char *buffer, size_t buffer_size)
  268. {
  269. struct inode *inode = dentry->d_inode;
  270. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  271. struct f2fs_inode_info *fi = F2FS_I(inode);
  272. struct f2fs_xattr_entry *entry;
  273. struct page *page;
  274. void *base_addr;
  275. int error = 0;
  276. size_t rest = buffer_size;
  277. if (!fi->i_xattr_nid)
  278. return 0;
  279. page = get_node_page(sbi, fi->i_xattr_nid);
  280. if (IS_ERR(page))
  281. return PTR_ERR(page);
  282. base_addr = page_address(page);
  283. list_for_each_xattr(entry, base_addr) {
  284. const struct xattr_handler *handler =
  285. f2fs_xattr_handler(entry->e_name_index);
  286. size_t size;
  287. if (!handler)
  288. continue;
  289. size = handler->list(dentry, buffer, rest, entry->e_name,
  290. entry->e_name_len, handler->flags);
  291. if (buffer && size > rest) {
  292. error = -ERANGE;
  293. goto cleanup;
  294. }
  295. if (buffer)
  296. buffer += size;
  297. rest -= size;
  298. }
  299. error = buffer_size - rest;
  300. cleanup:
  301. f2fs_put_page(page, 1);
  302. return error;
  303. }
  304. int f2fs_setxattr(struct inode *inode, int name_index, const char *name,
  305. const void *value, size_t value_len, struct page *ipage)
  306. {
  307. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  308. struct f2fs_inode_info *fi = F2FS_I(inode);
  309. struct f2fs_xattr_header *header = NULL;
  310. struct f2fs_xattr_entry *here, *last;
  311. struct page *page;
  312. void *base_addr;
  313. int error, found, free, newsize;
  314. size_t name_len;
  315. char *pval;
  316. int ilock;
  317. if (name == NULL)
  318. return -EINVAL;
  319. if (value == NULL)
  320. value_len = 0;
  321. name_len = strlen(name);
  322. if (name_len > F2FS_NAME_LEN || value_len > MAX_VALUE_LEN)
  323. return -ERANGE;
  324. f2fs_balance_fs(sbi);
  325. ilock = mutex_lock_op(sbi);
  326. if (!fi->i_xattr_nid) {
  327. /* Allocate new attribute block */
  328. struct dnode_of_data dn;
  329. if (!alloc_nid(sbi, &fi->i_xattr_nid)) {
  330. error = -ENOSPC;
  331. goto exit;
  332. }
  333. set_new_dnode(&dn, inode, NULL, NULL, fi->i_xattr_nid);
  334. mark_inode_dirty(inode);
  335. page = new_node_page(&dn, XATTR_NODE_OFFSET, ipage);
  336. if (IS_ERR(page)) {
  337. alloc_nid_failed(sbi, fi->i_xattr_nid);
  338. fi->i_xattr_nid = 0;
  339. error = PTR_ERR(page);
  340. goto exit;
  341. }
  342. alloc_nid_done(sbi, fi->i_xattr_nid);
  343. base_addr = page_address(page);
  344. header = XATTR_HDR(base_addr);
  345. header->h_magic = cpu_to_le32(F2FS_XATTR_MAGIC);
  346. header->h_refcount = cpu_to_le32(1);
  347. } else {
  348. /* The inode already has an extended attribute block. */
  349. page = get_node_page(sbi, fi->i_xattr_nid);
  350. if (IS_ERR(page)) {
  351. error = PTR_ERR(page);
  352. goto exit;
  353. }
  354. base_addr = page_address(page);
  355. header = XATTR_HDR(base_addr);
  356. }
  357. if (le32_to_cpu(header->h_magic) != F2FS_XATTR_MAGIC) {
  358. error = -EIO;
  359. goto cleanup;
  360. }
  361. /* find entry with wanted name. */
  362. found = 0;
  363. list_for_each_xattr(here, base_addr) {
  364. if (here->e_name_index != name_index)
  365. continue;
  366. if (here->e_name_len != name_len)
  367. continue;
  368. if (!memcmp(here->e_name, name, name_len)) {
  369. found = 1;
  370. break;
  371. }
  372. }
  373. last = here;
  374. while (!IS_XATTR_LAST_ENTRY(last))
  375. last = XATTR_NEXT_ENTRY(last);
  376. newsize = XATTR_ALIGN(sizeof(struct f2fs_xattr_entry) +
  377. name_len + value_len);
  378. /* 1. Check space */
  379. if (value) {
  380. /* If value is NULL, it is remove operation.
  381. * In case of update operation, we caculate free.
  382. */
  383. free = MIN_OFFSET - ((char *)last - (char *)header);
  384. if (found)
  385. free = free - ENTRY_SIZE(here);
  386. if (free < newsize) {
  387. error = -ENOSPC;
  388. goto cleanup;
  389. }
  390. }
  391. /* 2. Remove old entry */
  392. if (found) {
  393. /* If entry is found, remove old entry.
  394. * If not found, remove operation is not needed.
  395. */
  396. struct f2fs_xattr_entry *next = XATTR_NEXT_ENTRY(here);
  397. int oldsize = ENTRY_SIZE(here);
  398. memmove(here, next, (char *)last - (char *)next);
  399. last = (struct f2fs_xattr_entry *)((char *)last - oldsize);
  400. memset(last, 0, oldsize);
  401. }
  402. /* 3. Write new entry */
  403. if (value) {
  404. /* Before we come here, old entry is removed.
  405. * We just write new entry. */
  406. memset(last, 0, newsize);
  407. last->e_name_index = name_index;
  408. last->e_name_len = name_len;
  409. memcpy(last->e_name, name, name_len);
  410. pval = last->e_name + name_len;
  411. memcpy(pval, value, value_len);
  412. last->e_value_size = cpu_to_le16(value_len);
  413. }
  414. set_page_dirty(page);
  415. f2fs_put_page(page, 1);
  416. if (is_inode_flag_set(fi, FI_ACL_MODE)) {
  417. inode->i_mode = fi->i_acl_mode;
  418. inode->i_ctime = CURRENT_TIME;
  419. clear_inode_flag(fi, FI_ACL_MODE);
  420. }
  421. if (ipage)
  422. update_inode(inode, ipage);
  423. else
  424. update_inode_page(inode);
  425. mutex_unlock_op(sbi, ilock);
  426. return 0;
  427. cleanup:
  428. f2fs_put_page(page, 1);
  429. exit:
  430. mutex_unlock_op(sbi, ilock);
  431. return error;
  432. }