Home
last modified time | relevance | path

Searched refs:h (Results 1 – 25 of 52) 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.c77 static void create_virtual_node(struct tree_balance *tb, int h) in create_virtual_node() argument
84 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
88 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
91 if (h) { in create_virtual_node()
202 static void check_left(struct tree_balance *tb, int h, int cur_free) in check_left() argument
212 if (h > 0) { in check_left()
213 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
221 tb->lnum[h] = 0; in check_left()
282 static void check_right(struct tree_balance *tb, int h, int cur_free) in check_right() argument
292 if (h > 0) { in check_right()
[all …]
Dprints.c587 int h = 0; in store_print_tb() local
603 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
604 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb()
607 h) > ILLEGAL_PATH_ELEMENT_OFFSET) { in store_print_tb()
608 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb()
609 tbFh = PATH_H_PPARENT(tb->tb_path, h); in store_print_tb()
616 h, in store_print_tb()
619 (tb->L[h]) ? (long long)(tb->L[h]->b_blocknr) : (-1LL), in store_print_tb()
620 (tb->L[h]) ? atomic_read(&(tb->L[h]->b_count)) : -1, in store_print_tb()
621 (tb->R[h]) ? (long long)(tb->R[h]->b_blocknr) : (-1LL), in store_print_tb()
[all …]
Ddo_balan.c1826 int get_left_neighbor_position(struct tree_balance *tb, int h) in get_left_neighbor_position() argument
1828 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_left_neighbor_position()
1830 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, in get_left_neighbor_position()
1832 h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h)); in get_left_neighbor_position()
1835 return B_NR_ITEMS(tb->FL[h]); in get_left_neighbor_position()
1840 int get_right_neighbor_position(struct tree_balance *tb, int h) in get_right_neighbor_position() argument
1842 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_right_neighbor_position()
1844 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, in get_right_neighbor_position()
1846 h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]); in get_right_neighbor_position()
1848 if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h))) in get_right_neighbor_position()
[all …]
/fs/xfs/quota/
Dxfs_quota_priv.h49 #define XQMLCK(h) (mutex_lock(&((h)->qh_lock))) argument
50 #define XQMUNLCK(h) (mutex_unlock(&((h)->qh_lock))) argument
53 static inline int XQMISLCKD(struct xfs_dqhash *h) in XQMISLCKD() argument
55 if (mutex_trylock(&h->qh_lock)) { in XQMISLCKD()
56 mutex_unlock(&h->qh_lock); in XQMISLCKD()
63 #define XFS_DQ_HASH_LOCK(h) XQMLCK(h) argument
64 #define XFS_DQ_HASH_UNLOCK(h) XQMUNLCK(h) argument
65 #define XFS_DQ_IS_HASH_LOCKED(h) XQMISLCKD(h) argument
105 #define _LIST_REMOVE(h, dqp, PVP, NXT) \ argument
113 (h)->qh_version++; \
[all …]
Dxfs_dquot.c923 xfs_dqhash_t *h; in xfs_qm_dqget() local
933 h = XFS_DQ_HASH(mp, id, type); in xfs_qm_dqget()
959 XFS_DQ_HASH_LOCK(h); in xfs_qm_dqget()
965 if (xfs_qm_dqlookup(mp, id, h, O_dqpp) == 0) { in xfs_qm_dqget()
974 XFS_DQ_HASH_UNLOCK(h); in xfs_qm_dqget()
993 version = h->qh_version; in xfs_qm_dqget()
994 XFS_DQ_HASH_UNLOCK(h); in xfs_qm_dqget()
1059 XFS_DQ_HASH_LOCK(h); in xfs_qm_dqget()
1060 if (version != h->qh_version) { in xfs_qm_dqget()
1069 if (xfs_qm_dqlookup(mp, id, h, &tmpdqp) == 0) { in xfs_qm_dqget()
[all …]
Dxfs_qm_syscalls.c1170 xfs_qm_hashinsert(xfs_dqhash_t *h, xfs_dqtest_t *dqp) in xfs_qm_hashinsert() argument
1173 if (((d) = (h)->qh_next)) in xfs_qm_hashinsert()
1176 (dqp)->HL_PREVP = &((h)->qh_next); in xfs_qm_hashinsert()
1177 (h)->qh_next = (xfs_dquot_t *)dqp; in xfs_qm_hashinsert()
1178 (h)->qh_version++; in xfs_qm_hashinsert()
1179 (h)->qh_nelems++; in xfs_qm_hashinsert()
1288 xfs_dqhash_t *h; in xfs_qm_internalqcheck_dqget() local
1290 h = DQTEST_HASH(mp, id, type); in xfs_qm_internalqcheck_dqget()
1291 for (d = (xfs_dqtest_t *) h->qh_next; d != NULL; in xfs_qm_internalqcheck_dqget()
1303 d->q_hash = h; in xfs_qm_internalqcheck_dqget()
[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/nfsd/
Dnfs4idmap.c69 struct cache_head h; member
85 struct ent *new = container_of(cnew, struct ent, h); in ent_init()
86 struct ent *itm = container_of(citm, struct ent, h); in ent_init()
98 struct ent *map = container_of(ref, struct ent, h.ref); in ent_put()
107 return &e->h; in ent_alloc()
137 struct ent *ent = container_of(ch, struct ent, h); in idtoname_request()
151 struct ent *a = container_of(ca, struct ent, h); in idtoname_match()
152 struct ent *b = container_of(cb, struct ent, h); in idtoname_match()
159 idtoname_show(struct seq_file *m, struct cache_detail *cd, struct cache_head *h) in idtoname_show() argument
163 if (h == NULL) { in idtoname_show()
[all …]
Dexport.c64 struct svc_expkey *key = container_of(ref, struct svc_expkey, h.ref); in expkey_put()
66 if (test_bit(CACHE_VALID, &key->h.flags) && in expkey_put()
67 !test_bit(CACHE_NEGATIVE, &key->h.flags)) in expkey_put()
74 struct cache_head *h, in expkey_request() argument
78 struct svc_expkey *ek = container_of(h, struct svc_expkey, h); in expkey_request()
139 key.h.flags = 0; in expkey_parse()
140 key.h.expiry_time = get_expiry(&mesg); in expkey_parse()
141 if (key.h.expiry_time == 0) in expkey_parse()
161 set_bit(CACHE_NEGATIVE, &key.h.flags); in expkey_parse()
180 cache_put(&ek->h, &svc_expkey_cache); in expkey_parse()
[all …]
/fs/btrfs/
Dversion.sh31 echo "#ifndef __BUILD_VERSION" > .build-version.h
32 echo "#define __BUILD_VERSION" >> .build-version.h
33 echo "#define BTRFS_BUILD_VERSION \"Btrfs $v\"" >> .build-version.h
34 echo "#endif" >> .build-version.h
36 diff -q version.h .build-version.h >& /dev/null
39 rm .build-version.h
43 mv .build-version.h version.h
/fs/adfs/
Ddir_fplus.c25 struct adfs_bigdirheader *h; in adfs_fplus_read() local
44 h = (struct adfs_bigdirheader *)dir->bh[0]->b_data; in adfs_fplus_read()
45 size = le32_to_cpu(h->bigdirsize); in adfs_fplus_read()
51 if (h->bigdirversion[0] != 0 || h->bigdirversion[1] != 0 || in adfs_fplus_read()
52 h->bigdirversion[2] != 0 || size & 2047 || in adfs_fplus_read()
53 h->bigdirstartname != cpu_to_le32(BIGDIRSTARTNAME)) in adfs_fplus_read()
73 t->bigdirendmasseq != h->startmasseq || in adfs_fplus_read()
77 dir->parent_id = le32_to_cpu(h->bigdirparent); in adfs_fplus_read()
90 struct adfs_bigdirheader *h = (struct adfs_bigdirheader *)dir->bh[0]->b_data; in adfs_fplus_setpos() local
93 if (fpos <= le32_to_cpu(h->bigdirentries)) { in adfs_fplus_setpos()
[all …]
/fs/nfs/
Didmap.c156 idmap_name_hash(struct idmap_hashtable* h, const char *name, size_t len) in idmap_name_hash() argument
158 return &h->h_entries[fnvhash32(name, len) % IDMAP_HASH_SZ]; in idmap_name_hash()
162 idmap_lookup_name(struct idmap_hashtable *h, const char *name, size_t len) in idmap_lookup_name() argument
164 struct idmap_hashent *he = idmap_name_hash(h, name, len); in idmap_lookup_name()
174 idmap_id_hash(struct idmap_hashtable* h, __u32 id) in idmap_id_hash() argument
176 return &h->h_entries[fnvhash32(&id, sizeof(id)) % IDMAP_HASH_SZ]; in idmap_id_hash()
180 idmap_lookup_id(struct idmap_hashtable *h, __u32 id) in idmap_lookup_id() argument
182 struct idmap_hashent *he = idmap_id_hash(h, id); in idmap_lookup_id()
196 idmap_alloc_name(struct idmap_hashtable *h, char *name, size_t len) in idmap_alloc_name() argument
198 return idmap_name_hash(h, name, len); in idmap_alloc_name()
[all …]
/fs/proc/
Dproc_sysctl.c82 struct ctl_table_header *h = NULL; in proc_sys_lookup() local
100 for (h = sysctl_head_next(NULL); h; h = sysctl_head_next(h)) { in proc_sys_lookup()
101 if (h->attached_to != table) in proc_sys_lookup()
103 p = find_in_table(h->attached_by, name); in proc_sys_lookup()
113 inode = proc_sys_make_inode(dir->i_sb, h ? h : head, p); in proc_sys_lookup()
114 if (h) in proc_sys_lookup()
115 sysctl_head_finish(h); in proc_sys_lookup()
246 struct ctl_table_header *h = NULL; in proc_sys_readdir() local
280 for (h = sysctl_head_next(NULL); h; h = sysctl_head_next(h)) { in proc_sys_readdir()
281 if (h->attached_to != table) in proc_sys_readdir()
[all …]
/fs/ncpfs/
Dsock.c254 …init_header(struct ncp_server *server, struct ncp_request_reply *req, struct ncp_request_header *h) in ncp_init_header() argument
257 h->conn_low = server->connection; in ncp_init_header()
258 h->conn_high = server->connection >> 8; in ncp_init_header()
259 h->sequence = ++server->sequence; in ncp_init_header()
265 struct ncp_request_header* h; in ncpdgram_start_request() local
269 h = req->tx_iov[1].iov_base; in ncpdgram_start_request()
270 ncp_init_header(server, req, h); in ncpdgram_start_request()
294 struct ncp_request_header* h; in ncptcp_start_request() local
297 h = req->tx_iov[1].iov_base; in ncptcp_start_request()
298 ncp_init_header(server, req, h); in ncptcp_start_request()
[all …]
/fs/hugetlbfs/
Dinode.c85 struct hstate *h = hstate_file(file); in hugetlbfs_file_mmap() local
98 if (vma->vm_pgoff & ~(huge_page_mask(h) >> PAGE_SHIFT)) in hugetlbfs_file_mmap()
110 vma->vm_pgoff >> huge_page_order(h), in hugetlbfs_file_mmap()
111 len >> huge_page_shift(h), vma, in hugetlbfs_file_mmap()
137 struct hstate *h = hstate_file(file); in hugetlb_get_unmapped_area() local
139 if (len & ~huge_page_mask(h)) in hugetlb_get_unmapped_area()
151 addr = ALIGN(addr, huge_page_size(h)); in hugetlb_get_unmapped_area()
164 addr = ALIGN(start_addr, huge_page_size(h)); in hugetlb_get_unmapped_area()
182 addr = ALIGN(vma->vm_end, huge_page_size(h)); in hugetlb_get_unmapped_area()
233 struct hstate *h = hstate_file(filp); in hugetlbfs_read() local
[all …]
/fs/fuse/
Ddir.c120 req->in.h.opcode = FUSE_LOOKUP; in fuse_lookup_init()
121 req->in.h.nodeid = nodeid; in fuse_lookup_init()
194 err = req->out.h.error; in fuse_dentry_revalidate()
287 err = req->out.h.error; in fuse_lookup_name()
420 req->in.h.opcode = FUSE_CREATE; in fuse_create_open()
421 req->in.h.nodeid = get_node_id(dir); in fuse_create_open()
436 err = req->out.h.error; in fuse_create_open()
498 req->in.h.nodeid = get_node_id(dir); in create_new_entry()
506 err = req->out.h.error; in create_new_entry()
563 req->in.h.opcode = FUSE_MKNOD; in fuse_mknod()
[all …]
Ddev.c90 req->in.h.uid = current_fsuid(); in fuse_req_init_context()
91 req->in.h.gid = current_fsgid(); in fuse_req_init_context()
92 req->in.h.pid = current->pid; in fuse_req_init_context()
235 req->in.h.unique = fuse_get_unique(fc); in queue_request()
236 req->in.h.len = sizeof(struct fuse_in_header) + in queue_request()
355 req->out.h.error = -EINTR; in request_wait_answer()
390 req->out.h.error = -ENOTCONN; in fuse_request_send()
392 req->out.h.error = -ECONNREFUSED; in fuse_request_send()
426 req->out.h.error = -ENOTCONN; in fuse_request_send_nowait()
718 arg.unique = req->in.h.unique; in fuse_read_interrupt()
[all …]
Dfile.c34 req->in.h.opcode = isdir ? FUSE_OPENDIR : FUSE_OPEN; in fuse_send_open()
35 req->in.h.nodeid = get_node_id(inode); in fuse_send_open()
43 err = req->out.h.error; in fuse_send_open()
152 req->in.h.opcode = opcode; in fuse_release_fill()
153 req->in.h.nodeid = nodeid; in fuse_release_fill()
286 req->in.h.opcode = FUSE_FLUSH; in fuse_flush()
287 req->in.h.nodeid = get_node_id(inode); in fuse_flush()
293 err = req->out.h.error; in fuse_flush()
351 req->in.h.opcode = isdir ? FUSE_FSYNCDIR : FUSE_FSYNC; in fuse_fsync_common()
352 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 (becuase 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/autofs/
Ddirhash.c107 memset(&dh->h, 0, AUTOFS_HASH_SIZE*sizeof(struct autofs_dir_ent *)); in autofs_initialize_hash()
118 for ( dhn = dh->h[(unsigned) name->hash % AUTOFS_HASH_SIZE] ; dhn ; dhn = dhn->next ) { in autofs_hash_lookup()
139 dhnp = &dh->h[(unsigned) ent->hash % AUTOFS_HASH_SIZE]; in autofs_hash_insert()
190 ent = dh->h[bucket]; in autofs_hash_enum()
224 for ( ent = dh->h[i] ; ent ; ent = ent->next ) { in autofs_hash_dputall()
241 for ( ent = sbi->dirhash.h[i] ; ent ; ent = nent ) { in autofs_hash_nuke()
/fs/ubifs/
Dlpt.c1442 int err, i, h, iip, shft; in ubifs_lpt_lookup() local
1454 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup()
1576 int err, i, h, iip, shft; in ubifs_lpt_lookup_dirty() local
1591 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
1913 int err = 0, i, h, iip, shft; in ubifs_lpt_scan_nolock() local
1945 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
1948 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1956 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
1968 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1975 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
[all …]
/fs/hpfs/
Dea.c196 unsigned char h[4]; in hpfs_set_ea() local
347 h[0] = 0; in hpfs_set_ea()
348 h[1] = strlen(key); in hpfs_set_ea()
349 h[2] = size & 0xff; in hpfs_set_ea()
350 h[3] = size >> 8; in hpfs_set_ea()
351 if (hpfs_ea_write(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l, 4, h)) goto bail; in hpfs_set_ea()
352 …if (hpfs_ea_write(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l + 4, h[1] + 1, key)) goto … in hpfs_set_ea()
353 …if (hpfs_ea_write(s, fnode->ea_secno, fnode->ea_anode, fnode->ea_size_l + 5 + h[1], size, data)) g… in hpfs_set_ea()
/fs/jfs/
Djfs_logmgr.c584 lspn = le32_to_cpu(lp->h.page); in lmNextPage()
634 lp->h.eor = lp->t.eor = cpu_to_le16(bp->l_ceor); in lmNextPage()
655 lp->h.page = lp->t.page = cpu_to_le32(lspn + 1); in lmNextPage()
656 lp->h.eor = lp->t.eor = cpu_to_le16(LOGPHDRSIZE); in lmNextPage()
795 lp->h.eor = lp->t.eor = cpu_to_le16(bp->l_ceor); in lmGCwrite()
803 lp->h.eor = lp->t.eor = cpu_to_le16(bp->l_ceor); in lmGCwrite()
887 lp->h.eor = lp->t.eor = cpu_to_le16(bp->l_eor); in lmPostGC()
1370 le16_to_cpu(lp->h.eor)); in lmLogInit()
1399 lp->h.eor = lp->t.eor = cpu_to_le16(bp->l_eor); in lmLogInit()
1688 lp->h.eor = lp->t.eor = cpu_to_le16(bp->l_eor); in lmLogShutdown()
[all …]

123