p!ranha?

/* * Copyright 1996, 1997, 1998 Hans Reiser, see reiserfs/README for licensing and copyright details */ /* this file has an amazingly stupid name, yura please fix it to be reiserfs.h, and merge all the rest of our .h files that are in this directory into it. */ #ifndef _LINUX_REISER_FS_H #define _LINUX_REISER_FS_H #include <linux/types.h> #include <linux/magic.h> #ifdef __KERNEL__ #include <linux/slab.h> #include <linux/interrupt.h> #include <linux/sched.h> #include <linux/workqueue.h> #include <asm/unaligned.h> #include <linux/bitops.h> #include <linux/proc_fs.h> #include <linux/smp_lock.h> #include <linux/buffer_head.h> #include <linux/reiserfs_fs_i.h> #include <linux/reiserfs_fs_sb.h> #endif /* * include/linux/reiser_fs.h * * Reiser File System constants and structures * */ /* ioctl's command */ #define REISERFS_IOC_UNPACK _IOW(0xCD,1,long) /* define following flags to be the same as in ext2, so that chattr(1), lsattr(1) will work with us. */ #define REISERFS_IOC_GETFLAGS FS_IOC_GETFLAGS #define REISERFS_IOC_SETFLAGS FS_IOC_SETFLAGS #define REISERFS_IOC_GETVERSION FS_IOC_GETVERSION #define REISERFS_IOC_SETVERSION FS_IOC_SETVERSION #ifdef __KERNEL__ /* the 32 bit compat definitions with int argument */ #define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int) #define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS #define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS #define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION #define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION /* Locking primitives */ /* Right now we are still falling back to (un)lock_kernel, but eventually that would evolve into real per-fs locks */ #define reiserfs_write_lock( sb ) lock_kernel() #define reiserfs_write_unlock( sb ) unlock_kernel() struct fid; /* in reading the #defines, it may help to understand that they employ the following abbreviations: B = Buffer I = Item header H = Height within the tree (should be changed to LEV) N = Number of the item in the node STAT = stat data DEH = Directory Entry Header EC = Entry Count E = Entry number UL = Unsigned Long BLKH = BLocK Header UNFM = UNForMatted node DC = Disk Child P = Path These #defines are named by concatenating these abbreviations, where first comes the arguments, and last comes the return value, of the macro. */ #define USE_INODE_GENERATION_COUNTER #define REISERFS_PREALLOCATE #define DISPLACE_NEW_PACKING_LOCALITIES #define PREALLOCATION_SIZE 9 /* n must be power of 2 */ #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u)) // to be ok for alpha and others we have to align structures to 8 byte // boundary. // FIXME: do not change 4 by anything else: there is code which relies on that #define ROUND_UP(x) _ROUND_UP(x,8LL) /* debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug ** messages. */ #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */ void __reiserfs_warning(struct super_block *s, const char *id, const char *func, const char *fmt, ...); #define reiserfs_warning(s, id, fmt, args...) \ __reiserfs_warning(s, id, __func__, fmt, ##args) /* assertions handling */ /** always check a condition and panic if it's false. */ #define __RASSERT(cond, scond, format, args...) \ do { \ if (!(cond)) \ reiserfs_panic(NULL, "assertion failure", "(" #cond ") at " \ __FILE__ ":%i:%s: " format "\n", \ in_interrupt() ? -1 : task_pid_nr(current), \ __LINE__, __func__ , ##args); \ } while (0) #define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args) #if defined( CONFIG_REISERFS_CHECK ) #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args) #else #define RFALSE( cond, format, args... ) do {;} while( 0 ) #endif #define CONSTF __attribute_const__ /* * Disk Data Structures */ /***************************************************************************/ /* SUPER BLOCK */ /***************************************************************************/ /* * Structure of super block on disk, a version of which in RAM is often accessed as REISERFS_SB(s)->s_rs * the version in RAM is part of a larger structure containing fields never written to disk. */ #define UNSET_HASH 0 // read_super will guess about, what hash names // in directories were sorted with #define TEA_HASH 1 #define YURA_HASH 2 #define R5_HASH 3 #define DEFAULT_HASH R5_HASH struct journal_params { __le32 jp_journal_1st_block; /* where does journal start from on its * device */ __le32 jp_journal_dev; /* journal device st_rdev */ __le32 jp_journal_size; /* size of the journal */ __le32 jp_journal_trans_max; /* max number of blocks in a transaction. */ __le32 jp_journal_magic; /* random value made on fs creation (this * was sb_journal_block_count) */ __le32 jp_journal_max_batch; /* max number of blocks to batch into a * trans */ __le32 jp_journal_max_commit_age; /* in seconds, how old can an async * commit be */ __le32 jp_journal_max_trans_age; /* in seconds, how old can a transaction * be */ }; /* this is the super from 3.5.X, where X >= 10 */ struct reiserfs_super_block_v1 { __le32 s_block_count; /* blocks count */ __le32 s_free_blocks; /* free blocks count */ __le32 s_root_block; /* root block number */ struct journal_params s_journal; __le16 s_blocksize; /* block size */ __le16 s_oid_maxsize; /* max size of object id array, see * get_objectid() commentary */ __le16 s_oid_cursize; /* current size of object id array */ __le16 s_umount_state; /* this is set to 1 when filesystem was * umounted, to 2 - when not */ char s_magic[10]; /* reiserfs magic string indicates that * file system is reiserfs: * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs" */ __le16 s_fs_state; /* it is set to used by fsck to mark which * phase of rebuilding is done */ __le32 s_hash_function_code; /* indicate, what hash function is being use * to sort names in a directory*/ __le16 s_tree_height; /* height of disk tree */ __le16 s_bmap_nr; /* amount of bitmap blocks needed to address * each block of file system */ __le16 s_version; /* this field is only reliable on filesystem * with non-standard journal */ __le16 s_reserved_for_journal; /* size in blocks of journal area on main * device, we need to keep after * making fs with non-standard journal */ } __attribute__ ((__packed__)); #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1)) /* this is the on disk super block */ struct reiserfs_super_block { struct reiserfs_super_block_v1 s_v1; __le32 s_inode_generation; __le32 s_flags; /* Right now used only by inode-attributes, if enabled */ unsigned char s_uuid[16]; /* filesystem unique identifier */ unsigned char s_label[16]; /* filesystem volume label */ __le16 s_mnt_count; /* Count of mounts since last fsck */ __le16 s_max_mnt_count; /* Maximum mounts before check */ __le32 s_lastcheck; /* Timestamp of last fsck */ __le32 s_check_interval; /* Interval between checks */ char s_unused[76]; /* zero filled by mkreiserfs and * reiserfs_convert_objectid_map_v1() * so any additions must be updated * there as well. */ } __attribute__ ((__packed__)); #define SB_SIZE (sizeof(struct reiserfs_super_block)) #define REISERFS_VERSION_1 0 #define REISERFS_VERSION_2 2 // on-disk super block fields converted to cpu form #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs) #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1)) #define SB_BLOCKSIZE(s) \ le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize)) #define SB_BLOCK_COUNT(s) \ le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count)) #define SB_FREE_BLOCKS(s) \ le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks)) #define SB_REISERFS_MAGIC(s) \ (SB_V1_DISK_SUPER_BLOCK(s)->s_magic) #define SB_ROOT_BLOCK(s) \ le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block)) #define SB_TREE_HEIGHT(s) \ le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height)) #define SB_REISERFS_STATE(s) \ le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state)) #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version)) #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr)) #define PUT_SB_BLOCK_COUNT(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0) #define PUT_SB_FREE_BLOCKS(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0) #define PUT_SB_ROOT_BLOCK(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0) #define PUT_SB_TREE_HEIGHT(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0) #define PUT_SB_REISERFS_STATE(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0) #define PUT_SB_VERSION(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0) #define PUT_SB_BMAP_NR(s, val) \ do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0) #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal) #define SB_ONDISK_JOURNAL_SIZE(s) \ le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size)) #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \ le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block)) #define SB_ONDISK_JOURNAL_DEVICE(s) \ le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev)) #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \ le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal)) #define is_block_in_log_or_reserved_area(s, block) \ block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \ && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \ ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \ SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s))) int is_reiserfs_3_5(struct reiserfs_super_block *rs); int is_reiserfs_3_6(struct reiserfs_super_block *rs); int is_reiserfs_jr(struct reiserfs_super_block *rs); /* ReiserFS leaves the first 64k unused, so that partition labels have enough space. If someone wants to write a fancy bootloader that needs more than 64k, let us know, and this will be increased in size. This number must be larger than than the largest block size on any platform, or code will break. -Hans */ #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024) #define REISERFS_FIRST_BLOCK unused_define #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */ #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024) // reiserfs internal error code (used by search_by_key adn fix_nodes)) #define CARRY_ON 0 #define REPEAT_SEARCH -1 #define IO_ERROR -2 #define NO_DISK_SPACE -3 #define NO_BALANCING_NEEDED (-4) #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5) #define QUOTA_EXCEEDED -6 typedef __u32 b_blocknr_t; typedef __le32 unp_t; struct unfm_nodeinfo { unp_t unfm_nodenum; unsigned short unfm_freespace; }; /* there are two formats of keys: 3.5 and 3.6 */ #define KEY_FORMAT_3_5 0 #define KEY_FORMAT_3_6 1 /* there are two stat datas */ #define STAT_DATA_V1 0 #define STAT_DATA_V2 1 static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode) { return container_of(inode, struct reiserfs_inode_info, vfs_inode); } static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb) { return sb->s_fs_info; } /* Don't trust REISERFS_SB(sb)->s_bmap_nr, it's a u16 * which overflows on large file systems. */ static inline __u32 reiserfs_bmap_count(struct super_block *sb) { return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1; } static inline int bmap_would_wrap(unsigned bmap_nr) { return bmap_nr > ((1LL << 16) - 1); } /** this says about version of key of all items (but stat data) the object consists of */ #define get_inode_item_key_version( inode ) \ ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5) #define set_inode_item_key_version( inode, version ) \ ({ if((version)==KEY_FORMAT_3_6) \ REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \ else \ REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; }) #define get_inode_sd_version(inode) \ ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1) #define set_inode_sd_version(inode, version) \ ({ if((version)==STAT_DATA_V2) \ REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \ else \ REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; }) /* This is an aggressive tail suppression policy, I am hoping it improves our benchmarks. The principle behind it is that percentage space saving is what matters, not absolute space saving. This is non-intuitive, but it helps to understand it if you consider that the cost to access 4 blocks is not much more than the cost to access 1 block, if you have to do a seek and rotate. A tail risks a non-linear disk access that is significant as a percentage of total time cost for a 4 block file and saves an amount of space that is less significant as a percentage of space, or so goes the hypothesis. -Hans */ #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \ (\ (!(n_tail_size)) || \ (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \ ( (n_file_size) >= (n_block_size) * 4 ) || \ ( ( (n_file_size) >= (n_block_size) * 3 ) && \ ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \ ( ( (n_file_size) >= (n_block_size) * 2 ) && \ ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \ ( ( (n_file_size) >= (n_block_size) ) && \ ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \ ) /* Another strategy for tails, this one means only create a tail if all the file would fit into one DIRECT item. Primary intention for this one is to increase performance by decreasing seeking. */ #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \ (\ (!(n_tail_size)) || \ (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \ ) /* * values for s_umount_state field */ #define REISERFS_VALID_FS 1 #define REISERFS_ERROR_FS 2 // // there are 5 item types currently // #define TYPE_STAT_DATA 0 #define TYPE_INDIRECT 1 #define TYPE_DIRECT 2 #define TYPE_DIRENTRY 3 #define TYPE_MAXTYPE 3 #define TYPE_ANY 15 // FIXME: comment is required /***************************************************************************/ /* KEY & ITEM HEAD */ /***************************************************************************/ // // directories use this key as well as old files // struct offset_v1 { __le32 k_offset; __le32 k_uniqueness; } __attribute__ ((__packed__)); struct offset_v2 { __le64 v; } __attribute__ ((__packed__)); static inline __u16 offset_v2_k_type(const struct offset_v2 *v2) { __u8 type = le64_to_cpu(v2->v) >> 60; return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY; } static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type) { v2->v = (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60); } static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2) { return le64_to_cpu(v2->v) & (~0ULL >> 4); } static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset) { offset &= (~0ULL >> 4); v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset); } /* Key of an item determines its location in the S+tree, and is composed of 4 components */ struct reiserfs_key { __le32 k_dir_id; /* packing locality: by default parent directory object id */ __le32 k_objectid; /* object identifier */ union { struct offset_v1 k_offset_v1; struct offset_v2 k_offset_v2; } __attribute__ ((__packed__)) u; } __attribute__ ((__packed__)); struct in_core_key { __u32 k_dir_id; /* packing locality: by default parent directory object id */ __u32 k_objectid; /* object identifier */ __u64 k_offset; __u8 k_type; }; struct cpu_key { struct in_core_key on_disk_key; int version; int key_length; /* 3 in all cases but direct2indirect and indirect2direct conversion */ }; /* Our function for comparing keys can compare keys of different lengths. It takes as a parameter the length of the keys it is to compare. These defines are used in determining what is to be passed to it as that parameter. */ #define REISERFS_FULL_KEY_LEN 4 #define REISERFS_SHORT_KEY_LEN 2 /* The result of the key compare */ #define FIRST_GREATER 1 #define SECOND_GREATER -1 #define KEYS_IDENTICAL 0 #define KEY_FOUND 1 #define KEY_NOT_FOUND 0 #define KEY_SIZE (sizeof(struct reiserfs_key)) #define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32)) /* return values for search_by_key and clones */ #define ITEM_FOUND 1 #define ITEM_NOT_FOUND 0 #define ENTRY_FOUND 1 #define ENTRY_NOT_FOUND 0 #define DIRECTORY_NOT_FOUND -1 #define REGULAR_FILE_FOUND -2 #define DIRECTORY_FOUND -3 #define BYTE_FOUND 1 #define BYTE_NOT_FOUND 0 #define FILE_NOT_FOUND -1 #define POSITION_FOUND 1 #define POSITION_NOT_FOUND 0 // return values for reiserfs_find_entry and search_by_entry_key #define NAME_FOUND 1 #define NAME_NOT_FOUND 0 #define GOTO_PREVIOUS_ITEM 2 #define NAME_FOUND_INVISIBLE 3 /* Everything in the filesystem is stored as a set of items. The item head contains the key of the item, its free space (for indirect items) and specifies the location of the item itself within the block. */ struct item_head { /* Everything in the tree is found by searching for it based on * its key.*/ struct reiserfs_key ih_key; union { /* The free space in the last unformatted node of an indirect item if this is an indirect item. This equals 0xFFFF iff this is a direct item or stat data item. Note that the key, not this field, is used to determine the item type, and thus which field this union contains. */ __le16 ih_free_space_reserved; /* Iff this is a directory item, this field equals the number of directory entries in the directory item. */ __le16 ih_entry_count; } __attribute__ ((__packed__)) u; __le16 ih_item_len; /* total size of the item body */ __le16 ih_item_location; /* an offset to the item body * within the block */ __le16 ih_version; /* 0 for all old items, 2 for new ones. Highest bit is set by fsck temporary, cleaned after all done */ } __attribute__ ((__packed__)); /* size of item header */ #define IH_SIZE (sizeof(struct item_head)) #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved) #define ih_version(ih) le16_to_cpu((ih)->ih_version) #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count) #define ih_location(ih) le16_to_cpu((ih)->ih_item_location) #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len) #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0) #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0) #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0) #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0) #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0) #define unreachable_item(ih) (ih_version(ih) & (1 << 15)) #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih)) #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val))) /* these operate on indirect items, where you've got an array of ints ** at a possibly unaligned location. These are a noop on ia32 ** ** p is the array of __u32, i is the index into the array, v is the value ** to store there. */ #define get_block_num(p, i) get_unaligned_le32((p) + (i)) #define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i)) // // in old version uniqueness field shows key type // #define V1_SD_UNIQUENESS 0 #define V1_INDIRECT_UNIQUENESS 0xfffffffe #define V1_DIRECT_UNIQUENESS 0xffffffff #define V1_DIRENTRY_UNIQUENESS 500 #define V1_ANY_UNIQUENESS 555 // FIXME: comment is required // // here are conversion routines // static inline int uniqueness2type(__u32 uniqueness) CONSTF; static inline int uniqueness2type(__u32 uniqueness) { switch ((int)uniqueness) { case V1_SD_UNIQUENESS: return TYPE_STAT_DATA; case V1_INDIRECT_UNIQUENESS: return TYPE_INDIRECT; case V1_DIRECT_UNIQUENESS: return TYPE_DIRECT; case V1_DIRENTRY_UNIQUENESS: return TYPE_DIRENTRY; case V1_ANY_UNIQUENESS: default: return TYPE_ANY; } } static inline __u32 type2uniqueness(int type) CONSTF; static inline __u32 type2uniqueness(int type) { switch (type) { case TYPE_STAT_DATA: return V1_SD_UNIQUENESS; case TYPE_INDIRECT: return V1_INDIRECT_UNIQUENESS; case TYPE_DIRECT: return V1_DIRECT_UNIQUENESS; case TYPE_DIRENTRY: return V1_DIRENTRY_UNIQUENESS; case TYPE_ANY: default: return V1_ANY_UNIQUENESS; } } // // key is pointer to on disk key which is stored in le, result is cpu, // there is no way to get version of object from key, so, provide // version to these defines // static inline loff_t le_key_k_offset(int version, const struct reiserfs_key *key) { return (version == KEY_FORMAT_3_5) ? le32_to_cpu(key->u.k_offset_v1.k_offset) : offset_v2_k_offset(&(key->u.k_offset_v2)); } static inline loff_t le_ih_k_offset(const struct item_head *ih) { return le_key_k_offset(ih_version(ih), &(ih->ih_key)); } static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key) { return (version == KEY_FORMAT_3_5) ? uniqueness2type(le32_to_cpu(key->u.k_offset_v1.k_uniqueness)) : offset_v2_k_type(&(key->u.k_offset_v2)); } static inline loff_t le_ih_k_type(const struct item_head *ih) { return le_key_k_type(ih_version(ih), &(ih->ih_key)); } static inline void set_le_key_k_offset(int version, struct reiserfs_key *key, loff_t offset) { (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_offset = cpu_to_le32(offset)) : /* jdm check */ (void)(set_offset_v2_k_offset(&(key->u.k_offset_v2), offset)); } static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset) { set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset); } static inline void set_le_key_k_type(int version, struct reiserfs_key *key, int type) { (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_uniqueness = cpu_to_le32(type2uniqueness(type))) : (void)(set_offset_v2_k_type(&(key->u.k_offset_v2), type)); } static inline void set_le_ih_k_type(struct item_head *ih, int type) { set_le_key_k_type(ih_version(ih), &(ih->ih_key), type); } static inline int is_direntry_le_key(int version, struct reiserfs_key *key) { return le_key_k_type(version, key) == TYPE_DIRENTRY; } static inline int is_direct_le_key(int version, struct reiserfs_key *key) { return le_key_k_type(version, key) == TYPE_DIRECT; } static inline int is_indirect_le_key(int version, struct reiserfs_key *key) { return le_key_k_type(version, key) == TYPE_INDIRECT; } static inline int is_statdata_le_key(int version, struct reiserfs_key *key) { return le_key_k_type(version, key) == TYPE_STAT_DATA; } // // item header has version. // static inline int is_direntry_le_ih(struct item_head *ih) { return is_direntry_le_key(ih_version(ih), &ih->ih_key); } static inline int is_direct_le_ih(struct item_head *ih) { return is_direct_le_key(ih_version(ih), &ih->ih_key); } static inline int is_indirect_le_ih(struct item_head *ih) { return is_indirect_le_key(ih_version(ih), &ih->ih_key); } static inline int is_statdata_le_ih(struct item_head *ih) { return is_statdata_le_key(ih_version(ih), &ih->ih_key); } // // key is pointer to cpu key, result is cpu // static inline loff_t cpu_key_k_offset(const struct cpu_key *key) { return key->on_disk_key.k_offset; } static inline loff_t cpu_key_k_type(const struct cpu_key *key) { return key->on_disk_key.k_type; } static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset) { key->on_disk_key.k_offset = offset; } static inline void set_cpu_key_k_type(struct cpu_key *key, int type) { key->on_disk_key.k_type = type; } static inline void cpu_key_k_offset_dec(struct cpu_key *key) { key->on_disk_key.k_offset--; } #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY) #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT) #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT) #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA) /* are these used ? */ #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key))) #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key))) #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key))) #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key))) #define I_K_KEY_IN_ITEM(ih, key, n_blocksize) \ (!COMP_SHORT_KEYS(ih, key) && \ I_OFF_BYTE_IN_ITEM(ih, k_offset(key), n_blocksize)) /* maximal length of item */ #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE) #define MIN_ITEM_LEN 1 /* object identifier for root dir */ #define REISERFS_ROOT_OBJECTID 2 #define REISERFS_ROOT_PARENT_OBJECTID 1 extern struct reiserfs_key root_key; /* * Picture represents a leaf of the S+tree * ______________________________________________________ * | | Array of | | | * |Block | Object-Item | F r e e | Objects- | * | head | Headers | S p a c e | Items | * |______|_______________|___________________|___________| */ /* Header of a disk block. More precisely, header of a formatted leaf or internal node, and not the header of an unformatted node. */ struct block_head { __le16 blk_level; /* Level of a block in the tree. */ __le16 blk_nr_item; /* Number of keys/items in a block. */ __le16 blk_free_space; /* Block free space in bytes. */ __le16 blk_reserved; /* dump this in v4/planA */ struct reiserfs_key blk_right_delim_key; /* kept only for compatibility */ }; #define BLKH_SIZE (sizeof(struct block_head)) #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level)) #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item)) #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space)) #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved)) #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val)) #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val)) #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val)) #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val)) #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key) #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val) /* * values for blk_level field of the struct block_head */ #define FREE_LEVEL 0 /* when node gets removed from the tree its blk_level is set to FREE_LEVEL. It is then used to see whether the node is still in the tree */ #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */ /* Given the buffer head of a formatted node, resolve to the block head of that node. */ #define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data)) /* Number of items that are in buffer. */ #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh))) #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh))) #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh))) #define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0) #define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0) #define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0) /* Get right delimiting key. -- little endian */ #define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh)))) /* Does the buffer contain a disk leaf. */ #define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL) /* Does the buffer contain a disk internal node */ #define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \ && B_LEVEL(bh) <= MAX_HEIGHT) /***************************************************************************/ /* STAT DATA */ /***************************************************************************/ // // old stat data is 32 bytes long. We are going to distinguish new one by // different size // struct stat_data_v1 { __le16 sd_mode; /* file type, permissions */ __le16 sd_nlink; /* number of hard links */ __le16 sd_uid; /* owner */ __le16 sd_gid; /* group */ __le32 sd_size; /* file size */ __le32 sd_atime; /* time of last access */ __le32 sd_mtime; /* time file was last modified */ __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */ union { __le32 sd_rdev; __le32 sd_blocks; /* number of blocks file uses */ } __attribute__ ((__packed__)) u; __le32 sd_first_direct_byte; /* first byte of file which is stored in a direct item: except that if it equals 1 it is a symlink and if it equals ~(__u32)0 there is no direct item. The existence of this field really grates on me. Let's replace it with a macro based on sd_size and our tail suppression policy. Someday. -Hans */ } __attribute__ ((__packed__)); #define SD_V1_SIZE (sizeof(struct stat_data_v1)) #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5) #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode)) #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v)) #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink)) #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v)) #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid)) #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v)) #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid)) #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v)) #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size)) #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v)) #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime)) #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v)) #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime)) #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v)) #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime)) #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v)) #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev)) #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v)) #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks)) #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v)) #define sd_v1_first_direct_byte(sdp) \ (le32_to_cpu((sdp)->sd_first_direct_byte)) #define set_sd_v1_first_direct_byte(sdp,v) \ ((sdp)->sd_first_direct_byte = cpu_to_le32(v)) /* inode flags stored in sd_attrs (nee sd_reserved) */ /* we want common flags to have the same values as in ext2, so chattr(1) will work without problems */ #define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL #define REISERFS_APPEND_FL FS_APPEND_FL #define REISERFS_SYNC_FL FS_SYNC_FL #define REISERFS_NOATIME_FL FS_NOATIME_FL #define REISERFS_NODUMP_FL FS_NODUMP_FL #define REISERFS_SECRM_FL FS_SECRM_FL #define REISERFS_UNRM_FL FS_UNRM_FL #define REISERFS_COMPR_FL FS_COMPR_FL #define REISERFS_NOTAIL_FL FS_NOTAIL_FL /* persistent flags that file inherits from the parent directory */ #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \ REISERFS_SYNC_FL | \ REISERFS_NOATIME_FL | \ REISERFS_NODUMP_FL | \ REISERFS_SECRM_FL | \ REISERFS_COMPR_FL | \ REISERFS_NOTAIL_FL ) /* Stat Data on disk (reiserfs version of UFS disk inode minus the address blocks) */ struct stat_data { __le16 sd_mode; /* file type, permissions */ __le16 sd_attrs; /* persistent inode flags */ __le32 sd_nlink; /* number of hard links */ __le64 sd_size; /* file size */ __le32 sd_uid; /* owner */ __le32 sd_gid; /* group */ __le32 sd_atime; /* time of last access */ __le32 sd_mtime; /* time file was last modified */ __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */ __le32 sd_blocks; union { __le32 sd_rdev; __le32 sd_generation; //__le32 sd_first_direct_byte; /* first byte of file which is stored in a direct item: except that if it equals 1 it is a symlink and if it equals ~(__u32)0 there is no direct item. The existence of this field really grates on me. Let's replace it with a macro based on sd_size and our tail suppression policy? */ } __attribute__ ((__packed__)) u; } __attribute__ ((__packed__)); // // this is 44 bytes long // #define SD_SIZE (sizeof(struct stat_data)) #define SD_V2_SIZE SD_SIZE #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6) #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode)) #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v)) /* sd_reserved */ /* set_sd_reserved */ #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink)) #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v)) #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size)) #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v)) #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid)) #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v)) #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid)) #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v)) #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime)) #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v)) #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime)) #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v)) #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime)) #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v)) #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks)) #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v)) #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev)) #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v)) #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation)) #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v)) #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs)) #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v)) /***************************************************************************/ /* DIRECTORY STRUCTURE */ /***************************************************************************/ /* Picture represents the structure of directory items ________________________________________________ | Array of | | | | | | | directory |N-1| N-2 | .... | 1st |0th| | entry headers | | | | | | |_______________|___|_____|________|_______|___| <---- directory entries ------> First directory item has k_offset component 1. We store "." and ".." in one item, always, we never split "." and ".." into differing items. This makes, among other things, the code for removing directories simpler. */ #define SD_OFFSET 0 #define SD_UNIQUENESS 0 #define DOT_OFFSET 1 #define DOT_DOT_OFFSET 2 #define DIRENTRY_UNIQUENESS 500 /* */ #define FIRST_ITEM_OFFSET 1 /* Q: How to get key of object pointed to by entry from entry? A: Each directory entry has its header. This header has deh_dir_id and deh_objectid fields, those are key of object, entry points to */ /* NOT IMPLEMENTED: Directory will someday contain stat data of object */ struct reiserfs_de_head { __le32 deh_offset; /* third component of the directory entry key */ __le32 deh_dir_id; /* objectid of the parent directory of the object, that is referenced by directory entry */ __le32 deh_objectid; /* objectid of the object, that is referenced by directory entry */ __le16 deh_location; /* offset of name in the whole item */ __le16 deh_state; /* whether 1) entry contains stat data (for future), and 2) whether entry is hidden (unlinked) */ } __attribute__ ((__packed__)); #define DEH_SIZE sizeof(struct reiserfs_de_head) #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset)) #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id)) #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid)) #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location)) #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state)) #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v))) #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v))) #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v))) #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v))) #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v))) /* empty directory contains two entries "." and ".." and their headers */ #define EMPTY_DIR_SIZE \ (DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen (".."))) /* old format directories have this size when empty */ #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3) #define DEH_Statdata 0 /* not used now */ #define DEH_Visible 2 /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */ #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__) # define ADDR_UNALIGNED_BITS (3) #endif /* These are only used to manipulate deh_state. * Because of this, we'll use the ext2_ bit routines, * since they are little endian */ #ifdef ADDR_UNALIGNED_BITS # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1))) # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3) # define set_bit_unaligned(nr, addr) ext2_set_bit((nr) + unaligned_offset(addr), aligned_address(addr)) # define clear_bit_unaligned(nr, addr) ext2_clear_bit((nr) + unaligned_offset(addr), aligned_address(addr)) # define test_bit_unaligned(nr, addr) ext2_test_bit((nr) + unaligned_offset(addr), aligned_address(addr)) #else # define set_bit_unaligned(nr, addr) ext2_set_bit(nr, addr) # define clear_bit_unaligned(nr, addr) ext2_clear_bit(nr, addr) # define test_bit_unaligned(nr, addr) ext2_test_bit(nr, addr) #endif #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state)) #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state)) #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state)) #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state)) extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid, __le32 par_dirid, __le32 par_objid); extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid, __le32 par_dirid, __le32 par_objid); /* array of the entry headers */ /* get item body */ #define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) ) #define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih))) /* length of the directory entry in directory item. This define calculates length of i-th directory entry using directory entry locations from dir entry head. When it calculates length of 0-th directory entry, it uses length of whole item in place of entry location of the non-existent following entry in the calculation. See picture above.*/ /* #define I_DEH_N_ENTRY_LENGTH(ih,deh,i) \ ((i) ? (deh_location((deh)-1) - deh_location((deh))) : (ih_item_len((ih)) - deh_location((deh)))) */ static inline int entry_length(const struct buffer_head *bh, const struct item_head *ih, int pos_in_item) { struct reiserfs_de_head *deh; deh = B_I_DEH(bh, ih) + pos_in_item; if (pos_in_item) return deh_location(deh - 1) - deh_location(deh); return ih_item_len(ih) - deh_location(deh); } /* number of entries in the directory item, depends on ENTRY_COUNT being at the start of directory dynamic data. */ #define I_ENTRY_COUNT(ih) (ih_entry_count((ih))) /* name by bh, ih and entry_num */ #define B_I_E_NAME(bh,ih,entry_num) ((char *)(bh->b_data + ih_location(ih) + deh_location(B_I_DEH(bh,ih)+(entry_num)))) // two entries per block (at least) #define REISERFS_MAX_NAME(block_size) 255 /* this structure is used for operations on directory entries. It is not a disk structure. */ /* When reiserfs_find_entry or search_by_entry_key find directory entry, they return filled reiserfs_dir_entry structure */ struct reiserfs_dir_entry { struct buffer_head *de_bh; int de_item_num; struct item_head *de_ih; int de_entry_num; struct reiserfs_de_head *de_deh; int de_entrylen; int de_namelen; char *de_name; unsigned long *de_gen_number_bit_string; __u32 de_dir_id; __u32 de_objectid; struct cpu_key de_entry_key; }; /* these defines are useful when a particular member of a reiserfs_dir_entry is needed */ /* pointer to file name, stored in entry */ #define B_I_DEH_ENTRY_FILE_NAME(bh,ih,deh) (B_I_PITEM (bh, ih) + deh_location(deh)) /* length of name */ #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \ (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0)) /* hash value occupies bits from 7 up to 30 */ #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL) /* generation number occupies 7 bits starting from 0 up to 6 */ #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL) #define MAX_GENERATION_NUMBER 127 #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number)) /* * Picture represents an internal node of the reiserfs tree * ______________________________________________________ * | | Array of | Array of | Free | * |block | keys | pointers | space | * | head | N | N+1 | | * |______|_______________|___________________|___________| */ /***************************************************************************/ /* DISK CHILD */ /***************************************************************************/ /* Disk child pointer: The pointer from an internal node of the tree to a node that is on disk. */ struct disk_child { __le32 dc_block_number; /* Disk child's block number. */ __le16 dc_size; /* Disk child's used space. */ __le16 dc_reserved; }; #define DC_SIZE (sizeof(struct disk_child)) #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number)) #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size)) #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0) #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0) /* Get disk child by buffer header and position in the tree node. */ #define B_N_CHILD(bh, n_pos) ((struct disk_child *)\ ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos))) /* Get disk child number by buffer header and position in the tree node. */ #define B_N_CHILD_NUM(bh, n_pos) (dc_block_number(B_N_CHILD(bh, n_pos))) #define PUT_B_N_CHILD_NUM(bh, n_pos, val) \ (put_dc_block_number(B_N_CHILD(bh, n_pos), val)) /* maximal value of field child_size in structure disk_child */ /* child size is the combined size of all items and their headers */ #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE )) /* amount of used space in buffer (not including block head) */ #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur))) /* max and min number of keys in internal node */ #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) ) #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2) /***************************************************************************/ /* PATH STRUCTURES AND DEFINES */ /***************************************************************************/ /* Search_by_key fills up the path from the root to the leaf as it descends the tree looking for the key. It uses reiserfs_bread to try to find buffers in the cache given their block number. If it does not find them in the cache it reads them from disk. For each node search_by_key finds using reiserfs_bread it then uses bin_search to look through that node. bin_search will find the position of the block_number of the next node if it is looking through an internal node. If it is looking through a leaf node bin_search will find the position of the item which has key either equal to given key, or which is the maximal key less than the given key. */ struct path_element { struct buffer_head *pe_buffer; /* Pointer to the buffer at the path in the tree. */ int pe_position; /* Position in the tree node which is placed in the */ /* buffer above. */ }; #define MAX_HEIGHT 5 /* maximal height of a tree. don't change this without changing JOURNAL_PER_BALANCE_CNT */ #define EXTENDED_MAX_HEIGHT 7 /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */ #define FIRST_PATH_ELEMENT_OFFSET 2 /* Must be equal to at least 2. */ #define ILLEGAL_PATH_ELEMENT_OFFSET 1 /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */ #define MAX_FEB_SIZE 6 /* this MUST be MAX_HEIGHT + 1. See about FEB below */ /* We need to keep track of who the ancestors of nodes are. When we perform a search we record which nodes were visited while descending the tree looking for the node we searched for. This list of nodes is called the path. This information is used while performing balancing. Note that this path information may become invalid, and this means we must check it when using it to see if it is still valid. You'll need to read search_by_key and the comments in it, especially about decrement_counters_in_path(), to understand this structure. Paths make the code so much harder to work with and debug.... An enormous number of bugs are due to them, and trying to write or modify code that uses them just makes my head hurt. They are based on an excessive effort to avoid disturbing the precious VFS code.:-( The gods only know how we are going to SMP the code that uses them. znodes are the way! */ #define PATH_READA 0x1 /* do read ahead */ #define PATH_READA_BACK 0x2 /* read backwards */ struct treepath { int path_length; /* Length of the array above. */ int reada; struct path_element path_elements[EXTENDED_MAX_HEIGHT]; /* Array of the path elements. */ int pos_in_item; }; #define pos_in_item(path) ((path)->pos_in_item) #define INITIALIZE_PATH(var) \ struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,} /* Get path element by path and path position. */ #define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset)) /* Get buffer header at the path by path and path position. */ #define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer) /* Get position in the element at the path by path and path position. */ #define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position) #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length)) /* you know, to the person who didn't write this the macro name does not at first suggest what it does. Maybe POSITION_FROM_PATH_END? Or maybe we should just focus on dumping paths... -Hans */ #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length)) #define PATH_PITEM_HEAD(path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path)) /* in do_balance leaf has h == 0 in contrast with path structure, where root has level == 0. That is why we need these defines */ #define PATH_H_PBUFFER(path, h) PATH_OFFSET_PBUFFER (path, path->path_length - (h)) /* tb->S[h] */ #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1) /* tb->F[h] or tb->S[0]->b_parent */ #define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h)) #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1) /* tb->S[h]->b_item_order */ #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h)) #define get_last_bh(path) PATH_PLAST_BUFFER(path) #define get_ih(path) PATH_PITEM_HEAD(path) #define get_item_pos(path) PATH_LAST_POSITION(path) #define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path))) #define item_moved(ih,path) comp_items(ih, path) #define path_changed(ih,path) comp_items (ih, path) /***************************************************************************/ /* MISC */ /***************************************************************************/ /* Size of pointer to the unformatted node. */ #define UNFM_P_SIZE (sizeof(unp_t)) #define UNFM_P_SHIFT 2 // in in-core inode key is stored on le form #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key)) #define MAX_UL_INT 0xffffffff #define MAX_INT 0x7ffffff #define MAX_US_INT 0xffff // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset #define U32_MAX (~(__u32)0) static inline loff_t max_reiserfs_offset(struct inode *inode) { if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5) return (loff_t) U32_MAX; return (loff_t) ((~(__u64) 0) >> 4); } /*#define MAX_KEY_UNIQUENESS MAX_UL_INT*/ #define MAX_KEY_OBJECTID MAX_UL_INT #define MAX_B_NUM MAX_UL_INT #define MAX_FC_NUM MAX_US_INT /* the purpose is to detect overflow of an unsigned short */ #define REISERFS_LINK_MAX (MAX_US_INT - 1000) /* The following defines are used in reiserfs_insert_item and reiserfs_append_item */ #define REISERFS_KERNEL_MEM 0 /* reiserfs kernel memory mode */ #define REISERFS_USER_MEM 1 /* reiserfs user memory mode */ #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter) #define get_generation(s) atomic_read (&fs_generation(s)) #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen) #define __fs_changed(gen,s) (gen != get_generation (s)) #define fs_changed(gen,s) ({cond_resched(); __fs_changed(gen, s);}) /***************************************************************************/ /* FIXATE NODES */ /***************************************************************************/ #define VI_TYPE_LEFT_MERGEABLE 1 #define VI_TYPE_RIGHT_MERGEABLE 2 /* To make any changes in the tree we always first find node, that contains item to be changed/deleted or place to insert a new item. We call this node S. To do balancing we need to decide what we will shift to left/right neighbor, or to a new node, where new item will be etc. To make this analysis simpler we build virtual node. Virtual node is an array of items, that will replace items of node S. (For instance if we are going to delete an item, virtual node does not contain it). Virtual node keeps information about item sizes and types, mergeability of first and last items, sizes of all entries in directory item. We use this array of items when calculating what we can shift to neighbors and how many nodes we have to have if we do not any shiftings, if we shift to left/right neighbor or to both. */ struct virtual_item { int vi_index; // index in the array of item operations unsigned short vi_type; // left/right mergeability unsigned short vi_item_len; /* length of item that it will have after balancing */ struct item_head *vi_ih; const char *vi_item; // body of item (old or new) const void *vi_new_data; // 0 always but paste mode void *vi_uarea; // item specific area }; struct virtual_node { char *vn_free_ptr; /* this is a pointer to the free space in the buffer */ unsigned short vn_nr_item; /* number of items in virtual node */ short vn_size; /* size of node , that node would have if it has unlimited size and no balancing is performed */ short vn_mode; /* mode of balancing (paste, insert, delete, cut) */ short vn_affected_item_num; short vn_pos_in_item; struct item_head *vn_ins_ih; /* item header of inserted item, 0 for other modes */ const void *vn_data; struct virtual_item *vn_vi; /* array of items (including a new one, excluding item to be deleted) */ }; /* used by directory items when creating virtual nodes */ struct direntry_uarea { int flags; __u16 entry_count; __u16 entry_sizes[1]; } __attribute__ ((__packed__)); /***************************************************************************/ /* TREE BALANCE */ /***************************************************************************/ /* This temporary structure is used in tree balance algorithms, and constructed as we go to the extent that its various parts are needed. It contains arrays of nodes that can potentially be involved in the balancing of node S, and parameters that define how each of the nodes must be balanced. Note that in these algorithms for balancing the worst case is to need to balance the current node S and the left and right neighbors and all of their parents plus create a new node. We implement S1 balancing for the leaf nodes and S0 balancing for the internal nodes (S1 and S0 are defined in our papers.)*/ #define MAX_FREE_BLOCK 7 /* size of the array of buffers to free at end of do_balance */ /* maximum number of FEB blocknrs on a single level */ #define MAX_AMOUNT_NEEDED 2 /* someday somebody will prefix every field in this struct with tb_ */ struct tree_balance { int tb_mode; int need_balance_dirty; struct super_block *tb_sb; struct reiserfs_transaction_handle *transaction_handle; struct treepath *tb_path; struct buffer_head *L[MAX_HEIGHT]; /* array of left neighbors of nodes in the path */ struct buffer_head *R[MAX_HEIGHT]; /* array of right neighbors of nodes in the path */ struct buffer_head *FL[MAX_HEIGHT]; /* array of fathers of the left neighbors */ struct buffer_head *FR[MAX_HEIGHT]; /* array of fathers of the right neighbors */ struct buffer_head *CFL[MAX_HEIGHT]; /* array of common parents of center node and its left neighbor */ struct buffer_head *CFR[MAX_HEIGHT]; /* array of common parents of center node and its right neighbor */ struct buffer_head *FEB[MAX_FEB_SIZE]; /* array of empty buffers. Number of buffers in array equals cur_blknum. */ struct buffer_head *used[MAX_FEB_SIZE]; struct buffer_head *thrown[MAX_FEB_SIZE]; int lnum[MAX_HEIGHT]; /* array of number of items which must be shifted to the left in order to balance the current node; for leaves includes item that will be partially shifted; for internal nodes, it is the number of child pointers rather than items. It includes the new item being created. The code sometimes subtracts one to get the number of wholly shifted items for other purposes. */ int rnum[MAX_HEIGHT]; /* substitute right for left in comment above */ int lkey[MAX_HEIGHT]; /* array indexed by height h mapping the key delimiting L[h] and S[h] to its item number within the node CFL[h] */ int rkey[MAX_HEIGHT]; /* substitute r for l in comment above */ int insert_size[MAX_HEIGHT]; /* the number of bytes by we are trying to add or remove from S[h]. A negative value means removing. */ int blknum[MAX_HEIGHT]; /* number of nodes that will replace node S[h] after balancing on the level h of the tree. If 0 then S is being deleted, if 1 then S is remaining and no new nodes are being created, if 2 or 3 then 1 or 2 new nodes is being created */ /* fields that are used only for balancing leaves of the tree */ int cur_blknum; /* number of empty blocks having been already allocated */ int s0num; /* number of items that fall into left most node when S[0] splits */ int s1num; /* number of items that fall into first new node when S[0] splits */ int s2num; /* number of items that fall into second new node when S[0] splits */ int lbytes; /* number of bytes which can flow to the left neighbor from the left */ /* most liquid item that cannot be shifted from S[0] entirely */ /* if -1 then nothing will be partially shifted */ int rbytes; /* number of bytes which will flow to the right neighbor from the right */ /* most liquid item that cannot be shifted from S[0] entirely */ /* if -1 then nothing will be partially shifted */ int s1bytes; /* number of bytes which flow to the first new node when S[0] splits */ /* note: if S[0] splits into 3 nodes, then items do not need to be cut */ int s2bytes; struct buffer_head *buf_to_free[MAX_FREE_BLOCK]; /* buffers which are to be freed after do_balance finishes by unfix_nodes */ char *vn_buf; /* kmalloced memory. Used to create virtual node and keep map of dirtied bitmap blocks */ int vn_buf_size; /* size of the vn_buf */ struct virtual_node *tb_vn; /* VN starts after bitmap of bitmap blocks */ int fs_gen; /* saved value of `reiserfs_generation' counter see FILESYSTEM_CHANGED() macro in reiserfs_fs.h */ #ifdef DISPLACE_NEW_PACKING_LOCALITIES struct in_core_key key; /* key pointer, to pass to block allocator or another low-level subsystem */ #endif }; /* These are modes of balancing */ /* When inserting an item. */ #define M_INSERT 'i' /* When inserting into (directories only) or appending onto an already existant item. */ #define M_PASTE 'p' /* When deleting an item. */ #define M_DELETE 'd' /* When truncating an item or removing an entry from a (directory) item. */ #define M_CUT 'c' /* used when balancing on leaf level skipped (in reiserfsck) */ #define M_INTERNAL 'n' /* When further balancing is not needed, then do_balance does not need to be called. */ #define M_SKIP_BALANCING 's' #define M_CONVERT 'v' /* modes of leaf_move_items */ #define LEAF_FROM_S_TO_L 0 #define LEAF_FROM_S_TO_R 1 #define LEAF_FROM_R_TO_L 2 #define LEAF_FROM_L_TO_R 3 #define LEAF_FROM_S_TO_SNEW 4 #define FIRST_TO_LAST 0 #define LAST_TO_FIRST 1 /* used in do_balance for passing parent of node information that has been gotten from tb struct */ struct buffer_info { struct tree_balance *tb; struct buffer_head *bi_bh; struct buffer_head *bi_parent; int bi_position; }; static inline struct super_block *sb_from_tb(struct tree_balance *tb) { return tb ? tb->tb_sb : NULL; } static inline struct super_block *sb_from_bi(struct buffer_info *bi) { return bi ? sb_from_tb(bi->tb) : NULL; } /* there are 4 types of items: stat data, directory item, indirect, direct. +-------------------+------------+--------------+------------+ | | k_offset | k_uniqueness | mergeable? | +-------------------+------------+--------------+------------+ | stat data | 0 | 0 | no | +-------------------+------------+--------------+------------+ | 1st directory item| DOT_OFFSET |DIRENTRY_UNIQUENESS| no | | non 1st directory | hash value | | yes | | item | | | | +-------------------+------------+--------------+------------+ | indirect item | offset + 1 |TYPE_INDIRECT | if this is not the first indirect item of the object +-------------------+------------+--------------+------------+ | direct item | offset + 1 |TYPE_DIRECT | if not this is not the first direct item of the object +-------------------+------------+--------------+------------+ */ struct item_operations { int (*bytes_number) (struct item_head * ih, int block_size); void (*decrement_key) (struct cpu_key *); int (*is_left_mergeable) (struct reiserfs_key * ih, unsigned long bsize); void (*print_item) (struct item_head *, char *item); void (*check_item) (struct item_head *, char *item); int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi, int is_affected, int insert_size); int (*check_left) (struct virtual_item * vi, int free, int start_skip, int end_skip); int (*check_right) (struct virtual_item * vi, int free); int (*part_size) (struct virtual_item * vi, int from, int to); int (*unit_num) (struct virtual_item * vi); void (*print_vi) (struct virtual_item * vi); }; extern struct item_operations *item_ops[TYPE_ANY + 1]; #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize) #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize) #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item) #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item) #define op_create_vi(vn,vi,is_affected,insert_size) item_ops[le_ih_k_type ((vi)->vi_ih)]->create_vi (vn,vi,is_affected,insert_size) #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip) #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free) #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to) #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi) #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi) #define COMP_SHORT_KEYS comp_short_keys /* number of blocks pointed to by the indirect item */ #define I_UNFM_NUM(ih) (ih_item_len(ih) / UNFM_P_SIZE) /* the used space within the unformatted node corresponding to pos within the item pointed to by ih */ #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size)) /* number of bytes contained by the direct item or the unformatted nodes the indirect item points to */ /* get the item header */ #define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) ) /* get key */ #define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) ) /* get the key */ #define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) ) /* get item body */ #define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num)))) /* get the stat data by the buffer header and the item order */ #define B_N_STAT_DATA(bh,nr) \ ( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) ) /* following defines use reiserfs buffer header and item header */ /* get stat-data */ #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) ) // this is 3976 for size==4096 #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE) /* indirect items consist of entries which contain blocknrs, pos indicates which entry, and B_I_POS_UNFM_POINTER resolves to the blocknr contained by the entry pos points to */ #define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos))) #define PUT_B_I_POS_UNFM_POINTER(bh,ih,pos, val) do {*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)) = cpu_to_le32(val); } while (0) struct reiserfs_iget_args { __u32 objectid; __u32 dirid; }; /***************************************************************************/ /* FUNCTION DECLARATIONS */ /***************************************************************************/ #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12) #define journal_trans_half(blocksize) \ ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32)) /* journal.c see journal.c for all the comments here */ /* first block written in a commit. */ struct reiserfs_journal_desc { __le32 j_trans_id; /* id of commit */ __le32 j_len; /* length of commit. len +1 is the commit block */ __le32 j_mount_id; /* mount id of this trans */ __le32 j_realblock[1]; /* real locations for each block */ }; #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id) #define get_desc_trans_len(d) le32_to_cpu((d)->j_len) #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id) #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0) #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0) #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0) /* last block written in a commit */ struct reiserfs_journal_commit { __le32 j_trans_id; /* must match j_trans_id from the desc block */ __le32 j_len; /* ditto */ __le32 j_realblock[1]; /* real locations for each block */ }; #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id) #define get_commit_trans_len(c) le32_to_cpu((c)->j_len) #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id) #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0) #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0) /* this header block gets written whenever a transaction is considered fully flushed, and is more recent than the ** last fully flushed transaction. fully flushed means all the log blocks and all the real blocks are on disk, ** and this transaction does not need to be replayed. */ struct reiserfs_journal_header { __le32 j_last_flush_trans_id; /* id of last fully flushed transaction */ __le32 j_first_unflushed_offset; /* offset in the log of where to start replay after a crash */ __le32 j_mount_id; /* 12 */ struct journal_params jh_journal; }; /* biggest tunable defines are right here */ #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */ #define JOURNAL_TRANS_MAX_DEFAULT 1024 /* biggest possible single transaction, don't change for now (8/3/99) */ #define JOURNAL_TRANS_MIN_DEFAULT 256 #define JOURNAL_MAX_BATCH_DEFAULT 900 /* max blocks to batch into one transaction, don't make this any bigger than 900 */ #define JOURNAL_MIN_RATIO 2 #define JOURNAL_MAX_COMMIT_AGE 30 #define JOURNAL_MAX_TRANS_AGE 30 #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9) #define JOURNAL_BLOCKS_PER_OBJECT(sb) (JOURNAL_PER_BALANCE_CNT * 3 + \ 2 * (REISERFS_QUOTA_INIT_BLOCKS(sb) + \ REISERFS_QUOTA_TRANS_BLOCKS(sb))) #ifdef CONFIG_QUOTA /* We need to update data and inode (atime) */ #define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? 2 : 0) /* 1 balancing, 1 bitmap, 1 data per write + stat data update */ #define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \ (DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0) /* same as with INIT */ #define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \ (DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0) #else #define REISERFS_QUOTA_TRANS_BLOCKS(s) 0 #define REISERFS_QUOTA_INIT_BLOCKS(s) 0 #define REISERFS_QUOTA_DEL_BLOCKS(s) 0 #endif /* both of these can be as low as 1, or as high as you want. The min is the ** number of 4k bitmap nodes preallocated on mount. New nodes are allocated ** as needed, and released when transactions are committed. On release, if ** the current number of nodes is > max, the node is freed, otherwise, ** it is put on a free list for faster use later. */ #define REISERFS_MIN_BITMAP_NODES 10 #define REISERFS_MAX_BITMAP_NODES 100 #define JBH_HASH_SHIFT 13 /* these are based on journal hash size of 8192 */ #define JBH_HASH_MASK 8191 #define _jhashfn(sb,block) \ (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \ (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12)))) #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK]) // We need these to make journal.c code more readable #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) enum reiserfs_bh_state_bits { BH_JDirty = BH_PrivateStart, /* buffer is in current transaction */ BH_JDirty_wait, BH_JNew, /* disk block was taken off free list before * being in a finished transaction, or * written to disk. Can be reused immed. */ BH_JPrepared, BH_JRestore_dirty, BH_JTest, // debugging only will go away }; BUFFER_FNS(JDirty, journaled); TAS_BUFFER_FNS(JDirty, journaled); BUFFER_FNS(JDirty_wait, journal_dirty); TAS_BUFFER_FNS(JDirty_wait, journal_dirty); BUFFER_FNS(JNew, journal_new); TAS_BUFFER_FNS(JNew, journal_new); BUFFER_FNS(JPrepared, journal_prepared); TAS_BUFFER_FNS(JPrepared, journal_prepared); BUFFER_FNS(JRestore_dirty, journal_restore_dirty); TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty); BUFFER_FNS(JTest, journal_test); TAS_BUFFER_FNS(JTest, journal_test); /* ** transaction handle which is passed around for all journal calls */ struct reiserfs_transaction_handle { struct super_block *t_super; /* super for this FS when journal_begin was called. saves calls to reiserfs_get_super also used by nested transactions to make sure they are nesting on the right FS _must_ be first in the handle */ int t_refcount; int t_blocks_logged; /* number of blocks this writer has logged */ int t_blocks_allocated; /* number of blocks this writer allocated */ unsigned int t_trans_id; /* sanity check, equals the current trans id */ void *t_handle_save; /* save existing current->journal_info */ unsigned displace_new_blocks:1; /* if new block allocation occurres, that block should be displaced from others */ struct list_head t_list; }; /* used to keep track of ordered and tail writes, attached to the buffer * head through b_journal_head. */ struct reiserfs_jh { struct reiserfs_journal_list *jl; struct buffer_head *bh; struct list_head list; }; void reiserfs_free_jh(struct buffer_head *bh); int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh); int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh); int journal_mark_dirty(struct reiserfs_transaction_handle *, struct super_block *, struct buffer_head *bh); static inline int reiserfs_file_data_log(struct inode *inode) { if (reiserfs_data_log(inode->i_sb) || (REISERFS_I(inode)->i_flags & i_data_log)) return 1; return 0; } static inline int reiserfs_transaction_running(struct super_block *s) { struct reiserfs_transaction_handle *th = current->journal_info; if (th && th->t_super == s) return 1; if (th && th->t_super == NULL) BUG(); return 0; } static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th) { return th->t_blocks_allocated - th->t_blocks_logged; } struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct super_block *, int count); int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *); int reiserfs_commit_page(struct inode *inode, struct page *page, unsigned from, unsigned to); int reiserfs_flush_old_commits(struct super_block *); int reiserfs_commit_for_inode(struct inode *); int reiserfs_inode_needs_commit(struct inode *); void reiserfs_update_inode_transaction(struct inode *); void reiserfs_wait_on_write_block(struct super_block *s); void reiserfs_block_writes(struct reiserfs_transaction_handle *th); void reiserfs_allow_writes(struct super_block *s); void reiserfs_check_lock_depth(struct super_block *s, char *caller); int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh, int wait); void reiserfs_restore_prepared_buffer(struct super_block *, struct buffer_head *bh); int journal_init(struct super_block *, const char *j_dev_name, int old_format, unsigned int); int journal_release(struct reiserfs_transaction_handle *, struct super_block *); int journal_release_error(struct reiserfs_transaction_handle *, struct super_block *); int journal_end(struct reiserfs_transaction_handle *, struct super_block *, unsigned long); int journal_end_sync(struct reiserfs_transaction_handle *, struct super_block *, unsigned long); int journal_mark_freed(struct reiserfs_transaction_handle *, struct super_block *, b_blocknr_t blocknr); int journal_transaction_should_end(struct reiserfs_transaction_handle *, int); int reiserfs_in_journal(struct super_block *sb, unsigned int bmap_nr, int bit_nr, int searchall, b_blocknr_t *next); int journal_begin(struct reiserfs_transaction_handle *, struct super_block *sb, unsigned long); int journal_join_abort(struct reiserfs_transaction_handle *, struct super_block *sb, unsigned long); void reiserfs_abort_journal(struct super_block *sb, int errno); void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...); int reiserfs_allocate_list_bitmaps(struct super_block *s, struct reiserfs_list_bitmap *, unsigned int); void add_save_link(struct reiserfs_transaction_handle *th, struct inode *inode, int truncate); int remove_save_link(struct inode *inode, int truncate); /* objectid.c */ __u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th); void reiserfs_release_objectid(struct reiserfs_transaction_handle *th, __u32 objectid_to_release); int reiserfs_convert_objectid_map_v1(struct super_block *); /* stree.c */ int B_IS_IN_TREE(const struct buffer_head *); extern void copy_item_head(struct item_head *to, const struct item_head *from); // first key is in cpu form, second - le extern int comp_short_keys(const struct reiserfs_key *le_key, const struct cpu_key *cpu_key); extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from); // both are in le form extern int comp_le_keys(const struct reiserfs_key *, const struct reiserfs_key *); extern int comp_short_le_keys(const struct reiserfs_key *, const struct reiserfs_key *); // // get key version from on disk key - kludge // static inline int le_key_version(const struct reiserfs_key *key) { int type; type = offset_v2_k_type(&(key->u.k_offset_v2)); if (type != TYPE_DIRECT && type != TYPE_INDIRECT && type != TYPE_DIRENTRY) return KEY_FORMAT_3_5; return KEY_FORMAT_3_6; } static inline void copy_key(struct reiserfs_key *to, const struct reiserfs_key *from) { memcpy(to, from, KEY_SIZE); } int comp_items(const struct item_head *stored_ih, const struct treepath *path); const struct reiserfs_key *get_rkey(const struct treepath *chk_path, const struct super_block *sb); int search_by_key(struct super_block *, const struct cpu_key *, struct treepath *, int); #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL) int search_for_position_by_key(struct super_block *sb, const struct cpu_key *cpu_key, struct treepath *search_path); extern void decrement_bcount(struct buffer_head *bh); void decrement_counters_in_path(struct treepath *search_path); void pathrelse(struct treepath *search_path); int reiserfs_check_path(struct treepath *p); void pathrelse_and_restore(struct super_block *s, struct treepath *search_path); int reiserfs_insert_item(struct reiserfs_transaction_handle *th, struct treepath *path, const struct cpu_key *key, struct item_head *ih, struct inode *inode, const char *body); int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th, struct treepath *path, const struct cpu_key *key, struct inode *inode, const char *body, int paste_size); int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th, struct treepath *path, struct cpu_key *key, struct inode *inode, struct page *page, loff_t new_file_size); int reiserfs_delete_item(struct reiserfs_transaction_handle *th, struct treepath *path, const struct cpu_key *key, struct inode *inode, struct buffer_head *un_bh); void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th, struct inode *inode, struct reiserfs_key *key); int reiserfs_delete_object(struct reiserfs_transaction_handle *th, struct inode *inode); int reiserfs_do_truncate(struct reiserfs_transaction_handle *th, struct inode *inode, struct page *, int update_timestamps); #define i_block_size(inode) ((inode)->i_sb->s_blocksize) #define file_size(inode) ((inode)->i_size) #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1)) #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\ !STORE_TAIL_IN_UNFM_S1(file_size (inode), tail_size(inode), inode->i_sb->s_blocksize):have_small_tails ((inode)->i_sb)?!STORE_TAIL_IN_UNFM_S2(file_size (inode), tail_size(inode), inode->i_sb->s_blocksize):0 ) void padd_item(char *item, int total_length, int length); /* inode.c */ /* args for the create parameter of reiserfs_get_block */ #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */ #define GET_BLOCK_CREATE 1 /* add anything you need to find block */ #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */ #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */ #define GET_BLOCK_NO_IMUX 8 /* i_mutex is not held, don't preallocate */ #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */ void reiserfs_read_locked_inode(struct inode *inode, struct reiserfs_iget_args *args); int reiserfs_find_actor(struct inode *inode, void *p); int reiserfs_init_locked_inode(struct inode *inode, void *p); void reiserfs_delete_inode(struct inode *inode); int reiserfs_write_inode(struct inode *inode, struct writeback_control *wbc); int reiserfs_get_block(struct inode *inode, sector_t block, struct buffer_head *bh_result, int create); struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid, int fh_len, int fh_type); struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid, int fh_len, int fh_type); int reiserfs_encode_fh(struct dentry *dentry, __u32 * data, int *lenp, int connectable); int reiserfs_truncate_file(struct inode *, int update_timestamps); void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset, int type, int key_length); void make_le_item_head(struct item_head *ih, const struct cpu_key *key, int version, loff_t offset, int type, int length, int entry_count); struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key); struct reiserfs_security_handle; int reiserfs_new_inode(struct reiserfs_transaction_handle *th, struct inode *dir, int mode, const char *symname, loff_t i_size, struct dentry *dentry, struct inode *inode, struct reiserfs_security_handle *security); void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th, struct inode *inode, loff_t size); static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th, struct inode *inode) { reiserfs_update_sd_size(th, inode, inode->i_size); } void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode); void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs); int reiserfs_setattr(struct dentry *dentry, struct iattr *attr); /* namei.c */ void set_de_name_and_namelen(struct reiserfs_dir_entry *de); int search_by_entry_key(struct super_block *sb, const struct cpu_key *key, struct treepath *path, struct reiserfs_dir_entry *de); struct dentry *reiserfs_get_parent(struct dentry *); /* procfs.c */ #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO ) #define REISERFS_PROC_INFO #else #undef REISERFS_PROC_INFO #endif int reiserfs_proc_info_init(struct super_block *sb); int reiserfs_proc_info_done(struct super_block *sb); struct proc_dir_entry *reiserfs_proc_register_global(char *name, read_proc_t * func); void reiserfs_proc_unregister_global(const char *name); int reiserfs_proc_info_global_init(void); int reiserfs_proc_info_global_done(void); int reiserfs_global_version_in_proc(char *buffer, char **start, off_t offset, int count, int *eof, void *data); #if defined( REISERFS_PROC_INFO ) #define PROC_EXP( e ) e #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data #define PROC_INFO_MAX( sb, field, value ) \ __PINFO( sb ).field = \ max( REISERFS_SB( sb ) -> s_proc_info_data.field, value ) #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) ) #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) ) #define PROC_INFO_BH_STAT( sb, bh, level ) \ PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \ PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \ PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) ) #else #define PROC_EXP( e ) #define VOID_V ( ( void ) 0 ) #define PROC_INFO_MAX( sb, field, value ) VOID_V #define PROC_INFO_INC( sb, field ) VOID_V #define PROC_INFO_ADD( sb, field, val ) VOID_V #define PROC_INFO_BH_STAT(sb, bh, n_node_level) VOID_V #endif /* dir.c */ extern const struct inode_operations reiserfs_dir_inode_operations; extern const struct inode_operations reiserfs_symlink_inode_operations; extern const struct inode_operations reiserfs_special_inode_operations; extern const struct file_operations reiserfs_dir_operations; int reiserfs_readdir_dentry(struct dentry *, void *, filldir_t, loff_t *); /* tail_conversion.c */ int direct2indirect(struct reiserfs_transaction_handle *, struct inode *, struct treepath *, struct buffer_head *, loff_t); int indirect2direct(struct reiserfs_transaction_handle *, struct inode *, struct page *, struct treepath *, const struct cpu_key *, loff_t, char *); void reiserfs_unmap_buffer(struct buffer_head *); /* file.c */ extern const struct inode_operations reiserfs_file_inode_operations; extern const struct file_operations reiserfs_file_operations; extern const struct address_space_operations reiserfs_address_space_operations; /* fix_nodes.c */ int fix_nodes(int n_op_mode, struct tree_balance *tb, struct item_head *ins_ih, const void *); void unfix_nodes(struct tree_balance *); /* prints.c */ void __reiserfs_panic(struct super_block *s, const char *id, const char *function, const char *fmt, ...) __attribute__ ((noreturn)); #define reiserfs_panic(s, id, fmt, args...) \ __reiserfs_panic(s, id, __func__, fmt, ##args) void __reiserfs_error(struct super_block *s, const char *id, const char *function, const char *fmt, ...); #define reiserfs_error(s, id, fmt, args...) \ __reiserfs_error(s, id, __func__, fmt, ##args) void reiserfs_info(struct super_block *s, const char *fmt, ...); void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...); void print_indirect_item(struct buffer_head *bh, int item_num); void store_print_tb(struct tree_balance *tb); void print_cur_tb(char *mes); void print_de(struct reiserfs_dir_entry *de); void print_bi(struct buffer_info *bi, char *mes); #define PRINT_LEAF_ITEMS 1 /* print all items */ #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */ #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */ void print_block(struct buffer_head *bh, ...); void print_bmap(struct super_block *s, int silent); void print_bmap_block(int i, char *data, int size, int silent); /*void print_super_block (struct super_block * s, char * mes);*/ void print_objectid_map(struct super_block *s); void print_block_head(struct buffer_head *bh, char *mes); void check_leaf(struct buffer_head *bh); void check_internal(struct buffer_head *bh); void print_statistics(struct super_block *s); char *reiserfs_hashname(int code); /* lbalance.c */ int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num, int mov_bytes, struct buffer_head *Snew); int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes); int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes); void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first, int del_num, int del_bytes); void leaf_insert_into_buf(struct buffer_info *bi, int before, struct item_head *inserted_item_ih, const char *inserted_item_body, int zeros_number); void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num, int pos_in_item, int paste_size, const char *body, int zeros_number); void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, int pos_in_item, int cut_size); void leaf_paste_entries(struct buffer_info *bi, int item_num, int before, int new_entry_count, struct reiserfs_de_head *new_dehs, const char *records, int paste_size); /* ibalance.c */ int balance_internal(struct tree_balance *, int, int, struct item_head *, struct buffer_head **); /* do_balance.c */ void do_balance_mark_leaf_dirty(struct tree_balance *tb, struct buffer_head *bh, int flag); #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty void do_balance(struct tree_balance *tb, struct item_head *ih, const char *body, int flag); void reiserfs_invalidate_buffer(struct tree_balance *tb, struct buffer_head *bh); int get_left_neighbor_position(struct tree_balance *tb, int h); int get_right_neighbor_position(struct tree_balance *tb, int h); void replace_key(struct tree_balance *tb, struct buffer_head *, int, struct buffer_head *, int); void make_empty_node(struct buffer_info *); struct buffer_head *get_FEB(struct tree_balance *); /* bitmap.c */ /* structure contains hints for block allocator, and it is a container for * arguments, such as node, search path, transaction_handle, etc. */ struct __reiserfs_blocknr_hint { struct inode *inode; /* inode passed to allocator, if we allocate unf. nodes */ sector_t block; /* file offset, in blocks */ struct in_core_key key; struct treepath *path; /* search path, used by allocator to deternine search_start by * various ways */ struct reiserfs_transaction_handle *th; /* transaction handle is needed to log super blocks and * bitmap blocks changes */ b_blocknr_t beg, end; b_blocknr_t search_start; /* a field used to transfer search start value (block number) * between different block allocator procedures * (determine_search_start() and others) */ int prealloc_size; /* is set in determine_prealloc_size() function, used by underlayed * function that do actual allocation */ unsigned formatted_node:1; /* the allocator uses different polices for getting disk space for * formatted/unformatted blocks with/without preallocation */ unsigned preallocate:1; }; typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t; int reiserfs_parse_alloc_options(struct super_block *, char *); void reiserfs_init_alloc_options(struct super_block *s); /* * given a directory, this will tell you what packing locality * to use for a new object underneat it. The locality is returned * in disk byte order (le). */ __le32 reiserfs_choose_packing(struct inode *dir); int reiserfs_init_bitmap_cache(struct super_block *sb); void reiserfs_free_bitmap_cache(struct super_block *sb); void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info); struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap); int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value); void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *, b_blocknr_t, int for_unformatted); int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int, int); static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb, b_blocknr_t * new_blocknrs, int amount_needed) { reiserfs_blocknr_hint_t hint = { .th = tb->transaction_handle, .path = tb->tb_path, .inode = NULL, .key = tb->key, .block = 0, .formatted_node = 1 }; return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed, 0); } static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle *th, struct inode *inode, b_blocknr_t * new_blocknrs, struct treepath *path, sector_t block) { reiserfs_blocknr_hint_t hint = { .th = th, .path = path, .inode = inode, .block = block, .formatted_node = 0, .preallocate = 0 }; return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0); } #ifdef REISERFS_PREALLOCATE static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle *th, struct inode *inode, b_blocknr_t * new_blocknrs, struct treepath *path, sector_t block) { reiserfs_blocknr_hint_t hint = { .th = th, .path = path, .inode = inode, .block = block, .formatted_node = 0, .preallocate = 1 }; return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0); } void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th, struct inode *inode); void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th); #endif /* hashes.c */ __u32 keyed_hash(const signed char *msg, int len); __u32 yura_hash(const signed char *msg, int len); __u32 r5_hash(const signed char *msg, int len); /* the ext2 bit routines adjust for big or little endian as ** appropriate for the arch, so in our laziness we use them rather ** than using the bit routines they call more directly. These ** routines must be used when changing on disk bitmaps. */ #define reiserfs_test_and_set_le_bit ext2_set_bit #define reiserfs_test_and_clear_le_bit ext2_clear_bit #define reiserfs_test_le_bit ext2_test_bit #define reiserfs_find_next_zero_le_bit ext2_find_next_zero_bit /* sometimes reiserfs_truncate may require to allocate few new blocks to perform indirect2direct conversion. People probably used to think, that truncate should work without problems on a filesystem without free disk space. They may complain that they can not truncate due to lack of free disk space. This spare space allows us to not worry about it. 500 is probably too much, but it should be absolutely safe */ #define SPARE_SPACE 500 /* prototypes from ioctl.c */ int reiserfs_ioctl(struct inode *inode, struct file *filp, unsigned int cmd, unsigned long arg); long reiserfs_compat_ioctl(struct file *filp, unsigned int cmd, unsigned long arg); int reiserfs_unpack(struct inode *inode, struct file *filp); #endif /* __KERNEL__ */ #endif /* _LINUX_REISER_FS_H */

