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.c624 int h = 0; in store_print_tb() local
640 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
641 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb()
644 h) > ILLEGAL_PATH_ELEMENT_OFFSET) { in store_print_tb()
645 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb()
646 tbFh = PATH_H_PPARENT(tb->tb_path, h); in store_print_tb()
653 h, in store_print_tb()
656 (tb->L[h]) ? (long long)(tb->L[h]->b_blocknr) : (-1LL), in store_print_tb()
657 (tb->L[h]) ? atomic_read(&tb->L[h]->b_count) : -1, in store_print_tb()
658 (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.c60 struct cache_head h; member
76 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_update()
77 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_update()
89 new = container_of(cnew, struct nfs_dns_ent, h); in nfs_dns_ent_init()
90 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_init()
107 item = container_of(ref, struct nfs_dns_ent, h.ref); in nfs_dns_ent_put()
120 return &item->h; in nfs_dns_ent_alloc()
134 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_request()
143 struct nfs_dns_ent *key = container_of(ch, struct nfs_dns_ent, h); in nfs_dns_upcall()
158 a = container_of(ca, struct nfs_dns_ent, h); in nfs_dns_match()
[all …]
Dpnfs_dev.c336 long h; in nfs4_deviceid_purge_client() local
340 for (h = 0; h < NFS4_DEVICE_ID_HASH_SIZE; h++) in nfs4_deviceid_purge_client()
341 _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.c41 struct svc_expkey *key = container_of(ref, struct svc_expkey, h.ref); in expkey_put()
43 if (test_bit(CACHE_VALID, &key->h.flags) && in expkey_put()
44 !test_bit(CACHE_NEGATIVE, &key->h.flags)) in expkey_put()
51 struct cache_head *h, in expkey_request() argument
55 struct svc_expkey *ek = container_of(h, struct svc_expkey, h); in expkey_request()
116 key.h.flags = 0; in expkey_parse()
117 key.h.expiry_time = get_expiry(&mesg); in expkey_parse()
118 if (key.h.expiry_time == 0) in expkey_parse()
138 set_bit(CACHE_NEGATIVE, &key.h.flags); in expkey_parse()
157 cache_put(&ek->h, cd); in expkey_parse()
[all …]
Dexport.h48 struct cache_head h; member
67 struct cache_head h; member
101 cache_put(&exp->h, exp->cd); in exp_put()
106 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()
94 t->bigdirendmasseq != h->startmasseq || in adfs_fplus_read()
101 dir->parent_id = le32_to_cpu(h->bigdirparent); in adfs_fplus_read()
124 struct adfs_bigdirheader *h = in adfs_fplus_setpos() local
128 if (fpos <= le32_to_cpu(h->bigdirentries)) { in adfs_fplus_setpos()
[all …]
/fs/btrfs/
Dprops.c64 u64 h = btrfs_name_hash(p->xattr_name, strlen(p->xattr_name)); in btrfs_props_init() local
66 hash_add(prop_handlers_ht, &p->node, h); in btrfs_props_init()
72 struct hlist_head *h; in find_prop_handlers_by_hash() local
74 h = &prop_handlers_ht[hash_min(hash, BTRFS_PROP_HANDLERS_HT_BITS)]; in find_prop_handlers_by_hash()
75 if (hlist_empty(h)) in find_prop_handlers_by_hash()
78 return h; in find_prop_handlers_by_hash()
85 struct prop_handler *h; in find_prop_handler() local
95 hlist_for_each_entry(h, handlers, node) in find_prop_handler()
96 if (!strcmp(h->xattr_name, name)) in find_prop_handler()
97 return h; in find_prop_handler()
[all …]
Dbtrfs_inode.h201 u64 h = objectid ^ (root->objectid * GOLDEN_RATIO_PRIME); in btrfs_inode_hash() local
204 h = (h >> 32) ^ (h & 0xffffffff); in btrfs_inode_hash()
207 return (unsigned long)h; in btrfs_inode_hash()
212 unsigned long h = btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root); in btrfs_insert_inode_hash() local
214 __insert_inode_hash(inode, h); in btrfs_insert_inode_hash()
Dtransaction.c382 struct btrfs_trans_handle *h; in start_transaction() local
397 h = current->journal_info; in start_transaction()
398 h->use_count++; in start_transaction()
399 WARN_ON(h->use_count > 2); in start_transaction()
400 h->orig_rsv = h->block_rsv; in start_transaction()
401 h->block_rsv = NULL; in start_transaction()
434 h = kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); in start_transaction()
435 if (!h) { in start_transaction()
473 h->transid = cur_trans->transid; in start_transaction()
474 h->transaction = cur_trans; in start_transaction()
[all …]
Draid56.c188 struct btrfs_stripe_hash *h; in btrfs_alloc_stripe_hash_table() local
203 table_size = sizeof(*table) + sizeof(*h) * num_entries; in btrfs_alloc_stripe_hash_table()
214 h = table->table; in btrfs_alloc_stripe_hash_table()
217 cur = h + i; in btrfs_alloc_stripe_hash_table()
338 struct btrfs_stripe_hash *h; in __remove_rbio_from_cache() local
348 h = table->table + bucket; in __remove_rbio_from_cache()
353 spin_lock(&h->lock); in __remove_rbio_from_cache()
385 spin_unlock(&h->lock); in __remove_rbio_from_cache()
637 struct btrfs_stripe_hash *h = rbio->fs_info->stripe_hash_table->table + bucket; in lock_stripe_add() local
647 spin_lock_irqsave(&h->lock, flags); in lock_stripe_add()
[all …]
Dcheck-integrity.c270 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h);
272 struct btrfsic_block_hashtable *h);
277 struct btrfsic_block_hashtable *h);
279 struct btrfsic_block_link_hashtable *h);
282 struct btrfsic_block_link_hashtable *h);
289 struct btrfsic_block_link_hashtable *h);
291 struct btrfsic_dev_state_hashtable *h);
294 struct btrfsic_dev_state_hashtable *h);
298 struct btrfsic_dev_state_hashtable *h);
503 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h) in btrfsic_block_hashtable_init() argument
[all …]
/fs/hugetlbfs/
Dinode.c105 struct hstate *h = hstate_file(file); in hugetlbfs_file_mmap() local
118 if (vma->vm_pgoff & (~huge_page_mask(h) >> PAGE_SHIFT)) in hugetlbfs_file_mmap()
130 vma->vm_pgoff >> huge_page_order(h), in hugetlbfs_file_mmap()
131 len >> huge_page_shift(h), vma, in hugetlbfs_file_mmap()
156 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area() local
159 if (len & ~huge_page_mask(h)) in hugetlb_get_unmapped_area()
171 addr = ALIGN(addr, huge_page_size(h)); in hugetlb_get_unmapped_area()
182 info.align_mask = PAGE_MASK & ~huge_page_mask(h); in hugetlb_get_unmapped_area()
234 struct hstate *h = hstate_file(filp); in hugetlbfs_read() local
237 unsigned long index = *ppos >> huge_page_shift(h); in hugetlbfs_read()
[all …]
/fs/ncpfs/
Dsock.c256 …init_header(struct ncp_server *server, struct ncp_request_reply *req, struct ncp_request_header *h) in ncp_init_header() argument
259 h->conn_low = server->connection; in ncp_init_header()
260 h->conn_high = server->connection >> 8; in ncp_init_header()
261 h->sequence = ++server->sequence; in ncp_init_header()
267 struct ncp_request_header* h; in ncpdgram_start_request() local
271 h = req->tx_iov[1].iov_base; in ncpdgram_start_request()
272 ncp_init_header(server, req, h); in ncpdgram_start_request()
296 struct ncp_request_header* h; in ncptcp_start_request() local
299 h = req->tx_iov[1].iov_base; in ncptcp_start_request()
300 ncp_init_header(server, req, h); in ncptcp_start_request()
[all …]
/fs/fuse/
Ddir.c153 req->in.h.opcode = FUSE_LOOKUP; in fuse_lookup_init()
154 req->in.h.nodeid = nodeid; in fuse_lookup_init()
237 err = req->out.h.error; in fuse_dentry_revalidate()
304 req->in.h.opcode = FUSE_CANONICAL_PATH; in fuse_dentry_canonical_path()
305 req->in.h.nodeid = get_node_id(inode); in fuse_dentry_canonical_path()
313 err = req->out.h.error; in fuse_dentry_canonical_path()
370 err = req->out.h.error; in fuse_lookup_name()
487 req->in.h.opcode = FUSE_CREATE; in fuse_create_open()
488 req->in.h.nodeid = get_node_id(dir); in fuse_create_open()
504 err = req->out.h.error; in fuse_create_open()
[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 …]
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()
275 req->in.h.opcode = opcode; in fuse_prepare_release()
276 req->in.h.nodeid = ff->nodeid; in fuse_prepare_release()
470 req->in.h.opcode = FUSE_FLUSH; in fuse_flush()
471 req->in.h.nodeid = get_node_id(inode); in fuse_flush()
477 err = req->out.h.error; in fuse_flush()
542 req->in.h.opcode = isdir ? FUSE_FSYNCDIR : FUSE_FSYNC; in fuse_fsync_common()
543 req->in.h.nodeid = get_node_id(inode); in fuse_fsync_common()
[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/logfs/
Dsegment.c299 struct logfs_object_header h; in __logfs_segment_write() local
318 h.len = cpu_to_be16(len); in __logfs_segment_write()
319 h.type = type; in __logfs_segment_write()
320 h.compr = compr; in __logfs_segment_write()
321 h.ino = cpu_to_be64(inode->i_ino); in __logfs_segment_write()
322 h.bix = cpu_to_be64(shadow->bix); in __logfs_segment_write()
323 h.crc = logfs_crc32(&h, sizeof(h) - 4, 4); in __logfs_segment_write()
324 h.data_crc = logfs_crc32(buf, len, 0); in __logfs_segment_write()
326 logfs_buf_write(area, ofs, &h, sizeof(h)); in __logfs_segment_write()
683 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()
1580 int err, i, h, iip, shft; in ubifs_lpt_lookup_dirty() local
1595 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
1923 int err = 0, i, h, iip, shft; in ubifs_lpt_scan_nolock() local
1955 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
1958 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1965 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1977 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1984 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()

123