Home
last modified time | relevance | path

Searched refs:sort_list (Results 1 – 16 of 16) sorted by relevance

/linux-6.15/drivers/s390/block/
H A Ddcssblk.c246 if (sort_list == NULL) in dcssblk_is_continuous()
257 if (sort_list[j].start > sort_list[i].start) { in dcssblk_is_continuous()
258 memcpy(&temp, &sort_list[i], in dcssblk_is_continuous()
260 memcpy(&sort_list[i], &sort_list[j], in dcssblk_is_continuous()
262 memcpy(&sort_list[j], &temp, in dcssblk_is_continuous()
268 if ((sort_list[i].end + 1) != sort_list[i+1].start) { in dcssblk_is_continuous()
271 sort_list[i+1].segment_name); in dcssblk_is_continuous()
276 if (sort_list[i].segment_type != sort_list[i+1].segment_type) { in dcssblk_is_continuous()
279 !(sort_list[i+1].segment_type & in dcssblk_is_continuous()
284 sort_list[i].segment_name, in dcssblk_is_continuous()
[all …]
/linux-6.15/tools/perf/ui/
H A Dhist.c603 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free()
624 if (fmt->sort_list.next == NULL) in perf_hpp__init()
625 INIT_LIST_HEAD(&fmt->sort_list); in perf_hpp__init()
687 list_add_tail(&format->sort_list, &list->sorts); in perf_hpp_list__register_sort_field()
693 list_add(&format->sort_list, &list->sorts); in perf_hpp_list__prepend_sort_field()
792 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
799 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
962 list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts); in add_hierarchy_fmt()
/linux-6.15/block/
H A Dmq-deadline.c75 struct rb_root sort_list[DD_DIR_COUNT]; member
118 return &per_prio->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
136 struct rb_node *node = per_prio->sort_list[data_dir].rb_node; in deadline_from_pos()
354 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_READ])); in __dd_dispatch_request()
371 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_WRITE])); in __dd_dispatch_request()
594 per_prio->sort_list[DD_READ] = RB_ROOT; in dd_init_sched()
595 per_prio->sort_list[DD_WRITE] = RB_ROOT; in dd_init_sched()
634 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
H A Dbfq-iosched.c1045 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
2305 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2411 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2417 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2532 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2533 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
3930 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire()
3950 !RB_EMPTY_ROOT(&bfqq->sort_list))) in __bfq_bfqq_expire()
4389 RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_bfqq_expire()
4766 if (!RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_find_active_bfqq_for_actuator()
[all …]
H A Dbfq-iosched.h277 struct rb_root sort_list; member
/linux-6.15/tools/perf/
H A Dbuiltin-kmem.c1264 struct list_head *sort_list) in sort_slab_insert() argument
1277 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1294 struct list_head *sort_list) in __sort_slab_result() argument
1306 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result()
1311 struct list_head *sort_list) in sort_page_insert() argument
1324 list_for_each_entry(sort, sort_list, list) { in sort_page_insert()
1341 struct list_head *sort_list) in __sort_page_result() argument
1353 sort_page_insert(root_sorted, data, sort_list); in __sort_page_result()
1717 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) in setup_slab_sorting() argument
1732 if (slab_sort_dimension__add(tok, sort_list) < 0) { in setup_slab_sorting()
[all …]
H A Dbuiltin-kwork.c231 if (sort_dimension__add(kwork, tok, &kwork->sort_list) < 0) in setup_sorting()
312 struct list_head *sort_list) in work_search() argument
320 cmp = work_cmp(sort_list, key, work); in work_search()
335 struct kwork_work *key, struct list_head *sort_list) in work_insert() argument
345 cmp = work_cmp(sort_list, key, cur); in work_insert()
381 struct list_head *sort_list) in work_findnew() argument
383 struct kwork_work *work = work_search(root, key, sort_list); in work_findnew()
390 work_insert(root, work, sort_list); in work_findnew()
1700 data, &kwork->sort_list); in work_sort()
2328 .sort_list = LIST_HEAD_INIT(kwork.sort_list), in cmd_kwork()
H A Dbuiltin-sched.c214 struct list_head sort_list, cmp_pid; member
980 struct list_head *sort_list) in thread_atoms_search() argument
991 cmp = thread_lat_cmp(sort_list, &key, atoms); in thread_atoms_search()
1006 struct list_head *sort_list) in __thread_latency_insert() argument
1018 cmp = thread_lat_cmp(sort_list, data, this); in __thread_latency_insert()
1491 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat()
3662 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
3766 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
H A Dbuiltin-diff.c577 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
H A Dbuiltin-kvm.c403 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
H A Dbuiltin-c2c.c1954 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
/linux-6.15/tools/perf/util/
H A Dhist.h491 struct list_head sort_list; member
551 list_for_each_entry(format, &(_list)->sorts, sort_list)
554 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
H A Dkwork.h206 struct list_head sort_list, cmp_id; member
H A Dblock-info.c382 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
H A Dsort.c2813 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
2835 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
3181 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
3216 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
/linux-6.15/fs/xfs/
H A Dxfs_log_recover.c1899 LIST_HEAD(sort_list); in xlog_recover_reorder_trans()
1905 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans()
1906 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans()
1919 if (!list_empty(&sort_list)) in xlog_recover_reorder_trans()
1920 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans()
1948 ASSERT(list_empty(&sort_list)); in xlog_recover_reorder_trans()