diff options
Diffstat (limited to 'fs/ocfs2/xattr.c')
-rw-r--r-- | fs/ocfs2/xattr.c | 2182 |
1 files changed, 1179 insertions, 1003 deletions
diff --git a/fs/ocfs2/xattr.c b/fs/ocfs2/xattr.c index 8fc6fb071c6d..d1b0d386f6d1 100644 --- a/fs/ocfs2/xattr.c +++ b/fs/ocfs2/xattr.c | |||
@@ -116,10 +116,11 @@ static struct xattr_handler *ocfs2_xattr_handler_map[OCFS2_XATTR_MAX] = { | |||
116 | }; | 116 | }; |
117 | 117 | ||
118 | struct ocfs2_xattr_info { | 118 | struct ocfs2_xattr_info { |
119 | int name_index; | 119 | int xi_name_index; |
120 | const char *name; | 120 | const char *xi_name; |
121 | const void *value; | 121 | int xi_name_len; |
122 | size_t value_len; | 122 | const void *xi_value; |
123 | size_t xi_value_len; | ||
123 | }; | 124 | }; |
124 | 125 | ||
125 | struct ocfs2_xattr_search { | 126 | struct ocfs2_xattr_search { |
@@ -137,6 +138,115 @@ struct ocfs2_xattr_search { | |||
137 | int not_found; | 138 | int not_found; |
138 | }; | 139 | }; |
139 | 140 | ||
141 | /* Operations on struct ocfs2_xa_entry */ | ||
142 | struct ocfs2_xa_loc; | ||
143 | struct ocfs2_xa_loc_operations { | ||
144 | /* | ||
145 | * Journal functions | ||
146 | */ | ||
147 | int (*xlo_journal_access)(handle_t *handle, struct ocfs2_xa_loc *loc, | ||
148 | int type); | ||
149 | void (*xlo_journal_dirty)(handle_t *handle, struct ocfs2_xa_loc *loc); | ||
150 | |||
151 | /* | ||
152 | * Return a pointer to the appropriate buffer in loc->xl_storage | ||
153 | * at the given offset from loc->xl_header. | ||
154 | */ | ||
155 | void *(*xlo_offset_pointer)(struct ocfs2_xa_loc *loc, int offset); | ||
156 | |||
157 | /* Can we reuse the existing entry for the new value? */ | ||
158 | int (*xlo_can_reuse)(struct ocfs2_xa_loc *loc, | ||
159 | struct ocfs2_xattr_info *xi); | ||
160 | |||
161 | /* How much space is needed for the new value? */ | ||
162 | int (*xlo_check_space)(struct ocfs2_xa_loc *loc, | ||
163 | struct ocfs2_xattr_info *xi); | ||
164 | |||
165 | /* | ||
166 | * Return the offset of the first name+value pair. This is | ||
167 | * the start of our downward-filling free space. | ||
168 | */ | ||
169 | int (*xlo_get_free_start)(struct ocfs2_xa_loc *loc); | ||
170 | |||
171 | /* | ||
172 | * Remove the name+value at this location. Do whatever is | ||
173 | * appropriate with the remaining name+value pairs. | ||
174 | */ | ||
175 | void (*xlo_wipe_namevalue)(struct ocfs2_xa_loc *loc); | ||
176 | |||
177 | /* Fill xl_entry with a new entry */ | ||
178 | void (*xlo_add_entry)(struct ocfs2_xa_loc *loc, u32 name_hash); | ||
179 | |||
180 | /* Add name+value storage to an entry */ | ||
181 | void (*xlo_add_namevalue)(struct ocfs2_xa_loc *loc, int size); | ||
182 | |||
183 | /* | ||
184 | * Initialize the value buf's access and bh fields for this entry. | ||
185 | * ocfs2_xa_fill_value_buf() will handle the xv pointer. | ||
186 | */ | ||
187 | void (*xlo_fill_value_buf)(struct ocfs2_xa_loc *loc, | ||
188 | struct ocfs2_xattr_value_buf *vb); | ||
189 | }; | ||
190 | |||
191 | /* | ||
192 | * Describes an xattr entry location. This is a memory structure | ||
193 | * tracking the on-disk structure. | ||
194 | */ | ||
195 | struct ocfs2_xa_loc { | ||
196 | /* This xattr belongs to this inode */ | ||
197 | struct inode *xl_inode; | ||
198 | |||
199 | /* The ocfs2_xattr_header inside the on-disk storage. Not NULL. */ | ||
200 | struct ocfs2_xattr_header *xl_header; | ||
201 | |||
202 | /* Bytes from xl_header to the end of the storage */ | ||
203 | int xl_size; | ||
204 | |||
205 | /* | ||
206 | * The ocfs2_xattr_entry this location describes. If this is | ||
207 | * NULL, this location describes the on-disk structure where it | ||
208 | * would have been. | ||
209 | */ | ||
210 | struct ocfs2_xattr_entry *xl_entry; | ||
211 | |||
212 | /* | ||
213 | * Internal housekeeping | ||
214 | */ | ||
215 | |||
216 | /* Buffer(s) containing this entry */ | ||
217 | void *xl_storage; | ||
218 | |||
219 | /* Operations on the storage backing this location */ | ||
220 | const struct ocfs2_xa_loc_operations *xl_ops; | ||
221 | }; | ||
222 | |||
223 | /* | ||
224 | * Convenience functions to calculate how much space is needed for a | ||
225 | * given name+value pair | ||
226 | */ | ||
227 | static int namevalue_size(int name_len, uint64_t value_len) | ||
228 | { | ||
229 | if (value_len > OCFS2_XATTR_INLINE_SIZE) | ||
230 | return OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_ROOT_SIZE; | ||
231 | else | ||
232 | return OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_SIZE(value_len); | ||
233 | } | ||
234 | |||
235 | static int namevalue_size_xi(struct ocfs2_xattr_info *xi) | ||
236 | { | ||
237 | return namevalue_size(xi->xi_name_len, xi->xi_value_len); | ||
238 | } | ||
239 | |||
240 | static int namevalue_size_xe(struct ocfs2_xattr_entry *xe) | ||
241 | { | ||
242 | u64 value_len = le64_to_cpu(xe->xe_value_size); | ||
243 | |||
244 | BUG_ON((value_len > OCFS2_XATTR_INLINE_SIZE) && | ||
245 | ocfs2_xattr_is_local(xe)); | ||
246 | return namevalue_size(xe->xe_name_len, value_len); | ||
247 | } | ||
248 | |||
249 | |||
140 | static int ocfs2_xattr_bucket_get_name_value(struct super_block *sb, | 250 | static int ocfs2_xattr_bucket_get_name_value(struct super_block *sb, |
141 | struct ocfs2_xattr_header *xh, | 251 | struct ocfs2_xattr_header *xh, |
142 | int index, | 252 | int index, |
@@ -212,14 +322,6 @@ static inline u16 ocfs2_blocks_per_xattr_bucket(struct super_block *sb) | |||
212 | return OCFS2_XATTR_BUCKET_SIZE / (1 << sb->s_blocksize_bits); | 322 | return OCFS2_XATTR_BUCKET_SIZE / (1 << sb->s_blocksize_bits); |
213 | } | 323 | } |
214 | 324 | ||
215 | static inline u16 ocfs2_xattr_max_xe_in_bucket(struct super_block *sb) | ||
216 | { | ||
217 | u16 len = sb->s_blocksize - | ||
218 | offsetof(struct ocfs2_xattr_header, xh_entries); | ||
219 | |||
220 | return len / sizeof(struct ocfs2_xattr_entry); | ||
221 | } | ||
222 | |||
223 | #define bucket_blkno(_b) ((_b)->bu_bhs[0]->b_blocknr) | 325 | #define bucket_blkno(_b) ((_b)->bu_bhs[0]->b_blocknr) |
224 | #define bucket_block(_b, _n) ((_b)->bu_bhs[(_n)]->b_data) | 326 | #define bucket_block(_b, _n) ((_b)->bu_bhs[(_n)]->b_data) |
225 | #define bucket_xh(_b) ((struct ocfs2_xattr_header *)bucket_block((_b), 0)) | 327 | #define bucket_xh(_b) ((struct ocfs2_xattr_header *)bucket_block((_b), 0)) |
@@ -463,35 +565,22 @@ static u32 ocfs2_xattr_name_hash(struct inode *inode, | |||
463 | return hash; | 565 | return hash; |
464 | } | 566 | } |
465 | 567 | ||
466 | /* | 568 | static int ocfs2_xattr_entry_real_size(int name_len, size_t value_len) |
467 | * ocfs2_xattr_hash_entry() | ||
468 | * | ||
469 | * Compute the hash of an extended attribute. | ||
470 | */ | ||
471 | static void ocfs2_xattr_hash_entry(struct inode *inode, | ||
472 | struct ocfs2_xattr_header *header, | ||
473 | struct ocfs2_xattr_entry *entry) | ||
474 | { | 569 | { |
475 | u32 hash = 0; | 570 | return namevalue_size(name_len, value_len) + |
476 | char *name = (char *)header + le16_to_cpu(entry->xe_name_offset); | 571 | sizeof(struct ocfs2_xattr_entry); |
477 | |||
478 | hash = ocfs2_xattr_name_hash(inode, name, entry->xe_name_len); | ||
479 | entry->xe_name_hash = cpu_to_le32(hash); | ||
480 | |||
481 | return; | ||
482 | } | 572 | } |
483 | 573 | ||
484 | static int ocfs2_xattr_entry_real_size(int name_len, size_t value_len) | 574 | static int ocfs2_xi_entry_usage(struct ocfs2_xattr_info *xi) |
485 | { | 575 | { |
486 | int size = 0; | 576 | return namevalue_size_xi(xi) + |
487 | 577 | sizeof(struct ocfs2_xattr_entry); | |
488 | if (value_len <= OCFS2_XATTR_INLINE_SIZE) | 578 | } |
489 | size = OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_SIZE(value_len); | ||
490 | else | ||
491 | size = OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_ROOT_SIZE; | ||
492 | size += sizeof(struct ocfs2_xattr_entry); | ||
493 | 579 | ||
494 | return size; | 580 | static int ocfs2_xe_entry_usage(struct ocfs2_xattr_entry *xe) |
581 | { | ||
582 | return namevalue_size_xe(xe) + | ||
583 | sizeof(struct ocfs2_xattr_entry); | ||
495 | } | 584 | } |
496 | 585 | ||
497 | int ocfs2_calc_security_init(struct inode *dir, | 586 | int ocfs2_calc_security_init(struct inode *dir, |
@@ -1308,452 +1397,897 @@ out: | |||
1308 | return ret; | 1397 | return ret; |
1309 | } | 1398 | } |
1310 | 1399 | ||
1311 | static int ocfs2_xattr_cleanup(struct inode *inode, | 1400 | static int ocfs2_xa_check_space_helper(int needed_space, int free_start, |
1312 | handle_t *handle, | 1401 | int num_entries) |
1313 | struct ocfs2_xattr_info *xi, | ||
1314 | struct ocfs2_xattr_search *xs, | ||
1315 | struct ocfs2_xattr_value_buf *vb, | ||
1316 | size_t offs) | ||
1317 | { | 1402 | { |
1318 | int ret = 0; | 1403 | int free_space; |
1319 | size_t name_len = strlen(xi->name); | ||
1320 | void *val = xs->base + offs; | ||
1321 | size_t size = OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_ROOT_SIZE; | ||
1322 | 1404 | ||
1323 | ret = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh, | 1405 | if (!needed_space) |
1324 | OCFS2_JOURNAL_ACCESS_WRITE); | 1406 | return 0; |
1325 | if (ret) { | ||
1326 | mlog_errno(ret); | ||
1327 | goto out; | ||
1328 | } | ||
1329 | /* Decrease xattr count */ | ||
1330 | le16_add_cpu(&xs->header->xh_count, -1); | ||
1331 | /* Remove the xattr entry and tree root which has already be set*/ | ||
1332 | memset((void *)xs->here, 0, sizeof(struct ocfs2_xattr_entry)); | ||
1333 | memset(val, 0, size); | ||
1334 | 1407 | ||
1335 | ret = ocfs2_journal_dirty(handle, vb->vb_bh); | 1408 | free_space = free_start - |
1336 | if (ret < 0) | 1409 | sizeof(struct ocfs2_xattr_header) - |
1337 | mlog_errno(ret); | 1410 | (num_entries * sizeof(struct ocfs2_xattr_entry)) - |
1338 | out: | 1411 | OCFS2_XATTR_HEADER_GAP; |
1339 | return ret; | 1412 | if (free_space < 0) |
1413 | return -EIO; | ||
1414 | if (free_space < needed_space) | ||
1415 | return -ENOSPC; | ||
1416 | |||
1417 | return 0; | ||
1340 | } | 1418 | } |
1341 | 1419 | ||
1342 | static int ocfs2_xattr_update_entry(struct inode *inode, | 1420 | static int ocfs2_xa_journal_access(handle_t *handle, struct ocfs2_xa_loc *loc, |
1343 | handle_t *handle, | 1421 | int type) |
1344 | struct ocfs2_xattr_info *xi, | ||
1345 | struct ocfs2_xattr_search *xs, | ||
1346 | struct ocfs2_xattr_value_buf *vb, | ||
1347 | size_t offs) | ||
1348 | { | 1422 | { |
1349 | int ret; | 1423 | return loc->xl_ops->xlo_journal_access(handle, loc, type); |
1424 | } | ||
1350 | 1425 | ||
1351 | ret = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh, | 1426 | static void ocfs2_xa_journal_dirty(handle_t *handle, struct ocfs2_xa_loc *loc) |
1352 | OCFS2_JOURNAL_ACCESS_WRITE); | 1427 | { |
1353 | if (ret) { | 1428 | loc->xl_ops->xlo_journal_dirty(handle, loc); |
1354 | mlog_errno(ret); | 1429 | } |
1355 | goto out; | ||
1356 | } | ||
1357 | 1430 | ||
1358 | xs->here->xe_name_offset = cpu_to_le16(offs); | 1431 | /* Give a pointer into the storage for the given offset */ |
1359 | xs->here->xe_value_size = cpu_to_le64(xi->value_len); | 1432 | static void *ocfs2_xa_offset_pointer(struct ocfs2_xa_loc *loc, int offset) |
1360 | if (xi->value_len <= OCFS2_XATTR_INLINE_SIZE) | 1433 | { |
1361 | ocfs2_xattr_set_local(xs->here, 1); | 1434 | BUG_ON(offset >= loc->xl_size); |
1362 | else | 1435 | return loc->xl_ops->xlo_offset_pointer(loc, offset); |
1363 | ocfs2_xattr_set_local(xs->here, 0); | 1436 | } |
1364 | ocfs2_xattr_hash_entry(inode, xs->header, xs->here); | ||
1365 | 1437 | ||
1366 | ret = ocfs2_journal_dirty(handle, vb->vb_bh); | 1438 | /* |
1367 | if (ret < 0) | 1439 | * Wipe the name+value pair and allow the storage to reclaim it. This |
1368 | mlog_errno(ret); | 1440 | * must be followed by either removal of the entry or a call to |
1369 | out: | 1441 | * ocfs2_xa_add_namevalue(). |
1370 | return ret; | 1442 | */ |
1443 | static void ocfs2_xa_wipe_namevalue(struct ocfs2_xa_loc *loc) | ||
1444 | { | ||
1445 | loc->xl_ops->xlo_wipe_namevalue(loc); | ||
1371 | } | 1446 | } |
1372 | 1447 | ||
1373 | /* | 1448 | /* |
1374 | * ocfs2_xattr_set_value_outside() | 1449 | * Find lowest offset to a name+value pair. This is the start of our |
1375 | * | 1450 | * downward-growing free space. |
1376 | * Set large size value in B tree. | ||
1377 | */ | 1451 | */ |
1378 | static int ocfs2_xattr_set_value_outside(struct inode *inode, | 1452 | static int ocfs2_xa_get_free_start(struct ocfs2_xa_loc *loc) |
1379 | struct ocfs2_xattr_info *xi, | ||
1380 | struct ocfs2_xattr_search *xs, | ||
1381 | struct ocfs2_xattr_set_ctxt *ctxt, | ||
1382 | struct ocfs2_xattr_value_buf *vb, | ||
1383 | size_t offs) | ||
1384 | { | 1453 | { |
1385 | size_t name_len = strlen(xi->name); | 1454 | return loc->xl_ops->xlo_get_free_start(loc); |
1386 | void *val = xs->base + offs; | 1455 | } |
1387 | struct ocfs2_xattr_value_root *xv = NULL; | ||
1388 | size_t size = OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_ROOT_SIZE; | ||
1389 | int ret = 0; | ||
1390 | 1456 | ||
1391 | memset(val, 0, size); | 1457 | /* Can we reuse loc->xl_entry for xi? */ |
1392 | memcpy(val, xi->name, name_len); | 1458 | static int ocfs2_xa_can_reuse_entry(struct ocfs2_xa_loc *loc, |
1393 | xv = (struct ocfs2_xattr_value_root *) | 1459 | struct ocfs2_xattr_info *xi) |
1394 | (val + OCFS2_XATTR_SIZE(name_len)); | 1460 | { |
1395 | xv->xr_clusters = 0; | 1461 | return loc->xl_ops->xlo_can_reuse(loc, xi); |
1396 | xv->xr_last_eb_blk = 0; | 1462 | } |
1397 | xv->xr_list.l_tree_depth = 0; | 1463 | |
1398 | xv->xr_list.l_count = cpu_to_le16(1); | 1464 | /* How much free space is needed to set the new value */ |
1399 | xv->xr_list.l_next_free_rec = 0; | 1465 | static int ocfs2_xa_check_space(struct ocfs2_xa_loc *loc, |
1400 | vb->vb_xv = xv; | 1466 | struct ocfs2_xattr_info *xi) |
1401 | 1467 | { | |
1402 | ret = ocfs2_xattr_value_truncate(inode, vb, xi->value_len, ctxt); | 1468 | return loc->xl_ops->xlo_check_space(loc, xi); |
1403 | if (ret < 0) { | 1469 | } |
1404 | mlog_errno(ret); | 1470 | |
1405 | return ret; | 1471 | static void ocfs2_xa_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash) |
1472 | { | ||
1473 | loc->xl_ops->xlo_add_entry(loc, name_hash); | ||
1474 | loc->xl_entry->xe_name_hash = cpu_to_le32(name_hash); | ||
1475 | /* | ||
1476 | * We can't leave the new entry's xe_name_offset at zero or | ||
1477 | * add_namevalue() will go nuts. We set it to the size of our | ||
1478 | * storage so that it can never be less than any other entry. | ||
1479 | */ | ||
1480 | loc->xl_entry->xe_name_offset = cpu_to_le16(loc->xl_size); | ||
1481 | } | ||
1482 | |||
1483 | static void ocfs2_xa_add_namevalue(struct ocfs2_xa_loc *loc, | ||
1484 | struct ocfs2_xattr_info *xi) | ||
1485 | { | ||
1486 | int size = namevalue_size_xi(xi); | ||
1487 | int nameval_offset; | ||
1488 | char *nameval_buf; | ||
1489 | |||
1490 | loc->xl_ops->xlo_add_namevalue(loc, size); | ||
1491 | loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len); | ||
1492 | loc->xl_entry->xe_name_len = xi->xi_name_len; | ||
1493 | ocfs2_xattr_set_type(loc->xl_entry, xi->xi_name_index); | ||
1494 | ocfs2_xattr_set_local(loc->xl_entry, | ||
1495 | xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE); | ||
1496 | |||
1497 | nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset); | ||
1498 | nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset); | ||
1499 | memset(nameval_buf, 0, size); | ||
1500 | memcpy(nameval_buf, xi->xi_name, xi->xi_name_len); | ||
1501 | } | ||
1502 | |||
1503 | static void ocfs2_xa_fill_value_buf(struct ocfs2_xa_loc *loc, | ||
1504 | struct ocfs2_xattr_value_buf *vb) | ||
1505 | { | ||
1506 | int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset); | ||
1507 | int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len); | ||
1508 | |||
1509 | /* Value bufs are for value trees */ | ||
1510 | BUG_ON(ocfs2_xattr_is_local(loc->xl_entry)); | ||
1511 | BUG_ON(namevalue_size_xe(loc->xl_entry) != | ||
1512 | (name_size + OCFS2_XATTR_ROOT_SIZE)); | ||
1513 | |||
1514 | loc->xl_ops->xlo_fill_value_buf(loc, vb); | ||
1515 | vb->vb_xv = | ||
1516 | (struct ocfs2_xattr_value_root *)ocfs2_xa_offset_pointer(loc, | ||
1517 | nameval_offset + | ||
1518 | name_size); | ||
1519 | } | ||
1520 | |||
1521 | static int ocfs2_xa_block_journal_access(handle_t *handle, | ||
1522 | struct ocfs2_xa_loc *loc, int type) | ||
1523 | { | ||
1524 | struct buffer_head *bh = loc->xl_storage; | ||
1525 | ocfs2_journal_access_func access; | ||
1526 | |||
1527 | if (loc->xl_size == (bh->b_size - | ||
1528 | offsetof(struct ocfs2_xattr_block, | ||
1529 | xb_attrs.xb_header))) | ||
1530 | access = ocfs2_journal_access_xb; | ||
1531 | else | ||
1532 | access = ocfs2_journal_access_di; | ||
1533 | return access(handle, INODE_CACHE(loc->xl_inode), bh, type); | ||
1534 | } | ||
1535 | |||
1536 | static void ocfs2_xa_block_journal_dirty(handle_t *handle, | ||
1537 | struct ocfs2_xa_loc *loc) | ||
1538 | { | ||
1539 | struct buffer_head *bh = loc->xl_storage; | ||
1540 | |||
1541 | ocfs2_journal_dirty(handle, bh); | ||
1542 | } | ||
1543 | |||
1544 | static void *ocfs2_xa_block_offset_pointer(struct ocfs2_xa_loc *loc, | ||
1545 | int offset) | ||
1546 | { | ||
1547 | return (char *)loc->xl_header + offset; | ||
1548 | } | ||
1549 | |||
1550 | static int ocfs2_xa_block_can_reuse(struct ocfs2_xa_loc *loc, | ||
1551 | struct ocfs2_xattr_info *xi) | ||
1552 | { | ||
1553 | /* | ||
1554 | * Block storage is strict. If the sizes aren't exact, we will | ||
1555 | * remove the old one and reinsert the new. | ||
1556 | */ | ||
1557 | return namevalue_size_xe(loc->xl_entry) == | ||
1558 | namevalue_size_xi(xi); | ||
1559 | } | ||
1560 | |||
1561 | static int ocfs2_xa_block_get_free_start(struct ocfs2_xa_loc *loc) | ||
1562 | { | ||
1563 | struct ocfs2_xattr_header *xh = loc->xl_header; | ||
1564 | int i, count = le16_to_cpu(xh->xh_count); | ||
1565 | int offset, free_start = loc->xl_size; | ||
1566 | |||
1567 | for (i = 0; i < count; i++) { | ||
1568 | offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset); | ||
1569 | if (offset < free_start) | ||
1570 | free_start = offset; | ||
1406 | } | 1571 | } |
1407 | ret = ocfs2_xattr_update_entry(inode, ctxt->handle, xi, xs, vb, offs); | 1572 | |
1408 | if (ret < 0) { | 1573 | return free_start; |
1409 | mlog_errno(ret); | 1574 | } |
1410 | return ret; | 1575 | |
1576 | static int ocfs2_xa_block_check_space(struct ocfs2_xa_loc *loc, | ||
1577 | struct ocfs2_xattr_info *xi) | ||
1578 | { | ||
1579 | int count = le16_to_cpu(loc->xl_header->xh_count); | ||
1580 | int free_start = ocfs2_xa_get_free_start(loc); | ||
1581 | int needed_space = ocfs2_xi_entry_usage(xi); | ||
1582 | |||
1583 | /* | ||
1584 | * Block storage will reclaim the original entry before inserting | ||
1585 | * the new value, so we only need the difference. If the new | ||
1586 | * entry is smaller than the old one, we don't need anything. | ||
1587 | */ | ||
1588 | if (loc->xl_entry) { | ||
1589 | /* Don't need space if we're reusing! */ | ||
1590 | if (ocfs2_xa_can_reuse_entry(loc, xi)) | ||
1591 | needed_space = 0; | ||
1592 | else | ||
1593 | needed_space -= ocfs2_xe_entry_usage(loc->xl_entry); | ||
1411 | } | 1594 | } |
1412 | ret = __ocfs2_xattr_set_value_outside(inode, ctxt->handle, vb, | 1595 | if (needed_space < 0) |
1413 | xi->value, xi->value_len); | 1596 | needed_space = 0; |
1414 | if (ret < 0) | 1597 | return ocfs2_xa_check_space_helper(needed_space, free_start, count); |
1415 | mlog_errno(ret); | 1598 | } |
1416 | 1599 | ||
1417 | return ret; | 1600 | /* |
1601 | * Block storage for xattrs keeps the name+value pairs compacted. When | ||
1602 | * we remove one, we have to shift any that preceded it towards the end. | ||
1603 | */ | ||
1604 | static void ocfs2_xa_block_wipe_namevalue(struct ocfs2_xa_loc *loc) | ||
1605 | { | ||
1606 | int i, offset; | ||
1607 | int namevalue_offset, first_namevalue_offset, namevalue_size; | ||
1608 | struct ocfs2_xattr_entry *entry = loc->xl_entry; | ||
1609 | struct ocfs2_xattr_header *xh = loc->xl_header; | ||
1610 | int count = le16_to_cpu(xh->xh_count); | ||
1611 | |||
1612 | namevalue_offset = le16_to_cpu(entry->xe_name_offset); | ||
1613 | namevalue_size = namevalue_size_xe(entry); | ||
1614 | first_namevalue_offset = ocfs2_xa_get_free_start(loc); | ||
1615 | |||
1616 | /* Shift the name+value pairs */ | ||
1617 | memmove((char *)xh + first_namevalue_offset + namevalue_size, | ||
1618 | (char *)xh + first_namevalue_offset, | ||
1619 | namevalue_offset - first_namevalue_offset); | ||
1620 | memset((char *)xh + first_namevalue_offset, 0, namevalue_size); | ||
1621 | |||
1622 | /* Now tell xh->xh_entries about it */ | ||
1623 | for (i = 0; i < count; i++) { | ||
1624 | offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset); | ||
1625 | if (offset < namevalue_offset) | ||
1626 | le16_add_cpu(&xh->xh_entries[i].xe_name_offset, | ||
1627 | namevalue_size); | ||
1628 | } | ||
1629 | |||
1630 | /* | ||
1631 | * Note that we don't update xh_free_start or xh_name_value_len | ||
1632 | * because they're not used in block-stored xattrs. | ||
1633 | */ | ||
1634 | } | ||
1635 | |||
1636 | static void ocfs2_xa_block_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash) | ||
1637 | { | ||
1638 | int count = le16_to_cpu(loc->xl_header->xh_count); | ||
1639 | loc->xl_entry = &(loc->xl_header->xh_entries[count]); | ||
1640 | le16_add_cpu(&loc->xl_header->xh_count, 1); | ||
1641 | memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry)); | ||
1642 | } | ||
1643 | |||
1644 | static void ocfs2_xa_block_add_namevalue(struct ocfs2_xa_loc *loc, int size) | ||
1645 | { | ||
1646 | int free_start = ocfs2_xa_get_free_start(loc); | ||
1647 | |||
1648 | loc->xl_entry->xe_name_offset = cpu_to_le16(free_start - size); | ||
1649 | } | ||
1650 | |||
1651 | static void ocfs2_xa_block_fill_value_buf(struct ocfs2_xa_loc *loc, | ||
1652 | struct ocfs2_xattr_value_buf *vb) | ||
1653 | { | ||
1654 | struct buffer_head *bh = loc->xl_storage; | ||
1655 | |||
1656 | if (loc->xl_size == (bh->b_size - | ||
1657 | offsetof(struct ocfs2_xattr_block, | ||
1658 | xb_attrs.xb_header))) | ||
1659 | vb->vb_access = ocfs2_journal_access_xb; | ||
1660 | else | ||
1661 | vb->vb_access = ocfs2_journal_access_di; | ||
1662 | vb->vb_bh = bh; | ||
1418 | } | 1663 | } |
1419 | 1664 | ||
1420 | /* | 1665 | /* |
1421 | * ocfs2_xattr_set_entry_local() | 1666 | * Operations for xattrs stored in blocks. This includes inline inode |
1422 | * | 1667 | * storage and unindexed ocfs2_xattr_blocks. |
1423 | * Set, replace or remove extended attribute in local. | ||
1424 | */ | 1668 | */ |
1425 | static void ocfs2_xattr_set_entry_local(struct inode *inode, | 1669 | static const struct ocfs2_xa_loc_operations ocfs2_xa_block_loc_ops = { |
1426 | struct ocfs2_xattr_info *xi, | 1670 | .xlo_journal_access = ocfs2_xa_block_journal_access, |
1427 | struct ocfs2_xattr_search *xs, | 1671 | .xlo_journal_dirty = ocfs2_xa_block_journal_dirty, |
1428 | struct ocfs2_xattr_entry *last, | 1672 | .xlo_offset_pointer = ocfs2_xa_block_offset_pointer, |
1429 | size_t min_offs) | 1673 | .xlo_check_space = ocfs2_xa_block_check_space, |
1674 | .xlo_can_reuse = ocfs2_xa_block_can_reuse, | ||
1675 | .xlo_get_free_start = ocfs2_xa_block_get_free_start, | ||
1676 | .xlo_wipe_namevalue = ocfs2_xa_block_wipe_namevalue, | ||
1677 | .xlo_add_entry = ocfs2_xa_block_add_entry, | ||
1678 | .xlo_add_namevalue = ocfs2_xa_block_add_namevalue, | ||
1679 | .xlo_fill_value_buf = ocfs2_xa_block_fill_value_buf, | ||
1680 | }; | ||
1681 | |||
1682 | static int ocfs2_xa_bucket_journal_access(handle_t *handle, | ||
1683 | struct ocfs2_xa_loc *loc, int type) | ||
1430 | { | 1684 | { |
1431 | size_t name_len = strlen(xi->name); | 1685 | struct ocfs2_xattr_bucket *bucket = loc->xl_storage; |
1432 | int i; | ||
1433 | 1686 | ||
1434 | if (xi->value && xs->not_found) { | 1687 | return ocfs2_xattr_bucket_journal_access(handle, bucket, type); |
1435 | /* Insert the new xattr entry. */ | 1688 | } |
1436 | le16_add_cpu(&xs->header->xh_count, 1); | 1689 | |
1437 | ocfs2_xattr_set_type(last, xi->name_index); | 1690 | static void ocfs2_xa_bucket_journal_dirty(handle_t *handle, |
1438 | ocfs2_xattr_set_local(last, 1); | 1691 | struct ocfs2_xa_loc *loc) |
1439 | last->xe_name_len = name_len; | 1692 | { |
1440 | } else { | 1693 | struct ocfs2_xattr_bucket *bucket = loc->xl_storage; |
1441 | void *first_val; | 1694 | |
1442 | void *val; | 1695 | ocfs2_xattr_bucket_journal_dirty(handle, bucket); |
1443 | size_t offs, size; | 1696 | } |
1444 | 1697 | ||
1445 | first_val = xs->base + min_offs; | 1698 | static void *ocfs2_xa_bucket_offset_pointer(struct ocfs2_xa_loc *loc, |
1446 | offs = le16_to_cpu(xs->here->xe_name_offset); | 1699 | int offset) |
1447 | val = xs->base + offs; | 1700 | { |
1448 | 1701 | struct ocfs2_xattr_bucket *bucket = loc->xl_storage; | |
1449 | if (le64_to_cpu(xs->here->xe_value_size) > | 1702 | int block, block_offset; |
1450 | OCFS2_XATTR_INLINE_SIZE) | 1703 | |
1451 | size = OCFS2_XATTR_SIZE(name_len) + | 1704 | /* The header is at the front of the bucket */ |
1452 | OCFS2_XATTR_ROOT_SIZE; | 1705 | block = offset >> loc->xl_inode->i_sb->s_blocksize_bits; |
1706 | block_offset = offset % loc->xl_inode->i_sb->s_blocksize; | ||
1707 | |||
1708 | return bucket_block(bucket, block) + block_offset; | ||
1709 | } | ||
1710 | |||
1711 | static int ocfs2_xa_bucket_can_reuse(struct ocfs2_xa_loc *loc, | ||
1712 | struct ocfs2_xattr_info *xi) | ||
1713 | { | ||
1714 | return namevalue_size_xe(loc->xl_entry) >= | ||
1715 | namevalue_size_xi(xi); | ||
1716 | } | ||
1717 | |||
1718 | static int ocfs2_xa_bucket_get_free_start(struct ocfs2_xa_loc *loc) | ||
1719 | { | ||
1720 | struct ocfs2_xattr_bucket *bucket = loc->xl_storage; | ||
1721 | return le16_to_cpu(bucket_xh(bucket)->xh_free_start); | ||
1722 | } | ||
1723 | |||
1724 | static int ocfs2_bucket_align_free_start(struct super_block *sb, | ||
1725 | int free_start, int size) | ||
1726 | { | ||
1727 | /* | ||
1728 | * We need to make sure that the name+value pair fits within | ||
1729 | * one block. | ||
1730 | */ | ||
1731 | if (((free_start - size) >> sb->s_blocksize_bits) != | ||
1732 | ((free_start - 1) >> sb->s_blocksize_bits)) | ||
1733 | free_start -= free_start % sb->s_blocksize; | ||
1734 | |||
1735 | return free_start; | ||
1736 | } | ||
1737 | |||
1738 | static int ocfs2_xa_bucket_check_space(struct ocfs2_xa_loc *loc, | ||
1739 | struct ocfs2_xattr_info *xi) | ||
1740 | { | ||
1741 | int rc; | ||
1742 | int count = le16_to_cpu(loc->xl_header->xh_count); | ||
1743 | int free_start = ocfs2_xa_get_free_start(loc); | ||
1744 | int needed_space = ocfs2_xi_entry_usage(xi); | ||
1745 | int size = namevalue_size_xi(xi); | ||
1746 | struct super_block *sb = loc->xl_inode->i_sb; | ||
1747 | |||
1748 | /* | ||
1749 | * Bucket storage does not reclaim name+value pairs it cannot | ||
1750 | * reuse. They live as holes until the bucket fills, and then | ||
1751 | * the bucket is defragmented. However, the bucket can reclaim | ||
1752 | * the ocfs2_xattr_entry. | ||
1753 | */ | ||
1754 | if (loc->xl_entry) { | ||
1755 | /* Don't need space if we're reusing! */ | ||
1756 | if (ocfs2_xa_can_reuse_entry(loc, xi)) | ||
1757 | needed_space = 0; | ||
1453 | else | 1758 | else |
1454 | size = OCFS2_XATTR_SIZE(name_len) + | 1759 | needed_space -= sizeof(struct ocfs2_xattr_entry); |
1455 | OCFS2_XATTR_SIZE(le64_to_cpu(xs->here->xe_value_size)); | 1760 | } |
1456 | 1761 | BUG_ON(needed_space < 0); | |
1457 | if (xi->value && size == OCFS2_XATTR_SIZE(name_len) + | ||
1458 | OCFS2_XATTR_SIZE(xi->value_len)) { | ||
1459 | /* The old and the new value have the | ||
1460 | same size. Just replace the value. */ | ||
1461 | ocfs2_xattr_set_local(xs->here, 1); | ||
1462 | xs->here->xe_value_size = cpu_to_le64(xi->value_len); | ||
1463 | /* Clear value bytes. */ | ||
1464 | memset(val + OCFS2_XATTR_SIZE(name_len), | ||
1465 | 0, | ||
1466 | OCFS2_XATTR_SIZE(xi->value_len)); | ||
1467 | memcpy(val + OCFS2_XATTR_SIZE(name_len), | ||
1468 | xi->value, | ||
1469 | xi->value_len); | ||
1470 | return; | ||
1471 | } | ||
1472 | /* Remove the old name+value. */ | ||
1473 | memmove(first_val + size, first_val, val - first_val); | ||
1474 | memset(first_val, 0, size); | ||
1475 | xs->here->xe_name_hash = 0; | ||
1476 | xs->here->xe_name_offset = 0; | ||
1477 | ocfs2_xattr_set_local(xs->here, 1); | ||
1478 | xs->here->xe_value_size = 0; | ||
1479 | |||
1480 | min_offs += size; | ||
1481 | |||
1482 | /* Adjust all value offsets. */ | ||
1483 | last = xs->header->xh_entries; | ||
1484 | for (i = 0 ; i < le16_to_cpu(xs->header->xh_count); i++) { | ||
1485 | size_t o = le16_to_cpu(last->xe_name_offset); | ||
1486 | |||
1487 | if (o < offs) | ||
1488 | last->xe_name_offset = cpu_to_le16(o + size); | ||
1489 | last += 1; | ||
1490 | } | ||
1491 | 1762 | ||
1492 | if (!xi->value) { | 1763 | if (free_start < size) { |
1493 | /* Remove the old entry. */ | 1764 | if (needed_space) |
1494 | last -= 1; | 1765 | return -ENOSPC; |
1495 | memmove(xs->here, xs->here + 1, | 1766 | } else { |
1496 | (void *)last - (void *)xs->here); | 1767 | /* |
1497 | memset(last, 0, sizeof(struct ocfs2_xattr_entry)); | 1768 | * First we check if it would fit in the first place. |
1498 | le16_add_cpu(&xs->header->xh_count, -1); | 1769 | * Below, we align the free start to a block. This may |
1499 | } | 1770 | * slide us below the minimum gap. By checking unaligned |
1771 | * first, we avoid that error. | ||
1772 | */ | ||
1773 | rc = ocfs2_xa_check_space_helper(needed_space, free_start, | ||
1774 | count); | ||
1775 | if (rc) | ||
1776 | return rc; | ||
1777 | free_start = ocfs2_bucket_align_free_start(sb, free_start, | ||
1778 | size); | ||
1500 | } | 1779 | } |
1501 | if (xi->value) { | 1780 | return ocfs2_xa_check_space_helper(needed_space, free_start, count); |
1502 | /* Insert the new name+value. */ | 1781 | } |
1503 | size_t size = OCFS2_XATTR_SIZE(name_len) + | 1782 | |
1504 | OCFS2_XATTR_SIZE(xi->value_len); | 1783 | static void ocfs2_xa_bucket_wipe_namevalue(struct ocfs2_xa_loc *loc) |
1505 | void *val = xs->base + min_offs - size; | 1784 | { |
1785 | le16_add_cpu(&loc->xl_header->xh_name_value_len, | ||
1786 | -namevalue_size_xe(loc->xl_entry)); | ||
1787 | } | ||
1506 | 1788 | ||
1507 | xs->here->xe_name_offset = cpu_to_le16(min_offs - size); | 1789 | static void ocfs2_xa_bucket_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash) |
1508 | memset(val, 0, size); | 1790 | { |
1509 | memcpy(val, xi->name, name_len); | 1791 | struct ocfs2_xattr_header *xh = loc->xl_header; |
1510 | memcpy(val + OCFS2_XATTR_SIZE(name_len), | 1792 | int count = le16_to_cpu(xh->xh_count); |
1511 | xi->value, | 1793 | int low = 0, high = count - 1, tmp; |
1512 | xi->value_len); | 1794 | struct ocfs2_xattr_entry *tmp_xe; |
1513 | xs->here->xe_value_size = cpu_to_le64(xi->value_len); | 1795 | |
1514 | ocfs2_xattr_set_local(xs->here, 1); | 1796 | /* |
1515 | ocfs2_xattr_hash_entry(inode, xs->header, xs->here); | 1797 | * We keep buckets sorted by name_hash, so we need to find |
1798 | * our insert place. | ||
1799 | */ | ||
1800 | while (low <= high && count) { | ||
1801 | tmp = (low + high) / 2; | ||
1802 | tmp_xe = &xh->xh_entries[tmp]; | ||
1803 | |||
1804 | if (name_hash > le32_to_cpu(tmp_xe->xe_name_hash)) | ||
1805 | low = tmp + 1; | ||
1806 | else if (name_hash < le32_to_cpu(tmp_xe->xe_name_hash)) | ||
1807 | high = tmp - 1; | ||
1808 | else { | ||
1809 | low = tmp; | ||
1810 | break; | ||
1811 | } | ||
1516 | } | 1812 | } |
1517 | 1813 | ||
1518 | return; | 1814 | if (low != count) |
1815 | memmove(&xh->xh_entries[low + 1], | ||
1816 | &xh->xh_entries[low], | ||
1817 | ((count - low) * sizeof(struct ocfs2_xattr_entry))); | ||
1818 | |||
1819 | le16_add_cpu(&xh->xh_count, 1); | ||
1820 | loc->xl_entry = &xh->xh_entries[low]; | ||
1821 | memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry)); | ||
1822 | } | ||
1823 | |||
1824 | static void ocfs2_xa_bucket_add_namevalue(struct ocfs2_xa_loc *loc, int size) | ||
1825 | { | ||
1826 | int free_start = ocfs2_xa_get_free_start(loc); | ||
1827 | struct ocfs2_xattr_header *xh = loc->xl_header; | ||
1828 | struct super_block *sb = loc->xl_inode->i_sb; | ||
1829 | int nameval_offset; | ||
1830 | |||
1831 | free_start = ocfs2_bucket_align_free_start(sb, free_start, size); | ||
1832 | nameval_offset = free_start - size; | ||
1833 | loc->xl_entry->xe_name_offset = cpu_to_le16(nameval_offset); | ||
1834 | xh->xh_free_start = cpu_to_le16(nameval_offset); | ||
1835 | le16_add_cpu(&xh->xh_name_value_len, size); | ||
1836 | |||
1837 | } | ||
1838 | |||
1839 | static void ocfs2_xa_bucket_fill_value_buf(struct ocfs2_xa_loc *loc, | ||
1840 | struct ocfs2_xattr_value_buf *vb) | ||
1841 | { | ||
1842 | struct ocfs2_xattr_bucket *bucket = loc->xl_storage; | ||
1843 | struct super_block *sb = loc->xl_inode->i_sb; | ||
1844 | int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset); | ||
1845 | int size = namevalue_size_xe(loc->xl_entry); | ||
1846 | int block_offset = nameval_offset >> sb->s_blocksize_bits; | ||
1847 | |||
1848 | /* Values are not allowed to straddle block boundaries */ | ||
1849 | BUG_ON(block_offset != | ||
1850 | ((nameval_offset + size - 1) >> sb->s_blocksize_bits)); | ||
1851 | /* We expect the bucket to be filled in */ | ||
1852 | BUG_ON(!bucket->bu_bhs[block_offset]); | ||
1853 | |||
1854 | vb->vb_access = ocfs2_journal_access; | ||
1855 | vb->vb_bh = bucket->bu_bhs[block_offset]; | ||
1856 | } | ||
1857 | |||
1858 | /* Operations for xattrs stored in buckets. */ | ||
1859 | static const struct ocfs2_xa_loc_operations ocfs2_xa_bucket_loc_ops = { | ||
1860 | .xlo_journal_access = ocfs2_xa_bucket_journal_access, | ||
1861 | .xlo_journal_dirty = ocfs2_xa_bucket_journal_dirty, | ||
1862 | .xlo_offset_pointer = ocfs2_xa_bucket_offset_pointer, | ||
1863 | .xlo_check_space = ocfs2_xa_bucket_check_space, | ||
1864 | .xlo_can_reuse = ocfs2_xa_bucket_can_reuse, | ||
1865 | .xlo_get_free_start = ocfs2_xa_bucket_get_free_start, | ||
1866 | .xlo_wipe_namevalue = ocfs2_xa_bucket_wipe_namevalue, | ||
1867 | .xlo_add_entry = ocfs2_xa_bucket_add_entry, | ||
1868 | .xlo_add_namevalue = ocfs2_xa_bucket_add_namevalue, | ||
1869 | .xlo_fill_value_buf = ocfs2_xa_bucket_fill_value_buf, | ||
1870 | }; | ||
1871 | |||
1872 | static unsigned int ocfs2_xa_value_clusters(struct ocfs2_xa_loc *loc) | ||
1873 | { | ||
1874 | struct ocfs2_xattr_value_buf vb; | ||
1875 | |||
1876 | if (ocfs2_xattr_is_local(loc->xl_entry)) | ||
1877 | return 0; | ||
1878 | |||
1879 | ocfs2_xa_fill_value_buf(loc, &vb); | ||
1880 | return le32_to_cpu(vb.vb_xv->xr_clusters); | ||
1881 | } | ||
1882 | |||
1883 | static int ocfs2_xa_value_truncate(struct ocfs2_xa_loc *loc, u64 bytes, | ||
1884 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
1885 | { | ||
1886 | int trunc_rc, access_rc; | ||
1887 | struct ocfs2_xattr_value_buf vb; | ||
1888 | |||
1889 | ocfs2_xa_fill_value_buf(loc, &vb); | ||
1890 | trunc_rc = ocfs2_xattr_value_truncate(loc->xl_inode, &vb, bytes, | ||
1891 | ctxt); | ||
1892 | |||
1893 | /* | ||
1894 | * The caller of ocfs2_xa_value_truncate() has already called | ||
1895 | * ocfs2_xa_journal_access on the loc. However, The truncate code | ||
1896 | * calls ocfs2_extend_trans(). This may commit the previous | ||
1897 | * transaction and open a new one. If this is a bucket, truncate | ||
1898 | * could leave only vb->vb_bh set up for journaling. Meanwhile, | ||
1899 | * the caller is expecting to dirty the entire bucket. So we must | ||
1900 | * reset the journal work. We do this even if truncate has failed, | ||
1901 | * as it could have failed after committing the extend. | ||
1902 | */ | ||
1903 | access_rc = ocfs2_xa_journal_access(ctxt->handle, loc, | ||
1904 | OCFS2_JOURNAL_ACCESS_WRITE); | ||
1905 | |||
1906 | /* Errors in truncate take precedence */ | ||
1907 | return trunc_rc ? trunc_rc : access_rc; | ||
1908 | } | ||
1909 | |||
1910 | static void ocfs2_xa_remove_entry(struct ocfs2_xa_loc *loc) | ||
1911 | { | ||
1912 | int index, count; | ||
1913 | struct ocfs2_xattr_header *xh = loc->xl_header; | ||
1914 | struct ocfs2_xattr_entry *entry = loc->xl_entry; | ||
1915 | |||
1916 | ocfs2_xa_wipe_namevalue(loc); | ||
1917 | loc->xl_entry = NULL; | ||
1918 | |||
1919 | le16_add_cpu(&xh->xh_count, -1); | ||
1920 | count = le16_to_cpu(xh->xh_count); | ||
1921 | |||
1922 | /* | ||
1923 | * Only zero out the entry if there are more remaining. This is | ||
1924 | * important for an empty bucket, as it keeps track of the | ||
1925 | * bucket's hash value. It doesn't hurt empty block storage. | ||
1926 | */ | ||
1927 | if (count) { | ||
1928 | index = ((char *)entry - (char *)&xh->xh_entries) / | ||
1929 | sizeof(struct ocfs2_xattr_entry); | ||
1930 | memmove(&xh->xh_entries[index], &xh->xh_entries[index + 1], | ||
1931 | (count - index) * sizeof(struct ocfs2_xattr_entry)); | ||
1932 | memset(&xh->xh_entries[count], 0, | ||
1933 | sizeof(struct ocfs2_xattr_entry)); | ||
1934 | } | ||
1519 | } | 1935 | } |
1520 | 1936 | ||
1521 | /* | 1937 | /* |
1522 | * ocfs2_xattr_set_entry() | 1938 | * If we have a problem adjusting the size of an external value during |
1939 | * ocfs2_xa_prepare_entry() or ocfs2_xa_remove(), we may have an xattr | ||
1940 | * in an intermediate state. For example, the value may be partially | ||
1941 | * truncated. | ||
1942 | * | ||
1943 | * If the value tree hasn't changed, the extend/truncate went nowhere. | ||
1944 | * We have nothing to do. The caller can treat it as a straight error. | ||
1523 | * | 1945 | * |
1524 | * Set extended attribute entry into inode or block. | 1946 | * If the value tree got partially truncated, we now have a corrupted |
1947 | * extended attribute. We're going to wipe its entry and leak the | ||
1948 | * clusters. Better to leak some storage than leave a corrupt entry. | ||
1525 | * | 1949 | * |
1526 | * If extended attribute value size > OCFS2_XATTR_INLINE_SIZE, | 1950 | * If the value tree grew, it obviously didn't grow enough for the |
1527 | * We first insert tree root(ocfs2_xattr_value_root) with set_entry_local(), | 1951 | * new entry. We're not going to try and reclaim those clusters either. |
1528 | * then set value in B tree with set_value_outside(). | 1952 | * If there was already an external value there (orig_clusters != 0), |
1953 | * the new clusters are attached safely and we can just leave the old | ||
1954 | * value in place. If there was no external value there, we remove | ||
1955 | * the entry. | ||
1956 | * | ||
1957 | * This way, the xattr block we store in the journal will be consistent. | ||
1958 | * If the size change broke because of the journal, no changes will hit | ||
1959 | * disk anyway. | ||
1529 | */ | 1960 | */ |
1530 | static int ocfs2_xattr_set_entry(struct inode *inode, | 1961 | static void ocfs2_xa_cleanup_value_truncate(struct ocfs2_xa_loc *loc, |
1531 | struct ocfs2_xattr_info *xi, | 1962 | const char *what, |
1532 | struct ocfs2_xattr_search *xs, | 1963 | unsigned int orig_clusters) |
1533 | struct ocfs2_xattr_set_ctxt *ctxt, | 1964 | { |
1534 | int flag) | 1965 | unsigned int new_clusters = ocfs2_xa_value_clusters(loc); |
1535 | { | 1966 | char *nameval_buf = ocfs2_xa_offset_pointer(loc, |
1536 | struct ocfs2_xattr_entry *last; | 1967 | le16_to_cpu(loc->xl_entry->xe_name_offset)); |
1537 | struct ocfs2_inode_info *oi = OCFS2_I(inode); | 1968 | |
1538 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data; | 1969 | if (new_clusters < orig_clusters) { |
1539 | size_t min_offs = xs->end - xs->base, name_len = strlen(xi->name); | 1970 | mlog(ML_ERROR, |
1540 | size_t size_l = 0; | 1971 | "Partial truncate while %s xattr %.*s. Leaking " |
1541 | handle_t *handle = ctxt->handle; | 1972 | "%u clusters and removing the entry\n", |
1542 | int free, i, ret; | 1973 | what, loc->xl_entry->xe_name_len, nameval_buf, |
1543 | struct ocfs2_xattr_info xi_l = { | 1974 | orig_clusters - new_clusters); |
1544 | .name_index = xi->name_index, | 1975 | ocfs2_xa_remove_entry(loc); |
1545 | .name = xi->name, | 1976 | } else if (!orig_clusters) { |
1546 | .value = xi->value, | 1977 | mlog(ML_ERROR, |
1547 | .value_len = xi->value_len, | 1978 | "Unable to allocate an external value for xattr " |
1548 | }; | 1979 | "%.*s safely. Leaking %u clusters and removing the " |
1549 | struct ocfs2_xattr_value_buf vb = { | 1980 | "entry\n", |
1550 | .vb_bh = xs->xattr_bh, | 1981 | loc->xl_entry->xe_name_len, nameval_buf, |
1551 | .vb_access = ocfs2_journal_access_di, | 1982 | new_clusters - orig_clusters); |
1552 | }; | 1983 | ocfs2_xa_remove_entry(loc); |
1984 | } else if (new_clusters > orig_clusters) | ||
1985 | mlog(ML_ERROR, | ||
1986 | "Unable to grow xattr %.*s safely. %u new clusters " | ||
1987 | "have been added, but the value will not be " | ||
1988 | "modified\n", | ||
1989 | loc->xl_entry->xe_name_len, nameval_buf, | ||
1990 | new_clusters - orig_clusters); | ||
1991 | } | ||
1992 | |||
1993 | static int ocfs2_xa_remove(struct ocfs2_xa_loc *loc, | ||
1994 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
1995 | { | ||
1996 | int rc = 0; | ||
1997 | unsigned int orig_clusters; | ||
1998 | |||
1999 | if (!ocfs2_xattr_is_local(loc->xl_entry)) { | ||
2000 | orig_clusters = ocfs2_xa_value_clusters(loc); | ||
2001 | rc = ocfs2_xa_value_truncate(loc, 0, ctxt); | ||
2002 | if (rc) { | ||
2003 | mlog_errno(rc); | ||
2004 | /* | ||
2005 | * Since this is remove, we can return 0 if | ||
2006 | * ocfs2_xa_cleanup_value_truncate() is going to | ||
2007 | * wipe the entry anyway. So we check the | ||
2008 | * cluster count as well. | ||
2009 | */ | ||
2010 | if (orig_clusters != ocfs2_xa_value_clusters(loc)) | ||
2011 | rc = 0; | ||
2012 | ocfs2_xa_cleanup_value_truncate(loc, "removing", | ||
2013 | orig_clusters); | ||
2014 | if (rc) | ||
2015 | goto out; | ||
2016 | } | ||
2017 | } | ||
1553 | 2018 | ||
1554 | if (!(flag & OCFS2_INLINE_XATTR_FL)) { | 2019 | ocfs2_xa_remove_entry(loc); |
1555 | BUG_ON(xs->xattr_bh == xs->inode_bh); | ||
1556 | vb.vb_access = ocfs2_journal_access_xb; | ||
1557 | } else | ||
1558 | BUG_ON(xs->xattr_bh != xs->inode_bh); | ||
1559 | 2020 | ||
1560 | /* Compute min_offs, last and free space. */ | 2021 | out: |
1561 | last = xs->header->xh_entries; | 2022 | return rc; |
2023 | } | ||
1562 | 2024 | ||
1563 | for (i = 0 ; i < le16_to_cpu(xs->header->xh_count); i++) { | 2025 | static void ocfs2_xa_install_value_root(struct ocfs2_xa_loc *loc) |
1564 | size_t offs = le16_to_cpu(last->xe_name_offset); | 2026 | { |
1565 | if (offs < min_offs) | 2027 | int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len); |
1566 | min_offs = offs; | 2028 | char *nameval_buf; |
1567 | last += 1; | ||
1568 | } | ||
1569 | 2029 | ||
1570 | free = min_offs - ((void *)last - xs->base) - OCFS2_XATTR_HEADER_GAP; | 2030 | nameval_buf = ocfs2_xa_offset_pointer(loc, |
1571 | if (free < 0) | 2031 | le16_to_cpu(loc->xl_entry->xe_name_offset)); |
1572 | return -EIO; | 2032 | memcpy(nameval_buf + name_size, &def_xv, OCFS2_XATTR_ROOT_SIZE); |
2033 | } | ||
1573 | 2034 | ||
1574 | if (!xs->not_found) { | 2035 | /* |
1575 | size_t size = 0; | 2036 | * Take an existing entry and make it ready for the new value. This |
1576 | if (ocfs2_xattr_is_local(xs->here)) | 2037 | * won't allocate space, but it may free space. It should be ready for |
1577 | size = OCFS2_XATTR_SIZE(name_len) + | 2038 | * ocfs2_xa_prepare_entry() to finish the work. |
1578 | OCFS2_XATTR_SIZE(le64_to_cpu(xs->here->xe_value_size)); | 2039 | */ |
1579 | else | 2040 | static int ocfs2_xa_reuse_entry(struct ocfs2_xa_loc *loc, |
1580 | size = OCFS2_XATTR_SIZE(name_len) + | 2041 | struct ocfs2_xattr_info *xi, |
1581 | OCFS2_XATTR_ROOT_SIZE; | 2042 | struct ocfs2_xattr_set_ctxt *ctxt) |
1582 | free += (size + sizeof(struct ocfs2_xattr_entry)); | 2043 | { |
1583 | } | 2044 | int rc = 0; |
1584 | /* Check free space in inode or block */ | 2045 | int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len); |
1585 | if (xi->value && xi->value_len > OCFS2_XATTR_INLINE_SIZE) { | 2046 | unsigned int orig_clusters; |
1586 | if (free < sizeof(struct ocfs2_xattr_entry) + | 2047 | char *nameval_buf; |
1587 | OCFS2_XATTR_SIZE(name_len) + | 2048 | int xe_local = ocfs2_xattr_is_local(loc->xl_entry); |
1588 | OCFS2_XATTR_ROOT_SIZE) { | 2049 | int xi_local = xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE; |
1589 | ret = -ENOSPC; | 2050 | |
1590 | goto out; | 2051 | BUG_ON(OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len) != |
2052 | name_size); | ||
2053 | |||
2054 | nameval_buf = ocfs2_xa_offset_pointer(loc, | ||
2055 | le16_to_cpu(loc->xl_entry->xe_name_offset)); | ||
2056 | if (xe_local) { | ||
2057 | memset(nameval_buf + name_size, 0, | ||
2058 | namevalue_size_xe(loc->xl_entry) - name_size); | ||
2059 | if (!xi_local) | ||
2060 | ocfs2_xa_install_value_root(loc); | ||
2061 | } else { | ||
2062 | orig_clusters = ocfs2_xa_value_clusters(loc); | ||
2063 | if (xi_local) { | ||
2064 | rc = ocfs2_xa_value_truncate(loc, 0, ctxt); | ||
2065 | if (rc < 0) | ||
2066 | mlog_errno(rc); | ||
2067 | else | ||
2068 | memset(nameval_buf + name_size, 0, | ||
2069 | namevalue_size_xe(loc->xl_entry) - | ||
2070 | name_size); | ||
2071 | } else if (le64_to_cpu(loc->xl_entry->xe_value_size) > | ||
2072 | xi->xi_value_len) { | ||
2073 | rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len, | ||
2074 | ctxt); | ||
2075 | if (rc < 0) | ||
2076 | mlog_errno(rc); | ||
1591 | } | 2077 | } |
1592 | size_l = OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_ROOT_SIZE; | 2078 | |
1593 | xi_l.value = (void *)&def_xv; | 2079 | if (rc) { |
1594 | xi_l.value_len = OCFS2_XATTR_ROOT_SIZE; | 2080 | ocfs2_xa_cleanup_value_truncate(loc, "reusing", |
1595 | } else if (xi->value) { | 2081 | orig_clusters); |
1596 | if (free < sizeof(struct ocfs2_xattr_entry) + | ||
1597 | OCFS2_XATTR_SIZE(name_len) + | ||
1598 | OCFS2_XATTR_SIZE(xi->value_len)) { | ||
1599 | ret = -ENOSPC; | ||
1600 | goto out; | 2082 | goto out; |
1601 | } | 2083 | } |
1602 | } | 2084 | } |
1603 | 2085 | ||
1604 | if (!xs->not_found) { | 2086 | loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len); |
1605 | /* For existing extended attribute */ | 2087 | ocfs2_xattr_set_local(loc->xl_entry, xi_local); |
1606 | size_t size = OCFS2_XATTR_SIZE(name_len) + | ||
1607 | OCFS2_XATTR_SIZE(le64_to_cpu(xs->here->xe_value_size)); | ||
1608 | size_t offs = le16_to_cpu(xs->here->xe_name_offset); | ||
1609 | void *val = xs->base + offs; | ||
1610 | 2088 | ||
1611 | if (ocfs2_xattr_is_local(xs->here) && size == size_l) { | 2089 | out: |
1612 | /* Replace existing local xattr with tree root */ | 2090 | return rc; |
1613 | ret = ocfs2_xattr_set_value_outside(inode, xi, xs, | 2091 | } |
1614 | ctxt, &vb, offs); | ||
1615 | if (ret < 0) | ||
1616 | mlog_errno(ret); | ||
1617 | goto out; | ||
1618 | } else if (!ocfs2_xattr_is_local(xs->here)) { | ||
1619 | /* For existing xattr which has value outside */ | ||
1620 | vb.vb_xv = (struct ocfs2_xattr_value_root *) | ||
1621 | (val + OCFS2_XATTR_SIZE(name_len)); | ||
1622 | 2092 | ||
1623 | if (xi->value_len > OCFS2_XATTR_INLINE_SIZE) { | 2093 | /* |
1624 | /* | 2094 | * Prepares loc->xl_entry to receive the new xattr. This includes |
1625 | * If new value need set outside also, | 2095 | * properly setting up the name+value pair region. If loc->xl_entry |
1626 | * first truncate old value to new value, | 2096 | * already exists, it will take care of modifying it appropriately. |
1627 | * then set new value with set_value_outside(). | 2097 | * |
1628 | */ | 2098 | * Note that this modifies the data. You did journal_access already, |
1629 | ret = ocfs2_xattr_value_truncate(inode, | 2099 | * right? |
1630 | &vb, | 2100 | */ |
1631 | xi->value_len, | 2101 | static int ocfs2_xa_prepare_entry(struct ocfs2_xa_loc *loc, |
1632 | ctxt); | 2102 | struct ocfs2_xattr_info *xi, |
1633 | if (ret < 0) { | 2103 | u32 name_hash, |
1634 | mlog_errno(ret); | 2104 | struct ocfs2_xattr_set_ctxt *ctxt) |
1635 | goto out; | 2105 | { |
1636 | } | 2106 | int rc = 0; |
2107 | unsigned int orig_clusters; | ||
2108 | __le64 orig_value_size = 0; | ||
1637 | 2109 | ||
1638 | ret = ocfs2_xattr_update_entry(inode, | 2110 | rc = ocfs2_xa_check_space(loc, xi); |
1639 | handle, | 2111 | if (rc) |
1640 | xi, | 2112 | goto out; |
1641 | xs, | ||
1642 | &vb, | ||
1643 | offs); | ||
1644 | if (ret < 0) { | ||
1645 | mlog_errno(ret); | ||
1646 | goto out; | ||
1647 | } | ||
1648 | 2113 | ||
1649 | ret = __ocfs2_xattr_set_value_outside(inode, | 2114 | if (loc->xl_entry) { |
1650 | handle, | 2115 | if (ocfs2_xa_can_reuse_entry(loc, xi)) { |
1651 | &vb, | 2116 | orig_value_size = loc->xl_entry->xe_value_size; |
1652 | xi->value, | 2117 | rc = ocfs2_xa_reuse_entry(loc, xi, ctxt); |
1653 | xi->value_len); | 2118 | if (rc) |
1654 | if (ret < 0) | 2119 | goto out; |
1655 | mlog_errno(ret); | 2120 | goto alloc_value; |
2121 | } | ||
2122 | |||
2123 | if (!ocfs2_xattr_is_local(loc->xl_entry)) { | ||
2124 | orig_clusters = ocfs2_xa_value_clusters(loc); | ||
2125 | rc = ocfs2_xa_value_truncate(loc, 0, ctxt); | ||
2126 | if (rc) { | ||
2127 | mlog_errno(rc); | ||
2128 | ocfs2_xa_cleanup_value_truncate(loc, | ||
2129 | "overwriting", | ||
2130 | orig_clusters); | ||
1656 | goto out; | 2131 | goto out; |
1657 | } else { | ||
1658 | /* | ||
1659 | * If new value need set in local, | ||
1660 | * just trucate old value to zero. | ||
1661 | */ | ||
1662 | ret = ocfs2_xattr_value_truncate(inode, | ||
1663 | &vb, | ||
1664 | 0, | ||
1665 | ctxt); | ||
1666 | if (ret < 0) | ||
1667 | mlog_errno(ret); | ||
1668 | } | 2132 | } |
1669 | } | 2133 | } |
2134 | ocfs2_xa_wipe_namevalue(loc); | ||
2135 | } else | ||
2136 | ocfs2_xa_add_entry(loc, name_hash); | ||
2137 | |||
2138 | /* | ||
2139 | * If we get here, we have a blank entry. Fill it. We grow our | ||
2140 | * name+value pair back from the end. | ||
2141 | */ | ||
2142 | ocfs2_xa_add_namevalue(loc, xi); | ||
2143 | if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) | ||
2144 | ocfs2_xa_install_value_root(loc); | ||
2145 | |||
2146 | alloc_value: | ||
2147 | if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) { | ||
2148 | orig_clusters = ocfs2_xa_value_clusters(loc); | ||
2149 | rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len, ctxt); | ||
2150 | if (rc < 0) { | ||
2151 | /* | ||
2152 | * If we tried to grow an existing external value, | ||
2153 | * ocfs2_xa_cleanuP-value_truncate() is going to | ||
2154 | * let it stand. We have to restore its original | ||
2155 | * value size. | ||
2156 | */ | ||
2157 | loc->xl_entry->xe_value_size = orig_value_size; | ||
2158 | ocfs2_xa_cleanup_value_truncate(loc, "growing", | ||
2159 | orig_clusters); | ||
2160 | mlog_errno(rc); | ||
2161 | } | ||
1670 | } | 2162 | } |
1671 | 2163 | ||
1672 | ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), xs->inode_bh, | 2164 | out: |
2165 | return rc; | ||
2166 | } | ||
2167 | |||
2168 | /* | ||
2169 | * Store the value portion of the name+value pair. This will skip | ||
2170 | * values that are stored externally. Their tree roots were set up | ||
2171 | * by ocfs2_xa_prepare_entry(). | ||
2172 | */ | ||
2173 | static int ocfs2_xa_store_value(struct ocfs2_xa_loc *loc, | ||
2174 | struct ocfs2_xattr_info *xi, | ||
2175 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
2176 | { | ||
2177 | int rc = 0; | ||
2178 | int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset); | ||
2179 | int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len); | ||
2180 | char *nameval_buf; | ||
2181 | struct ocfs2_xattr_value_buf vb; | ||
2182 | |||
2183 | nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset); | ||
2184 | if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) { | ||
2185 | ocfs2_xa_fill_value_buf(loc, &vb); | ||
2186 | rc = __ocfs2_xattr_set_value_outside(loc->xl_inode, | ||
2187 | ctxt->handle, &vb, | ||
2188 | xi->xi_value, | ||
2189 | xi->xi_value_len); | ||
2190 | } else | ||
2191 | memcpy(nameval_buf + name_size, xi->xi_value, xi->xi_value_len); | ||
2192 | |||
2193 | return rc; | ||
2194 | } | ||
2195 | |||
2196 | static int ocfs2_xa_set(struct ocfs2_xa_loc *loc, | ||
2197 | struct ocfs2_xattr_info *xi, | ||
2198 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
2199 | { | ||
2200 | int ret; | ||
2201 | u32 name_hash = ocfs2_xattr_name_hash(loc->xl_inode, xi->xi_name, | ||
2202 | xi->xi_name_len); | ||
2203 | |||
2204 | ret = ocfs2_xa_journal_access(ctxt->handle, loc, | ||
1673 | OCFS2_JOURNAL_ACCESS_WRITE); | 2205 | OCFS2_JOURNAL_ACCESS_WRITE); |
1674 | if (ret) { | 2206 | if (ret) { |
1675 | mlog_errno(ret); | 2207 | mlog_errno(ret); |
1676 | goto out; | 2208 | goto out; |
1677 | } | 2209 | } |
1678 | 2210 | ||
1679 | if (!(flag & OCFS2_INLINE_XATTR_FL)) { | ||
1680 | ret = vb.vb_access(handle, INODE_CACHE(inode), vb.vb_bh, | ||
1681 | OCFS2_JOURNAL_ACCESS_WRITE); | ||
1682 | if (ret) { | ||
1683 | mlog_errno(ret); | ||
1684 | goto out; | ||
1685 | } | ||
1686 | } | ||
1687 | |||
1688 | /* | 2211 | /* |
1689 | * Set value in local, include set tree root in local. | 2212 | * From here on out, everything is going to modify the buffer a |
1690 | * This is the first step for value size >INLINE_SIZE. | 2213 | * little. Errors are going to leave the xattr header in a |
2214 | * sane state. Thus, even with errors we dirty the sucker. | ||
1691 | */ | 2215 | */ |
1692 | ocfs2_xattr_set_entry_local(inode, &xi_l, xs, last, min_offs); | ||
1693 | 2216 | ||
1694 | if (!(flag & OCFS2_INLINE_XATTR_FL)) { | 2217 | /* Don't worry, we are never called with !xi_value and !xl_entry */ |
1695 | ret = ocfs2_journal_dirty(handle, xs->xattr_bh); | 2218 | if (!xi->xi_value) { |
1696 | if (ret < 0) { | 2219 | ret = ocfs2_xa_remove(loc, ctxt); |
1697 | mlog_errno(ret); | 2220 | goto out_dirty; |
1698 | goto out; | ||
1699 | } | ||
1700 | } | 2221 | } |
1701 | 2222 | ||
1702 | if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) && | 2223 | ret = ocfs2_xa_prepare_entry(loc, xi, name_hash, ctxt); |
1703 | (flag & OCFS2_INLINE_XATTR_FL)) { | 2224 | if (ret) { |
1704 | struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); | 2225 | if (ret != -ENOSPC) |
1705 | unsigned int xattrsize = osb->s_xattr_inline_size; | 2226 | mlog_errno(ret); |
1706 | 2227 | goto out_dirty; | |
1707 | /* | ||
1708 | * Adjust extent record count or inline data size | ||
1709 | * to reserve space for extended attribute. | ||
1710 | */ | ||
1711 | if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) { | ||
1712 | struct ocfs2_inline_data *idata = &di->id2.i_data; | ||
1713 | le16_add_cpu(&idata->id_count, -xattrsize); | ||
1714 | } else if (!(ocfs2_inode_is_fast_symlink(inode))) { | ||
1715 | struct ocfs2_extent_list *el = &di->id2.i_list; | ||
1716 | le16_add_cpu(&el->l_count, -(xattrsize / | ||
1717 | sizeof(struct ocfs2_extent_rec))); | ||
1718 | } | ||
1719 | di->i_xattr_inline_size = cpu_to_le16(xattrsize); | ||
1720 | } | 2228 | } |
1721 | /* Update xattr flag */ | ||
1722 | spin_lock(&oi->ip_lock); | ||
1723 | oi->ip_dyn_features |= flag; | ||
1724 | di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features); | ||
1725 | spin_unlock(&oi->ip_lock); | ||
1726 | 2229 | ||
1727 | ret = ocfs2_journal_dirty(handle, xs->inode_bh); | 2230 | ret = ocfs2_xa_store_value(loc, xi, ctxt); |
1728 | if (ret < 0) | 2231 | if (ret) |
1729 | mlog_errno(ret); | 2232 | mlog_errno(ret); |
1730 | 2233 | ||
1731 | if (!ret && xi->value_len > OCFS2_XATTR_INLINE_SIZE) { | 2234 | out_dirty: |
1732 | /* | 2235 | ocfs2_xa_journal_dirty(ctxt->handle, loc); |
1733 | * Set value outside in B tree. | ||
1734 | * This is the second step for value size > INLINE_SIZE. | ||
1735 | */ | ||
1736 | size_t offs = le16_to_cpu(xs->here->xe_name_offset); | ||
1737 | ret = ocfs2_xattr_set_value_outside(inode, xi, xs, ctxt, | ||
1738 | &vb, offs); | ||
1739 | if (ret < 0) { | ||
1740 | int ret2; | ||
1741 | 2236 | ||
1742 | mlog_errno(ret); | ||
1743 | /* | ||
1744 | * If set value outside failed, we have to clean | ||
1745 | * the junk tree root we have already set in local. | ||
1746 | */ | ||
1747 | ret2 = ocfs2_xattr_cleanup(inode, ctxt->handle, | ||
1748 | xi, xs, &vb, offs); | ||
1749 | if (ret2 < 0) | ||
1750 | mlog_errno(ret2); | ||
1751 | } | ||
1752 | } | ||
1753 | out: | 2237 | out: |
1754 | return ret; | 2238 | return ret; |
1755 | } | 2239 | } |
1756 | 2240 | ||
2241 | static void ocfs2_init_dinode_xa_loc(struct ocfs2_xa_loc *loc, | ||
2242 | struct inode *inode, | ||
2243 | struct buffer_head *bh, | ||
2244 | struct ocfs2_xattr_entry *entry) | ||
2245 | { | ||
2246 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)bh->b_data; | ||
2247 | |||
2248 | BUG_ON(!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_XATTR_FL)); | ||
2249 | |||
2250 | loc->xl_inode = inode; | ||
2251 | loc->xl_ops = &ocfs2_xa_block_loc_ops; | ||
2252 | loc->xl_storage = bh; | ||
2253 | loc->xl_entry = entry; | ||
2254 | loc->xl_size = le16_to_cpu(di->i_xattr_inline_size); | ||
2255 | loc->xl_header = | ||
2256 | (struct ocfs2_xattr_header *)(bh->b_data + bh->b_size - | ||
2257 | loc->xl_size); | ||
2258 | } | ||
2259 | |||
2260 | static void ocfs2_init_xattr_block_xa_loc(struct ocfs2_xa_loc *loc, | ||
2261 | struct inode *inode, | ||
2262 | struct buffer_head *bh, | ||
2263 | struct ocfs2_xattr_entry *entry) | ||
2264 | { | ||
2265 | struct ocfs2_xattr_block *xb = | ||
2266 | (struct ocfs2_xattr_block *)bh->b_data; | ||
2267 | |||
2268 | BUG_ON(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED); | ||
2269 | |||
2270 | loc->xl_inode = inode; | ||
2271 | loc->xl_ops = &ocfs2_xa_block_loc_ops; | ||
2272 | loc->xl_storage = bh; | ||
2273 | loc->xl_header = &(xb->xb_attrs.xb_header); | ||
2274 | loc->xl_entry = entry; | ||
2275 | loc->xl_size = bh->b_size - offsetof(struct ocfs2_xattr_block, | ||
2276 | xb_attrs.xb_header); | ||
2277 | } | ||
2278 | |||
2279 | static void ocfs2_init_xattr_bucket_xa_loc(struct ocfs2_xa_loc *loc, | ||
2280 | struct ocfs2_xattr_bucket *bucket, | ||
2281 | struct ocfs2_xattr_entry *entry) | ||
2282 | { | ||
2283 | loc->xl_inode = bucket->bu_inode; | ||
2284 | loc->xl_ops = &ocfs2_xa_bucket_loc_ops; | ||
2285 | loc->xl_storage = bucket; | ||
2286 | loc->xl_header = bucket_xh(bucket); | ||
2287 | loc->xl_entry = entry; | ||
2288 | loc->xl_size = OCFS2_XATTR_BUCKET_SIZE; | ||
2289 | } | ||
2290 | |||
1757 | /* | 2291 | /* |
1758 | * In xattr remove, if it is stored outside and refcounted, we may have | 2292 | * In xattr remove, if it is stored outside and refcounted, we may have |
1759 | * the chance to split the refcount tree. So need the allocators. | 2293 | * the chance to split the refcount tree. So need the allocators. |
@@ -2149,6 +2683,55 @@ static int ocfs2_xattr_ibody_find(struct inode *inode, | |||
2149 | return 0; | 2683 | return 0; |
2150 | } | 2684 | } |
2151 | 2685 | ||
2686 | static int ocfs2_xattr_ibody_init(struct inode *inode, | ||
2687 | struct buffer_head *di_bh, | ||
2688 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
2689 | { | ||
2690 | int ret; | ||
2691 | struct ocfs2_inode_info *oi = OCFS2_I(inode); | ||
2692 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; | ||
2693 | struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); | ||
2694 | unsigned int xattrsize = osb->s_xattr_inline_size; | ||
2695 | |||
2696 | if (!ocfs2_xattr_has_space_inline(inode, di)) { | ||
2697 | ret = -ENOSPC; | ||
2698 | goto out; | ||
2699 | } | ||
2700 | |||
2701 | ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode), di_bh, | ||
2702 | OCFS2_JOURNAL_ACCESS_WRITE); | ||
2703 | if (ret) { | ||
2704 | mlog_errno(ret); | ||
2705 | goto out; | ||
2706 | } | ||
2707 | |||
2708 | /* | ||
2709 | * Adjust extent record count or inline data size | ||
2710 | * to reserve space for extended attribute. | ||
2711 | */ | ||
2712 | if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) { | ||
2713 | struct ocfs2_inline_data *idata = &di->id2.i_data; | ||
2714 | le16_add_cpu(&idata->id_count, -xattrsize); | ||
2715 | } else if (!(ocfs2_inode_is_fast_symlink(inode))) { | ||
2716 | struct ocfs2_extent_list *el = &di->id2.i_list; | ||
2717 | le16_add_cpu(&el->l_count, -(xattrsize / | ||
2718 | sizeof(struct ocfs2_extent_rec))); | ||
2719 | } | ||
2720 | di->i_xattr_inline_size = cpu_to_le16(xattrsize); | ||
2721 | |||
2722 | spin_lock(&oi->ip_lock); | ||
2723 | oi->ip_dyn_features |= OCFS2_INLINE_XATTR_FL|OCFS2_HAS_XATTR_FL; | ||
2724 | di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features); | ||
2725 | spin_unlock(&oi->ip_lock); | ||
2726 | |||
2727 | ret = ocfs2_journal_dirty(ctxt->handle, di_bh); | ||
2728 | if (ret < 0) | ||
2729 | mlog_errno(ret); | ||
2730 | |||
2731 | out: | ||
2732 | return ret; | ||
2733 | } | ||
2734 | |||
2152 | /* | 2735 | /* |
2153 | * ocfs2_xattr_ibody_set() | 2736 | * ocfs2_xattr_ibody_set() |
2154 | * | 2737 | * |
@@ -2160,9 +2743,10 @@ static int ocfs2_xattr_ibody_set(struct inode *inode, | |||
2160 | struct ocfs2_xattr_search *xs, | 2743 | struct ocfs2_xattr_search *xs, |
2161 | struct ocfs2_xattr_set_ctxt *ctxt) | 2744 | struct ocfs2_xattr_set_ctxt *ctxt) |
2162 | { | 2745 | { |
2746 | int ret; | ||
2163 | struct ocfs2_inode_info *oi = OCFS2_I(inode); | 2747 | struct ocfs2_inode_info *oi = OCFS2_I(inode); |
2164 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data; | 2748 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data; |
2165 | int ret; | 2749 | struct ocfs2_xa_loc loc; |
2166 | 2750 | ||
2167 | if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE) | 2751 | if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE) |
2168 | return -ENOSPC; | 2752 | return -ENOSPC; |
@@ -2175,8 +2759,25 @@ static int ocfs2_xattr_ibody_set(struct inode *inode, | |||
2175 | } | 2759 | } |
2176 | } | 2760 | } |
2177 | 2761 | ||
2178 | ret = ocfs2_xattr_set_entry(inode, xi, xs, ctxt, | 2762 | if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) { |
2179 | (OCFS2_INLINE_XATTR_FL | OCFS2_HAS_XATTR_FL)); | 2763 | ret = ocfs2_xattr_ibody_init(inode, xs->inode_bh, ctxt); |
2764 | if (ret) { | ||
2765 | if (ret != -ENOSPC) | ||
2766 | mlog_errno(ret); | ||
2767 | goto out; | ||
2768 | } | ||
2769 | } | ||
2770 | |||
2771 | ocfs2_init_dinode_xa_loc(&loc, inode, xs->inode_bh, | ||
2772 | xs->not_found ? NULL : xs->here); | ||
2773 | ret = ocfs2_xa_set(&loc, xi, ctxt); | ||
2774 | if (ret) { | ||
2775 | if (ret != -ENOSPC) | ||
2776 | mlog_errno(ret); | ||
2777 | goto out; | ||
2778 | } | ||
2779 | xs->here = loc.xl_entry; | ||
2780 | |||
2180 | out: | 2781 | out: |
2181 | up_write(&oi->ip_alloc_sem); | 2782 | up_write(&oi->ip_alloc_sem); |
2182 | 2783 | ||
@@ -2236,12 +2837,11 @@ cleanup: | |||
2236 | return ret; | 2837 | return ret; |
2237 | } | 2838 | } |
2238 | 2839 | ||
2239 | static int ocfs2_create_xattr_block(handle_t *handle, | 2840 | static int ocfs2_create_xattr_block(struct inode *inode, |
2240 | struct inode *inode, | ||
2241 | struct buffer_head *inode_bh, | 2841 | struct buffer_head *inode_bh, |
2242 | struct ocfs2_alloc_context *meta_ac, | 2842 | struct ocfs2_xattr_set_ctxt *ctxt, |
2243 | struct buffer_head **ret_bh, | 2843 | int indexed, |
2244 | int indexed) | 2844 | struct buffer_head **ret_bh) |
2245 | { | 2845 | { |
2246 | int ret; | 2846 | int ret; |
2247 | u16 suballoc_bit_start; | 2847 | u16 suballoc_bit_start; |
@@ -2252,14 +2852,14 @@ static int ocfs2_create_xattr_block(handle_t *handle, | |||
2252 | struct buffer_head *new_bh = NULL; | 2852 | struct buffer_head *new_bh = NULL; |
2253 | struct ocfs2_xattr_block *xblk; | 2853 | struct ocfs2_xattr_block *xblk; |
2254 | 2854 | ||
2255 | ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), inode_bh, | 2855 | ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode), |
2256 | OCFS2_JOURNAL_ACCESS_CREATE); | 2856 | inode_bh, OCFS2_JOURNAL_ACCESS_CREATE); |
2257 | if (ret < 0) { | 2857 | if (ret < 0) { |
2258 | mlog_errno(ret); | 2858 | mlog_errno(ret); |
2259 | goto end; | 2859 | goto end; |
2260 | } | 2860 | } |
2261 | 2861 | ||
2262 | ret = ocfs2_claim_metadata(osb, handle, meta_ac, 1, | 2862 | ret = ocfs2_claim_metadata(osb, ctxt->handle, ctxt->meta_ac, 1, |
2263 | &suballoc_bit_start, &num_got, | 2863 | &suballoc_bit_start, &num_got, |
2264 | &first_blkno); | 2864 | &first_blkno); |
2265 | if (ret < 0) { | 2865 | if (ret < 0) { |
@@ -2270,7 +2870,7 @@ static int ocfs2_create_xattr_block(handle_t *handle, | |||
2270 | new_bh = sb_getblk(inode->i_sb, first_blkno); | 2870 | new_bh = sb_getblk(inode->i_sb, first_blkno); |
2271 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh); | 2871 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh); |
2272 | 2872 | ||
2273 | ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), | 2873 | ret = ocfs2_journal_access_xb(ctxt->handle, INODE_CACHE(inode), |
2274 | new_bh, | 2874 | new_bh, |
2275 | OCFS2_JOURNAL_ACCESS_CREATE); | 2875 | OCFS2_JOURNAL_ACCESS_CREATE); |
2276 | if (ret < 0) { | 2876 | if (ret < 0) { |
@@ -2282,11 +2882,10 @@ static int ocfs2_create_xattr_block(handle_t *handle, | |||
2282 | xblk = (struct ocfs2_xattr_block *)new_bh->b_data; | 2882 | xblk = (struct ocfs2_xattr_block *)new_bh->b_data; |
2283 | memset(xblk, 0, inode->i_sb->s_blocksize); | 2883 | memset(xblk, 0, inode->i_sb->s_blocksize); |
2284 | strcpy((void *)xblk, OCFS2_XATTR_BLOCK_SIGNATURE); | 2884 | strcpy((void *)xblk, OCFS2_XATTR_BLOCK_SIGNATURE); |
2285 | xblk->xb_suballoc_slot = cpu_to_le16(osb->slot_num); | 2885 | xblk->xb_suballoc_slot = cpu_to_le16(ctxt->meta_ac->ac_alloc_slot); |
2286 | xblk->xb_suballoc_bit = cpu_to_le16(suballoc_bit_start); | 2886 | xblk->xb_suballoc_bit = cpu_to_le16(suballoc_bit_start); |
2287 | xblk->xb_fs_generation = cpu_to_le32(osb->fs_generation); | 2887 | xblk->xb_fs_generation = cpu_to_le32(osb->fs_generation); |
2288 | xblk->xb_blkno = cpu_to_le64(first_blkno); | 2888 | xblk->xb_blkno = cpu_to_le64(first_blkno); |
2289 | |||
2290 | if (indexed) { | 2889 | if (indexed) { |
2291 | struct ocfs2_xattr_tree_root *xr = &xblk->xb_attrs.xb_root; | 2890 | struct ocfs2_xattr_tree_root *xr = &xblk->xb_attrs.xb_root; |
2292 | xr->xt_clusters = cpu_to_le32(1); | 2891 | xr->xt_clusters = cpu_to_le32(1); |
@@ -2297,14 +2896,17 @@ static int ocfs2_create_xattr_block(handle_t *handle, | |||
2297 | xr->xt_list.l_next_free_rec = cpu_to_le16(1); | 2896 | xr->xt_list.l_next_free_rec = cpu_to_le16(1); |
2298 | xblk->xb_flags = cpu_to_le16(OCFS2_XATTR_INDEXED); | 2897 | xblk->xb_flags = cpu_to_le16(OCFS2_XATTR_INDEXED); |
2299 | } | 2898 | } |
2899 | ocfs2_journal_dirty(ctxt->handle, new_bh); | ||
2300 | 2900 | ||
2301 | ret = ocfs2_journal_dirty(handle, new_bh); | 2901 | /* Add it to the inode */ |
2302 | if (ret < 0) { | ||
2303 | mlog_errno(ret); | ||
2304 | goto end; | ||
2305 | } | ||
2306 | di->i_xattr_loc = cpu_to_le64(first_blkno); | 2902 | di->i_xattr_loc = cpu_to_le64(first_blkno); |
2307 | ocfs2_journal_dirty(handle, inode_bh); | 2903 | |
2904 | spin_lock(&OCFS2_I(inode)->ip_lock); | ||
2905 | OCFS2_I(inode)->ip_dyn_features |= OCFS2_HAS_XATTR_FL; | ||
2906 | di->i_dyn_features = cpu_to_le16(OCFS2_I(inode)->ip_dyn_features); | ||
2907 | spin_unlock(&OCFS2_I(inode)->ip_lock); | ||
2908 | |||
2909 | ocfs2_journal_dirty(ctxt->handle, inode_bh); | ||
2308 | 2910 | ||
2309 | *ret_bh = new_bh; | 2911 | *ret_bh = new_bh; |
2310 | new_bh = NULL; | 2912 | new_bh = NULL; |
@@ -2326,13 +2928,13 @@ static int ocfs2_xattr_block_set(struct inode *inode, | |||
2326 | struct ocfs2_xattr_set_ctxt *ctxt) | 2928 | struct ocfs2_xattr_set_ctxt *ctxt) |
2327 | { | 2929 | { |
2328 | struct buffer_head *new_bh = NULL; | 2930 | struct buffer_head *new_bh = NULL; |
2329 | handle_t *handle = ctxt->handle; | ||
2330 | struct ocfs2_xattr_block *xblk = NULL; | 2931 | struct ocfs2_xattr_block *xblk = NULL; |
2331 | int ret; | 2932 | int ret; |
2933 | struct ocfs2_xa_loc loc; | ||
2332 | 2934 | ||
2333 | if (!xs->xattr_bh) { | 2935 | if (!xs->xattr_bh) { |
2334 | ret = ocfs2_create_xattr_block(handle, inode, xs->inode_bh, | 2936 | ret = ocfs2_create_xattr_block(inode, xs->inode_bh, ctxt, |
2335 | ctxt->meta_ac, &new_bh, 0); | 2937 | 0, &new_bh); |
2336 | if (ret) { | 2938 | if (ret) { |
2337 | mlog_errno(ret); | 2939 | mlog_errno(ret); |
2338 | goto end; | 2940 | goto end; |
@@ -2348,21 +2950,25 @@ static int ocfs2_xattr_block_set(struct inode *inode, | |||
2348 | xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data; | 2950 | xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data; |
2349 | 2951 | ||
2350 | if (!(le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)) { | 2952 | if (!(le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)) { |
2351 | /* Set extended attribute into external block */ | 2953 | ocfs2_init_xattr_block_xa_loc(&loc, inode, xs->xattr_bh, |
2352 | ret = ocfs2_xattr_set_entry(inode, xi, xs, ctxt, | 2954 | xs->not_found ? NULL : xs->here); |
2353 | OCFS2_HAS_XATTR_FL); | ||
2354 | if (!ret || ret != -ENOSPC) | ||
2355 | goto end; | ||
2356 | 2955 | ||
2357 | ret = ocfs2_xattr_create_index_block(inode, xs, ctxt); | 2956 | ret = ocfs2_xa_set(&loc, xi, ctxt); |
2358 | if (ret) | 2957 | if (!ret) |
2958 | xs->here = loc.xl_entry; | ||
2959 | else if (ret != -ENOSPC) | ||
2359 | goto end; | 2960 | goto end; |
2961 | else { | ||
2962 | ret = ocfs2_xattr_create_index_block(inode, xs, ctxt); | ||
2963 | if (ret) | ||
2964 | goto end; | ||
2965 | } | ||
2360 | } | 2966 | } |
2361 | 2967 | ||
2362 | ret = ocfs2_xattr_set_entry_index_block(inode, xi, xs, ctxt); | 2968 | if (le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED) |
2969 | ret = ocfs2_xattr_set_entry_index_block(inode, xi, xs, ctxt); | ||
2363 | 2970 | ||
2364 | end: | 2971 | end: |
2365 | |||
2366 | return ret; | 2972 | return ret; |
2367 | } | 2973 | } |
2368 | 2974 | ||
@@ -2371,7 +2977,6 @@ static int ocfs2_xattr_can_be_in_inode(struct inode *inode, | |||
2371 | struct ocfs2_xattr_info *xi, | 2977 | struct ocfs2_xattr_info *xi, |
2372 | struct ocfs2_xattr_search *xs) | 2978 | struct ocfs2_xattr_search *xs) |
2373 | { | 2979 | { |
2374 | u64 value_size; | ||
2375 | struct ocfs2_xattr_entry *last; | 2980 | struct ocfs2_xattr_entry *last; |
2376 | int free, i; | 2981 | int free, i; |
2377 | size_t min_offs = xs->end - xs->base; | 2982 | size_t min_offs = xs->end - xs->base; |
@@ -2394,13 +2999,7 @@ static int ocfs2_xattr_can_be_in_inode(struct inode *inode, | |||
2394 | 2999 | ||
2395 | BUG_ON(!xs->not_found); | 3000 | BUG_ON(!xs->not_found); |
2396 | 3001 | ||
2397 | if (xi->value_len > OCFS2_XATTR_INLINE_SIZE) | 3002 | if (free >= (sizeof(struct ocfs2_xattr_entry) + namevalue_size_xi(xi))) |
2398 | value_size = OCFS2_XATTR_ROOT_SIZE; | ||
2399 | else | ||
2400 | value_size = OCFS2_XATTR_SIZE(xi->value_len); | ||
2401 | |||
2402 | if (free >= sizeof(struct ocfs2_xattr_entry) + | ||
2403 | OCFS2_XATTR_SIZE(strlen(xi->name)) + value_size) | ||
2404 | return 1; | 3003 | return 1; |
2405 | 3004 | ||
2406 | return 0; | 3005 | return 0; |
@@ -2424,7 +3023,7 @@ static int ocfs2_calc_xattr_set_need(struct inode *inode, | |||
2424 | char *base = NULL; | 3023 | char *base = NULL; |
2425 | int name_offset, name_len = 0; | 3024 | int name_offset, name_len = 0; |
2426 | u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb, | 3025 | u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb, |
2427 | xi->value_len); | 3026 | xi->xi_value_len); |
2428 | u64 value_size; | 3027 | u64 value_size; |
2429 | 3028 | ||
2430 | /* | 3029 | /* |
@@ -2432,14 +3031,14 @@ static int ocfs2_calc_xattr_set_need(struct inode *inode, | |||
2432 | * No matter whether we replace an old one or add a new one, | 3031 | * No matter whether we replace an old one or add a new one, |
2433 | * we need this for writing. | 3032 | * we need this for writing. |
2434 | */ | 3033 | */ |
2435 | if (xi->value_len > OCFS2_XATTR_INLINE_SIZE) | 3034 | if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) |
2436 | credits += new_clusters * | 3035 | credits += new_clusters * |
2437 | ocfs2_clusters_to_blocks(inode->i_sb, 1); | 3036 | ocfs2_clusters_to_blocks(inode->i_sb, 1); |
2438 | 3037 | ||
2439 | if (xis->not_found && xbs->not_found) { | 3038 | if (xis->not_found && xbs->not_found) { |
2440 | credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb); | 3039 | credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb); |
2441 | 3040 | ||
2442 | if (xi->value_len > OCFS2_XATTR_INLINE_SIZE) { | 3041 | if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) { |
2443 | clusters_add += new_clusters; | 3042 | clusters_add += new_clusters; |
2444 | credits += ocfs2_calc_extend_credits(inode->i_sb, | 3043 | credits += ocfs2_calc_extend_credits(inode->i_sb, |
2445 | &def_xv.xv.xr_list, | 3044 | &def_xv.xv.xr_list, |
@@ -2484,7 +3083,7 @@ static int ocfs2_calc_xattr_set_need(struct inode *inode, | |||
2484 | * The credits for removing the value tree will be extended | 3083 | * The credits for removing the value tree will be extended |
2485 | * by ocfs2_remove_extent itself. | 3084 | * by ocfs2_remove_extent itself. |
2486 | */ | 3085 | */ |
2487 | if (!xi->value) { | 3086 | if (!xi->xi_value) { |
2488 | if (!ocfs2_xattr_is_local(xe)) | 3087 | if (!ocfs2_xattr_is_local(xe)) |
2489 | credits += ocfs2_remove_extent_credits(inode->i_sb); | 3088 | credits += ocfs2_remove_extent_credits(inode->i_sb); |
2490 | 3089 | ||
@@ -2514,7 +3113,7 @@ static int ocfs2_calc_xattr_set_need(struct inode *inode, | |||
2514 | } | 3113 | } |
2515 | } | 3114 | } |
2516 | 3115 | ||
2517 | if (xi->value_len > OCFS2_XATTR_INLINE_SIZE) { | 3116 | if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) { |
2518 | /* the new values will be stored outside. */ | 3117 | /* the new values will be stored outside. */ |
2519 | u32 old_clusters = 0; | 3118 | u32 old_clusters = 0; |
2520 | 3119 | ||
@@ -2547,9 +3146,10 @@ static int ocfs2_calc_xattr_set_need(struct inode *inode, | |||
2547 | * value, we don't need any allocation, otherwise we have | 3146 | * value, we don't need any allocation, otherwise we have |
2548 | * to guess metadata allocation. | 3147 | * to guess metadata allocation. |
2549 | */ | 3148 | */ |
2550 | if ((ocfs2_xattr_is_local(xe) && value_size >= xi->value_len) || | 3149 | if ((ocfs2_xattr_is_local(xe) && |
3150 | (value_size >= xi->xi_value_len)) || | ||
2551 | (!ocfs2_xattr_is_local(xe) && | 3151 | (!ocfs2_xattr_is_local(xe) && |
2552 | OCFS2_XATTR_ROOT_SIZE >= xi->value_len)) | 3152 | OCFS2_XATTR_ROOT_SIZE >= xi->xi_value_len)) |
2553 | goto out; | 3153 | goto out; |
2554 | } | 3154 | } |
2555 | 3155 | ||
@@ -2639,7 +3239,7 @@ static int ocfs2_init_xattr_set_ctxt(struct inode *inode, | |||
2639 | 3239 | ||
2640 | meta_add += extra_meta; | 3240 | meta_add += extra_meta; |
2641 | mlog(0, "Set xattr %s, reserve meta blocks = %d, clusters = %d, " | 3241 | mlog(0, "Set xattr %s, reserve meta blocks = %d, clusters = %d, " |
2642 | "credits = %d\n", xi->name, meta_add, clusters_add, *credits); | 3242 | "credits = %d\n", xi->xi_name, meta_add, clusters_add, *credits); |
2643 | 3243 | ||
2644 | if (meta_add) { | 3244 | if (meta_add) { |
2645 | ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add, | 3245 | ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add, |
@@ -2679,7 +3279,7 @@ static int __ocfs2_xattr_set_handle(struct inode *inode, | |||
2679 | { | 3279 | { |
2680 | int ret = 0, credits, old_found; | 3280 | int ret = 0, credits, old_found; |
2681 | 3281 | ||
2682 | if (!xi->value) { | 3282 | if (!xi->xi_value) { |
2683 | /* Remove existing extended attribute */ | 3283 | /* Remove existing extended attribute */ |
2684 | if (!xis->not_found) | 3284 | if (!xis->not_found) |
2685 | ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt); | 3285 | ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt); |
@@ -2693,8 +3293,8 @@ static int __ocfs2_xattr_set_handle(struct inode *inode, | |||
2693 | * If succeed and that extended attribute existing in | 3293 | * If succeed and that extended attribute existing in |
2694 | * external block, then we will remove it. | 3294 | * external block, then we will remove it. |
2695 | */ | 3295 | */ |
2696 | xi->value = NULL; | 3296 | xi->xi_value = NULL; |
2697 | xi->value_len = 0; | 3297 | xi->xi_value_len = 0; |
2698 | 3298 | ||
2699 | old_found = xis->not_found; | 3299 | old_found = xis->not_found; |
2700 | xis->not_found = -ENODATA; | 3300 | xis->not_found = -ENODATA; |
@@ -2722,8 +3322,8 @@ static int __ocfs2_xattr_set_handle(struct inode *inode, | |||
2722 | } else if (ret == -ENOSPC) { | 3322 | } else if (ret == -ENOSPC) { |
2723 | if (di->i_xattr_loc && !xbs->xattr_bh) { | 3323 | if (di->i_xattr_loc && !xbs->xattr_bh) { |
2724 | ret = ocfs2_xattr_block_find(inode, | 3324 | ret = ocfs2_xattr_block_find(inode, |
2725 | xi->name_index, | 3325 | xi->xi_name_index, |
2726 | xi->name, xbs); | 3326 | xi->xi_name, xbs); |
2727 | if (ret) | 3327 | if (ret) |
2728 | goto out; | 3328 | goto out; |
2729 | 3329 | ||
@@ -2762,8 +3362,8 @@ static int __ocfs2_xattr_set_handle(struct inode *inode, | |||
2762 | * If succeed and that extended attribute | 3362 | * If succeed and that extended attribute |
2763 | * existing in inode, we will remove it. | 3363 | * existing in inode, we will remove it. |
2764 | */ | 3364 | */ |
2765 | xi->value = NULL; | 3365 | xi->xi_value = NULL; |
2766 | xi->value_len = 0; | 3366 | xi->xi_value_len = 0; |
2767 | xbs->not_found = -ENODATA; | 3367 | xbs->not_found = -ENODATA; |
2768 | ret = ocfs2_calc_xattr_set_need(inode, | 3368 | ret = ocfs2_calc_xattr_set_need(inode, |
2769 | di, | 3369 | di, |
@@ -2829,10 +3429,11 @@ int ocfs2_xattr_set_handle(handle_t *handle, | |||
2829 | int ret; | 3429 | int ret; |
2830 | 3430 | ||
2831 | struct ocfs2_xattr_info xi = { | 3431 | struct ocfs2_xattr_info xi = { |
2832 | .name_index = name_index, | 3432 | .xi_name_index = name_index, |
2833 | .name = name, | 3433 | .xi_name = name, |
2834 | .value = value, | 3434 | .xi_name_len = strlen(name), |
2835 | .value_len = value_len, | 3435 | .xi_value = value, |
3436 | .xi_value_len = value_len, | ||
2836 | }; | 3437 | }; |
2837 | 3438 | ||
2838 | struct ocfs2_xattr_search xis = { | 3439 | struct ocfs2_xattr_search xis = { |
@@ -2912,10 +3513,11 @@ int ocfs2_xattr_set(struct inode *inode, | |||
2912 | struct ocfs2_refcount_tree *ref_tree = NULL; | 3513 | struct ocfs2_refcount_tree *ref_tree = NULL; |
2913 | 3514 | ||
2914 | struct ocfs2_xattr_info xi = { | 3515 | struct ocfs2_xattr_info xi = { |
2915 | .name_index = name_index, | 3516 | .xi_name_index = name_index, |
2916 | .name = name, | 3517 | .xi_name = name, |
2917 | .value = value, | 3518 | .xi_name_len = strlen(name), |
2918 | .value_len = value_len, | 3519 | .xi_value = value, |
3520 | .xi_value_len = value_len, | ||
2919 | }; | 3521 | }; |
2920 | 3522 | ||
2921 | struct ocfs2_xattr_search xis = { | 3523 | struct ocfs2_xattr_search xis = { |
@@ -3759,7 +4361,7 @@ static int ocfs2_defrag_xattr_bucket(struct inode *inode, | |||
3759 | struct ocfs2_xattr_bucket *bucket) | 4361 | struct ocfs2_xattr_bucket *bucket) |
3760 | { | 4362 | { |
3761 | int ret, i; | 4363 | int ret, i; |
3762 | size_t end, offset, len, value_len; | 4364 | size_t end, offset, len; |
3763 | struct ocfs2_xattr_header *xh; | 4365 | struct ocfs2_xattr_header *xh; |
3764 | char *entries, *buf, *bucket_buf = NULL; | 4366 | char *entries, *buf, *bucket_buf = NULL; |
3765 | u64 blkno = bucket_blkno(bucket); | 4367 | u64 blkno = bucket_blkno(bucket); |
@@ -3813,12 +4415,7 @@ static int ocfs2_defrag_xattr_bucket(struct inode *inode, | |||
3813 | end = OCFS2_XATTR_BUCKET_SIZE; | 4415 | end = OCFS2_XATTR_BUCKET_SIZE; |
3814 | for (i = 0; i < le16_to_cpu(xh->xh_count); i++, xe++) { | 4416 | for (i = 0; i < le16_to_cpu(xh->xh_count); i++, xe++) { |
3815 | offset = le16_to_cpu(xe->xe_name_offset); | 4417 | offset = le16_to_cpu(xe->xe_name_offset); |
3816 | if (ocfs2_xattr_is_local(xe)) | 4418 | len = namevalue_size_xe(xe); |
3817 | value_len = OCFS2_XATTR_SIZE( | ||
3818 | le64_to_cpu(xe->xe_value_size)); | ||
3819 | else | ||
3820 | value_len = OCFS2_XATTR_ROOT_SIZE; | ||
3821 | len = OCFS2_XATTR_SIZE(xe->xe_name_len) + value_len; | ||
3822 | 4419 | ||
3823 | /* | 4420 | /* |
3824 | * We must make sure that the name/value pair | 4421 | * We must make sure that the name/value pair |
@@ -4007,7 +4604,7 @@ static int ocfs2_divide_xattr_bucket(struct inode *inode, | |||
4007 | int new_bucket_head) | 4604 | int new_bucket_head) |
4008 | { | 4605 | { |
4009 | int ret, i; | 4606 | int ret, i; |
4010 | int count, start, len, name_value_len = 0, xe_len, name_offset = 0; | 4607 | int count, start, len, name_value_len = 0, name_offset = 0; |
4011 | struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL; | 4608 | struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL; |
4012 | struct ocfs2_xattr_header *xh; | 4609 | struct ocfs2_xattr_header *xh; |
4013 | struct ocfs2_xattr_entry *xe; | 4610 | struct ocfs2_xattr_entry *xe; |
@@ -4098,13 +4695,7 @@ static int ocfs2_divide_xattr_bucket(struct inode *inode, | |||
4098 | name_value_len = 0; | 4695 | name_value_len = 0; |
4099 | for (i = 0; i < start; i++) { | 4696 | for (i = 0; i < start; i++) { |
4100 | xe = &xh->xh_entries[i]; | 4697 | xe = &xh->xh_entries[i]; |
4101 | xe_len = OCFS2_XATTR_SIZE(xe->xe_name_len); | 4698 | name_value_len += namevalue_size_xe(xe); |
4102 | if (ocfs2_xattr_is_local(xe)) | ||
4103 | xe_len += | ||
4104 | OCFS2_XATTR_SIZE(le64_to_cpu(xe->xe_value_size)); | ||
4105 | else | ||
4106 | xe_len += OCFS2_XATTR_ROOT_SIZE; | ||
4107 | name_value_len += xe_len; | ||
4108 | if (le16_to_cpu(xe->xe_name_offset) < name_offset) | 4699 | if (le16_to_cpu(xe->xe_name_offset) < name_offset) |
4109 | name_offset = le16_to_cpu(xe->xe_name_offset); | 4700 | name_offset = le16_to_cpu(xe->xe_name_offset); |
4110 | } | 4701 | } |
@@ -4134,12 +4725,6 @@ static int ocfs2_divide_xattr_bucket(struct inode *inode, | |||
4134 | xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE); | 4725 | xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE); |
4135 | for (i = 0; i < le16_to_cpu(xh->xh_count); i++) { | 4726 | for (i = 0; i < le16_to_cpu(xh->xh_count); i++) { |
4136 | xe = &xh->xh_entries[i]; | 4727 | xe = &xh->xh_entries[i]; |
4137 | xe_len = OCFS2_XATTR_SIZE(xe->xe_name_len); | ||
4138 | if (ocfs2_xattr_is_local(xe)) | ||
4139 | xe_len += | ||
4140 | OCFS2_XATTR_SIZE(le64_to_cpu(xe->xe_value_size)); | ||
4141 | else | ||
4142 | xe_len += OCFS2_XATTR_ROOT_SIZE; | ||
4143 | if (le16_to_cpu(xe->xe_name_offset) < | 4728 | if (le16_to_cpu(xe->xe_name_offset) < |
4144 | le16_to_cpu(xh->xh_free_start)) | 4729 | le16_to_cpu(xh->xh_free_start)) |
4145 | xh->xh_free_start = xe->xe_name_offset; | 4730 | xh->xh_free_start = xe->xe_name_offset; |
@@ -4751,195 +5336,6 @@ static inline char *ocfs2_xattr_bucket_get_val(struct inode *inode, | |||
4751 | } | 5336 | } |
4752 | 5337 | ||
4753 | /* | 5338 | /* |
4754 | * Handle the normal xattr set, including replace, delete and new. | ||
4755 | * | ||
4756 | * Note: "local" indicates the real data's locality. So we can't | ||
4757 | * just its bucket locality by its length. | ||
4758 | */ | ||
4759 | static void ocfs2_xattr_set_entry_normal(struct inode *inode, | ||
4760 | struct ocfs2_xattr_info *xi, | ||
4761 | struct ocfs2_xattr_search *xs, | ||
4762 | u32 name_hash, | ||
4763 | int local) | ||
4764 | { | ||
4765 | struct ocfs2_xattr_entry *last, *xe; | ||
4766 | int name_len = strlen(xi->name); | ||
4767 | struct ocfs2_xattr_header *xh = xs->header; | ||
4768 | u16 count = le16_to_cpu(xh->xh_count), start; | ||
4769 | size_t blocksize = inode->i_sb->s_blocksize; | ||
4770 | char *val; | ||
4771 | size_t offs, size, new_size; | ||
4772 | |||
4773 | last = &xh->xh_entries[count]; | ||
4774 | if (!xs->not_found) { | ||
4775 | xe = xs->here; | ||
4776 | offs = le16_to_cpu(xe->xe_name_offset); | ||
4777 | if (ocfs2_xattr_is_local(xe)) | ||
4778 | size = OCFS2_XATTR_SIZE(name_len) + | ||
4779 | OCFS2_XATTR_SIZE(le64_to_cpu(xe->xe_value_size)); | ||
4780 | else | ||
4781 | size = OCFS2_XATTR_SIZE(name_len) + | ||
4782 | OCFS2_XATTR_SIZE(OCFS2_XATTR_ROOT_SIZE); | ||
4783 | |||
4784 | /* | ||
4785 | * If the new value will be stored outside, xi->value has been | ||
4786 | * initalized as an empty ocfs2_xattr_value_root, and the same | ||
4787 | * goes with xi->value_len, so we can set new_size safely here. | ||
4788 | * See ocfs2_xattr_set_in_bucket. | ||
4789 | */ | ||
4790 | new_size = OCFS2_XATTR_SIZE(name_len) + | ||
4791 | OCFS2_XATTR_SIZE(xi->value_len); | ||
4792 | |||
4793 | le16_add_cpu(&xh->xh_name_value_len, -size); | ||
4794 | if (xi->value) { | ||
4795 | if (new_size > size) | ||
4796 | goto set_new_name_value; | ||
4797 | |||
4798 | /* Now replace the old value with new one. */ | ||
4799 | if (local) | ||
4800 | xe->xe_value_size = cpu_to_le64(xi->value_len); | ||
4801 | else | ||
4802 | xe->xe_value_size = 0; | ||
4803 | |||
4804 | val = ocfs2_xattr_bucket_get_val(inode, | ||
4805 | xs->bucket, offs); | ||
4806 | memset(val + OCFS2_XATTR_SIZE(name_len), 0, | ||
4807 | size - OCFS2_XATTR_SIZE(name_len)); | ||
4808 | if (OCFS2_XATTR_SIZE(xi->value_len) > 0) | ||
4809 | memcpy(val + OCFS2_XATTR_SIZE(name_len), | ||
4810 | xi->value, xi->value_len); | ||
4811 | |||
4812 | le16_add_cpu(&xh->xh_name_value_len, new_size); | ||
4813 | ocfs2_xattr_set_local(xe, local); | ||
4814 | return; | ||
4815 | } else { | ||
4816 | /* | ||
4817 | * Remove the old entry if there is more than one. | ||
4818 | * We don't remove the last entry so that we can | ||
4819 | * use it to indicate the hash value of the empty | ||
4820 | * bucket. | ||
4821 | */ | ||
4822 | last -= 1; | ||
4823 | le16_add_cpu(&xh->xh_count, -1); | ||
4824 | if (xh->xh_count) { | ||
4825 | memmove(xe, xe + 1, | ||
4826 | (void *)last - (void *)xe); | ||
4827 | memset(last, 0, | ||
4828 | sizeof(struct ocfs2_xattr_entry)); | ||
4829 | } else | ||
4830 | xh->xh_free_start = | ||
4831 | cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE); | ||
4832 | |||
4833 | return; | ||
4834 | } | ||
4835 | } else { | ||
4836 | /* find a new entry for insert. */ | ||
4837 | int low = 0, high = count - 1, tmp; | ||
4838 | struct ocfs2_xattr_entry *tmp_xe; | ||
4839 | |||
4840 | while (low <= high && count) { | ||
4841 | tmp = (low + high) / 2; | ||
4842 | tmp_xe = &xh->xh_entries[tmp]; | ||
4843 | |||
4844 | if (name_hash > le32_to_cpu(tmp_xe->xe_name_hash)) | ||
4845 | low = tmp + 1; | ||
4846 | else if (name_hash < | ||
4847 | le32_to_cpu(tmp_xe->xe_name_hash)) | ||
4848 | high = tmp - 1; | ||
4849 | else { | ||
4850 | low = tmp; | ||
4851 | break; | ||
4852 | } | ||
4853 | } | ||
4854 | |||
4855 | xe = &xh->xh_entries[low]; | ||
4856 | if (low != count) | ||
4857 | memmove(xe + 1, xe, (void *)last - (void *)xe); | ||
4858 | |||
4859 | le16_add_cpu(&xh->xh_count, 1); | ||
4860 | memset(xe, 0, sizeof(struct ocfs2_xattr_entry)); | ||
4861 | xe->xe_name_hash = cpu_to_le32(name_hash); | ||
4862 | xe->xe_name_len = name_len; | ||
4863 | ocfs2_xattr_set_type(xe, xi->name_index); | ||
4864 | } | ||
4865 | |||
4866 | set_new_name_value: | ||
4867 | /* Insert the new name+value. */ | ||
4868 | size = OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_SIZE(xi->value_len); | ||
4869 | |||
4870 | /* | ||
4871 | * We must make sure that the name/value pair | ||
4872 | * exists in the same block. | ||
4873 | */ | ||
4874 | offs = le16_to_cpu(xh->xh_free_start); | ||
4875 | start = offs - size; | ||
4876 | |||
4877 | if (start >> inode->i_sb->s_blocksize_bits != | ||
4878 | (offs - 1) >> inode->i_sb->s_blocksize_bits) { | ||
4879 | offs = offs - offs % blocksize; | ||
4880 | xh->xh_free_start = cpu_to_le16(offs); | ||
4881 | } | ||
4882 | |||
4883 | val = ocfs2_xattr_bucket_get_val(inode, xs->bucket, offs - size); | ||
4884 | xe->xe_name_offset = cpu_to_le16(offs - size); | ||
4885 | |||
4886 | memset(val, 0, size); | ||
4887 | memcpy(val, xi->name, name_len); | ||
4888 | memcpy(val + OCFS2_XATTR_SIZE(name_len), xi->value, xi->value_len); | ||
4889 | |||
4890 | xe->xe_value_size = cpu_to_le64(xi->value_len); | ||
4891 | ocfs2_xattr_set_local(xe, local); | ||
4892 | xs->here = xe; | ||
4893 | le16_add_cpu(&xh->xh_free_start, -size); | ||
4894 | le16_add_cpu(&xh->xh_name_value_len, size); | ||
4895 | |||
4896 | return; | ||
4897 | } | ||
4898 | |||
4899 | /* | ||
4900 | * Set the xattr entry in the specified bucket. | ||
4901 | * The bucket is indicated by xs->bucket and it should have the enough | ||
4902 | * space for the xattr insertion. | ||
4903 | */ | ||
4904 | static int ocfs2_xattr_set_entry_in_bucket(struct inode *inode, | ||
4905 | handle_t *handle, | ||
4906 | struct ocfs2_xattr_info *xi, | ||
4907 | struct ocfs2_xattr_search *xs, | ||
4908 | u32 name_hash, | ||
4909 | int local) | ||
4910 | { | ||
4911 | int ret; | ||
4912 | u64 blkno; | ||
4913 | |||
4914 | mlog(0, "Set xattr entry len = %lu index = %d in bucket %llu\n", | ||
4915 | (unsigned long)xi->value_len, xi->name_index, | ||
4916 | (unsigned long long)bucket_blkno(xs->bucket)); | ||
4917 | |||
4918 | if (!xs->bucket->bu_bhs[1]) { | ||
4919 | blkno = bucket_blkno(xs->bucket); | ||
4920 | ocfs2_xattr_bucket_relse(xs->bucket); | ||
4921 | ret = ocfs2_read_xattr_bucket(xs->bucket, blkno); | ||
4922 | if (ret) { | ||
4923 | mlog_errno(ret); | ||
4924 | goto out; | ||
4925 | } | ||
4926 | } | ||
4927 | |||
4928 | ret = ocfs2_xattr_bucket_journal_access(handle, xs->bucket, | ||
4929 | OCFS2_JOURNAL_ACCESS_WRITE); | ||
4930 | if (ret < 0) { | ||
4931 | mlog_errno(ret); | ||
4932 | goto out; | ||
4933 | } | ||
4934 | |||
4935 | ocfs2_xattr_set_entry_normal(inode, xi, xs, name_hash, local); | ||
4936 | ocfs2_xattr_bucket_journal_dirty(handle, xs->bucket); | ||
4937 | |||
4938 | out: | ||
4939 | return ret; | ||
4940 | } | ||
4941 | |||
4942 | /* | ||
4943 | * Truncate the specified xe_off entry in xattr bucket. | 5339 | * Truncate the specified xe_off entry in xattr bucket. |
4944 | * bucket is indicated by header_bh and len is the new length. | 5340 | * bucket is indicated by header_bh and len is the new length. |
4945 | * Both the ocfs2_xattr_value_root and the entry will be updated here. | 5341 | * Both the ocfs2_xattr_value_root and the entry will be updated here. |
@@ -5009,66 +5405,6 @@ out: | |||
5009 | return ret; | 5405 | return ret; |
5010 | } | 5406 | } |
5011 | 5407 | ||
5012 | static int ocfs2_xattr_bucket_value_truncate_xs(struct inode *inode, | ||
5013 | struct ocfs2_xattr_search *xs, | ||
5014 | int len, | ||
5015 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
5016 | { | ||
5017 | int ret, offset; | ||
5018 | struct ocfs2_xattr_entry *xe = xs->here; | ||
5019 | struct ocfs2_xattr_header *xh = (struct ocfs2_xattr_header *)xs->base; | ||
5020 | |||
5021 | BUG_ON(!xs->bucket->bu_bhs[0] || !xe || ocfs2_xattr_is_local(xe)); | ||
5022 | |||
5023 | offset = xe - xh->xh_entries; | ||
5024 | ret = ocfs2_xattr_bucket_value_truncate(inode, xs->bucket, | ||
5025 | offset, len, ctxt); | ||
5026 | if (ret) | ||
5027 | mlog_errno(ret); | ||
5028 | |||
5029 | return ret; | ||
5030 | } | ||
5031 | |||
5032 | static int ocfs2_xattr_bucket_set_value_outside(struct inode *inode, | ||
5033 | handle_t *handle, | ||
5034 | struct ocfs2_xattr_search *xs, | ||
5035 | char *val, | ||
5036 | int value_len) | ||
5037 | { | ||
5038 | int ret, offset, block_off; | ||
5039 | struct ocfs2_xattr_value_root *xv; | ||
5040 | struct ocfs2_xattr_entry *xe = xs->here; | ||
5041 | struct ocfs2_xattr_header *xh = bucket_xh(xs->bucket); | ||
5042 | void *base; | ||
5043 | struct ocfs2_xattr_value_buf vb = { | ||
5044 | .vb_access = ocfs2_journal_access, | ||
5045 | }; | ||
5046 | |||
5047 | BUG_ON(!xs->base || !xe || ocfs2_xattr_is_local(xe)); | ||
5048 | |||
5049 | ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb, xh, | ||
5050 | xe - xh->xh_entries, | ||
5051 | &block_off, | ||
5052 | &offset); | ||
5053 | if (ret) { | ||
5054 | mlog_errno(ret); | ||
5055 | goto out; | ||
5056 | } | ||
5057 | |||
5058 | base = bucket_block(xs->bucket, block_off); | ||
5059 | xv = (struct ocfs2_xattr_value_root *)(base + offset + | ||
5060 | OCFS2_XATTR_SIZE(xe->xe_name_len)); | ||
5061 | |||
5062 | vb.vb_xv = xv; | ||
5063 | vb.vb_bh = xs->bucket->bu_bhs[block_off]; | ||
5064 | ret = __ocfs2_xattr_set_value_outside(inode, handle, | ||
5065 | &vb, val, value_len); | ||
5066 | if (ret) | ||
5067 | mlog_errno(ret); | ||
5068 | out: | ||
5069 | return ret; | ||
5070 | } | ||
5071 | |||
5072 | static int ocfs2_rm_xattr_cluster(struct inode *inode, | 5408 | static int ocfs2_rm_xattr_cluster(struct inode *inode, |
5073 | struct buffer_head *root_bh, | 5409 | struct buffer_head *root_bh, |
5074 | u64 blkno, | 5410 | u64 blkno, |
@@ -5167,128 +5503,6 @@ out: | |||
5167 | return ret; | 5503 | return ret; |
5168 | } | 5504 | } |
5169 | 5505 | ||
5170 | static void ocfs2_xattr_bucket_remove_xs(struct inode *inode, | ||
5171 | handle_t *handle, | ||
5172 | struct ocfs2_xattr_search *xs) | ||
5173 | { | ||
5174 | struct ocfs2_xattr_header *xh = bucket_xh(xs->bucket); | ||
5175 | struct ocfs2_xattr_entry *last = &xh->xh_entries[ | ||
5176 | le16_to_cpu(xh->xh_count) - 1]; | ||
5177 | int ret = 0; | ||
5178 | |||
5179 | ret = ocfs2_xattr_bucket_journal_access(handle, xs->bucket, | ||
5180 | OCFS2_JOURNAL_ACCESS_WRITE); | ||
5181 | if (ret) { | ||
5182 | mlog_errno(ret); | ||
5183 | return; | ||
5184 | } | ||
5185 | |||
5186 | /* Remove the old entry. */ | ||
5187 | memmove(xs->here, xs->here + 1, | ||
5188 | (void *)last - (void *)xs->here); | ||
5189 | memset(last, 0, sizeof(struct ocfs2_xattr_entry)); | ||
5190 | le16_add_cpu(&xh->xh_count, -1); | ||
5191 | |||
5192 | ocfs2_xattr_bucket_journal_dirty(handle, xs->bucket); | ||
5193 | } | ||
5194 | |||
5195 | /* | ||
5196 | * Set the xattr name/value in the bucket specified in xs. | ||
5197 | * | ||
5198 | * As the new value in xi may be stored in the bucket or in an outside cluster, | ||
5199 | * we divide the whole process into 3 steps: | ||
5200 | * 1. insert name/value in the bucket(ocfs2_xattr_set_entry_in_bucket) | ||
5201 | * 2. truncate of the outside cluster(ocfs2_xattr_bucket_value_truncate_xs) | ||
5202 | * 3. Set the value to the outside cluster(ocfs2_xattr_bucket_set_value_outside) | ||
5203 | * 4. If the clusters for the new outside value can't be allocated, we need | ||
5204 | * to free the xattr we allocated in set. | ||
5205 | */ | ||
5206 | static int ocfs2_xattr_set_in_bucket(struct inode *inode, | ||
5207 | struct ocfs2_xattr_info *xi, | ||
5208 | struct ocfs2_xattr_search *xs, | ||
5209 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
5210 | { | ||
5211 | int ret, local = 1; | ||
5212 | size_t value_len; | ||
5213 | char *val = (char *)xi->value; | ||
5214 | struct ocfs2_xattr_entry *xe = xs->here; | ||
5215 | u32 name_hash = ocfs2_xattr_name_hash(inode, xi->name, | ||
5216 | strlen(xi->name)); | ||
5217 | |||
5218 | if (!xs->not_found && !ocfs2_xattr_is_local(xe)) { | ||
5219 | /* | ||
5220 | * We need to truncate the xattr storage first. | ||
5221 | * | ||
5222 | * If both the old and new value are stored to | ||
5223 | * outside block, we only need to truncate | ||
5224 | * the storage and then set the value outside. | ||
5225 | * | ||
5226 | * If the new value should be stored within block, | ||
5227 | * we should free all the outside block first and | ||
5228 | * the modification to the xattr block will be done | ||
5229 | * by following steps. | ||
5230 | */ | ||
5231 | if (xi->value_len > OCFS2_XATTR_INLINE_SIZE) | ||
5232 | value_len = xi->value_len; | ||
5233 | else | ||
5234 | value_len = 0; | ||
5235 | |||
5236 | ret = ocfs2_xattr_bucket_value_truncate_xs(inode, xs, | ||
5237 | value_len, | ||
5238 | ctxt); | ||
5239 | if (ret) | ||
5240 | goto out; | ||
5241 | |||
5242 | if (value_len) | ||
5243 | goto set_value_outside; | ||
5244 | } | ||
5245 | |||
5246 | value_len = xi->value_len; | ||
5247 | /* So we have to handle the inside block change now. */ | ||
5248 | if (value_len > OCFS2_XATTR_INLINE_SIZE) { | ||
5249 | /* | ||
5250 | * If the new value will be stored outside of block, | ||
5251 | * initalize a new empty value root and insert it first. | ||
5252 | */ | ||
5253 | local = 0; | ||
5254 | xi->value = &def_xv; | ||
5255 | xi->value_len = OCFS2_XATTR_ROOT_SIZE; | ||
5256 | } | ||
5257 | |||
5258 | ret = ocfs2_xattr_set_entry_in_bucket(inode, ctxt->handle, xi, xs, | ||
5259 | name_hash, local); | ||
5260 | if (ret) { | ||
5261 | mlog_errno(ret); | ||
5262 | goto out; | ||
5263 | } | ||
5264 | |||
5265 | if (value_len <= OCFS2_XATTR_INLINE_SIZE) | ||
5266 | goto out; | ||
5267 | |||
5268 | /* allocate the space now for the outside block storage. */ | ||
5269 | ret = ocfs2_xattr_bucket_value_truncate_xs(inode, xs, | ||
5270 | value_len, ctxt); | ||
5271 | if (ret) { | ||
5272 | mlog_errno(ret); | ||
5273 | |||
5274 | if (xs->not_found) { | ||
5275 | /* | ||
5276 | * We can't allocate enough clusters for outside | ||
5277 | * storage and we have allocated xattr already, | ||
5278 | * so need to remove it. | ||
5279 | */ | ||
5280 | ocfs2_xattr_bucket_remove_xs(inode, ctxt->handle, xs); | ||
5281 | } | ||
5282 | goto out; | ||
5283 | } | ||
5284 | |||
5285 | set_value_outside: | ||
5286 | ret = ocfs2_xattr_bucket_set_value_outside(inode, ctxt->handle, | ||
5287 | xs, val, value_len); | ||
5288 | out: | ||
5289 | return ret; | ||
5290 | } | ||
5291 | |||
5292 | /* | 5506 | /* |
5293 | * check whether the xattr bucket is filled up with the same hash value. | 5507 | * check whether the xattr bucket is filled up with the same hash value. |
5294 | * If we want to insert the xattr with the same hash, return -ENOSPC. | 5508 | * If we want to insert the xattr with the same hash, return -ENOSPC. |
@@ -5317,156 +5531,116 @@ static int ocfs2_check_xattr_bucket_collision(struct inode *inode, | |||
5317 | return 0; | 5531 | return 0; |
5318 | } | 5532 | } |
5319 | 5533 | ||
5320 | static int ocfs2_xattr_set_entry_index_block(struct inode *inode, | 5534 | /* |
5321 | struct ocfs2_xattr_info *xi, | 5535 | * Try to set the entry in the current bucket. If we fail, the caller |
5322 | struct ocfs2_xattr_search *xs, | 5536 | * will handle getting us another bucket. |
5323 | struct ocfs2_xattr_set_ctxt *ctxt) | 5537 | */ |
5538 | static int ocfs2_xattr_set_entry_bucket(struct inode *inode, | ||
5539 | struct ocfs2_xattr_info *xi, | ||
5540 | struct ocfs2_xattr_search *xs, | ||
5541 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
5324 | { | 5542 | { |
5325 | struct ocfs2_xattr_header *xh; | 5543 | int ret; |
5326 | struct ocfs2_xattr_entry *xe; | 5544 | struct ocfs2_xa_loc loc; |
5327 | u16 count, header_size, xh_free_start; | ||
5328 | int free, max_free, need, old; | ||
5329 | size_t value_size = 0, name_len = strlen(xi->name); | ||
5330 | size_t blocksize = inode->i_sb->s_blocksize; | ||
5331 | int ret, allocation = 0; | ||
5332 | |||
5333 | mlog_entry("Set xattr %s in xattr index block\n", xi->name); | ||
5334 | |||
5335 | try_again: | ||
5336 | xh = xs->header; | ||
5337 | count = le16_to_cpu(xh->xh_count); | ||
5338 | xh_free_start = le16_to_cpu(xh->xh_free_start); | ||
5339 | header_size = sizeof(struct ocfs2_xattr_header) + | ||
5340 | count * sizeof(struct ocfs2_xattr_entry); | ||
5341 | max_free = OCFS2_XATTR_BUCKET_SIZE - header_size - | ||
5342 | le16_to_cpu(xh->xh_name_value_len) - OCFS2_XATTR_HEADER_GAP; | ||
5343 | |||
5344 | mlog_bug_on_msg(header_size > blocksize, "bucket %llu has header size " | ||
5345 | "of %u which exceed block size\n", | ||
5346 | (unsigned long long)bucket_blkno(xs->bucket), | ||
5347 | header_size); | ||
5348 | 5545 | ||
5349 | if (xi->value && xi->value_len > OCFS2_XATTR_INLINE_SIZE) | 5546 | mlog_entry("Set xattr %s in xattr bucket\n", xi->xi_name); |
5350 | value_size = OCFS2_XATTR_ROOT_SIZE; | ||
5351 | else if (xi->value) | ||
5352 | value_size = OCFS2_XATTR_SIZE(xi->value_len); | ||
5353 | 5547 | ||
5354 | if (xs->not_found) | 5548 | ocfs2_init_xattr_bucket_xa_loc(&loc, xs->bucket, |
5355 | need = sizeof(struct ocfs2_xattr_entry) + | 5549 | xs->not_found ? NULL : xs->here); |
5356 | OCFS2_XATTR_SIZE(name_len) + value_size; | 5550 | ret = ocfs2_xa_set(&loc, xi, ctxt); |
5357 | else { | 5551 | if (!ret) { |
5358 | need = value_size + OCFS2_XATTR_SIZE(name_len); | 5552 | xs->here = loc.xl_entry; |
5553 | goto out; | ||
5554 | } | ||
5555 | if (ret != -ENOSPC) { | ||
5556 | mlog_errno(ret); | ||
5557 | goto out; | ||
5558 | } | ||
5359 | 5559 | ||
5360 | /* | 5560 | /* Ok, we need space. Let's try defragmenting the bucket. */ |
5361 | * We only replace the old value if the new length is smaller | 5561 | ret = ocfs2_defrag_xattr_bucket(inode, ctxt->handle, |
5362 | * than the old one. Otherwise we will allocate new space in the | 5562 | xs->bucket); |
5363 | * bucket to store it. | 5563 | if (ret) { |
5364 | */ | 5564 | mlog_errno(ret); |
5365 | xe = xs->here; | 5565 | goto out; |
5366 | if (ocfs2_xattr_is_local(xe)) | 5566 | } |
5367 | old = OCFS2_XATTR_SIZE(le64_to_cpu(xe->xe_value_size)); | ||
5368 | else | ||
5369 | old = OCFS2_XATTR_SIZE(OCFS2_XATTR_ROOT_SIZE); | ||
5370 | 5567 | ||
5371 | if (old >= value_size) | 5568 | ret = ocfs2_xa_set(&loc, xi, ctxt); |
5372 | need = 0; | 5569 | if (!ret) { |
5570 | xs->here = loc.xl_entry; | ||
5571 | goto out; | ||
5373 | } | 5572 | } |
5573 | if (ret != -ENOSPC) | ||
5574 | mlog_errno(ret); | ||
5374 | 5575 | ||
5375 | free = xh_free_start - header_size - OCFS2_XATTR_HEADER_GAP; | ||
5376 | /* | ||
5377 | * We need to make sure the new name/value pair | ||
5378 | * can exist in the same block. | ||
5379 | */ | ||
5380 | if (xh_free_start % blocksize < need) | ||
5381 | free -= xh_free_start % blocksize; | ||
5382 | |||
5383 | mlog(0, "xs->not_found = %d, in xattr bucket %llu: free = %d, " | ||
5384 | "need = %d, max_free = %d, xh_free_start = %u, xh_name_value_len =" | ||
5385 | " %u\n", xs->not_found, | ||
5386 | (unsigned long long)bucket_blkno(xs->bucket), | ||
5387 | free, need, max_free, le16_to_cpu(xh->xh_free_start), | ||
5388 | le16_to_cpu(xh->xh_name_value_len)); | ||
5389 | |||
5390 | if (free < need || | ||
5391 | (xs->not_found && | ||
5392 | count == ocfs2_xattr_max_xe_in_bucket(inode->i_sb))) { | ||
5393 | if (need <= max_free && | ||
5394 | count < ocfs2_xattr_max_xe_in_bucket(inode->i_sb)) { | ||
5395 | /* | ||
5396 | * We can create the space by defragment. Since only the | ||
5397 | * name/value will be moved, the xe shouldn't be changed | ||
5398 | * in xs. | ||
5399 | */ | ||
5400 | ret = ocfs2_defrag_xattr_bucket(inode, ctxt->handle, | ||
5401 | xs->bucket); | ||
5402 | if (ret) { | ||
5403 | mlog_errno(ret); | ||
5404 | goto out; | ||
5405 | } | ||
5406 | 5576 | ||
5407 | xh_free_start = le16_to_cpu(xh->xh_free_start); | 5577 | out: |
5408 | free = xh_free_start - header_size | 5578 | mlog_exit(ret); |
5409 | - OCFS2_XATTR_HEADER_GAP; | 5579 | return ret; |
5410 | if (xh_free_start % blocksize < need) | 5580 | } |
5411 | free -= xh_free_start % blocksize; | ||
5412 | 5581 | ||
5413 | if (free >= need) | 5582 | static int ocfs2_xattr_set_entry_index_block(struct inode *inode, |
5414 | goto xattr_set; | 5583 | struct ocfs2_xattr_info *xi, |
5584 | struct ocfs2_xattr_search *xs, | ||
5585 | struct ocfs2_xattr_set_ctxt *ctxt) | ||
5586 | { | ||
5587 | int ret; | ||
5415 | 5588 | ||
5416 | mlog(0, "Can't get enough space for xattr insert by " | 5589 | mlog_entry("Set xattr %s in xattr index block\n", xi->xi_name); |
5417 | "defragment. Need %u bytes, but we have %d, so " | ||
5418 | "allocate new bucket for it.\n", need, free); | ||
5419 | } | ||
5420 | 5590 | ||
5421 | /* | 5591 | ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt); |
5422 | * We have to add new buckets or clusters and one | 5592 | if (!ret) |
5423 | * allocation should leave us enough space for insert. | 5593 | goto out; |
5424 | */ | 5594 | if (ret != -ENOSPC) { |
5425 | BUG_ON(allocation); | 5595 | mlog_errno(ret); |
5596 | goto out; | ||
5597 | } | ||
5426 | 5598 | ||
5427 | /* | 5599 | /* Ack, need more space. Let's try to get another bucket! */ |
5428 | * We do not allow for overlapping ranges between buckets. And | ||
5429 | * the maximum number of collisions we will allow for then is | ||
5430 | * one bucket's worth, so check it here whether we need to | ||
5431 | * add a new bucket for the insert. | ||
5432 | */ | ||
5433 | ret = ocfs2_check_xattr_bucket_collision(inode, | ||
5434 | xs->bucket, | ||
5435 | xi->name); | ||
5436 | if (ret) { | ||
5437 | mlog_errno(ret); | ||
5438 | goto out; | ||
5439 | } | ||
5440 | 5600 | ||
5441 | ret = ocfs2_add_new_xattr_bucket(inode, | 5601 | /* |
5442 | xs->xattr_bh, | 5602 | * We do not allow for overlapping ranges between buckets. And |
5603 | * the maximum number of collisions we will allow for then is | ||
5604 | * one bucket's worth, so check it here whether we need to | ||
5605 | * add a new bucket for the insert. | ||
5606 | */ | ||
5607 | ret = ocfs2_check_xattr_bucket_collision(inode, | ||
5443 | xs->bucket, | 5608 | xs->bucket, |
5444 | ctxt); | 5609 | xi->xi_name); |
5445 | if (ret) { | 5610 | if (ret) { |
5446 | mlog_errno(ret); | 5611 | mlog_errno(ret); |
5447 | goto out; | 5612 | goto out; |
5448 | } | 5613 | } |
5449 | 5614 | ||
5450 | /* | 5615 | ret = ocfs2_add_new_xattr_bucket(inode, |
5451 | * ocfs2_add_new_xattr_bucket() will have updated | 5616 | xs->xattr_bh, |
5452 | * xs->bucket if it moved, but it will not have updated | 5617 | xs->bucket, |
5453 | * any of the other search fields. Thus, we drop it and | 5618 | ctxt); |
5454 | * re-search. Everything should be cached, so it'll be | 5619 | if (ret) { |
5455 | * quick. | 5620 | mlog_errno(ret); |
5456 | */ | 5621 | goto out; |
5457 | ocfs2_xattr_bucket_relse(xs->bucket); | ||
5458 | ret = ocfs2_xattr_index_block_find(inode, xs->xattr_bh, | ||
5459 | xi->name_index, | ||
5460 | xi->name, xs); | ||
5461 | if (ret && ret != -ENODATA) | ||
5462 | goto out; | ||
5463 | xs->not_found = ret; | ||
5464 | allocation = 1; | ||
5465 | goto try_again; | ||
5466 | } | 5622 | } |
5467 | 5623 | ||
5468 | xattr_set: | 5624 | /* |
5469 | ret = ocfs2_xattr_set_in_bucket(inode, xi, xs, ctxt); | 5625 | * ocfs2_add_new_xattr_bucket() will have updated |
5626 | * xs->bucket if it moved, but it will not have updated | ||
5627 | * any of the other search fields. Thus, we drop it and | ||
5628 | * re-search. Everything should be cached, so it'll be | ||
5629 | * quick. | ||
5630 | */ | ||
5631 | ocfs2_xattr_bucket_relse(xs->bucket); | ||
5632 | ret = ocfs2_xattr_index_block_find(inode, xs->xattr_bh, | ||
5633 | xi->xi_name_index, | ||
5634 | xi->xi_name, xs); | ||
5635 | if (ret && ret != -ENODATA) | ||
5636 | goto out; | ||
5637 | xs->not_found = ret; | ||
5638 | |||
5639 | /* Ok, we have a new bucket, let's try again */ | ||
5640 | ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt); | ||
5641 | if (ret && (ret != -ENOSPC)) | ||
5642 | mlog_errno(ret); | ||
5643 | |||
5470 | out: | 5644 | out: |
5471 | mlog_exit(ret); | 5645 | mlog_exit(ret); |
5472 | return ret; | 5646 | return ret; |
@@ -5678,7 +5852,7 @@ static int ocfs2_prepare_refcount_xattr(struct inode *inode, | |||
5678 | * refcount tree, and make the original extent become 3. So we will need | 5852 | * refcount tree, and make the original extent become 3. So we will need |
5679 | * 2 * cluster more extent recs at most. | 5853 | * 2 * cluster more extent recs at most. |
5680 | */ | 5854 | */ |
5681 | if (!xi->value || xi->value_len <= OCFS2_XATTR_INLINE_SIZE) { | 5855 | if (!xi->xi_value || xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE) { |
5682 | 5856 | ||
5683 | ret = ocfs2_refcounted_xattr_delete_need(inode, | 5857 | ret = ocfs2_refcounted_xattr_delete_need(inode, |
5684 | &(*ref_tree)->rf_ci, | 5858 | &(*ref_tree)->rf_ci, |
@@ -6354,9 +6528,11 @@ static int ocfs2_create_empty_xattr_block(struct inode *inode, | |||
6354 | int indexed) | 6528 | int indexed) |
6355 | { | 6529 | { |
6356 | int ret; | 6530 | int ret; |
6357 | handle_t *handle; | ||
6358 | struct ocfs2_alloc_context *meta_ac; | 6531 | struct ocfs2_alloc_context *meta_ac; |
6359 | struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); | 6532 | struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); |
6533 | struct ocfs2_xattr_set_ctxt ctxt = { | ||
6534 | .meta_ac = meta_ac, | ||
6535 | }; | ||
6360 | 6536 | ||
6361 | ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &meta_ac); | 6537 | ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &meta_ac); |
6362 | if (ret < 0) { | 6538 | if (ret < 0) { |
@@ -6364,21 +6540,21 @@ static int ocfs2_create_empty_xattr_block(struct inode *inode, | |||
6364 | return ret; | 6540 | return ret; |
6365 | } | 6541 | } |
6366 | 6542 | ||
6367 | handle = ocfs2_start_trans(osb, OCFS2_XATTR_BLOCK_CREATE_CREDITS); | 6543 | ctxt.handle = ocfs2_start_trans(osb, OCFS2_XATTR_BLOCK_CREATE_CREDITS); |
6368 | if (IS_ERR(handle)) { | 6544 | if (IS_ERR(ctxt.handle)) { |
6369 | ret = PTR_ERR(handle); | 6545 | ret = PTR_ERR(ctxt.handle); |
6370 | mlog_errno(ret); | 6546 | mlog_errno(ret); |
6371 | goto out; | 6547 | goto out; |
6372 | } | 6548 | } |
6373 | 6549 | ||
6374 | mlog(0, "create new xattr block for inode %llu, index = %d\n", | 6550 | mlog(0, "create new xattr block for inode %llu, index = %d\n", |
6375 | (unsigned long long)fe_bh->b_blocknr, indexed); | 6551 | (unsigned long long)fe_bh->b_blocknr, indexed); |
6376 | ret = ocfs2_create_xattr_block(handle, inode, fe_bh, | 6552 | ret = ocfs2_create_xattr_block(inode, fe_bh, &ctxt, indexed, |
6377 | meta_ac, ret_bh, indexed); | 6553 | ret_bh); |
6378 | if (ret) | 6554 | if (ret) |
6379 | mlog_errno(ret); | 6555 | mlog_errno(ret); |
6380 | 6556 | ||
6381 | ocfs2_commit_trans(osb, handle); | 6557 | ocfs2_commit_trans(osb, ctxt.handle); |
6382 | out: | 6558 | out: |
6383 | ocfs2_free_alloc_context(meta_ac); | 6559 | ocfs2_free_alloc_context(meta_ac); |
6384 | return ret; | 6560 | return ret; |