| /Linux-v4.19/drivers/s390/block/ |
| D | dcssblk.c | 236 struct segment_info *sort_list, *entry, temp; in dcssblk_is_continuous() local
241 sort_list = kcalloc(dev_info->num_of_segments, in dcssblk_is_continuous()
244 if (sort_list == NULL) in dcssblk_is_continuous()
248 memcpy(&sort_list[i], entry, sizeof(struct segment_info)); in dcssblk_is_continuous()
255 if (sort_list[j].start > sort_list[i].start) { in dcssblk_is_continuous()
256 memcpy(&temp, &sort_list[i], in dcssblk_is_continuous()
258 memcpy(&sort_list[i], &sort_list[j], in dcssblk_is_continuous()
260 memcpy(&sort_list[j], &temp, in dcssblk_is_continuous()
266 if ((sort_list[i].end + 1) != sort_list[i+1].start) { in dcssblk_is_continuous()
268 "contiguous\n", sort_list[i].segment_name, in dcssblk_is_continuous()
[all …]
|
| /Linux-v4.19/block/ |
| D | deadline-iosched.c | 34 struct rb_root sort_list[2]; member
56 return &dd->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
139 __rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector); in deadline_merge()
335 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ])); in deadline_dispatch_requests()
352 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE])); in deadline_dispatch_requests()
443 dd->sort_list[READ] = RB_ROOT; in deadline_init_queue()
444 dd->sort_list[WRITE] = RB_ROOT; in deadline_init_queue()
|
| D | mq-deadline.c | 43 struct rb_root sort_list[2]; member
69 return &dd->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
302 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ])); in __dd_dispatch_request()
319 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE])); in __dd_dispatch_request()
423 dd->sort_list[READ] = RB_ROOT; in dd_init_queue()
424 dd->sort_list[WRITE] = RB_ROOT; in dd_init_queue()
448 __rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
|
| D | cfq-iosched.c | 125 struct rb_root sort_list; member
1216 rbnext = rb_first(&cfqq->sort_list); in cfq_find_next_rq()
2405 elv_rb_del(&cfqq->sort_list, rq); in cfq_del_rq_rb()
2407 if (cfq_cfqq_on_rr(cfqq) && RB_EMPTY_ROOT(&cfqq->sort_list)) { in cfq_del_rq_rb()
2428 elv_rb_add(&cfqq->sort_list, rq); in cfq_add_rq_rb()
2450 elv_rb_del(&cfqq->sort_list, rq); in cfq_reposition_rq_rb()
2471 return elv_rb_find(&cfqq->sort_list, bio_end_sector(bio)); in cfq_find_rq_fmerge()
2574 if (cfq_cfqq_on_rr(cfqq) && RB_EMPTY_ROOT(&cfqq->sort_list) && in cfq_merged_requests()
2680 if (cfq_cfqq_on_rr(cfqq) && RB_EMPTY_ROOT(&cfqq->sort_list)) in __cfq_slice_expired()
2923 WARN_ON(!RB_EMPTY_ROOT(&cfqq->sort_list)); in cfq_arm_slice_timer()
[all …]
|
| D | bfq-iosched.c | 855 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
1671 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
1743 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge()
1788 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
1794 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
1893 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
1894 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
2797 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in __bfq_bfqq_expire()
3255 RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_bfqq_expire()
3629 return RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_better_to_idle(bfqq); in bfq_bfqq_must_idle()
[all …]
|
| D | bfq-iosched.h | 254 struct rb_root sort_list; member
|
| /Linux-v4.19/tools/perf/ui/ |
| D | hist.c | 482 if (fmt->sort_list.next == NULL) in perf_hpp__init()
483 INIT_LIST_HEAD(&fmt->sort_list); in perf_hpp__init()
525 list_add_tail(&format->sort_list, &list->sorts); in perf_hpp_list__register_sort_field()
531 list_add(&format->sort_list, &list->sorts); in perf_hpp_list__prepend_sort_field()
615 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free()
628 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
635 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
791 list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts); in add_hierarchy_fmt()
|
| /Linux-v4.19/tools/perf/ |
| D | builtin-kmem.c | 1247 struct list_head *sort_list) in sort_slab_insert() argument
1260 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1277 struct list_head *sort_list) in __sort_slab_result() argument
1289 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result()
1294 struct list_head *sort_list) in sort_page_insert() argument
1307 list_for_each_entry(sort, sort_list, list) { in sort_page_insert()
1324 struct list_head *sort_list) in __sort_page_result() argument
1336 sort_page_insert(root_sorted, data, sort_list); in __sort_page_result()
1700 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) in setup_slab_sorting() argument
1715 if (slab_sort_dimension__add(tok, sort_list) < 0) { in setup_slab_sorting()
[all …]
|
| D | builtin-sched.c | 217 struct list_head sort_list, cmp_pid; member
954 struct list_head *sort_list) in thread_atoms_search() argument
965 cmp = thread_lat_cmp(sort_list, &key, atoms); in thread_atoms_search()
980 struct list_head *sort_list) in __thread_latency_insert() argument
991 cmp = thread_lat_cmp(sort_list, data, this); in __thread_latency_insert()
1460 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat()
3288 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
3350 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
|
| D | builtin-c2c.c | 1756 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
|
| /Linux-v4.19/tools/perf/util/ |
| D | hist.h | 261 struct list_head sort_list; member
321 list_for_each_entry(format, &(_list)->sorts, sort_list)
324 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
|
| D | sort.c | 1799 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
1821 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
2148 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
2180 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
|
| /Linux-v4.19/fs/xfs/ |
| D | xfs_log_recover.c | 1930 LIST_HEAD(sort_list); in xlog_recover_reorder_trans()
1936 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans()
1937 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans()
1981 if (!list_empty(&sort_list)) in xlog_recover_reorder_trans()
1982 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans()
1988 ASSERT(list_empty(&sort_list)); in xlog_recover_reorder_trans()
|
