Lines Matching defs:cur
389 struct btrfs_backref_node *cur;
391 cur = list_first_entry(useless_node, struct btrfs_backref_node,
393 list_del_init(&cur->list);
396 ASSERT(list_empty(&cur->upper));
398 if (cur == node)
402 if (cur->lowest) {
403 list_del_init(&cur->lower);
404 cur->lowest = 0;
408 while (!list_empty(&cur->lower)) {
412 edge = list_entry(cur->lower.next,
424 mark_block_processed(rc, cur);
431 if (cur->level > 0) {
432 list_add(&cur->list, &cache->detached);
433 cur->detached = 1;
435 rb_erase(&cur->rb_node, &cache->rb_root);
436 btrfs_backref_free_node(cache, cur);
464 struct btrfs_backref_node *cur;
486 cur = node;
491 cur);
504 cur = edge->node[UPPER];