/fs/btrfs/ |
H A D | math.h | 26 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/cifs/ |
H A D | smb2file.c | 95 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...] |
H A D | smb2transport.c | 469 unsigned int i, num = le16_to_cpu(hdr->CreditCharge); local 473 for (i = 1; i < num; i++)
|
H A D | transport.c | 453 unsigned int *num, unsigned int *credits) 455 *num = size; 452 cifs_wait_mtu_credits(struct TCP_Server_Info *server, unsigned int size, unsigned int *num, unsigned int *credits) argument
|
/fs/f2fs/ |
H A D | hash.c | 46 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/proc/ |
H A D | proc_tty.c | 27 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/ext3/ |
H A D | hash.c | 68 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...] |
/fs/ext4/ |
H A D | hash.c | 70 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...] |
H A D | file.c | 300 int i, num; local 303 num = min_t(pgoff_t, end - index, PAGEVEC_SIZE); 305 (pgoff_t)num); 390 if (nr_pages < num && whence == SEEK_HOLE) {
|
H A D | balloc.c | 819 unsigned num; local 822 num = ext4_bg_has_super(sb, block_group); 827 if (num) { 828 num += ext4_bg_num_gdb(sb, block_group); 829 num += le16_to_cpu(sbi->s_es->s_reserved_gdt_blocks); 832 num += ext4_bg_num_gdb(sb, block_group); 834 return EXT4_NUM_B2C(sbi, num);
|
H A D | ialloc.c | 1241 int num, ret = 0, used_blks = 0; local 1288 num = sbi->s_itb_per_group - used_blks; 1301 if (unlikely(num == 0)) 1306 ret = sb_issue_zeroout(sb, blk, num, GFP_NOFS);
|
H A D | indirect.c | 404 * @num: number of indirect blocks we are adding 413 Indirect *where, int num) 438 if (num == 0 && ar->len > 1) { 470 for (i = 1; i <= num; i++) { 479 ext4_free_blocks(handle, ar->inode, NULL, le32_to_cpu(where[num].key), 411 ext4_splice_branch(handle_t *handle, struct ext4_allocation_request *ar, Indirect *where, int num) argument
|
/fs/udf/ |
H A D | dir.c | 58 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 D | directory.c | 29 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/gfs2/ |
H A D | meta_io.c | 330 * @num: The block number (device relative) of the buffer 336 int gfs2_meta_indirect_buffer(struct gfs2_inode *ip, int height, u64 num, argument 345 ret = gfs2_meta_read(gl, num, DIO_WAIT, &bh);
|
H A D | lock_dlm.c | 521 unsigned int num, struct dlm_lksb *lksb, char *name) 528 snprintf(strname, GDLM_STRNAME_BYTES, "%8x%16x", LM_TYPE_NONDISK, num); 520 sync_lock(struct gfs2_sbd *sdp, int mode, uint32_t flags, unsigned int num, struct dlm_lksb *lksb, char *name) argument
|
/fs/hfs/ |
H A D | bnode.c | 212 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/hfsplus/ |
H A D | bnode.c | 377 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/minix/ |
H A D | itree_common.c | 70 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
|
H A D | minix.h | 127 unsigned short num; local 138 num = *--p; 139 return ((p - addr) << 4) + ffz(num);
|
/fs/ceph/ |
H A D | snap.c | 299 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/dlm/ |
H A D | member.c | 175 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/nfs/filelayout/ |
H A D | filelayoutdev.c | 492 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/sysv/ |
H A D | itree.c | 125 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/ext2/ |
H A D | balloc.c | 671 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...] |