Home
last modified time | relevance | path

Searched refs:h (Results 1 – 25 of 61) sorted by relevance

123

/fs/reiserfs/
Dibalance.c29 int h, in internal_define_dest_src_infos() argument
42 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos()
43 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos()
44 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in internal_define_dest_src_infos()
46 dest_bi->bi_bh = tb->L[h]; in internal_define_dest_src_infos()
47 dest_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
48 dest_bi->bi_position = get_left_neighbor_position(tb, h); in internal_define_dest_src_infos()
49 *d_key = tb->lkey[h]; in internal_define_dest_src_infos()
50 *cf = tb->CFL[h]; in internal_define_dest_src_infos()
54 src_bi->bi_bh = tb->L[h]; in internal_define_dest_src_infos()
[all …]
Dfix_node.c51 static void create_virtual_node(struct tree_balance *tb, int h) in create_virtual_node() argument
58 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
65 if (h) { in create_virtual_node()
194 static void check_left(struct tree_balance *tb, int h, int cur_free) in check_left() argument
204 if (h > 0) { in check_left()
205 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
213 tb->lnum[h] = 0; in check_left()
280 static void check_right(struct tree_balance *tb, int h, int cur_free) in check_right() argument
290 if (h > 0) { in check_right()
[all …]
Dprints.c642 int h = 0; in store_print_tb() local
658 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
659 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb()
662 h) > ILLEGAL_PATH_ELEMENT_OFFSET) { in store_print_tb()
663 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb()
664 tbFh = PATH_H_PPARENT(tb->tb_path, h); in store_print_tb()
671 h, in store_print_tb()
674 (tb->L[h]) ? (long long)(tb->L[h]->b_blocknr) : (-1LL), in store_print_tb()
675 (tb->L[h]) ? atomic_read(&tb->L[h]->b_count) : -1, in store_print_tb()
676 (tb->R[h]) ? (long long)(tb->R[h]->b_blocknr) : (-1LL), in store_print_tb()
[all …]
Ddo_balan.c1590 int get_left_neighbor_position(struct tree_balance *tb, int h) in get_left_neighbor_position() argument
1592 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_left_neighbor_position()
1594 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, in get_left_neighbor_position()
1596 h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h)); in get_left_neighbor_position()
1599 return B_NR_ITEMS(tb->FL[h]); in get_left_neighbor_position()
1604 int get_right_neighbor_position(struct tree_balance *tb, int h) in get_right_neighbor_position() argument
1606 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_right_neighbor_position()
1608 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, in get_right_neighbor_position()
1610 h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]); in get_right_neighbor_position()
1612 if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h))) in get_right_neighbor_position()
[all …]
/fs/nls/
Dnls_euc-jp.c19 #define IS_SJIS_JISX0208(h, l) ((((0x81 <= (h)) && ((h) <= 0x9F)) \ argument
20 || ((0xE0 <= (h)) && ((h) <= 0xEA))) \
23 #define IS_SJIS_UDC_LOW(h, l) (((0xF0 <= (h)) && ((h) <= 0xF4)) \ argument
25 #define IS_SJIS_UDC_HI(h, l) (((0xF5 <= (h)) && ((h) <= 0xF9)) \ argument
27 #define IS_SJIS_IBM(h, l) (((0xFA <= (h)) && ((h) <= 0xFC)) \ argument
29 #define IS_SJIS_NECIBM(h, l) (((0xED <= (h)) && ((h) <= 0xEE)) \ argument
44 #define IS_EUC_JISX0208(h, l) (IS_EUC_BYTE(h) && IS_EUC_BYTE(l)) argument
45 #define IS_EUC_JISX0201KANA(h, l) (((h) == SS2) && (0xA1 <= (l) && (l) <= 0xDF)) argument
46 #define IS_EUC_UDC_LOW(h, l) (((0xF5 <= (h)) && ((h) <= 0xFE)) \ argument
48 #define IS_EUC_UDC_HI(h, l) IS_EUC_UDC_LOW(h, l) /* G3 block */ argument
[all …]
/fs/nfs/
Ddns_resolve.c61 struct cache_head h; member
77 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_update()
78 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_update()
90 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_init()
91 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_init()
108 item = container_of(ref, struct nfs_dns_ent, h.ref); in nfs_dns_ent_put()
121 return &item->h; in nfs_dns_ent_alloc()
135 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_request()
144 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_upcall()
159 a = container_of(ca, struct nfs_dns_ent, h); in nfs_dns_match()
[all …]
Dpnfs_dev.c341 long h; in nfs4_deviceid_purge_client() local
345 for (h = 0; h < NFS4_DEVICE_ID_HASH_SIZE; h++) in nfs4_deviceid_purge_client()
346 _deviceid_purge_client(clp, h); in nfs4_deviceid_purge_client()
/fs/nfsd/
Dnfs4idmap.c63 struct cache_head h; member
78 struct ent *new = container_of(cnew, struct ent, h); in ent_init()
79 struct ent *itm = container_of(citm, struct ent, h); in ent_init()
91 struct ent *map = container_of(ref, struct ent, h.ref); in ent_put()
100 return &e->h; in ent_alloc()
128 struct ent *ent = container_of(ch, struct ent, h); in idtoname_request()
142 struct ent *a = container_of(ca, struct ent, h); in idtoname_match()
143 struct ent *b = container_of(cb, struct ent, h); in idtoname_match()
150 idtoname_show(struct seq_file *m, struct cache_detail *cd, struct cache_head *h) in idtoname_show() argument
154 if (h == NULL) { in idtoname_show()
[all …]
Dexport.c43 struct svc_expkey *key = container_of(ref, struct svc_expkey, h.ref); in expkey_put()
45 if (test_bit(CACHE_VALID, &key->h.flags) && in expkey_put()
46 !test_bit(CACHE_NEGATIVE, &key->h.flags)) in expkey_put()
53 struct cache_head *h, in expkey_request() argument
57 struct svc_expkey *ek = container_of(h, struct svc_expkey, h); in expkey_request()
118 key.h.flags = 0; in expkey_parse()
119 key.h.expiry_time = get_expiry(&mesg); in expkey_parse()
120 if (key.h.expiry_time == 0) in expkey_parse()
140 set_bit(CACHE_NEGATIVE, &key.h.flags); in expkey_parse()
159 cache_put(&ek->h, cd); in expkey_parse()
[all …]
Dexport.h50 struct cache_head h; member
71 struct cache_head h; member
105 cache_put(&exp->h, exp->cd); in exp_put()
110 cache_get(&exp->h); in exp_get()
/fs/adfs/
Ddir_fplus.c18 struct adfs_bigdirheader *h; in adfs_fplus_read() local
40 h = (struct adfs_bigdirheader *)dir->bh_fplus[0]->b_data; in adfs_fplus_read()
41 size = le32_to_cpu(h->bigdirsize); in adfs_fplus_read()
49 if (h->bigdirversion[0] != 0 || h->bigdirversion[1] != 0 || in adfs_fplus_read()
50 h->bigdirversion[2] != 0 || size & 2047 || in adfs_fplus_read()
51 h->bigdirstartname != cpu_to_le32(BIGDIRSTARTNAME)) { in adfs_fplus_read()
95 t->bigdirendmasseq != h->startmasseq || in adfs_fplus_read()
102 dir->parent_id = le32_to_cpu(h->bigdirparent); in adfs_fplus_read()
125 struct adfs_bigdirheader *h = in adfs_fplus_setpos() local
129 if (fpos <= le32_to_cpu(h->bigdirentries)) { in adfs_fplus_setpos()
[all …]
/fs/hugetlbfs/
Dinode.c136 struct hstate *h = hstate_file(file); in hugetlbfs_file_mmap() local
161 if (vma->vm_pgoff & (~huge_page_mask(h) >> PAGE_SHIFT)) in hugetlbfs_file_mmap()
175 vma->vm_pgoff >> huge_page_order(h), in hugetlbfs_file_mmap()
176 len >> huge_page_shift(h), vma, in hugetlbfs_file_mmap()
200 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area() local
203 if (len & ~huge_page_mask(h)) in hugetlb_get_unmapped_area()
215 addr = ALIGN(addr, huge_page_size(h)); in hugetlb_get_unmapped_area()
226 info.align_mask = PAGE_MASK & ~huge_page_mask(h); in hugetlb_get_unmapped_area()
269 struct hstate *h = hstate_file(file); in hugetlbfs_read_iter() local
272 unsigned long index = iocb->ki_pos >> huge_page_shift(h); in hugetlbfs_read_iter()
[all …]
/fs/ncpfs/
Dsock.c234 …init_header(struct ncp_server *server, struct ncp_request_reply *req, struct ncp_request_header *h) in ncp_init_header() argument
237 h->conn_low = server->connection; in ncp_init_header()
238 h->conn_high = server->connection >> 8; in ncp_init_header()
239 h->sequence = ++server->sequence; in ncp_init_header()
245 struct ncp_request_header *h = req->tx_iov[1].iov_base; in ncpdgram_start_request() local
247 ncp_init_header(server, req, h); in ncpdgram_start_request()
273 struct ncp_request_header *h = req->tx_iov[1].iov_base; in ncptcp_start_request() local
275 ncp_init_header(server, req, h); in ncptcp_start_request()
770 struct ncp_request_header *h; in ncp_request2() local
774 h = (struct ncp_request_header *) (server->packet); in ncp_request2()
[all …]
/fs/btrfs/
Dprops.c63 u64 h = btrfs_name_hash(p->xattr_name, strlen(p->xattr_name)); in btrfs_props_init() local
65 hash_add(prop_handlers_ht, &p->node, h); in btrfs_props_init()
71 struct hlist_head *h; in find_prop_handlers_by_hash() local
73 h = &prop_handlers_ht[hash_min(hash, BTRFS_PROP_HANDLERS_HT_BITS)]; in find_prop_handlers_by_hash()
74 if (hlist_empty(h)) in find_prop_handlers_by_hash()
77 return h; in find_prop_handlers_by_hash()
84 struct prop_handler *h; in find_prop_handler() local
94 hlist_for_each_entry(h, handlers, node) in find_prop_handler()
95 if (!strcmp(h->xattr_name, name)) in find_prop_handler()
96 return h; in find_prop_handler()
[all …]
Dbtrfs_inode.h229 u64 h = objectid ^ (root->objectid * GOLDEN_RATIO_PRIME); in btrfs_inode_hash() local
232 h = (h >> 32) ^ (h & 0xffffffff); in btrfs_inode_hash()
235 return (unsigned long)h; in btrfs_inode_hash()
240 unsigned long h = btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root); in btrfs_insert_inode_hash() local
242 __insert_inode_hash(inode, h); in btrfs_insert_inode_hash()
Dtransaction.c482 struct btrfs_trans_handle *h; in start_transaction() local
497 h = current->journal_info; in start_transaction()
498 h->use_count++; in start_transaction()
499 WARN_ON(h->use_count > 2); in start_transaction()
500 h->orig_rsv = h->block_rsv; in start_transaction()
501 h->block_rsv = NULL; in start_transaction()
531 h = kmem_cache_zalloc(btrfs_trans_handle_cachep, GFP_NOFS); in start_transaction()
532 if (!h) { in start_transaction()
567 h->transid = cur_trans->transid; in start_transaction()
568 h->transaction = cur_trans; in start_transaction()
[all …]
Dcheck-integrity.c273 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h);
275 struct btrfsic_block_hashtable *h);
280 struct btrfsic_block_hashtable *h);
282 struct btrfsic_block_link_hashtable *h);
285 struct btrfsic_block_link_hashtable *h);
292 struct btrfsic_block_link_hashtable *h);
294 struct btrfsic_dev_state_hashtable *h);
297 struct btrfsic_dev_state_hashtable *h);
300 struct btrfsic_dev_state_hashtable *h);
501 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h) in btrfsic_block_hashtable_init() argument
[all …]
/fs/fuse/
Dxattr.c28 args.in.h.opcode = FUSE_SETXATTR; in fuse_setxattr()
29 args.in.h.nodeid = get_node_id(inode); in fuse_setxattr()
63 args.in.h.opcode = FUSE_GETXATTR; in fuse_getxattr()
64 args.in.h.nodeid = get_node_id(inode); in fuse_getxattr()
124 args.in.h.opcode = FUSE_LISTXATTR; in fuse_listxattr()
125 args.in.h.nodeid = get_node_id(inode); in fuse_listxattr()
160 args.in.h.opcode = FUSE_REMOVEXATTR; in fuse_removexattr()
161 args.in.h.nodeid = get_node_id(inode); in fuse_removexattr()
Ddev.c119 req->in.h.uid = from_kuid_munged(&init_user_ns, current_fsuid()); in fuse_req_init_context()
120 req->in.h.gid = from_kgid_munged(&init_user_ns, current_fsgid()); in fuse_req_init_context()
121 req->in.h.pid = pid_nr_ns(task_pid(current), fc->pid_ns); in fuse_req_init_context()
326 req->in.h.len = sizeof(struct fuse_in_header) + in queue_request()
364 req->in.h.unique = fuse_get_unique(fiq); in flush_bg_queue()
470 req->out.h.error = -EINTR; in request_wait_answer()
493 req->out.h.error = -ENOTCONN; in __fuse_request_send()
495 req->in.h.unique = fuse_get_unique(fiq); in __fuse_request_send()
521 if (fc->minor < 4 && args->in.h.opcode == FUSE_STATFS) in fuse_adjust_compat()
525 switch (args->in.h.opcode) { in fuse_adjust_compat()
[all …]
Ddir.c147 args->in.h.opcode = FUSE_LOOKUP; in fuse_lookup_init()
148 args->in.h.nodeid = nodeid; in fuse_lookup_init()
290 req->in.h.opcode = FUSE_CANONICAL_PATH; in fuse_dentry_canonical_path()
291 req->in.h.nodeid = get_node_id(inode); in fuse_dentry_canonical_path()
299 err = req->out.h.error; in fuse_dentry_canonical_path()
490 args.in.h.opcode = FUSE_CREATE; in fuse_create_open()
491 args.in.h.nodeid = get_node_id(dir); in fuse_create_open()
605 args->in.h.nodeid = get_node_id(dir); in create_new_entry()
655 args.in.h.opcode = FUSE_MKNOD; in fuse_mknod()
682 args.in.h.opcode = FUSE_MKDIR; in fuse_mkdir()
[all …]
/fs/befs/
DChangeLog35 a workaround for this problem (compatibility.h) [WD]
76 * Made functions in endian.h to do the correct byteswapping, no matter
84 Uses the functions from endian.h [WD]
107 dir.c, namei.c befs_fs.h to account for it. [WD]
170 * Fixed a couple of compile warnings due to use of malloc.h, when slab.h
173 * Fixed erronous includes of linux/befs_fs_i.h and linux/befs_fs_sb.h
186 include/linux/fs.h. Also, befs_inode_info is huge (because of the
187 symlink string). (super.c, inode.c, befs_fs.h) [WD]
201 (befs_fs.h) [WD].
321 * Permanently removed code that had been provisionally ifdefed out of befs_fs.h
[all …]
/fs/ubifs/
Dlpt.c1448 int err, i, h, iip, shft; in ubifs_lpt_lookup() local
1460 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup()
1579 int err, i, h, iip, shft; in ubifs_lpt_lookup_dirty() local
1594 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
1922 int err = 0, i, h, iip, shft; in ubifs_lpt_scan_nolock() local
1954 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
1957 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1964 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1976 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1983 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
[all …]
/fs/gfs2/
Dbmap.c311 static int lookup_mp_height(struct gfs2_inode *ip, struct metapath *mp, int h) in lookup_mp_height() argument
313 __be64 *ptr = metapointer(h, mp); in lookup_mp_height()
317 return h + 1; in lookup_mp_height()
319 return gfs2_meta_indirect_buffer(ip, h + 1, dblock, &mp->mp_bh[h + 1]); in lookup_mp_height()
365 static int fillup_metapath(struct gfs2_inode *ip, struct metapath *mp, int h) in fillup_metapath() argument
367 unsigned int start_h = h - 1; in fillup_metapath()
370 if (h) { in fillup_metapath()
374 for (; start_h < h; start_h++) { in fillup_metapath()
1101 unsigned int h) in find_nonnull_ptr() argument
1104 unsigned int ptrs = hptrs(sdp, h) - 1; in find_nonnull_ptr()
[all …]
/fs/hpfs/
Dea.c198 unsigned char h[4]; in hpfs_set_ea() local
351 h[0] = 0; in hpfs_set_ea()
352 h[1] = strlen(key); in hpfs_set_ea()
353 h[2] = size & 0xff; in hpfs_set_ea()
354 h[3] = size >> 8; in hpfs_set_ea()
355 …32_to_cpu(fnode->ea_secno), fnode_in_anode(fnode), le32_to_cpu(fnode->ea_size_l), 4, h)) goto bail; in hpfs_set_ea()
356 …fnode->ea_secno), fnode_in_anode(fnode), le32_to_cpu(fnode->ea_size_l) + 4, h[1] + 1, key)) goto b… in hpfs_set_ea()
357 …node->ea_secno), fnode_in_anode(fnode), le32_to_cpu(fnode->ea_size_l) + 5 + h[1], size, data)) got… in hpfs_set_ea()
/fs/
Dfcntl.c282 u64 h; in fcntl_rw_hint() local
286 h = file_write_hint(file); in fcntl_rw_hint()
287 if (copy_to_user(argp, &h, sizeof(*argp))) in fcntl_rw_hint()
291 if (copy_from_user(&h, argp, sizeof(h))) in fcntl_rw_hint()
293 hint = (enum rw_hint) h; in fcntl_rw_hint()
302 h = inode->i_write_hint; in fcntl_rw_hint()
303 if (copy_to_user(argp, &h, sizeof(*argp))) in fcntl_rw_hint()
307 if (copy_from_user(&h, argp, sizeof(h))) in fcntl_rw_hint()
309 hint = (enum rw_hint) h; in fcntl_rw_hint()

123