Lines Matching full:entries

6  * a new sort criteria, that must be present in the entries of the source
15  * fields to be present in each of the entries in the new, sorted, rb_tree.
18  * pre-calculating them from multiple entries in the original 'entry' from
19  * the rb_tree used as a source for the entries to be sorted:
72        struct rb_root		    entries;					\
79 	struct rb_node **p = &sorted->entries.rb_node, *parent = NULL;		\
88 	rb_insert_color(sorted_nd, &sorted->entries);				\
92 				    struct rb_root *entries)			\
96 	for (nd = rb_first(entries); nd; nd = rb_next(nd)) {			\
103 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries,	\
109 		sorted->entries = RB_ROOT;					\
110 		__name##_sorted__sort(sorted, entries);				\
128 	for (__nd = rb_first(&__name->entries);					\
138  * number of entries in it:
143 	DECLARE_RESORT_RB(__name)(&__ilist->rblist.entries.rb_root,		\
148  DECLARE_RESORT_RB(__name)(&__machine->threads[hash_bucket].entries.rb_root, \