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

📄 reiserfs_fs_sb.h

📁 linux得一些常用命令,以及linux环境下的c编程
💻 H
📖 第 1 页 / 共 2 页
字号:
  unsigned long j_last_flush_trans_id ;    /* last fully flushed journal timestamp */  struct buffer_head *j_header_bh ;     /* j_flush_pages must be flushed before the current transaction can  ** commit  */  struct reiserfs_page_list *j_flush_pages ;  time_t j_trans_start_time ;         /* time this transaction started */  wait_queue_head_t j_wait ;         /* wait  journal_end to finish I/O */  atomic_t j_wlock ;                       /* lock for j_wait */  wait_queue_head_t j_join_wait ;    /* wait for current transaction to finish before starting new one */  atomic_t j_jlock ;                       /* lock for j_join_wait */  int j_journal_list_index ;	      /* journal list number of the current trans */  int j_list_bitmap_index ;	      /* number of next list bitmap to use */  int j_must_wait ;		       /* no more journal begins allowed. MUST sleep on j_join_wait */  int j_next_full_flush ;             /* next journal_end will flush all journal list */  int j_next_async_flush ;             /* next journal_end will flush all async commits */  int j_cnode_used ;	      /* number of cnodes on the used list */  int j_cnode_free ;          /* number of cnodes on the free list */  struct reiserfs_journal_cnode *j_cnode_free_list ;  struct reiserfs_journal_cnode *j_cnode_free_orig ; /* orig pointer returned from vmalloc */  int j_free_bitmap_nodes ;  int j_used_bitmap_nodes ;  struct list_head j_bitmap_nodes ;  struct inode j_dummy_inode ;  struct reiserfs_list_bitmap j_list_bitmap[JOURNAL_NUM_BITMAPS] ;	/* array of bitmaps to record the deleted blocks */  struct reiserfs_journal_list j_journal_list[JOURNAL_LIST_COUNT] ;	    /* array of all the journal lists */  struct reiserfs_journal_cnode *j_hash_table[JOURNAL_HASH_SIZE] ; 	    /* hash table for real buffer heads in current trans */   struct reiserfs_journal_cnode *j_list_hash_table[JOURNAL_HASH_SIZE] ; /* hash table for all the real buffer heads in all   										the transactions */  struct list_head j_prealloc_list;     /* list of inodes which have preallocated blocks */};#define JOURNAL_DESC_MAGIC "ReIsErLB" /* ick.  magic string to find desc blocks in the journal */typedef __u32 (*hashf_t) (const signed char *, int);struct reiserfs_bitmap_info{    // FIXME: Won't work with block sizes > 8K    __u16  first_zero_hint;    __u16  free_count;    struct buffer_head *bh; /* the actual bitmap */};struct proc_dir_entry;#if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )typedef unsigned long int stat_cnt_t;typedef struct reiserfs_proc_info_data{  spinlock_t lock;  int exiting;  int max_hash_collisions;  stat_cnt_t breads;  stat_cnt_t bread_miss;  stat_cnt_t search_by_key;  stat_cnt_t search_by_key_fs_changed;  stat_cnt_t search_by_key_restarted;  stat_cnt_t insert_item_restarted;  stat_cnt_t paste_into_item_restarted;  stat_cnt_t cut_from_item_restarted;  stat_cnt_t delete_solid_item_restarted;  stat_cnt_t delete_item_restarted;  stat_cnt_t leaked_oid;  stat_cnt_t leaves_removable;  /* balances per level. Use explicit 5 as MAX_HEIGHT is not visible yet. */  stat_cnt_t balance_at[ 5 ]; /* XXX */  /* sbk == search_by_key */  stat_cnt_t sbk_read_at[ 5 ]; /* XXX */  stat_cnt_t sbk_fs_changed[ 5 ];  stat_cnt_t sbk_restarted[ 5 ];  stat_cnt_t items_at[ 5 ]; /* XXX */  stat_cnt_t free_at[ 5 ]; /* XXX */  stat_cnt_t can_node_be_removed[ 5 ]; /* XXX */  long int lnum[ 5 ]; /* XXX */  long int rnum[ 5 ]; /* XXX */  long int lbytes[ 5 ]; /* XXX */  long int rbytes[ 5 ]; /* XXX */  stat_cnt_t get_neighbors[ 5 ];  stat_cnt_t get_neighbors_restart[ 5 ];  stat_cnt_t need_l_neighbor[ 5 ];  stat_cnt_t need_r_neighbor[ 5 ];  stat_cnt_t free_block;  struct __scan_bitmap_stats {	stat_cnt_t call;	stat_cnt_t wait;	stat_cnt_t bmap;	stat_cnt_t retry;	stat_cnt_t in_journal_hint;	stat_cnt_t in_journal_nohint;	stat_cnt_t stolen;  } scan_bitmap;  struct __journal_stats {	stat_cnt_t in_journal;	stat_cnt_t in_journal_bitmap;	stat_cnt_t in_journal_reusable;	stat_cnt_t lock_journal;	stat_cnt_t lock_journal_wait;	stat_cnt_t journal_being;	stat_cnt_t journal_relock_writers;	stat_cnt_t journal_relock_wcount;	stat_cnt_t mark_dirty;	stat_cnt_t mark_dirty_already;	stat_cnt_t mark_dirty_notjournal;	stat_cnt_t restore_prepared;	stat_cnt_t prepare;	stat_cnt_t prepare_retry;  } journal;} reiserfs_proc_info_data_t;#elsetypedef struct reiserfs_proc_info_data{} reiserfs_proc_info_data_t;#endif/* reiserfs union of in-core super block data */struct reiserfs_sb_info{    struct buffer_head * s_sbh;                   /* Buffer containing the super block */				/* both the comment and the choice of                                   name are unclear for s_rs -Hans */    struct reiserfs_super_block * s_rs;           /* Pointer to the super block in the buffer */    struct reiserfs_bitmap_info * s_ap_bitmap;    struct reiserfs_journal *s_journal ;		/* pointer to journal information */    unsigned short s_mount_state;                 /* reiserfs state (valid, invalid) */  				/* Comment? -Hans */    void (*end_io_handler)(struct buffer_head *, int);    hashf_t s_hash_function;	/* pointer to function which is used                                   to sort names in directory. Set on                                   mount */    unsigned long s_mount_opt;	/* reiserfs's mount options are set                                   here (currently - NOTAIL, NOLOG,                                   REPLAYONLY) */    struct {			/* This is a structure that describes block allocator options */	unsigned long bits;	/* Bitfield for enable/disable kind of options */	unsigned long large_file_size; /* size started from which we consider file to be a large one(in blocks) */	int border;		/* percentage of disk, border takes */	int preallocmin;	/* Minimal file size (in blocks) starting from which we do preallocations */	int preallocsize;	/* Number of blocks we try to prealloc when file				   reaches preallocmin size (in blocks) or				   prealloc_list is empty. */    } s_alloc_options;				/* Comment? -Hans */    wait_queue_head_t s_wait;				/* To be obsoleted soon by per buffer seals.. -Hans */    atomic_t s_generation_counter; // increased by one every time the    // tree gets re-balanced    unsigned long s_properties;    /* File system properties. Currently holds				     on-disk FS format */        /* session statistics */    int s_kmallocs;    int s_disk_reads;    int s_disk_writes;    int s_fix_nodes;    int s_do_balance;    int s_unneeded_left_neighbor;    int s_good_search_by_key_reada;    int s_bmaps;    int s_bmaps_without_search;    int s_direct2indirect;    int s_indirect2direct;	/* set up when it's ok for reiserfs_read_inode2() to read from	   disk inode with nlink==0. Currently this is only used during	   finish_unfinished() processing at mount time */    int s_is_unlinked_ok;    reiserfs_proc_info_data_t s_proc_info_data;    struct proc_dir_entry *procdir;    int reserved_blocks; /* amount of blocks reserved for further allocations */};/* Definitions of reiserfs on-disk properties: */#define REISERFS_3_5 0#define REISERFS_3_6 1/* Mount options */#define REISERFS_LARGETAIL 0  /* large tails will be created in a session */#define REISERFS_SMALLTAIL 17  /* small (for files less than block size) tails will be created in a session */#define REPLAYONLY 3 /* replay journal and return 0. Use by fsck */#define REISERFS_NOLOG 4      /* -o nolog: turn journalling off */#define REISERFS_CONVERT 5    /* -o conv: causes conversion of old                                 format super block to the new                                 format. If not specified - old                                 partition will be dealt with in a                                 manner of 3.5.x *//* -o hash={tea, rupasov, r5, detect} is meant for properly mounting ** reiserfs disks from 3.5.19 or earlier.  99% of the time, this option** is not required.  If the normal autodection code can't determine which** hash to use (because both hases had the same value for a file)** use this option to force a specific hash.  It won't allow you to override** the existing hash on the FS, so if you have a tea hash disk, and mount** with -o hash=rupasov, the mount will fail.*/#define FORCE_TEA_HASH 6      /* try to force tea hash on mount */#define FORCE_RUPASOV_HASH 7  /* try to force rupasov hash on mount */#define FORCE_R5_HASH 8       /* try to force rupasov hash on mount */#define FORCE_HASH_DETECT 9   /* try to detect hash function on mount *//* used for testing experimental features, makes benchmarking new   features with and without more convenient, should never be used by   users in any code shipped to users (ideally) */#define REISERFS_NO_BORDER 11#define REISERFS_NO_UNHASHED_RELOCATION 12#define REISERFS_HASHED_RELOCATION 13#define REISERFS_TEST4 14 #define REISERFS_TEST1 11#define REISERFS_TEST2 12#define REISERFS_TEST3 13#define REISERFS_TEST4 14 #define REISERFS_ATTRS (15)#define reiserfs_r5_hash(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << FORCE_R5_HASH))#define reiserfs_rupasov_hash(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << FORCE_RUPASOV_HASH))#define reiserfs_tea_hash(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << FORCE_TEA_HASH))#define reiserfs_hash_detect(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << FORCE_HASH_DETECT))#define reiserfs_no_border(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_NO_BORDER))#define reiserfs_no_unhashed_relocation(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_NO_UNHASHED_RELOCATION))#define reiserfs_hashed_relocation(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_HASHED_RELOCATION))#define reiserfs_test4(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_TEST4))#define have_large_tails(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_LARGETAIL))#define have_small_tails(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_SMALLTAIL))#define replay_only(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REPLAYONLY))#define reiserfs_dont_log(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_NOLOG))#define reiserfs_attrs(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_ATTRS))#define old_format_only(s) ((s)->u.reiserfs_sb.s_properties & (1 << REISERFS_3_5))#define convert_reiserfs(s) ((s)->u.reiserfs_sb.s_mount_opt & (1 << REISERFS_CONVERT))void reiserfs_file_buffer (struct buffer_head * bh, int list);int reiserfs_is_super(struct super_block *s)  ;int journal_mark_dirty(struct reiserfs_transaction_handle *, struct super_block *, struct buffer_head *bh) ;int flush_old_commits(struct super_block *s, int) ;int show_reiserfs_locks(void) ;int reiserfs_resize(struct super_block *, unsigned long) ;#define CARRY_ON                0#define SCHEDULE_OCCURRED       1#define SB_BUFFER_WITH_SB(s) ((s)->u.reiserfs_sb.s_sbh)#define SB_JOURNAL(s) ((s)->u.reiserfs_sb.s_journal)#define SB_JOURNAL_LIST(s) (SB_JOURNAL(s)->j_journal_list)#define SB_JOURNAL_LIST_INDEX(s) (SB_JOURNAL(s)->j_journal_list_index) #define SB_JOURNAL_LEN_FREE(s) (SB_JOURNAL(s)->j_journal_len_free) #define SB_AP_BITMAP(s) ((s)->u.reiserfs_sb.s_ap_bitmap)// on-disk super block fields converted to cpu form#define SB_DISK_SUPER_BLOCK(s)        ((s)->u.reiserfs_sb.s_rs)#define SB_BLOCK_COUNT(s)             sb_block_count (SB_DISK_SUPER_BLOCK(s))#define SB_FREE_BLOCKS(s)             sb_free_blocks (SB_DISK_SUPER_BLOCK(s))#define SB_REISERFS_MAGIC(s)          (SB_DISK_SUPER_BLOCK(s)->s_magic)#define SB_ROOT_BLOCK(s)              sb_root_block (SB_DISK_SUPER_BLOCK(s))#define SB_TREE_HEIGHT(s)             sb_tree_height (SB_DISK_SUPER_BLOCK(s))#define SB_REISERFS_STATE(s)          sb_state (SB_DISK_SUPER_BLOCK(s))#define SB_VERSION(s)                 sb_version (SB_DISK_SUPER_BLOCK(s))#define SB_BMAP_NR(s)                 sb_bmap_nr(SB_DISK_SUPER_BLOCK(s))#define PUT_SB_BLOCK_COUNT(s, val)    do { set_sb_block_count( SB_DISK_SUPER_BLOCK(s), val); } while (0)#define PUT_SB_FREE_BLOCKS(s, val)    do { set_sb_free_blocks( SB_DISK_SUPER_BLOCK(s), val); } while (0)#define PUT_SB_ROOT_BLOCK(s, val)     do { set_sb_root_block( SB_DISK_SUPER_BLOCK(s), val); } while (0)#define PUT_SB_TREE_HEIGHT(s, val)    do { set_sb_tree_height( SB_DISK_SUPER_BLOCK(s), val); } while (0)#define PUT_SB_REISERFS_STATE(s, val) do { set_sb_state( SB_DISK_SUPER_BLOCK(s), val); } while (0) #define PUT_SB_VERSION(s, val)        do { set_sb_version( SB_DISK_SUPER_BLOCK(s), val); } while (0)#define PUT_SB_BMAP_NR(s, val)        do { set_sb_bmap_nr( SB_DISK_SUPER_BLOCK(s), val); } while (0)#endif	/* _LINUX_REISER_FS_SB */

⌨️ 快捷键说明

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