Home
last modified time | relevance | path

Searched refs:ih (Results 1 – 18 of 18) sorted by relevance

/fs/notify/inotify/
Dinotify.c86 static inline void get_inotify_handle(struct inotify_handle *ih) in get_inotify_handle() argument
88 atomic_inc(&ih->count); in get_inotify_handle()
91 static inline void put_inotify_handle(struct inotify_handle *ih) in put_inotify_handle() argument
93 if (atomic_dec_and_test(&ih->count)) { in put_inotify_handle()
94 idr_destroy(&ih->idr); in put_inotify_handle()
95 kfree(ih); in put_inotify_handle()
132 struct inotify_handle *ih = watch->ih; in put_inotify_watch() local
135 ih->in_ops->destroy_watch(watch); in put_inotify_watch()
136 put_inotify_handle(ih); in put_inotify_watch()
153 static int inotify_handle_get_wd(struct inotify_handle *ih, in inotify_handle_get_wd() argument
[all …]
Dinotify_user.c80 struct inotify_handle *ih; /* inotify handle */ member
407 ret = inotify_add_watch(dev->ih, &watch->wdata, inode, mask); in create_watch()
545 inotify_destroy(dev->ih); in inotify_release()
595 struct inotify_handle *ih; in SYSCALL_DEFINE1() local
630 ih = inotify_init(&inotify_user_ops); in SYSCALL_DEFINE1()
631 if (IS_ERR(ih)) { in SYSCALL_DEFINE1()
632 ret = PTR_ERR(ih); in SYSCALL_DEFINE1()
635 dev->ih = ih; in SYSCALL_DEFINE1()
710 ret = inotify_find_update_watch(dev->ih, inode, mask); in SYSCALL_DEFINE3()
740 ret = inotify_rm_wd(dev->ih, wd); in SYSCALL_DEFINE2()
/fs/reiserfs/
Dlbalance.c33 struct item_head *ih; in leaf_copy_dir_entries() local
38 ih = B_N_PITEM_HEAD(source, item_num); in leaf_copy_dir_entries()
40 RFALSE(!is_direntry_le_ih(ih), "vs-10000: item must be directory item"); in leaf_copy_dir_entries()
43 deh = B_I_DEH(source, ih); in leaf_copy_dir_entries()
46 ih_item_len(ih)) - in leaf_copy_dir_entries()
49 source->b_data + ih_location(ih) + in leaf_copy_dir_entries()
64 (last_first == FIRST_TO_LAST && le_ih_k_offset(ih) == DOT_OFFSET) || in leaf_copy_dir_entries()
66 && comp_short_le_keys /*COMP_SHORT_KEYS */ (&ih->ih_key, in leaf_copy_dir_entries()
74 memcpy(&new_ih.ih_key, &ih->ih_key, KEY_SIZE); in leaf_copy_dir_entries()
83 if (from < I_ENTRY_COUNT(ih)) { in leaf_copy_dir_entries()
[all …]
Ditem_ops.c17 static int sd_bytes_number(struct item_head *ih, int block_size) in sd_bytes_number() argument
42 static void sd_print_item(struct item_head *ih, char *item) in sd_print_item() argument
45 if (stat_data_v1(ih)) { in sd_print_item()
61 static void sd_check_item(struct item_head *ih, char *item) in sd_check_item() argument
122 static int direct_bytes_number(struct item_head *ih, int block_size) in direct_bytes_number() argument
124 return ih_item_len(ih); in direct_bytes_number()
142 static void direct_print_item(struct item_head *ih, char *item) in direct_print_item() argument
148 while (j < ih_item_len(ih)) in direct_print_item()
153 static void direct_check_item(struct item_head *ih, char *item) in direct_check_item() argument
216 static int indirect_bytes_number(struct item_head *ih, int block_size) in indirect_bytes_number() argument
[all …]
Dinode.c106 inline void make_le_item_head(struct item_head *ih, const struct cpu_key *key, in make_le_item_head() argument
112 ih->ih_key.k_dir_id = cpu_to_le32(key->on_disk_key.k_dir_id); in make_le_item_head()
113 ih->ih_key.k_objectid = in make_le_item_head()
116 put_ih_version(ih, version); in make_le_item_head()
117 set_le_ih_k_offset(ih, offset); in make_le_item_head()
118 set_le_ih_k_type(ih, type); in make_le_item_head()
119 put_ih_item_len(ih, length); in make_le_item_head()
123 put_ih_entry_count(ih, entry_count); in make_le_item_head()
178 struct item_head *ih, in allocation_needed() argument
183 if (retval == POSITION_FOUND && is_indirect_le_ih(ih) && in allocation_needed()
[all …]
Ddo_balan.c79 struct item_head *ih; in balance_leaf_when_delete() local
88 ih = B_N_PITEM_HEAD(tbS0, item_pos); in balance_leaf_when_delete()
95 RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], in balance_leaf_when_delete()
97 -tb->insert_size[0], ih); in balance_leaf_when_delete()
128 if (is_direntry_le_ih(ih)) { in balance_leaf_when_delete()
148 RFALSE(!ih_item_len(ih), in balance_leaf_when_delete()
249 static int balance_leaf(struct tree_balance *tb, struct item_head *ih, /* item header of inserted i… in balance_leaf() argument
287 zeros_num = ih_item_len(ih); in balance_leaf()
317 ih_item_len(ih) - tb->lbytes; in balance_leaf()
319 put_ih_item_len(ih, in balance_leaf()
[all …]
Ddir.c53 struct item_head *ih, tmp_ih; in reiserfs_readdir() local
90 ih = de.de_ih; in reiserfs_readdir()
91 store_ih(&tmp_ih, ih); in reiserfs_readdir()
94 RFALSE(COMP_SHORT_KEYS(&(ih->ih_key), &pos_key), in reiserfs_readdir()
96 ih, &pos_key); in reiserfs_readdir()
102 RFALSE(I_ENTRY_COUNT(ih) < entry_num, in reiserfs_readdir()
104 entry_num, I_ENTRY_COUNT(ih)); in reiserfs_readdir()
107 || entry_num < I_ENTRY_COUNT(ih)) { in reiserfs_readdir()
110 B_I_DEH(bh, ih) + entry_num; in reiserfs_readdir()
112 for (; entry_num < I_ENTRY_COUNT(ih); in reiserfs_readdir()
[all …]
Dprints.c112 static void sprintf_item_head(char *buf, struct item_head *ih) in sprintf_item_head() argument
114 if (ih) { in sprintf_item_head()
116 (ih_version(ih) == KEY_FORMAT_3_6) ? "*3.6* " : "*3.5*"); in sprintf_item_head()
117 sprintf_le_key(buf + strlen(buf), &(ih->ih_key)); in sprintf_item_head()
120 ih_item_len(ih), ih_location(ih), ih_free_space(ih)); in sprintf_item_head()
427 struct item_head *ih; in print_leaf() local
437 ih = B_N_PITEM_HEAD(bh, 0); in print_leaf()
446 &(ih->ih_key), &((ih + nr - 1)->ih_key)); in print_leaf()
460 ih += from; in print_leaf()
465 for (i = from; i < to; i++, ih++) { in print_leaf()
[all …]
Dstree.c439 struct item_head *ih; in is_leaf() local
458 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; in is_leaf()
459 used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); in is_leaf()
470 ih = (struct item_head *)(buf + BLKH_SIZE); in is_leaf()
472 for (i = 0; i < nr; i++, ih++) { in is_leaf()
473 if (le_ih_k_type(ih) == TYPE_ANY) { in is_leaf()
476 ih); in is_leaf()
479 if (ih_location(ih) >= blocksize in is_leaf()
480 || ih_location(ih) < IH_SIZE * nr) { in is_leaf()
483 ih); in is_leaf()
[all …]
Dxattr.c219 struct item_head *ih, tmp_ih; in __xattr_readdir() local
259 ih = de.de_ih; in __xattr_readdir()
261 if (!is_direntry_le_ih(ih)) { in __xattr_readdir()
262 reiserfs_warning(inode->i_sb, "not direntry %h", ih); in __xattr_readdir()
265 copy_item_head(&tmp_ih, ih); in __xattr_readdir()
268 RFALSE(COMP_SHORT_KEYS(&(ih->ih_key), &pos_key), in __xattr_readdir()
270 ih, &pos_key); in __xattr_readdir()
283 d_reclen = entry_length(bh, ih, entry_num); in __xattr_readdir()
284 d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh); in __xattr_readdir()
Dfix_node.c79 struct item_head *ih; in create_virtual_node() local
107 ih = B_N_PITEM_HEAD(Sh, 0); in create_virtual_node()
110 if (op_is_left_mergeable(&(ih->ih_key), Sh->b_size) in create_virtual_node()
128 vi->vi_item_len += ih_item_len(ih + j) + IH_SIZE; in create_virtual_node()
129 vi->vi_ih = ih + j; in create_virtual_node()
130 vi->vi_item = B_I_PITEM(Sh, ih + j); in create_virtual_node()
674 struct item_head *ih; in are_leaves_removable() local
680 ih = B_N_PITEM_HEAD(S0, 0); in are_leaves_removable()
682 && !comp_short_le_keys(&(ih->ih_key), in are_leaves_removable()
685 if (is_direntry_le_ih(ih)) { in are_leaves_removable()
[all …]
Dsuper.c152 struct item_head *ih; in finish_unfinished() local
212 ih = B_N_PITEM_HEAD(bh, item_pos); in finish_unfinished()
214 if (le32_to_cpu(ih->ih_key.k_dir_id) != MAX_KEY_OBJECTID) in finish_unfinished()
218 save_link_key = ih->ih_key; in finish_unfinished()
219 if (is_indirect_le_ih(ih)) in finish_unfinished()
225 item = B_I_PITEM(bh, ih); in finish_unfinished()
228 le32_to_cpu(ih->ih_key.k_objectid); in finish_unfinished()
332 struct item_head ih; in add_save_link() local
357 make_le_item_head(&ih, &key, key.version, in add_save_link()
370 make_le_item_head(&ih, &key, key.version, 1, TYPE_INDIRECT, in add_save_link()
[all …]
Dibalance.c126 struct reiserfs_key *ih; in internal_insert_childs() local
156 ih = B_N_PDELIM_KEY(cur, ((to == -1) ? 0 : to)); in internal_insert_childs()
158 memmove(ih + count, ih, in internal_insert_childs()
162 memcpy(ih, inserted, KEY_SIZE); in internal_insert_childs()
164 memcpy(ih + 1, inserted + 1, KEY_SIZE); in internal_insert_childs()
Dbitmap.c724 struct item_head *ih; in get_left_neighbor() local
736 ih = get_ih(path); in get_left_neighbor()
742 if (!hint->formatted_node && is_indirect_le_ih(ih)) { in get_left_neighbor()
745 if (pos_in_item == I_UNFM_NUM(ih)) in get_left_neighbor()
Dnamei.c28 struct item_head *ih = de->de_ih; in bin_search_in_dir_item() local
33 rbound = I_ENTRY_COUNT(ih) - 1; in bin_search_in_dir_item()
/fs/coda/
Dupcall.c52 inp->ih.opcode = opcode; in alloc_upcall()
53 inp->ih.pid = current->pid; in alloc_upcall()
54 inp->ih.pgid = task_pgrp_nr(current); in alloc_upcall()
55 inp->ih.uid = current_fsuid(); in alloc_upcall()
169 inp->ih.uid = uid; in venus_close()
686 req->uc_opcode = ((union inputArgs *)buffer)->ih.opcode; in coda_upcall()
691 ((union inputArgs *)buffer)->ih.unique = req->uc_unique; in coda_upcall()
746 sig_inputArgs->ih.opcode = CODA_SIGNAL; in coda_upcall()
747 sig_inputArgs->ih.unique = req->uc_unique; in coda_upcall()
750 sig_req->uc_opcode = sig_inputArgs->ih.opcode; in coda_upcall()
[all …]
/fs/fuse/
Ddev.c706 struct fuse_in_header ih; in fuse_read_interrupt() local
708 unsigned reqsize = sizeof(ih) + sizeof(arg); in fuse_read_interrupt()
713 memset(&ih, 0, sizeof(ih)); in fuse_read_interrupt()
715 ih.len = reqsize; in fuse_read_interrupt()
716 ih.opcode = FUSE_INTERRUPT; in fuse_read_interrupt()
717 ih.unique = req->intr_unique; in fuse_read_interrupt()
725 err = fuse_copy_one(&cs, &ih, sizeof(ih)); in fuse_read_interrupt()
/fs/jfs/
Djfs_dtree.c3587 struct idtentry *ih; in dtCompare() local
3609 ih = (struct idtentry *) & p->slot[si]; in dtCompare()
3610 si = ih->next; in dtCompare()
3611 name = ih->name; in dtCompare()
3612 namlen = ih->namlen; in dtCompare()
3665 struct idtentry *ih; in ciCompare() local
3705 ih = (struct idtentry *) & p->slot[si]; in ciCompare()
3706 si = ih->next; in ciCompare()
3707 name = ih->name; in ciCompare()
3708 namlen = ih->namlen; in ciCompare()
[all …]