Home
last modified time | relevance | path

Searched refs:h (Results 1 – 25 of 70) 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.c1579 int get_left_neighbor_position(struct tree_balance *tb, int h) in get_left_neighbor_position() argument
1581 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_left_neighbor_position()
1583 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, in get_left_neighbor_position()
1585 h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h)); in get_left_neighbor_position()
1588 return B_NR_ITEMS(tb->FL[h]); in get_left_neighbor_position()
1593 int get_right_neighbor_position(struct tree_balance *tb, int h) in get_right_neighbor_position() argument
1595 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_right_neighbor_position()
1597 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, in get_right_neighbor_position()
1599 h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]); in get_right_neighbor_position()
1601 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.c62 struct cache_head h; member
79 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_update()
80 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_update()
92 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_init()
93 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_init()
119 item = container_of(ref, struct nfs_dns_ent, h.ref); in nfs_dns_ent_put()
131 return &item->h; in nfs_dns_ent_alloc()
145 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_request()
154 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_upcall()
169 a = container_of(ca, struct nfs_dns_ent, h); in nfs_dns_match()
[all …]
/fs/nfsd/
Dnfs4idmap.c63 struct cache_head h; member
79 struct ent *new = container_of(cnew, struct ent, h); in ent_init()
80 struct ent *itm = container_of(citm, struct ent, h); in ent_init()
92 struct ent *map = container_of(ref, struct ent, h.ref); in ent_put()
101 return &e->h; in ent_alloc()
129 struct ent *ent = container_of(ch, struct ent, h); in idtoname_request()
143 struct ent *a = container_of(ca, struct ent, h); in idtoname_match()
144 struct ent *b = container_of(cb, struct ent, h); in idtoname_match()
151 idtoname_show(struct seq_file *m, struct cache_detail *cd, struct cache_head *h) in idtoname_show() argument
155 if (h == NULL) { in idtoname_show()
[all …]
Dexport.c44 struct svc_expkey *key = container_of(ref, struct svc_expkey, h.ref); in expkey_put()
46 if (test_bit(CACHE_VALID, &key->h.flags) && in expkey_put()
47 !test_bit(CACHE_NEGATIVE, &key->h.flags)) in expkey_put()
54 struct cache_head *h, in expkey_request() argument
58 struct svc_expkey *ek = container_of(h, struct svc_expkey, h); in expkey_request()
119 key.h.flags = 0; in expkey_parse()
120 key.h.expiry_time = get_expiry(&mesg); in expkey_parse()
121 if (key.h.expiry_time == 0) in expkey_parse()
141 set_bit(CACHE_NEGATIVE, &key.h.flags); in expkey_parse()
160 cache_put(&ek->h, cd); in expkey_parse()
[all …]
Dexport.h50 struct cache_head h; member
72 struct cache_head h; member
107 cache_put(&exp->h, exp->cd); in exp_put()
112 cache_get(&exp->h); in exp_get()
/fs/adfs/
Ddir_fplus.c14 struct adfs_bigdirheader *h; in adfs_fplus_read() local
36 h = (struct adfs_bigdirheader *)dir->bh_fplus[0]->b_data; in adfs_fplus_read()
37 size = le32_to_cpu(h->bigdirsize); in adfs_fplus_read()
44 if (h->bigdirversion[0] != 0 || h->bigdirversion[1] != 0 || in adfs_fplus_read()
45 h->bigdirversion[2] != 0 || size & 2047 || in adfs_fplus_read()
46 h->bigdirstartname != cpu_to_le32(BIGDIRSTARTNAME)) { in adfs_fplus_read()
90 t->bigdirendmasseq != h->startmasseq || in adfs_fplus_read()
96 dir->parent_id = le32_to_cpu(h->bigdirparent); in adfs_fplus_read()
119 struct adfs_bigdirheader *h = in adfs_fplus_setpos() local
123 if (fpos <= le32_to_cpu(h->bigdirentries)) { in adfs_fplus_setpos()
[all …]
/fs/hugetlbfs/
Dinode.c142 struct hstate *h = hstate_file(file); in hugetlbfs_file_mmap() local
171 if (vma->vm_pgoff & (~huge_page_mask(h) >> PAGE_SHIFT)) in hugetlbfs_file_mmap()
185 vma->vm_pgoff >> huge_page_order(h), in hugetlbfs_file_mmap()
186 len >> huge_page_shift(h), vma, in hugetlbfs_file_mmap()
208 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area_bottomup() local
215 info.align_mask = PAGE_MASK & ~huge_page_mask(h); in hugetlb_get_unmapped_area_bottomup()
224 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area_topdown() local
231 info.align_mask = PAGE_MASK & ~huge_page_mask(h); in hugetlb_get_unmapped_area_topdown()
258 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area() local
261 if (len & ~huge_page_mask(h)) in hugetlb_get_unmapped_area()
[all …]
/fs/btrfs/
Dprops.c28 struct hlist_head *h; in find_prop_handlers_by_hash() local
30 h = &prop_handlers_ht[hash_min(hash, BTRFS_PROP_HANDLERS_HT_BITS)]; in find_prop_handlers_by_hash()
31 if (hlist_empty(h)) in find_prop_handlers_by_hash()
34 return h; in find_prop_handlers_by_hash()
41 struct prop_handler *h; in find_prop_handler() local
51 hlist_for_each_entry(h, handlers, node) in find_prop_handler()
52 if (!strcmp(h->xattr_name, name)) in find_prop_handler()
53 return h; in find_prop_handler()
338 const struct prop_handler *h = &prop_handlers[i]; in inherit_props() local
342 if (!h->inheritable) in inherit_props()
[all …]
Dbtrfs_inode.h208 u64 h = objectid ^ (root->root_key.objectid * GOLDEN_RATIO_PRIME); in btrfs_inode_hash() local
211 h = (h >> 32) ^ (h & 0xffffffff); in btrfs_inode_hash()
214 return (unsigned long)h; in btrfs_inode_hash()
219 unsigned long h = btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root); in btrfs_insert_inode_hash() local
221 __insert_inode_hash(inode, h); in btrfs_insert_inode_hash()
Dtransaction.c450 struct btrfs_trans_handle *h; in start_transaction() local
466 h = current->journal_info; in start_transaction()
467 refcount_inc(&h->use_count); in start_transaction()
468 WARN_ON(refcount_read(&h->use_count) > 2); in start_transaction()
469 h->orig_rsv = h->block_rsv; in start_transaction()
470 h->block_rsv = NULL; in start_transaction()
535 h = kmem_cache_zalloc(btrfs_trans_handle_cachep, GFP_NOFS); in start_transaction()
536 if (!h) { in start_transaction()
572 h->transid = cur_trans->transid; in start_transaction()
573 h->transaction = cur_trans; in start_transaction()
[all …]
/fs/unicode/
Dutf8-norm.c281 unsigned char *h; in utf8hangul() local
290 h = hangul; in utf8hangul()
291 LEAF_GEN(h) = 2; in utf8hangul()
292 LEAF_CCC(h) = DECOMPOSE; in utf8hangul()
293 h += 2; in utf8hangul()
296 h += utf8encode3((char *)h, li + LB); in utf8hangul()
299 h += utf8encode3((char *)h, vi + VB); in utf8hangul()
303 h += utf8encode3((char *)h, ti + TB); in utf8hangul()
306 h[0] = '\0'; in utf8hangul()
DMakefile8 $(obj)/utf8-norm.o: $(obj)/utf8data.h
27 $(obj)/utf8data.h: $(obj)/mkutf8data $(filter %.txt, $(cmd_utf8data)) FORCE
32 $(obj)/utf8data.h: $(src)/utf8data.h_shipped FORCE
37 targets += utf8data.h
/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/afs/
Dsecurity.c126 unsigned long h = permits->nr_permits; in afs_hash_permits() local
130 h += (unsigned long)permits->permits[i].key / sizeof(void *); in afs_hash_permits()
131 h += permits->permits[i].access; in afs_hash_permits()
134 permits->h = h; in afs_hash_permits()
254 hash_for_each_possible(afs_permits_cache, xpermits, hash_node, new->h) { in afs_cache_permit()
255 if (xpermits->h != new->h || in afs_cache_permit()
272 hash_add_rcu(afs_permits_cache, &new->hash_node, new->h); in afs_cache_permit()
/fs/orangefs/
Dxattr.c67 struct hlist_head *h; in find_cached_xattr() local
69 h = &orangefs_inode->xattr_cache[xattr_key(key)]; in find_cached_xattr()
70 if (hlist_empty(h)) in find_cached_xattr()
72 hlist_for_each_entry_safe(cx, tmp, h, node) { in find_cached_xattr()
250 struct hlist_head *h; in orangefs_inode_removexattr() local
294 h = &orangefs_inode->xattr_cache[xattr_key(name)]; in orangefs_inode_removexattr()
295 hlist_for_each_entry_safe(cx, tmp, h, node) { in orangefs_inode_removexattr()
321 struct hlist_head *h; in orangefs_inode_setxattr() local
385 h = &orangefs_inode->xattr_cache[xattr_key(name)]; in orangefs_inode_setxattr()
386 hlist_for_each_entry_safe(cx, tmp, h, node) { in orangefs_inode_setxattr()
/fs/fuse/
Ddev.c137 req->in.h.uid = from_kuid(fc->user_ns, current_fsuid()); in fuse_get_req()
138 req->in.h.gid = from_kgid(fc->user_ns, current_fsgid()); in fuse_get_req()
139 req->in.h.pid = pid_nr_ns(task_pid(current), fc->pid_ns); in fuse_get_req()
145 if (unlikely(req->in.h.uid == ((uid_t)-1) || in fuse_get_req()
146 req->in.h.gid == ((gid_t)-1))) { in fuse_get_req()
226 req->in.h.len = sizeof(struct fuse_in_header) + in queue_request_and_unlock()
264 req->in.h.unique = fuse_get_unique(fiq); in flush_bg_queue()
327 req->args->end(fc, req->args, req->out.h.error); in fuse_request_end()
393 req->out.h.error = -EINTR; in request_wait_answer()
414 req->out.h.error = -ENOTCONN; in __fuse_request_send()
[all …]
/fs/ubifs/
Dlpt.c1458 int err, h, iip, shft; in ubifs_pnode_lookup() local
1469 for (h = 1; h < c->lpt_hght; h++) { in ubifs_pnode_lookup()
1605 int err, i, h, iip, shft; in ubifs_lpt_lookup_dirty() local
1620 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
2081 int err = 0, i, h, iip, shft; in ubifs_lpt_scan_nolock() local
2113 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
2116 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
2123 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
2135 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
2142 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
[all …]
/fs/ceph/
Dquota.c42 struct ceph_mds_quota *h = msg->front.iov_base; in ceph_handle_quota() local
47 if (msg->front.iov_len < sizeof(*h)) { in ceph_handle_quota()
60 vino.ino = le64_to_cpu(h->ino); in ceph_handle_quota()
70 ci->i_rbytes = le64_to_cpu(h->rbytes); in ceph_handle_quota()
71 ci->i_rfiles = le64_to_cpu(h->rfiles); in ceph_handle_quota()
72 ci->i_rsubdirs = le64_to_cpu(h->rsubdirs); in ceph_handle_quota()
73 __ceph_update_quota(ci, le64_to_cpu(h->max_bytes), in ceph_handle_quota()
74 le64_to_cpu(h->max_files)); in ceph_handle_quota()
/fs/fscache/
Dcookie.c186 struct hlist_bl_head *h; in fscache_hash_cookie() local
191 h = &fscache_cookie_hash[bucket]; in fscache_hash_cookie()
193 hlist_bl_lock(h); in fscache_hash_cookie()
194 hlist_bl_for_each_entry(cursor, p, h, hash_link) { in fscache_hash_cookie()
202 hlist_bl_add_head(&candidate->hash_link, h); in fscache_hash_cookie()
203 hlist_bl_unlock(h); in fscache_hash_cookie()
213 hlist_bl_unlock(h); in fscache_hash_cookie()
218 hlist_bl_unlock(h); in fscache_hash_cookie()
830 struct hlist_bl_head *h; in fscache_unhash_cookie() local
834 h = &fscache_cookie_hash[bucket]; in fscache_unhash_cookie()
[all …]
/fs/erofs/
Dzmap.c37 struct z_erofs_map_header *h; in fill_inode_lazy() local
67 h = kaddr + erofs_blkoff(pos); in fill_inode_lazy()
68 vi->z_advise = le16_to_cpu(h->h_advise); in fill_inode_lazy()
69 vi->z_algorithmtype[0] = h->h_algorithmtype & 15; in fill_inode_lazy()
70 vi->z_algorithmtype[1] = h->h_algorithmtype >> 4; in fill_inode_lazy()
79 vi->z_logical_clusterbits = LOG_BLOCK_SIZE + (h->h_clusterbits & 7); in fill_inode_lazy()
81 ((h->h_clusterbits >> 3) & 3); in fill_inode_lazy()
91 ((h->h_clusterbits >> 5) & 7); in fill_inode_lazy()
/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()

123