N4m3	5!z3	L45t M0d!f!3d	0wn3r / Gr0up	P3Rm!55!0n5	0pt!0n5
..	--	May 30 2015 10:47:13	0 / 0	0755
amba	--	May 30 2015 10:47:11	0 / 0	0755
bcma	--	May 30 2015 10:47:11	0 / 0	0755
byteorder	--	May 30 2015 10:47:11	0 / 0	0755
can	--	May 30 2015 10:47:11	0 / 0	0755
crypto	--	May 30 2015 10:47:11	0 / 0	0755
decompress	--	May 30 2015 10:47:11	0 / 0	0755
dvb	--	May 30 2015 10:47:12	0 / 0	0755
hdlc	--	May 30 2015 10:47:12	0 / 0	0755
i2c	--	May 30 2015 10:47:12	0 / 0	0755
input	--	May 30 2015 10:47:12	0 / 0	0755
isdn	--	May 30 2015 10:47:12	0 / 0	0755
lockd	--	May 30 2015 10:47:12	0 / 0	0755
mfd	--	May 30 2015 10:47:12	0 / 0	0755
mlx4	--	May 30 2015 10:47:12	0 / 0	0755
mlx5	--	May 30 2015 10:47:12	0 / 0	0755
mmc	--	May 30 2015 10:47:12	0 / 0	0755
mtd	--	May 30 2015 10:47:12	0 / 0	0755
netfilter	--	May 30 2015 10:47:12	0 / 0	0755
netfilter_arp	--	May 30 2015 10:47:12	0 / 0	0755
netfilter_bridge	--	May 30 2015 10:47:12	0 / 0	0755
netfilter_ipv4	--	May 30 2015 10:47:12	0 / 0	0755
netfilter_ipv6	--	May 30 2015 10:47:12	0 / 0	0755
nfsd	--	May 30 2015 10:47:12	0 / 0	0755
raid	--	May 30 2015 10:47:12	0 / 0	0755
regulator	--	May 30 2015 10:47:12	0 / 0	0755
rtc	--	May 30 2015 10:47:12	0 / 0	0755
spi	--	May 30 2015 10:47:12	0 / 0	0755
ssb	--	May 30 2015 10:47:12	0 / 0	0755
sunrpc	--	May 30 2015 10:47:12	0 / 0	0755
tc_act	--	May 30 2015 10:47:12	0 / 0	0755
tc_ematch	--	May 30 2015 10:47:12	0 / 0	0755
unaligned	--	May 30 2015 10:47:12	0 / 0	0755
usb	--	May 30 2015 10:47:12	0 / 0	0755
uwb	--	May 30 2015 10:47:12	0 / 0	0755
wimax	--	May 30 2015 10:47:12	0 / 0	0755

