Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 216) sorted by relevance

123456789

/fs/befs/
Dendian.h15 fs64_to_cpu(const struct super_block *sb, fs64 n) in fs64_to_cpu() argument
18 return le64_to_cpu((__force __le64)n); in fs64_to_cpu()
20 return be64_to_cpu((__force __be64)n); in fs64_to_cpu()
24 cpu_to_fs64(const struct super_block *sb, u64 n) in cpu_to_fs64() argument
27 return (__force fs64)cpu_to_le64(n); in cpu_to_fs64()
29 return (__force fs64)cpu_to_be64(n); in cpu_to_fs64()
33 fs32_to_cpu(const struct super_block *sb, fs32 n) in fs32_to_cpu() argument
36 return le32_to_cpu((__force __le32)n); in fs32_to_cpu()
38 return be32_to_cpu((__force __be32)n); in fs32_to_cpu()
42 cpu_to_fs32(const struct super_block *sb, u32 n) in cpu_to_fs32() argument
[all …]
/fs/ufs/
Dswab.h26 fs64_to_cpu(struct super_block *sbp, __fs64 n) in fs64_to_cpu() argument
29 return le64_to_cpu((__force __le64)n); in fs64_to_cpu()
31 return be64_to_cpu((__force __be64)n); in fs64_to_cpu()
35 cpu_to_fs64(struct super_block *sbp, u64 n) in cpu_to_fs64() argument
38 return (__force __fs64)cpu_to_le64(n); in cpu_to_fs64()
40 return (__force __fs64)cpu_to_be64(n); in cpu_to_fs64()
44 fs32_to_cpu(struct super_block *sbp, __fs32 n) in fs32_to_cpu() argument
47 return le32_to_cpu((__force __le32)n); in fs32_to_cpu()
49 return be32_to_cpu((__force __be32)n); in fs32_to_cpu()
53 cpu_to_fs32(struct super_block *sbp, u32 n) in cpu_to_fs32() argument
[all …]
/fs/ubifs/
Dtnc.c230 const int n = zn->child_cnt; in copy_znode() local
233 for (i = 0; i < n; i++) { in copy_znode()
585 struct ubifs_znode *znode, int n) in get_znode() argument
589 zbr = &znode->zbranch[n]; in get_znode()
593 znode = ubifs_load_znode(c, zbr, znode, n); in get_znode()
606 static int tnc_next(struct ubifs_info *c, struct ubifs_znode **zn, int *n) in tnc_next() argument
609 int nn = *n; in tnc_next()
613 *n = nn; in tnc_next()
638 *n = nn; in tnc_next()
651 static int tnc_prev(struct ubifs_info *c, struct ubifs_znode **zn, int *n) in tnc_prev() argument
[all …]
/fs/minix/
Ditree_v2.c8 static inline unsigned long block_to_cpu(block_t n) in block_to_cpu() argument
10 return n; in block_to_cpu()
13 static inline block_t cpu_to_block(unsigned long n) in cpu_to_block() argument
15 return n; in cpu_to_block()
25 int n = 0; in block_to_path() local
38 offsets[n++] = block; in block_to_path()
40 offsets[n++] = 7; in block_to_path()
41 offsets[n++] = block; in block_to_path()
43 offsets[n++] = 8; in block_to_path()
44 offsets[n++] = block>>8; in block_to_path()
[all …]
Ditree_v1.c8 static inline unsigned long block_to_cpu(block_t n) in block_to_cpu() argument
10 return n; in block_to_cpu()
13 static inline block_t cpu_to_block(unsigned long n) in cpu_to_block() argument
15 return n; in cpu_to_block()
25 int n = 0; in block_to_path() local
37 offsets[n++] = block; in block_to_path()
39 offsets[n++] = 7; in block_to_path()
40 offsets[n++] = block; in block_to_path()
43 offsets[n++] = 8; in block_to_path()
44 offsets[n++] = block>>9; in block_to_path()
[all …]
Ditree_common.c74 int n = 0; in alloc_branch() local
79 if (parent) for (n = 1; n < num; n++) { in alloc_branch()
85 branch[n].key = cpu_to_block(nr); in alloc_branch()
89 branch[n].bh = bh; in alloc_branch()
90 branch[n].p = (block_t*) bh->b_data + offsets[n]; in alloc_branch()
91 *branch[n].p = branch[n].key; in alloc_branch()
97 if (n == num) in alloc_branch()
101 for (i = 1; i < n; i++) in alloc_branch()
103 for (i = 0; i < n; i++) in alloc_branch()
301 int n; in truncate() local
[all …]
/fs/sysv/
Dsysv.h195 static inline __u32 fs32_to_cpu(struct sysv_sb_info *sbi, __fs32 n) in fs32_to_cpu() argument
198 return PDP_swab((__force __u32)n); in fs32_to_cpu()
200 return le32_to_cpu((__force __le32)n); in fs32_to_cpu()
202 return be32_to_cpu((__force __be32)n); in fs32_to_cpu()
205 static inline __fs32 cpu_to_fs32(struct sysv_sb_info *sbi, __u32 n) in cpu_to_fs32() argument
208 return (__force __fs32)PDP_swab(n); in cpu_to_fs32()
210 return (__force __fs32)cpu_to_le32(n); in cpu_to_fs32()
212 return (__force __fs32)cpu_to_be32(n); in cpu_to_fs32()
215 static inline __fs32 fs32_add(struct sysv_sb_info *sbi, __fs32 *n, int d) in fs32_add() argument
218 *(__u32*)n = PDP_swab(PDP_swab(*(__u32*)n)+d); in fs32_add()
[all …]
Ditree.c29 int n = 0; in block_to_path() local
34 offsets[n++] = block; in block_to_path()
36 offsets[n++] = DIRECT; in block_to_path()
37 offsets[n++] = block; in block_to_path()
39 offsets[n++] = DIRECT+1; in block_to_path()
40 offsets[n++] = block >> ptrs_bits; in block_to_path()
41 offsets[n++] = block & (indirect_blocks - 1); in block_to_path()
43 offsets[n++] = DIRECT+2; in block_to_path()
44 offsets[n++] = block >> (ptrs_bits * 2); in block_to_path()
45 offsets[n++] = (block >> ptrs_bits) & (indirect_blocks - 1); in block_to_path()
[all …]
Ddir.c59 static struct page * dir_get_page(struct inode *dir, unsigned long n) in dir_get_page() argument
62 struct page *page = read_mapping_page(mapping, n, NULL); in dir_get_page()
74 unsigned long n = pos >> PAGE_CACHE_SHIFT; in sysv_readdir() local
83 for ( ; n < npages; n++, offset = 0) { in sysv_readdir()
86 struct page *page = dir_get_page(inode, n); in sysv_readdir()
103 ((loff_t)n<<PAGE_CACHE_SHIFT) | offset, in sysv_readdir()
115 filp->f_pos = ((loff_t)n << PAGE_CACHE_SHIFT) | offset; in sysv_readdir()
144 unsigned long start, n; in sysv_find_entry() local
154 n = start; in sysv_find_entry()
158 page = dir_get_page(dir, n); in sysv_find_entry()
[all …]
/fs/jfs/
Djfs_unicode.h55 size_t n) in UniStrncpy_le() argument
59 while (n-- && *ucs2) /* Copy the strings */ in UniStrncpy_le()
62 n++; in UniStrncpy_le()
63 while (n--) /* Pad with nulls */ in UniStrncpy_le()
72 size_t n) in UniStrncmp_le() argument
74 if (!n) in UniStrncmp_le()
76 while ((*ucs1 == __le16_to_cpu(*ucs2)) && *ucs1 && --n) { in UniStrncmp_le()
87 size_t n) in UniStrncpy_to_le() argument
91 while (n-- && *ucs2) /* Copy the strings */ in UniStrncpy_to_le()
94 n++; in UniStrncpy_to_le()
[all …]
/fs/yaffs2/
Dyaffs_qsort.c36 #define swapcode(TYPE, parmi, parmj, n) do { \ argument
37 long i = (n) / sizeof (TYPE); \
51 swapfunc(char *a, char *b, int n, int swaptype) in swapfunc() argument
54 swapcode(long, a, b, n); in swapfunc()
56 swapcode(char, a, b, n); in swapfunc()
68 #define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype) argument
83 yaffs_qsort(void *aa, size_t n, size_t es, in yaffs_qsort() argument
92 if (n < 7) { in yaffs_qsort()
93 for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es) in yaffs_qsort()
99 pm = (char *)a + (n / 2) * es; in yaffs_qsort()
[all …]
/fs/hpfs/
Dalloc.c64 static secno alloc_in_bmp(struct super_block *s, secno near, unsigned n, unsigned forward) in alloc_in_bmp() argument
69 unsigned nr = (near & 0x3fff) & ~(n - 1); in alloc_in_bmp()
74 if (n != 1 && n != 4) { in alloc_in_bmp()
75 hpfs_error(s, "Bad allocation size: %d", n); in alloc_in_bmp()
84 if (!tstbits(bmp, nr, n + forward)) { in alloc_in_bmp()
92 q = nr + n; b = 0; in alloc_in_bmp()
93 while ((a = tstbits(bmp, q, n + forward)) != 0) { in alloc_in_bmp()
95 if (n != 1) q = ((q-1)&~(n-1))+n; in alloc_in_bmp()
112 if (n + forward >= 0x3f && bmp[i] != -1) goto cont; in alloc_in_bmp()
120 if (n != 1) q = ((q-1)&~(n-1))+n; in alloc_in_bmp()
[all …]
/fs/9p/
Dvfs_file.c136 int n, total; in v9fs_file_readn() local
142 n = 0; in v9fs_file_readn()
145 n = p9_client_read(fid, data, udata, offset, count); in v9fs_file_readn()
146 if (n <= 0) in v9fs_file_readn()
150 data += n; in v9fs_file_readn()
152 udata += n; in v9fs_file_readn()
154 offset += n; in v9fs_file_readn()
155 count -= n; in v9fs_file_readn()
156 total += n; in v9fs_file_readn()
157 } while (count > 0 && n == (fid->clnt->msize - P9_IOHDRSZ)); in v9fs_file_readn()
[all …]
/fs/xfs/
Dxfs_bit.h28 static inline __uint64_t xfs_mask64hi(int n) in xfs_mask64hi() argument
30 return (__uint64_t)-1 << (64 - (n)); in xfs_mask64hi()
32 static inline __uint32_t xfs_mask32lo(int n) in xfs_mask32lo() argument
34 return ((__uint32_t)1 << (n)) - 1; in xfs_mask32lo()
36 static inline __uint64_t xfs_mask64lo(int n) in xfs_mask64lo() argument
38 return ((__uint64_t)1 << (n)) - 1; in xfs_mask64lo()
63 int n = 0; in xfs_lowbit64() local
66 n = ffs(w); in xfs_lowbit64()
69 if (w && (n = ffs(w))) in xfs_lowbit64()
70 n += 32; in xfs_lowbit64()
[all …]
Dxfs_dir2_trace.c53 void *n[5]; in xfs_dir2_trace_enter() local
58 memcpy(n, name, min((int)sizeof(n), namelen)); in xfs_dir2_trace_enter()
60 memset((char *)n, 0, sizeof(n)); in xfs_dir2_trace_enter()
66 (void *)n[0], (void *)n[1], (void *)n[2], in xfs_dir2_trace_enter()
67 (void *)n[3], (void *)n[4]); in xfs_dir2_trace_enter()
73 (void *)n[0], (void *)n[1], (void *)n[2], in xfs_dir2_trace_enter()
74 (void *)n[3], (void *)n[4]); in xfs_dir2_trace_enter()
/fs/btrfs/
Dfree-space-cache.c80 struct rb_node *n = root->rb_node; in tree_search_offset() local
83 while (n) { in tree_search_offset()
84 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
91 n = n->rb_left; in tree_search_offset()
98 n = n->rb_right; in tree_search_offset()
101 n = n->rb_right; in tree_search_offset()
118 struct rb_node *n = root->rb_node; in tree_search_bytes() local
121 while (n) { in tree_search_bytes()
122 entry = rb_entry(n, struct btrfs_free_space, bytes_index); in tree_search_bytes()
140 n = n->rb_left; in tree_search_bytes()
[all …]
/fs/cifs/
Dcifs_unicode.h165 UniStrncat(wchar_t *ucs1, const wchar_t *ucs2, size_t n) in UniStrncat() argument
171 while (n-- && (*ucs1 = *ucs2)) { /* copy s2 after s1 */ in UniStrncat()
183 UniStrncmp(const wchar_t *ucs1, const wchar_t *ucs2, size_t n) in UniStrncmp() argument
185 if (!n) in UniStrncmp()
187 while ((*ucs1 == *ucs2) && *ucs1 && --n) { in UniStrncmp()
198 UniStrncmp_le(const wchar_t *ucs1, const wchar_t *ucs2, size_t n) in UniStrncmp_le() argument
200 if (!n) in UniStrncmp_le()
202 while ((*ucs1 == __le16_to_cpu(*ucs2)) && *ucs1 && --n) { in UniStrncmp_le()
213 UniStrncpy(wchar_t *ucs1, const wchar_t *ucs2, size_t n) in UniStrncpy() argument
217 while (n-- && *ucs2) /* Copy the strings */ in UniStrncpy()
[all …]
/fs/
Dselect.c313 #define FDS_IN(fds, n) (fds->in + n) argument
314 #define FDS_OUT(fds, n) (fds->out + n) argument
315 #define FDS_EX(fds, n) (fds->ex + n) argument
317 #define BITS(fds, n) (*FDS_IN(fds, n)|*FDS_OUT(fds, n)|*FDS_EX(fds, n)) argument
319 static int max_select_fd(unsigned long n, fd_set_bits *fds) in max_select_fd() argument
327 set = ~(~0UL << (n & (__NFDBITS-1))); in max_select_fd()
328 n /= __NFDBITS; in max_select_fd()
330 open_fds = fdt->open_fds->fds_bits+n; in max_select_fd()
333 set &= BITS(fds, n); in max_select_fd()
340 while (n) { in max_select_fd()
[all …]
Dmbcache.c135 int n; in __mb_cache_entry_unhash() local
139 for (n=0; n<mb_cache_indexes(ce->e_cache); n++) in __mb_cache_entry_unhash()
140 list_del(&ce->e_indexes[n].o_list); in __mb_cache_entry_unhash()
257 int m=0, n, bucket_count = 1 << bucket_bits; in mb_cache_create() local
283 for (n=0; n<bucket_count; n++) in mb_cache_create()
284 INIT_LIST_HEAD(&cache->c_block_hash[n]); in mb_cache_create()
291 for (n=0; n<bucket_count; n++) in mb_cache_create()
292 INIT_LIST_HEAD(&cache->c_indexes_hash[m][n]); in mb_cache_create()
359 int n; in mb_cache_destroy() local
386 for (n=0; n < mb_cache_indexes(cache); n++) in mb_cache_destroy()
[all …]
Dchar_dev.c197 dev_t n, next; in register_chrdev_region() local
199 for (n = from; n < to; n = next) { in register_chrdev_region()
200 next = MKDEV(MAJOR(n)+1, 0); in register_chrdev_region()
203 cd = __register_chrdev_region(MAJOR(n), MINOR(n), in register_chrdev_region()
204 next - n, name); in register_chrdev_region()
210 to = n; in register_chrdev_region()
211 for (n = from; n < to; n = next) { in register_chrdev_region()
212 next = MKDEV(MAJOR(n)+1, 0); in register_chrdev_region()
213 kfree(__unregister_chrdev_region(MAJOR(n), MINOR(n), next - n)); in register_chrdev_region()
310 dev_t n, next; in unregister_chrdev_region() local
[all …]
/fs/hfs/
Dbitmap.c32 u32 mask, start, len, n; in hfs_find_set_zero_bits() local
46 n = be32_to_cpu(val); in hfs_find_set_zero_bits()
50 if (!(n & mask)) in hfs_find_set_zero_bits()
59 n = be32_to_cpu(val); in hfs_find_set_zero_bits()
62 if (!(n & mask)) in hfs_find_set_zero_bits()
76 n |= mask; in hfs_find_set_zero_bits()
80 if (!--len || n & mask) in hfs_find_set_zero_bits()
85 *curr++ = cpu_to_be32(n); in hfs_find_set_zero_bits()
88 n = be32_to_cpu(*curr); in hfs_find_set_zero_bits()
91 if (n) { in hfs_find_set_zero_bits()
[all …]
/fs/nls/
Dnls_euc-jp.c353 int n; in euc2sjisibm() local
366 if ((n = euc2sjisibm_g3upper(sjis, euc_hi, euc_lo))) { in euc2sjisibm()
367 return n; in euc2sjisibm()
368 } else if ((n = euc2sjisibm_jisx0212(sjis, euc_hi, euc_lo))) { in euc2sjisibm()
369 return n; in euc2sjisibm()
412 int n; in uni2char() local
416 if ((n = p_nls->uni2char(uni, out, boundlen)) < 0) in uni2char()
417 return n; in uni2char()
420 if (n == 1) { in uni2char()
430 } else if (n == 2) { in uni2char()
[all …]
Dnls_utf8.c16 int n; in uni2char() local
18 if ( (n = utf8_wctomb(out, uni, boundlen)) == -1) { in uni2char()
22 return n; in uni2char()
27 int n; in char2uni() local
29 if ( (n = utf8_mbtowc(uni, rawstring, boundlen)) == -1) { in char2uni()
31 n = -EINVAL; in char2uni()
33 return n; in char2uni()
/fs/afs/
Dnetdevices.c46 int n = 0; in afs_get_ipv4_interfaces() local
58 bufs[n].address.s_addr = ifa->ifa_address; in afs_get_ipv4_interfaces()
59 bufs[n].netmask.s_addr = ifa->ifa_mask; in afs_get_ipv4_interfaces()
60 bufs[n].mtu = dev->mtu; in afs_get_ipv4_interfaces()
61 n++; in afs_get_ipv4_interfaces()
62 if (n >= maxbufs) in afs_get_ipv4_interfaces()
68 return n; in afs_get_ipv4_interfaces()
/fs/hfsplus/
Dbitmap.c23 u32 mask, start, len, n; in hfsplus_block_allocate() local
51 n = be32_to_cpu(val); in hfsplus_block_allocate()
54 if (!(n & mask)) in hfsplus_block_allocate()
65 n = be32_to_cpu(val); in hfsplus_block_allocate()
68 if (!(n & mask)) in hfsplus_block_allocate()
103 n |= mask; in hfsplus_block_allocate()
107 if (!--len || n & mask) in hfsplus_block_allocate()
112 *curr++ = cpu_to_be32(n); in hfsplus_block_allocate()
116 n = be32_to_cpu(*curr); in hfsplus_block_allocate()
119 if (n) { in hfsplus_block_allocate()
[all …]

123456789