xfs_fsops.c

来自「Linux Kernel 2.6.9 for OMAP1710」· C语言 代码 · 共 617 行 · 第 1/2 页

C
617
字号
/* * Copyright (c) 2000-2002 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 * 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. * * Further, this software is distributed without any warranty that it is * free of the rightful claim of any third person regarding infringement * or the like.  Any license provided herein, whether implied or * otherwise, applies only to this software file.  Patent licenses, if * any, provided herein do not apply to combinations of this program with * other software, or any other product whatsoever. * * You should have received a copy of the GNU General Public License along * with this program; if not, write the Free Software Foundation, Inc., 59 * Temple Place - Suite 330, Boston MA 02111-1307, USA. * * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, * Mountain View, CA  94043, or: * * http://www.sgi.com * * For further information regarding this notice, see: * * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/ */#include "xfs.h"#include "xfs_macros.h"#include "xfs_types.h"#include "xfs_inum.h"#include "xfs_log.h"#include "xfs_trans.h"#include "xfs_sb.h"#include "xfs_dir.h"#include "xfs_dmapi.h"#include "xfs_mount.h"#include "xfs_ag.h"#include "xfs_alloc_btree.h"#include "xfs_bmap_btree.h"#include "xfs_ialloc_btree.h"#include "xfs_btree.h"#include "xfs_error.h"#include "xfs_alloc.h"#include "xfs_ialloc.h"#include "xfs_fsops.h"#include "xfs_itable.h"#include "xfs_rw.h"#include "xfs_refcache.h"#include "xfs_trans_space.h"#include "xfs_rtalloc.h"#include "xfs_dir2.h"#include "xfs_attr_sf.h"#include "xfs_dir_sf.h"#include "xfs_dir2_sf.h"#include "xfs_dinode.h"#include "xfs_inode.h"#include "xfs_inode_item.h"/* * File system operations */intxfs_fs_geometry(	xfs_mount_t		*mp,	xfs_fsop_geom_t		*geo,	int			new_version){	geo->blocksize = mp->m_sb.sb_blocksize;	geo->rtextsize = mp->m_sb.sb_rextsize;	geo->agblocks = mp->m_sb.sb_agblocks;	geo->agcount = mp->m_sb.sb_agcount;	geo->logblocks = mp->m_sb.sb_logblocks;	geo->sectsize = mp->m_sb.sb_sectsize;	geo->inodesize = mp->m_sb.sb_inodesize;	geo->imaxpct = mp->m_sb.sb_imax_pct;	geo->datablocks = mp->m_sb.sb_dblocks;	geo->rtblocks = mp->m_sb.sb_rblocks;	geo->rtextents = mp->m_sb.sb_rextents;	geo->logstart = mp->m_sb.sb_logstart;	ASSERT(sizeof(geo->uuid)==sizeof(mp->m_sb.sb_uuid));	memcpy(geo->uuid, &mp->m_sb.sb_uuid, sizeof(mp->m_sb.sb_uuid));	if (new_version >= 2) {		geo->sunit = mp->m_sb.sb_unit;		geo->swidth = mp->m_sb.sb_width;	}	if (new_version >= 3) {		geo->version = XFS_FSOP_GEOM_VERSION;		geo->flags =			(XFS_SB_VERSION_HASATTR(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_ATTR : 0) |			(XFS_SB_VERSION_HASNLINK(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_NLINK : 0) |			(XFS_SB_VERSION_HASQUOTA(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_QUOTA : 0) |			(XFS_SB_VERSION_HASALIGN(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_IALIGN : 0) |			(XFS_SB_VERSION_HASDALIGN(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_DALIGN : 0) |			(XFS_SB_VERSION_HASSHARED(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_SHARED : 0) |			(XFS_SB_VERSION_HASEXTFLGBIT(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_EXTFLG : 0) |			(XFS_SB_VERSION_HASDIRV2(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_DIRV2 : 0) |			(XFS_SB_VERSION_HASSECTOR(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_SECTOR : 0);		geo->logsectsize = XFS_SB_VERSION_HASSECTOR(&mp->m_sb) ?				mp->m_sb.sb_logsectsize : BBSIZE;		geo->rtsectsize = mp->m_sb.sb_blocksize;		geo->dirblocksize = mp->m_dirblksize;	}	if (new_version >= 4) {		geo->flags |=			(XFS_SB_VERSION_HASLOGV2(&mp->m_sb) ?				XFS_FSOP_GEOM_FLAGS_LOGV2 : 0);		geo->logsunit = mp->m_sb.sb_logsunit;	}	return 0;}static intxfs_growfs_data_private(	xfs_mount_t		*mp,		/* mount point for filesystem */	xfs_growfs_data_t	*in)		/* growfs data input struct */{	xfs_agf_t		*agf;	xfs_agi_t		*agi;	xfs_agnumber_t		agno;	xfs_extlen_t		agsize;	xfs_extlen_t		tmpsize;	xfs_alloc_rec_t		*arec;	xfs_btree_sblock_t	*block;	xfs_buf_t		*bp;	int			bucket;	int			dpct;	int			error;	xfs_agnumber_t		nagcount;	xfs_agnumber_t		nagimax = 0;	xfs_rfsblock_t		nb, nb_mod;	xfs_rfsblock_t		new;	xfs_rfsblock_t		nfree;	xfs_agnumber_t		oagcount;	int			pct;	xfs_sb_t		*sbp;	xfs_trans_t		*tp;	nb = in->newblocks;	pct = in->imaxpct;	if (nb < mp->m_sb.sb_dblocks || pct < 0 || pct > 100)		return XFS_ERROR(EINVAL);	dpct = pct - mp->m_sb.sb_imax_pct;	error = xfs_read_buf(mp, mp->m_ddev_targp,			XFS_FSB_TO_BB(mp, nb) - XFS_FSS_TO_BB(mp, 1),			XFS_FSS_TO_BB(mp, 1), 0, &bp);	if (error)		return error;	ASSERT(bp);	xfs_buf_relse(bp);	new = nb;	/* use new as a temporary here */	nb_mod = do_div(new, mp->m_sb.sb_agblocks);	nagcount = new + (nb_mod != 0);	if (nb_mod && nb_mod < XFS_MIN_AG_BLOCKS) {		nagcount--;		nb = nagcount * mp->m_sb.sb_agblocks;		if (nb < mp->m_sb.sb_dblocks)			return XFS_ERROR(EINVAL);	}	new = nb - mp->m_sb.sb_dblocks;	oagcount = mp->m_sb.sb_agcount;	if (nagcount > oagcount) {		down_write(&mp->m_peraglock);		mp->m_perag = kmem_realloc(mp->m_perag,			sizeof(xfs_perag_t) * nagcount,			sizeof(xfs_perag_t) * oagcount,			KM_SLEEP);		memset(&mp->m_perag[oagcount], 0,			(nagcount - oagcount) * sizeof(xfs_perag_t));		mp->m_flags |= XFS_MOUNT_32BITINODES;		nagimax = xfs_initialize_perag(mp, nagcount);		up_write(&mp->m_peraglock);	}	tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFS);	if ((error = xfs_trans_reserve(tp, XFS_GROWFS_SPACE_RES(mp),			XFS_GROWDATA_LOG_RES(mp), 0, 0, 0))) {		xfs_trans_cancel(tp, 0);		return error;	}	nfree = 0;	for (agno = nagcount - 1; agno >= oagcount; agno--, new -= agsize) {		/*		 * AG freelist header block		 */		bp = xfs_buf_get(mp->m_ddev_targp,				  XFS_AG_DADDR(mp, agno, XFS_AGF_DADDR(mp)),				  XFS_FSS_TO_BB(mp, 1), 0);		agf = XFS_BUF_TO_AGF(bp);		memset(agf, 0, mp->m_sb.sb_sectsize);		INT_SET(agf->agf_magicnum, ARCH_CONVERT, XFS_AGF_MAGIC);		INT_SET(agf->agf_versionnum, ARCH_CONVERT, XFS_AGF_VERSION);		INT_SET(agf->agf_seqno, ARCH_CONVERT, agno);		if (agno == nagcount - 1)			agsize =				nb -				(agno * (xfs_rfsblock_t)mp->m_sb.sb_agblocks);		else			agsize = mp->m_sb.sb_agblocks;		INT_SET(agf->agf_length, ARCH_CONVERT, agsize);		INT_SET(agf->agf_roots[XFS_BTNUM_BNOi], ARCH_CONVERT,			XFS_BNO_BLOCK(mp));		INT_SET(agf->agf_roots[XFS_BTNUM_CNTi], ARCH_CONVERT,			XFS_CNT_BLOCK(mp));		INT_SET(agf->agf_levels[XFS_BTNUM_BNOi], ARCH_CONVERT, 1);		INT_SET(agf->agf_levels[XFS_BTNUM_CNTi], ARCH_CONVERT, 1);		INT_ZERO(agf->agf_flfirst, ARCH_CONVERT);		INT_SET(agf->agf_fllast, ARCH_CONVERT, XFS_AGFL_SIZE(mp) - 1);		INT_ZERO(agf->agf_flcount, ARCH_CONVERT);		tmpsize = agsize - XFS_PREALLOC_BLOCKS(mp);		INT_SET(agf->agf_freeblks, ARCH_CONVERT, tmpsize);		INT_SET(agf->agf_longest, ARCH_CONVERT, tmpsize);		error = xfs_bwrite(mp, bp);		if (error) {			goto error0;		}		/*		 * AG inode header block		 */		bp = xfs_buf_get(mp->m_ddev_targp,				  XFS_AG_DADDR(mp, agno, XFS_AGI_DADDR(mp)),				  XFS_FSS_TO_BB(mp, 1), 0);		agi = XFS_BUF_TO_AGI(bp);		memset(agi, 0, mp->m_sb.sb_sectsize);		INT_SET(agi->agi_magicnum, ARCH_CONVERT, XFS_AGI_MAGIC);		INT_SET(agi->agi_versionnum, ARCH_CONVERT, XFS_AGI_VERSION);		INT_SET(agi->agi_seqno, ARCH_CONVERT, agno);		INT_SET(agi->agi_length, ARCH_CONVERT, agsize);		INT_ZERO(agi->agi_count, ARCH_CONVERT);		INT_SET(agi->agi_root, ARCH_CONVERT, XFS_IBT_BLOCK(mp));		INT_SET(agi->agi_level, ARCH_CONVERT, 1);		INT_ZERO(agi->agi_freecount, ARCH_CONVERT);		INT_SET(agi->agi_newino, ARCH_CONVERT, NULLAGINO);		INT_SET(agi->agi_dirino, ARCH_CONVERT, NULLAGINO);		for (bucket = 0; bucket < XFS_AGI_UNLINKED_BUCKETS; bucket++)			INT_SET(agi->agi_unlinked[bucket], ARCH_CONVERT,				NULLAGINO);		error = xfs_bwrite(mp, bp);		if (error) {			goto error0;		}		/*		 * BNO btree root block		 */		bp = xfs_buf_get(mp->m_ddev_targp,			XFS_AGB_TO_DADDR(mp, agno, XFS_BNO_BLOCK(mp)),			BTOBB(mp->m_sb.sb_blocksize), 0);		block = XFS_BUF_TO_SBLOCK(bp);		memset(block, 0, mp->m_sb.sb_blocksize);		INT_SET(block->bb_magic, ARCH_CONVERT, XFS_ABTB_MAGIC);		INT_ZERO(block->bb_level, ARCH_CONVERT);		INT_SET(block->bb_numrecs, ARCH_CONVERT, 1);		INT_SET(block->bb_leftsib, ARCH_CONVERT, NULLAGBLOCK);		INT_SET(block->bb_rightsib, ARCH_CONVERT, NULLAGBLOCK);		arec = XFS_BTREE_REC_ADDR(mp->m_sb.sb_blocksize, xfs_alloc,			block, 1, mp->m_alloc_mxr[0]);		INT_SET(arec->ar_startblock, ARCH_CONVERT,			XFS_PREALLOC_BLOCKS(mp));		INT_SET(arec->ar_blockcount, ARCH_CONVERT,			agsize - INT_GET(arec->ar_startblock, ARCH_CONVERT));		error = xfs_bwrite(mp, bp);		if (error) {			goto error0;		}		/*		 * CNT btree root block		 */		bp = xfs_buf_get(mp->m_ddev_targp,			XFS_AGB_TO_DADDR(mp, agno, XFS_CNT_BLOCK(mp)),			BTOBB(mp->m_sb.sb_blocksize), 0);		block = XFS_BUF_TO_SBLOCK(bp);		memset(block, 0, mp->m_sb.sb_blocksize);		INT_SET(block->bb_magic, ARCH_CONVERT, XFS_ABTC_MAGIC);		INT_ZERO(block->bb_level, ARCH_CONVERT);		INT_SET(block->bb_numrecs, ARCH_CONVERT, 1);		INT_SET(block->bb_leftsib, ARCH_CONVERT, NULLAGBLOCK);		INT_SET(block->bb_rightsib, ARCH_CONVERT, NULLAGBLOCK);		arec = XFS_BTREE_REC_ADDR(mp->m_sb.sb_blocksize, xfs_alloc,			block, 1, mp->m_alloc_mxr[0]);		INT_SET(arec->ar_startblock, ARCH_CONVERT,			XFS_PREALLOC_BLOCKS(mp));		INT_SET(arec->ar_blockcount, ARCH_CONVERT,			agsize - INT_GET(arec->ar_startblock, ARCH_CONVERT));		nfree += INT_GET(arec->ar_blockcount, ARCH_CONVERT);		error = xfs_bwrite(mp, bp);		if (error) {			goto error0;		}		/*		 * INO btree root block		 */		bp = xfs_buf_get(mp->m_ddev_targp,			XFS_AGB_TO_DADDR(mp, agno, XFS_IBT_BLOCK(mp)),

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?