Symbol: btrfs_delayed_item
fs/btrfs/delayed-inode.c
1484
struct btrfs_delayed_item *delayed_item;
fs/btrfs/delayed-inode.c
1573
struct btrfs_delayed_item *item;
fs/btrfs/delayed-inode.c
1622
struct btrfs_delayed_item *item;
fs/btrfs/delayed-inode.c
1700
struct btrfs_delayed_item *item;
fs/btrfs/delayed-inode.c
1748
struct btrfs_delayed_item *curr, *next;
fs/btrfs/delayed-inode.c
1771
struct btrfs_delayed_item *curr;
fs/btrfs/delayed-inode.c
1792
struct btrfs_delayed_item *curr, *next;
fs/btrfs/delayed-inode.c
2010
struct btrfs_delayed_item *curr_item, *prev_item;
fs/btrfs/delayed-inode.c
2121
struct btrfs_delayed_item *item;
fs/btrfs/delayed-inode.c
2191
struct btrfs_delayed_item *item;
fs/btrfs/delayed-inode.c
2192
struct btrfs_delayed_item *next;
fs/btrfs/delayed-inode.c
346
static struct btrfs_delayed_item *btrfs_alloc_delayed_item(u16 data_len,
fs/btrfs/delayed-inode.c
350
struct btrfs_delayed_item *item;
fs/btrfs/delayed-inode.c
369
const struct btrfs_delayed_item *delayed_item = rb_entry(node,
fs/btrfs/delayed-inode.c
370
struct btrfs_delayed_item, rb_node);
fs/btrfs/delayed-inode.c
389
static struct btrfs_delayed_item *__btrfs_lookup_delayed_item(
fs/btrfs/delayed-inode.c
396
return rb_entry_safe(node, struct btrfs_delayed_item, rb_node);
fs/btrfs/delayed-inode.c
402
const struct btrfs_delayed_item *new_item =
fs/btrfs/delayed-inode.c
403
rb_entry(new, struct btrfs_delayed_item, rb_node);
fs/btrfs/delayed-inode.c
409
struct btrfs_delayed_item *ins)
fs/btrfs/delayed-inode.c
442
static void __btrfs_remove_delayed_item(struct btrfs_delayed_item *delayed_item)
fs/btrfs/delayed-inode.c
465
static void btrfs_release_delayed_item(struct btrfs_delayed_item *item)
fs/btrfs/delayed-inode.c
474
static struct btrfs_delayed_item *__btrfs_first_delayed_insertion_item(
fs/btrfs/delayed-inode.c
479
return rb_entry_safe(p, struct btrfs_delayed_item, rb_node);
fs/btrfs/delayed-inode.c
482
static struct btrfs_delayed_item *__btrfs_first_delayed_deletion_item(
fs/btrfs/delayed-inode.c
487
return rb_entry_safe(p, struct btrfs_delayed_item, rb_node);
fs/btrfs/delayed-inode.c
490
static struct btrfs_delayed_item *__btrfs_next_delayed_item(
fs/btrfs/delayed-inode.c
491
struct btrfs_delayed_item *item)
fs/btrfs/delayed-inode.c
495
return rb_entry_safe(p, struct btrfs_delayed_item, rb_node);
fs/btrfs/delayed-inode.c
499
struct btrfs_delayed_item *item)
fs/btrfs/delayed-inode.c
538
struct btrfs_delayed_item *item)
fs/btrfs/delayed-inode.c
657
struct btrfs_delayed_item *first_item)
fs/btrfs/delayed-inode.c
662
struct btrfs_delayed_item *curr;
fs/btrfs/delayed-inode.c
663
struct btrfs_delayed_item *next;
fs/btrfs/delayed-inode.c
825
struct btrfs_delayed_item *curr;
fs/btrfs/delayed-inode.c
843
struct btrfs_delayed_item *item)
fs/btrfs/delayed-inode.c
847
struct btrfs_delayed_item *curr, *next;
fs/btrfs/delayed-inode.c
930
struct btrfs_delayed_item *item;
fs/btrfs/tree-log.c
6520
const struct btrfs_delayed_item *first_item)
fs/btrfs/tree-log.c
6522
const struct btrfs_delayed_item *curr = first_item;
fs/btrfs/tree-log.c
6559
const struct btrfs_delayed_item *first = NULL;
fs/btrfs/tree-log.c
6560
const struct btrfs_delayed_item *curr;
fs/btrfs/tree-log.c
6629
curr = list_last_entry(delayed_ins_list, struct btrfs_delayed_item,
fs/btrfs/tree-log.c
6645
const struct btrfs_delayed_item *curr;
fs/btrfs/tree-log.c
6647
curr = list_first_entry(delayed_del_list, struct btrfs_delayed_item,
fs/btrfs/tree-log.c
6653
const struct btrfs_delayed_item *next;
fs/btrfs/tree-log.c
6688
const struct btrfs_delayed_item *first,
fs/btrfs/tree-log.c
6689
const struct btrfs_delayed_item **last_ret)
fs/btrfs/tree-log.c
6691
const struct btrfs_delayed_item *next;
fs/btrfs/tree-log.c
6725
const struct btrfs_delayed_item *curr;
fs/btrfs/tree-log.c
6732
curr = list_first_entry(delayed_del_list, struct btrfs_delayed_item,
fs/btrfs/tree-log.c
6736
const struct btrfs_delayed_item *last = curr;
fs/btrfs/tree-log.c
6825
struct btrfs_delayed_item *item;