[XFS] mark various symbols static Patch from Adrian Bunk
SGI-PV: 936255 SGI-Modid: xfs-linux:xfs-kern:192760a Signed-off-by: Christoph Hellwig <hch@sgi.com> Signed-off-by: Nathan Scott <nathans@sgi.com>
This commit is contained in:
Christoph Hellwig
Nathan Scott
Родитель
4372d6e103
Коммит
ba0f32d460
|
|
@ -101,7 +101,7 @@ int xfs_dqerror_mod = 33;
|
|||
* is the d_id field. The idea is to fill in the entire q_core
|
||||
* when we read in the on disk dquot.
|
||||
*/
|
||||
xfs_dquot_t *
|
||||
STATIC xfs_dquot_t *
|
||||
xfs_qm_dqinit(
|
||||
xfs_mount_t *mp,
|
||||
xfs_dqid_t id,
|
||||
|
|
|
|||
|
|
@ -428,7 +428,7 @@ xfs_qm_dquot_logitem_committing(
|
|||
/*
|
||||
* This is the ops vector for dquots
|
||||
*/
|
||||
struct xfs_item_ops xfs_dquot_item_ops = {
|
||||
STATIC struct xfs_item_ops xfs_dquot_item_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_qm_dquot_logitem_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_qm_dquot_logitem_format,
|
||||
|
|
@ -646,7 +646,7 @@ xfs_qm_qoffend_logitem_committing(xfs_qoff_logitem_t *qip, xfs_lsn_t commit_lsn)
|
|||
return;
|
||||
}
|
||||
|
||||
struct xfs_item_ops xfs_qm_qoffend_logitem_ops = {
|
||||
STATIC struct xfs_item_ops xfs_qm_qoffend_logitem_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_qm_qoff_logitem_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_qm_qoff_logitem_format,
|
||||
|
|
@ -669,7 +669,7 @@ struct xfs_item_ops xfs_qm_qoffend_logitem_ops = {
|
|||
/*
|
||||
* This is the ops vector shared by all quotaoff-start log items.
|
||||
*/
|
||||
struct xfs_item_ops xfs_qm_qoff_logitem_ops = {
|
||||
STATIC struct xfs_item_ops xfs_qm_qoff_logitem_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_qm_qoff_logitem_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_qm_qoff_logitem_format,
|
||||
|
|
|
|||
|
|
@ -81,12 +81,18 @@ struct xfs_qm *xfs_Gqm;
|
|||
|
||||
kmem_zone_t *qm_dqzone;
|
||||
kmem_zone_t *qm_dqtrxzone;
|
||||
kmem_shaker_t xfs_qm_shaker;
|
||||
STATIC kmem_shaker_t xfs_qm_shaker;
|
||||
|
||||
STATIC void xfs_qm_list_init(xfs_dqlist_t *, char *, int);
|
||||
STATIC void xfs_qm_list_destroy(xfs_dqlist_t *);
|
||||
|
||||
STATIC void xfs_qm_freelist_init(xfs_frlist_t *);
|
||||
STATIC void xfs_qm_freelist_destroy(xfs_frlist_t *);
|
||||
STATIC int xfs_qm_mplist_nowait(xfs_mount_t *);
|
||||
STATIC int xfs_qm_dqhashlock_nowait(xfs_dquot_t *);
|
||||
|
||||
STATIC int xfs_qm_init_quotainos(xfs_mount_t *);
|
||||
STATIC int xfs_qm_init_quotainfo(xfs_mount_t *);
|
||||
STATIC int xfs_qm_shake(int, unsigned int);
|
||||
|
||||
#ifdef DEBUG
|
||||
|
|
@ -184,7 +190,7 @@ xfs_Gqm_init(void)
|
|||
/*
|
||||
* Destroy the global quota manager when its reference count goes to zero.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_qm_destroy(
|
||||
struct xfs_qm *xqm)
|
||||
{
|
||||
|
|
@ -509,7 +515,7 @@ out:
|
|||
* Flush all dquots of the given file system to disk. The dquots are
|
||||
* _not_ purged from memory here, just their data written to disk.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_qm_dqflush_all(
|
||||
xfs_mount_t *mp,
|
||||
int flags)
|
||||
|
|
@ -1149,7 +1155,7 @@ xfs_qm_sync(
|
|||
* This initializes all the quota information that's kept in the
|
||||
* mount structure
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_qm_init_quotainfo(
|
||||
xfs_mount_t *mp)
|
||||
{
|
||||
|
|
@ -2751,7 +2757,7 @@ xfs_qm_vop_dqattach_and_dqmod_newinode(
|
|||
}
|
||||
|
||||
/* ------------- list stuff -----------------*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_qm_freelist_init(xfs_frlist_t *ql)
|
||||
{
|
||||
ql->qh_next = ql->qh_prev = (xfs_dquot_t *) ql;
|
||||
|
|
@ -2760,7 +2766,7 @@ xfs_qm_freelist_init(xfs_frlist_t *ql)
|
|||
ql->qh_nelems = 0;
|
||||
}
|
||||
|
||||
void
|
||||
STATIC void
|
||||
xfs_qm_freelist_destroy(xfs_frlist_t *ql)
|
||||
{
|
||||
xfs_dquot_t *dqp, *nextdqp;
|
||||
|
|
@ -2786,7 +2792,7 @@ xfs_qm_freelist_destroy(xfs_frlist_t *ql)
|
|||
ASSERT(ql->qh_nelems == 0);
|
||||
}
|
||||
|
||||
void
|
||||
STATIC void
|
||||
xfs_qm_freelist_insert(xfs_frlist_t *ql, xfs_dquot_t *dq)
|
||||
{
|
||||
dq->dq_flnext = ql->qh_next;
|
||||
|
|
@ -2816,7 +2822,7 @@ xfs_qm_freelist_append(xfs_frlist_t *ql, xfs_dquot_t *dq)
|
|||
xfs_qm_freelist_insert((xfs_frlist_t *)ql->qh_prev, dq);
|
||||
}
|
||||
|
||||
int
|
||||
STATIC int
|
||||
xfs_qm_dqhashlock_nowait(
|
||||
xfs_dquot_t *dqp)
|
||||
{
|
||||
|
|
@ -2836,7 +2842,7 @@ xfs_qm_freelist_lock_nowait(
|
|||
return (locked);
|
||||
}
|
||||
|
||||
int
|
||||
STATIC int
|
||||
xfs_qm_mplist_nowait(
|
||||
xfs_mount_t *mp)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -184,7 +184,6 @@ typedef struct xfs_dquot_acct {
|
|||
|
||||
extern void xfs_mount_reset_sbqflags(xfs_mount_t *);
|
||||
|
||||
extern int xfs_qm_init_quotainfo(xfs_mount_t *);
|
||||
extern void xfs_qm_destroy_quotainfo(xfs_mount_t *);
|
||||
extern int xfs_qm_mount_quotas(xfs_mount_t *, int);
|
||||
extern void xfs_qm_mount_quotainit(xfs_mount_t *, uint);
|
||||
|
|
@ -215,14 +214,9 @@ extern int xfs_qm_vop_chown_reserve(xfs_trans_t *, xfs_inode_t *,
|
|||
xfs_dquot_t *, xfs_dquot_t *, uint);
|
||||
|
||||
/* list stuff */
|
||||
extern void xfs_qm_freelist_init(xfs_frlist_t *);
|
||||
extern void xfs_qm_freelist_destroy(xfs_frlist_t *);
|
||||
extern void xfs_qm_freelist_insert(xfs_frlist_t *, xfs_dquot_t *);
|
||||
extern void xfs_qm_freelist_append(xfs_frlist_t *, xfs_dquot_t *);
|
||||
extern void xfs_qm_freelist_unlink(xfs_dquot_t *);
|
||||
extern int xfs_qm_freelist_lock_nowait(xfs_qm_t *);
|
||||
extern int xfs_qm_mplist_nowait(xfs_mount_t *);
|
||||
extern int xfs_qm_dqhashlock_nowait(xfs_dquot_t *);
|
||||
|
||||
/* system call interface */
|
||||
extern int xfs_qm_quotactl(bhv_desc_t *, int, int, xfs_caddr_t);
|
||||
|
|
|
|||
|
|
@ -359,7 +359,7 @@ xfs_qm_dqrele_null(
|
|||
}
|
||||
|
||||
|
||||
struct xfs_qmops xfs_qmcore_xfs = {
|
||||
STATIC struct xfs_qmops xfs_qmcore_xfs = {
|
||||
.xfs_qminit = xfs_qm_newmount,
|
||||
.xfs_qmdone = xfs_qm_unmount_quotadestroy,
|
||||
.xfs_qmmount = xfs_qm_endmount,
|
||||
|
|
|
|||
|
|
@ -187,7 +187,7 @@ xfs_trans_dup_dqinfo(
|
|||
/*
|
||||
* Wrap around mod_dquot to account for both user and group quotas.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_trans_mod_dquot_byino(
|
||||
xfs_trans_t *tp,
|
||||
xfs_inode_t *ip,
|
||||
|
|
@ -368,7 +368,7 @@ xfs_trans_dqlockedjoin(
|
|||
* Unreserve just the reservations done by this transaction.
|
||||
* dquot is still left locked at exit.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_trans_apply_dquot_deltas(
|
||||
xfs_trans_t *tp)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -59,7 +59,7 @@
|
|||
#define XFSA_FIXUP_BNO_OK 1
|
||||
#define XFSA_FIXUP_CNT_OK 2
|
||||
|
||||
int
|
||||
STATIC int
|
||||
xfs_alloc_search_busy(xfs_trans_t *tp,
|
||||
xfs_agnumber_t agno,
|
||||
xfs_agblock_t bno,
|
||||
|
|
@ -2562,7 +2562,7 @@ xfs_alloc_clear_busy(xfs_trans_t *tp,
|
|||
/*
|
||||
* returns non-zero if any of (agno,bno):len is in a busy list
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_alloc_search_busy(xfs_trans_t *tp,
|
||||
xfs_agnumber_t agno,
|
||||
xfs_agblock_t bno,
|
||||
|
|
|
|||
|
|
@ -71,6 +71,11 @@
|
|||
* Provide the external interfaces to manage attribute lists.
|
||||
*/
|
||||
|
||||
#define ATTR_SYSCOUNT 2
|
||||
STATIC struct attrnames posix_acl_access;
|
||||
STATIC struct attrnames posix_acl_default;
|
||||
STATIC struct attrnames *attr_system_names[ATTR_SYSCOUNT];
|
||||
|
||||
/*========================================================================
|
||||
* Function prototypes for the kernel.
|
||||
*========================================================================*/
|
||||
|
|
@ -83,6 +88,7 @@ STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args);
|
|||
/*
|
||||
* Internal routines when attribute list is one block.
|
||||
*/
|
||||
STATIC int xfs_attr_leaf_get(xfs_da_args_t *args);
|
||||
STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args);
|
||||
STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args);
|
||||
STATIC int xfs_attr_leaf_list(xfs_attr_list_context_t *context);
|
||||
|
|
@ -90,6 +96,7 @@ STATIC int xfs_attr_leaf_list(xfs_attr_list_context_t *context);
|
|||
/*
|
||||
* Internal routines when attribute list is more than one block.
|
||||
*/
|
||||
STATIC int xfs_attr_node_get(xfs_da_args_t *args);
|
||||
STATIC int xfs_attr_node_addname(xfs_da_args_t *args);
|
||||
STATIC int xfs_attr_node_removename(xfs_da_args_t *args);
|
||||
STATIC int xfs_attr_node_list(xfs_attr_list_context_t *context);
|
||||
|
|
@ -1102,7 +1109,7 @@ xfs_attr_leaf_removename(xfs_da_args_t *args)
|
|||
* This leaf block cannot have a "remote" value, we only call this routine
|
||||
* if bmap_one_block() says there is only one block (ie: no remote blks).
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_leaf_get(xfs_da_args_t *args)
|
||||
{
|
||||
xfs_dabuf_t *bp;
|
||||
|
|
@ -1707,7 +1714,7 @@ xfs_attr_refillstate(xfs_da_state_t *state)
|
|||
* block, ie: both true Btree attr lists and for single-leaf-blocks with
|
||||
* "remote" values taking up more blocks.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_node_get(xfs_da_args_t *args)
|
||||
{
|
||||
xfs_da_state_t *state;
|
||||
|
|
@ -2398,7 +2405,7 @@ posix_acl_default_exists(
|
|||
return xfs_acl_vhasacl_default(vp);
|
||||
}
|
||||
|
||||
struct attrnames posix_acl_access = {
|
||||
STATIC struct attrnames posix_acl_access = {
|
||||
.attr_name = "posix_acl_access",
|
||||
.attr_namelen = sizeof("posix_acl_access") - 1,
|
||||
.attr_get = posix_acl_access_get,
|
||||
|
|
@ -2407,7 +2414,7 @@ struct attrnames posix_acl_access = {
|
|||
.attr_exists = posix_acl_access_exists,
|
||||
};
|
||||
|
||||
struct attrnames posix_acl_default = {
|
||||
STATIC struct attrnames posix_acl_default = {
|
||||
.attr_name = "posix_acl_default",
|
||||
.attr_namelen = sizeof("posix_acl_default") - 1,
|
||||
.attr_get = posix_acl_default_get,
|
||||
|
|
@ -2416,7 +2423,7 @@ struct attrnames posix_acl_default = {
|
|||
.attr_exists = posix_acl_default_exists,
|
||||
};
|
||||
|
||||
struct attrnames *attr_system_names[] =
|
||||
STATIC struct attrnames *attr_system_names[] =
|
||||
{ &posix_acl_access, &posix_acl_default };
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -76,11 +76,6 @@ extern struct attrnames attr_system;
|
|||
extern struct attrnames attr_trusted;
|
||||
extern struct attrnames *attr_namespaces[ATTR_NAMECOUNT];
|
||||
|
||||
#define ATTR_SYSCOUNT 2
|
||||
extern struct attrnames posix_acl_access;
|
||||
extern struct attrnames posix_acl_default;
|
||||
extern struct attrnames *attr_system_names[ATTR_SYSCOUNT];
|
||||
|
||||
extern attrnames_t *attr_lookup_namespace(char *, attrnames_t **, int);
|
||||
extern int attr_generic_list(struct vnode *, void *, size_t, int, ssize_t *);
|
||||
|
||||
|
|
@ -184,8 +179,6 @@ int xfs_attr_list(bhv_desc_t *, char *, int, int,
|
|||
struct attrlist_cursor_kern *, struct cred *);
|
||||
int xfs_attr_inactive(struct xfs_inode *dp);
|
||||
|
||||
int xfs_attr_node_get(struct xfs_da_args *);
|
||||
int xfs_attr_leaf_get(struct xfs_da_args *);
|
||||
int xfs_attr_shortform_getvalue(struct xfs_da_args *);
|
||||
int xfs_attr_fetch(struct xfs_inode *, char *, int,
|
||||
char *, int *, int, struct cred *);
|
||||
|
|
|
|||
|
|
@ -79,6 +79,8 @@
|
|||
/*
|
||||
* Routines used for growing the Btree.
|
||||
*/
|
||||
STATIC int xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t which_block,
|
||||
xfs_dabuf_t **bpp);
|
||||
STATIC int xfs_attr_leaf_add_work(xfs_dabuf_t *leaf_buffer, xfs_da_args_t *args,
|
||||
int freemap_index);
|
||||
STATIC void xfs_attr_leaf_compact(xfs_trans_t *trans, xfs_dabuf_t *leaf_buffer);
|
||||
|
|
@ -91,6 +93,16 @@ STATIC int xfs_attr_leaf_figure_balance(xfs_da_state_t *state,
|
|||
int *number_entries_in_blk1,
|
||||
int *number_usedbytes_in_blk1);
|
||||
|
||||
/*
|
||||
* Routines used for shrinking the Btree.
|
||||
*/
|
||||
STATIC int xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
|
||||
xfs_dabuf_t *bp, int level);
|
||||
STATIC int xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
|
||||
xfs_dabuf_t *bp);
|
||||
STATIC int xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
|
||||
xfs_dablk_t blkno, int blkcnt);
|
||||
|
||||
/*
|
||||
* Utility routines.
|
||||
*/
|
||||
|
|
@ -99,6 +111,10 @@ STATIC void xfs_attr_leaf_moveents(xfs_attr_leafblock_t *src_leaf,
|
|||
xfs_attr_leafblock_t *dst_leaf,
|
||||
int dst_start, int move_count,
|
||||
xfs_mount_t *mp);
|
||||
STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
|
||||
STATIC int xfs_attr_put_listent(xfs_attr_list_context_t *context,
|
||||
attrnames_t *, char *name, int namelen,
|
||||
int valuelen);
|
||||
|
||||
|
||||
/*========================================================================
|
||||
|
|
@ -774,7 +790,7 @@ out:
|
|||
* Create the initial contents of a leaf attribute list
|
||||
* or a leaf in a node attribute list.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t blkno, xfs_dabuf_t **bpp)
|
||||
{
|
||||
xfs_attr_leafblock_t *leaf;
|
||||
|
|
@ -2209,7 +2225,7 @@ xfs_attr_leaf_lasthash(xfs_dabuf_t *bp, int *count)
|
|||
* Calculate the number of bytes used to store the indicated attribute
|
||||
* (whether local or remote only calculate bytes in this block).
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
|
||||
{
|
||||
xfs_attr_leaf_name_local_t *name_loc;
|
||||
|
|
@ -2380,7 +2396,7 @@ xfs_attr_leaf_list_int(xfs_dabuf_t *bp, xfs_attr_list_context_t *context)
|
|||
* we may be reading them directly out of a user buffer.
|
||||
*/
|
||||
/*ARGSUSED*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_put_listent(xfs_attr_list_context_t *context,
|
||||
attrnames_t *namesp, char *name, int namelen, int valuelen)
|
||||
{
|
||||
|
|
@ -2740,7 +2756,7 @@ xfs_attr_root_inactive(xfs_trans_t **trans, xfs_inode_t *dp)
|
|||
* Recurse (gasp!) through the attribute nodes until we find leaves.
|
||||
* We're doing a depth-first traversal in order to invalidate everything.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp,
|
||||
int level)
|
||||
{
|
||||
|
|
@ -2849,7 +2865,7 @@ xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp,
|
|||
* Note that we must release the lock on the buffer so that we are not
|
||||
* caught holding something that the logging code wants to flush to disk.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp)
|
||||
{
|
||||
xfs_attr_leafblock_t *leaf;
|
||||
|
|
@ -2934,7 +2950,7 @@ xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp)
|
|||
* Look at all the extents for this logical region,
|
||||
* invalidate any buffers that are incore/in transactions.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
|
||||
xfs_dablk_t blkno, int blkcnt)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -261,8 +261,6 @@ int xfs_attr_leaf_flipflags(xfs_da_args_t *args);
|
|||
/*
|
||||
* Routines used for growing the Btree.
|
||||
*/
|
||||
int xfs_attr_leaf_create(struct xfs_da_args *args, xfs_dablk_t which_block,
|
||||
struct xfs_dabuf **bpp);
|
||||
int xfs_attr_leaf_split(struct xfs_da_state *state,
|
||||
struct xfs_da_state_blk *oldblk,
|
||||
struct xfs_da_state_blk *newblk);
|
||||
|
|
@ -284,12 +282,6 @@ void xfs_attr_leaf_unbalance(struct xfs_da_state *state,
|
|||
struct xfs_da_state_blk *drop_blk,
|
||||
struct xfs_da_state_blk *save_blk);
|
||||
int xfs_attr_root_inactive(struct xfs_trans **trans, struct xfs_inode *dp);
|
||||
int xfs_attr_node_inactive(struct xfs_trans **trans, struct xfs_inode *dp,
|
||||
struct xfs_dabuf *bp, int level);
|
||||
int xfs_attr_leaf_inactive(struct xfs_trans **trans, struct xfs_inode *dp,
|
||||
struct xfs_dabuf *bp);
|
||||
int xfs_attr_leaf_freextent(struct xfs_trans **trans, struct xfs_inode *dp,
|
||||
xfs_dablk_t blkno, int blkcnt);
|
||||
|
||||
/*
|
||||
* Utility routines.
|
||||
|
|
@ -299,10 +291,6 @@ int xfs_attr_leaf_order(struct xfs_dabuf *leaf1_bp,
|
|||
struct xfs_dabuf *leaf2_bp);
|
||||
int xfs_attr_leaf_newentsize(struct xfs_da_args *args, int blocksize,
|
||||
int *local);
|
||||
int xfs_attr_leaf_entsize(struct xfs_attr_leafblock *leaf, int index);
|
||||
int xfs_attr_put_listent(struct xfs_attr_list_context *context,
|
||||
struct attrnames *, char *name, int namelen,
|
||||
int valuelen);
|
||||
int xfs_attr_rolltrans(struct xfs_trans **transp, struct xfs_inode *dp);
|
||||
|
||||
#endif /* __XFS_ATTR_LEAF_H__ */
|
||||
|
|
|
|||
|
|
@ -45,7 +45,7 @@
|
|||
/*
|
||||
* Index of high bit number in byte, -1 for none set, 0..7 otherwise.
|
||||
*/
|
||||
const char xfs_highbit[256] = {
|
||||
STATIC const char xfs_highbit[256] = {
|
||||
-1, 0, 1, 1, 2, 2, 2, 2, /* 00 .. 07 */
|
||||
3, 3, 3, 3, 3, 3, 3, 3, /* 08 .. 0f */
|
||||
4, 4, 4, 4, 4, 4, 4, 4, /* 10 .. 17 */
|
||||
|
|
|
|||
|
|
@ -301,6 +301,19 @@ xfs_bmap_search_extents(
|
|||
xfs_bmbt_irec_t *gotp, /* out: extent entry found */
|
||||
xfs_bmbt_irec_t *prevp); /* out: previous extent entry found */
|
||||
|
||||
/*
|
||||
* Check the last inode extent to determine whether this allocation will result
|
||||
* in blocks being allocated at the end of the file. When we allocate new data
|
||||
* blocks at the end of the file which do not start at the previous data block,
|
||||
* we will try to align the new blocks at stripe unit boundaries.
|
||||
*/
|
||||
STATIC int /* error */
|
||||
xfs_bmap_isaeof(
|
||||
xfs_inode_t *ip, /* incore inode pointer */
|
||||
xfs_fileoff_t off, /* file offset in fsblocks */
|
||||
int whichfork, /* data or attribute fork */
|
||||
char *aeof); /* return value */
|
||||
|
||||
#ifdef XFS_BMAP_TRACE
|
||||
/*
|
||||
* Add a bmap trace buffer entry. Base routine for the others.
|
||||
|
|
@ -5714,7 +5727,7 @@ unlock_and_return:
|
|||
* blocks at the end of the file which do not start at the previous data block,
|
||||
* we will try to align the new blocks at stripe unit boundaries.
|
||||
*/
|
||||
int /* error */
|
||||
STATIC int /* error */
|
||||
xfs_bmap_isaeof(
|
||||
xfs_inode_t *ip, /* incore inode pointer */
|
||||
xfs_fileoff_t off, /* file offset in fsblocks */
|
||||
|
|
|
|||
|
|
@ -331,19 +331,6 @@ xfs_getbmap(
|
|||
void __user *ap, /* pointer to user's array */
|
||||
int iflags); /* interface flags */
|
||||
|
||||
/*
|
||||
* Check the last inode extent to determine whether this allocation will result
|
||||
* in blocks being allocated at the end of the file. When we allocate new data
|
||||
* blocks at the end of the file which do not start at the previous data block,
|
||||
* we will try to align the new blocks at stripe unit boundaries.
|
||||
*/
|
||||
int
|
||||
xfs_bmap_isaeof(
|
||||
struct xfs_inode *ip,
|
||||
xfs_fileoff_t off,
|
||||
int whichfork,
|
||||
char *aeof);
|
||||
|
||||
/*
|
||||
* Check if the endoff is outside the last extent. If so the caller will grow
|
||||
* the allocation to a stripe unit boundary
|
||||
|
|
|
|||
|
|
@ -89,6 +89,16 @@ xfs_btree_maxrecs(
|
|||
* Internal routines.
|
||||
*/
|
||||
|
||||
/*
|
||||
* Retrieve the block pointer from the cursor at the given level.
|
||||
* This may be a bmap btree root or from a buffer.
|
||||
*/
|
||||
xfs_btree_block_t * /* generic btree block pointer */
|
||||
xfs_btree_get_block(
|
||||
xfs_btree_cur_t *cur, /* btree cursor */
|
||||
int level, /* level in btree */
|
||||
struct xfs_buf **bpp); /* buffer containing the block */
|
||||
|
||||
/*
|
||||
* Checking routine: return maxrecs for the block.
|
||||
*/
|
||||
|
|
@ -497,7 +507,7 @@ xfs_btree_firstrec(
|
|||
* Retrieve the block pointer from the cursor at the given level.
|
||||
* This may be a bmap btree root or from a buffer.
|
||||
*/
|
||||
xfs_btree_block_t * /* generic btree block pointer */
|
||||
STATIC xfs_btree_block_t * /* generic btree block pointer */
|
||||
xfs_btree_get_block(
|
||||
xfs_btree_cur_t *cur, /* btree cursor */
|
||||
int level, /* level in btree */
|
||||
|
|
|
|||
|
|
@ -324,16 +324,6 @@ xfs_btree_firstrec(
|
|||
xfs_btree_cur_t *cur, /* btree cursor */
|
||||
int level); /* level to change */
|
||||
|
||||
/*
|
||||
* Retrieve the block pointer from the cursor at the given level.
|
||||
* This may be a bmap btree root or from a buffer.
|
||||
*/
|
||||
xfs_btree_block_t * /* generic btree block pointer */
|
||||
xfs_btree_get_block(
|
||||
xfs_btree_cur_t *cur, /* btree cursor */
|
||||
int level, /* level in btree */
|
||||
struct xfs_buf **bpp); /* buffer containing the block */
|
||||
|
||||
/*
|
||||
* Get a buffer for the block, return it with no data read.
|
||||
* Long-form addressing.
|
||||
|
|
|
|||
|
|
@ -172,7 +172,7 @@ STATIC void xfs_buf_do_callbacks(xfs_buf_t *bp, xfs_log_item_t *lip);
|
|||
*
|
||||
* If the XFS_BLI_STALE flag has been set, then log nothing.
|
||||
*/
|
||||
uint
|
||||
STATIC uint
|
||||
xfs_buf_item_size(
|
||||
xfs_buf_log_item_t *bip)
|
||||
{
|
||||
|
|
@ -240,7 +240,7 @@ xfs_buf_item_size(
|
|||
* format structure, and the rest point to contiguous chunks
|
||||
* within the buffer.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_format(
|
||||
xfs_buf_log_item_t *bip,
|
||||
xfs_log_iovec_t *log_vector)
|
||||
|
|
@ -365,7 +365,7 @@ xfs_buf_item_format(
|
|||
* item in memory so it cannot be written out. Simply call bpin()
|
||||
* on the buffer to do this.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_pin(
|
||||
xfs_buf_log_item_t *bip)
|
||||
{
|
||||
|
|
@ -391,7 +391,7 @@ xfs_buf_item_pin(
|
|||
* If the XFS_BLI_STALE flag is set and we are the last reference,
|
||||
* then free up the buf log item and unlock the buffer.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_unpin(
|
||||
xfs_buf_log_item_t *bip,
|
||||
int stale)
|
||||
|
|
@ -446,7 +446,7 @@ xfs_buf_item_unpin(
|
|||
* so we need to free the item's descriptor (that points to the item)
|
||||
* in the transaction.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_unpin_remove(
|
||||
xfs_buf_log_item_t *bip,
|
||||
xfs_trans_t *tp)
|
||||
|
|
@ -493,7 +493,7 @@ xfs_buf_item_unpin_remove(
|
|||
* the lock right away, return 0. If we can get the lock, pull the
|
||||
* buffer from the free list, mark it busy, and return 1.
|
||||
*/
|
||||
uint
|
||||
STATIC uint
|
||||
xfs_buf_item_trylock(
|
||||
xfs_buf_log_item_t *bip)
|
||||
{
|
||||
|
|
@ -537,7 +537,7 @@ xfs_buf_item_trylock(
|
|||
* This is for support of xfs_trans_bhold(). Make sure the
|
||||
* XFS_BLI_HOLD field is cleared if we don't free the item.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_unlock(
|
||||
xfs_buf_log_item_t *bip)
|
||||
{
|
||||
|
|
@ -635,7 +635,7 @@ xfs_buf_item_unlock(
|
|||
* by returning the original lsn of that transaction here rather than
|
||||
* the current one.
|
||||
*/
|
||||
xfs_lsn_t
|
||||
STATIC xfs_lsn_t
|
||||
xfs_buf_item_committed(
|
||||
xfs_buf_log_item_t *bip,
|
||||
xfs_lsn_t lsn)
|
||||
|
|
@ -654,7 +654,7 @@ xfs_buf_item_committed(
|
|||
* and have aborted this transaction, we'll trap this buffer when it tries to
|
||||
* get written out.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_abort(
|
||||
xfs_buf_log_item_t *bip)
|
||||
{
|
||||
|
|
@ -674,7 +674,7 @@ xfs_buf_item_abort(
|
|||
* B_DELWRI set, then get it going out to disk with a call to bawrite().
|
||||
* If not, then just release the buffer.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_push(
|
||||
xfs_buf_log_item_t *bip)
|
||||
{
|
||||
|
|
@ -693,7 +693,7 @@ xfs_buf_item_push(
|
|||
}
|
||||
|
||||
/* ARGSUSED */
|
||||
void
|
||||
STATIC void
|
||||
xfs_buf_item_committing(xfs_buf_log_item_t *bip, xfs_lsn_t commit_lsn)
|
||||
{
|
||||
}
|
||||
|
|
@ -701,7 +701,7 @@ xfs_buf_item_committing(xfs_buf_log_item_t *bip, xfs_lsn_t commit_lsn)
|
|||
/*
|
||||
* This is the ops vector shared by all buf log items.
|
||||
*/
|
||||
struct xfs_item_ops xfs_buf_item_ops = {
|
||||
STATIC struct xfs_item_ops xfs_buf_item_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_buf_item_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_buf_item_format,
|
||||
|
|
|
|||
|
|
@ -113,7 +113,10 @@ STATIC void xfs_da_node_unbalance(xfs_da_state_t *state,
|
|||
STATIC uint xfs_da_node_lasthash(xfs_dabuf_t *bp, int *count);
|
||||
STATIC int xfs_da_node_order(xfs_dabuf_t *node1_bp, xfs_dabuf_t *node2_bp);
|
||||
STATIC xfs_dabuf_t *xfs_da_buf_make(int nbuf, xfs_buf_t **bps, inst_t *ra);
|
||||
|
||||
STATIC int xfs_da_blk_unlink(xfs_da_state_t *state,
|
||||
xfs_da_state_blk_t *drop_blk,
|
||||
xfs_da_state_blk_t *save_blk);
|
||||
STATIC void xfs_da_state_kill_altpath(xfs_da_state_t *state);
|
||||
|
||||
/*========================================================================
|
||||
* Routines used for growing the Btree.
|
||||
|
|
@ -1424,7 +1427,7 @@ xfs_da_node_lasthash(xfs_dabuf_t *bp, int *count)
|
|||
/*
|
||||
* Unlink a block from a doubly linked list of blocks.
|
||||
*/
|
||||
int /* error */
|
||||
STATIC int /* error */
|
||||
xfs_da_blk_unlink(xfs_da_state_t *state, xfs_da_state_blk_t *drop_blk,
|
||||
xfs_da_state_blk_t *save_blk)
|
||||
{
|
||||
|
|
@ -2381,7 +2384,7 @@ xfs_da_state_alloc(void)
|
|||
/*
|
||||
* Kill the altpath contents of a da-state structure.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_da_state_kill_altpath(xfs_da_state_t *state)
|
||||
{
|
||||
int i;
|
||||
|
|
|
|||
|
|
@ -296,8 +296,6 @@ int xfs_da_path_shift(xfs_da_state_t *state, xfs_da_state_path_t *path,
|
|||
/*
|
||||
* Utility routines.
|
||||
*/
|
||||
int xfs_da_blk_unlink(xfs_da_state_t *state, xfs_da_state_blk_t *drop_blk,
|
||||
xfs_da_state_blk_t *save_blk);
|
||||
int xfs_da_blk_link(xfs_da_state_t *state, xfs_da_state_blk_t *old_blk,
|
||||
xfs_da_state_blk_t *new_blk);
|
||||
|
||||
|
|
@ -320,7 +318,6 @@ uint xfs_da_hashname(uchar_t *name_string, int name_length);
|
|||
uint xfs_da_log2_roundup(uint i);
|
||||
xfs_da_state_t *xfs_da_state_alloc(void);
|
||||
void xfs_da_state_free(xfs_da_state_t *state);
|
||||
void xfs_da_state_kill_altpath(xfs_da_state_t *state);
|
||||
|
||||
void xfs_da_buf_done(xfs_dabuf_t *dabuf);
|
||||
void xfs_da_log_buf(struct xfs_trans *tp, xfs_dabuf_t *dabuf, uint first,
|
||||
|
|
|
|||
|
|
@ -304,7 +304,7 @@ xfs_dir2_data_freeinsert(
|
|||
/*
|
||||
* Remove a bestfree entry from the table.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_dir2_data_freeremove(
|
||||
xfs_dir2_data_t *d, /* data block pointer */
|
||||
xfs_dir2_data_free_t *dfp, /* bestfree entry pointer */
|
||||
|
|
|
|||
|
|
@ -192,10 +192,6 @@ extern xfs_dir2_data_free_t *
|
|||
xfs_dir2_data_freeinsert(xfs_dir2_data_t *d,
|
||||
xfs_dir2_data_unused_t *dup, int *loghead);
|
||||
|
||||
extern void
|
||||
xfs_dir2_data_freeremove(xfs_dir2_data_t *d,
|
||||
xfs_dir2_data_free_t *dfp, int *loghead);
|
||||
|
||||
extern void
|
||||
xfs_dir2_data_freescan(struct xfs_mount *mp, xfs_dir2_data_t *d,
|
||||
int *loghead, char *aendp);
|
||||
|
|
|
|||
|
|
@ -77,6 +77,10 @@ static void xfs_dir2_leaf_check(xfs_inode_t *dp, xfs_dabuf_t *bp);
|
|||
#endif
|
||||
static int xfs_dir2_leaf_lookup_int(xfs_da_args_t *args, xfs_dabuf_t **lbpp,
|
||||
int *indexp, xfs_dabuf_t **dbpp);
|
||||
static void xfs_dir2_leaf_log_bests(struct xfs_trans *tp, struct xfs_dabuf *bp,
|
||||
int first, int last);
|
||||
extern void xfs_dir2_leaf_log_tail(struct xfs_trans *tp, struct xfs_dabuf *bp);
|
||||
|
||||
|
||||
/*
|
||||
* Convert a block form directory to a leaf form directory.
|
||||
|
|
@ -1214,7 +1218,7 @@ xfs_dir2_leaf_init(
|
|||
/*
|
||||
* Log the bests entries indicated from a leaf1 block.
|
||||
*/
|
||||
void
|
||||
static void
|
||||
xfs_dir2_leaf_log_bests(
|
||||
xfs_trans_t *tp, /* transaction pointer */
|
||||
xfs_dabuf_t *bp, /* leaf buffer */
|
||||
|
|
@ -1278,7 +1282,7 @@ xfs_dir2_leaf_log_header(
|
|||
/*
|
||||
* Log the tail of the leaf1 block.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_dir2_leaf_log_tail(
|
||||
xfs_trans_t *tp, /* transaction pointer */
|
||||
xfs_dabuf_t *bp) /* leaf buffer */
|
||||
|
|
|
|||
|
|
@ -329,16 +329,9 @@ extern void
|
|||
xfs_dir2_leaf_log_ents(struct xfs_trans *tp, struct xfs_dabuf *bp,
|
||||
int first, int last);
|
||||
|
||||
extern void
|
||||
xfs_dir2_leaf_log_bests(struct xfs_trans *tp, struct xfs_dabuf *bp,
|
||||
int first, int last);
|
||||
|
||||
extern void
|
||||
xfs_dir2_leaf_log_header(struct xfs_trans *tp, struct xfs_dabuf *bp);
|
||||
|
||||
extern void
|
||||
xfs_dir2_leaf_log_tail(struct xfs_trans *tp, struct xfs_dabuf *bp);
|
||||
|
||||
extern int
|
||||
xfs_dir2_leaf_lookup(struct xfs_da_args *args);
|
||||
|
||||
|
|
|
|||
|
|
@ -91,6 +91,10 @@ STATIC int xfs_dir_leaf_figure_balance(xfs_da_state_t *state,
|
|||
int *number_entries_in_blk1,
|
||||
int *number_namebytes_in_blk1);
|
||||
|
||||
STATIC int xfs_dir_leaf_create(struct xfs_da_args *args,
|
||||
xfs_dablk_t which_block,
|
||||
struct xfs_dabuf **bpp);
|
||||
|
||||
/*
|
||||
* Utility routines.
|
||||
*/
|
||||
|
|
@ -781,7 +785,7 @@ xfs_dir_leaf_to_node(xfs_da_args_t *args)
|
|||
* Create the initial contents of a leaf directory
|
||||
* or a leaf in a node directory.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_dir_leaf_create(xfs_da_args_t *args, xfs_dablk_t blkno, xfs_dabuf_t **bpp)
|
||||
{
|
||||
xfs_dir_leafblock_t *leaf;
|
||||
|
|
|
|||
|
|
@ -202,8 +202,6 @@ int xfs_dir_leaf_to_shortform(struct xfs_da_args *args);
|
|||
/*
|
||||
* Routines used for growing the Btree.
|
||||
*/
|
||||
int xfs_dir_leaf_create(struct xfs_da_args *args, xfs_dablk_t which_block,
|
||||
struct xfs_dabuf **bpp);
|
||||
int xfs_dir_leaf_split(struct xfs_da_state *state,
|
||||
struct xfs_da_state_blk *oldblk,
|
||||
struct xfs_da_state_blk *newblk);
|
||||
|
|
|
|||
|
|
@ -280,7 +280,7 @@ xfs_error_report(
|
|||
}
|
||||
}
|
||||
|
||||
void
|
||||
STATIC void
|
||||
xfs_hex_dump(void *p, int length)
|
||||
{
|
||||
__uint8_t *uip = (__uint8_t*)p;
|
||||
|
|
|
|||
|
|
@ -73,9 +73,6 @@ xfs_corruption_error(
|
|||
int linenum,
|
||||
inst_t *ra);
|
||||
|
||||
extern void
|
||||
xfs_hex_dump(void *p, int length);
|
||||
|
||||
#define XFS_ERROR_REPORT(e, lvl, mp) \
|
||||
xfs_error_report(e, lvl, mp, __FILE__, __LINE__, __return_address)
|
||||
#define XFS_CORRUPTION_ERROR(e, lvl, mp, mem) \
|
||||
|
|
|
|||
|
|
@ -288,7 +288,7 @@ xfs_efi_item_committing(xfs_efi_log_item_t *efip, xfs_lsn_t lsn)
|
|||
/*
|
||||
* This is the ops vector shared by all efi log items.
|
||||
*/
|
||||
struct xfs_item_ops xfs_efi_item_ops = {
|
||||
STATIC struct xfs_item_ops xfs_efi_item_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_efi_item_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_efi_item_format,
|
||||
|
|
@ -615,7 +615,7 @@ xfs_efd_item_committing(xfs_efd_log_item_t *efip, xfs_lsn_t lsn)
|
|||
/*
|
||||
* This is the ops vector shared by all efd log items.
|
||||
*/
|
||||
struct xfs_item_ops xfs_efd_item_ops = {
|
||||
STATIC struct xfs_item_ops xfs_efd_item_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_efd_item_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_efd_item_format,
|
||||
|
|
|
|||
|
|
@ -158,7 +158,7 @@ xfs_inobp_check(
|
|||
* Use xfs_imap() to determine the size and location of the
|
||||
* buffer to read from disk.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_inotobp(
|
||||
xfs_mount_t *mp,
|
||||
xfs_trans_t *tp,
|
||||
|
|
@ -2111,7 +2111,7 @@ static __inline__ int xfs_inode_clean(xfs_inode_t *ip)
|
|||
(ip->i_update_core == 0));
|
||||
}
|
||||
|
||||
void
|
||||
STATIC void
|
||||
xfs_ifree_cluster(
|
||||
xfs_inode_t *free_ip,
|
||||
xfs_trans_t *tp,
|
||||
|
|
@ -2830,7 +2830,7 @@ xfs_iunpin(
|
|||
* be subsequently pinned once someone is waiting for it to be
|
||||
* unpinned.
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_iunpin_wait(
|
||||
xfs_inode_t *ip)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -487,8 +487,6 @@ int xfs_finish_reclaim_all(struct xfs_mount *, int);
|
|||
/*
|
||||
* xfs_inode.c prototypes.
|
||||
*/
|
||||
int xfs_inotobp(struct xfs_mount *, struct xfs_trans *, xfs_ino_t,
|
||||
xfs_dinode_t **, struct xfs_buf **, int *);
|
||||
int xfs_itobp(struct xfs_mount *, struct xfs_trans *,
|
||||
xfs_inode_t *, xfs_dinode_t **, struct xfs_buf **,
|
||||
xfs_daddr_t);
|
||||
|
|
|
|||
|
|
@ -910,7 +910,7 @@ xfs_inode_item_committing(
|
|||
/*
|
||||
* This is the ops vector shared by all buf log items.
|
||||
*/
|
||||
struct xfs_item_ops xfs_inode_item_ops = {
|
||||
STATIC struct xfs_item_ops xfs_inode_item_ops = {
|
||||
.iop_size = (uint(*)(xfs_log_item_t*))xfs_inode_item_size,
|
||||
.iop_format = (void(*)(xfs_log_item_t*, xfs_log_iovec_t*))
|
||||
xfs_inode_item_format,
|
||||
|
|
|
|||
|
|
@ -134,7 +134,7 @@ STATIC void xlog_verify_tail_lsn(xlog_t *log, xlog_in_core_t *iclog,
|
|||
#define xlog_verify_tail_lsn(a,b,c)
|
||||
#endif
|
||||
|
||||
int xlog_iclogs_empty(xlog_t *log);
|
||||
STATIC int xlog_iclogs_empty(xlog_t *log);
|
||||
|
||||
#ifdef DEBUG
|
||||
int xlog_do_error = 0;
|
||||
|
|
@ -1857,7 +1857,7 @@ xlog_write(xfs_mount_t * mp,
|
|||
*
|
||||
* State Change: DIRTY -> ACTIVE
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xlog_state_clean_log(xlog_t *log)
|
||||
{
|
||||
xlog_in_core_t *iclog;
|
||||
|
|
@ -3542,7 +3542,7 @@ xfs_log_force_umount(
|
|||
return (retval);
|
||||
}
|
||||
|
||||
int
|
||||
STATIC int
|
||||
xlog_iclogs_empty(xlog_t *log)
|
||||
{
|
||||
xlog_in_core_t *iclog;
|
||||
|
|
|
|||
|
|
@ -535,7 +535,6 @@ typedef struct log {
|
|||
|
||||
/* common routines */
|
||||
extern xfs_lsn_t xlog_assign_tail_lsn(struct xfs_mount *mp);
|
||||
extern int xlog_find_head(xlog_t *log, xfs_daddr_t *head_blk);
|
||||
extern int xlog_find_tail(xlog_t *log,
|
||||
xfs_daddr_t *head_blk,
|
||||
xfs_daddr_t *tail_blk,
|
||||
|
|
@ -548,7 +547,6 @@ extern void xlog_recover_process_iunlinks(xlog_t *log);
|
|||
extern struct xfs_buf *xlog_get_bp(xlog_t *, int);
|
||||
extern void xlog_put_bp(struct xfs_buf *);
|
||||
extern int xlog_bread(xlog_t *, xfs_daddr_t, int, struct xfs_buf *);
|
||||
extern xfs_caddr_t xlog_align(xlog_t *, xfs_daddr_t, int, struct xfs_buf *);
|
||||
|
||||
/* iclog tracing */
|
||||
#define XLOG_TRACE_GRAB_FLUSH 1
|
||||
|
|
|
|||
|
|
@ -148,7 +148,7 @@ xlog_bread(
|
|||
* The buffer is kept locked across the write and is returned locked.
|
||||
* This can only be used for synchronous log writes.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xlog_bwrite(
|
||||
xlog_t *log,
|
||||
xfs_daddr_t blk_no,
|
||||
|
|
@ -179,7 +179,7 @@ xlog_bwrite(
|
|||
return error;
|
||||
}
|
||||
|
||||
xfs_caddr_t
|
||||
STATIC xfs_caddr_t
|
||||
xlog_align(
|
||||
xlog_t *log,
|
||||
xfs_daddr_t blk_no,
|
||||
|
|
@ -528,7 +528,7 @@ out:
|
|||
*
|
||||
* Return: zero if normal, non-zero if error.
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xlog_find_head(
|
||||
xlog_t *log,
|
||||
xfs_daddr_t *return_head_blk)
|
||||
|
|
|
|||
|
|
@ -64,6 +64,7 @@
|
|||
STATIC void xfs_mount_log_sbunit(xfs_mount_t *, __int64_t);
|
||||
STATIC int xfs_uuid_mount(xfs_mount_t *);
|
||||
STATIC void xfs_uuid_unmount(xfs_mount_t *mp);
|
||||
STATIC void xfs_unmountfs_wait(xfs_mount_t *);
|
||||
|
||||
static struct {
|
||||
short offset;
|
||||
|
|
@ -555,7 +556,7 @@ xfs_readsb(xfs_mount_t *mp)
|
|||
* fields from the superblock associated with the given
|
||||
* mount structure
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_mount_common(xfs_mount_t *mp, xfs_sb_t *sbp)
|
||||
{
|
||||
int i;
|
||||
|
|
@ -1146,7 +1147,7 @@ xfs_unmountfs_close(xfs_mount_t *mp, struct cred *cr)
|
|||
xfs_free_buftarg(mp->m_ddev_targp, 0);
|
||||
}
|
||||
|
||||
void
|
||||
STATIC void
|
||||
xfs_unmountfs_wait(xfs_mount_t *mp)
|
||||
{
|
||||
if (mp->m_logdev_targp != mp->m_ddev_targp)
|
||||
|
|
|
|||
|
|
@ -544,7 +544,6 @@ extern void xfs_mount_free(xfs_mount_t *mp, int remove_bhv);
|
|||
extern int xfs_mountfs(struct vfs *, xfs_mount_t *mp, int);
|
||||
|
||||
extern int xfs_unmountfs(xfs_mount_t *, struct cred *);
|
||||
extern void xfs_unmountfs_wait(xfs_mount_t *);
|
||||
extern void xfs_unmountfs_close(xfs_mount_t *, struct cred *);
|
||||
extern int xfs_unmountfs_writesb(xfs_mount_t *);
|
||||
extern int xfs_unmount_flush(xfs_mount_t *, int);
|
||||
|
|
|
|||
|
|
@ -532,7 +532,7 @@ xfs_trans_apply_sb_deltas(
|
|||
*
|
||||
* This is done efficiently with a single call to xfs_mod_incore_sb_batch().
|
||||
*/
|
||||
void
|
||||
STATIC void
|
||||
xfs_trans_unreserve_and_mod_sb(
|
||||
xfs_trans_t *tp)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -1681,7 +1681,7 @@ suffix_strtoul(const char *cp, char **endp, unsigned int base)
|
|||
return simple_strtoul(cp, endp, base) << shift_left_factor;
|
||||
}
|
||||
|
||||
int
|
||||
STATIC int
|
||||
xfs_parseargs(
|
||||
struct bhv_desc *bhv,
|
||||
char *options,
|
||||
|
|
@ -1867,7 +1867,7 @@ printk("XFS: irixsgid is now a sysctl(2) variable, option is deprecated.\n");
|
|||
return 0;
|
||||
}
|
||||
|
||||
int
|
||||
STATIC int
|
||||
xfs_showargs(
|
||||
struct bhv_desc *bhv,
|
||||
struct seq_file *m)
|
||||
|
|
|
|||
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2000-2004 Silicon Graphics, Inc. All Rights Reserved.
|
||||
* Copyright (c) 2000-2005 Silicon Graphics, Inc. All Rights Reserved.
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of version 2 of the GNU General Public License as
|
||||
|
|
@ -4028,7 +4028,7 @@ xfs_finish_reclaim_all(xfs_mount_t *mp, int noblock)
|
|||
* errno on error
|
||||
*
|
||||
*/
|
||||
int
|
||||
STATIC int
|
||||
xfs_alloc_file_space(
|
||||
xfs_inode_t *ip,
|
||||
xfs_off_t offset,
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче