⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 inode.c

📁 嵌入式系统开发的必备工具,有嵌入式系统开发的瑞士军刀之功能,属于最新版本,更是制作文件系统很重要的工具
💻 C
📖 第 1 页 / 共 2 页
字号:
/* vi: set sw=4 ts=4: *//* * inode.c --- utility routines to read and write inodes * * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o. * * %Begin-Header% * This file may be redistributed under the terms of the GNU Public * License. * %End-Header% */#include <stdio.h>#include <string.h>#if HAVE_UNISTD_H#include <unistd.h>#endif#if HAVE_ERRNO_H#include <errno.h>#endif#if HAVE_SYS_STAT_H#include <sys/stat.h>#endif#if HAVE_SYS_TYPES_H#include <sys/types.h>#endif#include "ext2_fs.h"#include "ext2fsP.h"#include "e2image.h"struct ext2_struct_inode_scan {	errcode_t		magic;	ext2_filsys		fs;	ext2_ino_t		current_inode;	blk_t			current_block;	dgrp_t			current_group;	ext2_ino_t		inodes_left;	blk_t			blocks_left;	dgrp_t			groups_left;	blk_t			inode_buffer_blocks;	char *			inode_buffer;	int			inode_size;	char *			ptr;	int			bytes_left;	char			*temp_buffer;	errcode_t		(*done_group)(ext2_filsys fs,					      dgrp_t group,					      void * priv_data);	void *			done_group_data;	int			bad_block_ptr;	int			scan_flags;	int			reserved[6];};/* * This routine flushes the icache, if it exists. */errcode_t ext2fs_flush_icache(ext2_filsys fs){	int	i;	if (!fs->icache)		return 0;	for (i=0; i < fs->icache->cache_size; i++)		fs->icache->cache[i].ino = 0;	fs->icache->buffer_blk = 0;	return 0;}static errcode_t create_icache(ext2_filsys fs){	errcode_t	retval;	if (fs->icache)		return 0;	retval = ext2fs_get_mem(sizeof(struct ext2_inode_cache), &fs->icache);	if (retval)		return retval;	memset(fs->icache, 0, sizeof(struct ext2_inode_cache));	retval = ext2fs_get_mem(fs->blocksize, &fs->icache->buffer);	if (retval) {		ext2fs_free_mem(&fs->icache);		return retval;	}	fs->icache->buffer_blk = 0;	fs->icache->cache_last = -1;	fs->icache->cache_size = 4;	fs->icache->refcount = 1;	retval = ext2fs_get_mem(sizeof(struct ext2_inode_cache_ent)				* fs->icache->cache_size,				&fs->icache->cache);	if (retval) {		ext2fs_free_mem(&fs->icache->buffer);		ext2fs_free_mem(&fs->icache);		return retval;	}	ext2fs_flush_icache(fs);	return 0;}errcode_t ext2fs_open_inode_scan(ext2_filsys fs, int buffer_blocks,				 ext2_inode_scan *ret_scan){	ext2_inode_scan	scan;	errcode_t	retval;	errcode_t (*save_get_blocks)(ext2_filsys f, ext2_ino_t ino, blk_t *blocks);	EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS);	/*	 * If fs->badblocks isn't set, then set it --- since the inode	 * scanning functions require it.	 */	if (fs->badblocks == 0) {		/*		 * Temporarly save fs->get_blocks and set it to zero,		 * for compatibility with old e2fsck's.		 */		save_get_blocks = fs->get_blocks;		fs->get_blocks = 0;		retval = ext2fs_read_bb_inode(fs, &fs->badblocks);		if (retval) {			ext2fs_badblocks_list_free(fs->badblocks);			fs->badblocks = 0;		}		fs->get_blocks = save_get_blocks;	}	retval = ext2fs_get_mem(sizeof(struct ext2_struct_inode_scan), &scan);	if (retval)		return retval;	memset(scan, 0, sizeof(struct ext2_struct_inode_scan));	scan->magic = EXT2_ET_MAGIC_INODE_SCAN;	scan->fs = fs;	scan->inode_size = EXT2_INODE_SIZE(fs->super);	scan->bytes_left = 0;	scan->current_group = 0;	scan->groups_left = fs->group_desc_count - 1;	scan->inode_buffer_blocks = buffer_blocks ? buffer_blocks : 8;	scan->current_block = scan->fs->		group_desc[scan->current_group].bg_inode_table;	scan->inodes_left = EXT2_INODES_PER_GROUP(scan->fs->super);	scan->blocks_left = scan->fs->inode_blocks_per_group;	retval = ext2fs_get_mem((size_t) (scan->inode_buffer_blocks *					  fs->blocksize),				&scan->inode_buffer);	scan->done_group = 0;	scan->done_group_data = 0;	scan->bad_block_ptr = 0;	if (retval) {		ext2fs_free_mem(&scan);		return retval;	}	retval = ext2fs_get_mem(scan->inode_size, &scan->temp_buffer);	if (retval) {		ext2fs_free_mem(&scan->inode_buffer);		ext2fs_free_mem(&scan);		return retval;	}	if (scan->fs->badblocks && scan->fs->badblocks->num)		scan->scan_flags |= EXT2_SF_CHK_BADBLOCKS;	*ret_scan = scan;	return 0;}void ext2fs_close_inode_scan(ext2_inode_scan scan){	if (!scan || (scan->magic != EXT2_ET_MAGIC_INODE_SCAN))		return;	ext2fs_free_mem(&scan->inode_buffer);	scan->inode_buffer = NULL;	ext2fs_free_mem(&scan->temp_buffer);	scan->temp_buffer = NULL;	ext2fs_free_mem(&scan);}void ext2fs_set_inode_callback(ext2_inode_scan scan,			       errcode_t (*done_group)(ext2_filsys fs,						       dgrp_t group,						       void * priv_data),			       void *done_group_data){	if (!scan || (scan->magic != EXT2_ET_MAGIC_INODE_SCAN))		return;	scan->done_group = done_group;	scan->done_group_data = done_group_data;}int ext2fs_inode_scan_flags(ext2_inode_scan scan, int set_flags,			    int clear_flags){	int	old_flags;	if (!scan || (scan->magic != EXT2_ET_MAGIC_INODE_SCAN))		return 0;	old_flags = scan->scan_flags;	scan->scan_flags &= ~clear_flags;	scan->scan_flags |= set_flags;	return old_flags;}/* * This function is called by ext2fs_get_next_inode when it needs to * get ready to read in a new blockgroup. */static errcode_t get_next_blockgroup(ext2_inode_scan scan){	scan->current_group++;	scan->groups_left--;	scan->current_block = scan->fs->		group_desc[scan->current_group].bg_inode_table;	scan->current_inode = scan->current_group *		EXT2_INODES_PER_GROUP(scan->fs->super);	scan->bytes_left = 0;	scan->inodes_left = EXT2_INODES_PER_GROUP(scan->fs->super);	scan->blocks_left = scan->fs->inode_blocks_per_group;	return 0;}errcode_t ext2fs_inode_scan_goto_blockgroup(ext2_inode_scan scan,					    int	group){	scan->current_group = group - 1;	scan->groups_left = scan->fs->group_desc_count - group;	return get_next_blockgroup(scan);}/* * This function is called by get_next_blocks() to check for bad * blocks in the inode table. * * This function assumes that badblocks_list->list is sorted in * increasing order. */static errcode_t check_for_inode_bad_blocks(ext2_inode_scan scan,					    blk_t *num_blocks){	blk_t	blk = scan->current_block;	badblocks_list	bb = scan->fs->badblocks;	/*	 * If the inode table is missing, then obviously there are no	 * bad blocks.  :-)	 */	if (blk == 0)		return 0;	/*	 * If the current block is greater than the bad block listed	 * in the bad block list, then advance the pointer until this	 * is no longer the case.  If we run out of bad blocks, then	 * we don't need to do any more checking!	 */	while (blk > bb->list[scan->bad_block_ptr]) {		if (++scan->bad_block_ptr >= bb->num) {			scan->scan_flags &= ~EXT2_SF_CHK_BADBLOCKS;			return 0;		}	}	/*	 * If the current block is equal to the bad block listed in	 * the bad block list, then handle that one block specially.	 * (We could try to handle runs of bad blocks, but that	 * only increases CPU efficiency by a small amount, at the	 * expense of a huge expense of code complexity, and for an	 * uncommon case at that.)	 */	if (blk == bb->list[scan->bad_block_ptr]) {		scan->scan_flags |= EXT2_SF_BAD_INODE_BLK;		*num_blocks = 1;		if (++scan->bad_block_ptr >= bb->num)			scan->scan_flags &= ~EXT2_SF_CHK_BADBLOCKS;		return 0;	}	/*	 * If there is a bad block in the range that we're about to	 * read in, adjust the number of blocks to read so that we we	 * don't read in the bad block.  (Then the next block to read	 * will be the bad block, which is handled in the above case.)	 */	if ((blk + *num_blocks) > bb->list[scan->bad_block_ptr])		*num_blocks = (int) (bb->list[scan->bad_block_ptr] - blk);	return 0;}/* * This function is called by ext2fs_get_next_inode when it needs to * read in more blocks from the current blockgroup's inode table. */static errcode_t get_next_blocks(ext2_inode_scan scan){	blk_t		num_blocks;	errcode_t	retval;	/*	 * Figure out how many blocks to read; we read at most	 * inode_buffer_blocks, and perhaps less if there aren't that	 * many blocks left to read.	 */	num_blocks = scan->inode_buffer_blocks;	if (num_blocks > scan->blocks_left)		num_blocks = scan->blocks_left;	/*	 * If the past block "read" was a bad block, then mark the	 * left-over extra bytes as also being bad.	 */	if (scan->scan_flags & EXT2_SF_BAD_INODE_BLK) {		if (scan->bytes_left)			scan->scan_flags |= EXT2_SF_BAD_EXTRA_BYTES;		scan->scan_flags &= ~EXT2_SF_BAD_INODE_BLK;	}	/*	 * Do inode bad block processing, if necessary.	 */	if (scan->scan_flags & EXT2_SF_CHK_BADBLOCKS) {		retval = check_for_inode_bad_blocks(scan, &num_blocks);		if (retval)			return retval;	}	if ((scan->scan_flags & EXT2_SF_BAD_INODE_BLK) ||	    (scan->current_block == 0)) {		memset(scan->inode_buffer, 0,		       (size_t) num_blocks * scan->fs->blocksize);	} else {		retval = io_channel_read_blk(scan->fs->io,					     scan->current_block,					     (int) num_blocks,					     scan->inode_buffer);		if (retval)			return EXT2_ET_NEXT_INODE_READ;	}	scan->ptr = scan->inode_buffer;	scan->bytes_left = num_blocks * scan->fs->blocksize;	scan->blocks_left -= num_blocks;	if (scan->current_block)		scan->current_block += num_blocks;	return 0;}errcode_t ext2fs_get_next_inode_full(ext2_inode_scan scan, ext2_ino_t *ino,				     struct ext2_inode *inode, int bufsize){	errcode_t	retval;	int		extra_bytes = 0;	EXT2_CHECK_MAGIC(scan, EXT2_ET_MAGIC_INODE_SCAN);	/*	 * Do we need to start reading a new block group?	 */	if (scan->inodes_left <= 0) {	force_new_group:		if (scan->done_group) {			retval = (scan->done_group)				(scan->fs, scan->current_group,				 scan->done_group_data);			if (retval)				return retval;		}		if (scan->groups_left <= 0) {			*ino = 0;			return 0;		}		retval = get_next_blockgroup(scan);		if (retval)			return retval;

⌨️ 快捷键说明

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