8250_pci.h	0.976 KB	December 03 2009 03:51:21	0 / 0	0644
Kbuild	8.637 KB	March 10 2015 20:24:13	0 / 0	0644
a.out.h	7.26 KB	December 03 2009 03:51:21	0 / 0	0644
ac97_codec.h	14.761 KB	December 03 2009 03:51:21	0 / 0	0644
acct.h	5.81 KB	December 03 2009 03:51:21	0 / 0	0644
acpi.h	13.113 KB	March 10 2015 20:24:13	0 / 0	0644
acpi_io.h	0.447 KB	March 10 2015 20:23:27	0 / 0	0644
acpi_pmtmr.h	0.656 KB	December 03 2009 03:51:21	0 / 0	0644
adb.h	2.705 KB	December 03 2009 03:51:21	0 / 0	0644
adfs_fs.h	1.306 KB	December 03 2009 03:51:21	0 / 0	0644
aer.h	1.465 KB	March 10 2015 20:23:58	0 / 0	0644
affs_hardblocks.h	1.446 KB	December 03 2009 03:51:21	0 / 0	0644
agp_backend.h	3.451 KB	March 10 2015 20:24:12	0 / 0	0644
agpgart.h	6.413 KB	December 03 2009 03:51:21	0 / 0	0644
aio.h	7.612 KB	March 10 2015 20:22:11	0 / 0	0644
aio_abi.h	2.988 KB	December 03 2009 03:51:21	0 / 0	0644
amifd.h	1.948 KB	December 03 2009 03:51:21	0 / 0	0644
amifdreg.h	2.611 KB	December 03 2009 03:51:21	0 / 0	0644
amigaffs.h	2.858 KB	December 03 2009 03:51:21	0 / 0	0644
anon_inodes.h	0.42 KB	December 03 2009 03:51:21	0 / 0	0644
apm-emulation.h	1.538 KB	December 03 2009 03:51:21	0 / 0	0644
apm_bios.h	5.515 KB	December 03 2009 03:51:21	0 / 0	0644
arcdevice.h	12.427 KB	December 03 2009 03:51:21	0 / 0	0644
arcfb.h	0.146 KB	December 03 2009 03:51:21	0 / 0	0644
async.h	1.789 KB	March 10 2015 20:23:20	0 / 0	0644
async_tx.h	6.766 KB	December 03 2009 03:51:21	0 / 0	0644
ata.h	29.514 KB	March 10 2015 20:24:05	0 / 0	0644
ata_platform.h	0.889 KB	December 03 2009 03:51:21	0 / 0	0644
atalk.h	5.117 KB	December 03 2009 03:51:21	0 / 0	0644
ath9k_platform.h	1.256 KB	March 10 2015 20:23:58	0 / 0	0644
atm.h	7.808 KB	December 03 2009 03:51:21	0 / 0	0644
atm_eni.h	0.571 KB	December 03 2009 03:51:21	0 / 0	0644
atm_he.h	0.335 KB	December 03 2009 03:51:21	0 / 0	0644
atm_idt77105.h	0.871 KB	December 03 2009 03:51:21	0 / 0	0644
atm_nicstar.h	1.187 KB	December 03 2009 03:51:21	0 / 0	0644
atm_suni.h	0.247 KB	December 03 2009 03:51:21	0 / 0	0644
atm_tcp.h	1.727 KB	December 03 2009 03:51:21	0 / 0	0644
atm_zatm.h	1.568 KB	December 03 2009 03:51:21	0 / 0	0644
atmapi.h	0.868 KB	December 03 2009 03:51:21	0 / 0	0644
atmarp.h	1.204 KB	December 03 2009 03:51:21	0 / 0	0644
atmbr2684.h	3.133 KB	December 03 2009 03:51:21	0 / 0	0644
atmclip.h	0.501 KB	December 03 2009 03:51:21	0 / 0	0644
atmdev.h	16.299 KB	December 03 2009 03:51:21	0 / 0	0644
atmel-mci.h	1.239 KB	December 03 2009 03:51:21	0 / 0	0644
atmel-pwm-bl.h	1.514 KB	December 03 2009 03:51:21	0 / 0	0644
atmel-ssc.h	9.149 KB	December 03 2009 03:51:21	0 / 0	0644
atmel_pdc.h	1.377 KB	December 03 2009 03:51:21	0 / 0	0644
atmel_pwm.h	2.66 KB	December 03 2009 03:51:21	0 / 0	0644
atmel_serial.h	5.944 KB	December 03 2009 03:51:21	0 / 0	0644
atmel_tc.h	10.815 KB	December 03 2009 03:51:21	0 / 0	0644
atmioc.h	1.546 KB	December 03 2009 03:51:21	0 / 0	0644
atmlec.h	2.501 KB	December 03 2009 03:51:21	0 / 0	0644
atmmpc.h	4.065 KB	December 03 2009 03:51:21	0 / 0	0644
atmppp.h	0.563 KB	December 03 2009 03:51:21	0 / 0	0644
atmsap.h	4.792 KB	December 03 2009 03:51:21	0 / 0	0644
atmsvc.h	1.748 KB	December 03 2009 03:51:21	0 / 0	0644
atomic.h	0.101 KB	March 10 2015 20:23:24	0 / 0	0644
attribute_container.h	2.477 KB	December 03 2009 03:51:21	0 / 0	0644
audit.h	26.562 KB	March 10 2015 20:24:07	0 / 0	0644
auto_dev-ioctl.h	5.064 KB	December 03 2009 03:51:21	0 / 0	0644
auto_fs.h	2.409 KB	December 03 2009 03:51:21	0 / 0	0644
auto_fs4.h	3.999 KB	March 10 2015 20:22:42	0 / 0	0644
autoconf.h	112.361 KB	April 22 2015 07:17:23	0 / 0	0644
auxvec.h	1.527 KB	December 03 2009 03:51:21	0 / 0	0644
average.h	0.638 KB	March 10 2015 20:23:05	0 / 0	0644
ax25.h	2.688 KB	December 03 2009 03:51:21	0 / 0	0644
b1lli.h	1.615 KB	December 03 2009 03:51:21	0 / 0	0644
b1pcmcia.h	0.65 KB	December 03 2009 03:51:21	0 / 0	0644
backing-dev.h	9.318 KB	March 10 2015 20:23:56	0 / 0	0644
backlight.h	3.865 KB	December 03 2009 03:51:21	0 / 0	0644
baycom.h	0.801 KB	December 03 2009 03:51:21	0 / 0	0644
bcd.h	0.19 KB	December 03 2009 03:51:21	0 / 0	0644
bcm47xx_wdt.h	0.37 KB	March 10 2015 20:23:57	0 / 0	0644
bfs_fs.h	1.787 KB	December 03 2009 03:51:21	0 / 0	0644
binfmts.h	4.403 KB	March 10 2015 20:24:04	0 / 0	0644
bio.h	17.319 KB	March 10 2015 20:24:00	0 / 0	0644
bit_spinlock.h	2.158 KB	December 03 2009 03:51:21	0 / 0	0644
bitmap.h	10.856 KB	March 10 2015 20:23:19	0 / 0	0644
bitops.h	6.452 KB	March 10 2015 20:24:13	0 / 0	0644
bitrev.h	0.264 KB	December 03 2009 03:51:21	0 / 0	0644
blk-iopoll.h	1.163 KB	December 03 2009 03:51:21	0 / 0	0644
blk_types.h	6.939 KB	March 10 2015 20:24:07	0 / 0	0644
blkdev.h	41.365 KB	March 10 2015 20:24:15	0 / 0	0644
blkpg.h	1.532 KB	December 03 2009 03:51:21	0 / 0	0644
blktrace_api.h	7.355 KB	March 10 2015 20:24:02	0 / 0	0644
blockgroup_lock.h	1.137 KB	December 03 2009 03:51:21	0 / 0	0644
bootmem.h	5.052 KB	March 10 2015 20:23:11	0 / 0	0644
bottom_half.h	0.219 KB	December 03 2009 03:51:21	0 / 0	0644
bounds.h	0.264 KB	April 22 2015 06:43:02	0 / 0	0644
bpqether.h	0.93 KB	December 03 2009 03:51:21	0 / 0	0644
brcmphy.h	0.858 KB	March 10 2015 20:21:23	0 / 0	0644
bsg-lib.h	2.09 KB	March 10 2015 20:22:36	0 / 0	0644
bsg.h	3.023 KB	December 03 2009 03:51:21	0 / 0	0644
buffer_head.h	12.333 KB	March 10 2015 20:23:40	0 / 0	0644
bug.h	0.769 KB	December 03 2009 03:51:21	0 / 0	0644
c2port.h	1.746 KB	December 03 2009 03:51:21	0 / 0	0644
cache.h	1.574 KB	December 03 2009 03:51:21	0 / 0	0644
can.h	3.248 KB	December 03 2009 03:51:21	0 / 0	0644
capability.h	17.523 KB	March 10 2015 20:24:12	0 / 0	0644
capi.h	3.018 KB	December 03 2009 03:51:21	0 / 0	0644
cb710.h	5.69 KB	December 03 2009 03:51:21	0 / 0	0644
cciss_ioctl.h	6.646 KB	December 03 2009 03:51:21	0 / 0	0644
cd1400.h	6.894 KB	December 03 2009 03:51:21	0 / 0	0644
cdev.h	0.661 KB	December 03 2009 03:51:21	0 / 0	0644
cdk.h	12.471 KB	December 03 2009 03:51:21	0 / 0	0644
cdrom.h	35.375 KB	December 03 2009 03:51:21	0 / 0	0644
cfag12864b.h	2.097 KB	December 03 2009 03:51:21	0 / 0	0644
cgroup.h	18.665 KB	March 10 2015 20:23:34	0 / 0	0644
cgroup_subsys.h	0.846 KB	March 10 2015 20:22:55	0 / 0	0644
cgroupstats.h	2.104 KB	December 03 2009 03:51:21	0 / 0	0644
chio.h	5.163 KB	December 03 2009 03:51:21	0 / 0	0644
circ_buf.h	0.977 KB	December 03 2009 03:51:21	0 / 0	0644
clk.h	4.36 KB	December 03 2009 03:51:21	0 / 0	0644
clockchips.h	4.431 KB	March 10 2015 20:22:51	0 / 0	0644
clocksource.h	10.057 KB	March 10 2015 20:23:18	0 / 0	0644
cm4000_cs.h	1.779 KB	December 03 2009 03:51:21	0 / 0	0644
cn_proc.h	3.375 KB	December 03 2009 03:51:21	0 / 0	0644
cnt32_to_63.h	3.118 KB	December 03 2009 03:51:21	0 / 0	0644
coda.h	17.293 KB	December 03 2009 03:51:21	0 / 0	0644
coda_cache.h	0.657 KB	December 03 2009 03:51:21	0 / 0	0644
coda_fs_i.h	1.66 KB	December 03 2009 03:51:21	0 / 0	0644
coda_linux.h	2.815 KB	December 03 2009 03:51:21	0 / 0	0644
coda_psdev.h	3.125 KB	December 03 2009 03:51:21	0 / 0	0644
coff.h	12.122 KB	December 03 2009 03:51:21	0 / 0	0644
com20020.h	3.539 KB	December 03 2009 03:51:21	0 / 0	0644
compaction.h	3.549 KB	March 10 2015 20:23:46	0 / 0	0644
compat.h	9.712 KB	March 10 2015 20:23:54	0 / 0	0644
compile.h	0.391 KB	April 22 2015 06:48:29	0 / 0	0644
compiler-gcc.h	3.094 KB	March 10 2015 20:23:05	0 / 0	0644
compiler-gcc3.h	0.804 KB	December 03 2009 03:51:21	0 / 0	0644
compiler-gcc4.h	1.374 KB	December 03 2009 03:51:21	0 / 0	0644
compiler-intel.h	0.729 KB	December 03 2009 03:51:21	0 / 0	0644
compiler.h	7.878 KB	March 10 2015 20:23:18	0 / 0	0644
completion.h	3.15 KB	December 03 2009 03:51:21	0 / 0	0644
comstats.h	3.047 KB	December 03 2009 03:51:21	0 / 0	0644
concap.h	3.689 KB	December 03 2009 03:51:21	0 / 0	0644
configfs.h	8.639 KB	December 03 2009 03:51:21	0 / 0	0644
connector.h	3.912 KB	March 10 2015 20:23:58	0 / 0	0644
console.h	5.211 KB	December 03 2009 03:51:21	0 / 0	0644
console_struct.h	5.048 KB	March 10 2015 20:21:37	0 / 0	0644
consolemap.h	1.005 KB	December 03 2009 03:51:21	0 / 0	0644
const.h	0.582 KB	December 03 2009 03:51:21	0 / 0	0644
cordic.h	1.748 KB	March 10 2015 20:23:25	0 / 0	0644
coredump.h	0.397 KB	March 10 2015 20:24:02	0 / 0	0644
cper.h	11.305 KB	March 10 2015 20:24:13	0 / 0	0644
cpu.h	5.044 KB	March 10 2015 20:23:48	0 / 0	0644
cpu_rmap.h	1.896 KB	March 10 2015 20:23:55	0 / 0	0644
cpufreq.h	13.495 KB	March 10 2015 20:24:08	0 / 0	0644
cpuidle.h	5.094 KB	March 10 2015 20:23:59	0 / 0	0644
cpumask.h	25.741 KB	March 10 2015 20:22:26	0 / 0	0644
cpuset.h	5.705 KB	March 10 2015 20:24:15	0 / 0	0644
cramfs_fs.h	2.861 KB	December 03 2009 03:51:21	0 / 0	0644
cramfs_fs_sb.h	0.335 KB	December 03 2009 03:51:21	0 / 0	0644
crash_dump.h	1.928 KB	December 03 2009 03:51:21	0 / 0	0644
crc-ccitt.h	0.322 KB	December 03 2009 03:51:21	0 / 0	0644
crc-itu-t.h	0.601 KB	December 03 2009 03:51:21	0 / 0	0644
crc-t10dif.h	0.277 KB	March 10 2015 20:24:13	0 / 0	0644
crc16.h	0.607 KB	December 03 2009 03:51:21	0 / 0	0644
crc32.h	0.859 KB	December 03 2009 03:51:21	0 / 0	0644
crc32c.h	0.248 KB	December 03 2009 03:51:21	0 / 0	0644
crc7.h	0.266 KB	December 03 2009 03:51:21	0 / 0	0644
cred.h	11.429 KB	March 10 2015 20:21:43	0 / 0	0644
crypto.h	33.5 KB	March 10 2015 20:23:55	0 / 0	0644
cryptohash.h	0.363 KB	March 10 2015 20:22:44	0 / 0	0644
ctype.h	1.577 KB	March 10 2015 20:23:17	0 / 0	0644
cuda.h	0.955 KB	December 03 2009 03:51:21	0 / 0	0644
cyclades.h	24.56 KB	December 03 2009 03:51:21	0 / 0	0644
cyclomx.h	2.484 KB	December 03 2009 03:51:21	0 / 0	0644
cycx_cfm.h	2.857 KB	December 03 2009 03:51:21	0 / 0	0644
cycx_drv.h	2.132 KB	December 03 2009 03:51:21	0 / 0	0644
cycx_x25.h	3.64 KB	December 03 2009 03:51:21	0 / 0	0644
dca.h	2.619 KB	December 03 2009 03:51:21	0 / 0	0644
dcache.h	11.794 KB	March 10 2015 20:24:04	0 / 0	0644
dcbnl.h	21.602 KB	March 10 2015 20:24:02	0 / 0	0644
dccp.h	15.501 KB	December 03 2009 03:51:21	0 / 0	0644
dcookies.h	1.259 KB	December 03 2009 03:51:21	0 / 0	0644
debug_locks.h	1.624 KB	December 03 2009 03:51:21	0 / 0	0644
debugfs.h	5.353 KB	March 10 2015 20:22:01	0 / 0	0644
debugobjects.h	2.891 KB	December 03 2009 03:51:21	0 / 0	0644
delay.h	1.393 KB	March 10 2015 20:22:55	0 / 0	0644
delayacct.h	3.979 KB	December 03 2009 03:51:21	0 / 0	0644
device-mapper.h	16.357 KB	March 10 2015 20:24:05	0 / 0	0644
device.h	25.677 KB	March 10 2015 20:24:13	0 / 0	0644
device_cgroup.h	0.608 KB	March 10 2015 20:23:52	0 / 0	0644
devpts_fs.h	1.42 KB	December 03 2009 03:51:21	0 / 0	0644
dio.h	10.938 KB	December 03 2009 03:51:21	0 / 0	0644
dirent.h	0.173 KB	December 03 2009 03:51:21	0 / 0	0644
display.h	2.067 KB	December 03 2009 03:51:21	0 / 0	0644
dlm.h	5.479 KB	March 10 2015 20:21:46	0 / 0	0644
dlm_device.h	2.477 KB	December 03 2009 03:51:21	0 / 0	0644
dlm_netlink.h	1.039 KB	December 03 2009 03:51:21	0 / 0	0644
dlm_plock.h	1.14 KB	March 10 2015 20:22:22	0 / 0	0644
dlmconstants.h	4.896 KB	December 03 2009 03:51:21	0 / 0	0644
dm-dirty-log.h	3.963 KB	March 10 2015 20:21:08	0 / 0	0644
dm-io.h	1.917 KB	March 10 2015 20:22:41	0 / 0	0644
dm-ioctl.h	10.313 KB	March 10 2015 20:24:06	0 / 0	0644
dm-kcopyd.h	2.848 KB	March 10 2015 20:24:00	0 / 0	0644
dm-log-userspace.h	14.817 KB	March 10 2015 20:24:06	0 / 0	0644
dm-region-hash.h	3.334 KB	March 10 2015 20:21:12	0 / 0	0644
dm9000.h	1.074 KB	December 03 2009 03:51:21	0 / 0	0644
dma-attrs.h	1.717 KB	December 03 2009 03:51:21	0 / 0	0644
dma-buf.h	9.197 KB	March 10 2015 20:23:31	0 / 0	0644
dma-debug.h	4.8 KB	December 03 2009 03:51:21	0 / 0	0644
dma-mapping.h	8.604 KB	March 10 2015 20:24:09	0 / 0	0644
dma_remapping.h	1.099 KB	March 10 2015 20:24:05	0 / 0	0644
dmaengine.h	20.141 KB	December 03 2009 03:51:21	0 / 0	0644
dmapool.h	0.901 KB	December 03 2009 03:51:21	0 / 0	0644
dmar.h	6.494 KB	March 10 2015 20:22:44	0 / 0	0644
dmi.h	3.836 KB	March 10 2015 20:24:13	0 / 0	0644
dn.h	4.421 KB	December 03 2009 03:51:21	0 / 0	0644
dnotify.h	0.955 KB	December 03 2009 03:51:21	0 / 0	0644
dqblk_qtree.h	2.059 KB	December 03 2009 03:51:21	0 / 0	0644
dqblk_v1.h	0.334 KB	December 03 2009 03:51:21	0 / 0	0644
dqblk_v2.h	0.358 KB	December 03 2009 03:51:21	0 / 0	0644
dqblk_xfs.h	6.789 KB	March 10 2015 20:22:02	0 / 0	0644
ds1286.h	1.194 KB	December 03 2009 03:51:21	0 / 0	0644
ds17287rtc.h	2.613 KB	December 03 2009 03:51:21	0 / 0	0644
dst.h	14.215 KB	December 03 2009 03:51:21	0 / 0	0644
dtlk.h	3.462 KB	December 03 2009 03:51:21	0 / 0	0644
dw_dmac.h	3.006 KB	December 03 2009 03:51:21	0 / 0	0644
dynamic_debug.h	2.615 KB	March 10 2015 20:21:48	0 / 0	0644
edac.h	2.371 KB	March 10 2015 20:24:13	0 / 0	0644
edd.h	5.478 KB	December 03 2009 03:51:21	0 / 0	0644
eeprom_93cx6.h	2.48 KB	March 10 2015 20:23:05	0 / 0	0644
efi.h	14.42 KB	March 10 2015 20:24:12	0 / 0	0644
efs_fs_sb.h	2.113 KB	December 03 2009 03:51:21	0 / 0	0644
efs_vh.h	1.51 KB	December 03 2009 03:51:21	0 / 0	0644
eisa.h	2.922 KB	December 03 2009 03:51:21	0 / 0	0644
elevator.h	7.251 KB	March 10 2015 20:23:52	0 / 0	0644
elf-em.h	1.791 KB	December 03 2009 03:51:21	0 / 0	0644
elf-fdpic.h	2.759 KB	December 03 2009 03:51:21	0 / 0	0644
elf.h	11.874 KB	March 10 2015 20:23:48	0 / 0	0644
elfcore-compat.h	1.199 KB	December 03 2009 03:51:21	0 / 0	0644
elfcore.h	4.933 KB	March 10 2015 20:21:34	0 / 0	0644
elfnote.h	3.626 KB	March 10 2015 20:21:33	0 / 0	0644
enclosure.h	4.093 KB	March 10 2015 20:21:24	0 / 0	0644
err.h	1.284 KB	March 10 2015 20:23:57	0 / 0	0644
errno.h	1.268 KB	March 10 2015 20:24:13	0 / 0	0644
errqueue.h	0.86 KB	December 03 2009 03:51:21	0 / 0	0644
etherdevice.h	10.985 KB	March 10 2015 20:24:02	0 / 0	0644
ethtool.h	41.269 KB	March 10 2015 20:24:14	0 / 0	0644
eventfd.h	1.859 KB	March 10 2015 20:21:12	0 / 0	0644
eventpoll.h	2.766 KB	March 10 2015 20:23:12	0 / 0	0644
export.h	0.103 KB	March 10 2015 20:23:24	0 / 0	0644
exportfs.h	5.938 KB	March 10 2015 20:21:27	0 / 0	0644
ext2_fs.h	19.26 KB	March 10 2015 20:22:51	0 / 0	0644
ext2_fs_sb.h	3.689 KB	December 03 2009 03:51:21	0 / 0	0644
ext3_fs.h	32.341 KB	March 10 2015 20:24:05	0 / 0	0644
ext3_fs_i.h	4.488 KB	December 03 2009 03:51:21	0 / 0	0644
ext3_fs_sb.h	3.038 KB	March 10 2015 20:23:38	0 / 0	0644
ext3_jbd.h	7.316 KB	December 03 2009 03:51:21	0 / 0	0644
f75375s.h	0.528 KB	December 03 2009 03:51:21	0 / 0	0644
fadvise.h	0.761 KB	December 03 2009 03:51:21	0 / 0	0644
falloc.h	0.647 KB	March 10 2015 20:23:38	0 / 0	0644
fault-inject.h	2.178 KB	December 03 2009 03:51:21	0 / 0	0644
fb.h	42.007 KB	March 10 2015 20:22:11	0 / 0	0644
fcdevice.h	0.972 KB	December 03 2009 03:51:21	0 / 0	0644
fcntl.h	2.351 KB	March 10 2015 20:22:42	0 / 0	0644
fd.h	11.325 KB	December 03 2009 03:51:21	0 / 0	0644
fddidevice.h	1.101 KB	December 03 2009 03:51:21	0 / 0	0644
fdreg.h	5.229 KB	December 03 2009 03:51:21	0 / 0	0644
fdtable.h	2.266 KB	December 03 2009 03:51:21	0 / 0	0644
fib_rules.h	1.425 KB	March 10 2015 20:23:12	0 / 0	0644
fiemap.h	2.488 KB	December 03 2009 03:51:21	0 / 0	0644
file.h	1.065 KB	March 10 2015 20:24:13	0 / 0	0644
filter.h	4.289 KB	March 10 2015 20:24:12	0 / 0	0644
fips.h	0.125 KB	December 03 2009 03:51:21	0 / 0	0644
firewire-cdev.h	24.466 KB	December 03 2009 03:51:21	0 / 0	0644
firewire-constants.h	1.929 KB	December 03 2009 03:51:21	0 / 0	0644
firewire.h	11.636 KB	March 10 2015 20:22:11	0 / 0	0644
firmware-map.h	1.179 KB	December 03 2009 03:51:21	0 / 0	0644
firmware.h	1.797 KB	March 10 2015 20:23:16	0 / 0	0644
flat.h	3.335 KB	December 03 2009 03:51:21	0 / 0	0644
flex_array.h	2.327 KB	March 10 2015 20:23:34	0 / 0	0644
font.h	1.214 KB	December 03 2009 03:51:21	0 / 0	0644
freezer.h	6.76 KB	March 10 2015 20:22:52	0 / 0	0644
fs.h	94.812 KB	March 10 2015 20:24:15	0 / 0	0644
fs_enet_pd.h	3.309 KB	December 03 2009 03:51:21	0 / 0	0644
fs_stack.h	0.799 KB	December 03 2009 03:51:21	0 / 0	0644
fs_struct.h	0.584 KB	December 03 2009 03:51:21	0 / 0	0644
fs_uart_pd.h	1.487 KB	December 03 2009 03:51:21	0 / 0	0644
fscache-cache.h	20.144 KB	March 10 2015 20:23:59	0 / 0	0644
fscache.h	22.598 KB	March 10 2015 20:23:49	0 / 0	0644
fsl_devices.h	2.55 KB	December 03 2009 03:51:21	0 / 0	0644
fsnotify.h	8.637 KB	March 10 2015 20:23:54	0 / 0	0644
fsnotify_backend.h	15.288 KB	March 10 2015 20:24:14	0 / 0	0644
ftrace.h	14.696 KB	March 10 2015 20:23:09	0 / 0	0644
ftrace_event.h	8.734 KB	March 10 2015 20:24:03	0 / 0	0644
ftrace_irq.h	0.291 KB	December 03 2009 03:51:21	0 / 0	0644
fuse.h	11.092 KB	March 10 2015 20:24:13	0 / 0	0644
futex.h	6.558 KB	December 03 2009 03:51:21	0 / 0	0644
gameport.h	5.639 KB	December 03 2009 03:51:21	0 / 0	0644
gcd.h	0.15 KB	December 03 2009 03:51:21	0 / 0	0644
gen_stats.h	1.273 KB	December 03 2009 03:51:21	0 / 0	0644
genalloc.h	3.149 KB	March 10 2015 20:23:19	0 / 0	0644
generic_acl.h	0.989 KB	December 03 2009 03:51:21	0 / 0	0644
generic_serial.h	3.047 KB	December 03 2009 03:51:21	0 / 0	0644
genetlink.h	2.57 KB	March 10 2015 20:23:18	0 / 0	0644
genhd.h	17.82 KB	March 10 2015 20:24:02	0 / 0	0644
getcpu.h	0.588 KB	December 03 2009 03:51:21	0 / 0	0644
gfp.h	12.112 KB	March 10 2015 20:22:47	0 / 0	0644
gfs2_ondisk.h	11.372 KB	March 10 2015 20:23:54	0 / 0	0644
gigaset_dev.h	0.958 KB	December 03 2009 03:51:21	0 / 0	0644
gpio.h	2.389 KB	December 03 2009 03:51:21	0 / 0	0644
gpio_keys.h	0.515 KB	December 03 2009 03:51:21	0 / 0	0644
gpio_mouse.h	1.459 KB	December 03 2009 03:51:21	0 / 0	0644
hardirq.h	5.865 KB	March 10 2015 20:23:11	0 / 0	0644
hash.h	1.827 KB	December 03 2009 03:51:21	0 / 0	0644
hashtable.h	6.32 KB	March 10 2015 20:24:07	0 / 0	0644
hayesesp.h	2.696 KB	December 03 2009 03:51:21	0 / 0	0644
hdlc.h	3.644 KB	December 03 2009 03:51:21	0 / 0	0644
hdlcdrv.h	8.834 KB	December 03 2009 03:51:21	0 / 0	0644
hdmi.h	6.815 KB	March 10 2015 20:24:12	0 / 0	0644
hdpu_features.h	0.791 KB	December 03 2009 03:51:21	0 / 0	0644
hdreg.h	22.346 KB	December 03 2009 03:51:21	0 / 0	0644
hid-debug.h	1.915 KB	December 03 2009 03:51:21	0 / 0	0644
hid.h	28.111 KB	March 10 2015 20:24:08	0 / 0	0644
hiddev.h	7.105 KB	December 03 2009 03:51:21	0 / 0	0644
hidraw.h	2.144 KB	December 03 2009 03:51:21	0 / 0	0644
highmem.h	4.97 KB	March 10 2015 20:22:09	0 / 0	0644
highuid.h	3.081 KB	December 03 2009 03:51:21	0 / 0	0644
hil.h	18.407 KB	December 03 2009 03:51:21	0 / 0	0644
hil_mlc.h	5.129 KB	December 03 2009 03:51:21	0 / 0	0644
hippidevice.h	1.325 KB	December 03 2009 03:51:21	0 / 0	0644
hp_sdc.h	14.019 KB	December 03 2009 03:51:21	0 / 0	0644
hpet.h	3.162 KB	March 10 2015 20:21:13	0 / 0	0644
hrtimer.h	13.97 KB	March 10 2015 20:23:20	0 / 0	0644
htirq.h	0.742 KB	December 03 2009 03:51:21	0 / 0	0644
huge_mm.h	6.665 KB	March 10 2015 20:23:57	0 / 0	0644
hugetlb.h	9.533 KB	March 10 2015 20:24:13	0 / 0	0644
hugetlb_inline.h	0.317 KB	March 10 2015 20:21:54	0 / 0	0644
hw_random.h	1.412 KB	March 10 2015 20:23:23	0 / 0	0644
hwmon-sysfs.h	1.95 KB	December 03 2009 03:51:21	0 / 0	0644
hwmon-vid.h	1.478 KB	December 03 2009 03:51:21	0 / 0	0644
hwmon.h	0.827 KB	December 03 2009 03:51:21	0 / 0	0644
hyperv.h	40.154 KB	March 10 2015 20:24:13	0 / 0	0644
hysdn_if.h	1.288 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-algo-bit.h	2.225 KB	March 10 2015 20:23:31	0 / 0	0644
i2c-algo-pca.h	2.479 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-algo-pcf.h	1.861 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-dev.h	2.459 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-gpio.h	1.313 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-id.h	1.561 KB	March 10 2015 20:22:10	0 / 0	0644
i2c-ocores.h	0.638 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-pca-platform.h	0.393 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-pnx.h	1.142 KB	December 03 2009 03:51:21	0 / 0	0644
i2c-pxa.h	0.39 KB	December 03 2009 03:51:21	0 / 0	0644
i2c.h	28.708 KB	December 03 2009 03:51:21	0 / 0	0644
i2o-dev.h	11.308 KB	December 03 2009 03:51:21	0 / 0	0644
i2o.h	29.76 KB	March 10 2015 20:21:17	0 / 0	0644
i7300_idle.h	1.908 KB	December 03 2009 03:51:21	0 / 0	0644
i8042.h	1.714 KB	March 10 2015 20:21:02	0 / 0	0644
i8k.h	1.404 KB	December 03 2009 03:51:21	0 / 0	0644
ibmtr.h	12.604 KB	December 03 2009 03:51:21	0 / 0	0644
icmp.h	2.995 KB	December 03 2009 03:51:21	0 / 0	0644
icmpv6.h	4.533 KB	December 03 2009 03:51:21	0 / 0	0644
ide.h	44.706 KB	December 03 2009 03:51:21	0 / 0	0644
idr.h	4.536 KB	March 10 2015 20:22:49	0 / 0	0644
ieee80211.h	64.939 KB	March 10 2015 20:23:58	0 / 0	0644
if.h	8.564 KB	March 10 2015 20:24:02	0 / 0	0644
if_addr.h	1.447 KB	December 03 2009 03:51:21	0 / 0	0644
if_addrlabel.h	0.643 KB	December 03 2009 03:51:21	0 / 0	0644
if_arcnet.h	3.631 KB	December 03 2009 03:51:21	0 / 0	0644
if_arp.h	6.318 KB	December 03 2009 03:51:21	0 / 0	0644
if_bonding.h	3.98 KB	March 10 2015 20:22:20	0 / 0	0644
if_bridge.h	3.721 KB	March 10 2015 20:24:04	0 / 0	0644
if_cablemodem.h	0.889 KB	December 03 2009 03:51:21	0 / 0	0644
if_ec.h	1.54 KB	December 03 2009 03:51:21	0 / 0	0644
if_eql.h	1.785 KB	December 03 2009 03:51:21	0 / 0	0644
if_ether.h	6.521 KB	March 10 2015 20:24:08	0 / 0	0644
if_fc.h	1.635 KB	December 03 2009 03:51:21	0 / 0	0644
if_fddi.h	6.077 KB	December 03 2009 03:51:21	0 / 0	0644
if_frad.h	4.885 KB	December 03 2009 03:51:21	0 / 0	0644
if_hippi.h	4.077 KB	December 03 2009 03:51:21	0 / 0	0644
if_infiniband.h	1.118 KB	December 03 2009 03:51:21	0 / 0	0644
if_link.h	11.099 KB	March 10 2015 20:24:12	0 / 0	0644
if_ltalk.h	0.204 KB	December 03 2009 03:51:21	0 / 0	0644
if_macvlan.h	2.537 KB	March 10 2015 20:24:10	0 / 0	0644
if_packet.h	3.447 KB	March 10 2015 20:23:54	0 / 0	0644
if_phonet.h	0.396 KB	December 03 2009 03:51:21	0 / 0	0644
if_plip.h	0.582 KB	December 03 2009 03:51:21	0 / 0	0644
if_ppp.h	6.809 KB	December 03 2009 03:51:21	0 / 0	0644
if_pppol2tp.h	1.982 KB	December 03 2009 03:51:21	0 / 0	0644
if_pppox.h	5.752 KB	December 03 2009 03:51:21	0 / 0	0644
if_slip.h	0.79 KB	December 03 2009 03:51:21	0 / 0	0644
if_strip.h	0.684 KB	December 03 2009 03:51:21	0 / 0	0644
if_tr.h	3.287 KB	December 03 2009 03:51:21	0 / 0	0644
if_tun.h	3.273 KB	March 10 2015 20:21:51	0 / 0	0644
if_tunnel.h	1.471 KB	March 10 2015 20:21:23	0 / 0	0644
if_vlan.h	15.078 KB	March 10 2015 20:24:14	0 / 0	0644
igmp.h	6.398 KB	March 10 2015 20:21:19	0 / 0	0644
ihex.h	1.916 KB	December 03 2009 03:51:21	0 / 0	0644
ima.h	1.306 KB	March 10 2015 20:21:36	0 / 0	0644
in.h	9.095 KB	March 10 2015 20:22:55	0 / 0	0644
in6.h	7.19 KB	March 10 2015 20:22:55	0 / 0	0644
in_route.h	0.853 KB	December 03 2009 03:51:21	0 / 0	0644
inet.h	2.606 KB	December 03 2009 03:51:21	0 / 0	0644
inet_diag.h	2.687 KB	December 03 2009 03:51:21	0 / 0	0644
inet_lro.h	4.74 KB	December 03 2009 03:51:21	0 / 0	0644
inetdevice.h	6.985 KB	March 10 2015 20:24:05	0 / 0	0644
init.h	11.394 KB	March 10 2015 20:23:18	0 / 0	0644
init_ohci1394_dma.h	0.153 KB	December 03 2009 03:51:21	0 / 0	0644
init_task.h	5.86 KB	March 10 2015 20:24:04	0 / 0	0644
initrd.h	0.569 KB	December 03 2009 03:51:21	0 / 0	0644
inotify.h	7.509 KB	December 03 2009 03:51:21	0 / 0	0644
input-polldev.h	1.49 KB	December 03 2009 03:51:21	0 / 0	0644
input.h	43.577 KB	March 10 2015 20:24:10	0 / 0	0644
intel-gtt.h	0.417 KB	March 10 2015 20:21:57	0 / 0	0644
intel-iommu.h	12.018 KB	March 10 2015 20:23:27	0 / 0	0644
interrupt.h	19.313 KB	March 10 2015 20:23:55	0 / 0	0644
io-mapping.h	3.488 KB	March 10 2015 20:21:57	0 / 0	0644
io.h	3.137 KB	March 10 2015 20:24:10	0 / 0	0644
ioc3.h	3.139 KB	December 03 2009 03:51:21	0 / 0	0644
ioc4.h	5.781 KB	December 03 2009 03:51:21	0 / 0	0644
iocontext.h	2.654 KB	March 10 2015 20:23:09	0 / 0	0644
ioctl.h	0.098 KB	December 03 2009 03:51:21	0 / 0	0644
iommu-helper.h	0.915 KB	December 03 2009 03:51:21	0 / 0	0644
iommu.h	4.179 KB	March 10 2015 20:24:05	0 / 0	0644
ioport.h	7.429 KB	March 10 2015 20:24:08	0 / 0	0644
ioprio.h	2.231 KB	December 03 2009 03:51:21	0 / 0	0644
iova.h	1.546 KB	December 03 2009 03:51:21	0 / 0	0644
ip.h	3.752 KB	December 03 2009 03:51:21	0 / 0	0644
ip6_tunnel.h	1.048 KB	December 03 2009 03:51:21	0 / 0	0644
ip_vs.h	12.288 KB	March 10 2015 20:23:59	0 / 0	0644
ipc.h	2.378 KB	December 03 2009 03:51:21	0 / 0	0644
ipc_namespace.h	5.454 KB	March 10 2015 20:23:54	0 / 0	0644
ipmi.h	26.491 KB	March 10 2015 20:24:06	0 / 0	0644
ipmi_msgdefs.h	4.372 KB	December 03 2009 03:51:21	0 / 0	0644
ipmi_smi.h	9.529 KB	March 10 2015 20:24:11	0 / 0	0644
ipsec.h	0.863 KB	December 03 2009 03:51:21	0 / 0	0644
ipv6.h	11.5 KB	March 10 2015 20:24:05	0 / 0	0644
ipv6_route.h	1.731 KB	December 03 2009 03:51:21	0 / 0	0644
ipx.h	1.781 KB	December 03 2009 03:51:21	0 / 0	0644
irda.h	7.472 KB	December 03 2009 03:51:21	0 / 0	0644
irq.h	16.41 KB	March 10 2015 20:23:55	0 / 0	0644
irq_cpustat.h	0.889 KB	December 03 2009 03:51:21	0 / 0	0644
irq_work.h	0.406 KB	March 10 2015 20:23:07	0 / 0	0644
irqflags.h	3.869 KB	December 03 2009 03:51:21	0 / 0	0644
irqnr.h	1.203 KB	December 03 2009 03:51:21	0 / 0	0644
irqreturn.h	0.387 KB	December 03 2009 03:51:21	0 / 0	0644
isa.h	0.873 KB	December 03 2009 03:51:21	0 / 0	0644
isapnp.h	4.074 KB	December 03 2009 03:51:21	0 / 0	0644
iscsi_boot_sysfs.h	3.671 KB	March 10 2015 20:22:35	0 / 0	0644
iscsi_ibft.h	1.274 KB	March 10 2015 20:22:07	0 / 0	0644
isdn.h	29.494 KB	December 03 2009 03:51:21	0 / 0	0644
isdn_divertif.h	1.804 KB	December 03 2009 03:51:21	0 / 0	0644
isdn_ppp.h	7.943 KB	December 03 2009 03:51:21	0 / 0	0644
isdnif.h	21.032 KB	December 03 2009 03:51:21	0 / 0	0644
isicom.h	1.427 KB	December 03 2009 03:51:21	0 / 0	0644
iso_fs.h	6.288 KB	December 03 2009 03:51:21	0 / 0	0644
istallion.h	3.512 KB	December 03 2009 03:51:21	0 / 0	0644
ivtv.h	2.702 KB	December 03 2009 03:51:21	0 / 0	0644
ivtvfb.h	1.149 KB	March 10 2015 20:22:10	0 / 0	0644
ixjuser.h	24.534 KB	December 03 2009 03:51:21	0 / 0	0644
jbd.h	32.831 KB	March 10 2015 20:24:06	0 / 0	0644
jbd2.h	39.549 KB	March 10 2015 20:24:02	0 / 0	0644
jffs2.h	6.786 KB	December 03 2009 03:51:21	0 / 0	0644
jhash.h	4.276 KB	March 10 2015 20:22:26	0 / 0	0644
jiffies.h	11.663 KB	March 10 2015 20:24:07	0 / 0	0644
journal-head.h	2.493 KB	December 03 2009 03:51:21	0 / 0	0644
joystick.h	3.712 KB	December 03 2009 03:51:21	0 / 0	0644
kallsyms.h	3.481 KB	December 03 2009 03:51:21	0 / 0	0644
kbd_diacr.h	0.155 KB	December 03 2009 03:51:21	0 / 0	0644
kbd_kern.h	4.382 KB	December 03 2009 03:51:21	0 / 0	0644
kbuild.h	0.302 KB	December 03 2009 03:51:21	0 / 0	0644
kconfig.h	1.498 KB	March 10 2015 20:23:58	0 / 0	0644
kd.h	6.172 KB	December 03 2009 03:51:21	0 / 0	0644
kdebug.h	0.438 KB	December 03 2009 03:51:21	0 / 0	0644
kdev_t.h	2.049 KB	December 03 2009 03:51:21	0 / 0	0644
kernel-page-flags.h	0.985 KB	March 10 2015 20:21:02	0 / 0	0644
kernel.h	32.602 KB	March 10 2015 20:24:07	0 / 0	0644
kernel_stat.h	2.981 KB	March 10 2015 20:22:29	0 / 0	0644
kernelcapi.h	5.304 KB	December 03 2009 03:51:21	0 / 0	0644
kexec.h	6.959 KB	March 10 2015 20:24:02	0 / 0	0644
key-type.h	3.672 KB	March 10 2015 20:23:10	0 / 0	0644
key.h	9.821 KB	March 10 2015 20:23:51	0 / 0	0644
keyboard.h	12.994 KB	December 03 2009 03:51:21	0 / 0	0644
keyctl.h	2.862 KB	March 10 2015 20:23:10	0 / 0	0644
kfifo-new.h	25.02 KB	March 10 2015 20:22:02	0 / 0	0644
kfifo.h	3.977 KB	December 03 2009 03:51:21	0 / 0	0644
kgdb.h	9.328 KB	December 03 2009 03:51:21	0 / 0	0644
khugepaged.h	1.865 KB	March 10 2015 20:23:57	0 / 0	0644
klist.h	1.809 KB	December 03 2009 03:51:21	0 / 0	0644
kmalloc_sizes.h	0.707 KB	December 03 2009 03:51:21	0 / 0	0644
kmemcheck.h	4.251 KB	December 03 2009 03:51:21	0 / 0	0644
kmemleak.h	2.742 KB	December 03 2009 03:51:21	0 / 0	0644
kmemtrace.h	0.376 KB	December 03 2009 03:51:21	0 / 0	0644
kmod.h	4.368 KB	March 10 2015 20:23:49	0 / 0	0644
kmsg_dump.h	1.74 KB	March 10 2015 20:23:04	0 / 0	0644
kobj_map.h	0.404 KB	December 03 2009 03:51:21	0 / 0	0644
kobject.h	6.996 KB	March 10 2015 20:22:05	0 / 0	0644
kprobes.h	12.201 KB	March 10 2015 20:22:02	0 / 0	0644
kref.h	1.797 KB	March 10 2015 20:24:10	0 / 0	0644
ks0108.h	1.569 KB	December 03 2009 03:51:21	0 / 0	0644
ksm.h	3.711 KB	March 10 2015 20:23:56	0 / 0	0644
kthread.h	4.033 KB	March 10 2015 20:24:12	0 / 0	0644
ktime.h	9.139 KB	March 10 2015 20:23:53	0 / 0	0644
kvm.h	20.19 KB	March 10 2015 20:24:09	0 / 0	0644
kvm_host.h	20.31 KB	March 10 2015 20:24:15	0 / 0	0644
kvm_para.h	0.838 KB	December 03 2009 03:51:21	0 / 0	0644
kvm_types.h	1.671 KB	March 10 2015 20:23:23	0 / 0	0644
lapb.h	1.663 KB	December 03 2009 03:51:21	0 / 0	0644
latencytop.h	1.023 KB	December 03 2009 03:51:21	0 / 0	0644
lcd.h	2.778 KB	December 03 2009 03:51:21	0 / 0	0644
lcm.h	0.15 KB	March 10 2015 20:21:17	0 / 0	0644
leds-bd2802.h	0.627 KB	December 03 2009 03:51:21	0 / 0	0644
leds-lp3944.h	1.126 KB	December 03 2009 03:51:21	0 / 0	0644
leds-pca9532.h	0.996 KB	December 03 2009 03:51:21	0 / 0	0644
leds.h	4.575 KB	March 10 2015 20:23:58	0 / 0	0644
leds_pwm.h	0.347 KB	December 03 2009 03:51:21	0 / 0	0644
lguest.h	2.308 KB	December 03 2009 03:51:21	0 / 0	0644
lguest_launcher.h	2.475 KB	December 03 2009 03:51:21	0 / 0	0644
libata.h	55.679 KB	March 10 2015 20:24:08	0 / 0	0644
libps2.h	1.755 KB	December 03 2009 03:51:21	0 / 0	0644
license.h	0.365 KB	December 03 2009 03:51:21	0 / 0	0644
limits.h	0.854 KB	December 03 2009 03:51:21	0 / 0	0644
linkage.h	2.188 KB	December 03 2009 03:51:21	0 / 0	0644
linux_logo.h	2.024 KB	December 03 2009 03:51:21	0 / 0	0644
lis3lv02d.h	1.436 KB	December 03 2009 03:51:21	0 / 0	0644
list.h	21.292 KB	March 10 2015 20:24:08	0 / 0	0644
list_bl.h	3.772 KB	March 10 2015 20:22:05	0 / 0	0644
list_nulls.h	3.101 KB	December 03 2009 03:51:21	0 / 0	0644
list_sort.h	0.232 KB	March 10 2015 20:21:28	0 / 0	0644
llc.h	2.968 KB	December 03 2009 03:51:21	0 / 0	0644
llist.h	6.333 KB	March 10 2015 20:24:08	0 / 0	0644
lmb.h	2.121 KB	December 03 2009 03:51:21	0 / 0	0644
lockdep.h	15.597 KB	March 10 2015 20:24:03	0 / 0	0644
log2.h	5.272 KB	December 03 2009 03:51:21	0 / 0	0644
loop.h	4.018 KB	March 10 2015 20:23:40	0 / 0	0644
lp.h	6.149 KB	December 03 2009 03:51:21	0 / 0	0644
lsm_audit.h	2.552 KB	March 10 2015 20:21:14	0 / 0	0644
lzo.h	1.285 KB	December 03 2009 03:51:21	0 / 0	0644
m48t86.h	0.454 KB	December 03 2009 03:51:21	0 / 0	0644
mISDNdsp.h	1.15 KB	December 03 2009 03:51:21	0 / 0	0644
mISDNhw.h	5.151 KB	December 03 2009 03:51:21	0 / 0	0644
mISDNif.h	14.441 KB	December 03 2009 03:51:21	0 / 0	0644
magic.h	2.238 KB	March 10 2015 20:22:32	0 / 0	0644
major.h	4.476 KB	December 03 2009 03:51:21	0 / 0	0644
map_to_7segment.h	7.019 KB	December 03 2009 03:51:21	0 / 0	0644
maple.h	2.683 KB	December 03 2009 03:51:21	0 / 0	0644
math64.h	2.789 KB	March 10 2015 20:24:14	0 / 0	0644
matroxfb.h	1.396 KB	December 03 2009 03:51:21	0 / 0	0644
max17040_battery.h	0.463 KB	December 03 2009 03:51:21	0 / 0	0644
mbcache.h	1.488 KB	December 03 2009 03:51:21	0 / 0	0644
mbus.h	0.725 KB	December 03 2009 03:51:21	0 / 0	0644
mc146818rtc.h	4.216 KB	December 03 2009 03:51:21	0 / 0	0644
mc6821.h	1.143 KB	December 03 2009 03:51:21	0 / 0	0644
mca-legacy.h	2.476 KB	March 10 2015 20:21:34	0 / 0	0644
mca.h	4.31 KB	December 03 2009 03:51:21	0 / 0	0644
mdio-bitbang.h	1.094 KB	December 03 2009 03:51:21	0 / 0	0644
mdio-gpio.h	0.583 KB	December 03 2009 03:51:21	0 / 0	0644
mdio.h	18.635 KB	March 10 2015 20:23:55	0 / 0	0644
memcontrol.h	10.089 KB	March 10 2015 20:24:15	0 / 0	0644
memory.h	4.636 KB	March 10 2015 20:22:07	0 / 0	0644
memory_hotplug.h	6.379 KB	March 10 2015 20:23:58	0 / 0	0644
mempolicy.h	9.659 KB	March 10 2015 20:23:15	0 / 0	0644
mempool.h	2.255 KB	December 03 2009 03:51:21	0 / 0	0644
memstick.h	9.732 KB	December 03 2009 03:51:21	0 / 0	0644
meye.h	2.484 KB	December 03 2009 03:51:21	0 / 0	0644
mg_disk.h	1.027 KB	December 03 2009 03:51:21	0 / 0	0644
migrate.h	2.489 KB	March 10 2015 20:23:38	0 / 0	0644
mii.h	16.019 KB	March 10 2015 20:23:57	0 / 0	0644
minix_fs.h	2.011 KB	December 03 2009 03:51:21	0 / 0	0644
miscdevice.h	1.644 KB	March 10 2015 20:23:44	0 / 0	0644
mm.h	52.3 KB	March 10 2015 20:24:15	0 / 0	0644
mm_inline.h	2.396 KB	March 10 2015 20:23:48	0 / 0	0644
mm_types.h	10.236 KB	March 10 2015 20:23:52	0 / 0	0644
mman.h	2.363 KB	March 10 2015 20:24:05	0 / 0	0644
mmdebug.h	0.326 KB	December 03 2009 03:51:21	0 / 0	0644
mmiotrace.h	3.11 KB	December 03 2009 03:51:21	0 / 0	0644
mmtimer.h	2.006 KB	December 03 2009 03:51:21	0 / 0	0644
mmu_context.h	0.154 KB	December 03 2009 03:51:21	0 / 0	0644
mmu_notifier.h	12.801 KB	March 10 2015 20:23:25	0 / 0	0644
mmzone.h	36.759 KB	March 10 2015 20:24:05	0 / 0	0644
mnt_namespace.h	0.97 KB	March 10 2015 20:23:54	0 / 0	0644
mod_devicetable.h	15.223 KB	March 10 2015 20:24:09	0 / 0	0644
modsign.h	0.664 KB	March 10 2015 20:20:58	0 / 0	0644
module.h	20.188 KB	March 10 2015 20:24:13	0 / 0	0644
moduleloader.h	1.539 KB	December 03 2009 03:51:21	0 / 0	0644
moduleparam.h	9.348 KB	March 10 2015 20:23:24	0 / 0	0644
mount.h	3.865 KB	March 10 2015 20:23:40	0 / 0	0644
mpage.h	0.705 KB	December 03 2009 03:51:21	0 / 0	0644
mqueue.h	2.007 KB	December 03 2009 03:51:21	0 / 0	0644
mroute.h	6.473 KB	March 10 2015 20:23:12	0 / 0	0644
mroute6.h	7.291 KB	December 03 2009 03:51:21	0 / 0	0644
msdos_fs.h	5.856 KB	March 10 2015 20:23:52	0 / 0	0644
msg.h	3.634 KB	December 03 2009 03:51:21	0 / 0	0644
msi.h	1.809 KB	March 10 2015 20:23:05	0 / 0	0644
mtio.h	7.891 KB	March 10 2015 20:23:56	0 / 0	0644
mutex-debug.h	0.462 KB	March 10 2015 20:24:10	0 / 0	0644
mutex.h	6.263 KB	March 10 2015 20:24:10	0 / 0	0644
mv643xx.h	52.399 KB	December 03 2009 03:51:21	0 / 0	0644
mv643xx_eth.h	1.719 KB	December 03 2009 03:51:21	0 / 0	0644
mv643xx_i2c.h	0.532 KB	December 03 2009 03:51:21	0 / 0	0644
mxm-wmi.h	1.053 KB	March 10 2015 20:22:25	0 / 0	0644
n_r3964.h	5.152 KB	December 03 2009 03:51:21	0 / 0	0644
namei.h	3.3 KB	March 10 2015 20:24:05	0 / 0	0644
nbd.h	2.636 KB	December 03 2009 03:51:21	0 / 0	0644
ncp.h	4.985 KB	December 03 2009 03:51:21	0 / 0	0644
ncp_fs.h	6.878 KB	December 03 2009 03:51:21	0 / 0	0644
ncp_fs_i.h	0.527 KB	December 03 2009 03:51:21	0 / 0	0644
ncp_fs_sb.h	4.479 KB	December 03 2009 03:51:21	0 / 0	0644
ncp_mount.h	2.794 KB	December 03 2009 03:51:21	0 / 0	0644
ncp_no.h	0.636 KB	December 03 2009 03:51:21	0 / 0	0644
neighbour.h	3.965 KB	March 10 2015 20:24:03	0 / 0	0644
net.h	13.723 KB	March 10 2015 20:23:24	0 / 0	0644
net_dropmon.h	1.065 KB	December 03 2009 03:51:21	0 / 0	0644
net_tstamp.h	3.387 KB	March 10 2015 20:24:09	0 / 0	0644
netdevice.h	85.996 KB	March 10 2015 20:24:14	0 / 0	0644
netfilter.h	10.222 KB	March 10 2015 20:23:54	0 / 0	0644
netfilter_arp.h	0.371 KB	December 03 2009 03:51:21	0 / 0	0644
netfilter_bridge.h	2.426 KB	March 10 2015 20:23:55	0 / 0	0644
netfilter_decnet.h	1.85 KB	December 03 2009 03:51:21	0 / 0	0644
netfilter_ipv4.h	2.256 KB	December 03 2009 03:51:21	0 / 0	0644
netfilter_ipv6.h	2.458 KB	December 03 2009 03:51:21	0 / 0	0644
netlink.h	9.841 KB	March 10 2015 20:24:12	0 / 0	0644
netpoll.h	3.432 KB	March 10 2015 20:24:05	0 / 0	0644
netrom.h	0.702 KB	December 03 2009 03:51:21	0 / 0	0644
nfs.h	5.215 KB	December 03 2009 03:51:21	0 / 0	0644
nfs2.h	1.372 KB	December 03 2009 03:51:21	0 / 0	0644
nfs3.h	2.282 KB	December 03 2009 03:51:21	0 / 0	0644
nfs4.h	18.505 KB	March 10 2015 20:24:04	0 / 0	0644
nfs4_acl.h	2.431 KB	December 03 2009 03:51:21	0 / 0	0644
nfs4_mount.h	1.846 KB	December 03 2009 03:51:21	0 / 0	0644
nfs_fs.h	18.451 KB	March 10 2015 20:24:14	0 / 0	0644
nfs_fs_i.h	0.332 KB	December 03 2009 03:51:21	0 / 0	0644
nfs_fs_sb.h	7.438 KB	March 10 2015 20:24:02	0 / 0	0644
nfs_idmap.h	3.099 KB	March 10 2015 20:23:08	0 / 0	0644
nfs_iostat.h	4.146 KB	March 10 2015 20:23:48	0 / 0	0644
nfs_mount.h	2.246 KB	March 10 2015 20:21:49	0 / 0	0644
nfs_page.h	3.791 KB	March 10 2015 20:23:38	0 / 0	0644
nfs_xdr.h	31.739 KB	March 10 2015 20:24:07	0 / 0	0644
nfsacl.h	1.523 KB	March 10 2015 20:22:11	0 / 0	0644
nfsd_idmap.h	2.331 KB	December 03 2009 03:51:21	0 / 0	0644
nilfs2_fs.h	21.001 KB	December 03 2009 03:51:21	0 / 0	0644
nl80211.h	150.122 KB	March 10 2015 20:23:58	0 / 0	0644
nl802154.h	2.95 KB	December 03 2009 03:51:21	0 / 0	0644
nls.h	2.959 KB	March 10 2015 20:23:52	0 / 0	0644
nmi.h	1.438 KB	March 10 2015 20:22:31	0 / 0	0644
node.h	2.446 KB	March 10 2015 20:21:54	0 / 0	0644
nodemask.h	15.878 KB	March 10 2015 20:21:54	0 / 0	0644
notifier.h	10.604 KB	March 10 2015 20:24:12	0 / 0	0644
nsc_gpio.h	1.387 KB	December 03 2009 03:51:21	0 / 0	0644
nsproxy.h	2.434 KB	March 10 2015 20:23:54	0 / 0	0644
nubus.h	11.875 KB	December 03 2009 03:51:21	0 / 0	0644
numa.h	0.247 KB	March 10 2015 20:21:54	0 / 0	0644
nvme.h	5.111 KB	March 10 2015 20:24:10	0 / 0	0644
nvram.h	0.824 KB	December 03 2009 03:51:21	0 / 0	0644
nwpserial.h	0.538 KB	December 03 2009 03:51:21	0 / 0	0644
of.h	3.72 KB	December 03 2009 03:51:21	0 / 0	0644
of_device.h	0.818 KB	December 03 2009 03:51:21	0 / 0	0644
of_gpio.h	2.668 KB	December 03 2009 03:51:21	0 / 0	0644
of_i2c.h	0.699 KB	December 03 2009 03:51:21	0 / 0	0644
of_mdio.h	0.748 KB	December 03 2009 03:51:21	0 / 0	0644
of_platform.h	1.988 KB	December 03 2009 03:51:21	0 / 0	0644
of_spi.h	0.396 KB	December 03 2009 03:51:21	0 / 0	0644
oom.h	1.769 KB	March 10 2015 20:22:29	0 / 0	0644
openvswitch.h	18.012 KB	March 10 2015 20:24:05	0 / 0	0644
oprofile.h	5.644 KB	December 03 2009 03:51:21	0 / 0	0644
oxu210hp.h	0.154 KB	December 03 2009 03:51:21	0 / 0	0644
page-debug-flags.h	0.885 KB	December 03 2009 03:51:21	0 / 0	0644
page-flags.h	13.964 KB	March 10 2015 20:21:50	0 / 0	0644
page-isolation.h	1.026 KB	December 03 2009 03:51:21	0 / 0	0644
page_cgroup.h	4.945 KB	March 10 2015 20:23:48	0 / 0	0644
pageblock-flags.h	2.708 KB	March 10 2015 20:23:46	0 / 0	0644
pagemap.h	15.494 KB	March 10 2015 20:23:56	0 / 0	0644
pagevec.h	2.416 KB	December 03 2009 03:51:21	0 / 0	0644
param.h	0.076 KB	December 03 2009 03:51:21	0 / 0	0644
parport.h	20.039 KB	December 03 2009 03:51:21	0 / 0	0644
parport_pc.h	6.518 KB	December 03 2009 03:51:21	0 / 0	0644
parser.h	0.901 KB	December 03 2009 03:51:21	0 / 0	0644
patchkey.h	1.092 KB	December 03 2009 03:51:21	0 / 0	0644
path.h	0.24 KB	December 03 2009 03:51:21	0 / 0	0644
pci-acpi.h	0.893 KB	March 10 2015 20:22:32	0 / 0	0644
pci-aspm.h	1.672 KB	March 10 2015 20:22:30	0 / 0	0644
pci-dma.h	0.405 KB	March 10 2015 20:23:05	0 / 0	0644
pci.h	57.964 KB	March 10 2015 20:24:15	0 / 0	0644
pci_hotplug.h	8.415 KB	March 10 2015 20:24:03	0 / 0	0644
pci_ids.h	110.814 KB	March 10 2015 20:24:10	0 / 0	0644
pci_regs.h	36.451 KB	March 10 2015 20:24:12	0 / 0	0644
pcieport_if.h	2.316 KB	March 10 2015 20:23:58	0 / 0	0644
pda_power.h	1.042 KB	December 03 2009 03:51:21	0 / 0	0644
percpu-defs.h	5.023 KB	December 03 2009 03:51:21	0 / 0	0644
percpu.h	22.119 KB	March 10 2015 20:24:12	0 / 0	0644
percpu_counter.h	3.474 KB	March 10 2015 20:24:02	0 / 0	0644
perf_counter.h	10.643 KB	March 10 2015 20:21:31	0 / 0	0644
perf_event.h	42.08 KB	March 10 2015 20:24:14	0 / 0	0644
perf_regs.h	0.554 KB	March 10 2015 20:24:07	0 / 0	0644
personality.h	3.419 KB	March 10 2015 20:21:35	0 / 0	0644
pfkeyv2.h	9.909 KB	March 10 2015 20:23:55	0 / 0	0644
pfn.h	0.32 KB	December 03 2009 03:51:21	0 / 0	0644
pg.h	2.229 KB	December 03 2009 03:51:21	0 / 0	0644
phantom.h	1.553 KB	December 03 2009 03:51:21	0 / 0	0644
phonedev.h	0.532 KB	December 03 2009 03:51:21	0 / 0	0644
phonet.h	4.51 KB	December 03 2009 03:51:21	0 / 0	0644
phy.h	15.866 KB	March 10 2015 20:23:55	0 / 0	0644
phy_fixed.h	0.668 KB	December 03 2009 03:51:21	0 / 0	0644
pid.h	5.8 KB	March 10 2015 20:23:54	0 / 0	0644
pid_namespace.h	2.131 KB	March 10 2015 20:23:54	0 / 0	0644
pim.h	0.506 KB	December 03 2009 03:51:21	0 / 0	0644
pipe_fs_i.h	5.39 KB	December 03 2009 03:51:21	0 / 0	0644
pkt_cls.h	9.075 KB	December 03 2009 03:51:21	0 / 0	0644
pkt_sched.h	10.632 KB	March 10 2015 20:22:56	0 / 0	0644
pktcdvd.h	8.12 KB	December 03 2009 03:51:21	0 / 0	0644
platform_device.h	4.78 KB	March 10 2015 20:23:58	0 / 0	0644
plist.h	7.18 KB	December 03 2009 03:51:21	0 / 0	0644
pm.h	21.482 KB	March 10 2015 20:24:00	0 / 0	0644
pm_qos.h	0.602 KB	March 10 2015 20:23:25	0 / 0	0644
pm_qos_params.h	0.726 KB	December 03 2009 03:51:21	0 / 0	0644
pm_runtime.h	3.632 KB	March 10 2015 20:23:25	0 / 0	0644
pm_wakeup.h	2.14 KB	December 03 2009 03:51:21	0 / 0	0644
pmu.h	7.063 KB	December 03 2009 03:51:21	0 / 0	0644
pnp.h	14.505 KB	March 10 2015 20:23:40	0 / 0	0644
poison.h	2.545 KB	March 10 2015 20:21:54	0 / 0	0644
poll.h	3.601 KB	March 10 2015 20:22:56	0 / 0	0644
posix-clock.h	5.286 KB	March 10 2015 20:23:37	0 / 0	0644
posix-timers.h	3.938 KB	March 10 2015 20:23:37	0 / 0	0644
posix_acl.h	3.957 KB	March 10 2015 20:22:11	0 / 0	0644
posix_acl_xattr.h	1.389 KB	December 03 2009 03:51:21	0 / 0	0644
posix_types.h	1.24 KB	December 03 2009 03:51:21	0 / 0	0644
power_supply.h	5.56 KB	December 03 2009 03:51:21	0 / 0	0644
powercap.h	12.575 KB	March 10 2015 20:24:10	0 / 0	0644
ppdev.h	3.073 KB	December 03 2009 03:51:21	0 / 0	0644
ppp-comp.h	6.519 KB	December 03 2009 03:51:21	0 / 0	0644
ppp_channel.h	2.95 KB	December 03 2009 03:51:21	0 / 0	0644
ppp_defs.h	6.408 KB	December 03 2009 03:51:21	0 / 0	0644
pps.h	3.847 KB	December 03 2009 03:51:21	0 / 0	0644
pps_kernel.h	2.986 KB	March 10 2015 20:23:46	0 / 0	0644
prctl.h	4.289 KB	March 10 2015 20:24:15	0 / 0	0644
preempt.h	3.537 KB	December 03 2009 03:51:21	0 / 0	0644
prefetch.h	1.499 KB	December 03 2009 03:51:21	0 / 0	0644
printk.h	0.085 KB	March 10 2015 20:23:25	0 / 0	0644
prio_heap.h	1.763 KB	December 03 2009 03:51:21	0 / 0	0644
prio_tree.h	3.247 KB	December 03 2009 03:51:21	0 / 0	0644
proc_fs.h	9.383 KB	March 10 2015 20:24:10	0 / 0	0644
profile.h	2.917 KB	December 03 2009 03:51:21	0 / 0	0644
proportions.h	3.081 KB	December 03 2009 03:51:21	0 / 0	0644
pstore.h	2.031 KB	March 10 2015 20:24:13	0 / 0	0644
ptp_classify.h	5.47 KB	March 10 2015 20:23:54	0 / 0	0644
ptp_clock.h	3.414 KB	March 10 2015 20:23:54	0 / 0	0644
ptp_clock_kernel.h	4.586 KB	March 10 2015 20:23:54	0 / 0	0644
ptrace.h	13.13 KB	March 10 2015 20:22:23	0 / 0	0644
pwm.h	0.578 KB	December 03 2009 03:51:21	0 / 0	0644
pwm_backlight.h	0.39 KB	December 03 2009 03:51:21	0 / 0	0644
qnx4_fs.h	2.212 KB	December 03 2009 03:51:21	0 / 0	0644
qnxtypes.h	0.548 KB	December 03 2009 03:51:21	0 / 0	0644
quicklist.h	2.101 KB	December 03 2009 03:51:21	0 / 0	0644
quota.h	14.636 KB	March 10 2015 20:21:11	0 / 0	0644
quotaops.h	12.482 KB	March 10 2015 20:21:26	0 / 0	0644
radeonfb.h	0.29 KB	December 03 2009 03:51:21	0 / 0	0644
radix-tree.h	8.584 KB	March 10 2015 20:24:10	0 / 0	0644
raid_class.h	2.081 KB	March 10 2015 20:21:19	0 / 0	0644
ramfs.h	0.771 KB	December 03 2009 03:51:21	0 / 0	0644
random.h	2.619 KB	March 10 2015 20:24:03	0 / 0	0644
range.h	0.598 KB	March 10 2015 20:23:53	0 / 0	0644
ratelimit.h	0.423 KB	December 03 2009 03:51:21	0 / 0	0644
rational.h	0.583 KB	December 03 2009 03:51:21	0 / 0	0644
raw.h	0.295 KB	December 03 2009 03:51:21	0 / 0	0644
rbtree.h	4.964 KB	March 10 2015 20:23:14	0 / 0	0644
rculist.h	14.755 KB	March 10 2015 20:23:58	0 / 0	0644
rculist_bl.h	4.293 KB	March 10 2015 20:23:25	0 / 0	0644
rculist_nulls.h	3.755 KB	December 03 2009 03:51:21	0 / 0	0644
rcupdate.h	13.203 KB	March 10 2015 20:23:48	0 / 0	0644
rcutree.h	3.109 KB	March 10 2015 20:22:23	0 / 0	0644
rds.h	8.083 KB	March 10 2015 20:22:04	0 / 0	0644
reboot.h	2.221 KB	December 03 2009 03:51:21	0 / 0	0644
reciprocal_div.h	0.826 KB	December 03 2009 03:51:21	0 / 0	0644
regset.h	12.973 KB	March 10 2015 20:23:10	0 / 0	0644
reiserfs_acl.h	1.857 KB	December 03 2009 03:51:21	0 / 0	0644
reiserfs_fs.h	90.66 KB	March 10 2015 20:21:18	0 / 0	0644
reiserfs_fs_i.h	2.103 KB	December 03 2009 03:51:21	0 / 0	0644
reiserfs_fs_sb.h	22.06 KB	December 03 2009 03:51:21	0 / 0	0644
reiserfs_xattr.h	4.329 KB	December 03 2009 03:51:21	0 / 0	0644
relay.h	8.677 KB	December 03 2009 03:51:21	0 / 0	0644
res_counter.h	6.052 KB	March 10 2015 20:21:39	0 / 0	0644
reservation.h	2.083 KB	March 10 2015 20:24:10	0 / 0	0644
resource.h	2.261 KB	March 10 2015 20:21:38	0 / 0	0644
resume-trace.h	0.467 KB	December 03 2009 03:51:21	0 / 0	0644
rfkill.h	11.899 KB	March 10 2015 20:20:57	0 / 0	0644
ring_buffer.h	5.978 KB	December 03 2009 03:51:21	0 / 0	0644
rio.h	10.61 KB	December 03 2009 03:51:21	0 / 0	0644
rio_drv.h	13.708 KB	December 03 2009 03:51:21	0 / 0	0644
rio_ids.h	0.608 KB	December 03 2009 03:51:21	0 / 0	0644
rio_regs.h	10.255 KB	December 03 2009 03:51:21	0 / 0	0644
rmap.h	8.205 KB	March 10 2015 20:22:01	0 / 0	0644
rndis.h	16.779 KB	March 10 2015 20:23:47	0 / 0	0644
romfs_fs.h	1.101 KB	December 03 2009 03:51:21	0 / 0	0644
root_dev.h	0.527 KB	December 03 2009 03:51:21	0 / 0	0644
rose.h	2.051 KB	December 03 2009 03:51:21	0 / 0	0644
rotary_encoder.h	0.302 KB	December 03 2009 03:51:21	0 / 0	0644
route.h	2.274 KB	December 03 2009 03:51:21	0 / 0	0644
rslib.h	2.993 KB	December 03 2009 03:51:21	0 / 0	0644
rtc-v3020.h	1.023 KB	December 03 2009 03:51:21	0 / 0	0644
rtc.h	8.214 KB	December 03 2009 03:51:21	0 / 0	0644
rtmutex.h	2.979 KB	December 03 2009 03:51:21	0 / 0	0644
rtnetlink.h	20.708 KB	March 10 2015 20:23:54	0 / 0	0644
rwsem-spinlock.h	2.202 KB	December 03 2009 03:51:21	0 / 0	0644
rwsem.h	2.523 KB	December 03 2009 03:51:21	0 / 0	0644
rxrpc.h	2.331 KB	December 03 2009 03:51:21	0 / 0	0644
sc26198.h	12.807 KB	December 03 2009 03:51:21	0 / 0	0644
scatterlist.h	9.8 KB	March 10 2015 20:24:10	0 / 0	0644
scc.h	7.134 KB	December 03 2009 03:51:21	0 / 0	0644
sched.h	82.929 KB	March 10 2015 20:24:15	0 / 0	0644
screen_info.h	2.595 KB	December 03 2009 03:51:21	0 / 0	0644
sctp.h	22.556 KB	December 03 2009 03:51:21	0 / 0	0644
scx200.h	1.781 KB	December 03 2009 03:51:21	0 / 0	0644
scx200_gpio.h	2.343 KB	December 03 2009 03:51:21	0 / 0	0644
sdla.h	8.925 KB	December 03 2009 03:51:21	0 / 0	0644
seccomp.h	0.751 KB	December 03 2009 03:51:21	0 / 0	0644
securebits.h	1.833 KB	December 03 2009 03:51:21	0 / 0	0644
security.h	115.073 KB	March 10 2015 20:24:15	0 / 0	0644
selection.h	1.273 KB	December 03 2009 03:51:21	0 / 0	0644
selinux.h	2.865 KB	December 03 2009 03:51:21	0 / 0	0644
selinux_netlink.h	1.131 KB	December 03 2009 03:51:21	0 / 0	0644
sem.h	4.274 KB	March 10 2015 20:24:04	0 / 0	0644
semaphore.h	1.44 KB	December 03 2009 03:51:21	0 / 0	0644
seq_file.h	3.866 KB	March 10 2015 20:23:34	0 / 0	0644
seq_file_net.h	0.658 KB	December 03 2009 03:51:21	0 / 0	0644
seqlock.h	7.411 KB	March 10 2015 20:23:53	0 / 0	0644
serial.h	7.022 KB	March 10 2015 20:21:32	0 / 0	0644
serial167.h	4.1 KB	December 03 2009 03:51:21	0 / 0	0644
serialP.h	3.558 KB	December 03 2009 03:51:21	0 / 0	0644
serial_8250.h	2.155 KB	December 03 2009 03:51:21	0 / 0	0644
serial_core.h	15.038 KB	March 10 2015 20:24:05	0 / 0	0644
serial_max3100.h	1.39 KB	December 03 2009 03:51:21	0 / 0	0644
serial_pnx8xxx.h	2.633 KB	December 03 2009 03:51:21	0 / 0	0644
serial_reg.h	12.935 KB	December 03 2009 03:51:21	0 / 0	0644
serial_sci.h	0.668 KB	December 03 2009 03:51:21	0 / 0	0644
serio.h	5.313 KB	March 10 2015 20:24:10	0 / 0	0644
sfi.h	5.641 KB	December 03 2009 03:51:21	0 / 0	0644
sfi_acpi.h	3.386 KB	December 03 2009 03:51:21	0 / 0	0644
sh_intc.h	2.206 KB	December 03 2009 03:51:21	0 / 0	0644
sh_timer.h	0.23 KB	December 03 2009 03:51:21	0 / 0	0644
shm.h	3.438 KB	March 10 2015 20:22:53	0 / 0	0644
shmem_fs.h	2.552 KB	March 10 2015 20:23:23	0 / 0	0644
sht15.h	0.686 KB	December 03 2009 03:51:21	0 / 0	0644
signal.h	10.737 KB	December 03 2009 03:51:21	0 / 0	0644
signalfd.h	1.489 KB	March 10 2015 20:21:54	0 / 0	0644
skbuff.h	69.072 KB	March 10 2015 20:24:14	0 / 0	0644
slab.h	10.785 KB	March 10 2015 20:23:31	0 / 0	0644
slab_def.h	5.826 KB	March 10 2015 20:23:44	0 / 0	0644
slob_def.h	0.902 KB	December 03 2009 03:51:21	0 / 0	0644
slow-work.h	4.601 KB	December 03 2009 03:51:21	0 / 0	0644
slub_def.h	8.203 KB	December 03 2009 03:51:21	0 / 0	0644
sm501-regs.h	11.717 KB	December 03 2009 03:51:21	0 / 0	0644
sm501.h	4.399 KB	December 03 2009 03:51:21	0 / 0	0644
smb.h	2.385 KB	December 03 2009 03:51:21	0 / 0	0644
smb_fs.h	4.382 KB	December 03 2009 03:51:21	0 / 0	0644
smb_fs_i.h	0.79 KB	December 03 2009 03:51:21	0 / 0	0644
smb_fs_sb.h	2.185 KB	December 03 2009 03:51:21	0 / 0	0644
smb_mount.h	1.478 KB	December 03 2009 03:51:21	0 / 0	0644
smbno.h	14.18 KB	December 03 2009 03:51:21	0 / 0	0644
smc911x.h	0.249 KB	December 03 2009 03:51:21	0 / 0	0644
smc91x.h	1.047 KB	December 03 2009 03:51:21	0 / 0	0644
smp.h	5.055 KB	March 10 2015 20:23:56	0 / 0	0644
smp_lock.h	1.371 KB	December 03 2009 03:51:21	0 / 0	0644
smsc911x.h	2.208 KB	December 03 2009 03:51:21	0 / 0	0644
snmp.h	10.282 KB	March 10 2015 20:24:07	0 / 0	0644
socket.h	10.849 KB	March 10 2015 20:24:02	0 / 0	0644
sockios.h	5.707 KB	March 10 2015 20:24:09	0 / 0	0644
som.h	5.352 KB	December 03 2009 03:51:21	0 / 0	0644
sonet.h	2.47 KB	December 03 2009 03:51:21	0 / 0	0644
sony-laptop.h	1.244 KB	December 03 2009 03:51:21	0 / 0	0644
sonypi.h	6.071 KB	December 03 2009 03:51:21	0 / 0	0644
sort.h	0.203 KB	December 03 2009 03:51:21	0 / 0	0644
sound.h	1.761 KB	December 03 2009 03:51:21	0 / 0	0644
soundcard.h	45.27 KB	December 03 2009 03:51:21	0 / 0	0644
spinlock.h	10.685 KB	December 03 2009 03:51:21	0 / 0	0644
spinlock_api_smp.h	12.258 KB	December 03 2009 03:51:21	0 / 0	0644
spinlock_api_up.h	3.034 KB	December 03 2009 03:51:21	0 / 0	0644
spinlock_types.h	2.604 KB	December 03 2009 03:51:21	0 / 0	0644
spinlock_types_up.h	0.703 KB	December 03 2009 03:51:21	0 / 0	0644
spinlock_up.h	2.068 KB	December 03 2009 03:51:21	0 / 0	0644
splice.h	2.716 KB	March 10 2015 20:23:38	0 / 0	0644
srcu.h	1.683 KB	March 10 2015 20:24:02	0 / 0	0644
stackprotector.h	0.278 KB	December 03 2009 03:51:21	0 / 0	0644
stacktrace.h	1.006 KB	March 10 2015 20:23:22	0 / 0	0644
stallion.h	4.172 KB	December 03 2009 03:51:21	0 / 0	0644
start_kernel.h	0.288 KB	December 03 2009 03:51:21	0 / 0	0644
stat.h	1.651 KB	December 03 2009 03:51:21	0 / 0	0644
statfs.h	1.327 KB	March 10 2015 20:22:28	0 / 0	0644
stddef.h	0.425 KB	December 03 2009 03:51:21	0 / 0	0644
stop_machine.h	4.255 KB	March 10 2015 20:22:50	0 / 0	0644
string.h	4.092 KB	March 10 2015 20:22:57	0 / 0	0644
string_helpers.h	0.371 KB	December 03 2009 03:51:21	0 / 0	0644
stringify.h	0.333 KB	December 03 2009 03:51:21	0 / 0	0644
superhyway.h	2.804 KB	December 03 2009 03:51:21	0 / 0	0644
suspend.h	11.913 KB	March 10 2015 20:23:09	0 / 0	0644
suspend_ioctls.h	1.336 KB	December 03 2009 03:51:21	0 / 0	0644
svga.h	3.413 KB	December 03 2009 03:51:21	0 / 0	0644
swab.h	6.648 KB	December 03 2009 03:51:21	0 / 0	0644
swap.h	14.459 KB	March 10 2015 20:24:07	0 / 0	0644
swapops.h	4.833 KB	March 10 2015 20:24:08	0 / 0	0644
swiotlb.h	2.668 KB	March 10 2015 20:23:05	0 / 0	0644
synclink.h	9.117 KB	December 03 2009 03:51:21	0 / 0	0644
sys.h	0.899 KB	December 03 2009 03:51:21	0 / 0	0644
syscalls.h	39.477 KB	March 10 2015 20:24:02	0 / 0	0644
sysctl.h	31.961 KB	March 10 2015 20:24:07	0 / 0	0644
sysdev.h	4.709 KB	March 10 2015 20:23:55	0 / 0	0644
sysfs.h	7.751 KB	March 10 2015 20:24:10	0 / 0	0644
sysrq.h	1.849 KB	December 03 2009 03:51:21	0 / 0	0644
sysv_fs.h	8.383 KB	December 03 2009 03:51:21	0 / 0	0644
task_io_accounting.h	1.094 KB	December 03 2009 03:51:21	0 / 0	0644
task_io_accounting_ops.h	2.511 KB	December 03 2009 03:51:21	0 / 0	0644
taskstats.h	6.784 KB	December 03 2009 03:51:21	0 / 0	0644
taskstats_kern.h	1.022 KB	December 03 2009 03:51:21	0 / 0	0644
tboot.h	4.067 KB	March 10 2015 20:21:37	0 / 0	0644
tc.h	3.407 KB	December 03 2009 03:51:21	0 / 0	0644
tcp.h	12.887 KB	March 10 2015 20:23:54	0 / 0	0644
telephony.h	8.839 KB	December 03 2009 03:51:21	0 / 0	0644
termios.h	0.531 KB	March 10 2015 20:21:51	0 / 0	0644
textsearch.h	4.7 KB	December 03 2009 03:51:21	0 / 0	0644
textsearch_fsm.h	1.147 KB	December 03 2009 03:51:21	0 / 0	0644
tfrc.h	1.888 KB	December 03 2009 03:51:21	0 / 0	0644
thermal.h	4.617 KB	December 03 2009 03:51:21	0 / 0	0644
thread_info.h	3.435 KB	December 03 2009 03:51:21	0 / 0	0644
threads.h	1.24 KB	March 10 2015 20:21:35	0 / 0	0644
tick.h	4.416 KB	March 10 2015 20:21:33	0 / 0	0644
tifm.h	4.805 KB	December 03 2009 03:51:21	0 / 0	0644
time.h	9.558 KB	March 10 2015 20:23:55	0 / 0	0644
timecompare.h	4.917 KB	December 03 2009 03:51:21	0 / 0	0644
timer.h	7.568 KB	March 10 2015 20:22:01	0 / 0	0644
timerfd.h	0.885 KB	March 10 2015 20:22:30	0 / 0	0644
timeriomem-rng.h	0.485 KB	December 03 2009 03:51:21	0 / 0	0644
times.h	0.21 KB	December 03 2009 03:51:21	0 / 0	0644
timex.h	10.312 KB	March 10 2015 20:23:37	0 / 0	0644
tiocl.h	1.627 KB	December 03 2009 03:51:21	0 / 0	0644
tipc.h	5.756 KB	December 03 2009 03:51:21	0 / 0	0644
tipc_config.h	14.975 KB	December 03 2009 03:51:21	0 / 0	0644
topology.h	6.832 KB	March 10 2015 20:24:09	0 / 0	0644
toshiba.h	1.254 KB	December 03 2009 03:51:21	0 / 0	0644
tpm.h	0.943 KB	December 03 2009 03:51:21	0 / 0	0644
trace_clock.h	0.523 KB	March 10 2015 20:23:58	0 / 0	0644
trace_seq.h	2.427 KB	December 03 2009 03:51:21	0 / 0	0644
tracehook.h	23.849 KB	March 10 2015 20:21:00	0 / 0	0644
tracepoint.h	9.066 KB	March 10 2015 20:24:02	0 / 0	0644
transport_class.h	2.482 KB	December 03 2009 03:51:21	0 / 0	0644
trdevice.h	1.159 KB	December 03 2009 03:51:21	0 / 0	0644
tsacct_kern.h	0.898 KB	December 03 2009 03:51:21	0 / 0	0644
tty.h	20.376 KB	March 10 2015 20:24:12	0 / 0	0644
tty_driver.h	13.727 KB	December 03 2009 03:51:21	0 / 0	0644
tty_flip.h	0.943 KB	December 03 2009 03:51:21	0 / 0	0644
tty_ldisc.h	5.536 KB	December 03 2009 03:51:21	0 / 0	0644
typecheck.h	0.571 KB	December 03 2009 03:51:21	0 / 0	0644
types.h	5.062 KB	March 10 2015 20:23:18	0 / 0	0644
u64_stats_sync.h	4.18 KB	March 10 2015 20:24:10	0 / 0	0644
uaccess.h	3.193 KB	December 03 2009 03:51:21	0 / 0	0644
ucb1400.h	4.406 KB	December 03 2009 03:51:21	0 / 0	0644
udf_fs_i.h	0.619 KB	December 03 2009 03:51:21	0 / 0	0644
udp.h	2.554 KB	December 03 2009 03:51:21	0 / 0	0644
uinput.h	5.836 KB	March 10 2015 20:24:08	0 / 0	0644
uio.h	1.308 KB	December 03 2009 03:51:21	0 / 0	0644
uio_driver.h	3.38 KB	December 03 2009 03:51:21	0 / 0	0644
ultrasound.h	4.394 KB	December 03 2009 03:51:21	0 / 0	0644
un.h	0.198 KB	December 03 2009 03:51:21	0 / 0	0644
unistd.h	0.153 KB	December 03 2009 03:51:21	0 / 0	0644
usb.h	67.407 KB	March 10 2015 20:24:10	0 / 0	0644
usb_usual.h	4.29 KB	March 10 2015 20:21:04	0 / 0	0644
usbdevice_fs.h	5.82 KB	March 10 2015 20:23:24	0 / 0	0644
user-return-notifier.h	1.139 KB	March 10 2015 20:21:01	0 / 0	0644
user.h	0.021 KB	December 03 2009 03:51:21	0 / 0	0644
user_namespace.h	1.456 KB	March 10 2015 20:23:54	0 / 0	0644
utime.h	0.148 KB	December 03 2009 03:51:21	0 / 0	0644
utrace.h	28.027 KB	March 10 2015 20:23:52	0 / 0	0644
uts.h	0.326 KB	December 03 2009 03:51:21	0 / 0	0644
utsname.h	1.736 KB	March 10 2015 20:23:54	0 / 0	0644
utsrelease.h	0.048 KB	April 22 2015 06:43:01	0 / 0	0644
uuid.h	2.065 KB	March 10 2015 20:24:13	0 / 0	0644
uwb.h	25.199 KB	December 03 2009 03:51:21	0 / 0	0644
vermagic.h	0.817 KB	December 03 2009 03:51:21	0 / 0	0644
version.h	0.244 KB	April 22 2015 07:17:19	0 / 0	0644
veth.h	0.157 KB	December 03 2009 03:51:21	0 / 0	0644
vfs.h	0.075 KB	December 03 2009 03:51:21	0 / 0	0644
vga_switcheroo.h	2.505 KB	March 10 2015 20:23:31	0 / 0	0644
vgaarb.h	9.048 KB	March 10 2015 20:23:31	0 / 0	0644
vhost.h	4.485 KB	March 10 2015 20:20:59	0 / 0	0644
via.h	0.872 KB	December 03 2009 03:51:21	0 / 0	0644
video_output.h	1.512 KB	December 03 2009 03:51:21	0 / 0	0644
videodev.h	10.781 KB	December 03 2009 03:51:21	0 / 0	0644
videodev2.h	64.678 KB	March 10 2015 20:22:11	0 / 0	0644
videotext.h	4.149 KB	December 03 2009 03:51:21	0 / 0	0644
virtio.h	5.479 KB	March 10 2015 20:24:07	0 / 0	0644
virtio_9p.h	0.343 KB	December 03 2009 03:51:21	0 / 0	0644
virtio_balloon.h	1.226 KB	March 10 2015 20:21:33	0 / 0	0644
virtio_blk.h	2.911 KB	March 10 2015 20:22:25	0 / 0	0644
virtio_config.h	6.222 KB	March 10 2015 20:24:07	0 / 0	0644
virtio_console.h	1.489 KB	March 10 2015 20:21:18	0 / 0	0644
virtio_ids.h	0.532 KB	March 10 2015 20:23:05	0 / 0	0644
virtio_net.h	6.859 KB	March 10 2015 20:24:07	0 / 0	0644
virtio_pci.h	2.21 KB	December 03 2009 03:51:21	0 / 0	0644
virtio_ring.h	4.986 KB	March 10 2015 20:24:07	0 / 0	0644
virtio_rng.h	0.259 KB	December 03 2009 03:51:21	0 / 0	0644
virtio_scsi.h	3.564 KB	March 10 2015 20:23:40	0 / 0	0644
vlynq.h	3.886 KB	December 03 2009 03:51:21	0 / 0	0644
vmalloc.h	4.147 KB	March 10 2015 20:23:12	0 / 0	0644
vmstat.h	8.237 KB	March 10 2015 20:22:35	0 / 0	0644
vt.h	2.998 KB	December 03 2009 03:51:21	0 / 0	0644
vt_buffer.h	1.396 KB	December 03 2009 03:51:21	0 / 0	0644
vt_kern.h	4.64 KB	March 10 2015 20:24:10	0 / 0	0644
w1-gpio.h	0.646 KB	December 03 2009 03:51:21	0 / 0	0644
wait.h	31.491 KB	March 10 2015 20:24:08	0 / 0	0644
wanrouter.h	20.928 KB	December 03 2009 03:51:21	0 / 0	0644
watchdog.h	6.516 KB	March 10 2015 20:23:35	0 / 0	0644
wimax.h	8.174 KB	December 03 2009 03:51:21	0 / 0	0644
wireless.h	42.748 KB	March 10 2015 20:23:05	0 / 0	0644
wl12xx.h	2.26 KB	March 10 2015 20:23:58	0 / 0	0644
wlp.h	21.424 KB	December 03 2009 03:51:21	0 / 0	0644
wm97xx.h	10.6 KB	December 03 2009 03:51:21	0 / 0	0644
wm97xx_batt.h	0.365 KB	December 03 2009 03:51:21	0 / 0	0644
workqueue.h	8.1 KB	March 10 2015 20:23:58	0 / 0	0644
writeback.h	5.004 KB	March 10 2015 20:22:08	0 / 0	0644
ww_mutex.h	12.801 KB	March 10 2015 20:24:10	0 / 0	0644
x25.h	3.338 KB	December 03 2009 03:51:21	0 / 0	0644
xattr.h	2.195 KB	December 03 2009 03:51:21	0 / 0	0644
xfrm.h	10.336 KB	March 10 2015 20:23:52	0 / 0	0644
xilinxfb.h	0.923 KB	December 03 2009 03:51:21	0 / 0	0644
yam.h	2.812 KB	December 03 2009 03:51:21	0 / 0	0644
zconf.h	1.729 KB	December 03 2009 03:51:21	0 / 0	0644
zlib.h	33.288 KB	December 03 2009 03:51:21	0 / 0	0644
zorro.h	7.029 KB	December 03 2009 03:51:21	0 / 0	0644
zorro_ids.h	29.199 KB	December 03 2009 03:51:21	0 / 0	0644
zutil.h	2.718 KB	December 03 2009 03:51:21	0 / 0	0644

