| /fs/ext4/ |
| A D | block_validity.c | 73 struct ext4_system_zone *new_entry, *entry; in add_system_zone() local
90 if (!new_entry) in add_system_zone()
92 new_entry->start_blk = start_blk; in add_system_zone()
93 new_entry->count = count; in add_system_zone()
94 new_entry->ino = ino; in add_system_zone()
95 new_node = &new_entry->node; in add_system_zone()
104 if (can_merge(entry, new_entry)) { in add_system_zone()
105 new_entry->start_blk = entry->start_blk; in add_system_zone()
106 new_entry->count += entry->count; in add_system_zone()
116 if (can_merge(new_entry, entry)) { in add_system_zone()
[all …]
|
| A D | mballoc.c | 6412 struct ext4_free_data *new_entry) in ext4_mb_free_metadata() argument
6416 ext4_grpblk_t clusters = new_entry->efd_count; in ext4_mb_free_metadata()
6429 new_node = &new_entry->efd_node; in ext4_mb_free_metadata()
6430 cluster = new_entry->efd_start_cluster; in ext4_mb_free_metadata()
6465 entry->efd_count += new_entry->efd_count; in ext4_mb_free_metadata()
6471 entry->efd_count += new_entry->efd_count; in ext4_mb_free_metadata()
6481 list_add_tail(&new_entry->efd_list, &sbi->s_freed_data_list[new_entry->efd_tid & 1]); in ext4_mb_free_metadata()
6594 struct ext4_free_data *new_entry; in ext4_mb_clear_bb() local
6601 new_entry->efd_start_cluster = bit; in ext4_mb_clear_bb()
6602 new_entry->efd_group = block_group; in ext4_mb_clear_bb()
[all …]
|
| /fs/btrfs/ |
| A D | lru_cache.c | 107 struct btrfs_lru_cache_entry *new_entry, in btrfs_lru_cache_store() argument
110 const u64 key = new_entry->key; in btrfs_lru_cache_store()
121 list_add_tail(&new_entry->list, head); in btrfs_lru_cache_store()
126 if (match_entry(head, key, new_entry->gen) != NULL) in btrfs_lru_cache_store()
128 list_add_tail(&new_entry->list, head); in btrfs_lru_cache_store()
143 list_add_tail(&new_entry->lru_list, &cache->lru_list); in btrfs_lru_cache_store()
|
| A D | misc.h | 126 struct rb_simple_node *new_entry = rb_entry(new, struct rb_simple_node, rb_node); in rb_simple_node_bytenr_cmp() local
129 if (new_entry->bytenr < existing_entry->bytenr) in rb_simple_node_bytenr_cmp()
131 else if (new_entry->bytenr > existing_entry->bytenr) in rb_simple_node_bytenr_cmp()
|
| A D | ref-verify.c | 93 const struct block_entry *new_entry = rb_entry(new, struct block_entry, node); in block_entry_bytenr_cmp() local
95 return block_entry_bytenr_key_cmp(&new_entry->bytenr, existing); in block_entry_bytenr_cmp()
130 const struct root_entry *new_entry = rb_entry(new, struct root_entry, node); in root_entry_root_objectid_cmp() local
132 return root_entry_root_objectid_key_cmp(&new_entry->root_objectid, existing); in root_entry_root_objectid_cmp()
167 struct ref_entry *new_entry = rb_entry(new, struct ref_entry, node); in ref_entry_cmp() local
170 return comp_refs(new_entry, existing_entry); in ref_entry_cmp()
|
| A D | lru_cache.h | 65 struct btrfs_lru_cache_entry *new_entry,
|
| A D | send.c | 1432 struct backref_cache_entry *new_entry; in store_backref_cache() local
1442 new_entry = kmalloc(sizeof(struct backref_cache_entry), GFP_NOFS); in store_backref_cache()
1444 if (!new_entry) in store_backref_cache()
1447 new_entry->entry.key = leaf_bytenr >> fs_info->sectorsize_bits; in store_backref_cache()
1448 new_entry->entry.gen = 0; in store_backref_cache()
1449 new_entry->num_roots = 0; in store_backref_cache()
1462 if (new_entry->num_roots >= SEND_MAX_BACKREF_CACHE_ROOTS) { in store_backref_cache()
1463 kfree(new_entry); in store_backref_cache()
1467 new_entry->root_ids[new_entry->num_roots] = root_id; in store_backref_cache()
1468 new_entry->num_roots++; in store_backref_cache()
[all …]
|
| A D | free-space-cache.c | 1591 struct btrfs_free_space *new_entry) in tree_insert_offset() argument
1614 if (new_entry->offset < info->offset) { in tree_insert_offset()
1616 } else if (new_entry->offset > info->offset) { in tree_insert_offset()
1632 if (new_entry->bitmap) { in tree_insert_offset()
1648 rb_link_node(&new_entry->offset_index, parent, p); in tree_insert_offset()
1649 rb_insert_color(&new_entry->offset_index, root); in tree_insert_offset()
|
| /fs/bcachefs/ |
| A D | replicas.c | 220 struct bch_replicas_entry_v1 *new_entry) in cpu_replicas_add_entry() argument
225 replicas_entry_bytes(new_entry)), in cpu_replicas_add_entry()
238 new_entry, in cpu_replicas_add_entry()
239 replicas_entry_bytes(new_entry)); in cpu_replicas_add_entry()
298 struct bch_replicas_entry_v1 *new_entry) in bch2_mark_replicas_slowpath() argument
303 verify_replicas_entry(new_entry); in bch2_mark_replicas_slowpath()
311 !__replicas_has_entry(&c->replicas_gc, new_entry)) { in bch2_mark_replicas_slowpath()
312 new_gc = cpu_replicas_add_entry(c, &c->replicas_gc, new_entry); in bch2_mark_replicas_slowpath()
319 if (!__replicas_has_entry(&c->replicas, new_entry)) { in bch2_mark_replicas_slowpath()
320 new_r = cpu_replicas_add_entry(c, &c->replicas, new_entry); in bch2_mark_replicas_slowpath()
|
| A D | fsck.c | 952 struct inode_walker_entry new_entry = *i; in lookup_inode_for_snapshot() local
954 new_entry.inode.bi_snapshot = k.k->p.snapshot; in lookup_inode_for_snapshot()
955 new_entry.count = 0; in lookup_inode_for_snapshot()
956 new_entry.i_size = 0; in lookup_inode_for_snapshot()
962 ret = darray_insert_item(&w->inodes, pos, new_entry); in lookup_inode_for_snapshot()
|
| /fs/smb/client/ |
| A D | readdir.c | 462 char *new_entry; in nxt_dir_entry() local
469 new_entry = old_entry + sizeof(FIND_FILE_STANDARD_INFO) + 1 + in nxt_dir_entry()
478 new_entry = old_entry + next_offset; in nxt_dir_entry()
480 cifs_dbg(FYI, "new entry %p old entry %p\n", new_entry, old_entry); in nxt_dir_entry()
482 if (new_entry >= end_of_smb) { in nxt_dir_entry()
484 new_entry, end_of_smb, old_entry); in nxt_dir_entry()
487 (new_entry + sizeof(FIND_FILE_STANDARD_INFO) + 1 > end_of_smb)) in nxt_dir_entry()
489 (new_entry + sizeof(FILE_DIRECTORY_INFO) + 1 > end_of_smb))) { in nxt_dir_entry()
491 new_entry, end_of_smb); in nxt_dir_entry()
494 return new_entry; in nxt_dir_entry()
|
| /fs/f2fs/ |
| A D | namei.c | 915 struct f2fs_dir_entry *new_entry; in f2fs_rename() local
994 new_entry = f2fs_find_entry(new_dir, &new_dentry->d_name, in f2fs_rename()
996 if (!new_entry) { in f2fs_rename()
1010 f2fs_set_link(new_dir, new_entry, new_folio, old_inode); in f2fs_rename()
1108 struct f2fs_dir_entry *old_entry, *new_entry; in f2fs_cross_rename() local
1141 new_entry = f2fs_find_entry(new_dir, &new_dentry->d_name, &new_folio); in f2fs_cross_rename()
1142 if (!new_entry) { in f2fs_cross_rename()
1218 f2fs_set_link(new_dir, new_entry, new_folio, old_inode); in f2fs_cross_rename()
|
| /fs/ |
| A D | dax.c | 1047 void *new_entry = dax_make_entry(pfn, flags); in dax_insert_entry() local
1071 dax_associate_entry(new_entry, mapping, vmf->vma, in dax_insert_entry()
1082 old = dax_lock_entry(xas, new_entry); in dax_insert_entry()
1085 entry = new_entry; in dax_insert_entry()
|