Home
last modified time | relevance | path

Searched refs:p (Results 1 – 25 of 26) sorted by relevance

12

/fs/exfat/
A Dlookup.c125 const char* p; 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()
149 const char* p = comp + length; in is_last_comp() local
151 return get_comp(p, &p) == 0; in is_last_comp()
179 const char* p; 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()
[all …]
A Dutils.c186 const char* p; in exfat_match_option() local
189 for (p = strstr(options, option_name); p; p = strstr(p + 1, option_name)) in exfat_match_option()
190 if ((p == options || p[-1] == ',') && in exfat_match_option()
191 (p[length] == ',' || p[length] == '\0')) in exfat_match_option()
A Dmount.c65 const char* p; in get_option() local
68 for (p = strstr(options, option_name); p; p = strstr(p + 1, option_name)) in get_option()
69 if ((p == options || p[-1] == ',') && p[length] == '=') in get_option()
70 return p + length + 1; in get_option()
77 const char* p = get_option(options, option_name); in get_int_option() local
79 if (p == NULL) in get_int_option()
81 return strtol(p, NULL, base); in get_int_option()
A Dnode.c602 struct exfat_node* p = node->child; in reset_cache() local
603 reset_cache(ef, p); in reset_cache()
604 tree_detach(p); in reset_cache()
605 free(p); in reset_cache()
833 struct exfat_node* p; in find_slot() local
849 for (p = dir->child; p != NULL; p = p->next) in find_slot()
850 for (i = 0; i < 1u + p->continuations; i++) in find_slot()
851 BMAP_SET(dmap, p->entry_offset / sizeof(struct exfat_entry) + i); in find_slot()
1096 struct exfat_node* p; in exfat_rename() local
1098 for (p = dir; p; p = p->parent) in exfat_rename()
[all …]
A Dcluster.c141 struct exfat_node* p; in flush_nodes() local
143 for (p = node->child; p != NULL; p = p->next) in flush_nodes()
145 int rc = flush_nodes(ef, p); in flush_nodes()
/fs/ubifs/
A Dorphan.c78 p = &(*p)->rb_left; in ubifs_add_orphan()
80 p = &(*p)->rb_right; in ubifs_add_orphan()
116 p = p->rb_left; in ubifs_delete_orphan()
118 p = p->rb_right; in ubifs_delete_orphan()
518 p = &(*p)->rb_left; in insert_dead_orphan()
520 p = &(*p)->rb_right; in insert_dead_orphan()
748 p = p->rb_left; in dbg_find_orphan()
750 p = p->rb_right; in dbg_find_orphan()
775 p = &(*p)->rb_left; in dbg_ins_check_orphan()
797 p = p->rb_left; in dbg_find_check_orphan()
[all …]
A Dlog.c42 while (p) { in ubifs_search_bud()
45 p = p->rb_left; in ubifs_search_bud()
47 p = p->rb_right; in ubifs_search_bud()
75 while (p) { in ubifs_get_wbuf()
78 p = p->rb_left; in ubifs_get_wbuf()
80 p = p->rb_right; in ubifs_get_wbuf()
130 p = &(*p)->rb_left; in ubifs_add_bud()
132 p = &(*p)->rb_right; in ubifs_add_bud()
306 p = rb_next(p); in remove_buds()
554 p = &(*p)->rb_left; in done_already()
[all …]
A Dlpt.c267 p++; in pack_bits()
268 *addr = p; in pack_bits()
298 val = p[1] | ((uint32_t)p[2] << 8); in ubifs_unpack_bits()
301 val = p[1] | ((uint32_t)p[2] << 8) | in ubifs_unpack_bits()
305 val = p[1] | ((uint32_t)p[2] << 8) | in ubifs_unpack_bits()
318 val = p[0] | ((uint32_t)p[1] << 8); in ubifs_unpack_bits()
321 val = p[0] | ((uint32_t)p[1] << 8) | in ubifs_unpack_bits()
325 val = p[0] | ((uint32_t)p[1] << 8) | in ubifs_unpack_bits()
335 *addr = p; in ubifs_unpack_bits()
650 p = buf; in ubifs_create_dflt_lpt()
[all …]
A Drecovery.c59 uint8_t *p = buf; in is_empty() local
78 uint8_t *p = buf; in first_non_ff() local
413 uint8_t *p; in is_last_write() local
1269 while (*p) { in add_ino()
1270 parent = *p; in add_ino()
1273 p = &(*p)->rb_left; in add_ino()
1275 p = &(*p)->rb_right; in add_ino()
1303 while (p) { in find_ino()
1306 p = p->rb_left; in find_ino()
1308 p = p->rb_right; in find_ino()
[all …]
A Ddebug.c107 char *p = buffer; in dbg_snprintf_key() local
140 return p; in dbg_snprintf_key()
1880 while (*p) { in add_inode()
1881 parent = *p; in add_inode()
1884 p = &(*p)->rb_left; in add_inode()
1886 p = &(*p)->rb_right; in add_inode()
1955 struct rb_node *p; in search_inode() local
1958 p = fsckd->inodes.rb_node; in search_inode()
1959 while (p) { in search_inode()
1962 p = p->rb_left; in search_inode()
[all …]
A Dtnc.c84 struct rb_node **p, *parent = NULL; in insert_old_idx() local
92 p = &c->old_idx.rb_node; in insert_old_idx()
93 while (*p) { in insert_old_idx()
94 parent = *p; in insert_old_idx()
97 p = &(*p)->rb_left; in insert_old_idx()
99 p = &(*p)->rb_right; in insert_old_idx()
101 p = &(*p)->rb_left; in insert_old_idx()
103 p = &(*p)->rb_right; in insert_old_idx()
1122 path[p++] = n; in dirty_cow_bottom_up()
1137 zbr = &zp->zbranch[path[--p]]; in dirty_cow_bottom_up()
[all …]
A Dlpt_commit.c1641 void *buf, *p; in dbg_check_ltab_lnum() local
1659 if (!is_a_node(c, p, len)) { in dbg_check_ltab_lnum()
1662 pad_len = get_pad_len(c, p, len); in dbg_check_ltab_lnum()
1664 p += pad_len; in dbg_check_ltab_lnum()
1669 if (!dbg_is_all_ff(p, len)) { in dbg_check_ltab_lnum()
1692 p += node_len; in dbg_check_ltab_lnum()
1892 void *buf, *p; in dump_lpt_leb() local
1907 if (!is_a_node(c, p, len)) { in dump_lpt_leb()
1910 pad_len = get_pad_len(c, p, len); in dump_lpt_leb()
1914 p += pad_len; in dump_lpt_leb()
[all …]
A Dscan.c37 uint8_t *p = buf; in scan_padding_bytes() local
41 while (pad_len < max_pad_len && *p++ == UBIFS_PADDING_BYTE) in scan_padding_bytes()
/fs/jffs2/
A Dcompr_rubin.c52 register unsigned long p; in rubin_do_decompress() local
65 p = (long) (2 * UPPER_BIT_RUBIN); in rubin_do_decompress()
77 while ((q & UPPER_BIT_RUBIN) || ((p + q) <= UPPER_BIT_RUBIN)) { in rubin_do_decompress()
80 p <<= 1; in rubin_do_decompress()
85 u32 *p = (u32 *)in; in rubin_do_decompress() local
87 temp = *(++p); in rubin_do_decompress()
88 in = (unsigned char *)p; in rubin_do_decompress()
91 i0 = (bits[i] * p) >> 8; in rubin_do_decompress()
100 p = i0; in rubin_do_decompress()
103 p -= i0; in rubin_do_decompress()
A Dmergesort.c14 struct b_node *p, *q, *e, **tail; in sort_list() local
22 for (p = q = list->listHead; p; p = q) { in sort_list()
33 list->listCompare(p, q))) { in sort_list()
39 e = p; in sort_list()
40 p = p->next; in sort_list()
A Djffs2_1pass.c895 char s[64], *p; in dump_stat() local
902 if ((p = strchr(s,'\n')) != NULL) *p = '\0'; in dump_stat()
903 if ((p = strchr(s,'\r')) != NULL) *p = '\0'; in dump_stat()
1233 u8 *p = (u8 *)ptr; in sum_get_unaligned32() local
1235 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24); in sum_get_unaligned32()
1243 u8 *p = (u8 *)ptr; in sum_get_unaligned16() local
1245 val = *p | (*(p + 1) << 8); in sum_get_unaligned16()
/fs/btrfs/
A Dctree.c56 if (!p) in btrfs_free_path()
58 btrfs_release_path(p); in btrfs_free_path()
59 kfree(p); in btrfs_free_path()
66 if (!p->nodes[i]) in btrfs_release_path()
70 memset(p, 0, sizeof(*p)); in btrfs_release_path()
426 p->nodes[level] = b; in btrfs_search_slot()
514 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
528 btrfs_release_path(p); in btrfs_search_slot_for_read()
537 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
539 p->slots[0]--; in btrfs_search_slot_for_read()
[all …]
A Dcompat.h41 #define get_unaligned_le8(p) (*((u8 *)(p))) argument
42 #define get_unaligned_8(p) (*((u8 *)(p))) argument
43 #define put_unaligned_le8(val,p) ((*((u8 *)(p))) = (val)) argument
44 #define put_unaligned_8(val,p) ((*((u8 *)(p))) = (val)) argument
A Dctree.h1107 struct btrfs_balance_item *p; in btrfs_balance_item_data() local
1109 return &p->data; in btrfs_balance_item_data()
1116 struct btrfs_balance_item *p; in btrfs_balance_item_meta() local
1118 return &p->meta; in btrfs_balance_item_meta()
1125 struct btrfs_balance_item *p; in btrfs_balance_item_sys() local
1127 return &p->sys; in btrfs_balance_item_sys()
1206 ((t *) btrfs_path_leaf_data((p)))
1267 struct btrfs_path *p) in btrfs_next_item() argument
1269 ++p->slots[0]; in btrfs_next_item()
1270 if (p->slots[0] >= btrfs_header_nritems(p->nodes[0])) in btrfs_next_item()
[all …]
A Dextent-io.c177 u8 *p = (u8 *)eb->data + start + BIT_BYTE(pos); in extent_buffer_bitmap_set() local
183 *p |= mask_to_set; in extent_buffer_bitmap_set()
187 p++; in extent_buffer_bitmap_set()
191 *p |= mask_to_set; in extent_buffer_bitmap_set()
205 u8 *p = (u8 *)eb->data + start + BIT_BYTE(pos); in extent_buffer_bitmap_clear() local
211 *p &= ~mask_to_clear; in extent_buffer_bitmap_clear()
215 p++; in extent_buffer_bitmap_clear()
219 *p &= ~mask_to_clear; in extent_buffer_bitmap_clear()
/fs/btrfs/common/
A Drbtree-utils.c25 struct rb_node **p = &root->rb_node; in rb_insert() local
29 while(*p) { in rb_insert()
30 parent = *p; in rb_insert()
34 p = &(*p)->rb_left; in rb_insert()
36 p = &(*p)->rb_right; in rb_insert()
41 rb_link_node(node, parent, p); in rb_insert()
/fs/erofs/
A Dnamei.c235 const char *p = name; in link_path_walk() local
239 ++p; in link_path_walk()
240 } while (*p != '\0' && *p != '/'); in link_path_walk()
242 DBG_BUGON(p <= name); in link_path_walk()
243 ret = erofs_namei(nd, name, p - name); in link_path_walk()
247 name = p; in link_path_walk()
249 for (name = p; *name == '/'; ++name) in link_path_walk()
/fs/cramfs/
A Dcramfs.c151 char *p = strtok (NULL, "/"); in cramfs_resolve() local
153 if (raw && (p == NULL || *p == '\0')) in cramfs_resolve()
162 p); in cramfs_resolve()
168 if (p && strlen(p)) { in cramfs_resolve()
/fs/fat/
A Dfat_write.c1372 p = filename; in split_filename()
1375 while (*p) { in split_filename()
1376 if (ISDIRDELIM(*p)) { in split_filename()
1377 last_slash = p; in split_filename()
1378 last_slash_cont = p; in split_filename()
1382 if (!*p) in split_filename()
1385 p++; in split_filename()
1422 for (p = filename + strlen(filename) - 1; p >= filename; --p) { in split_filename()
1423 switch (*p) { in split_filename()
1426 *p = 0; in split_filename()
[all …]
/fs/
A Dfs_internal.c64 ALLOC_CACHE_ALIGN_BUFFER(u8, p, blk->blksz); in fs_devread()
68 (void *)p); in fs_devread()
69 memcpy(buf, p, byte_len); in fs_devread()

Completed in 50 milliseconds

12