Searched refs:curr_node (Results 1 – 7 of 7) sorted by relevance
| /linux/fs/ext4/ |
| A D | dir.c | 570 info->curr_node = NULL; in ext4_dx_readdir() 585 } else if (!info->curr_node) in ext4_dx_readdir() 586 info->curr_node = rb_first(&info->root); in ext4_dx_readdir() 594 if ((!info->curr_node) || in ext4_dx_readdir() 596 info->curr_node = NULL; in ext4_dx_readdir() 608 info->curr_node = rb_first(&info->root); in ext4_dx_readdir() 611 fname = rb_entry(info->curr_node, struct fname, rb_hash); in ext4_dx_readdir() 617 info->curr_node = rb_next(info->curr_node); in ext4_dx_readdir() 618 if (info->curr_node) { in ext4_dx_readdir() 619 fname = rb_entry(info->curr_node, struct fname, in ext4_dx_readdir()
|
| A D | ext4.h | 2551 struct rb_node *curr_node; member
|
| /linux/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/fs/btrfs/ |
| A D | delayed-inode.c | 1151 struct btrfs_delayed_node *curr_node, *prev_node; in __btrfs_run_delayed_items() local 1170 while (curr_node && (!count || nr--)) { in __btrfs_run_delayed_items() 1172 curr_node); in __btrfs_run_delayed_items() 1178 prev_node = curr_node; in __btrfs_run_delayed_items() 1179 curr_node = btrfs_next_delayed_node(curr_node); in __btrfs_run_delayed_items() 1199 if (curr_node) in __btrfs_run_delayed_items() 1200 btrfs_release_delayed_node(curr_node); in __btrfs_run_delayed_items() 2093 while (curr_node) { in btrfs_destroy_delayed_inodes() 2094 __btrfs_kill_delayed_node(curr_node); in btrfs_destroy_delayed_inodes() 2096 prev_node = curr_node; in btrfs_destroy_delayed_inodes() [all …]
|
| /linux/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/drivers/net/ethernet/mellanox/mlx5/core/ |
| A D | fs_core.c | 1020 struct fs_node *curr_node; in find_closest_ft() local 1026 curr_node = node; in find_closest_ft() 1029 ft = find_closest_ft_recursive(parent, &curr_node->list, in find_closest_ft() 1031 curr_node = parent; in find_closest_ft() 1032 parent = curr_node->parent; in find_closest_ft()
|
Completed in 35 milliseconds