Lines Matching refs:entry
53 struct list_head *entry)
58 list_del(entry);
123 #define btrfs_leak_debug_del(lock, entry) do {} while (0)
364 struct tree_entry *entry;
375 entry = rb_entry(parent, struct tree_entry, rb_node);
377 if (offset < entry->start)
379 else if (offset > entry->end)
392 * __etree_search - searche @tree for an entry that contains @offset. Such
393 * entry would have entry->start <= offset && entry->end >= offset.
396 * @offset - offset that should fall within an entry in @tree
397 * @next_ret - pointer to the first entry whose range ends after @offset
398 * @prev - pointer to the first entry whose range begins before @offset
400 * entry in the tree)
401 * @parent_ret - points to entry which would have been the parent of the entry,
404 * This function returns a pointer to the entry that contains @offset byte
405 * address. If no such entry exists, then NULL is returned and the other
406 * pointer arguments to the function are filled, otherwise the found entry is
419 struct tree_entry *entry;
424 entry = rb_entry(prev, struct tree_entry, rb_node);
425 prev_entry = entry;
427 if (offset < entry->start)
429 else if (offset > entry->end)
1731 * Find the longest stretch from start until an entry which has the