/fs/reiserfs/ |
H A D | dir.c | 70 struct item_head *ih, tmp_ih; local 111 ih = de.de_ih; 112 store_ih(&tmp_ih, ih); 115 RFALSE(COMP_SHORT_KEYS(&ih->ih_key, &pos_key), 117 ih, &pos_key); 126 RFALSE(ih_entry_count(ih) < entry_num, 128 entry_num, ih_entry_count(ih)); 135 || entry_num < ih_entry_count(ih)) { 137 B_I_DEH(bh, ih) + entry_num; 139 for (; entry_num < ih_entry_count(ih); [all...] |
H A D | ibalance.c | 134 struct reiserfs_key *ih; local 164 ih = internal_key(cur, ((to == -1) ? 0 : to)); 166 memmove(ih + count, ih, 170 memcpy(ih, inserted, KEY_SIZE); 172 memcpy(ih + 1, inserted + 1, KEY_SIZE);
|
H A D | prints.c | 112 static void sprintf_item_head(char *buf, struct item_head *ih) argument 114 if (ih) { 116 (ih_version(ih) == KEY_FORMAT_3_6) ? "*3.6* " : "*3.5*"); 117 sprintf_le_key(buf + strlen(buf), &(ih->ih_key)); 120 ih_item_len(ih), ih_location(ih), ih_free_space(ih)); 462 struct item_head *ih; local 472 ih = item_head(bh, 0); 481 &(ih 750 struct item_head *ih; local [all...] |
H A D | do_balan.c | 83 struct item_head *ih = item_head(tbS0, item_pos); local 86 RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], 87 "vs-12013: mode Delete, insert size %d, ih to be deleted %h", 88 -tb->insert_size[0], ih); local 113 struct item_head *ih = item_head(tbS0, item_pos); local 118 if (is_direntry_le_ih(ih)) { 140 RFALSE(!ih_item_len(ih), 245 struct item_head *ih; local 254 ih = item_head(tbS0, item_pos); 290 struct item_head *const ih, 289 balance_leaf_insert_left(struct tree_balance *tb, struct item_head *const ih, const char * const body) argument 357 balance_leaf_paste_left_shift_dirent(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 419 balance_leaf_paste_left_shift(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 538 balance_leaf_paste_left_whole(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 592 balance_leaf_paste_left(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 605 balance_leaf_left(struct tree_balance *tb, struct item_head * const ih, const char * const body, int flag) argument 627 balance_leaf_insert_right(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 716 balance_leaf_paste_right_shift_dirent(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 767 balance_leaf_paste_right_shift(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 845 balance_leaf_paste_right_whole(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 889 balance_leaf_paste_right(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 913 balance_leaf_right(struct tree_balance *tb, struct item_head * const ih, const char * const body, int flag) argument 928 balance_leaf_new_nodes_insert(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) argument 1020 balance_leaf_new_nodes_paste_dirent(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) argument 1075 balance_leaf_new_nodes_paste_shift(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) argument 1148 balance_leaf_new_nodes_paste_whole(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) argument 1201 balance_leaf_new_nodes_paste(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) argument 1231 balance_leaf_new_nodes(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int flag) argument 1271 balance_leaf_finish_node_insert(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 1288 balance_leaf_finish_node_paste_dirent(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 1322 balance_leaf_finish_node_paste(struct tree_balance *tb, struct item_head * const ih, const char * const body) argument 1366 balance_leaf_finish_node(struct tree_balance *tb, struct item_head * const ih, const char * const body, int flag) argument 1393 balance_leaf(struct tree_balance *tb, struct item_head *ih, const char *body, int flag, struct item_head *insert_key, struct buffer_head **insert_ptr) argument 1858 do_balance(struct tree_balance *tb, struct item_head *ih, const char *body, int flag) argument [all...] |
H A D | item_ops.c | 19 static int sd_bytes_number(struct item_head *ih, int block_size) argument 44 static void sd_print_item(struct item_head *ih, char *item) argument 47 if (stat_data_v1(ih)) { 63 static void sd_check_item(struct item_head *ih, char *item) argument 122 static int direct_bytes_number(struct item_head *ih, int block_size) argument 124 return ih_item_len(ih); 142 static void direct_print_item(struct item_head *ih, char *item) argument 148 while (j < ih_item_len(ih)) 153 static void direct_check_item(struct item_head *ih, char *item) argument 213 static int indirect_bytes_number(struct item_head *ih, in argument 268 indirect_print_item(struct item_head *ih, char *item) argument 291 indirect_check_item(struct item_head *ih, char *item) argument 357 direntry_bytes_number(struct item_head *ih, int block_size) argument 380 direntry_print_item(struct item_head *ih, char *item) argument 420 direntry_check_item(struct item_head *ih, char *item) argument 644 errcatch_bytes_number(struct item_head *ih, int block_size) argument 665 errcatch_print_item(struct item_head *ih, char *item) argument 671 errcatch_check_item(struct item_head *ih, char *item) argument [all...] |
H A D | lbalance.c | 26 struct item_head *ih; local 31 ih = item_head(source, item_num); 33 RFALSE(!is_direntry_le_ih(ih), "vs-10000: item must be directory item"); 39 deh = B_I_DEH(source, ih); 42 ih_item_len(ih)) - 45 source->b_data + ih_location(ih) + 63 (last_first == FIRST_TO_LAST && le_ih_k_offset(ih) == DOT_OFFSET) || 65 && comp_short_le_keys /*COMP_SHORT_KEYS */ (&ih->ih_key, 73 memcpy(&new_ih.ih_key, &ih->ih_key, KEY_SIZE); 82 if (from < ih_entry_count(ih)) { 141 struct item_head *ih; local 191 "entirely (%h)", ih); local 206 ih); local 259 "vs-10050: items %h and %h do not match", ih, dih); local 320 struct item_head *ih; local 419 struct item_head *ih; local 868 struct item_head *ih; local 909 struct item_head *ih; local 985 struct item_head *ih; local 1072 leaf_cut_entries(struct buffer_head *bh, struct item_head *ih, int from, int del_count) argument 1151 struct item_head *ih; local 1198 "10205: invalid ih_free_space (%h)", ih); local 1248 struct item_head *ih; local 1321 struct item_head *ih; local 1416 ih, deh + i - 1, i, deh + i); local 1422 ih, i, deh + i, deh + i + 1); local [all...] |
H A D | namei.c | 31 struct item_head *ih = de->de_ih; local 36 rbound = ih_entry_count(ih) - 1;
|
H A D | bitmap.c | 850 struct item_head *ih; local 865 ih = tp_item_head(path); 875 if (!hint->formatted_node && is_indirect_le_ih(ih)) { 876 if (pos_in_item == I_UNFM_NUM(ih))
|
H A D | fix_node.c | 53 struct item_head *ih; local 81 ih = item_head(Sh, 0); 84 if (op_is_left_mergeable(&ih->ih_key, Sh->b_size) 105 vi->vi_item_len += ih_item_len(ih + j) + IH_SIZE; 106 vi->vi_ih = ih + j; 107 vi->vi_item = ih_item_body(Sh, ih + j); 254 * check whether L[0] can hold ih and at least one byte 339 * check whether R[0] can hold ih and at least one 716 struct item_head *ih; local 722 ih 1280 struct item_head *ih; local [all...] |
H A D | inode.c | 136 inline void make_le_item_head(struct item_head *ih, const struct cpu_key *key, argument 142 ih->ih_key.k_dir_id = cpu_to_le32(key->on_disk_key.k_dir_id); 143 ih->ih_key.k_objectid = 146 put_ih_version(ih, version); 147 set_le_ih_k_offset(ih, offset); 148 set_le_ih_k_type(ih, type); 149 put_ih_item_len(ih, length); 150 /* set_ih_free_space (ih, 0); */ 155 put_ih_entry_count(ih, entry_count); 214 struct item_head *ih, 213 allocation_needed(int retval, b_blocknr_t allocated, struct item_head *ih, __le32 * item, int pos_in_item) argument 225 indirect_item_found(int retval, struct item_head *ih) argument 290 struct item_head *ih, tmp_ih; local 666 struct item_head *ih, tmp_ih; local 1240 struct item_head *ih; local 1428 struct item_head *ih; local 1454 struct item_head *ih, tmp_ih; local 1804 reiserfs_new_directory(struct reiserfs_transaction_handle *th, struct inode *inode, struct item_head *ih, struct treepath *path, struct inode *dir) argument 1867 reiserfs_new_symlink(struct reiserfs_transaction_handle *th, struct inode *inode, struct item_head *ih, struct treepath *path, const char *symname, int item_len) argument 1938 struct item_head ih; local 2371 struct item_head *ih; local [all...] |
H A D | stree.c | 392 struct item_head *ih; local 412 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; 413 used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); 427 ih = (struct item_head *)(buf + BLKH_SIZE); 429 for (i = 0; i < nr; i++, ih++) { 430 if (le_ih_k_type(ih) == TYPE_ANY) { 433 ih); 436 if (ih_location(ih) >= blocksize 437 || ih_location(ih) < IH_SIZE * nr) { 440 ih); 909 struct item_head *ih; local 1198 key2type(struct reiserfs_key *ih) argument 1211 head2type(struct item_head *ih) argument 2167 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) argument [all...] |
H A D | super.c | 199 struct item_head *ih; local 267 ih = item_head(bh, item_pos); 269 if (le32_to_cpu(ih->ih_key.k_dir_id) != MAX_KEY_OBJECTID) 273 save_link_key = ih->ih_key; 274 if (is_indirect_le_ih(ih)) 280 item = ih_item_body(bh, ih); 283 le32_to_cpu(ih->ih_key.k_objectid); 401 struct item_head ih; local 426 make_le_item_head(&ih, &key, key.version, 440 make_le_item_head(&ih, [all...] |
H A D | reiserfs.h | 1393 #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved) 1394 #define ih_version(ih) le16_to_cpu((ih)->ih_version) 1395 #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count) 1396 #define ih_location(ih) le16_to_cpu((ih)->ih_item_location) 1397 #define ih_item_len(ih) le16_to_cpu((ih) 1477 le_ih_k_offset(const struct item_head *ih) argument 1491 le_ih_k_type(const struct item_head *ih) argument 1512 add_le_ih_k_offset(struct item_head *ih, loff_t offset) argument 1517 set_le_ih_k_offset(struct item_head *ih, loff_t offset) argument 1532 set_le_ih_k_type(struct item_head *ih, int type) argument 1558 is_direntry_le_ih(struct item_head *ih) argument 1563 is_direct_le_ih(struct item_head *ih) argument 1568 is_indirect_le_ih(struct item_head *ih) argument 1573 is_statdata_le_ih(struct item_head *ih) argument 2197 struct item_head *ih = reiserfs_node_data(bh); local 2209 ih_item_body(const struct buffer_head *bh, const struct item_head *ih) argument 2248 entry_length(const struct buffer_head *bh, const struct item_head *ih, int pos_in_item) argument [all...] |
/fs/fuse/ |
H A D | dev.c | 1049 struct fuse_in_header ih; variable in typeref:struct:fuse_in_header 1051 unsigned reqsize = sizeof(ih) + sizeof(arg); 1056 memset(&ih, 0, sizeof(ih)); 1058 ih.len = reqsize; 1059 ih.opcode = FUSE_INTERRUPT; 1060 ih.unique = req->intr_unique; 1067 err = fuse_copy_one(cs, &ih, sizeof(ih)); 1107 struct fuse_in_header ih variable in typeref:struct:fuse_in_header 1139 struct fuse_in_header ih = { variable in typeref:struct:fuse_in_header [all...] |
/fs/jfs/ |
H A D | jfs_dtree.c | 3599 struct idtentry *ih; local 3621 ih = (struct idtentry *) & p->slot[si]; 3622 si = ih->next; 3623 name = ih->name; 3624 namlen = ih->namlen; 3677 struct idtentry *ih; local 3717 ih = (struct idtentry *) & p->slot[si]; 3718 si = ih->next; 3719 name = ih->name; 3720 namlen = ih 3849 struct idtentry *ih; local 3912 struct idtentry *ih = NULL; local [all...] |