Lines Matching defs:node

67 	struct rb_node *node;
69 while ((node = rb_last(&ctl->free_space_offset)) != NULL) {
70 info = rb_entry(node, struct btrfs_free_space, offset_index);
1078 struct rb_node *node = rb_first(&ctl->free_space_offset);
1087 if (!node && cluster) {
1090 node = rb_first(&cluster->root);
1095 while (node) {
1098 e = rb_entry(node, struct btrfs_free_space, offset_index);
1110 node = rb_next(node);
1111 if (!node && cluster) {
1112 node = rb_first(&cluster->root);
1689 static bool entry_less(struct rb_node *node, const struct rb_node *parent)
1693 entry = rb_entry(node, struct btrfs_free_space, bytes_index);
2017 struct rb_node *node;
2026 node = rb_first_cached(&ctl->free_space_bytes);
2032 node = &entry->offset_index;
2035 for (; node; node = rb_next(node)) {
2037 entry = rb_entry(node, struct btrfs_free_space,
2040 entry = rb_entry(node, struct btrfs_free_space,
2086 struct rb_node *old_next = rb_next(node);
2106 if (use_bytes_index && old_next != rb_next(node))
2341 struct rb_node *node;
2347 node = rb_first(&cluster->root);
2348 if (!node) {
2353 entry = rb_entry(node, struct btrfs_free_space, offset_index);
2814 * node blocks.
2983 struct rb_node *node;
2997 node = rb_first(&cluster->root);
2998 while (node) {
3001 entry = rb_entry(node, struct btrfs_free_space, offset_index);
3002 node = rb_next(&entry->offset_index);
3063 struct rb_node *node;
3067 node = rb_first(&ctl->free_space_offset);
3069 while (node) {
3070 info = rb_entry(node, struct btrfs_free_space, offset_index);
3077 node = rb_next(node);
3229 struct rb_node *node;
3241 node = rb_first(&cluster->root);
3242 if (!node)
3245 entry = rb_entry(node, struct btrfs_free_space, offset_index);
3253 node = rb_next(&entry->offset_index);
3254 if (!node)
3256 entry = rb_entry(node, struct btrfs_free_space,
3267 node = rb_next(&entry->offset_index);
3268 if (!node)
3270 entry = rb_entry(node, struct btrfs_free_space,
3394 * it into the space_index tree. Clear the bytes_index node here so the
3423 struct rb_node *node;
3441 node = rb_next(&entry->offset_index);
3442 if (!node)
3444 entry = rb_entry(node, struct btrfs_free_space, offset_index);
3452 for (node = rb_next(&entry->offset_index); node;
3453 node = rb_next(&entry->offset_index)) {
3454 entry = rb_entry(node, struct btrfs_free_space, offset_index);
3476 node = &first->offset_index;
3485 entry = rb_entry(node, struct btrfs_free_space, offset_index);
3486 node = rb_next(&entry->offset_index);
3495 } while (node && entry != last);
3722 struct rb_node *node;
3746 node = rb_next(&entry->offset_index);
3747 if (!node)
3749 entry = rb_entry(node, struct btrfs_free_space,
4112 struct rb_node *node;
4117 node = rb_first_cached(&fs_info->block_group_cache_tree);
4118 while (node) {
4119 block_group = rb_entry(node, struct btrfs_block_group, cache_node);
4123 node = rb_next(node);