Home
last modified time | relevance | path

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

/linux/drivers/net/ethernet/mellanox/mlx4/
H A 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/fs/btrfs/
H A Ddelayed-inode.c1152 struct btrfs_delayed_node *curr_node, *prev_node; in __btrfs_run_delayed_items() local
1171 curr_node = btrfs_first_delayed_node(delayed_root, &curr_delayed_node_tracker); in __btrfs_run_delayed_items()
1172 while (curr_node && (!count || nr--)) { in __btrfs_run_delayed_items()
1174 curr_node); in __btrfs_run_delayed_items()
1180 prev_node = curr_node; in __btrfs_run_delayed_items()
1182 curr_node = btrfs_next_delayed_node(curr_node, &curr_delayed_node_tracker); in __btrfs_run_delayed_items()
1202 if (curr_node) in __btrfs_run_delayed_items()
1203 btrfs_release_delayed_node(curr_node, &curr_delayed_node_tracker); in __btrfs_run_delayed_items()
2116 struct btrfs_delayed_node *curr_node, *prev_node; in btrfs_destroy_delayed_inodes() local
2119 curr_node = btrfs_first_delayed_node(fs_info->delayed_root, in btrfs_destroy_delayed_inodes()
[all …]
/linux/drivers/net/ethernet/huawei/hinic/
H A 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()
H A Dhinic_hw_api_cmd.h192 struct hinic_api_cmd_cell *curr_node; member
/linux/drivers/net/ethernet/mellanox/mlx5/core/
H A Dfs_core.c1033 struct fs_node *curr_node; in find_closest_ft() local
1039 curr_node = node; in find_closest_ft()
1042 ft = find_closest_ft_recursive(parent, &curr_node->list, in find_closest_ft()
1044 curr_node = parent; in find_closest_ft()
1045 parent = curr_node->parent; in find_closest_ft()