ctree.h (146054090b0859b28fc39015c7704ccc3c3a347f) ctree.h (0ff40a910f5649dfacc4fb5daa7e73692196342d)
1/* SPDX-License-Identifier: GPL-2.0 */
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
5
6#ifndef BTRFS_CTREE_H
7#define BTRFS_CTREE_H
8

--- 2894 unchanged lines hidden (view full) ---

2903 u32 data_size)
2904{
2905 return btrfs_insert_empty_items(trans, root, path, key, &data_size, 1);
2906}
2907
2908int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path);
2909int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path,
2910 u64 time_seq);
1/* SPDX-License-Identifier: GPL-2.0 */
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
5
6#ifndef BTRFS_CTREE_H
7#define BTRFS_CTREE_H
8

--- 2894 unchanged lines hidden (view full) ---

2903 u32 data_size)
2904{
2905 return btrfs_insert_empty_items(trans, root, path, key, &data_size, 1);
2906}
2907
2908int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path);
2909int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path,
2910 u64 time_seq);
2911
2912int btrfs_search_backwards(struct btrfs_root *root, struct btrfs_key *key,
2913 struct btrfs_path *path);
2914
2911static inline int btrfs_next_old_item(struct btrfs_root *root,
2912 struct btrfs_path *p, u64 time_seq)
2913{
2914 ++p->slots[0];
2915 if (p->slots[0] >= btrfs_header_nritems(p->nodes[0]))
2916 return btrfs_next_old_leaf(root, p, time_seq);
2917 return 0;
2918}

--- 932 unchanged lines hidden --- 		2915static inline int btrfs_next_old_item(struct btrfs_root *root,
2916 struct btrfs_path *p, u64 time_seq)
2917{
2918 ++p->slots[0];
2919 if (p->slots[0] >= btrfs_header_nritems(p->nodes[0]))
2920 return btrfs_next_old_leaf(root, p, time_seq);
2921 return 0;
2922}

--- 932 unchanged lines hidden ---