Commit 300893b0 authored by Linus Torvalds's avatar Linus Torvalds

Merge tag 'xfs-for-linus-v3.12-rc1' of git://oss.sgi.com/xfs/xfs

Pull xfs updates from Ben Myers:
 "For 3.12-rc1 there are a number of bugfixes in addition to work to
  ease usage of shared code between libxfs and the kernel, the rest of
  the work to enable project and group quotas to be used simultaneously,
  performance optimisations in the log and the CIL, directory entry file
  type support, fixes for log space reservations, some spelling/grammar
  cleanups, and the addition of user namespace support.

   - introduce readahead to log recovery
   - add directory entry file type support
   - fix a number of spelling errors in comments
   - introduce new Q_XGETQSTATV quotactl for project quotas
   - add USER_NS support
   - log space reservation rework
   - CIL optimisations
  - kernel/userspace libxfs rework"

* tag 'xfs-for-linus-v3.12-rc1' of git://oss.sgi.com/xfs/xfs: (112 commits)
  xfs: XFS_MOUNT_QUOTA_ALL needed by userspace
  xfs: dtype changed xfs_dir2_sfe_put_ino to xfs_dir3_sfe_put_ino
  Fix wrong flag ASSERT in xfs_attr_shortform_getvalue
  xfs: finish removing IOP_* macros.
  xfs: inode log reservations are too small
  xfs: check correct status variable for xfs_inobt_get_rec() call
  xfs: inode buffers may not be valid during recovery readahead
  xfs: check LSN ordering for v5 superblocks during recovery
  xfs: btree block LSN escaping to disk uninitialised
  XFS: Assertion failed: first <= last && last < BBTOB(bp->b_length), file: fs/xfs/xfs_trans_buf.c, line: 568
  xfs: fix bad dquot buffer size in log recovery readahead
  xfs: don't account buffer cancellation during log recovery readahead
  xfs: check for underflow in xfs_iformat_fork()
  xfs: xfs_dir3_sfe_put_ino can be static
  xfs: introduce object readahead to log recovery
  xfs: Simplify xfs_ail_min() with list_first_entry_or_null()
  xfs: Register hotcpu notifier after initialization
  xfs: add xfs sb v4 support for dirent filetype field
  xfs: Add write support for dirent filetype field
  xfs: Add read-only support for dirent filetype field
  ...