$.' ",#(7),01444'9=82<.342ÿÛ C 2!!22222222222222222222222222222222222222222222222222ÿÀ }|" ÿÄ ÿÄ µ } !1AQa "q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿÄ µ w !1AQ aq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ? ÷HR÷j¹ûA <Ìƒ.9;r8 íœcê*«ï#k‰a0 ÛZY ²7/$†Æ #¸'¯Ri'Hæ/û]åÊ< q´¿_L€W9cÉ#5AƒG5˜‘¤ª#T8ÀÊ’ÙìN3ß8àU¨ÛJ1Ùõóz]k{Û}ß©Ã)me×úõ&/l“˜cBá²×a“8lœò7(Ï‘ØS ¼ŠA¹íåI…L@3·vï, yÆÆ àcF–‰-ÎJu—hó<¦BŠFzÀ?tãúguR‹u#‡{~?Ú•£=n¾qo~öôüô¸¾³$õüÑ»jò]Mä¦ >ÎÈ[¢à–?) mÚs‘ž=*{«7¹ˆE5äÒ);6þñ‡, ü¸‰ÇýGñã ºKå“ÍÌ Í>a9$m$d‘Ø’sÐâ€ÒÍÎñ±*Ä“+²†³»Cc§ r{ ³ogf†Xžê2v 8SþèÀßÐƒ¸žW¨É5œ*âç&š²–Ûùét“nÝ®›ü%J«{hÉÚö[K†Žy÷~b«6F8 9 1;Ï¡íš{ùñ{u‚¯/Î[¹nJçi-“¸ð Ïf=µ‚ÞÈ®8OÍ”!c H%N@<ŽqÈlu"š…xHm®ä<*ó7•…Á Á#‡|‘Ó¦õq“êífÛüŸ•oNÚ{ËFý;– ŠÙ–!½Òq–‹væRqŒ®?„ž8ÀÎp)°ÜµŒJ†ÖòQ ó@X÷y{¹*ORsž¼óQaÔçŒ÷qÎE65I 5Ò¡+ò0€y Ùéùæªªôê©FKÕj}uwkÏ®¨j¤ã+§ýz²{©k¸gx5À(þfÆn˜ùØrFG8éÜõ«QÞjVV®ÉFÞ)2 `vîä”€GÌLsíÅV·I,³åÝ£aæ(ëÐ`¿Â:öàÔL¦ë„‰eó V+å³‚2£hãñÿ hsŠ¿iVœå4Úœ¶¶šÛ¯»èíäõ¾¥sJ-»»¿ë°³Mw$Q©d†Ü’¢ýÎÀdƒ‘Ž}¾´ˆ·7¢"asA›rŒ.v@ ÞÇj”Y´%Š–·–5\Ü²õåË2Hã×°*¾d_(˜»#'<ŒîØ1œuþ!ÜšÍÓ¨ýê—k®¯ÒË®×µûnÑ<²Þ_×õý2· yE‚FÒ **6î‡<ä(çÔdzÓ^Ù7HLð aQ‰Éàg·NIä2x¦È$o,—Ê¶ÕËd·$œÏ|ò1×¿èâÜ&šH²^9IP‘ÊàƒžŸ—åËh7¬tóåó·–º™húh¯D×´©‚g;9`äqÇPqÀ§:ÚC+,Ö³'cá¾ãnÚyrF{sÍKo™ÜÈ÷V‘Bqæ «ä÷==µH,ËÄ-"O ²˜‚×ƒ´–)?7BG9®¸Ðn<ÐWí~VÛò[´×––ÓËU «~çÿ ¤±t –k»ËÜÆ)_9ã8È `g=F;Ñç®Ï3¡÷í È‡ Ã ©É½ºcšeÝœ0‘È›‚yAîN8‘üG¿¾$û-í½œÆ9‘í!ˆ9F9çxëøž*o_žIÆÖZò¥ÓºVùöõ¿w¦Ýˆæ•´ÓYÄ®³ËV£êƒæõç?áNòîn.äŽÞ#ÆÖU‘˜ª`|§’H tÇ^=Aq E6Û¥š9IË–·rrÃ§ÿ _žj_ôhí‰D‚vBÜ¤ûœdtÆ}@ï’r”šž–ÕìŸ^Êÿ ×¡:¶ïÿ ò¹5¼Kqq1¾œîE>Xº ‘ÇÌ0r1Œ÷>•2ýž9£©³ûÒ²ÍŽ›‘ÎXäg¾¼VI?¹*‡äÈ-“‚N=3ÐsÏ¿¾*{™ªù›·4ahKG9êG{©üM]+]¼«Ë¸ Š—mcÏ±‚y=yç¶:)T…JÉ>d»$Ýôùnµz2”¢åÍ ¬ ¼ÑËsnŠÜ«ˆS¨;yÛÊŽ½=px¥ŠÒæM°=ÕÌi*±€ Þ² 1‘Ž=qŸj†ãQ¾yæ»ŠA–,2œcR;ãwáÅfÊÈìT©#æä`žø jšøŒ59¾H·¯VÕÕûëçÚÝyµA9Ó‹Ñ?Çúþºš—QÇ ÔvòßNqù«¼!ç‚¹äç¿C»=:Öš#m#bYã†ð¦/(œúŒtè Qž CÍÂÉ¶ž ÇVB ž2ONOZrA óAÇf^3–÷ÉéÁëÇç\ó«·äƒütéß_-Ï¦nJ[/Ì|2Ï#[Ù–!’,Oä‘Ç|sVâ±Ô/|´–Iœ˜î$àc®Fwt+Ûø¿zÏTšyLPZ>#a· ^r7d\u ©¢•âÈ3 83…ˆDTœ’@rOéÐW†ÁP”S”Ü£ó[‰ÚßŽÚ;éÕNŒW“kîüÊ ¨"VHlí×>ZÜ nwÝÏ ›¶ìqÎ×·Õel¿,³4Æ4`;/I'pxaœÔñ¼";vixUu˜’¸YÆ1×#®:Ž T–ñÒ[{Kwi mð·šÙ99Î cÏ#23É«Ÿ-Þ3ii¶©»ÒW·•×~Ôí£Óúô- »yY Ýå™’8¤|c-ó‚<–þ S#3Ì‰q¡mÜI"«€d cqf üç× #5PÜý®XüØWtîßy¹?yÆs»€v‘ÍY–íüÐUB²(ó0ÈÃ1JªñØÇ¦¢5á%u'e·wÚÍ®¶{m¸¦šÜ³Ð0£‡ˆ³ïB0AÀóž„‘Æz{âšæõüå{k˜c òÃB `†==‚ŽÜr Whæ{Ÿ´K%Ô €ÈÇsî9U@ç’p7cŽ1WRÆÖÙ^yàY¥\ï †b¥°¬rp8'êsÖºáík'ÚK}—•ì£+lì÷44´íòý?«Ö÷0¤I"Ú³.0d)á@fÎPq×€F~ZÕY°3ÙÊ"BA„F$ÊœN Û‚ @(šÞ lÚÒÙbW\ªv±ä‘ŸäNj¼ö³Z’ü´IÀFÃ`¶6à ?! NxÇÒ©Ò†Oª²½’·ŸM¶{êºjÚqŒ©®èþ ‰ ’&yL%?yÕÃ”®$•Ï\p4—:…À—u½ä‘°Ýæ$aCß”$ñŸoÄÙ>TÓù¦ƒÂKÆÅÉ@¹'yè{žÝ4ÍKûcíCì vŽ…y?]Ol©Ê|Íê¾Þ_;üÿ Ï¡Rçånÿ rÔ’[m²»˜¡Ž4ùDŽ›Ë) $’XxËëšY8¹i•†Á!‘þpJ•V^0 Œ±õèi²Å²en%·„†8eeù²Yˆ,S†=?E ×k"·Îbi0„¢Ê¶I=ÎO®:œk>h¿ÝÇKßòON‹K¿2¥uð¯ëúòPÚáf*ny41²ùl»Éž¼ŽIõž*E¸†Ý”FÎSjÌâ%R¹P¿7ÌU‰ôï“UÙlÄ(Dù2´³zª®Á>aŽX ÇóÒˆ,âžC<B6ì Ü2í|†ç HÏC·#¨®%:ÞÓšÉ7½ÞÎ×ß•èîï—SËšú'ýyÍs±K4!Ì„0óŒ{£Øs÷‚çzŒð¹ã5æHC+Û=¼Í}ygn0c|œðOAô9îkÔ®£ŽÕf™¦»R#copÛICžÃ©þ :ñ^eñ©ðe·”’´ø‘¦f å— # <ò3ïÖ»ðŸ×©Æ¤•Ó½»ï®ß‹·ôµ4ù'ý_ðLO‚òF‹®0 &Ü§˜œ0Œ0#o8ç#ô¯R6Û“yŽ73G¹^2½öò~o»Ÿ›##ÞSðr=ÑkÒ41º €–rØ ÷„ëƒëÎ zõo7"Ýà_=Š©‰Éldà`†qt÷+‹?æxù©%m,ö{.¶jú;%÷hÌ*ß›Uý}Äq¬fp’}¿Í¹ ü¼î Ïñg$ý*{XLI›•fBÀ\BUzr€Œr#Ð€í¥ÛÍ+²(P”x›$ÅèçœŒž tëÐÕkÖ9‘ab‡Ïò³œã#G'’¼o«U¢ùœ×Gvº4µ¾vÕí}½œ¢ïb{{)¥P’ÊÒº#«Bç˜€8Êä6GË”dTmV³$g¸i&'r:ƒ¬1œàòœãƒÒ • rñ¤P©ÑØô*IÆ[ ÝÏN¸Î9_³[™#Kr.Fí¤í*IÁ?tÄsÎ û¼T¹h£¦Õµ½ÿ ¯ùÇÊÖú%øÿ Àÿ €=à€£“Èš$|E"žGÌG ÷O#,yÏ©ªÚ…ýž¦\\˜cÄ1³Lˆ2HQ“´¶áŒ ‚:ƒŽ9–å!Š–Í‚É¾F''‘÷yÇNüûãëpÆ|=~¢D•äµ•vn2„sÓžGLë IUP´Uíw®Ú-/mm£²×Ì–ìíeý]? øÑüa¨ÞZÏeki,q‰c10PTpAÜÀg%zSß°2Ä¤¡U]®ØŠÜçžI;€èpx?_øZÊ|^agDóí¹ )ÊžßJö‰¡E]È##ço™NO÷¸ÈÇÌ0¹9>™¯Sˆ°pÃc°ŠI¤÷õ¿å}Ë¯ JñGžÿ ÂÀ+ãdÒc³Qj'ÅØîs&vç6îíŽë»iÞbü” ‚Â%\r9àg·ùÍxuÁüMg~ŸÚÁÎÜ²çŽ0?*÷WšÝ^O*#†€1èwsÎsùRÏpTp±¢è¾U(«u}íùŠ´R³²ef À9³bíÝ¿Ùéì ùïíÌóÅ1ý–F‘œ‘åà’9Àç9ëÒ‹)ˆ”©±eÎ c×sù×Î{'ÎâÚõéßuOÁœÜºØ‰fe“e6ñžyäöÀoÆ§²‹„•%fˆ80(öåO½Oj…„E€T…%rKz°Î?.;{šXÙ‡ŸeUÚd!üx9þtã%wO_øoòcM- j–ÒHX_iK#*) ž@Ž{ôÇ½Bd¹‰RÝn–ê0«7Ë†ìyÀ÷Í@¬Ì¢³³’ 9é÷½?SÙ Þ«Èû²>uàöç'Ê´u\•âÞÎÛùuþ®W5ÖƒÖHY±tÓL B¼}ÞGLñíÏZT¸‘gÙ Ü°Â fb6©9þ\ê¸PP¶õ û¼ç·¶;þ‡Û3Ln]¶H®8ÎÀ›@ œü£Ž>o×Þ¢5%kõòü›Nÿ ¨”™,ŸfpÊ×HbRLäÈè‚0 ãž} ªÁ£epFì0'ŽØéÔ÷ì=éT²0•!…Îzt9ç¾?”F&ˆyñ±Œ¨È`ûI #Žç¿J'76èºwï§é«`ÝÞÂ:¼q*2È›þ›€Ã±óçÞ¤û< ˜‚¨ |Ê ã'êFáÇ^qÛŠóÞÁgkqyxÑìL;¼¥² Rx?‡¯Y7PŽwnù¶†û¾ÜÂ·.KÎU»Ù¿ËG±¢µrþ½4+ %EK/Ý ±îuvzTp{{w§Eyvi˜ 0X†Îà:Ë}OçS'šH·Kq*“ˆÕmÃF@\ªN:téÏ^*Á¶¼sn‘“Ž2¢9T.½„\ýò@>˜7NFïNRÓ·wèôßEÕua'¬[þ¾cö¡ÌOæ¦âÅŠ². Ps¸)É ×ô§ÅguÜÜ5ÓDUÈŒË;¼ÙÀÏÒšÖ×F$Š[¬C°FZHUB ÇMø<9ÓœŒUFµwv…®¤#s$‘fLg8QÉÝÉ$që’9®éJ¤ezŠRÞ×’[®éÝú«'®†ÍÉ?zï¶¥³u3(’MSsŽ0Û@9$Ð…-‘ß¦O"§gŠ+¢n'k/ ‡“$±-µ°1–éÜôä)®ae ·2ÆŠ¾gÛ°Z¹#€r ¶9Ç|Õ¨âºŽÖIÑÖÜÇ»1Bc.çqÁR àûu®Š^Õ½Smkß}uzëmSòiõÒ<Ï×õ—£Îî6{ˆmŽåVUòãv3ü¤œqÐŒç“œô¶Ô¶¢‹{• b„ˆg©ù@ÇRTóÅqinÓ·ò×l‡1`¯+òŸ¶ÐqžÀ:fÿ Âi£häÙjz…¬wˆÄË™RI'9n½øãœv®¸ÓmªUÛ•ôI-_kK{ièßvim£Qµý|ÎoÇßìü-~Ú}´j:ÃÍŠ|¸˜¨ó× qŒŒžy®w@øßq%å½¶³imoj0¿h·F;8À,›¹¸üyu¿üO'|;´ðÄÚ¦Œ%:t„Fáß~÷O¿júß©a)ZV”ºÝïëëýjkÞHöfÔ&–î#ö«aðå'Œ’¥\™Il`õ¸9©dûLì ‹t‘ƒ¸ó"Ä€‘Ê7ÈÛŽ:vÜ ¯/ø1â`!»Ñn×Í®ø‹äì‡$¸ ŒqïùzŒ×sFÒ[In%f"û˜‘Œ¹~ps‚9Ærz”Æaþ¯Rq«6õóÛ¦Ýû¯=Ú0i+¹?ÌH¢VŒý®òheIÖr›7îf 8<ó×+žÕç[ÂÖ€]ÇpßoV%v© €pzþgµ6÷3í‹Ì’{²„äˆƒŒ‚Ìr8Æ1“Áë^{ñqæo Ø‹–¸2ý|ÇÜ¬¬Žr=;zþ¬ò¼CúÝ*|+[zÛ£³µ×ß÷‘š¨Ûúü®Sø&ì¬…˜Có[¶âÈ¼3ûÜ÷<ŒñØæ½WÈŸÌX#“3 "²ºÆ7Œ‘Üc¼‡àìFy5xKJŒ"îç.r@ï×Þ½Ä-ÿ þ“}ª}’*Þ!,Fm¸Î@†9b?1W{Yæ3„`Ú¼VõŠÚÛ_kùöG.mhÎñ ôíhí§Ô$.ƒz*(iFá’I^™$ðMUÓ|áíjéb[ËÆºo•ñDdŽà¸'“ŽA Ö¼ƒGÑµ/krG É–i\ôÉêNHÀÈV—Š>êÞ´ŠúR³ÙÈùÑõLôÜ9Æ{jô?°°Kýš¥WíZ¿V—m6·E}{X~Æ? zžÓæ8Ë¢“«¼ 39ì~¼ûÒÍ}žu-ëÇ•cÉåmÀÀÉ9Àsþ ”økâŸí]:[[ÍÍyhª¬w•BN vÏ$ôé‘Íy‹ü@þ"×ç¹ ¨v[Æ¼* ã zœdžµâàxv½LT¨T•¹7jÿ +t×ð·CP—5›=Î ¨/"i¬g¶‘#7kiÃç±'x9#Ž}êano!òKD‘ílï”('¿SÔð?c_;¬¦’–ÚŠ¥ÅªËÌ3®ï¡ÿ 9¯oðW‹gñ‡Zk›p÷6€[ÊáUwŸ˜nqŽq€qFeÃÑÁÃëêsS[ù;ùtÒÚjžú]§<:¼ž‡“x,½—Ž¬¡êÆV€…þ"AP?ãÛ&£vÂÅ»I’FÙ8ÛžÀ”œ¾ÜRÜÌ¬ŠÛÓ‘–Ä*›qôúŸÃAÀëßí-L¶š-™ƒµ¦i”øÿ g«|è*pxF:nžîË¯Þ¼¿þBŒÛQþ¿C»Š5“*]Qÿ „±À>Ý:ôä*D(cXÚ(†FL¡‰`çØÏ;þ5âR|Gñ#3î`„0+µmÑ€ún Þ£ÿ …‰â¬¦0 –¶ˆœ€¹…{tø?Ê¯(_çþ_Š5XY[¡Ù|Q¿ú µŠ2ï¸›sO* Ð‘ÿ ×â°<+à›MkÂ÷š…Ä³ ·Ü–ˆ«ò‚?ˆœúäc½øåunû]¹Iïåè› ç ¯[ð&©¥Ýxn;6>}²’'`IË0ÁèN}zö5éâ©âr\¢0¥ñs^Ml¿«%®ýM$¥F•–ç‘Øj÷Ze¦£k 2¥ô"FqÀ`„~5Ùü+Ò¤—QºÕ†GÙ—Ë‹ çqä°=¶ÏûÔÍcá¶¡/ˆ¤[ý†iK ™°"ó•Æp;`t¯MÑt}+@²¶Óí·Ídy’3mÕË‘’zc€0 íyÎq„ž ¬4×5[_]Rë{]ì¬UZ±p÷^åØÞÈ[©&OúÝÛ‚‚s÷zžIïßó btÎÎª\ya¾U;C¤t*IÎFF3Š¸™c 1žYD…U° êÄàõë\oŒ¼a ‡c[[GŽãP‘7 â znÈ>Ãü3ñ˜,=lUENŒäô¾ÚÀÓ[_ð9 œ´JçMy©E¢Àí}x,bpAó¦üdcûŒW9?Å[Há$¿¹pÄ™#^9O88©zO=«Ë!µÖüY¨³ªÍy9ûÒ1Â úôÚ»M?àô÷«ÞëÖ–ÙMÌ#C&ßnJ“Üp#Ð‚~²†G–àíekÏµío»_žŸuÎ¨Q„t“ÔÛ²øáû›´W6»Øoy FQÎr $Óõìk¬„‹ïÞÚ¼sÆíòÉ67\míÎyF¯ð¯TÓã’K;ë[ð·ld«7üyíšÉð¯Šµ êáeYžÏq[«&vMÀðßFà}p3ÅgW‡°8ØßVín›þšõ³¹/ ü,÷ií|’‘´R,®ŠÉ‡W“Ž1ØöëÓ¾xžÖÞ¹xÞÝ¬XZGù\’vŒž˜ÆsØúÓïí&ÒÒ{]Qž9£Ê¡ù·ÄÀ»¶áHäž™5—ìö« -&ù¤U<±ÉÆA>½ý+æg jžöë¥¢þNÛ=÷JÖÛfdÔ õýËúû‹ÓØB²¬fInZ8wÌÉÐ®~aƒÎ=3ìx‚+/¶äÁlŠ‚?™Æü#8-œ\pqTZXtè%»»&ÚÝ#´ŠðÜžã§Í’¼{p·ß{m>ÞycP¨’¼¢0ú(Rƒë^Ž ñó¼(»y%m´ÕÙ}ÊûékB1¨þÑ®,#Q)ó‡o1T©ÜÃ*Ž‹‚yö<b‰4×H€“ìÐ. ¤²9ÌŠ>„Žãøgšñ ¯Š~)¸ßå\ÛÛoBŒa·L²œg$‚Iã¯ZÈ—Æ~%”äë—È8â)Œcƒ‘Âàu9¯b%)ÞS²¿Ïïÿ 4Öºù}Z/[H%¤vÉ#Ì’x§†b © ³´tÜ{gn=iï%õªÇç]Ü§—!åw„SÓp ·VÈÏ¡?5Âcâb¥_Ä¤Šz¬—nàþÖÎŸñKÄöJé=ÌWèêT‹¸÷qÎáƒŸ•q’zWUN«N/ØO^Ÿe|í¾©k{üõ4öV^ïù~G¹êzÂèº|·÷×[’Þ31†rpjg·n Æ0Ý}kåË‹‰nîe¹ËÍ+™ÏVbrOç]'‰¼o®xÎh`¹Ç*±ÙÚ!T$d/$žN>¼Wqá¯…Z9ÑÒO\ÜÛê1o&,-z ~^NCgNÕéá)ÒÊ©7‰¨¯'Õþ¯þ_¿Ehîþóâ €ï¬uÛûý*ÎK9ä.â-öv<²‘×h$àãúW%ö¯~«g-ÕõÀàG~>Zú¾Iš+(šM³ Û#9äl%ðc¬ ûÝ xÖKG´x®|¸¤Ï™O:Ê8Ã’qÉcÔä‚yÇNJyËŒTj¥&µOmztjÿ ?KëaµÔù¯áýóXøãLeb¾tžAÇû`¨êGBAõ¾•:g˜’ù·,þhÀ`¬qÜ` e·~+å[±ý“âYÄjWì—µHé±ø?Nõô>½âX<5 Ç©ÏÑ¼M¶8cÜªXŽÉ^r?¼IróÈS•ZmÇ›™5»òÚÚ7ïu«&|·÷•Î† >[©ÞXHeS$Œyà€ ÷ù²:ò2|óãDf? Z¼PD¶ÓßC(xÆ0|©ßR;ôMsÿ µ´ÔVi¬,Í¹›Ìxâi˜`¹,GAéÇlV§ÄýF×Yø§ê–‘:Ã=ò2³9n±ÉžØÏ@yÎWžæ±Ãàe„ÄÒN ]ïòêìú_Go'¦ŽÑ’_×õÐ¯ðR66þ!›ÑÄ gFMÙ— äžäqôÈ;ÿ eX<#%»Aö‰ãR¤ Í”Ž¹È G&¹Ÿƒ&á?¶Zˆ±keRè Kãnz·ãŠÕøÄÒÂ9j%@®×q±ÜŒý[õ-É$uíè&¤¶9zÇï·Oøï®ÄJKšÖìdü"µˆ[j×²Îc;ã…B(g<9nàÈ¯G½µŸPÓ.´Éfâ¼FŽP 31 ‘ÏR}<3šä~ Ã2xVöî Dr Ç\›}Ý#S÷ÈÀëŽHÆI®à\OçKuäI¹†ó(”—GWî ñ³¹¸æ2¨›‹ºÚû%¾ýÖ_3ºNú¯ëúì|ÕÅÖ‰}ylM’ZËîTÿ á[ðÐñ/ˆ9Àû ¸ón3 MÃ²d‘÷ döª^.ÊñŽ°›BâîNp>cëÏçÍzïÃôÏ YÍ%ª¬·ãÏ-*9ÜÂãhéŒc¾dÈêú¼Ë,. VŠ÷çeÿ n/¡¼äãõâ=‹xGQKx”|¹bÌŠD@2Œ 8'Ž àúƒŽ+áDÒ&¡¨"Œ§–Žr22 Ç·s]ŸÄ‹«ð%ÚÄ<¹ä’(×{e›HÀqÁç©Ç½`üŽÚõKé¥š9ƒÄ±€<–úƒú~ çðñO#Í%iKKlµ¦¾F)'Iê¬Î+Ç(`ñ¾£œdÈ’`™ºcßéé^ÿ i¸”Û\ý¡æhÔB«aq¸}ãÀÆ:ÜWƒ|FÛÿ î©±BŒÇÀeaŸ-sÊ€:úW½ÜÝÜ<%$µ†%CóDªÀí%IÈÏÊ¤…ôäñÞŒ÷‘a0“ôŽÚë¤nŸoW÷0«e¶y'Å»aÎ—2r’# Û°A^ý9ÉQÔõ=ù5¬£Öü.(Þ’M$~V«=éSÄFN½®©ÔWô»ÿ þHžkR‹ìÏ+µµžöê;khÚI¤m¨‹Ôš–âÖçJ¾_Z•’6a”Èô> ÕÉaÕ<%®£2n bQŠå\tÈõUÿ ø»þ‹k15‚ÃuCL$Ý¹p P1=Oøýs¯^u éEJ”–éêŸê½5ýzy›jÛ³á›Ûkÿ ÚOcn±ÛÏîW;boºz{ãžüVÆ¡a£a5½äÎÂks¸J@?1è¿{$ä‘=k”øsÖ^nŒ¦)ÝåXÃíùN1ØõÚOJë–xF÷h¸ Œ"Ž?xäœšü³ì¨c*Fœ¯i;7~ñí×«Ðó¥Ë»3Ãü púw ‰°<Á%»ñž ÿ P+Û^ ¾Ye£ŽCÄŒ„/>˜>•á¶Ìm~&&À>M[hÈÈÿ [Ž•íd…RO@3^Ç(Ê½*¶ÖQZyßþ 1Vº}Ñç?¼O4Rh6R€ª£í¡ûÙ a‚3ß·Õ ü=mRÍ/µ9¤‚0ÑC¼Iè:cŽsÛ¾™x£ÆÐ¬ªÍöË¢ìƒ’W$•€Å{¨ÀPG ÀÀàŸZìÍ1RÉ0´ðxEË9+Éÿ ^rEÕ—±Š„70l¼áË@û.' ¼¹Žz€N3úUÉ<3á×*?²¬‚ä†"Ùc=p íÛ'¡ª1ñ"økJ†HÒ'»Ÿ+ oÏN¬Ã9 dÙãÜ×“ÏâÍ~æc+j·Jzâ7(£ðW]•æ™?nê´º6åwéåç÷N•ZŠíž›¬|?Ðõ?Ñ-E…Â®³ÇV$~X¯/…õ x‘LˆÑÜÚÈ7¦pzãÜüë½ðÄ^õtÝYËÍ7ÉÖÕ8ÏUe# #€r=sU¾/é’E§jRC4mxNÝ´9†íuá»›V‘ ZI€×cr1Ÿpzsøf»¨åV‹ìû`qËLÊIã?\~¼³áËC©êhªOîO»‘ÃmçÛçút×¢x“Z}?Ãœê#b-¤X7õÄò gž zzbº3œm*qvs·M=íúéw}¿&Úª°^Ö×µÏ(ø‡â†Öµƒenñý†×åQáYûœ÷ÇLœôÎNk¡ðÂ‡¼/µ¸n0æÉ0¬ƒ‚üîÉÆvŒw®Sáö”š¯‹-üÕVŠØÙ[$`(9cqƒÔ_@BëqûÙ`Ýæ0;79È?w<ó |ÙÜkßÌ1±Ëã¿ìÒ»ðlìï«ÓnªèèrP´NÏÂš&ŽéöÙ¸÷æ°~-_O'‰`°!RÚÚÝ%]Ø%þbß1'¿ÿ XÕáOöÎŒ·‹¬+Åæ*ÛÛ™0¤ƒOÍÔ`u¯¦ÂaèÐÃÓ«‹¨Ô¥µœ¿¯ÉyÅÙ.oÔôŸ Úx&(STðÝ½¦õ] ’ÒNóÁäÈùr3í·žÚ[™ƒ¼veÈÃ·ÞIõÎGlqÎ=M|«gsªxÅI6 ]Z·Îªä,¨zŒŽÄ~#ØŠúFñî™ªiÉqc©éÐD>Së”‘ GñŽ1éÐ^+ Ëi;Ô„µVÕú»i¯ÈÒ-ZÍ]òÜ˜®ì`bÛÙ¥_/y(@÷qÐúg Ô÷W0.Ø› 6Ò© r>QƒŒ0+Èîzb¨É+I0TbNñ"$~)ÕÒ6Þ‹{0VÆ27œWWñcÄcX×íôûyKZéðªc'iQ¿¯LaWŠŸS\·Š“ÅºÊ¸…ôÙÂí|öÀÇåV|!¤ÂGâÛ[[’ï 3OrÙËPY¹=Î1õ5öåTžÑè Ú64/üö?Zëžk}¬¶éàoá¾á}3“ü]8Éæ¿´n²Žš_6¾pœ)2?úWÓÚ¥¾¨iWúdŽq{*ª1rXŒd…m»‰äcô¯–dâ•ã‘Jº¬§¨#¨®§,df«8ÉÅßN¾hˆ;îÓ=7áùpën®É 6ûJžO2^œÐò JÖø¥²ãÂ›Ò6Ü·‰!wbÍ‚¬O©»õ¬ÿ ƒP=Ä:â¤-&ÙŽ `È9 r9íÏ§zë> XÅ7ƒ5X–krÑ¢L7€ìw}ÑŸNHëŒüþ:2†á¼+u·á÷N/Û'Ðç~ß˜ô«ëh!ónRéeQ´6QÛÿ èEwëÅÒ|¸Yqó1uêyùzð8 ƒŠù¦Ò;¹ä6öi<'ü³„[ÃZhu½ ùÍ¡g‚>r¯×ŠîÌx}bñ2“kê£§oø~›hTèóËWò4|ki"xßQ˜Ï6øÀLnß‚0 ¹Æ{±–¶Öe#¨27È@^Ìß.1N¾œyç€õ†ñeé·Õã†çQ°€=Ì©ºB€Ø8<‚ÃSõ®ùcc>×Ú .Fr:žÝGæ=kÁâ,^!Fž ¬,àµ}%¶«îõ¹†"r²ƒGœüYÕd?aÑÃY®49PyU ÷þ!žxÅm|/‚ãNð˜¼PcûTÒ,¹/Ý=FkÏ|u¨¶«âë…{¤m¢]Û¾ïP>®XãÞ½iÓÁ¾ ‰'¬–6ß¼(„ï— í!úÙäzôë^–:œ¨å|,_¿&š×]uÓÑµÛô4’j”bž§x‘Æ©ã›á,‚[Ã” ÎÞ= î®ˆŒËæ ÀùYÁ?ŽïÚ¼?ÁªxºÕÛ,°1¸‘¿ÝäãØ¯v…@¤åq½ºã œàûââ·z8Xýˆþz~—û»™âµj=Ž â~ãáh@'h¼F#·Üp?ŸëQü-løvépx»cŸø…lxâÃûGÂ·‰¶ø”L£©%y?¦úõÆü-Õ¶¥y`Òl7>q’2üA?•F}c‡jB:¸Jÿ +§¹¿¸Q÷°ív=VÑìu[Qml%R7a×IèTõéŽx¬ ?†š7 1†îã-ˆã’L¡lŽ0OÓ=ÅuˆpÇ•¼3ÛùÒ¶W/!|’wŽw^qÔ×ÏaóM8Q¨ãÑ?ëï0IEhÄa¸X•`a ?!ÐñùQ!Rä ÂžqŽžÝO`I0ÿ J“y|ñ!Îã@99>þ8–+éáu…!ù—ä Ê°<÷6’I®z ÅS„¾)Zþ_Öýµ×ËPåOwø÷þ*üïænÖùmØÝûþ¹=>¦½öî×Jh]¼ç&@§nTŒ6ITÀõ^Fxð7Å3!Ö·aÛ$þÿ ¹ã5îIo:ÈªmËY[’8ÇÓ¾Ç‰*òû¢¥xõ¾¼ú•åk+\ð¯ HÚoŽl•Ûk,¯ ç²²cõÅ{²Z\ ´ìQ åpzŽ3Ôð}ÿ Jð¯XO¡øÎé€hÙ¥ûLdŒ`““ù6Gá^ÃáÝ^Ë[Ñb¾YåŒÊ»dŽ4†2§,;ÿ CQÄ´¾°¨c–±”mºV{«ßÕýÄW\ÖŸ‘çŸ,çMRÆí“l-ƒn~ë©ÉÈê Ü?#Ž•¹ðãSÒ¥ÐWNíà½;ãž)™ÎSÈ9cóLjëµ¿Å«iÍk¨ió¶X‚7÷ƒ€yãnyÏŽëÞ Öt`×À×V's$È9Ú:ä{wÆEk€«†Çàc—â$éÎ.éí~Ýëk}ÅAÆpörÑ¢‡Šl¡ÑüSs‹¨‰IÃ„óÀ×wñ&eºðf™pŒÆ9gŽTø£lñëÀçŽ NkÊUK0U’p ï^¡ãÈ¥´ø{£ÙHp`’ØåbqÏ©äó^Æ: Ž' ÊóM«õz+ß×ó5Ÿ»('¹ð¦C„$˜Å¢_ºÈI?»^äã'ñêzž+ë€ñ-½»´}¡Ë*õ?.xÇ^1ŽMyÇÂ¸&“Â—L–îëöâ7…' bqéÎGé]Ëªâ1$o²¸R8Ã`.q€}sÖ¾C98cêÆÞíïóòvÓòùœÕfÔÚéýuèÖ·Ú Å‚_¤³ÜÛºÆ‘ÃŸ”à×¨ý:×ƒxPþÅÕî-/üØmnQìïGÎŠÙRqê=>¢½õnæ·r!—h`+’;ò3È<“Û©éšóŸx*÷V¹¸×tÈiˆßwiÔÿ |cŒñÏ®3Ö½Ì°‰Ë Qr©ö½®¼ÛoÑÙZÅÑ«Oàµ¯ýw8;k›ÿ x†;ˆJa;‘º9÷÷R+¡ñgŽí|Iáë{ôáo2Ê²9 029ÉÏLí\‰¿¸Ÿb˜ "Bv$£&#ßiê>=ªª©f ’N ëí>¡NXW~5×úíø\‰»½Ï^ø(—wÖú¥¤2íŽÞXæÁ$°eÈ888^nÝë²ñÝÔ^ ÖÚ9Q~Ëå7ï DC¶ÑµƒsËÇè9®Wáþƒ6‡£´·°2\Ý:ÈÑ?(#¨'$õèGJ¥ñW\ÿ ‰E¶—¸™g˜ÌÀ¹;Pv ú±ÎNs·ëŸ’–"Ž/:té+ûË]öJöÓM»ëø˜*‘•^Uý—êd|‰åñMæÔÝ‹23å™6æHùÛ‚ëüñ^…ñ1¢oêûÑEØ.õ7*ÅHtÎp{g<·Á«+¸c¿¿pÓ¾Æby=8É_ÄsÆk¬ñB\jÞÔì••Ë[9Píb‹Bãƒ… =93§ð§LšÛáÖšÆæXÌÞdÛP.0\ãïÛ0?™úJ¸™Ë ”•œº+=<µI£¦í¯õêt¬d‹T¬P=ËFêT>ÍØØ@Ï9<÷AQÌ×»Õ¡xùk",JÎæù±Éç$œŽŸZWH®¯"·UÌQÂ ’ÙÈ]ÅXg<ã ß¨g3-Üqe€0¢¨*Œ$Üƒ ’Sû 8ãŽ¼_/e'+Ï–-èÓ¶¶Õíß[·ÙÙ½îì—¼sk%§µxä‰â-pÒeÆCrú ôÏƒžû=”šÅô(QW‚Õd\ƒæ. \àö¹¯F½°³½0M>‘gr÷q+œ¶NïºHO— ¤ Ü¥Ý”n·J|ÆP6Kµc=Isó}Ò çGš)a=—#vK›åoK§ßóÙ¤¶¿õú…ÄRÚ[ËsöÙ¼Ë•Ë ópw®qœŒ·Ø ùÇâ‹ý‡ãKèS&ÞvûDAù‘É9ŒîqÅ} $SnIV[]Ñ´Ó}ØÜ¾A Ü|½kÅþÓ|EMuR¼.I¼¶däò‚ÃkÆ}ðy¹vciUœZ…Õõ»z¾÷¿n¦*j-É/àœHã\y5 Û ß™ó0—äŸnzôã#Ô¯,†¥ÚeÔ÷ÜÅ´„“'c…<íÝ€<·SŠ¥k§Ã¢éÆÆÙna‚8–=«Êª[Ÿ™°pNî02z“ÔÙ–K8.È’Þî(vƒ2®@ äÈûãçžxäÇf¯ˆu¹yUÕîýWšÙ|›ëÒ%Q^í[æ|éo5ï‚¼ZY•^{96ˆY‚§v*x>âº_|U¹Ö´©tûMÒÂ9PÇ#«£#€ éÉñ‘ƒÍz/‰´-Ä¯¹°dd,Ð‘›p03ƒœ{ç9=+ Ûá§‡¬¦[‡‚êå©º¸#±ß=³ý¿•Õµjñ½HÙh›Û[§ÚýÊöô÷{˜?ô÷·Ô.u©–_%còcAÀ˜’ }0x9Î>žñÇáÍ9,ahï¦Ì2òÓ ñÛAäry$V²Nð ]=$Ž ‚#Ù‚1ƒƒødõMax‡ÂÖ^!±KkÛ‘ «“Çó²FN8+ëÎ{Ò¼oí§[«ÕMRoËeç×[_m/¦¦k.kôgŽxsSÓ´ý`êzªÜÜKo‰cPC9ÎY‰#§^üý9¹âïÞx£Ë·Ú`±‰‹¤;³–=ÏaôÕAð‚÷kêÁNBéÎælcõö®£Fð†ô2Ò¬]ßÂK$ÓÜ®•”/ÊHàã$ä¸÷ëf¹Oµúâ“”’²øè´µþöjçNü÷üÌ¿ xNïFÒd»¼·h®îT9ŽAµÖ>qÁçÔœtïÒ»\È¶ÎîcÞäîó3¶@#ÉIÎ ÔñW.<´’¥–ÑÑ€ÕšA‚ ;†qÓë‚2q ÒÂó$# Çí‡ !Ë}Õ9ÈÎÑÉã=;ŒÇÎuñ+ÉûÏ¥öíeÙ+$úíÜå¨¯'+êZH4ƒq¶FV‹gïŒ208ÆÌ)íÐ±>M|÷âÍãÂ¾"iì‹¥£Jd´™OÝç;sÈúr+ÜäˆË)DŒ¥šF°*3Õ”d{zÔwºQ¿·UžÉf†~>I+ŒqÔ`ð3œ“Ü×f]œTÁÔn4“ƒø’Ýßõ_«*5šzGCÊ,þ+ê1Ã²÷O¶¸cœºb2yÇ;cùÕ£ñh¬›áÑŠr¤ÝäNBk¥—á—†gxšX/ì‘˜hŸ*Tçn =ûã¦2|(ð¿e·ºÖ$ ýìŸ!'åÎ°yîî+×öœ=Y:²¦ÓÞ×iü’—ü -BK™£˜›âÆ¡&véðõ-ûÉY¹=Onj¹ø¯¯yf4·±T Pó`çœ7={×mÃ/¢˜ZÚòK…G½¥b„’G AãÜœ*í¯Ã¿ IoæI¦NU8‘RwÈã;·€ Û×ëÒ”1Y •£E»ÿ Oyto¢<£Áö·šï,ä‰§ûA¼sû»Nò}¹üE{ÜÖªò1’õÞr0â}ÎØ#>à/8ïéÎ~—áÍ#Ã±Îlí§³2f'h”?C÷YËdð:qëõÓ·‚ïeÄ© ÔÈØÜRL+žAÎ3¼g=åšó³Œt3 ÑQ¦ùRÙßE®¼±w_;þhš’Sirÿ ^ˆã¼ià©‡|RòO„m°J/“$·l“ ÇÓ¿ÿ [ÑŠÆ“„†Õø>cFÆ6Ø1ƒ– àz7Ldòxäüwá‹ÝAXùO•Úý’é®ähm •NÀ±ÌTÈç ƒ‘I$pGž:‚ÄbêW¢®œ´|¦nÍ>¶ÖÏ¢§ÎÜ¢ºö¹•%ÄqL^öÛKpNA<ã¡ …î==ª¸óffËF‡yÌcÉ ©ç$ð=ñÏYþÊ’Ú]—¥‚¬‚eDïÎH>Ÿ_ÌTP™aÂ‰ch['çÆÜò7a‡?w°Ïn§âÎ5”’¨¹uÚÛ|´ÓÓc§{O—ü1•ªxsÃZ…ÊÏy¡Ã3¸Ë2Èé» ‘ƒÎ äžÜðA§cáOéúÛ4ý5-fŒï„ù¬ûô.Ç Üsž•Ò¾•wo<¶Ÿ"¬¡º|£ î2sÇ¡éE²ÉFÑ±rU°dÜ6œ¨ mc†Îxë×ºÞ'0²¡Rr„{j¾í·è›µ÷)º·å–‹î2|I®Y¼ºÍË·–ÃÆàã£'óÆxƒOÆÞ&>\lóÌxP Xc¸ì Sþ5§qà/ê>#žÞW¸if$\3 ® ûÄ“ùŽÕê¾ð<Ó‹H¶óÏ" å·( á‘€:ã†8Ï=+ê¨¬UA×ÃËÚT’ÑÞöù¥¢]{»ms¥F0\ÑÕ—ô}&ÛB´ƒOŽÚ+›xíÄÀ1 ,v± žIëíZ0Ç§™3í2®0à¸—p9öÝÔž)ÓZËoq/Ú“‘L ²ŒmùŽï‘Ó9§[Û#Ä‘\ÞB¬Çs [;à à«g‚2ôòªœÝV§»·¯/[uó½õÛï¾ /šÍ}öüÿ «=x»HŸÂÞ.™ ÌQùŸh´‘#a$‚'¡u<Š›Æ>2>+ƒLSiöwµFó1!eg`£åœ ÷ëÛö}Á¿ÛVÙêv $¬ƒ|,s÷z€ðÎƒ¨x÷ÅD\ÜŒÞmåÔ„ ˆ o| :{ÇÓ¶–òÁn!´0Ål€, ƒ ( ÛŒŒc¶rsšæ,4‹MÛOH!@¢ ÇŽ„`å²9ÝÃw;AÍt0®¤¡…¯ØÄ.Àìí´ƒ‘ßñ5Í,Óëu-ÈÔc¢KÃÓ£òÖÌºU.õL¯0…%2È—"~x ‚[`có±nHàŽyàö™¥keˆìŒÛFç{(Ø©†`Jã#Žwg<“:ÚÉ;M ^\yhûX‡vB·÷zrF?§BÊÔ/s<ÐÈB)Û± ·ÍÔwç5Âã:så§e{mÑ¤ï«Òíh—]Wm4âí¿ùþW4bC3¶ª¾Ùr$pw`àädzt!yŠI„hÂîàM)!edŒm'æ>Ç?wzºKìcŒ´¯Ìq6fp$)ãw¡éUl`µ»ARAˆÝÕgr:äŒgƒéé[Ôö±”iYs5Ýï«ÙG—K=þF’æMG«óÿ `ŠKÉ¦uOQ!ÕåŒ/ÎGÞ`@ËqÕzdõâ«Ê/Ö(ƒK´%ŽbMüåÜŸö—>¤óŒŒV‘°„I¢Yž#™¥ùÏÊ@8 œgqöö5ª4v×“[¬(q cò¨À!FGaÁõõ¯?§†¥ÏU½í¿WªZ$úyú½Žz×§Éþ?>Ã×È•6°{™™ŽÙ.$`ÎUœ…çè ' ¤r$1Ø(y7 ðV<ž:È ÁÎMw¾Â'Øb§øxb7gãÐž½óÉÊë²,i„FÈ¹£§8ãäÂ½k¹¥¦ê/ç{ïêï¦‡2œ/«ü?¯Ô›ìñÜ$þeýœRIåŒg9Ác’zrrNO bÚi¢ ÑºË/$,“ª¯Ýä;Œ× ´<ÛÑn³IvŸb™¥ nm–ÄŸ—nÝÀãŽ3ëÍG,.öó³˜Ù£¹uÊÌrŠ[<±!@Æ:c9ÅZh ì’M5ÄìÌ-‚¼ëÉùqŽGì9¬á ;¨A-ž—évþÖ–^ON·Ô”ŸEý}ú×PO&e[]ÒG¸˜Ûp ƒÃà/Ë·8ûÀ€1ž@¿ÚB*²¼ñì8@p™8Q“žÆH'8«I-%¸‚ F»“åó6°Uù|¶Ú¸ã ò^Äw¥ŠÖK–1ÜÝK,Žddlí²0PÀü“×ükG…¯U«·¶–´w¶ŽÍ¾©yÞú[Zös•¯Á[™6° ¨¼ÉVæq·,# ìãï‘×8îry®A››¨,ãc66»Ë´ã'æÉù?t}¢æH--Òá"›|ˆ¬[í 7¶ö#¸9«––‹$,+Ëqœ\Êøc€yê^Ý¸Äa°«™B-9%«×®‹V´w~vÜTéê¢·þ¼ˆ%·¹• ’[xç•÷2gØS?6åÀÚ õ9É#š@÷bT¸º²C*3Bá¤òÎA9 =úU§Ó"2Ãlá0iÝIc‚2Î@%öç94ùô»'»HÄ¥Ô¾@à Tp£šíx:úÊ:5eºßMý×wµ›Ó_+šº3Ýyvÿ "ºÇ<ÂI>Õ1G·Ë«È«É# àÈÇ øp Jv·šæDûE¿›†Ë’NFr2qŸ½ÇAÜšu•´éí#Ä¦8£2”Ú2Ã/€[ÎTr;qŠz*ý’Îþ(â‰ ;¡TÆâ›;ºÿ àçœk‘Þ8¾Uª¾íé{^×IZéwÓkXÉûÑZo¯_øo×È¡¬ â–ÞR§2„‚Àœü½ùç® SVa†Âüª¼±D‘ŒísŸàä|ä2 æ[‹z”¯s{wn„ÆmáóCO+†GO8Ïeçåº`¯^¼ðG5f{Xžä,k‰<á y™¥voÆ éÛõëI=œ1‹éíÔÀÑ)R#;AÂncäŽ:tÏ#¶TkB.0Œ-ÖÞZÛgumß}fÎJÉ+#2êÔP£žùÈÅi¢%œ3P*Yƒò‚Aì“Ž2r:ƒÐúñiRUQq‰H9!”={~¼“JŽV¥»×²m.ÛßºiYl¾òk˜gL³·rT• ’…wHÁ6ä`–Î3ùÌ4Øe³†&òL‘•%clyÃ®AÂäà0 žüç$[3uÅ˜î¹•pNOÀÉ=† cï{rYK ååä~FÁ •a»"Lär1Ó¯2Äõæ<™C•.fÕ»è¥~½-¿g½Â4¡{[ør¨¶·Žõäx¥’l®qpwÇ»8ärF \cŽ¸ÜÆÓ-g‚yciÏÀ¾rÎwèØÈ#o°Á9ã5¢šfÔxÞæfGusÏÌJÿ µ×œ/LtãÅT7²¶w,l É³;”eúà·¨çîŒsÜgTÃS¦^ '~‹®›¯+k÷ZÖd©Æ*Ó[Ü«%Œk0ŽXƒ”$k#È¨ P2bv‘ƒŸáÇ™ÆÕb)m$É*8óLE‘8'–ÜN Úyàúô+{uº±I'wvš4fÜr íì½=úuú sFlìV$‘ö†HÑù€$§ õ=½¸«Ž] :Ž+•¦ïmRþ½l´îÊT#nkiøÿ _ðÆT¶7Ò½ºÒ£Î¸d\ã8=yãŽÜäR{x]ZâÚé#¸r²#»ÎHÆ6õ ç® ÎFkr;sºÄ.&;só±Ç9êH÷ýSšÕtÐU¢-n Ì| vqœ„{gŒt§S.P‹’Ž‰_[;m¥ÞZýRûÂX{+¥úü¼ú•-àÓ7!„G"“´‹žƒnrYXã¸îp éœ!ÓoPÌtÑ (‰Þ¹é€sÓ#GLçÕšÑnJý¡!‘Tä#“ß?îýp}xÇ‚I¥Õn#·¸–y'qó@r[ Êô÷<ÔWÃÓ¢áN¥4Ô’I&Ý¼¬¬¼ÞºvéÆ FQV~_ÒüJÖÚt¥¦Xá3BÄP^%ÈÎW-×c¡ú©¤·Iþèk¥š?–UQåIR[’O 5x\ÉhÆI¶K4«2ùªŠŒ<¼óœçØ`u«‚Í.VHä€ Ëgfx''9ÆI#±®Z8 sISºku¢ßÞ]úk»Jößl¡B.Ü»ÿ MWe °·Ž%šêÉ†¼»Âù³´œ O¿cÐÓÄh©"ÛÜÏ.ÖV’3nüÄmnq[ŒòznšÖ>J¬òˆæ…qýØP Ž:ä7^0yëWšÍ_79äoaÈ °#q0{ää×mœy”R{vÒÞ¶ÚÏe¥“ÚÆÐ¥Ì®—õýjR •íç›Ìb„+JyÜØÙ•Ç]¿Ôd þËOL²”9-Œ—õÃc'æÝ×œçÚ²ìejP“½ âù°¨†ðqòädÐƒÉäÖÜj÷PÇp“ÍšŠå«‘î <iWNsmª»¶vÓz5»ûì:Rs\Ðßôû×uÔÿÙ