| /fs/ocfs2/ |
| D | extent_map.c | 173 struct ocfs2_extent_map_item *ins) in ocfs2_try_to_merge_extent_map() argument
178 if (ins->ei_phys == (emi->ei_phys + emi->ei_clusters) && in ocfs2_try_to_merge_extent_map()
179 ins->ei_cpos == (emi->ei_cpos + emi->ei_clusters) && in ocfs2_try_to_merge_extent_map()
180 ins->ei_flags == emi->ei_flags) { in ocfs2_try_to_merge_extent_map()
181 emi->ei_clusters += ins->ei_clusters; in ocfs2_try_to_merge_extent_map()
183 } else if ((ins->ei_phys + ins->ei_clusters) == emi->ei_phys && in ocfs2_try_to_merge_extent_map()
184 (ins->ei_cpos + ins->ei_clusters) == emi->ei_cpos && in ocfs2_try_to_merge_extent_map()
185 ins->ei_flags == emi->ei_flags) { in ocfs2_try_to_merge_extent_map()
186 emi->ei_phys = ins->ei_phys; in ocfs2_try_to_merge_extent_map()
187 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 | extent-tree.c | 52 struct btrfs_key *ins, int ref_mod);
1486 struct btrfs_key ins; in run_delayed_data_ref() local
1491 ins.objectid = node->bytenr; in run_delayed_data_ref()
1492 ins.offset = node->num_bytes; in run_delayed_data_ref()
1493 ins.type = BTRFS_EXTENT_ITEM_KEY; in run_delayed_data_ref()
1507 ref->offset, &ins, in run_delayed_data_ref()
3764 struct btrfs_key *ins) in found_extent_clustered() argument
3770 last_ptr->window_start = ins->objectid; in found_extent_clustered()
3776 struct btrfs_key *ins) in found_extent() argument
3780 found_extent_clustered(ffe_ctl, ins); in found_extent()
[all …]
|
| D | inode.c | 772 struct btrfs_key ins; in submit_compressed_extents() local
823 0, alloc_hint, &ins, 1, 1); in submit_compressed_extents()
854 ins.objectid, /* block_start */ in submit_compressed_extents()
855 ins.offset, /* block_len */ in submit_compressed_extents()
856 ins.offset, /* orig_block_len */ in submit_compressed_extents()
867 ins.objectid, in submit_compressed_extents()
869 ins.offset, in submit_compressed_extents()
878 btrfs_dec_block_group_reservations(fs_info, ins.objectid); in submit_compressed_extents()
891 ins.objectid, in submit_compressed_extents()
892 ins.offset, async_extent->pages, in submit_compressed_extents()
[all …]
|
| D | delayed-ref.c | 283 struct btrfs_delayed_ref_head *ins; in htree_insert() local
287 ins = rb_entry(node, struct btrfs_delayed_ref_head, href_node); in htree_insert()
288 bytenr = ins->bytenr; in htree_insert()
310 struct btrfs_delayed_ref_node *ins) in tree_insert() argument
313 struct rb_node *node = &ins->ref_node; in tree_insert()
324 comp = comp_refs(ins, entry, true); in tree_insert()
|
| D | delayed-inode.c | 401 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()
438 ins->delayed_node = delayed_node; in __btrfs_add_delayed_item()
439 ins->ins_or_del = action; in __btrfs_add_delayed_item()
441 if (ins->key.type == BTRFS_DIR_INDEX_KEY && in __btrfs_add_delayed_item()
443 ins->key.offset >= delayed_node->index_cnt) in __btrfs_add_delayed_item()
444 delayed_node->index_cnt = ins->key.offset + 1; in __btrfs_add_delayed_item()
|
| D | tree-log.c | 664 struct btrfs_key ins; in replay_one_extent() local
679 ins.objectid = btrfs_file_extent_disk_bytenr(eb, item); in replay_one_extent()
680 ins.offset = btrfs_file_extent_disk_num_bytes(eb, item); in replay_one_extent()
681 ins.type = BTRFS_EXTENT_ITEM_KEY; in replay_one_extent()
699 if (ins.objectid > 0) { in replay_one_extent()
709 ret = btrfs_lookup_data_extent(fs_info, ins.objectid, in replay_one_extent()
710 ins.offset); in replay_one_extent()
716 ins.objectid, ins.offset, 0); in replay_one_extent()
730 key->objectid, offset, &ins); in replay_one_extent()
737 csum_start = ins.objectid; in replay_one_extent()
[all …]
|
| D | ctree.h | 2582 struct btrfs_key *ins);
2585 struct btrfs_key *ins);
2588 struct btrfs_key *ins, int is_data, int delalloc);
|
| /fs/ntfs/ |
| D | unistr.c | 245 int ntfs_nlstoucs(const ntfs_volume *vol, const char *ins, in ntfs_nlstoucs() argument
254 if (likely(ins)) { in ntfs_nlstoucs()
258 wc_len = nls->char2uni(ins + i, ins_len - i, in ntfs_nlstoucs()
322 int ntfs_ucstonls(const ntfs_volume *vol, const ntfschar *ins, in ntfs_ucstonls() argument
330 if (ins) { in ntfs_ucstonls()
344 retry: wc = nls->uni2char(le16_to_cpu(ins[i]), ns + o, in ntfs_ucstonls()
|
| D | ntfs.h | 113 extern int ntfs_nlstoucs(const ntfs_volume *vol, const char *ins,
115 extern int ntfs_ucstonls(const ntfs_volume *vol, const ntfschar *ins,
|
| /fs/btrfs/tests/ |
| D | qgroup-tests.c | 23 struct btrfs_key ins; in insert_normal_tree_ref() local
29 ins.objectid = bytenr; in insert_normal_tree_ref()
30 ins.type = BTRFS_EXTENT_ITEM_KEY; in insert_normal_tree_ref()
31 ins.offset = num_bytes; in insert_normal_tree_ref()
40 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size); in insert_normal_tree_ref()
|