Searched refs:curr_node (Results 1 – 7 of 7) sorted by relevance
/linux-6.3-rc2/fs/ext4/ |
A D | dir.c | 568 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()
|
A D | ext4.h | 2535 struct rb_node *curr_node; member
|
/linux-6.3-rc2/drivers/net/ethernet/mellanox/mlx4/ |
A D | alloc.c | 342 struct mlx4_zone_entry *curr_node; in __mlx4_alloc_from_zone() local 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() 401 res = mlx4_bitmap_alloc_range(curr_node->bitmap, count, in __mlx4_alloc_from_zone() 404 res += curr_node->offset; in __mlx4_alloc_from_zone() [all …]
|
/linux-6.3-rc2/fs/btrfs/ |
A D | delayed-inode.c | 1152 while (curr_node && (!count || nr--)) { in __btrfs_run_delayed_items() 1154 curr_node); in __btrfs_run_delayed_items() 1157 curr_node = NULL; in __btrfs_run_delayed_items() 1162 prev_node = curr_node; in __btrfs_run_delayed_items() 1163 curr_node = btrfs_next_delayed_node(curr_node); in __btrfs_run_delayed_items() 1167 if (curr_node) in __btrfs_run_delayed_items() 1168 btrfs_release_delayed_node(curr_node); in __btrfs_run_delayed_items() 2046 while (curr_node) { in btrfs_destroy_delayed_inodes() 2047 __btrfs_kill_delayed_node(curr_node); in btrfs_destroy_delayed_inodes() 2049 prev_node = curr_node; in btrfs_destroy_delayed_inodes() [all …]
|
/linux-6.3-rc2/drivers/net/ethernet/huawei/hinic/ |
A D | hinic_hw_api_cmd.c | 226 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()
|
A D | hinic_hw_api_cmd.h | 192 struct hinic_api_cmd_cell *curr_node; member
|
/linux-6.3-rc2/drivers/net/ethernet/mellanox/mlx5/core/ |
A D | fs_core.c | 915 struct fs_node *curr_node; in find_closest_ft() local 919 curr_node = &prio->node; in find_closest_ft() 921 ft = find_closest_ft_recursive(parent, &curr_node->list, reverse); in find_closest_ft() 922 curr_node = parent; in find_closest_ft() 923 parent = curr_node->parent; in find_closest_ft()
|
Completed in 43 milliseconds