| /fs/ocfs2/ |
| D | extent_map.c | 185 struct ocfs2_extent_map_item *ins) in ocfs2_try_to_merge_extent_map() argument
190 if (ins->ei_phys == (emi->ei_phys + emi->ei_clusters) && in ocfs2_try_to_merge_extent_map()
191 ins->ei_cpos == (emi->ei_cpos + emi->ei_clusters) && in ocfs2_try_to_merge_extent_map()
192 ins->ei_flags == emi->ei_flags) { in ocfs2_try_to_merge_extent_map()
193 emi->ei_clusters += ins->ei_clusters; in ocfs2_try_to_merge_extent_map()
195 } else if ((ins->ei_phys + ins->ei_clusters) == emi->ei_phys && in ocfs2_try_to_merge_extent_map()
196 (ins->ei_cpos + ins->ei_clusters) == emi->ei_cpos && in ocfs2_try_to_merge_extent_map()
197 ins->ei_flags == emi->ei_flags) { in ocfs2_try_to_merge_extent_map()
198 emi->ei_phys = ins->ei_phys; in ocfs2_try_to_merge_extent_map()
199 emi->ei_cpos = ins->ei_cpos; in ocfs2_try_to_merge_extent_map()
[all …]
|
| /fs/btrfs/ |
| D | ulist.c | 144 static int ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) in ulist_rbtree_insert() argument
154 if (cur->val < ins->val) in ulist_rbtree_insert()
156 else if (cur->val > ins->val) in ulist_rbtree_insert()
161 rb_link_node(&ins->rb_node, parent, p); in ulist_rbtree_insert()
162 rb_insert_color(&ins->rb_node, &ulist->root); in ulist_rbtree_insert()
|
| D | inode.c | 680 struct btrfs_key ins; in submit_compressed_extents() local
740 0, alloc_hint, &ins, 1, 1); in submit_compressed_extents()
783 em->block_start = ins.objectid; in submit_compressed_extents()
784 em->block_len = ins.offset; in submit_compressed_extents()
785 em->orig_block_len = ins.offset; in submit_compressed_extents()
811 ins.objectid, in submit_compressed_extents()
813 ins.offset, in submit_compressed_extents()
835 ins.objectid, in submit_compressed_extents()
836 ins.offset, async_extent->pages, in submit_compressed_extents()
853 alloc_hint = ins.objectid + ins.offset; in submit_compressed_extents()
[all …]
|
| D | extent-tree.c | 93 struct btrfs_key *ins, int ref_mod);
98 int level, struct btrfs_key *ins);
2165 struct btrfs_key ins; in run_delayed_data_ref() local
2170 ins.objectid = node->bytenr; in run_delayed_data_ref()
2171 ins.offset = node->num_bytes; in run_delayed_data_ref()
2172 ins.type = BTRFS_EXTENT_ITEM_KEY; in run_delayed_data_ref()
2187 &ins, node->ref_mod); in run_delayed_data_ref()
2323 struct btrfs_key ins; in run_delayed_tree_ref() local
2336 ins.objectid = node->bytenr; in run_delayed_tree_ref()
2338 ins.offset = ref->level; in run_delayed_tree_ref()
[all …]
|
| D | delayed-inode.c | 402 struct btrfs_delayed_item *ins, in __btrfs_add_delayed_item() argument
418 node = &ins->rb_node; in __btrfs_add_delayed_item()
425 cmp = btrfs_comp_cpu_keys(&item->key, &ins->key); in __btrfs_add_delayed_item()
436 ins->delayed_node = delayed_node; in __btrfs_add_delayed_item()
437 ins->ins_or_del = action; in __btrfs_add_delayed_item()
439 if (ins->key.type == BTRFS_DIR_INDEX_KEY && in __btrfs_add_delayed_item()
441 ins->key.offset >= delayed_node->index_cnt) in __btrfs_add_delayed_item()
442 delayed_node->index_cnt = ins->key.offset + 1; in __btrfs_add_delayed_item()
|
| D | delayed-ref.c | 95 struct btrfs_delayed_ref_head *ins; in htree_insert() local
98 ins = rb_entry(node, struct btrfs_delayed_ref_head, href_node); in htree_insert()
99 bytenr = ins->node.bytenr; in htree_insert()
|
| D | tree-log.c | 667 struct btrfs_key ins; in replay_one_extent() local
678 ins.objectid = btrfs_file_extent_disk_bytenr(eb, item); in replay_one_extent()
679 ins.offset = btrfs_file_extent_disk_num_bytes(eb, item); in replay_one_extent()
680 ins.type = BTRFS_EXTENT_ITEM_KEY; in replay_one_extent()
683 if (ins.objectid > 0) { in replay_one_extent()
691 ret = btrfs_lookup_data_extent(root, ins.objectid, in replay_one_extent()
692 ins.offset); in replay_one_extent()
695 ins.objectid, ins.offset, in replay_one_extent()
707 key->objectid, offset, &ins); in replay_one_extent()
714 csum_start = ins.objectid; in replay_one_extent()
[all …]
|
| D | ctree.h | 3459 struct btrfs_key *ins);
3463 struct btrfs_key *ins);
3466 struct btrfs_key *ins, int is_data, int delalloc);
|
| /fs/ntfs/ |
| D | unistr.c | 259 int ntfs_nlstoucs(const ntfs_volume *vol, const char *ins, in ntfs_nlstoucs() argument
268 if (likely(ins)) { in ntfs_nlstoucs()
272 wc_len = nls->char2uni(ins + i, ins_len - i, in ntfs_nlstoucs()
336 int ntfs_ucstonls(const ntfs_volume *vol, const ntfschar *ins, in ntfs_ucstonls() argument
344 if (ins) { in ntfs_ucstonls()
358 retry: wc = nls->uni2char(le16_to_cpu(ins[i]), ns + o, in ntfs_ucstonls()
|
| D | ntfs.h | 127 extern int ntfs_nlstoucs(const ntfs_volume *vol, const char *ins,
129 extern int ntfs_ucstonls(const ntfs_volume *vol, const ntfschar *ins,
|
| /fs/btrfs/tests/ |
| D | qgroup-tests.c | 43 struct btrfs_key ins; in insert_normal_tree_ref() local
49 ins.objectid = bytenr; in insert_normal_tree_ref()
50 ins.type = BTRFS_EXTENT_ITEM_KEY; in insert_normal_tree_ref()
51 ins.offset = num_bytes; in insert_normal_tree_ref()
60 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size); in insert_normal_tree_ref()
|