Home
last modified time | relevance | path

Searched refs:q (Results 1 – 25 of 33) sorted by relevance

12

/fs/jffs2/
Dcompr_rubin.c39 unsigned long q; member
92 rs->q = 0; in init_rubin()
108 while ((rs->q >= UPPER_BIT_RUBIN) || in encode()
109 ((rs->p + rs->q) <= UPPER_BIT_RUBIN)) { in encode()
112 ret = pushbit(&rs->pp, (rs->q & UPPER_BIT_RUBIN) ? 1 : 0, 0); in encode()
115 rs->q &= LOWER_BITS_RUBIN; in encode()
116 rs->q <<= 1; in encode()
132 rs->q += i0; in encode()
144 pushbit(&rs->pp, (UPPER_BIT_RUBIN & rs->q) ? 1 : 0, 1); in end_rubin()
145 rs->q &= LOWER_BITS_RUBIN; in end_rubin()
[all …]
/fs/orangefs/
Dorangefs-bufmap.c13 wait_queue_head_t q; member
20 .q = __WAIT_QUEUE_HEAD_INITIALIZER(rw_map.q)
24 .q = __WAIT_QUEUE_HEAD_INITIALIZER(readdir_map.q)
30 spin_lock(&m->q.lock); in install()
33 wake_up_all_locked(&m->q); in install()
34 spin_unlock(&m->q.lock); in install()
39 spin_lock(&m->q.lock); in mark_killed()
41 spin_unlock(&m->q.lock); in mark_killed()
47 spin_lock(&m->q.lock); in run_down()
51 __add_wait_queue_entry_tail(&m->q, &wait); in run_down()
[all …]
/fs/hpfs/
Dalloc.c122 unsigned i, q; in alloc_in_bmp() local
138 q = nr + n; b = 0; in alloc_in_bmp()
139 while ((a = tstbits(bmp, q, n + forward)) != 0) { in alloc_in_bmp()
140 q += a; in alloc_in_bmp()
141 if (n != 1) q = ((q-1)&~(n-1))+n; in alloc_in_bmp()
143 if (q>>5 != nr>>5) { in alloc_in_bmp()
145 q = nr & 0x1f; in alloc_in_bmp()
147 } else if (q > nr) break; in alloc_in_bmp()
150 ret = bs + q; in alloc_in_bmp()
159 q = i<<5; in alloc_in_bmp()
[all …]
Dea.c289 secno q = hpfs_alloc_sector(s, fno, 1, 0); in hpfs_set_ea() local
290 if (!q) goto bail; in hpfs_set_ea()
291 fnode->ea_secno = cpu_to_le32(q); in hpfs_set_ea()
/fs/afs/
Daddr_list.c136 const char *q, *stop; in afs_parse_text_addrs() local
148 q = memchr(p, ']', end - p); in afs_parse_text_addrs()
150 for (q = p; q < end; q++) in afs_parse_text_addrs()
151 if (*q == '+' || *q == delim) in afs_parse_text_addrs()
155 if (in4_pton(p, q - p, (u8 *)&x[0], -1, &stop)) { in afs_parse_text_addrs()
157 } else if (in6_pton(p, q - p, (u8 *)x, -1, &stop)) { in afs_parse_text_addrs()
164 p = q; in afs_parse_text_addrs()
170 if (q < end && *q == ']') in afs_parse_text_addrs()
/fs/proc/
Dbootconfig.c31 char q; in copy_xbc_key_value_list() local
50 q = '\''; in copy_xbc_key_value_list()
52 q = '"'; in copy_xbc_key_value_list()
54 q, val, q, xbc_node_is_array(vnode) ? ", " : "\n"); in copy_xbc_key_value_list()
/fs/xfs/
Dxfs_quotaops.c60 struct xfs_quotainfo *q = mp->m_quotainfo; in xfs_fs_get_quota_state() local
65 state->s_incoredqs = q->qi_dquots; in xfs_fs_get_quota_state()
79 xfs_qm_fill_state(&state->s_state[USRQUOTA], mp, q->qi_uquotaip, in xfs_fs_get_quota_state()
80 mp->m_sb.sb_uquotino, &q->qi_usr_default); in xfs_fs_get_quota_state()
81 xfs_qm_fill_state(&state->s_state[GRPQUOTA], mp, q->qi_gquotaip, in xfs_fs_get_quota_state()
82 mp->m_sb.sb_gquotino, &q->qi_grp_default); in xfs_fs_get_quota_state()
83 xfs_qm_fill_state(&state->s_state[PRJQUOTA], mp, q->qi_pquotaip, in xfs_fs_get_quota_state()
84 mp->m_sb.sb_pquotino, &q->qi_prj_default); in xfs_fs_get_quota_state()
Dxfs_trans_dquot.c278 struct xfs_dqtrx *q) in xfs_trans_dqlockedjoin() argument
280 ASSERT(q[0].qt_dquot != NULL); in xfs_trans_dqlockedjoin()
281 if (q[1].qt_dquot == NULL) { in xfs_trans_dqlockedjoin()
282 xfs_dqlock(q[0].qt_dquot); in xfs_trans_dqlockedjoin()
283 xfs_trans_dqjoin(tp, q[0].qt_dquot); in xfs_trans_dqlockedjoin()
286 xfs_dqlock2(q[0].qt_dquot, q[1].qt_dquot); in xfs_trans_dqlockedjoin()
287 xfs_trans_dqjoin(tp, q[0].qt_dquot); in xfs_trans_dqlockedjoin()
288 xfs_trans_dqjoin(tp, q[1].qt_dquot); in xfs_trans_dqlockedjoin()
626 struct xfs_quotainfo *q = mp->m_quotainfo; in xfs_trans_dqresv() local
633 defq = xfs_get_defquota(q, xfs_dquot_type(dqp)); in xfs_trans_dqresv()
Dxfs_dquot.c73 struct xfs_quotainfo *q = mp->m_quotainfo; in xfs_qm_adjust_dqlimits() local
78 defq = xfs_get_defquota(q, xfs_dquot_type(dq)); in xfs_qm_adjust_dqlimits()
183 struct xfs_quotainfo *q = mp->m_quotainfo; in xfs_qm_init_dquot_blk() local
216 curid = id - (id % q->qi_dqperchunk); in xfs_qm_init_dquot_blk()
217 memset(d, 0, BBTOB(q->qi_dqchunklen)); in xfs_qm_init_dquot_blk()
218 for (i = 0; i < q->qi_dqperchunk; i++, d++, curid++) { in xfs_qm_init_dquot_blk()
253 xfs_trans_log_buf(tp, bp, 0, BBTOB(q->qi_dqchunklen) - 1); in xfs_qm_init_dquot_blk()
Dxfs_qm_syscalls.c279 struct xfs_quotainfo *q = mp->m_quotainfo; in xfs_qm_scall_setqlim() local
306 defq = xfs_get_defquota(q, xfs_dquot_type(dqp)); in xfs_qm_scall_setqlim()
/fs/
Dfs_pin.c88 struct hlist_node *q; in group_pin_kill() local
90 q = READ_ONCE(p->first); in group_pin_kill()
91 if (!q) { in group_pin_kill()
95 pin_kill(hlist_entry(q, struct fs_pin, s_list)); in group_pin_kill()
Dnamespace.c1878 struct mount *res, *p, *q, *r, *parent; in copy_tree() local
1886 res = q = clone_mnt(mnt, dentry, flag); in copy_tree()
1887 if (IS_ERR(q)) in copy_tree()
1888 return q; in copy_tree()
1890 q->mnt_mountpoint = mnt->mnt_mountpoint; in copy_tree()
1903 q = ERR_PTR(-EPERM); in copy_tree()
1917 q = q->mnt_parent; in copy_tree()
1920 parent = q; in copy_tree()
1921 q = clone_mnt(p, p->mnt.mnt_root, flag); in copy_tree()
1922 if (IS_ERR(q)) in copy_tree()
[all …]
Dfs_context.c430 char *q = kasprintf(GFP_KERNEL, "%c %s%s%pV\n", level, in logfc() local
444 log->buffer[index] = q ? q : "OOM: Can't store error string"; in logfc()
445 if (q) in logfc()
/fs/erofs/
Dzdata.c1556 struct z_erofs_decompressqueue *q; in jobqueue_init() local
1559 q = kvzalloc(sizeof(*q), GFP_KERNEL | __GFP_NOWARN); in jobqueue_init()
1560 if (!q) { in jobqueue_init()
1565 kthread_init_work(&q->u.kthread_work, in jobqueue_init()
1568 INIT_WORK(&q->u.work, z_erofs_decompressqueue_work); in jobqueue_init()
1572 q = fgq; in jobqueue_init()
1575 q->eio = false; in jobqueue_init()
1576 q->sync = true; in jobqueue_init()
1578 q->sb = sb; in jobqueue_init()
1579 q->head = Z_EROFS_PCLUSTER_TAIL; in jobqueue_init()
[all …]
/fs/minix/
Ditree_common.c215 static inline int all_zeroes(block_t *p, block_t *q) in all_zeroes() argument
217 while (p < q) in all_zeroes()
263 static inline void free_data(struct inode *inode, block_t *p, block_t *q) in free_data() argument
267 for ( ; p < q ; p++) { in free_data()
276 static void free_branches(struct inode *inode, block_t *p, block_t *q, int depth) in free_branches() argument
282 for ( ; p < q ; p++) { in free_branches()
297 free_data(inode, p, q); in free_branches()
/fs/efivarfs/
Dsuper.c90 struct qstr q; in efivarfs_alloc_dentry() local
93 q.name = name; in efivarfs_alloc_dentry()
94 q.len = strlen(name); in efivarfs_alloc_dentry()
96 err = efivarfs_d_hash(parent, &q); in efivarfs_alloc_dentry()
100 d = d_alloc(parent, &q); in efivarfs_alloc_dentry()
/fs/gfs2/
Dquota.c842 struct gfs2_quota q; in gfs2_adjust_quota() local
852 memset(&q, 0, sizeof(struct gfs2_quota)); in gfs2_adjust_quota()
853 err = gfs2_internal_read(ip, (char *)&q, &loc, sizeof(q)); in gfs2_adjust_quota()
857 loc -= sizeof(q); /* gfs2_internal_read would've advanced the loc ptr */ in gfs2_adjust_quota()
859 be64_add_cpu(&q.qu_value, change); in gfs2_adjust_quota()
860 if (((s64)be64_to_cpu(q.qu_value)) < 0) in gfs2_adjust_quota()
861 q.qu_value = 0; /* Never go negative on quota usage */ in gfs2_adjust_quota()
862 qd->qd_qb.qb_value = q.qu_value; in gfs2_adjust_quota()
865 q.qu_warn = cpu_to_be64(fdq->d_spc_softlimit >> sdp->sd_sb.sb_bsize_shift); in gfs2_adjust_quota()
866 qd->qd_qb.qb_warn = q.qu_warn; in gfs2_adjust_quota()
[all …]
/fs/ufs/
Dinode.c131 Indirect chain[4], *q = chain; in ufs_frag_map() local
149 if (!grow_chain32(ufsi, NULL, &ufsi->i_u1.i_data[*p++], chain, q)) in ufs_frag_map()
151 if (!q->key32) in ufs_frag_map()
159 fs32_to_cpu(sb, q->key32) + (n>>shift)); in ufs_frag_map()
163 if (!grow_chain32(ufsi, bh, ptr, chain, ++q)) in ufs_frag_map()
165 if (!q->key32) in ufs_frag_map()
168 res = fs32_to_cpu(sb, q->key32); in ufs_frag_map()
172 if (!grow_chain64(ufsi, NULL, &ufsi->i_u1.u2_i_data[*p++], chain, q)) in ufs_frag_map()
174 if (!q->key64) in ufs_frag_map()
183 fs64_to_cpu(sb, q->key64) + (n>>shift)); in ufs_frag_map()
[all …]
/fs/smb/client/
Dcached_dir.c453 struct cached_fid *cfid, *q; in invalidate_all_cached_dirs() local
457 list_for_each_entry_safe(cfid, q, &cfids->entries, entry) { in invalidate_all_cached_dirs()
467 list_for_each_entry_safe(cfid, q, &entry, entry) { in invalidate_all_cached_dirs()
554 struct cached_dirent *dirent, *q; in free_cached_dir() local
562 list_for_each_entry_safe(dirent, q, &cfid->dirents.entries, entry) { in free_cached_dir()
591 struct cached_fid *cfid, *q; in free_cached_dirs() local
595 list_for_each_entry_safe(cfid, q, &cfids->entries, entry) { in free_cached_dirs()
602 list_for_each_entry_safe(cfid, q, &entry, entry) { in free_cached_dirs()
Ddir.c795 static int cifs_ci_hash(const struct dentry *dentry, struct qstr *q) argument
803 for (i = 0; i < q->len; i += charlen) {
804 charlen = codepage->char2uni(&q->name[i], q->len - i, &c);
810 q->hash = end_name_hash(hash);
/fs/sysv/
Ditree.c273 static inline int all_zeroes(sysv_zone_t *p, sysv_zone_t *q) in all_zeroes() argument
275 while (p < q) in all_zeroes()
330 static inline void free_data(struct inode *inode, sysv_zone_t *p, sysv_zone_t *q) in free_data() argument
332 for ( ; p < q ; p++) { in free_data()
342 static void free_branches(struct inode *inode, sysv_zone_t *p, sysv_zone_t *q, int depth) in free_branches() argument
348 for ( ; p < q ; p++) { in free_branches()
365 free_data(inode, p, q); in free_branches()
/fs/ext2/
Dinode.c973 static inline int all_zeroes(__le32 *p, __le32 *q) in all_zeroes() argument
975 while (p < q) in all_zeroes()
1074 static inline void ext2_free_data(struct inode *inode, __le32 *p, __le32 *q) in ext2_free_data() argument
1079 for ( ; p < q ; p++) { in ext2_free_data()
1114 static void ext2_free_branches(struct inode *inode, __le32 *p, __le32 *q, int depth) in ext2_free_branches() argument
1121 for ( ; p < q ; p++) { in ext2_free_branches()
1146 ext2_free_data(inode, p, q); in ext2_free_branches()
/fs/autofs/
Dexpire.c101 struct dentry *q; in get_next_positive_subdir() local
105 q = positive_after(root, prev); in get_next_positive_subdir()
109 return q; in get_next_positive_subdir()
/fs/ext4/
Dnamei.c813 struct dx_entry *at, *entries, *p, *q, *m; in dx_probe() local
909 q = entries + count - 1; in dx_probe()
910 while (p <= q) { in dx_probe()
911 m = p + (q - p) / 2; in dx_probe()
914 q = m - 1; in dx_probe()
1354 struct dx_map_entry *p, *q, *top = map + count - 1; in dx_sort_map() local
1361 for (p = top, q = p - count; q >= map; p--, q--) in dx_sort_map()
1362 if (p->hash < q->hash) in dx_sort_map()
1363 swap(*p, *q); in dx_sort_map()
1368 q = top; in dx_sort_map()
[all …]
/fs/configfs/
Ddir.c1614 struct list_head *p, *q = &cursor->s_sibling; in configfs_readdir() local
1621 list_move(q, &parent_sd->s_children); in configfs_readdir()
1622 for (p = q->next; p != &parent_sd->s_children; p = p->next) { in configfs_readdir()
1661 list_move(q, p); in configfs_readdir()
1662 p = q; in configfs_readdir()

12