Searched refs:first_item (Results 1 – 3 of 3) sorted by relevance
169 int first_item = 0, max_choice; in dialog_menu() local234 first_item = scroll; in dialog_menu()241 scroll = first_item = item_count() - max_choice; in dialog_menu()243 scroll = first_item = choice - max_choice / 2; in dialog_menu()249 print_item(first_item + i, i, i == choice); in dialog_menu()
656 struct btrfs_delayed_item *first_item) in btrfs_insert_delayed_item() argument659 struct btrfs_delayed_node *node = first_item->delayed_node; in btrfs_insert_delayed_item()666 const u32 first_data_size = first_item->data_len; in btrfs_insert_delayed_item()692 ASSERT(first_item->bytes_reserved == 0); in btrfs_insert_delayed_item()694 list_add_tail(&first_item->tree_list, &item_list); in btrfs_insert_delayed_item()698 curr = first_item; in btrfs_insert_delayed_item()730 first_key.offset = first_item->index; in btrfs_insert_delayed_item()
6546 const struct btrfs_delayed_item *first_item) in log_delayed_insertion_items() 6548 const struct btrfs_delayed_item *curr = first_item; in log_delayed_insertion_items() 6515 insert_delayed_items_batch(struct btrfs_trans_handle * trans,struct btrfs_root * log,struct btrfs_path * path,const struct btrfs_item_batch * batch,const struct btrfs_delayed_item * first_item) insert_delayed_items_batch() argument