parents 45150c43 1d03c6fa
...@@ -620,12 +620,16 @@ spufs_parse_options(struct super_block *sb, char *options, struct inode *root) ...@@ -620,12 +620,16 @@ spufs_parse_options(struct super_block *sb, char *options, struct inode *root)
case Opt_uid: case Opt_uid:
if (match_int(&args[0], &option)) if (match_int(&args[0], &option))
return 0; return 0;
root->i_uid = option; root->i_uid = make_kuid(current_user_ns(), option);
if (!uid_valid(root->i_uid))
return 0;
break; break;
case Opt_gid: case Opt_gid:
if (match_int(&args[0], &option)) if (match_int(&args[0], &option))
return 0; return 0;
root->i_gid = option; root->i_gid = make_kgid(current_user_ns(), option);
if (!gid_valid(root->i_gid))
return 0;
break; break;
case Opt_mode: case Opt_mode:
if (match_octal(&args[0], &option)) if (match_octal(&args[0], &option))
......
...@@ -27,6 +27,7 @@ static int check_quotactl_permission(struct super_block *sb, int type, int cmd, ...@@ -27,6 +27,7 @@ static int check_quotactl_permission(struct super_block *sb, int type, int cmd,
case Q_SYNC: case Q_SYNC:
case Q_GETINFO: case Q_GETINFO:
case Q_XGETQSTAT: case Q_XGETQSTAT:
case Q_XGETQSTATV:
case Q_XQUOTASYNC: case Q_XQUOTASYNC:
break; break;
/* allow to query information for dquots we "own" */ /* allow to query information for dquots we "own" */
...@@ -217,6 +218,31 @@ static int quota_getxstate(struct super_block *sb, void __user *addr) ...@@ -217,6 +218,31 @@ static int quota_getxstate(struct super_block *sb, void __user *addr)
return ret; return ret;
} }
static int quota_getxstatev(struct super_block *sb, void __user *addr)
{
struct fs_quota_statv fqs;
int ret;
if (!sb->s_qcop->get_xstatev)
return -ENOSYS;
memset(&fqs, 0, sizeof(fqs));
if (copy_from_user(&fqs, addr, 1)) /* Just read qs_version */
return -EFAULT;
/* If this kernel doesn't support user specified version, fail */
switch (fqs.qs_version) {
case FS_QSTATV_VERSION1:
break;
default:
return -EINVAL;
}
ret = sb->s_qcop->get_xstatev(sb, &fqs);
if (!ret && copy_to_user(addr, &fqs, sizeof(fqs)))
return -EFAULT;
return ret;
}
static int quota_setxquota(struct super_block *sb, int type, qid_t id, static int quota_setxquota(struct super_block *sb, int type, qid_t id,
void __user *addr) void __user *addr)
{ {
...@@ -293,6 +319,8 @@ static int do_quotactl(struct super_block *sb, int type, int cmd, qid_t id, ...@@ -293,6 +319,8 @@ static int do_quotactl(struct super_block *sb, int type, int cmd, qid_t id,
return quota_setxstate(sb, cmd, addr); return quota_setxstate(sb, cmd, addr);
case Q_XGETQSTAT: case Q_XGETQSTAT:
return quota_getxstate(sb, addr); return quota_getxstate(sb, addr);
case Q_XGETQSTATV:
return quota_getxstatev(sb, addr);
case Q_XSETQLIM: case Q_XSETQLIM:
return quota_setxquota(sb, type, id, addr); return quota_setxquota(sb, type, id, addr);
case Q_XGETQUOTA: case Q_XGETQUOTA:
...@@ -317,6 +345,7 @@ static int quotactl_cmd_write(int cmd) ...@@ -317,6 +345,7 @@ static int quotactl_cmd_write(int cmd)
case Q_GETINFO: case Q_GETINFO:
case Q_SYNC: case Q_SYNC:
case Q_XGETQSTAT: case Q_XGETQSTAT:
case Q_XGETQSTATV:
case Q_XGETQUOTA: case Q_XGETQUOTA:
case Q_XQUOTASYNC: case Q_XQUOTASYNC:
return 0; return 0;
......
...@@ -27,9 +27,12 @@ xfs-y += xfs_trace.o ...@@ -27,9 +27,12 @@ xfs-y += xfs_trace.o
# highlevel code # highlevel code
xfs-y += xfs_aops.o \ xfs-y += xfs_aops.o \
xfs_attr_inactive.o \
xfs_attr_list.o \
xfs_bit.o \ xfs_bit.o \
xfs_bmap_util.o \
xfs_buf.o \ xfs_buf.o \
xfs_dfrag.o \ xfs_dir2_readdir.o \
xfs_discard.o \ xfs_discard.o \
xfs_error.o \ xfs_error.o \
xfs_export.o \ xfs_export.o \
...@@ -44,11 +47,11 @@ xfs-y += xfs_aops.o \ ...@@ -44,11 +47,11 @@ xfs-y += xfs_aops.o \
xfs_iops.o \ xfs_iops.o \
xfs_itable.o \ xfs_itable.o \
xfs_message.o \ xfs_message.o \
xfs_mount.o \
xfs_mru_cache.o \ xfs_mru_cache.o \
xfs_rename.o \
xfs_super.o \ xfs_super.o \
xfs_utils.o \ xfs_symlink.o \
xfs_vnodeops.o \ xfs_trans.o \
xfs_xattr.o \ xfs_xattr.o \
kmem.o \ kmem.o \
uuid.o uuid.o
...@@ -73,10 +76,13 @@ xfs-y += xfs_alloc.o \ ...@@ -73,10 +76,13 @@ xfs-y += xfs_alloc.o \
xfs_ialloc_btree.o \ xfs_ialloc_btree.o \
xfs_icreate_item.o \ xfs_icreate_item.o \
xfs_inode.o \ xfs_inode.o \
xfs_inode_fork.o \
xfs_inode_buf.o \
xfs_log_recover.o \ xfs_log_recover.o \
xfs_mount.o \ xfs_log_rlimit.o \
xfs_symlink.o \ xfs_sb.o \
xfs_trans.o xfs_symlink_remote.o \
xfs_trans_resv.o
# low-level transaction/log code # low-level transaction/log code
xfs-y += xfs_log.o \ xfs-y += xfs_log.o \
......
...@@ -16,11 +16,13 @@ ...@@ -16,11 +16,13 @@
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/ */
#include "xfs.h" #include "xfs.h"
#include "xfs_log_format.h"
#include "xfs_trans_resv.h"
#include "xfs_acl.h" #include "xfs_acl.h"
#include "xfs_attr.h" #include "xfs_attr.h"
#include "xfs_bmap_btree.h" #include "xfs_bmap_btree.h"
#include "xfs_inode.h" #include "xfs_inode.h"
#include "xfs_vnodeops.h" #include "xfs_ag.h"
#include "xfs_sb.h" #include "xfs_sb.h"
#include "xfs_mount.h" #include "xfs_mount.h"
#include "xfs_trace.h" #include "xfs_trace.h"
...@@ -68,14 +70,15 @@ xfs_acl_from_disk( ...@@ -68,14 +70,15 @@ xfs_acl_from_disk(
switch (acl_e->e_tag) { switch (acl_e->e_tag) {
case ACL_USER: case ACL_USER:
acl_e->e_uid = xfs_uid_to_kuid(be32_to_cpu(ace->ae_id));
break;
case ACL_GROUP: case ACL_GROUP:
acl_e->e_id = be32_to_cpu(ace->ae_id); acl_e->e_gid = xfs_gid_to_kgid(be32_to_cpu(ace->ae_id));
break; break;
case ACL_USER_OBJ: case ACL_USER_OBJ:
case ACL_GROUP_OBJ: case ACL_GROUP_OBJ:
case ACL_MASK: case ACL_MASK:
case ACL_OTHER: case ACL_OTHER:
acl_e->e_id = ACL_UNDEFINED_ID;
break; break;
default: default:
goto fail; goto fail;
...@@ -101,7 +104,18 @@ xfs_acl_to_disk(struct xfs_acl *aclp, const struct posix_acl *acl) ...@@ -101,7 +104,18 @@ xfs_acl_to_disk(struct xfs_acl *aclp, const struct posix_acl *acl)
acl_e = &acl->a_entries[i]; acl_e = &acl->a_entries[i];
ace->ae_tag = cpu_to_be32(acl_e->e_tag); ace->ae_tag = cpu_to_be32(acl_e->e_tag);
ace->ae_id = cpu_to_be32(acl_e->e_id); switch (acl_e->e_tag) {
case ACL_USER:
ace->ae_id = cpu_to_be32(xfs_kuid_to_uid(acl_e->e_uid));
break;
case ACL_GROUP:
ace->ae_id = cpu_to_be32(xfs_kgid_to_gid(acl_e->e_gid));
break;
default:
ace->ae_id = cpu_to_be32(ACL_UNDEFINED_ID);
break;
}
ace->ae_perm = cpu_to_be16(acl_e->e_perm); ace->ae_perm = cpu_to_be16(acl_e->e_perm);
} }
} }
...@@ -360,7 +374,7 @@ xfs_xattr_acl_set(struct dentry *dentry, const char *name, ...@@ -360,7 +374,7 @@ xfs_xattr_acl_set(struct dentry *dentry, const char *name,
return -EINVAL; return -EINVAL;
if (type == ACL_TYPE_DEFAULT && !S_ISDIR(inode->i_mode)) if (type == ACL_TYPE_DEFAULT && !S_ISDIR(inode->i_mode))
return value ? -EACCES : 0; return value ? -EACCES : 0;
if ((current_fsuid() != inode->i_uid) && !capable(CAP_FOWNER)) if (!inode_owner_or_capable(inode))
return -EPERM; return -EPERM;
if (!value) if (!value)
......
...@@ -226,59 +226,6 @@ typedef struct xfs_agfl { ...@@ -226,59 +226,6 @@ typedef struct xfs_agfl {
__be32 agfl_bno[]; /* actually XFS_AGFL_SIZE(mp) */ __be32 agfl_bno[]; /* actually XFS_AGFL_SIZE(mp) */
} xfs_agfl_t; } xfs_agfl_t;
/*
* Per-ag incore structure, copies of information in agf and agi,
* to improve the performance of allocation group selection.
*/
#define XFS_PAGB_NUM_SLOTS 128
typedef struct xfs_perag {
struct xfs_mount *pag_mount; /* owner filesystem */
xfs_agnumber_t pag_agno; /* AG this structure belongs to */
atomic_t pag_ref; /* perag reference count */
char pagf_init; /* this agf's entry is initialized */
char pagi_init; /* this agi's entry is initialized */
char pagf_metadata; /* the agf is preferred to be metadata */
char pagi_inodeok; /* The agi is ok for inodes */
__uint8_t pagf_levels[XFS_BTNUM_AGF];
/* # of levels in bno & cnt btree */
__uint32_t pagf_flcount; /* count of blocks in freelist */
xfs_extlen_t pagf_freeblks; /* total free blocks */
xfs_extlen_t pagf_longest; /* longest free space */
__uint32_t pagf_btreeblks; /* # of blocks held in AGF btrees */
xfs_agino_t pagi_freecount; /* number of free inodes */
xfs_agino_t pagi_count; /* number of allocated inodes */
/*
* Inode allocation search lookup optimisation.
* If the pagino matches, the search for new inodes
* doesn't need to search the near ones again straight away
*/
xfs_agino_t pagl_pagino;
xfs_agino_t pagl_leftrec;
xfs_agino_t pagl_rightrec;
#ifdef __KERNEL__
spinlock_t pagb_lock; /* lock for pagb_tree */
struct rb_root pagb_tree; /* ordered tree of busy extents */
atomic_t pagf_fstrms; /* # of filestreams active in this AG */
spinlock_t pag_ici_lock; /* incore inode cache lock */
struct radix_tree_root pag_ici_root; /* incore inode cache root */
int pag_ici_reclaimable; /* reclaimable inodes */
struct mutex pag_ici_reclaim_lock; /* serialisation point */
unsigned long pag_ici_reclaim_cursor; /* reclaim restart point */
/* buffer cache index */
spinlock_t pag_buf_lock; /* lock for pag_buf_tree */
struct rb_root pag_buf_tree; /* ordered tree of active buffers */
/* for rcu-safe freeing */
struct rcu_head rcu_head;
#endif
int pagb_count; /* pagb slots in use */
} xfs_perag_t;
/* /*
* tags for inode radix tree * tags for inode radix tree
*/ */
......
...@@ -878,7 +878,7 @@ xfs_alloc_ag_vextent_near( ...@@ -878,7 +878,7 @@ xfs_alloc_ag_vextent_near(
xfs_agblock_t ltnew; /* useful start bno of left side */ xfs_agblock_t ltnew; /* useful start bno of left side */
xfs_extlen_t rlen; /* length of returned extent */ xfs_extlen_t rlen; /* length of returned extent */
int forced = 0; int forced = 0;
#if defined(DEBUG) && defined(__KERNEL__) #ifdef DEBUG
/* /*
* Randomly don't execute the first algorithm. * Randomly don't execute the first algorithm.
*/ */
...@@ -938,8 +938,8 @@ xfs_alloc_ag_vextent_near( ...@@ -938,8 +938,8 @@ xfs_alloc_ag_vextent_near(
xfs_extlen_t blen=0; xfs_extlen_t blen=0;
xfs_agblock_t bnew=0; xfs_agblock_t bnew=0;
#if defined(DEBUG) && defined(__KERNEL__) #ifdef DEBUG
if (!dofirst) if (dofirst)
break; break;
#endif #endif
/* /*
......
...@@ -28,9 +28,9 @@ ...@@ -28,9 +28,9 @@
#include "xfs_alloc.h" #include "xfs_alloc.h"
#include "xfs_error.h" #include "xfs_error.h"
#include "xfs_iomap.h" #include "xfs_iomap.h"
#include "xfs_vnodeops.h"
#include "xfs_trace.h" #include "xfs_trace.h"
#include "xfs_bmap.h" #include "xfs_bmap.h"
#include "xfs_bmap_util.h"
#include <linux/aio.h> #include <linux/aio.h>
#include <linux/gfp.h> #include <linux/gfp.h>
#include <linux/mpage.h> #include <linux/mpage.h>
...@@ -108,7 +108,7 @@ xfs_setfilesize_trans_alloc( ...@@ -108,7 +108,7 @@ xfs_setfilesize_trans_alloc(
tp = xfs_trans_alloc(mp, XFS_TRANS_FSYNC_TS); tp = xfs_trans_alloc(mp, XFS_TRANS_FSYNC_TS);
error = xfs_trans_reserve(tp, 0, XFS_FSYNC_TS_LOG_RES(mp), 0, 0, 0); error = xfs_trans_reserve(tp, &M_RES(mp)->tr_fsyncts, 0, 0);
if (error) { if (error) {
xfs_trans_cancel(tp, 0); xfs_trans_cancel(tp, 0);
return error; return error;
...@@ -440,7 +440,7 @@ xfs_start_page_writeback( ...@@ -440,7 +440,7 @@ xfs_start_page_writeback(
end_page_writeback(page); end_page_writeback(page);
} }
static inline int bio_add_buffer(struct bio *bio, struct buffer_head *bh) static inline int xfs_bio_add_buffer(struct bio *bio, struct buffer_head *bh)
{ {
return bio_add_page(bio, bh->b_page, bh->b_size, bh_offset(bh)); return bio_add_page(bio, bh->b_page, bh->b_size, bh_offset(bh));
} }
...@@ -514,7 +514,7 @@ xfs_submit_ioend( ...@@ -514,7 +514,7 @@ xfs_submit_ioend(
goto retry; goto retry;
} }
if (bio_add_buffer(bio, bh) != bh->b_size) { if (xfs_bio_add_buffer(bio, bh) != bh->b_size) {
xfs_submit_ioend_bio(wbc, ioend, bio); xfs_submit_ioend_bio(wbc, ioend, bio);
goto retry; goto retry;
} }
...@@ -1498,13 +1498,26 @@ xfs_vm_write_failed( ...@@ -1498,13 +1498,26 @@ xfs_vm_write_failed(
loff_t pos, loff_t pos,
unsigned len) unsigned len)
{ {
loff_t block_offset = pos & PAGE_MASK; loff_t block_offset;
loff_t block_start; loff_t block_start;
loff_t block_end; loff_t block_end;
loff_t from = pos & (PAGE_CACHE_SIZE - 1); loff_t from = pos & (PAGE_CACHE_SIZE - 1);
loff_t to = from + len; loff_t to = from + len;
struct buffer_head *bh, *head; struct buffer_head *bh, *head;
/*
* The request pos offset might be 32 or 64 bit, this is all fine
* on 64-bit platform. However, for 64-bit pos request on 32-bit
* platform, the high 32-bit will be masked off if we evaluate the
* block_offset via (pos & PAGE_MASK) because the PAGE_MASK is
* 0xfffff000 as an unsigned long, hence the result is incorrect
* which could cause the following ASSERT failed in most cases.
* In order to avoid this, we can evaluate the block_offset of the
* start of the page by using shifts rather than masks the mismatch
* problem.
*/
block_offset = (pos >> PAGE_CACHE_SHIFT) << PAGE_CACHE_SHIFT;
ASSERT(block_offset + from == pos); ASSERT(block_offset + from == pos);
head = page_buffers(page); head = page_buffers(page);
......
This diff is collapsed.
...@@ -141,5 +141,14 @@ typedef struct xfs_attr_list_context { ...@@ -141,5 +141,14 @@ typedef struct xfs_attr_list_context {
*/ */
int xfs_attr_inactive(struct xfs_inode *dp); int xfs_attr_inactive(struct xfs_inode *dp);
int xfs_attr_list_int(struct xfs_attr_list_context *); int xfs_attr_list_int(struct xfs_attr_list_context *);
int xfs_inode_hasattr(struct xfs_inode *ip);
int xfs_attr_get(struct xfs_inode *ip, const unsigned char *name,
unsigned char *value, int *valuelenp, int flags);
int xfs_attr_set(struct xfs_inode *dp, const unsigned char *name,
unsigned char *value, int valuelen, int flags);
int xfs_attr_remove(struct xfs_inode *dp, const unsigned char *name, int flags);
int xfs_attr_list(struct xfs_inode *dp, char *buffer, int bufsize,
int flags, struct attrlist_cursor_kern *cursor);
#endif /* __XFS_ATTR_H__ */ #endif /* __XFS_ATTR_H__ */
This diff is collapsed.
This diff is collapsed.
...@@ -333,6 +333,8 @@ int xfs_attr3_leaf_read(struct xfs_trans *tp, struct xfs_inode *dp, ...@@ -333,6 +333,8 @@ int xfs_attr3_leaf_read(struct xfs_trans *tp, struct xfs_inode *dp,
struct xfs_buf **bpp); struct xfs_buf **bpp);
void xfs_attr3_leaf_hdr_from_disk(struct xfs_attr3_icleaf_hdr *to, void xfs_attr3_leaf_hdr_from_disk(struct xfs_attr3_icleaf_hdr *to,
struct xfs_attr_leafblock *from); struct xfs_attr_leafblock *from);
void xfs_attr3_leaf_hdr_to_disk(struct xfs_attr_leafblock *to,
struct xfs_attr3_icleaf_hdr *from);
extern const struct xfs_buf_ops xfs_attr3_leaf_buf_ops; extern const struct xfs_buf_ops xfs_attr3_leaf_buf_ops;
......
This diff is collapsed.
...@@ -22,6 +22,7 @@ ...@@ -22,6 +22,7 @@
#include "xfs_bit.h" #include "xfs_bit.h"
#include "xfs_log.h" #include "xfs_log.h"
#include "xfs_trans.h" #include "xfs_trans.h"
#include "xfs_trans_priv.h"
#include "xfs_sb.h" #include "xfs_sb.h"
#include "xfs_ag.h" #include "xfs_ag.h"
#include "xfs_mount.h" #include "xfs_mount.h"
...@@ -33,6 +34,7 @@ ...@@ -33,6 +34,7 @@
#include "xfs_alloc.h" #include "xfs_alloc.h"
#include "xfs_inode_item.h" #include "xfs_inode_item.h"
#include "xfs_bmap.h" #include "xfs_bmap.h"
#include "xfs_bmap_util.h"
#include "xfs_attr.h" #include "xfs_attr.h"
#include "xfs_attr_leaf.h" #include "xfs_attr_leaf.h"
#include "xfs_attr_remote.h" #include "xfs_attr_remote.h"
...@@ -237,7 +239,7 @@ xfs_attr_rmtval_copyout( ...@@ -237,7 +239,7 @@ xfs_attr_rmtval_copyout(
xfs_ino_t ino, xfs_ino_t ino,
int *offset, int *offset,
int *valuelen, int *valuelen,
char **dst) __uint8_t **dst)
{ {
char *src = bp->b_addr; char *src = bp->b_addr;
xfs_daddr_t bno = bp->b_bn; xfs_daddr_t bno = bp->b_bn;
...@@ -249,7 +251,7 @@ xfs_attr_rmtval_copyout( ...@@ -249,7 +251,7 @@ xfs_attr_rmtval_copyout(
int hdr_size = 0; int hdr_size = 0;
int byte_cnt = XFS_ATTR3_RMT_BUF_SPACE(mp, XFS_LBSIZE(mp)); int byte_cnt = XFS_ATTR3_RMT_BUF_SPACE(mp, XFS_LBSIZE(mp));
byte_cnt = min_t(int, *valuelen, byte_cnt); byte_cnt = min(*valuelen, byte_cnt);
if (xfs_sb_version_hascrc(&mp->m_sb)) { if (xfs_sb_version_hascrc(&mp->m_sb)) {
if (!xfs_attr3_rmt_hdr_ok(mp, src, ino, *offset, if (!xfs_attr3_rmt_hdr_ok(mp, src, ino, *offset,
...@@ -284,7 +286,7 @@ xfs_attr_rmtval_copyin( ...@@ -284,7 +286,7 @@ xfs_attr_rmtval_copyin(
xfs_ino_t ino, xfs_ino_t ino,
int *offset, int *offset,
int *valuelen, int *valuelen,
char **src) __uint8_t **src)
{ {
char *dst = bp->b_addr; char *dst = bp->b_addr;
xfs_daddr_t bno = bp->b_bn; xfs_daddr_t bno = bp->b_bn;
...@@ -337,7 +339,7 @@ xfs_attr_rmtval_get( ...@@ -337,7 +339,7 @@ xfs_attr_rmtval_get(
struct xfs_mount *mp = args->dp->i_mount; struct xfs_mount *mp = args->dp->i_mount;
struct xfs_buf *bp; struct xfs_buf *bp;
xfs_dablk_t lblkno = args->rmtblkno; xfs_dablk_t lblkno = args->rmtblkno;
char *dst = args->value; __uint8_t *dst = args->value;
int valuelen = args->valuelen; int valuelen = args->valuelen;
int nmap; int nmap;
int error; int error;
...@@ -401,7 +403,7 @@ xfs_attr_rmtval_set( ...@@ -401,7 +403,7 @@ xfs_attr_rmtval_set(
struct xfs_bmbt_irec map; struct xfs_bmbt_irec map;
xfs_dablk_t lblkno; xfs_dablk_t lblkno;
xfs_fileoff_t lfileoff = 0; xfs_fileoff_t lfileoff = 0;
char *src = args->value; __uint8_t *src = args->value;
int blkcnt; int blkcnt;
int valuelen; int valuelen;
int nmap; int nmap;
...@@ -543,11 +545,6 @@ xfs_attr_rmtval_remove( ...@@ -543,11 +545,6 @@ xfs_attr_rmtval_remove(
/* /*
* Roll through the "value", invalidating the attribute value's blocks. * Roll through the "value", invalidating the attribute value's blocks.
* Note that args->rmtblkcnt is the minimum number of data blocks we'll
* see for a CRC enabled remote attribute. Each extent will have a
* header, and so we may have more blocks than we realise here. If we
* fail to map the blocks correctly, we'll have problems with the buffer
* lookups.
*/ */
lblkno = args->rmtblkno; lblkno = args->rmtblkno;
blkcnt = args->rmtblkcnt; blkcnt = args->rmtblkcnt;
...@@ -628,4 +625,3 @@ xfs_attr_rmtval_remove( ...@@ -628,4 +625,3 @@ xfs_attr_rmtval_remove(
} }
return(0); return(0);
} }
This diff is collapsed.
...@@ -107,41 +107,6 @@ static inline void xfs_bmap_init(xfs_bmap_free_t *flp, xfs_fsblock_t *fbp) ...@@ -107,41 +107,6 @@ static inline void xfs_bmap_init(xfs_bmap_free_t *flp, xfs_fsblock_t *fbp)
(flp)->xbf_low = 0, *(fbp) = NULLFSBLOCK); (flp)->xbf_low = 0, *(fbp) = NULLFSBLOCK);
} }
/*
* Argument structure for xfs_bmap_alloc.
*/
typedef struct xfs_bmalloca {
xfs_fsblock_t *firstblock; /* i/o first block allocated */
struct xfs_bmap_free *flist; /* bmap freelist */
struct xfs_trans *tp; /* transaction pointer */
struct xfs_inode *ip; /* incore inode pointer */
struct xfs_bmbt_irec prev; /* extent before the new one */
struct xfs_bmbt_irec got; /* extent after, or delayed */
xfs_fileoff_t offset; /* offset in file filling in */
xfs_extlen_t length; /* i/o length asked/allocated */
xfs_fsblock_t blkno; /* starting block of new extent */
struct xfs_btree_cur *cur; /* btree cursor */
xfs_extnum_t idx; /* current extent index */
int nallocs;/* number of extents alloc'd */
int logflags;/* flags for transaction logging */
xfs_extlen_t total; /* total blocks needed for xaction */
xfs_extlen_t minlen; /* minimum allocation size (blocks) */
xfs_extlen_t minleft; /* amount must be left after alloc */
char eof; /* set if allocating past last extent */
char wasdel; /* replacing a delayed allocation */
char userdata;/* set if is user data */
char aeof; /* allocated space at eof */
char conv; /* overwriting unwritten extents */
char stack_switch;
int flags;
struct completion *done;
struct work_struct work;
int result;
} xfs_bmalloca_t;
/* /*
* Flags for xfs_bmap_add_extent*. * Flags for xfs_bmap_add_extent*.
*/ */
...@@ -162,7 +127,7 @@ typedef struct xfs_bmalloca { ...@@ -162,7 +127,7 @@ typedef struct xfs_bmalloca {
{ BMAP_RIGHT_FILLING, "RF" }, \ { BMAP_RIGHT_FILLING, "RF" }, \
{ BMAP_ATTRFORK, "ATTR" } { BMAP_ATTRFORK, "ATTR" }
#if defined(__KERNEL) && defined(DEBUG) #ifdef DEBUG
void xfs_bmap_trace_exlist(struct xfs_inode *ip, xfs_extnum_t cnt, void xfs_bmap_trace_exlist(struct xfs_inode *ip, xfs_extnum_t cnt,
int whichfork, unsigned long caller_ip); int whichfork, unsigned long caller_ip);
#define XFS_BMAP_TRACE_EXLIST(ip,c,w) \ #define XFS_BMAP_TRACE_EXLIST(ip,c,w) \
...@@ -205,23 +170,4 @@ int xfs_check_nostate_extents(struct xfs_ifork *ifp, xfs_extnum_t idx, ...@@ -205,23 +170,4 @@ int xfs_check_nostate_extents(struct xfs_ifork *ifp, xfs_extnum_t idx,
xfs_extnum_t num); xfs_extnum_t num);
uint xfs_default_attroffset(struct xfs_inode *ip); uint xfs_default_attroffset(struct xfs_inode *ip);
#ifdef __KERNEL__
/* bmap to userspace formatter - copy to user & advance pointer */
typedef int (*xfs_bmap_format_t)(void **, struct getbmapx *, int *);
int xfs_bmap_finish(struct xfs_trans **tp, struct xfs_bmap_free *flist,
int *committed);
int xfs_getbmap(struct xfs_inode *ip, struct getbmapx *bmv,
xfs_bmap_format_t formatter, void *arg);
int xfs_bmap_eof(struct xfs_inode *ip, xfs_fileoff_t endoff,
int whichfork, int *eof);
int xfs_bmap_count_blocks(struct xfs_trans *tp, struct xfs_inode *ip,
int whichfork, int *count);
int xfs_bmap_punch_delalloc_range(struct xfs_inode *ip,
xfs_fileoff_t start_fsb, xfs_fileoff_t length);
xfs_daddr_t xfs_fsb_to_db(struct xfs_inode *ip, xfs_fsblock_t fsb);
#endif /* __KERNEL__ */
#endif /* __XFS_BMAP_H__ */ #endif /* __XFS_BMAP_H__ */
...@@ -17,7 +17,7 @@ ...@@ -17,7 +17,7 @@
*/ */
#include "xfs.h" #include "xfs.h"
#include "xfs_fs.h" #include "xfs_fs.h"
#include "xfs_types.h" #include "xfs_format.h"
#include "xfs_bit.h" #include "xfs_bit.h"
#include "xfs_log.h" #include "xfs_log.h"
#include "xfs_trans.h" #include "xfs_trans.h"
...@@ -722,7 +722,7 @@ xfs_bmbt_key_diff( ...@@ -722,7 +722,7 @@ xfs_bmbt_key_diff(
cur->bc_rec.b.br_startoff; cur->bc_rec.b.br_startoff;
} }
static int static bool
xfs_bmbt_verify( xfs_bmbt_verify(
struct xfs_buf *bp) struct xfs_buf *bp)
{ {
...@@ -775,7 +775,6 @@ xfs_bmbt_verify( ...@@ -775,7 +775,6 @@ xfs_bmbt_verify(
return false; return false;
return true; return true;
} }
static void static void
...@@ -789,7 +788,6 @@ xfs_bmbt_read_verify( ...@@ -789,7 +788,6 @@ xfs_bmbt_read_verify(
bp->b_target->bt_mount, bp->b_addr); bp->b_target->bt_mount, bp->b_addr);
xfs_buf_ioerror(bp, EFSCORRUPTED); xfs_buf_ioerror(bp, EFSCORRUPTED);
} }
} }
static void static void
......
/*
* Copyright (c) 2000-2006 Silicon Graphics, Inc.
* All Rights Reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it would be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef __XFS_BMAP_UTIL_H__
#define __XFS_BMAP_UTIL_H__
/* Kernel only BMAP related definitions and functions */
struct xfs_bmbt_irec;
struct xfs_bmap_free_item;
struct xfs_ifork;
struct xfs_inode;
struct xfs_mount;
struct xfs_trans;
/*
* Argument structure for xfs_bmap_alloc.
*/
struct xfs_bmalloca {
xfs_fsblock_t *firstblock; /* i/o first block allocated */
struct xfs_bmap_free *flist; /* bmap freelist */
struct xfs_trans *tp; /* transaction pointer */
struct xfs_inode *ip; /* incore inode pointer */
struct xfs_bmbt_irec prev; /* extent before the new one */
struct xfs_bmbt_irec got; /* extent after, or delayed */
xfs_fileoff_t offset; /* offset in file filling in */
xfs_extlen_t length; /* i/o length asked/allocated */
xfs_fsblock_t blkno; /* starting block of new extent */
struct xfs_btree_cur *cur; /* btree cursor */
xfs_extnum_t idx; /* current extent index */
int nallocs;/* number of extents alloc'd */
int logflags;/* flags for transaction logging */
xfs_extlen_t total; /* total blocks needed for xaction */
xfs_extlen_t minlen; /* minimum allocation size (blocks) */
xfs_extlen_t minleft; /* amount must be left after alloc */
char eof; /* set if allocating past last extent */
char wasdel; /* replacing a delayed allocation */
char userdata;/* set if is user data */
char aeof; /* allocated space at eof */
char conv; /* overwriting unwritten extents */
char stack_switch;
int flags;
struct completion *done;
struct work_struct work;
int result;
};
int xfs_bmap_finish(struct xfs_trans **tp, struct xfs_bmap_free *flist,
int *committed);
int xfs_bmap_rtalloc(struct xfs_bmalloca *ap);
int xfs_bmapi_allocate(struct xfs_bmalloca *args);
int __xfs_bmapi_allocate(struct xfs_bmalloca *args);
int xfs_bmap_eof(struct xfs_inode *ip, xfs_fileoff_t endoff,
int whichfork, int *eof);
int xfs_bmap_count_blocks(struct xfs_trans *tp, struct xfs_inode *ip,
int whichfork, int *count);
int xfs_bmap_punch_delalloc_range(struct xfs_inode *ip,
xfs_fileoff_t start_fsb, xfs_fileoff_t length);
/* bmap to userspace formatter - copy to user & advance pointer */
typedef int (*xfs_bmap_format_t)(void **, struct getbmapx *, int *);
int xfs_getbmap(struct xfs_inode *ip, struct getbmapx *bmv,
xfs_bmap_format_t formatter, void *arg);
/* functions in xfs_bmap.c that are only needed by xfs_bmap_util.c */
void xfs_bmap_del_free(struct xfs_bmap_free *flist,
struct xfs_bmap_free_item *prev,
struct xfs_bmap_free_item *free);
int xfs_bmap_extsize_align(struct xfs_mount *mp, struct xfs_bmbt_irec *gotp,
struct xfs_bmbt_irec *prevp, xfs_extlen_t extsz,
int rt, int eof, int delay, int convert,
xfs_fileoff_t *offp, xfs_extlen_t *lenp);
void xfs_bmap_adjacent(struct xfs_bmalloca *ap);
int xfs_bmap_last_extent(struct xfs_trans *tp, struct xfs_inode *ip,
int whichfork, struct xfs_bmbt_irec *rec,
int *is_empty);
/* preallocation and hole punch interface */
int xfs_change_file_space(struct xfs_inode *ip, int cmd,
xfs_flock64_t *bf, xfs_off_t offset,
int attr_flags);
/* EOF block manipulation functions */
bool xfs_can_free_eofblocks(struct xfs_inode *ip, bool force);
int xfs_free_eofblocks(struct xfs_mount *mp, struct xfs_inode *ip,
bool need_iolock);
int xfs_swap_extents(struct xfs_inode *ip, struct xfs_inode *tip,
struct xfs_swapext *sx);
xfs_daddr_t xfs_fsb_to_db(struct xfs_inode *ip, xfs_fsblock_t fsb);
#endif /* __XFS_BMAP_UTIL_H__ */
...@@ -510,7 +510,7 @@ xfs_btree_ptr_addr( ...@@ -510,7 +510,7 @@ xfs_btree_ptr_addr(
} }
/* /*
* Get a the root block which is stored in the inode. * Get the root block which is stored in the inode.
* *
* For now this btree implementation assumes the btree root is always * For now this btree implementation assumes the btree root is always
* stored in the if_broot field of an inode fork. * stored in the if_broot field of an inode fork.
...@@ -978,6 +978,7 @@ xfs_btree_init_block_int( ...@@ -978,6 +978,7 @@ xfs_btree_init_block_int(
buf->bb_u.l.bb_owner = cpu_to_be64(owner); buf->bb_u.l.bb_owner = cpu_to_be64(owner);
uuid_copy(&buf->bb_u.l.bb_uuid, &mp->m_sb.sb_uuid); uuid_copy(&buf->bb_u.l.bb_uuid, &mp->m_sb.sb_uuid);
buf->bb_u.l.bb_pad = 0; buf->bb_u.l.bb_pad = 0;
buf->bb_u.l.bb_lsn = 0;
} }
} else { } else {
/* owner is a 32 bit value on short blocks */ /* owner is a 32 bit value on short blocks */
...@@ -989,6 +990,7 @@ xfs_btree_init_block_int( ...@@ -989,6 +990,7 @@ xfs_btree_init_block_int(
buf->bb_u.s.bb_blkno = cpu_to_be64(blkno); buf->bb_u.s.bb_blkno = cpu_to_be64(blkno);
buf->bb_u.s.bb_owner = cpu_to_be32(__owner); buf->bb_u.s.bb_owner = cpu_to_be32(__owner);
uuid_copy(&buf->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid); uuid_copy(&buf->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid);
buf->bb_u.s.bb_lsn = 0;
} }
} }
} }
...@@ -1684,7 +1686,7 @@ xfs_lookup_get_search_key( ...@@ -1684,7 +1686,7 @@ xfs_lookup_get_search_key(
/* /*
* Lookup the record. The cursor is made to point to it, based on dir. * Lookup the record. The cursor is made to point to it, based on dir.
* Return 0 if can't find any such record, 1 for success. * stat is set to 0 if can't find any such record, 1 for success.
*/ */
int /* error */ int /* error */
xfs_btree_lookup( xfs_btree_lookup(
...@@ -2756,7 +2758,6 @@ xfs_btree_make_block_unfull( ...@@ -2756,7 +2758,6 @@ xfs_btree_make_block_unfull(
if (numrecs < cur->bc_ops->get_dmaxrecs(cur, level)) { if (numrecs < cur->bc_ops->get_dmaxrecs(cur, level)) {
/* A root block that can be made bigger. */ /* A root block that can be made bigger. */
xfs_iroot_realloc(ip, 1, cur->bc_private.b.whichfork); xfs_iroot_realloc(ip, 1, cur->bc_private.b.whichfork);
} else { } else {
/* A root block that needs replacing */ /* A root block that needs replacing */
......
...@@ -88,13 +88,11 @@ struct xfs_btree_block { ...@@ -88,13 +88,11 @@ struct xfs_btree_block {
#define XFS_BTREE_SBLOCK_CRC_LEN (XFS_BTREE_SBLOCK_LEN + 40) #define XFS_BTREE_SBLOCK_CRC_LEN (XFS_BTREE_SBLOCK_LEN + 40)
#define XFS_BTREE_LBLOCK_CRC_LEN (XFS_BTREE_LBLOCK_LEN + 48) #define XFS_BTREE_LBLOCK_CRC_LEN (XFS_BTREE_LBLOCK_LEN + 48)
#define XFS_BTREE_SBLOCK_CRC_OFF \ #define XFS_BTREE_SBLOCK_CRC_OFF \
offsetof(struct xfs_btree_block, bb_u.s.bb_crc) offsetof(struct xfs_btree_block, bb_u.s.bb_crc)
#define XFS_BTREE_LBLOCK_CRC_OFF \ #define XFS_BTREE_LBLOCK_CRC_OFF \
offsetof(struct xfs_btree_block, bb_u.l.bb_crc) offsetof(struct xfs_btree_block, bb_u.l.bb_crc)
/* /*
* Generic key, ptr and record wrapper structures. * Generic key, ptr and record wrapper structures.
* *
......
...@@ -35,6 +35,7 @@ ...@@ -35,6 +35,7 @@
#include <linux/freezer.h> #include <linux/freezer.h>
#include "xfs_sb.h" #include "xfs_sb.h"
#include "xfs_trans_resv.h"
#include "xfs_log.h" #include "xfs_log.h"
#include "xfs_ag.h" #include "xfs_ag.h"
#include "xfs_mount.h" #include "xfs_mount.h"
...@@ -303,7 +304,7 @@ _xfs_buf_free_pages( ...@@ -303,7 +304,7 @@ _xfs_buf_free_pages(
* Releases the specified buffer. * Releases the specified buffer.
* *
* The modification state of any associated pages is left unchanged. * The modification state of any associated pages is left unchanged.
* The buffer most not be on any hash - use xfs_buf_rele instead for * The buffer must not be on any hash - use xfs_buf_rele instead for
* hashed and refcounted buffers * hashed and refcounted buffers
*/ */
void void
...@@ -1621,7 +1622,7 @@ xfs_setsize_buftarg_flags( ...@@ -1621,7 +1622,7 @@ xfs_setsize_buftarg_flags(
/* /*
* When allocating the initial buffer target we have not yet * When allocating the initial buffer target we have not yet
* read in the superblock, so don't know what sized sectors * read in the superblock, so don't know what sized sectors
* are being used is at this early stage. Play safe. * are being used at this early stage. Play safe.
*/ */
STATIC int STATIC int
xfs_setsize_buftarg_early( xfs_setsize_buftarg_early(
......
...@@ -39,6 +39,14 @@ static inline struct xfs_buf_log_item *BUF_ITEM(struct xfs_log_item *lip) ...@@ -39,6 +39,14 @@ static inline struct xfs_buf_log_item *BUF_ITEM(struct xfs_log_item *lip)
STATIC void xfs_buf_do_callbacks(struct xfs_buf *bp); STATIC void xfs_buf_do_callbacks(struct xfs_buf *bp);
static inline int
xfs_buf_log_format_size(
struct xfs_buf_log_format *blfp)
{
return offsetof(struct xfs_buf_log_format, blf_data_map) +
(blfp->blf_map_size * sizeof(blfp->blf_data_map[0]));
}
/* /*
* This returns the number of log iovecs needed to log the * This returns the number of log iovecs needed to log the
* given buf log item. * given buf log item.
...@@ -49,25 +57,27 @@ STATIC void xfs_buf_do_callbacks(struct xfs_buf *bp); ...@@ -49,25 +57,27 @@ STATIC void xfs_buf_do_callbacks(struct xfs_buf *bp);
* *
* If the XFS_BLI_STALE flag has been set, then log nothing. * If the XFS_BLI_STALE flag has been set, then log nothing.
*/ */
STATIC uint STATIC void
xfs_buf_item_size_segment( xfs_buf_item_size_segment(
struct xfs_buf_log_item *bip, struct xfs_buf_log_item *bip,
struct xfs_buf_log_format *blfp) struct xfs_buf_log_format *blfp,
int *nvecs,
int *nbytes)
{ {
struct xfs_buf *bp = bip->bli_buf; struct xfs_buf *bp = bip->bli_buf;
uint nvecs;
int next_bit; int next_bit;
int last_bit; int last_bit;
last_bit = xfs_next_bit(blfp->blf_data_map, blfp->blf_map_size, 0); last_bit = xfs_next_bit(blfp->blf_data_map, blfp->blf_map_size, 0);
if (last_bit == -1) if (last_bit == -1)
return 0; return;
/* /*
* initial count for a dirty buffer is 2 vectors - the format structure * initial count for a dirty buffer is 2 vectors - the format structure
* and the first dirty region. * and the first dirty region.
*/ */
nvecs = 2; *nvecs += 2;
*nbytes += xfs_buf_log_format_size(blfp) + XFS_BLF_CHUNK;
while (last_bit != -1) { while (last_bit != -1) {
/* /*
...@@ -87,18 +97,17 @@ xfs_buf_item_size_segment( ...@@ -87,18 +97,17 @@ xfs_buf_item_size_segment(
break; break;
} else if (next_bit != last_bit + 1) { } else if (next_bit != last_bit + 1) {
last_bit = next_bit; last_bit = next_bit;
nvecs++; (*nvecs)++;
} else if (xfs_buf_offset(bp, next_bit * XFS_BLF_CHUNK) != } else if (xfs_buf_offset(bp, next_bit * XFS_BLF_CHUNK) !=
(xfs_buf_offset(bp, last_bit * XFS_BLF_CHUNK) + (xfs_buf_offset(bp, last_bit * XFS_BLF_CHUNK) +
XFS_BLF_CHUNK)) { XFS_BLF_CHUNK)) {
last_bit = next_bit; last_bit = next_bit;
nvecs++; (*nvecs)++;
} else { } else {
last_bit++; last_bit++;
} }
*nbytes += XFS_BLF_CHUNK;
} }
return nvecs;
} }
/* /*
...@@ -118,12 +127,13 @@ xfs_buf_item_size_segment( ...@@ -118,12 +127,13 @@ xfs_buf_item_size_segment(
* If the XFS_BLI_STALE flag has been set, then log nothing but the buf log * If the XFS_BLI_STALE flag has been set, then log nothing but the buf log
* format structures. * format structures.
*/ */
STATIC uint STATIC void
xfs_buf_item_size( xfs_buf_item_size(
struct xfs_log_item *lip) struct xfs_log_item *lip,
int *nvecs,
int *nbytes)
{ {
struct xfs_buf_log_item *bip = BUF_ITEM(lip); struct xfs_buf_log_item *bip = BUF_ITEM(lip);
uint nvecs;
int i; int i;
ASSERT(atomic_read(&bip->bli_refcount) > 0); ASSERT(atomic_read(&bip->bli_refcount) > 0);
...@@ -135,7 +145,11 @@ xfs_buf_item_size( ...@@ -135,7 +145,11 @@ xfs_buf_item_size(
*/ */
trace_xfs_buf_item_size_stale(bip); trace_xfs_buf_item_size_stale(bip);
ASSERT(bip->__bli_format.blf_flags & XFS_BLF_CANCEL); ASSERT(bip->__bli_format.blf_flags & XFS_BLF_CANCEL);
return bip->bli_format_count; *nvecs += bip->bli_format_count;
for (i = 0; i < bip->bli_format_count; i++) {
*nbytes += xfs_buf_log_format_size(&bip->bli_formats[i]);
}
return;
} }
ASSERT(bip->bli_flags & XFS_BLI_LOGGED); ASSERT(bip->bli_flags & XFS_BLI_LOGGED);
...@@ -147,7 +161,8 @@ xfs_buf_item_size( ...@@ -147,7 +161,8 @@ xfs_buf_item_size(
* commit, so no vectors are used at all. * commit, so no vectors are used at all.
*/ */
trace_xfs_buf_item_size_ordered(bip); trace_xfs_buf_item_size_ordered(bip);
return XFS_LOG_VEC_ORDERED; *nvecs = XFS_LOG_VEC_ORDERED;
return;
} }
/* /*
...@@ -159,13 +174,11 @@ xfs_buf_item_size( ...@@ -159,13 +174,11 @@ xfs_buf_item_size(
* count for the extra buf log format structure that will need to be * count for the extra buf log format structure that will need to be
* written. * written.
*/ */
nvecs = 0;
for (i = 0; i < bip->bli_format_count; i++) { for (i = 0; i < bip->bli_format_count; i++) {
nvecs += xfs_buf_item_size_segment(bip, &bip->bli_formats[i]); xfs_buf_item_size_segment(bip, &bip->bli_formats[i],
nvecs, nbytes);
} }
trace_xfs_buf_item_size(bip); trace_xfs_buf_item_size(bip);
return nvecs;
} }
static struct xfs_log_iovec * static struct xfs_log_iovec *
...@@ -192,8 +205,7 @@ xfs_buf_item_format_segment( ...@@ -192,8 +205,7 @@ xfs_buf_item_format_segment(
* the actual size of the dirty bitmap rather than the size of the in * the actual size of the dirty bitmap rather than the size of the in
* memory structure. * memory structure.
*/ */
base_size = offsetof(struct xfs_buf_log_format, blf_data_map) + base_size = xfs_buf_log_format_size(blfp);
(blfp->blf_map_size * sizeof(blfp->blf_data_map[0]));
nvecs = 0; nvecs = 0;
first_bit = xfs_next_bit(blfp->blf_data_map, blfp->blf_map_size, 0); first_bit = xfs_next_bit(blfp->blf_data_map, blfp->blf_map_size, 0);
...@@ -601,11 +613,9 @@ xfs_buf_item_unlock( ...@@ -601,11 +613,9 @@ xfs_buf_item_unlock(
} }
} }
} }
if (clean) if (clean || aborted) {
xfs_buf_item_relse(bp);
else if (aborted) {
if (atomic_dec_and_test(&bip->bli_refcount)) { if (atomic_dec_and_test(&bip->bli_refcount)) {
ASSERT(XFS_FORCED_SHUTDOWN(lip->li_mountp)); ASSERT(!aborted || XFS_FORCED_SHUTDOWN(lip->li_mountp));
xfs_buf_item_relse(bp); xfs_buf_item_relse(bp);
} }
} else } else
......
...@@ -18,101 +18,9 @@ ...@@ -18,101 +18,9 @@
#ifndef __XFS_BUF_ITEM_H__ #ifndef __XFS_BUF_ITEM_H__
#define __XFS_BUF_ITEM_H__ #define __XFS_BUF_ITEM_H__
extern kmem_zone_t *xfs_buf_item_zone; /* kernel only definitions */
/*
* This flag indicates that the buffer contains on disk inodes
* and requires special recovery handling.
*/
#define XFS_BLF_INODE_BUF (1<<0)
/*
* This flag indicates that the buffer should not be replayed
* during recovery because its blocks are being freed.
*/
#define XFS_BLF_CANCEL (1<<1)
/*
* This flag indicates that the buffer contains on disk
* user or group dquots and may require special recovery handling.
*/
#define XFS_BLF_UDQUOT_BUF (1<<2)
#define XFS_BLF_PDQUOT_BUF (1<<3)
#define XFS_BLF_GDQUOT_BUF (1<<4)
#define XFS_BLF_CHUNK 128
#define XFS_BLF_SHIFT 7
#define BIT_TO_WORD_SHIFT 5
#define NBWORD (NBBY * sizeof(unsigned int))
/*
* This is the structure used to lay out a buf log item in the
* log. The data map describes which 128 byte chunks of the buffer
* have been logged.
*/
#define XFS_BLF_DATAMAP_SIZE ((XFS_MAX_BLOCKSIZE / XFS_BLF_CHUNK) / NBWORD)
typedef struct xfs_buf_log_format { /* buf log item flags */
unsigned short blf_type; /* buf log item type indicator */
unsigned short blf_size; /* size of this item */
ushort blf_flags; /* misc state */
ushort blf_len; /* number of blocks in this buf */
__int64_t blf_blkno; /* starting blkno of this buf */
unsigned int blf_map_size; /* used size of data bitmap in words */
unsigned int blf_data_map[XFS_BLF_DATAMAP_SIZE]; /* dirty bitmap */
} xfs_buf_log_format_t;
/*
* All buffers now need to tell recovery where the magic number
* is so that it can verify and calculate the CRCs on the buffer correctly
* once the changes have been replayed into the buffer.
*
* The type value is held in the upper 5 bits of the blf_flags field, which is
* an unsigned 16 bit field. Hence we need to shift it 11 bits up and down.
*/
#define XFS_BLFT_BITS 5
#define XFS_BLFT_SHIFT 11
#define XFS_BLFT_MASK (((1 << XFS_BLFT_BITS) - 1) << XFS_BLFT_SHIFT)
enum xfs_blft {
XFS_BLFT_UNKNOWN_BUF = 0,
XFS_BLFT_UDQUOT_BUF,
XFS_BLFT_PDQUOT_BUF,
XFS_BLFT_GDQUOT_BUF,
XFS_BLFT_BTREE_BUF,
XFS_BLFT_AGF_BUF,
XFS_BLFT_AGFL_BUF,
XFS_BLFT_AGI_BUF,
XFS_BLFT_DINO_BUF,
XFS_BLFT_SYMLINK_BUF,
XFS_BLFT_DIR_BLOCK_BUF,
XFS_BLFT_DIR_DATA_BUF,
XFS_BLFT_DIR_FREE_BUF,
XFS_BLFT_DIR_LEAF1_BUF,
XFS_BLFT_DIR_LEAFN_BUF,
XFS_BLFT_DA_NODE_BUF,
XFS_BLFT_ATTR_LEAF_BUF,
XFS_BLFT_ATTR_RMT_BUF,
XFS_BLFT_SB_BUF,
XFS_BLFT_MAX_BUF = (1 << XFS_BLFT_BITS),
};
static inline void
xfs_blft_to_flags(struct xfs_buf_log_format *blf, enum xfs_blft type)
{
ASSERT(type > XFS_BLFT_UNKNOWN_BUF && type < XFS_BLFT_MAX_BUF);
blf->blf_flags &= ~XFS_BLFT_MASK;
blf->blf_flags |= ((type << XFS_BLFT_SHIFT) & XFS_BLFT_MASK);
}
static inline __uint16_t
xfs_blft_from_flags(struct xfs_buf_log_format *blf)
{
return (blf->blf_flags & XFS_BLFT_MASK) >> XFS_BLFT_SHIFT;
}
/*
* buf log item flags
*/
#define XFS_BLI_HOLD 0x01 #define XFS_BLI_HOLD 0x01
#define XFS_BLI_DIRTY 0x02 #define XFS_BLI_DIRTY 0x02
#define XFS_BLI_STALE 0x04 #define XFS_BLI_STALE 0x04
...@@ -133,8 +41,6 @@ xfs_blft_from_flags(struct xfs_buf_log_format *blf) ...@@ -133,8 +41,6 @@ xfs_blft_from_flags(struct xfs_buf_log_format *blf)
{ XFS_BLI_ORDERED, "ORDERED" } { XFS_BLI_ORDERED, "ORDERED" }
#ifdef __KERNEL__
struct xfs_buf; struct xfs_buf;
struct xfs_mount; struct xfs_mount;
struct xfs_buf_log_item; struct xfs_buf_log_item;
...@@ -169,6 +75,6 @@ void xfs_trans_buf_set_type(struct xfs_trans *, struct xfs_buf *, ...@@ -169,6 +75,6 @@ void xfs_trans_buf_set_type(struct xfs_trans *, struct xfs_buf *,
enum xfs_blft); enum xfs_blft);
void xfs_trans_buf_copy_type(struct xfs_buf *dst_bp, struct xfs_buf *src_bp); void xfs_trans_buf_copy_type(struct xfs_buf *dst_bp, struct xfs_buf *src_bp);
#endif /* __KERNEL__ */ extern kmem_zone_t *xfs_buf_item_zone;
#endif /* __XFS_BUF_ITEM_H__ */ #endif /* __XFS_BUF_ITEM_H__ */
...@@ -27,8 +27,8 @@ ...@@ -27,8 +27,8 @@
#include "xfs_mount.h" #include "xfs_mount.h"
#include "xfs_da_btree.h" #include "xfs_da_btree.h"
#include "xfs_bmap_btree.h" #include "xfs_bmap_btree.h"
#include "xfs_dir2.h"
#include "xfs_dir2_format.h" #include "xfs_dir2_format.h"
#include "xfs_dir2.h"
#include "xfs_dir2_priv.h" #include "xfs_dir2_priv.h"
#include "xfs_dinode.h" #include "xfs_dinode.h"
#include "xfs_inode.h" #include "xfs_inode.h"
...@@ -399,7 +399,7 @@ xfs_da3_split( ...@@ -399,7 +399,7 @@ xfs_da3_split(
struct xfs_da_intnode *node; struct xfs_da_intnode *node;
struct xfs_buf *bp; struct xfs_buf *bp;
int max; int max;
int action; int action = 0;
int error; int error;
int i; int i;
...@@ -2454,9 +2454,9 @@ static int ...@@ -2454,9 +2454,9 @@ static int
xfs_buf_map_from_irec( xfs_buf_map_from_irec(
struct xfs_mount *mp, struct xfs_mount *mp,
struct xfs_buf_map **mapp, struct xfs_buf_map **mapp,
unsigned int *nmaps, int *nmaps,
struct xfs_bmbt_irec *irecs, struct xfs_bmbt_irec *irecs,
unsigned int nirecs) int nirecs)
{ {
struct xfs_buf_map *map; struct xfs_buf_map *map;
int i; int i;
......
...@@ -133,12 +133,19 @@ extern void xfs_da3_node_hdr_to_disk(struct xfs_da_intnode *to, ...@@ -133,12 +133,19 @@ extern void xfs_da3_node_hdr_to_disk(struct xfs_da_intnode *to,
struct xfs_da3_icnode_hdr *from); struct xfs_da3_icnode_hdr *from);
static inline int static inline int
xfs_da3_node_hdr_size(struct xfs_da_intnode *dap) __xfs_da3_node_hdr_size(bool v3)
{ {
if (dap->hdr.info.magic == cpu_to_be16(XFS_DA3_NODE_MAGIC)) if (v3)
return sizeof(struct xfs_da3_node_hdr); return sizeof(struct xfs_da3_node_hdr);
return sizeof(struct xfs_da_node_hdr); return sizeof(struct xfs_da_node_hdr);
} }
static inline int
xfs_da3_node_hdr_size(struct xfs_da_intnode *dap)
{
bool v3 = dap->hdr.info.magic == cpu_to_be16(XFS_DA3_NODE_MAGIC);
return __xfs_da3_node_hdr_size(v3);
}
static inline struct xfs_da_node_entry * static inline struct xfs_da_node_entry *
xfs_da3_node_tree_p(struct xfs_da_intnode *dap) xfs_da3_node_tree_p(struct xfs_da_intnode *dap)
...@@ -176,6 +183,7 @@ enum xfs_dacmp { ...@@ -176,6 +183,7 @@ enum xfs_dacmp {
typedef struct xfs_da_args { typedef struct xfs_da_args {
const __uint8_t *name; /* string (maybe not NULL terminated) */ const __uint8_t *name; /* string (maybe not NULL terminated) */
int namelen; /* length of string (maybe no NULL) */ int namelen; /* length of string (maybe no NULL) */
__uint8_t filetype; /* filetype of inode for directories */
__uint8_t *value; /* set of bytes (maybe contain NULLs) */ __uint8_t *value; /* set of bytes (maybe contain NULLs) */
int valuelen; /* length of value */ int valuelen; /* length of value */
int flags; /* argument flags (eg: ATTR_NOCREATE) */ int flags; /* argument flags (eg: ATTR_NOCREATE) */
......
This diff is collapsed.
...@@ -31,14 +31,14 @@ ...@@ -31,14 +31,14 @@
#include "xfs_inode.h" #include "xfs_inode.h"
#include "xfs_inode_item.h" #include "xfs_inode_item.h"
#include "xfs_bmap.h" #include "xfs_bmap.h"
#include "xfs_dir2.h"
#include "xfs_dir2_format.h" #include "xfs_dir2_format.h"
#include "xfs_dir2.h"
#include "xfs_dir2_priv.h" #include "xfs_dir2_priv.h"
#include "xfs_error.h" #include "xfs_error.h"
#include "xfs_vnodeops.h"
#include "xfs_trace.h" #include "xfs_trace.h"
struct xfs_name xfs_name_dotdot = { (unsigned char *)"..", 2}; struct xfs_name xfs_name_dotdot = { (unsigned char *)"..", 2, XFS_DIR3_FT_DIR };
/* /*
* ASCII case-insensitive (ie. A-Z) support for directories that was * ASCII case-insensitive (ie. A-Z) support for directories that was
...@@ -90,6 +90,9 @@ void ...@@ -90,6 +90,9 @@ void
xfs_dir_mount( xfs_dir_mount(
xfs_mount_t *mp) xfs_mount_t *mp)
{ {
int nodehdr_size;
ASSERT(xfs_sb_version_hasdirv2(&mp->m_sb)); ASSERT(xfs_sb_version_hasdirv2(&mp->m_sb));
ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <= ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <=
XFS_MAX_BLOCKSIZE); XFS_MAX_BLOCKSIZE);
...@@ -98,12 +101,13 @@ xfs_dir_mount( ...@@ -98,12 +101,13 @@ xfs_dir_mount(
mp->m_dirdatablk = xfs_dir2_db_to_da(mp, XFS_DIR2_DATA_FIRSTDB(mp)); mp->m_dirdatablk = xfs_dir2_db_to_da(mp, XFS_DIR2_DATA_FIRSTDB(mp));
mp->m_dirleafblk = xfs_dir2_db_to_da(mp, XFS_DIR2_LEAF_FIRSTDB(mp)); mp->m_dirleafblk = xfs_dir2_db_to_da(mp, XFS_DIR2_LEAF_FIRSTDB(mp));
mp->m_dirfreeblk = xfs_dir2_db_to_da(mp, XFS_DIR2_FREE_FIRSTDB(mp)); mp->m_dirfreeblk = xfs_dir2_db_to_da(mp, XFS_DIR2_FREE_FIRSTDB(mp));
mp->m_attr_node_ents =
(mp->m_sb.sb_blocksize - (uint)sizeof(xfs_da_node_hdr_t)) / nodehdr_size = __xfs_da3_node_hdr_size(xfs_sb_version_hascrc(&mp->m_sb));
(uint)sizeof(xfs_da_node_entry_t); mp->m_attr_node_ents = (mp->m_sb.sb_blocksize - nodehdr_size) /
mp->m_dir_node_ents = (uint)sizeof(xfs_da_node_entry_t);
(mp->m_dirblksize - (uint)sizeof(xfs_da_node_hdr_t)) / mp->m_dir_node_ents = (mp->m_dirblksize - nodehdr_size) /
(uint)sizeof(xfs_da_node_entry_t); (uint)sizeof(xfs_da_node_entry_t);
mp->m_dir_magicpct = (mp->m_dirblksize * 37) / 100; mp->m_dir_magicpct = (mp->m_dirblksize * 37) / 100;
if (xfs_sb_version_hasasciici(&mp->m_sb)) if (xfs_sb_version_hasasciici(&mp->m_sb))
mp->m_dirnameops = &xfs_ascii_ci_nameops; mp->m_dirnameops = &xfs_ascii_ci_nameops;
...@@ -209,6 +213,7 @@ xfs_dir_createname( ...@@ -209,6 +213,7 @@ xfs_dir_createname(
memset(&args, 0, sizeof(xfs_da_args_t)); memset(&args, 0, sizeof(xfs_da_args_t));
args.name = name->name; args.name = name->name;
args.namelen = name->len; args.namelen = name->len;
args.filetype = name->type;
args.hashval = dp->i_mount->m_dirnameops->hashname(name); args.hashval = dp->i_mount->m_dirnameops->hashname(name);
args.inumber = inum; args.inumber = inum;
args.dp = dp; args.dp = dp;
...@@ -283,6 +288,7 @@ xfs_dir_lookup( ...@@ -283,6 +288,7 @@ xfs_dir_lookup(
memset(&args, 0, sizeof(xfs_da_args_t)); memset(&args, 0, sizeof(xfs_da_args_t));
args.name = name->name; args.name = name->name;
args.namelen = name->len; args.namelen = name->len;
args.filetype = name->type;
args.hashval = dp->i_mount->m_dirnameops->hashname(name); args.hashval = dp->i_mount->m_dirnameops->hashname(name);
args.dp = dp; args.dp = dp;
args.whichfork = XFS_DATA_FORK; args.whichfork = XFS_DATA_FORK;
...@@ -338,6 +344,7 @@ xfs_dir_removename( ...@@ -338,6 +344,7 @@ xfs_dir_removename(
memset(&args, 0, sizeof(xfs_da_args_t)); memset(&args, 0, sizeof(xfs_da_args_t));
args.name = name->name; args.name = name->name;
args.namelen = name->len; args.namelen = name->len;
args.filetype = name->type;
args.hashval = dp->i_mount->m_dirnameops->hashname(name); args.hashval = dp->i_mount->m_dirnameops->hashname(name);
args.inumber = ino; args.inumber = ino;
args.dp = dp; args.dp = dp;
...@@ -362,37 +369,6 @@ xfs_dir_removename( ...@@ -362,37 +369,6 @@ xfs_dir_removename(
return rval; return rval;
} }
/*
* Read a directory.
*/
int
xfs_readdir(
xfs_inode_t *dp,
struct dir_context *ctx,
size_t bufsize)
{
int rval; /* return value */
int v; /* type-checking value */
trace_xfs_readdir(dp);
if (XFS_FORCED_SHUTDOWN(dp->i_mount))
return XFS_ERROR(EIO);
ASSERT(S_ISDIR(dp->i_d.di_mode));
XFS_STATS_INC(xs_dir_getdents);
if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
rval = xfs_dir2_sf_getdents(dp, ctx);
else if ((rval = xfs_dir2_isblock(NULL, dp, &v)))
;
else if (v)
rval = xfs_dir2_block_getdents(dp, ctx);
else
rval = xfs_dir2_leaf_getdents(dp, ctx, bufsize);
return rval;
}
/* /*
* Replace the inode number of a directory entry. * Replace the inode number of a directory entry.
*/ */
...@@ -418,6 +394,7 @@ xfs_dir_replace( ...@@ -418,6 +394,7 @@ xfs_dir_replace(
memset(&args, 0, sizeof(xfs_da_args_t)); memset(&args, 0, sizeof(xfs_da_args_t));
args.name = name->name; args.name = name->name;
args.namelen = name->len; args.namelen = name->len;
args.filetype = name->type;
args.hashval = dp->i_mount->m_dirnameops->hashname(name); args.hashval = dp->i_mount->m_dirnameops->hashname(name);
args.inumber = inum; args.inumber = inum;
args.dp = dp; args.dp = dp;
...@@ -465,6 +442,7 @@ xfs_dir_canenter( ...@@ -465,6 +442,7 @@ xfs_dir_canenter(
memset(&args, 0, sizeof(xfs_da_args_t)); memset(&args, 0, sizeof(xfs_da_args_t));
args.name = name->name; args.name = name->name;
args.namelen = name->len; args.namelen = name->len;
args.filetype = name->type;
args.hashval = dp->i_mount->m_dirnameops->hashname(name); args.hashval = dp->i_mount->m_dirnameops->hashname(name);
args.dp = dp; args.dp = dp;
args.whichfork = XFS_DATA_FORK; args.whichfork = XFS_DATA_FORK;
......
...@@ -23,6 +23,11 @@ struct xfs_da_args; ...@@ -23,6 +23,11 @@ struct xfs_da_args;
struct xfs_inode; struct xfs_inode;
struct xfs_mount; struct xfs_mount;
struct xfs_trans; struct xfs_trans;
struct xfs_dir2_sf_hdr;
struct xfs_dir2_sf_entry;
struct xfs_dir2_data_hdr;
struct xfs_dir2_data_entry;
struct xfs_dir2_data_unused;
extern struct xfs_name xfs_name_dotdot; extern struct xfs_name xfs_name_dotdot;
...@@ -57,4 +62,45 @@ extern int xfs_dir_canenter(struct xfs_trans *tp, struct xfs_inode *dp, ...@@ -57,4 +62,45 @@ extern int xfs_dir_canenter(struct xfs_trans *tp, struct xfs_inode *dp,
*/ */
extern int xfs_dir2_sf_to_block(struct xfs_da_args *args); extern int xfs_dir2_sf_to_block(struct xfs_da_args *args);
/*
* Interface routines used by userspace utilities
*/
extern xfs_ino_t xfs_dir2_sf_get_parent_ino(struct xfs_dir2_sf_hdr *sfp);
extern void xfs_dir2_sf_put_parent_ino(struct xfs_dir2_sf_hdr *sfp,
xfs_ino_t ino);
extern xfs_ino_t xfs_dir3_sfe_get_ino(struct xfs_mount *mp,
struct xfs_dir2_sf_hdr *sfp, struct xfs_dir2_sf_entry *sfep);
extern void xfs_dir3_sfe_put_ino(struct xfs_mount *mp,
struct xfs_dir2_sf_hdr *hdr, struct xfs_dir2_sf_entry *sfep,
xfs_ino_t ino);
extern int xfs_dir2_isblock(struct xfs_trans *tp, struct xfs_inode *dp, int *r);
extern int xfs_dir2_isleaf(struct xfs_trans *tp, struct xfs_inode *dp, int *r);
extern int xfs_dir2_shrink_inode(struct xfs_da_args *args, xfs_dir2_db_t db,
struct xfs_buf *bp);
extern void xfs_dir2_data_freescan(struct xfs_mount *mp,
struct xfs_dir2_data_hdr *hdr, int *loghead);
extern void xfs_dir2_data_log_entry(struct xfs_trans *tp, struct xfs_buf *bp,
struct xfs_dir2_data_entry *dep);
extern void xfs_dir2_data_log_header(struct xfs_trans *tp,
struct xfs_buf *bp);
extern void xfs_dir2_data_log_unused(struct xfs_trans *tp, struct xfs_buf *bp,
struct xfs_dir2_data_unused *dup);
extern void xfs_dir2_data_make_free(struct xfs_trans *tp, struct xfs_buf *bp,
xfs_dir2_data_aoff_t offset, xfs_dir2_data_aoff_t len,
int *needlogp, int *needscanp);
extern void xfs_dir2_data_use_free(struct xfs_trans *tp, struct xfs_buf *bp,
struct xfs_dir2_data_unused *dup, xfs_dir2_data_aoff_t offset,
xfs_dir2_data_aoff_t len, int *needlogp, int *needscanp);
extern struct xfs_dir2_data_free *xfs_dir2_data_freefind(
struct xfs_dir2_data_hdr *hdr, struct xfs_dir2_data_unused *dup);
extern const struct xfs_buf_ops xfs_dir3_block_buf_ops;
extern const struct xfs_buf_ops xfs_dir3_leafn_buf_ops;
extern const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops;
extern const struct xfs_buf_ops xfs_dir3_free_buf_ops;
extern const struct xfs_buf_ops xfs_dir3_data_buf_ops;
#endif /* __XFS_DIR2_H__ */ #endif /* __XFS_DIR2_H__ */
This diff is collapsed.
...@@ -29,14 +29,12 @@ ...@@ -29,14 +29,12 @@
#include "xfs_dinode.h" #include "xfs_dinode.h"
#include "xfs_inode.h" #include "xfs_inode.h"
#include "xfs_dir2_format.h" #include "xfs_dir2_format.h"
#include "xfs_dir2.h"
#include "xfs_dir2_priv.h" #include "xfs_dir2_priv.h"
#include "xfs_error.h" #include "xfs_error.h"
#include "xfs_buf_item.h" #include "xfs_buf_item.h"
#include "xfs_cksum.h" #include "xfs_cksum.h"
STATIC xfs_dir2_data_free_t *
xfs_dir2_data_freefind(xfs_dir2_data_hdr_t *hdr, xfs_dir2_data_unused_t *dup);
/* /*
* Check the consistency of the data block. * Check the consistency of the data block.
* The input can also be a block-format directory. * The input can also be a block-format directory.
...@@ -149,8 +147,10 @@ __xfs_dir3_data_check( ...@@ -149,8 +147,10 @@ __xfs_dir3_data_check(
XFS_WANT_CORRUPTED_RETURN( XFS_WANT_CORRUPTED_RETURN(
!xfs_dir_ino_validate(mp, be64_to_cpu(dep->inumber))); !xfs_dir_ino_validate(mp, be64_to_cpu(dep->inumber)));
XFS_WANT_CORRUPTED_RETURN( XFS_WANT_CORRUPTED_RETURN(
be16_to_cpu(*xfs_dir2_data_entry_tag_p(dep)) == be16_to_cpu(*xfs_dir3_data_entry_tag_p(mp, dep)) ==
(char *)dep - (char *)hdr); (char *)dep - (char *)hdr);
XFS_WANT_CORRUPTED_RETURN(
xfs_dir3_dirent_get_ftype(mp, dep) < XFS_DIR3_FT_MAX);
count++; count++;
lastfree = 0; lastfree = 0;
if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
...@@ -168,7 +168,7 @@ __xfs_dir3_data_check( ...@@ -168,7 +168,7 @@ __xfs_dir3_data_check(
} }
XFS_WANT_CORRUPTED_RETURN(i < be32_to_cpu(btp->count)); XFS_WANT_CORRUPTED_RETURN(i < be32_to_cpu(btp->count));
} }
p += xfs_dir2_data_entsize(dep->namelen); p += xfs_dir3_data_entsize(mp, dep->namelen);
} }
/* /*
* Need to have seen all the entries and all the bestfree slots. * Need to have seen all the entries and all the bestfree slots.
...@@ -325,7 +325,7 @@ xfs_dir3_data_readahead( ...@@ -325,7 +325,7 @@ xfs_dir3_data_readahead(
* Given a data block and an unused entry from that block, * Given a data block and an unused entry from that block,
* return the bestfree entry if any that corresponds to it. * return the bestfree entry if any that corresponds to it.
*/ */
STATIC xfs_dir2_data_free_t * xfs_dir2_data_free_t *
xfs_dir2_data_freefind( xfs_dir2_data_freefind(
xfs_dir2_data_hdr_t *hdr, /* data block */ xfs_dir2_data_hdr_t *hdr, /* data block */
xfs_dir2_data_unused_t *dup) /* data unused entry */ xfs_dir2_data_unused_t *dup) /* data unused entry */
...@@ -333,7 +333,7 @@ xfs_dir2_data_freefind( ...@@ -333,7 +333,7 @@ xfs_dir2_data_freefind(
xfs_dir2_data_free_t *dfp; /* bestfree entry */ xfs_dir2_data_free_t *dfp; /* bestfree entry */
xfs_dir2_data_aoff_t off; /* offset value needed */ xfs_dir2_data_aoff_t off; /* offset value needed */
struct xfs_dir2_data_free *bf; struct xfs_dir2_data_free *bf;
#if defined(DEBUG) && defined(__KERNEL__) #ifdef DEBUG
int matched; /* matched the value */ int matched; /* matched the value */
int seenzero; /* saw a 0 bestfree entry */ int seenzero; /* saw a 0 bestfree entry */
#endif #endif
...@@ -341,7 +341,7 @@ xfs_dir2_data_freefind( ...@@ -341,7 +341,7 @@ xfs_dir2_data_freefind(
off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr); off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr);
bf = xfs_dir3_data_bestfree_p(hdr); bf = xfs_dir3_data_bestfree_p(hdr);
#if defined(DEBUG) && defined(__KERNEL__) #ifdef DEBUG
/* /*
* Validate some consistency in the bestfree table. * Validate some consistency in the bestfree table.
* Check order, non-overlapping entries, and if we find the * Check order, non-overlapping entries, and if we find the
...@@ -538,8 +538,8 @@ xfs_dir2_data_freescan( ...@@ -538,8 +538,8 @@ xfs_dir2_data_freescan(
else { else {
dep = (xfs_dir2_data_entry_t *)p; dep = (xfs_dir2_data_entry_t *)p;
ASSERT((char *)dep - (char *)hdr == ASSERT((char *)dep - (char *)hdr ==
be16_to_cpu(*xfs_dir2_data_entry_tag_p(dep))); be16_to_cpu(*xfs_dir3_data_entry_tag_p(mp, dep)));
p += xfs_dir2_data_entsize(dep->namelen); p += xfs_dir3_data_entsize(mp, dep->namelen);
} }
} }
} }
...@@ -629,7 +629,8 @@ xfs_dir2_data_log_entry( ...@@ -629,7 +629,8 @@ xfs_dir2_data_log_entry(
struct xfs_buf *bp, struct xfs_buf *bp,
xfs_dir2_data_entry_t *dep) /* data entry pointer */ xfs_dir2_data_entry_t *dep) /* data entry pointer */
{ {
xfs_dir2_data_hdr_t *hdr = bp->b_addr; struct xfs_dir2_data_hdr *hdr = bp->b_addr;
struct xfs_mount *mp = tp->t_mountp;
ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
...@@ -637,7 +638,7 @@ xfs_dir2_data_log_entry( ...@@ -637,7 +638,7 @@ xfs_dir2_data_log_entry(
hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
xfs_trans_log_buf(tp, bp, (uint)((char *)dep - (char *)hdr), xfs_trans_log_buf(tp, bp, (uint)((char *)dep - (char *)hdr),
(uint)((char *)(xfs_dir2_data_entry_tag_p(dep) + 1) - (uint)((char *)(xfs_dir3_data_entry_tag_p(mp, dep) + 1) -
(char *)hdr - 1)); (char *)hdr - 1));
} }
......
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
...@@ -26,7 +26,6 @@ ...@@ -26,7 +26,6 @@
#include "xfs_bmap_btree.h" #include "xfs_bmap_btree.h"
#include "xfs_dinode.h" #include "xfs_dinode.h"
#include "xfs_inode.h" #include "xfs_inode.h"
#include "xfs_utils.h"
#include "xfs_error.h" #include "xfs_error.h"
#ifdef DEBUG #ifdef DEBUG
......
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment