| /fs/ceph/ |
| A D | snap.c | 1196 exist = NULL; in ceph_get_snapid_map()
1210 exist = NULL; in ceph_get_snapid_map()
1213 if (exist) { in ceph_get_snapid_map()
1215 exist->dev); in ceph_get_snapid_map()
1216 return exist; in ceph_get_snapid_map()
1233 exist = NULL; in ceph_get_snapid_map()
1246 exist = NULL; in ceph_get_snapid_map()
1248 if (exist) { in ceph_get_snapid_map()
1256 if (exist) { in ceph_get_snapid_map()
1260 exist->dev); in ceph_get_snapid_map()
[all …]
|
| /fs/btrfs/ |
| A D | ref-verify.c | 267 if (exist) { in add_block_entry()
278 return exist; in add_block_entry()
299 struct ref_entry *ref = NULL, *exist; in add_tree_block() local
330 if (exist) { in add_tree_block()
331 exist->num_refs++; in add_tree_block()
808 if (exist) { in btrfs_ref_tree_mod()
810 if (exist->num_refs == 0) { in btrfs_ref_tree_mod()
819 exist->num_refs--; in btrfs_ref_tree_mod()
820 if (exist->num_refs == 0) { in btrfs_ref_tree_mod()
822 kfree(exist); in btrfs_ref_tree_mod()
[all …]
|
| A D | delayed-ref.c | 587 struct btrfs_delayed_ref_node *exist; in insert_delayed_ref() local
592 if (!exist) { in insert_delayed_ref()
601 if (exist->action == ref->action) { in insert_delayed_ref()
605 if (exist->ref_mod < ref->ref_mod) { in insert_delayed_ref()
606 exist->action = ref->action; in insert_delayed_ref()
607 mod = -exist->ref_mod; in insert_delayed_ref()
608 exist->ref_mod = ref->ref_mod; in insert_delayed_ref()
610 list_add_tail(&exist->add_list, in insert_delayed_ref()
614 list_del_init(&exist->add_list); in insert_delayed_ref()
621 exist->ref_mod += mod; in insert_delayed_ref()
[all …]
|
| A D | backref.c | 254 const struct rb_node *exist) in prelim_ref_rb_add_cmp() argument
296 struct rb_node *exist; in prelim_ref_insert() local
300 if (exist) { in prelim_ref_insert()
3445 struct btrfs_backref_node *exist; in btrfs_backref_add_tree_node() local
3475 exist = edge->node[UPPER]; in btrfs_backref_add_tree_node()
3480 if (!exist->checked) in btrfs_backref_add_tree_node()
3483 exist = NULL; in btrfs_backref_add_tree_node()
3518 if (exist && in btrfs_backref_add_tree_node()
3520 exist->owner == key.offset) || in btrfs_backref_add_tree_node()
3523 exist = NULL; in btrfs_backref_add_tree_node()
[all …]
|
| A D | delayed-inode.c | 371 const struct rb_node *exist) in btrfs_delayed_item_cmp() argument
376 return delayed_item_index_cmp(&new_item->index, exist); in btrfs_delayed_item_cmp()
383 struct rb_node *exist; in __btrfs_add_delayed_item() local
390 exist = rb_find_add_cached(&ins->rb_node, root, btrfs_delayed_item_cmp); in __btrfs_add_delayed_item()
391 if (exist) in __btrfs_add_delayed_item()
|
| A D | block-group.c | 190 const struct rb_node *exist) in btrfs_bg_start_cmp() argument
195 rb_entry(exist, struct btrfs_block_group, cache_node); in btrfs_bg_start_cmp()
210 struct rb_node *exist; in btrfs_add_block_group_cache() local
217 exist = rb_find_add_cached(&block_group->cache_node, in btrfs_add_block_group_cache()
219 if (exist) in btrfs_add_block_group_cache()
|
| A D | free-space-cache.c | 1691 const struct btrfs_free_space *entry, *exist; in entry_less() local
1694 exist = rb_entry(parent, struct btrfs_free_space, bytes_index); in entry_less()
1695 return get_max_extent_size(exist) < get_max_extent_size(entry); in entry_less()
|
| A D | volumes.c | 5469 const struct rb_node *exist) in btrfs_chunk_map_cmp() argument
5474 rb_entry(exist, struct btrfs_chunk_map, rb_node); in btrfs_chunk_map_cmp()
5486 struct rb_node *exist; in btrfs_add_chunk_map() local
5489 exist = rb_find_add_cached(&map->rb_node, &fs_info->mapping_tree, in btrfs_add_chunk_map()
5492 if (exist) { in btrfs_add_chunk_map()
|
| A D | extent-tree.c | 4193 int exist = 0; in find_free_extent_update_loop() local
4202 exist = 1; in find_free_extent_update_loop()
4223 if (!exist) in find_free_extent_update_loop()
|
| /fs/f2fs/ |
| A D | checkpoint.c | 142 bool exist; in __is_bitmap_valid() local
151 exist = f2fs_test_bit(offset, se->cur_valid_map); in __is_bitmap_valid()
155 return exist; in __is_bitmap_valid()
157 if ((exist && type == DATA_GENERIC_ENHANCE_UPDATE) || in __is_bitmap_valid()
158 (!exist && type == DATA_GENERIC_ENHANCE)) in __is_bitmap_valid()
160 if (!exist && type != DATA_GENERIC_ENHANCE_UPDATE) in __is_bitmap_valid()
162 return exist; in __is_bitmap_valid()
166 blkaddr, exist); in __is_bitmap_valid()
171 return exist; in __is_bitmap_valid()
|
| A D | segment.c | 2453 bool exist; in update_sit_entry_for_release() local
2463 exist = f2fs_test_and_clear_bit(offset + i, se->cur_valid_map); in update_sit_entry_for_release()
2467 if (unlikely(exist != mir_exist)) { in update_sit_entry_for_release()
2469 blkaddr + i, exist); in update_sit_entry_for_release()
2473 if (unlikely(!exist)) { in update_sit_entry_for_release()
2512 bool exist; in update_sit_entry_for_alloc() local
2517 exist = f2fs_test_and_set_bit(offset, se->cur_valid_map); in update_sit_entry_for_alloc()
2521 if (unlikely(exist != mir_exist)) { in update_sit_entry_for_alloc()
2523 blkaddr, exist); in update_sit_entry_for_alloc()
2527 if (unlikely(exist)) { in update_sit_entry_for_alloc()
|
| /fs/notify/dnotify/ |
| A D | Kconfig | 8 that uses signals to communicate events to user-space. There exist
|
| /fs/configfs/ |
| A D | Kconfig | 10 Both sysfs and configfs can and should exist together on the
|
| /fs/smb/client/ |
| A D | file.c | 1606 bool exist; in cifs_lock_test() local
1610 exist = cifs_find_lock_conflict(cfile, offset, length, type, in cifs_lock_test()
1613 if (exist) { in cifs_lock_test()
1651 bool exist; in cifs_lock_add_if() local
1655 exist = false; in cifs_lock_add_if()
1658 exist = cifs_find_lock_conflict(cfile, lock->offset, lock->length, in cifs_lock_add_if()
1661 if (!exist && cinode->can_cache_brlcks) { in cifs_lock_add_if()
1667 if (!exist) in cifs_lock_add_if()
|
| /fs/proc/ |
| A D | Kconfig | 107 Various /proc files exist to monitor process memory utilization:
|
| /fs/cramfs/ |
| A D | README | 34 exist, speeds up user-space directory sorts, etc.
|