Home
last modified time | relevance | path

Searched refs:curr_node (Results 1 – 7 of 7) sorted by relevance

/Linux-v6.1/fs/ext4/
Ddir.c568 info->curr_node = NULL; in ext4_dx_readdir()
583 } else if (!info->curr_node) in ext4_dx_readdir()
584 info->curr_node = rb_first(&info->root); in ext4_dx_readdir()
592 if ((!info->curr_node) || in ext4_dx_readdir()
594 info->curr_node = NULL; in ext4_dx_readdir()
606 info->curr_node = rb_first(&info->root); in ext4_dx_readdir()
609 fname = rb_entry(info->curr_node, struct fname, rb_hash); in ext4_dx_readdir()
615 info->curr_node = rb_next(info->curr_node); in ext4_dx_readdir()
616 if (info->curr_node) { in ext4_dx_readdir()
617 fname = rb_entry(info->curr_node, struct fname, in ext4_dx_readdir()
Dext4.h2534 struct rb_node *curr_node; member
/Linux-v6.1/drivers/net/ethernet/mellanox/mlx4/
Dalloc.c342 struct mlx4_zone_entry *curr_node; in __mlx4_alloc_from_zone() local
353 list_for_each_entry(curr_node, &zone_alloc->prios, prio_list) { in __mlx4_alloc_from_zone()
354 if (unlikely(curr_node->priority == zone->priority)) in __mlx4_alloc_from_zone()
359 struct mlx4_zone_entry *it = curr_node; in __mlx4_alloc_from_zone()
373 struct mlx4_zone_entry *it = curr_node; in __mlx4_alloc_from_zone()
379 if (unlikely(it->priority != curr_node->priority)) in __mlx4_alloc_from_zone()
393 if (list_is_last(&curr_node->prio_list, &zone_alloc->prios)) in __mlx4_alloc_from_zone()
396 curr_node = list_first_entry(&curr_node->prio_list, in __mlx4_alloc_from_zone()
397 typeof(*curr_node), in __mlx4_alloc_from_zone()
400 list_for_each_entry_from(curr_node, &zone_alloc->entries, list) { in __mlx4_alloc_from_zone()
[all …]
/Linux-v6.1/fs/btrfs/
Ddelayed-inode.c1128 struct btrfs_delayed_node *curr_node, *prev_node; in __btrfs_run_delayed_items() local
1146 curr_node = btrfs_first_delayed_node(delayed_root); in __btrfs_run_delayed_items()
1147 while (curr_node && (!count || nr--)) { in __btrfs_run_delayed_items()
1149 curr_node); in __btrfs_run_delayed_items()
1151 btrfs_release_delayed_node(curr_node); in __btrfs_run_delayed_items()
1152 curr_node = NULL; in __btrfs_run_delayed_items()
1157 prev_node = curr_node; in __btrfs_run_delayed_items()
1158 curr_node = btrfs_next_delayed_node(curr_node); in __btrfs_run_delayed_items()
1162 if (curr_node) in __btrfs_run_delayed_items()
1163 btrfs_release_delayed_node(curr_node); in __btrfs_run_delayed_items()
[all …]
/Linux-v6.1/drivers/net/ethernet/huawei/hinic/
Dhinic_hw_api_cmd.c226 struct hinic_api_cmd_cell *cell = chain->curr_node; in prepare_api_cmd()
270 struct hinic_api_cmd_cell *curr_node = chain->curr_node; in prepare_cell() local
273 prepare_cell_ctrl(&curr_node->ctrl, data_size); in prepare_cell()
401 chain->curr_node = ctxt->cell_vaddr; in api_cmd()
797 chain->curr_node = chain->head_node; in api_cmd_create_cells()
Dhinic_hw_api_cmd.h192 struct hinic_api_cmd_cell *curr_node; member
/Linux-v6.1/drivers/net/ethernet/mellanox/mlx5/core/
Dfs_core.c886 struct fs_node *curr_node; in find_closest_ft() local
890 curr_node = &prio->node; in find_closest_ft()
892 ft = find_closest_ft_recursive(parent, &curr_node->list, reverse); in find_closest_ft()
893 curr_node = parent; in find_closest_ft()
894 parent = curr_node->parent; in find_closest_ft()