Home
last modified time | relevance | path

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

12

/fs/btrfs/
A Dconv-funcs.h29 static inline struct n *n##_to_disk(struct n * r) \
33 static inline struct n *n##_to_cpu(struct n * r) \
39 static inline struct n *n##_to_disk_##a(struct n * r) \
43 static inline struct n *n##_to_cpu_##a(struct n * r) \
60 static inline struct n * n##_to_disk(struct n *); \
61 static inline struct n * n##_to_cpu(struct n *); \
62 static inline struct n n##_to_disk_v(struct n x) { \
65 static inline struct n n##_to_cpu_v(struct n x) { \
111 DEFINE_CONV_ONE(n,n##_to_disk,DEFINE_CONV_CPU_TO_LE,##__VA_ARGS__) \
112 DEFINE_CONV_ONE(n,n##_to_cpu,DEFINE_CONV_LE_TO_CPU,##__VA_ARGS__)
[all …]
A Dcompat.h77 static inline int is_power_of_2(unsigned long n) in is_power_of_2() argument
79 return (n != 0 && ((n & (n - 1)) == 0)); in is_power_of_2()
A Dvolumes.h127 #define btrfs_multi_bio_size(n) (sizeof(struct btrfs_multi_bio) + \ argument
128 (sizeof(struct btrfs_bio_stripe) * (n)))
129 #define btrfs_map_lookup_size(n) (sizeof(struct map_lookup) + \ argument
130 (sizeof(struct btrfs_bio_stripe) * (n)))
/fs/ubifs/
A Dtnc.c642 *n = nn; in tnc_next()
687 *n = nn; in tnc_prev()
1048 nn = *n; in resolve_collision_directly()
1070 nn = *n; in resolve_collision_directly()
1115 int n; in dirty_cow_bottom_up() local
1985 ubifs_assert(n >= 0 && n <= c->fanout); in tnc_insert()
2402 ubifs_assert(n >= 0 && n < c->fanout); in tnc_delete()
3061 nn = n; in lookup_znode()
3065 if (n) in lookup_znode()
3085 n = nn; in lookup_znode()
[all …]
A Dtnc_misc.c130 const union ubifs_key *key, int *n) in ubifs_search_zbranch() argument
146 *n = mid; in ubifs_search_zbranch()
151 *n = end - 1; in ubifs_search_zbranch()
154 ubifs_assert(*n >= -1 && *n < znode->child_cnt); in ubifs_search_zbranch()
155 if (*n == -1) in ubifs_search_zbranch()
159 if (*n + 1 < znode->child_cnt) in ubifs_search_zbranch()
225 int n; in ubifs_destroy_tnc_subtree() local
229 for (n = 0; n < zn->child_cnt; n++) { in ubifs_destroy_tnc_subtree()
230 if (!zn->zbranch[n].znode) in ubifs_destroy_tnc_subtree()
234 !ubifs_zn_dirty(zn->zbranch[n].znode)) in ubifs_destroy_tnc_subtree()
[all …]
A Ddebug.c310 int i, n; in ubifs_dump_node() local
543 for (i = 0; i < n; i++) in ubifs_dump_node()
880 int n; in ubifs_dump_znode() local
900 for (n = 0; n < znode->child_cnt; n++) { in ubifs_dump_znode()
1308 int n, err, cmp; in dbg_check_znode() local
1380 n = znode->iip; in dbg_check_znode()
1421 for (n = 1; n < znode->child_cnt; n++) { in dbg_check_znode()
1453 for (n = 0; n < znode->child_cnt; n++) { in dbg_check_znode()
1985 int n, err; in read_add_inode() local
2220 int n, err; in check_inodes() local
[all …]
A Dlpt.c64 n = UBIFS_LPT_FANOUT; in do_calc_lpt_geom()
73 c->nnode_cnt = n; in do_calc_lpt_geom()
75 n = DIV_ROUND_UP(n, UBIFS_LPT_FANOUT); in do_calc_lpt_geom()
76 c->nnode_cnt += n; in do_calc_lpt_geom()
85 c->pcnt_bits = fls(n - 1); in do_calc_lpt_geom()
1489 struct ubifs_nnode *n; in dirty_cow_nnode() local
1503 if (unlikely(!n)) in dirty_cow_nnode()
1507 n->cnext = NULL; in dirty_cow_nnode()
1525 nnode->parent->nbranch[n->iip].nnode = n; in dirty_cow_nnode()
1527 c->nroot = n; in dirty_cow_nnode()
[all …]
A Dorphan.c559 int i, n, err, first = 1; in do_kill_orphans() local
603 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3; in do_kill_orphans()
604 for (i = 0; i < n; i++) { in do_kill_orphans()
808 struct check_orphan *o, *n; in dbg_free_check_tree() local
810 rbtree_postorder_for_each_entry_safe(o, n, root, rb) in dbg_free_check_tree()
852 int i, n, err; in dbg_read_orphans() local
859 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3; in dbg_read_orphans()
860 for (i = 0; i < n; i++) { in dbg_read_orphans()
A Dio.c688 int err, written, n, aligned_len = ALIGN(len, 8); in ubifs_wbuf_write_nolock() local
798 n = aligned_len >> c->max_write_shift; in ubifs_wbuf_write_nolock()
799 if (n) { in ubifs_wbuf_write_nolock()
800 n <<= c->max_write_shift; in ubifs_wbuf_write_nolock()
801 dbg_io("write %d bytes to LEB %d:%d", n, wbuf->lnum, in ubifs_wbuf_write_nolock()
804 wbuf->offs, n); in ubifs_wbuf_write_nolock()
807 wbuf->offs += n; in ubifs_wbuf_write_nolock()
808 aligned_len -= n; in ubifs_wbuf_write_nolock()
809 len -= n; in ubifs_wbuf_write_nolock()
810 written += n; in ubifs_wbuf_write_nolock()
A Dlpt_commit.c162 int i, n; in alloc_lpt_leb() local
164 n = *lnum - c->lpt_first + 1; in alloc_lpt_leb()
165 for (i = n; i < c->lpt_lebs; i++) { in alloc_lpt_leb()
175 for (i = 0; i < n; i++) { in alloc_lpt_leb()
347 int i, n; in realloc_lpt_leb() local
349 n = *lnum - c->lpt_first + 1; in realloc_lpt_leb()
350 for (i = n; i < c->lpt_lebs; i++) in realloc_lpt_leb()
357 for (i = 0; i < n; i++) in realloc_lpt_leb()
A Dlog.c579 struct done_ref *dr, *n; in destroy_done_tree() local
581 rbtree_postorder_for_each_entry_safe(dr, n, done_tree, rb) in destroy_done_tree()
A Drecovery.c1336 struct size_entry *e, *n; in ubifs_destroy_size_tree() local
1338 rbtree_postorder_for_each_entry_safe(e, n, &c->size_tree, rb) { in ubifs_destroy_size_tree()
A Dubifs.h2187 struct ubifs_znode **zn, int *n);
2225 const union ubifs_key *key, int *n);
/fs/exfat/
A Dlookup.c81 struct exfat_node** node, const char* name, size_t n) in lookup_name() argument
126 size_t n; in exfat_lookup() local
131 for (p = path; (n = get_comp(p, &p)); p += n) in exfat_lookup()
135 rc = lookup_name(ef, parent, node, p, n); in exfat_lookup()
180 size_t n; in exfat_split() local
185 for (p = path; (n = get_comp(p, &p)); p += n) in exfat_split()
187 if (n == 1 && *p == '.') in exfat_split()
189 if (is_last_comp(p, n)) in exfat_split()
191 if (!is_allowed(p, n)) in exfat_split()
204 rc = lookup_name(ef, *parent, node, p, n); in exfat_split()
[all …]
A Dnode.c97 sizeof(struct exfat_entry[n])); in read_entries()
116 sizeof(struct exfat_entry[n])); in write_entries()
159 for (i = 0; i < n; i++) in init_node_name()
202 current, previous, i, n); in check_entries()
303 if (!check_entries(entries, n)) in parse_file_entries()
339 struct exfat_entry entries[n]; in parse_file_entry()
690 for (i = 0; i < n; i++) in erase_entries()
808 int n) in check_slot() argument
823 for (i = 0; i < n; i++) in check_slot()
830 off_t* offset, int n) in find_slot() argument
[all …]
A Dexfatfs.h39 #define geteuid(n) 1000 argument
40 #define getegid(n) 1000 argument
41 #define strtol(n, e, b) simple_strtol(n, e, b) argument
A Dutils.c61 static uint16_t add_checksum_bytes(uint16_t sum, const void* buffer, size_t n) in add_checksum_bytes() argument
65 for (i = 0; i < n; i++) in add_checksum_bytes()
86 le16_t exfat_calc_checksum(const struct exfat_entry* entries, int n) in exfat_calc_checksum() argument
92 for (i = 1; i < n; i++) in exfat_calc_checksum()
A Dexfat.h208 le16_t exfat_calc_checksum(const struct exfat_entry* entries, int n);
/fs/btrfs/common/
A Drbtree-utils.c49 struct rb_node *n = root->rb_node; in rb_search() local
53 while(n) { in rb_search()
54 parent = n; in rb_search()
56 ret = comp(n, key); in rb_search()
58 n = n->rb_left; in rb_search()
60 n = n->rb_right; in rb_search()
62 return n; in rb_search()
/fs/jffs2/
A Dmini_inflate.c17 static inline void cramfs_memset(int *s, const int c, size n) in cramfs_memset() argument
19 n--; in cramfs_memset()
20 for (;n > 0; n--) s[n] = c; in cramfs_memset()
A DKconfig31 O(n^2), thus you should really consider if you can avoid it!
/fs/ext4/
A Dext4fs.c169 int n; in ext4fs_read_file() local
184 n = blocksize - skipfirst; in ext4fs_read_file()
186 if (n > n_left) in ext4fs_read_file()
187 n = n_left; in ext4fs_read_file()
188 memset(buf, 0, n); in ext4fs_read_file()
A Dext4_common.h62 uint32_t ext4fs_div_roundup(uint32_t size, uint32_t n);
/fs/fat/
A Dfat.c968 int n = 0; in extract_vfat_name() local
976 if (n + idx >= sizeof(itr->l_name)) in extract_vfat_name()
980 memmove(itr->l_name + idx, itr->l_name, n); in extract_vfat_name()
982 n += idx; in extract_vfat_name()
997 itr->l_name[n] = '\0'; in extract_vfat_name()
1163 unsigned n = max(strlen(itr->name), (size_t)(next - path)); in fat_itr_resolve() local
1166 if (!strncasecmp(path, itr->name, n)) in fat_itr_resolve()
1169 !strncasecmp(path, itr->s_name, n)) in fat_itr_resolve()
A Dfat_write.c268 unsigned int n = 0; in fat_find_empty_dentries() local
283 if (!n) { in fat_find_empty_dentries()
289 ++n; in fat_find_empty_dentries()
290 if (n == count) in fat_find_empty_dentries()
294 n = 0; in fat_find_empty_dentries()

Completed in 51 milliseconds

12