sort_list         909 block/bfq-iosched.c 		rbnext = rb_first(&bfqq->sort_list);
sort_list        1876 block/bfq-iosched.c 	if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_bfqq_sync(bfqq)) {
sort_list        2050 block/bfq-iosched.c 	elv_rb_add(&bfqq->sort_list, rq);
sort_list        2123 block/bfq-iosched.c 		return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio));
sort_list        2168 block/bfq-iosched.c 	elv_rb_del(&bfqq->sort_list, rq);
sort_list        2174 block/bfq-iosched.c 	if (RB_EMPTY_ROOT(&bfqq->sort_list)) {
sort_list        2281 block/bfq-iosched.c 		elv_rb_del(&bfqq->sort_list, req);
sort_list        2282 block/bfq-iosched.c 		elv_rb_add(&bfqq->sort_list, req);
sort_list        2733 block/bfq-iosched.c 	if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) &&
sort_list        3486 block/bfq-iosched.c 	if (RB_EMPTY_ROOT(&bfqq->sort_list) &&
sort_list        3506 block/bfq-iosched.c 			     !RB_EMPTY_ROOT(&bfqq->sort_list)))
sort_list        3950 block/bfq-iosched.c 	    RB_EMPTY_ROOT(&bfqq->sort_list)) {
sort_list        4231 block/bfq-iosched.c 	return RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_better_to_idle(bfqq);
sort_list        4293 block/bfq-iosched.c 		if (!RB_EMPTY_ROOT(&bfqq->sort_list) &&
sort_list        5663 block/bfq-iosched.c 	    RB_EMPTY_ROOT(&bfqq->sort_list) &&
sort_list        5703 block/bfq-iosched.c 		else if (RB_EMPTY_ROOT(&bfqq->sort_list) &&
sort_list         257 block/bfq-iosched.h 	struct rb_root sort_list;
sort_list          44 block/mq-deadline.c 	struct rb_root sort_list[2];
sort_list          70 block/mq-deadline.c 	return &dd->sort_list[rq_data_dir(rq)];
sort_list         303 block/mq-deadline.c 		BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ]));
sort_list         320 block/mq-deadline.c 		BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE]));
sort_list         424 block/mq-deadline.c 	dd->sort_list[READ] = RB_ROOT;
sort_list         425 block/mq-deadline.c 	dd->sort_list[WRITE] = RB_ROOT;
sort_list         449 block/mq-deadline.c 	__rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector);
sort_list         237 drivers/s390/block/dcssblk.c 	struct segment_info *sort_list, *entry, temp;
sort_list         242 drivers/s390/block/dcssblk.c 	sort_list = kcalloc(dev_info->num_of_segments,
sort_list         245 drivers/s390/block/dcssblk.c 	if (sort_list == NULL)
sort_list         249 drivers/s390/block/dcssblk.c 		memcpy(&sort_list[i], entry, sizeof(struct segment_info));
sort_list         256 drivers/s390/block/dcssblk.c 			if (sort_list[j].start > sort_list[i].start) {
sort_list         257 drivers/s390/block/dcssblk.c 				memcpy(&temp, &sort_list[i],
sort_list         259 drivers/s390/block/dcssblk.c 				memcpy(&sort_list[i], &sort_list[j],
sort_list         261 drivers/s390/block/dcssblk.c 				memcpy(&sort_list[j], &temp,
sort_list         267 drivers/s390/block/dcssblk.c 		if ((sort_list[i].end + 1) != sort_list[i+1].start) {
sort_list         269 drivers/s390/block/dcssblk.c 			       "contiguous\n", sort_list[i].segment_name,
sort_list         270 drivers/s390/block/dcssblk.c 			       sort_list[i+1].segment_name);
sort_list         275 drivers/s390/block/dcssblk.c 		if (sort_list[i].segment_type != sort_list[i+1].segment_type) {
sort_list         276 drivers/s390/block/dcssblk.c 			if (!(sort_list[i].segment_type & SEGMENT_EXCLUSIVE) ||
sort_list         277 drivers/s390/block/dcssblk.c 				(sort_list[i].segment_type == SEG_TYPE_ER) ||
sort_list         278 drivers/s390/block/dcssblk.c 				!(sort_list[i+1].segment_type &
sort_list         280 drivers/s390/block/dcssblk.c 				(sort_list[i+1].segment_type == SEG_TYPE_ER)) {
sort_list         283 drivers/s390/block/dcssblk.c 				       sort_list[i].segment_name,
sort_list         284 drivers/s390/block/dcssblk.c 				       sort_list[i+1].segment_name);
sort_list         292 drivers/s390/block/dcssblk.c 	kfree(sort_list);
sort_list        1852 fs/xfs/xfs_log_recover.c 	LIST_HEAD(sort_list);
sort_list        1858 fs/xfs/xfs_log_recover.c 	list_splice_init(&trans->r_itemq, &sort_list);
sort_list        1859 fs/xfs/xfs_log_recover.c 	list_for_each_entry_safe(item, n, &sort_list, ri_list) {
sort_list        1903 fs/xfs/xfs_log_recover.c 			if (!list_empty(&sort_list))
sort_list        1904 fs/xfs/xfs_log_recover.c 				list_splice_init(&sort_list, &trans->r_itemq);
sort_list        1910 fs/xfs/xfs_log_recover.c 	ASSERT(list_empty(&sort_list));
sort_list        1767 tools/perf/builtin-c2c.c 	INIT_LIST_HEAD(&fmt->sort_list);
sort_list         595 tools/perf/builtin-diff.c 	INIT_LIST_HEAD(&bh->block_fmt.sort_list);
sort_list        1254 tools/perf/builtin-kmem.c 			     struct list_head *sort_list)
sort_list        1267 tools/perf/builtin-kmem.c 		list_for_each_entry(sort, sort_list, list) {
sort_list        1284 tools/perf/builtin-kmem.c 			       struct list_head *sort_list)
sort_list        1296 tools/perf/builtin-kmem.c 		sort_slab_insert(root_sorted, data, sort_list);
sort_list        1301 tools/perf/builtin-kmem.c 			     struct list_head *sort_list)
sort_list        1314 tools/perf/builtin-kmem.c 		list_for_each_entry(sort, sort_list, list) {
sort_list        1331 tools/perf/builtin-kmem.c 			       struct list_head *sort_list)
sort_list        1343 tools/perf/builtin-kmem.c 		sort_page_insert(root_sorted, data, sort_list);
sort_list        1707 tools/perf/builtin-kmem.c static int setup_slab_sorting(struct list_head *sort_list, const char *arg)
sort_list        1722 tools/perf/builtin-kmem.c 		if (slab_sort_dimension__add(tok, sort_list) < 0) {
sort_list        1733 tools/perf/builtin-kmem.c static int setup_page_sorting(struct list_head *sort_list, const char *arg)
sort_list        1748 tools/perf/builtin-kmem.c 		if (page_sort_dimension__add(tok, sort_list) < 0) {
sort_list         224 tools/perf/builtin-sched.c 	struct list_head sort_list, cmp_pid;
sort_list         961 tools/perf/builtin-sched.c 			 struct list_head *sort_list)
sort_list         972 tools/perf/builtin-sched.c 		cmp = thread_lat_cmp(sort_list, &key, atoms);
sort_list         987 tools/perf/builtin-sched.c 			 struct list_head *sort_list)
sort_list         999 tools/perf/builtin-sched.c 		cmp = thread_lat_cmp(sort_list, data, this);
sort_list        1470 tools/perf/builtin-sched.c 		__thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list);
sort_list        3296 tools/perf/builtin-sched.c 		if (sort_dimension__add(tok, &sched->sort_list) < 0) {
sort_list        3358 tools/perf/builtin-sched.c 		.sort_list	      = LIST_HEAD_INIT(sched.sort_list),
sort_list         486 tools/perf/ui/hist.c 		if (fmt->sort_list.next == NULL)
sort_list         487 tools/perf/ui/hist.c 			INIT_LIST_HEAD(&fmt->sort_list);
sort_list         529 tools/perf/ui/hist.c 	list_add_tail(&format->sort_list, &list->sorts);
sort_list         535 tools/perf/ui/hist.c 	list_add(&format->sort_list, &list->sorts);
sort_list         619 tools/perf/ui/hist.c 	BUG_ON(!list_empty(&fmt->sort_list));
sort_list         632 tools/perf/ui/hist.c 		list_del_init(&fmt->sort_list);
sort_list         639 tools/perf/ui/hist.c 		list_del_init(&fmt->sort_list);
sort_list         795 tools/perf/ui/hist.c 	list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts);
sort_list         276 tools/perf/util/hist.h 	struct list_head sort_list;
sort_list         336 tools/perf/util/hist.h 	list_for_each_entry(format, &(_list)->sorts, sort_list)
sort_list         339 tools/perf/util/hist.h 	list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
sort_list        1903 tools/perf/util/sort.c 	INIT_LIST_HEAD(&hse->hpp.sort_list);
sort_list        1925 tools/perf/util/sort.c 		INIT_LIST_HEAD(&fmt->sort_list);
sort_list        2252 tools/perf/util/sort.c 	INIT_LIST_HEAD(&hde->hpp.sort_list);
sort_list        2284 tools/perf/util/sort.c 	INIT_LIST_HEAD(&new_fmt->sort_list);