Lines Matching refs:entry
282 struct btrfs_delayed_ref_head *entry;
291 entry = rb_entry(parent_node, struct btrfs_delayed_ref_head,
294 if (bytenr < entry->bytenr) {
296 } else if (bytenr > entry->bytenr) {
300 return entry;
315 struct btrfs_delayed_ref_node *entry;
322 entry = rb_entry(parent_node, struct btrfs_delayed_ref_node,
324 comp = comp_refs(ins, entry, true);
331 return entry;
344 struct btrfs_delayed_ref_head *entry;
350 entry = rb_entry(n, struct btrfs_delayed_ref_head, href_node);
352 return entry;
356 * Find a head entry based on bytenr. This returns the delayed ref head if it
358 * is given, the next bigger entry is returned if no exact match is found.
366 struct btrfs_delayed_ref_head *entry;
369 entry = NULL;
371 entry = rb_entry(n, struct btrfs_delayed_ref_head, href_node);
373 if (bytenr < entry->bytenr)
375 else if (bytenr > entry->bytenr)
378 return entry;
380 if (entry && return_bigger) {
381 if (bytenr > entry->bytenr) {
382 n = rb_next(&entry->href_node);
385 entry = rb_entry(n, struct btrfs_delayed_ref_head,
388 return entry;