Home
last modified time | relevance | path

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

123

/fs/reiserfs/
Dibalance.c26 int h, in internal_define_dest_src_infos() argument
37 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos()
38 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos()
39 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in internal_define_dest_src_infos()
41 dest_bi->bi_bh = tb->L[h]; in internal_define_dest_src_infos()
42 dest_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
43 dest_bi->bi_position = get_left_neighbor_position(tb, h); in internal_define_dest_src_infos()
44 *d_key = tb->lkey[h]; in internal_define_dest_src_infos()
45 *cf = tb->CFL[h]; in internal_define_dest_src_infos()
49 src_bi->bi_bh = tb->L[h]; in internal_define_dest_src_infos()
[all …]
Dfix_node.c78 static void create_virtual_node(struct tree_balance *tb, int h) in create_virtual_node() argument
85 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
89 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
92 if (h) { in create_virtual_node()
203 static void check_left(struct tree_balance *tb, int h, int cur_free) in check_left() argument
213 if (h > 0) { in check_left()
214 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
222 tb->lnum[h] = 0; in check_left()
283 static void check_right(struct tree_balance *tb, int h, int cur_free) in check_right() argument
293 if (h > 0) { in check_right()
[all …]
Dprints.c615 int h = 0; in store_print_tb() local
631 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
632 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb()
635 h) > ILLEGAL_PATH_ELEMENT_OFFSET) { in store_print_tb()
636 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb()
637 tbFh = PATH_H_PPARENT(tb->tb_path, h); in store_print_tb()
644 h, in store_print_tb()
647 (tb->L[h]) ? (long long)(tb->L[h]->b_blocknr) : (-1LL), in store_print_tb()
648 (tb->L[h]) ? atomic_read(&(tb->L[h]->b_count)) : -1, in store_print_tb()
649 (tb->R[h]) ? (long long)(tb->R[h]->b_blocknr) : (-1LL), in store_print_tb()
[all …]
Ddo_balan.c1763 int get_left_neighbor_position(struct tree_balance *tb, int h) in get_left_neighbor_position() argument
1765 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_left_neighbor_position()
1767 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, in get_left_neighbor_position()
1769 h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h)); in get_left_neighbor_position()
1772 return B_NR_ITEMS(tb->FL[h]); in get_left_neighbor_position()
1777 int get_right_neighbor_position(struct tree_balance *tb, int h) in get_right_neighbor_position() argument
1779 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_right_neighbor_position()
1781 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, in get_right_neighbor_position()
1783 h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]); in get_right_neighbor_position()
1785 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.c59 struct cache_head h; member
75 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_update()
76 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_update()
88 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_init()
89 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_init()
106 item = container_of(ref, struct nfs_dns_ent, h.ref); in nfs_dns_ent_put()
119 return &item->h; in nfs_dns_ent_alloc()
133 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_request()
142 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_upcall()
157 a = container_of(ca, struct nfs_dns_ent, h); in nfs_dns_match()
[all …]
Dpnfs_dev.c277 long h; in nfs4_deviceid_purge_client() local
281 for (h = 0; h < NFS4_DEVICE_ID_HASH_SIZE; h++) in nfs4_deviceid_purge_client()
282 _deviceid_purge_client(clp, h); in nfs4_deviceid_purge_client()
/fs/nfsd/
Dnfs4idmap.c66 struct cache_head h; member
81 struct ent *new = container_of(cnew, struct ent, h); in ent_init()
82 struct ent *itm = container_of(citm, struct ent, h); in ent_init()
94 struct ent *map = container_of(ref, struct ent, h.ref); in ent_put()
103 return &e->h; in ent_alloc()
131 struct ent *ent = container_of(ch, struct ent, h); in idtoname_request()
145 struct ent *a = container_of(ca, struct ent, h); in idtoname_match()
146 struct ent *b = container_of(cb, struct ent, h); in idtoname_match()
153 idtoname_show(struct seq_file *m, struct cache_detail *cd, struct cache_head *h) in idtoname_show() argument
157 if (h == NULL) { in idtoname_show()
[all …]
Dexport.c46 struct svc_expkey *key = container_of(ref, struct svc_expkey, h.ref); in expkey_put()
48 if (test_bit(CACHE_VALID, &key->h.flags) && in expkey_put()
49 !test_bit(CACHE_NEGATIVE, &key->h.flags)) in expkey_put()
56 struct cache_head *h, in expkey_request() argument
60 struct svc_expkey *ek = container_of(h, struct svc_expkey, h); in expkey_request()
121 key.h.flags = 0; in expkey_parse()
122 key.h.expiry_time = get_expiry(&mesg); in expkey_parse()
123 if (key.h.expiry_time == 0) in expkey_parse()
143 set_bit(CACHE_NEGATIVE, &key.h.flags); in expkey_parse()
162 cache_put(&ek->h, cd); in expkey_parse()
[all …]
/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.c103 struct hstate *h = hstate_file(file); in hugetlbfs_file_mmap() local
116 if (vma->vm_pgoff & (~huge_page_mask(h) >> PAGE_SHIFT)) in hugetlbfs_file_mmap()
128 vma->vm_pgoff >> huge_page_order(h), in hugetlbfs_file_mmap()
129 len >> huge_page_shift(h), vma, in hugetlbfs_file_mmap()
154 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area() local
157 if (len & ~huge_page_mask(h)) in hugetlb_get_unmapped_area()
169 addr = ALIGN(addr, huge_page_size(h)); in hugetlb_get_unmapped_area()
180 info.align_mask = PAGE_MASK & ~huge_page_mask(h); in hugetlb_get_unmapped_area()
232 struct hstate *h = hstate_file(filp); in hugetlbfs_read() local
235 unsigned long index = *ppos >> huge_page_shift(h); in hugetlbfs_read()
[all …]
/fs/ncpfs/
Dsock.c255 …init_header(struct ncp_server *server, struct ncp_request_reply *req, struct ncp_request_header *h) in ncp_init_header() argument
258 h->conn_low = server->connection; in ncp_init_header()
259 h->conn_high = server->connection >> 8; in ncp_init_header()
260 h->sequence = ++server->sequence; in ncp_init_header()
266 struct ncp_request_header* h; in ncpdgram_start_request() local
270 h = req->tx_iov[1].iov_base; in ncpdgram_start_request()
271 ncp_init_header(server, req, h); in ncpdgram_start_request()
295 struct ncp_request_header* h; in ncptcp_start_request() local
298 h = req->tx_iov[1].iov_base; in ncptcp_start_request()
299 ncp_init_header(server, req, h); in ncptcp_start_request()
[all …]
/fs/fuse/
Ddir.c143 req->in.h.opcode = FUSE_LOOKUP; in fuse_lookup_init()
144 req->in.h.nodeid = nodeid; in fuse_lookup_init()
221 err = req->out.h.error; in fuse_dentry_revalidate()
279 req->in.h.opcode = FUSE_CANONICAL_PATH; in fuse_dentry_canonical_path()
280 req->in.h.nodeid = get_node_id(inode); in fuse_dentry_canonical_path()
288 err = req->out.h.error; in fuse_dentry_canonical_path()
365 err = req->out.h.error; in fuse_lookup_name()
489 req->in.h.opcode = FUSE_CREATE; in fuse_create_open()
490 req->in.h.nodeid = get_node_id(dir); in fuse_create_open()
506 err = req->out.h.error; in fuse_create_open()
[all …]
Dfile.c38 req->in.h.opcode = opcode; in fuse_send_open()
39 req->in.h.nodeid = nodeid; in fuse_send_open()
47 err = req->out.h.error; in fuse_send_open()
230 req->in.h.opcode = opcode; in fuse_prepare_release()
231 req->in.h.nodeid = ff->nodeid; in fuse_prepare_release()
380 req->in.h.opcode = FUSE_FLUSH; in fuse_flush()
381 req->in.h.nodeid = get_node_id(inode); in fuse_flush()
387 err = req->out.h.error; in fuse_flush()
453 req->in.h.opcode = isdir ? FUSE_FSYNCDIR : FUSE_FSYNC; in fuse_fsync_common()
454 req->in.h.nodeid = get_node_id(inode); in fuse_fsync_common()
[all …]
Ddev.c131 req->in.h.uid = from_kuid_munged(&init_user_ns, current_fsuid()); in fuse_req_init_context()
132 req->in.h.gid = from_kgid_munged(&init_user_ns, current_fsgid()); in fuse_req_init_context()
133 req->in.h.pid = current->pid; in fuse_req_init_context()
316 req->in.h.len = sizeof(struct fuse_in_header) + in queue_request()
355 req->in.h.unique = fuse_get_unique(fc); in flush_bg_queue()
459 req->out.h.error = -EINTR; in request_wait_answer()
497 req->out.h.error = -ENOTCONN; in __fuse_request_send()
499 req->out.h.error = -ECONNREFUSED; in __fuse_request_send()
501 req->in.h.unique = fuse_get_unique(fc); in __fuse_request_send()
542 req->out.h.error = -ENOTCONN; in fuse_request_send_nowait()
[all …]
/fs/btrfs/
Dtransaction.c313 struct btrfs_trans_handle *h; in start_transaction() local
324 h = current->journal_info; in start_transaction()
325 h->use_count++; in start_transaction()
326 WARN_ON(h->use_count > 2); in start_transaction()
327 h->orig_rsv = h->block_rsv; in start_transaction()
328 h->block_rsv = NULL; in start_transaction()
353 h = kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); in start_transaction()
354 if (!h) { in start_transaction()
392 h->transid = cur_trans->transid; in start_transaction()
393 h->transaction = cur_trans; in start_transaction()
[all …]
Draid56.c189 struct btrfs_stripe_hash *h; in btrfs_alloc_stripe_hash_table() local
204 table_size = sizeof(*table) + sizeof(*h) * num_entries; in btrfs_alloc_stripe_hash_table()
215 h = table->table; in btrfs_alloc_stripe_hash_table()
218 cur = h + i; in btrfs_alloc_stripe_hash_table()
339 struct btrfs_stripe_hash *h; in __remove_rbio_from_cache() local
349 h = table->table + bucket; in __remove_rbio_from_cache()
354 spin_lock(&h->lock); in __remove_rbio_from_cache()
386 spin_unlock(&h->lock); in __remove_rbio_from_cache()
638 struct btrfs_stripe_hash *h = rbio->fs_info->stripe_hash_table->table + bucket; in lock_stripe_add() local
648 spin_lock_irqsave(&h->lock, flags); in lock_stripe_add()
[all …]
Dcheck-integrity.c260 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h);
262 struct btrfsic_block_hashtable *h);
267 struct btrfsic_block_hashtable *h);
269 struct btrfsic_block_link_hashtable *h);
272 struct btrfsic_block_link_hashtable *h);
279 struct btrfsic_block_link_hashtable *h);
281 struct btrfsic_dev_state_hashtable *h);
284 struct btrfsic_dev_state_hashtable *h);
288 struct btrfsic_dev_state_hashtable *h);
494 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h) in btrfsic_block_hashtable_init() argument
[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 …]
DTODO6 * Befs_fs.h has gotten big and messy. No reason not to break it up into
10 Use that if we can. (include/linux/parser.h)
/fs/logfs/
Dsegment.c298 struct logfs_object_header h; in __logfs_segment_write() local
317 h.len = cpu_to_be16(len); in __logfs_segment_write()
318 h.type = type; in __logfs_segment_write()
319 h.compr = compr; in __logfs_segment_write()
320 h.ino = cpu_to_be64(inode->i_ino); in __logfs_segment_write()
321 h.bix = cpu_to_be64(shadow->bix); in __logfs_segment_write()
322 h.crc = logfs_crc32(&h, sizeof(h) - 4, 4); in __logfs_segment_write()
323 h.data_crc = logfs_crc32(buf, len, 0); in __logfs_segment_write()
325 logfs_buf_write(area, ofs, &h, sizeof(h)); in __logfs_segment_write()
682 struct logfs_object_header h; in logfs_segment_delete() local
[all …]
/fs/ubifs/
Dlpt.c1447 int err, i, h, iip, shft; in ubifs_lpt_lookup() local
1459 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup()
1581 int err, i, h, iip, shft; in ubifs_lpt_lookup_dirty() local
1596 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
1925 int err = 0, i, h, iip, shft; in ubifs_lpt_scan_nolock() local
1957 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
1960 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1968 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1980 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1987 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
[all …]
/fs/hpfs/
Dea.c197 unsigned char h[4]; in hpfs_set_ea() local
350 h[0] = 0; in hpfs_set_ea()
351 h[1] = strlen(key); in hpfs_set_ea()
352 h[2] = size & 0xff; in hpfs_set_ea()
353 h[3] = size >> 8; in hpfs_set_ea()
354 …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()
355 …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()
356 …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/ceph/
Dsnap.c782 struct ceph_mds_snap_head *h; in ceph_handle_snap() local
789 if (msg->front.iov_len < sizeof(*h)) in ceph_handle_snap()
791 h = p; in ceph_handle_snap()
792 op = le32_to_cpu(h->op); in ceph_handle_snap()
793 split = le64_to_cpu(h->split); /* non-zero if we are splitting an in ceph_handle_snap()
795 num_split_inos = le32_to_cpu(h->num_split_inos); in ceph_handle_snap()
796 num_split_realms = le32_to_cpu(h->num_split_realms); in ceph_handle_snap()
797 trace_len = le32_to_cpu(h->trace_len); in ceph_handle_snap()
798 p += sizeof(*h); in ceph_handle_snap()
/fs/proc/
Dproc_sysctl.c439 struct ctl_table_header *h = NULL; in proc_sys_lookup() local
452 p = lookup_entry(&h, ctl_dir, name->name, name->len); in proc_sys_lookup()
457 ret = sysctl_follow_link(&h, &p, current->nsproxy); in proc_sys_lookup()
464 inode = proc_sys_make_inode(dir->i_sb, h ? h : head, p); in proc_sys_lookup()
473 if (h) in proc_sys_lookup()
474 sysctl_head_finish(h); in proc_sys_lookup()
660 struct ctl_table_header *h = NULL; in proc_sys_readdir() local
687 for (first_entry(ctl_dir, &h, &entry); h; next_entry(&h, &entry)) { in proc_sys_readdir()
688 ret = scan(h, entry, &pos, filp, dirent, filldir); in proc_sys_readdir()
690 sysctl_head_finish(h); in proc_sys_readdir()

123