Searched refs:num (Results 1 - 25 of 78) sorted by relevance

1234

/fs/btrfs/
H A Dmath.h26 static inline u64 div_factor(u64 num, int factor) argument
29 return num;
30 num *= factor;
31 do_div(num, 10);
32 return num;
35 static inline u64 div_factor_fine(u64 num, int factor) argument
38 return num;
39 num *= factor;
40 do_div(num, 100);
41 return num;
[all...]
/fs/ext3/
H A Dhash.c68 static void str2hashbuf_signed(const char *msg, int len, __u32 *buf, int num) argument
78 if (len > num*4)
79 len = num * 4;
87 num--;
90 if (--num >= 0)
92 while (--num >= 0)
96 static void str2hashbuf_unsigned(const char *msg, int len, __u32 *buf, int num) argument
106 if (len > num*4)
107 len = num * 4;
115 num
[all...]
H A Dballoc.c882 unsigned long num = 0; local
939 num++;
941 while (num < *count && grp_goal < end
945 num++;
948 *count = num;
949 return grp_goal - num;
951 *count = num;
1324 unsigned long num = *count; local
1404 grp_goal, &num, &my_rsv->rsv_window);
1406 my_rsv->rsv_alloc_hit += num;
1511 unsigned long num = *count; local
1832 int num = b; local
[all...]
/fs/ext4/
H A Dhash.c70 static void str2hashbuf_signed(const char *msg, int len, __u32 *buf, int num) argument
80 if (len > num*4)
81 len = num * 4;
89 num--;
92 if (--num >= 0)
94 while (--num >= 0)
98 static void str2hashbuf_unsigned(const char *msg, int len, __u32 *buf, int num) argument
108 if (len > num*4)
109 len = num * 4;
117 num
[all...]
/fs/f2fs/
H A Dhash.c46 unsigned int *buf, int num)
55 if (len > num * 4)
56 len = num * 4;
64 num--;
67 if (--num >= 0)
69 while (--num >= 0)
45 str2hashbuf(const unsigned char *msg, size_t len, unsigned int *buf, int num) argument
/fs/cifs/
H A Dsmb2file.c95 unsigned int max_num, num = 0, max_buf; local
146 if (++num == max_num) {
150 current->tgid, num, buf);
167 num = 0;
171 if (num) {
174 num, buf);
194 unsigned int num = 0; local
203 if (++num == max_num) {
207 current->tgid, num, buf);
211 num
[all...]
/fs/dlm/
H A Dconfig.h50 int dlm_our_addr(struct sockaddr_storage *addr, int num);
H A Dmember.c175 int num = 0; local
204 num++;
225 num = 0;
241 num++;
258 num++;
274 log_slots(ls, gen, num, NULL, array, array_size);
279 if (num > max_slots) {
281 num, max_slots);
289 *num_slots = num;
489 int i, num; local
[all...]
/fs/ext2/
H A Dballoc.c671 unsigned long num = 0; local
728 num++;
730 while (num < *count && grp_goal < end
733 num++;
736 *count = num;
737 return grp_goal - num;
739 *count = num;
1099 unsigned long num = *count; local
1164 &num, &my_rsv->rsv_window);
1166 my_rsv->rsv_alloc_hit += num;
1231 unsigned long num = *count; local
1492 int num = b; local
[all...]
/fs/proc/
H A Dproc_tty.c27 dev_t from, int num)
31 if (p->num > 1) {
33 MINOR(from) + num - 1);
71 dev_t to = from + p->num;
26 show_tty_range(struct seq_file *m, struct tty_driver *p, dev_t from, int num) argument
/fs/udf/
H A Ddir.c58 int i, num, ret = 0; local
107 for (num = 0; i > 0; i--) {
111 bha[num++] = tmp;
115 if (num) {
116 ll_rw_block(READA, num, bha);
117 for (i = 0; i < num; i++)
H A Ddirectory.c29 int i, num, block; local
80 for (num = 0; i > 0; i--) {
86 bha[num++] = tmp;
90 if (num) {
91 ll_rw_block(READA, num, bha);
92 for (i = 0; i < num; i++)
/fs/hfs/
H A Dbnode.c212 static inline int hfs_bnode_hash(u32 num) argument
214 num = (num >> 16) + num;
215 num += num >> 8;
216 return num & (NODE_HASH_SIZE - 1);
316 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) argument
324 node = hfs_bnode_findhash(tree, num);
334 node = __hfs_bnode_create(tree, num);
409 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument
[all...]
/fs/ubifs/
H A Dlpt.c359 pack_bits(&addr, &pos, pnode->num, c->pcnt_bits);
392 pack_bits(&addr, &pos, nnode->num, c->pcnt_bits);
534 int num, bits; local
536 num = 1;
540 num <<= UBIFS_LPT_FANOUT_SHIFT;
541 num |= bits;
543 return num;
561 int num, shft; local
566 num = parent->num
586 int i, n = c->lpt_hght - 1, pnum = parent->num, num = 0; local
1099 int num = calc_nnode_num_from_parent(c, parent, iip); local
1143 int num = calc_pnode_num_from_parent(c, parent, iip); local
2227 int num, iip = 0, err; local
[all...]
/fs/minix/
H A Dminix.h127 unsigned short num; local
138 num = *--p;
139 return ((p - addr) << 4) + ffz(num);
H A Ditree_common.c70 int num,
79 if (parent) for (n = 1; n < num; n++) {
97 if (n == num)
111 int num)
138 for (i = 1; i < num; i++)
140 for (i = 0; i < num; i++)
69 alloc_branch(struct inode *inode, int num, int *offsets, Indirect *branch) argument
108 splice_branch(struct inode *inode, Indirect chain[DEPTH], Indirect *where, int num) argument
/fs/ceph/
H A Dsnap.c299 u32 num = realm->num_prior_parent_snaps + realm->num_snaps; local
312 num += parent->cached_context->num_snaps;
333 if (num > (SIZE_MAX - sizeof(*snapc)) / sizeof(u64))
335 snapc = ceph_create_snap_context(num, GFP_NOFS);
340 num = 0;
350 snapc->snaps[num++] =
355 memcpy(snapc->snaps + num, realm->snaps,
357 num += realm->num_snaps;
358 memcpy(snapc->snaps + num, realm->prior_parent_snaps,
360 num
406 dup_array(u64 **dst, __le64 *src, u32 num) argument
[all...]
/fs/nfs/filelayout/
H A Dfilelayoutdev.c492 u32 cnt, num; local
548 num = be32_to_cpup(p);
549 dprintk("%s ds_num %u\n", __func__, num);
550 if (num > NFS4_PNFS_MAX_MULTI_CNT) {
553 num, NFS4_PNFS_MAX_MULTI_CNT);
557 /* validate stripe indices are all < num */
558 if (max_stripe_index >= num) {
559 printk(KERN_WARNING "NFS: %s: stripe index %u >= num ds %u\n",
560 __func__, max_stripe_index, num);
565 (sizeof(struct nfs4_pnfs_ds *) * (num
[all...]
/fs/hfsplus/
H A Dbnode.c377 static inline int hfs_bnode_hash(u32 num) argument
379 num = (num >> 16) + num;
380 num += num >> 8;
381 return num & (NODE_HASH_SIZE - 1);
482 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) argument
490 node = hfs_bnode_findhash(tree, num);
501 node = __hfs_bnode_create(tree, num);
579 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument
[all...]
/fs/gfs2/
H A Dmeta_io.h63 extern int gfs2_meta_indirect_buffer(struct gfs2_inode *ip, int height, u64 num,
H A Dlops.c427 unsigned int num; local
435 num = total;
437 num = limit;
441 GFS2_LOG_DESC_METADATA, num + 1, num);
453 if (++n >= num)
484 if (++n >= num)
488 BUG_ON(total < num);
489 total -= num;
/fs/nfsd/
H A Dnfsctl.c542 int len, num, remaining; local
566 num = simple_strtol((vers+1), &minorp, 0);
568 num = simple_strtol(vers, &minorp, 0);
570 if (num != 4)
580 switch(num) {
584 nfsd_vers(num, sign == '-' ? NFSD_CLEAR : NFSD_SET);
602 for (num=2 ; num <= 4 ; num++)
603 if (nfsd_vers(num, NFSD_AVAI
[all...]
/fs/ocfs2/
H A Docfs2_trace.h10 TP_PROTO(int num),
11 TP_ARGS(num),
13 __field(int, num)
16 __entry->num = num;
18 TP_printk("%d", __entry->num)
23 TP_PROTO(int num), \
24 TP_ARGS(num))
27 TP_PROTO(unsigned int num),
28 TP_ARGS(num),
[all...]
/fs/sysv/
H A Ditree.c125 int num,
134 if (branch[0].key) for (n = 1; n < num; n++) {
156 if (n == num)
170 int num)
195 for (i = 1; i < num; i++)
197 for (i = 0; i < num; i++)
124 alloc_branch(struct inode *inode, int num, int *offsets, Indirect *branch) argument
167 splice_branch(struct inode *inode, Indirect chain[], Indirect *where, int num) argument
/fs/lockd/
H A Dsvc.c523 __typeof__(type) num = which_strtol(val, &endp, 0); \
524 if (endp == val || *endp || num < (min) || num > (max)) \
526 *((type *) kp->arg) = num; \

Completed in 380 milliseconds

1234