Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 38) sorted by relevance

12

/fs/exfat/
A Dnode.c35 return node; in exfat_get_node()
48 else if (node->references == 0 && node != ef->root) in exfat_put_node()
150 node->fptr_cluster = node->start_cluster; in init_node_meta2()
237 if (node->valid_size > node->size) in check_node()
276 if (node->size == 0 && node->is_contiguous) in check_node()
586 node->prev->next = node->next; in tree_detach()
588 node->parent->child = node->next; in tree_detach()
590 node->next->prev = node->prev; in tree_detach()
614 if (node != ef->root && node->is_dirty) in reset_cache()
666 if (node->size != 0 && node->is_contiguous) in exfat_flush_node()
[all …]
A Dcluster.c82 if (node->is_contiguous) in exfat_next_cluster()
99 node->fptr_index = 0; in exfat_advance_cluster()
100 node->fptr_cluster = node->start_cluster; in exfat_advance_cluster()
105 node->fptr_cluster = exfat_next_cluster(ef, node, node->fptr_cluster); in exfat_advance_cluster()
268 node->fptr_cluster = node->start_cluster = previous; in grow_file()
338 node->fptr_index = 0; in shrink_file()
339 node->fptr_cluster = node->start_cluster; in shrink_file()
413 if (node->references == 0 && node->parent) in exfat_truncate()
429 rc = erase_range(ef, node, node->valid_size, size); in exfat_truncate()
436 node->valid_size = MIN(node->valid_size, size); in exfat_truncate()
[all …]
A Dio.c486 if (offset >= node->size) in exfat_generic_pread()
503 MIN(size - bytes, node->size - node->valid_size)); in exfat_generic_pread()
548 if (offset > node->size) in exfat_generic_pwrite()
589 node->valid_size = MAX(node->valid_size, offset + size - remainder); in exfat_generic_pwrite()
876 struct exfat_node* node; in exfat_fs_exists() local
890 struct exfat_node* node; in exfat_fs_size() local
897 *size = node->size; in exfat_fs_size()
907 struct exfat_node* node; in exfat_fs_read() local
916 len = node->size; in exfat_fs_read()
935 struct exfat_node* node; in exfat_fs_unlink() local
[all …]
A Dlookup.c87 *node = NULL; in lookup_name()
96 while ((*node = exfat_readdir(&it))) in lookup_name()
98 if (compare_name(ef, buffer, (*node)->name) == 0) in lookup_name()
103 exfat_put_node(ef, *node); in lookup_name()
130 parent = *node = exfat_get_node(ef->root); in exfat_lookup()
135 rc = lookup_name(ef, parent, node, p, n); in exfat_lookup()
142 parent = *node; in exfat_lookup()
184 *parent = *node = exfat_get_node(ef->root); in exfat_split()
204 rc = lookup_name(ef, *parent, node, p, n); in exfat_split()
212 rc = lookup_name(ef, *parent, node, p, n); in exfat_split()
[all …]
A Dexfat.h185 int exfat_lookup(struct exfat* ef, struct exfat_node** node,
188 struct exfat_node** node, le16_t* name, const char* path);
192 const struct exfat_node* node, cluster_t cluster);
194 struct exfat_node* node, uint32_t count);
204 void exfat_get_name(const struct exfat_node* node,
226 struct exfat_node* exfat_get_node(struct exfat_node* node);
232 int exfat_unlink(struct exfat* ef, struct exfat_node* node);
233 int exfat_rmdir(struct exfat* ef, struct exfat_node* node);
238 void exfat_update_atime(struct exfat_node* node);
239 void exfat_update_mtime(struct exfat_node* node);
[all …]
A Dutils.c28 void exfat_stat(const struct exfat* ef, const struct exfat_node* node, in exfat_stat() argument
32 if (node->attrib & EXFAT_ATTRIB_DIR) in exfat_stat()
39 stbuf->st_size = node->size; in exfat_stat()
40 stbuf->st_blocks = ROUND_UP(node->size, CLUSTER_SIZE(*ef->sb)) / 512; in exfat_stat()
41 stbuf->st_mtime = node->mtime; in exfat_stat()
42 stbuf->st_atime = node->atime; in exfat_stat()
45 stbuf->st_ctime = node->mtime; in exfat_stat()
48 void exfat_get_name(const struct exfat_node* node, in exfat_get_name() argument
51 if (exfat_utf16_to_utf8(buffer, node->name, EXFAT_UTF8_NAME_BUFFER_MAX, in exfat_get_name()
A Drepair.c94 struct exfat_node* node) in exfat_fix_invalid_node_checksum() argument
97 node->is_dirty = true; in exfat_fix_invalid_node_checksum()
/fs/jffs2/
A Djffs2_private.h46 hdr_crc(struct jffs2_unknown_node *node) in hdr_crc() argument
56 if (node->hdr_crc != crc) { in hdr_crc()
64 dirent_crc(struct jffs2_raw_dirent *node) in dirent_crc() argument
66 …if (node->node_crc != crc32_no_comp(0, (unsigned char *)node, sizeof(struct jffs2_raw_dirent) - 8)… in dirent_crc()
74 dirent_name_crc(struct jffs2_raw_dirent *node) in dirent_name_crc() argument
76 if (node->name_crc != crc32_no_comp(0, (unsigned char *)&(node->name), node->nsize)) { in dirent_name_crc()
84 inode_crc(struct jffs2_raw_inode *node) in inode_crc() argument
86 …if (node->node_crc != crc32_no_comp(0, (unsigned char *)node, sizeof(struct jffs2_raw_inode) - 8))… in inode_crc()
94 data_crc(struct jffs2_raw_inode *node) in data_crc() argument
97 ((int) &node->node_crc + sizeof (node->node_crc)), in data_crc()
[all …]
A Djffs2_1pass.c250 if (NULL == get_fl_mem_nand(off, sizeof(node), &node)) in get_node_mem_nand()
254 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node), in get_node_mem_nand()
257 off, node.magic, node.nodetype, node.totlen); in get_node_mem_nand()
357 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node)) in get_node_mem_onenand()
361 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node), in get_node_mem_onenand()
365 off, node.magic, node.nodetype, node.totlen); in get_node_mem_onenand()
1698 node->u.nodetype, node->u.totlen, ofs); in jffs2_1pass_build_lists()
1752 node) || in jffs2_1pass_build_lists()
1756 node)) in jffs2_1pass_build_lists()
1777 node->u.totlen, in jffs2_1pass_build_lists()
[all …]
/fs/btrfs/
A Dextent-cache.c136 if (!node) in lookup_cache_extent()
154 if (!node) in lookup_cache_extent2()
171 if (!node) in search_cache_extent()
172 node = next; in search_cache_extent()
173 if (!node) in search_cache_extent()
192 if (!node) in search_cache_extent2()
194 if (!node) in search_cache_extent2()
205 if (!node) in first_cache_extent()
214 if (!node) in last_cache_extent()
223 if (!node) in prev_cache_extent()
[all …]
A Dextent-io.c230 struct cache_extent *node; in clear_extent_bits() local
247 if (!node) in clear_extent_bits()
324 struct cache_extent *node; in set_extent_bits() local
340 if (!node) { in set_extent_bits()
465 if (!node) in find_first_extent_bit()
476 node = next_cache_extent(node); in find_first_extent_bit()
477 if (!node) in find_first_extent_bit()
512 node = next_cache_extent(node); in test_range_bit()
513 if (!node) { in test_range_bit()
529 if (!node) { in set_state_private()
[all …]
A Ddisk-io.c583 root->node = NULL; in btrfs_setup_root()
610 root->node = read_tree_block(fs_info, in find_and_setup_root()
612 if (!extent_buffer_uptodate(root->node)) in find_and_setup_root()
620 if (root->node) in btrfs_free_fs_root()
621 free_extent_buffer(root->node); in btrfs_free_fs_root()
693 root->node = read_tree_block(fs_info, in btrfs_read_fs_root_no_cache()
695 if (!extent_buffer_uptodate(root->node)) { in btrfs_read_fs_root_no_cache()
731 struct rb_node *node; in btrfs_read_fs_root() local
745 if (node) in btrfs_read_fs_root()
851 if (!extent_buffer_uptodate(root->node)) { in btrfs_setup_all_roots()
[all …]
/fs/cbfs/
A Dcbfs.c100 node->next = NULL; in fill_node()
101 node->type = header->type; in fill_node()
103 node->data_length = header->len; in fill_node()
106 node->name_length = name_len; in fill_node()
109 node->decomp_size = 0; in fill_node()
123 node->decomp_size = in fill_node()
189 struct cbfs_cachenode *node; in file_cbfs_fill_cache() local
208 if (!node) in file_cbfs_fill_cache()
214 free(node); in file_cbfs_fill_cache()
219 *cache_tail = node; in file_cbfs_fill_cache()
[all …]
/fs/btrfs/common/
A Drbtree-utils.c22 int rb_insert(struct rb_root *root, struct rb_node *node, in rb_insert() argument
32 ret = comp(parent, node); in rb_insert()
41 rb_link_node(node, parent, p); in rb_insert()
42 rb_insert_color(node, root); in rb_insert()
77 struct rb_node *node; in rb_free_nodes() local
79 while ((node = rb_first(root))) { in rb_free_nodes()
80 rb_erase(node, root); in rb_free_nodes()
81 free_node(node); in rb_free_nodes()
A Drbtree-utils.h30 typedef int (*rb_compare_keys)(struct rb_node *node, void *key);
31 typedef void (*rb_free_node)(struct rb_node *node);
33 int rb_insert(struct rb_root *root, struct rb_node *node,
/fs/sandbox/
A Dsandboxfs.c87 struct os_dirent_node *head, *node; in sandbox_fs_ls() local
94 for (node = head; node; node = node->next) { in sandbox_fs_ls()
95 printf("%s %10lu %s\n", os_dirent_get_typename(node->type), in sandbox_fs_ls()
96 node->size, node->name); in sandbox_fs_ls()
/fs/ext4/
A Dext4fs.c60 void ext4fs_free_node(struct ext2fs_node *node, struct ext2fs_node *currroot) in ext4fs_free_node() argument
62 if ((node != &ext4fs_root->diropen) && (node != currroot)) in ext4fs_free_node()
63 free(node); in ext4fs_free_node()
71 int ext4fs_read_file(struct ext2fs_node *node, loff_t pos, in ext4fs_read_file() argument
78 int log2_fs_blocksize = LOG2_BLOCK_SIZE(node->data) - log2blksz; in ext4fs_read_file()
80 unsigned int filesize = le32_to_cpu(node->inode.size); in ext4fs_read_file()
110 blknr_and_status = read_allocated_block(&node->inode, i, &cache); in ext4fs_read_file()
A Dext4_journal.c246 struct revoke_blk_list *node = NULL; in ext4fs_push_revoke_blk() local
252 node = _get_node(); in ext4fs_push_revoke_blk()
253 if (!node) { in ext4fs_push_revoke_blk()
258 node->content = zalloc(fs->blksz); in ext4fs_push_revoke_blk()
259 if (node->content == NULL) in ext4fs_push_revoke_blk()
261 memcpy(node->content, buffer, fs->blksz); in ext4fs_push_revoke_blk()
264 revk_blk_list = node; in ext4fs_push_revoke_blk()
265 prev_node = node; in ext4fs_push_revoke_blk()
268 prev_node->next = node; in ext4fs_push_revoke_blk()
269 prev_node = node; in ext4fs_push_revoke_blk()
/fs/ubifs/
A Dreplay.c597 struct ubifs_ino_node *ino = snod->node; in replay_bud()
609 struct ubifs_data_node *dn = snod->node; in replay_bud()
622 struct ubifs_dent_node *dent = snod->node; in replay_bud()
636 struct ubifs_trun_node *trun = snod->node; in replay_bud()
684 ubifs_dump_node(c, snod->node); in replay_bud()
826 const struct ubifs_cs_node *node; in replay_log_leb() local
848 node = sleb->buf; in replay_log_leb()
863 if (le64_to_cpu(node->cmt_no) != c->cmt_no) { in replay_log_leb()
871 c->cs_sqnum = le64_to_cpu(node->ch.sqnum); in replay_log_leb()
912 const struct ubifs_ref_node *ref = snod->node; in replay_log_leb()
[all …]
A Dscan.c202 snod->node = buf; in ubifs_add_snod()
362 struct ubifs_scan_node *node; in ubifs_scan_destroy() local
367 node = list_entry(head->next, struct ubifs_scan_node, list); in ubifs_scan_destroy()
368 list_del(&node->list); in ubifs_scan_destroy()
369 kfree(node); in ubifs_scan_destroy()
A Ddebug.c324 dump_ch(node); in ubifs_dump_node()
2057 void *node; in check_leaf() local
2069 if (!node) in check_leaf()
2098 ch = node; in check_leaf()
2185 kfree(node); in check_leaf()
2190 ubifs_dump_node(c, node); in check_leaf()
2192 kfree(node); in check_leaf()
2430 ubifs_dump_node(c, sa->node); in dbg_check_data_nodes_order()
2431 ubifs_dump_node(c, sb->node); in dbg_check_data_nodes_order()
2518 ubifs_dump_node(c, sa->node); in dbg_check_nondata_nodes_order()
[all …]
A Dorphan.c565 ubifs_dump_node(c, snod->node); in do_kill_orphans()
569 orph = snod->node; in do_kill_orphans()
592 ubifs_dump_node(c, snod->node); in do_kill_orphans()
734 struct ubifs_ino_node *node; member
829 err = ubifs_tnc_read_node(c, zbr, ci->node); in dbg_orphan_check()
834 if (ci->node->nlink == 0) in dbg_orphan_check()
858 orph = snod->node; in dbg_read_orphans()
917 ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS); in dbg_check_orphans()
918 if (!ci.node) { in dbg_check_orphans()
945 kfree(ci.node); in dbg_check_orphans()
A Dtnc.c318 const void *node) in lnc_add() argument
354 void *node) in lnc_add_directly() argument
361 err = ubifs_validate_entry(c, node); in lnc_add_directly()
364 ubifs_dump_node(c, node); in lnc_add_directly()
368 zbr->leaf = node; in lnc_add_directly()
397 void *node) in tnc_read_node_nm() argument
406 memcpy(node, zbr->leaf, zbr->len); in tnc_read_node_nm()
427 err = lnc_add(c, zbr, node); in tnc_read_node_nm()
514 struct ubifs_dent_node *dent = node; in fallible_read_node()
1813 void *node, const struct qstr *nm) in do_lookup_nm() argument
[all …]
A Dtnc_misc.c452 void *node) in ubifs_tnc_read_node() argument
464 err = ubifs_read_node_wbuf(wbuf, node, type, zbr->len, in ubifs_tnc_read_node()
467 err = ubifs_read_node(c, node, type, zbr->len, zbr->lnum, in ubifs_tnc_read_node()
476 key_read(c, node + UBIFS_KEY_OFFSET, &key1); in ubifs_tnc_read_node()
482 ubifs_dump_node(c, node); in ubifs_tnc_read_node()
A Dlog.c596 void *node) in add_node() argument
598 struct ubifs_ch *ch = node; in add_node()
611 memcpy(buf + *offs, node, len); in add_node()
650 struct ubifs_ref_node *ref = snod->node; in ubifs_consolidate_log()
658 &offs, snod->node); in ubifs_consolidate_log()
668 snod->node); in ubifs_consolidate_log()

Completed in 46 milliseconds

12