| /linux-6.1.9/drivers/s390/block/ |
| D | dcssblk.c | 237 struct segment_info *sort_list, *entry, temp; in dcssblk_is_continuous() local
242 sort_list = kcalloc(dev_info->num_of_segments, in dcssblk_is_continuous()
245 if (sort_list == NULL) in dcssblk_is_continuous()
249 memcpy(&sort_list[i], entry, sizeof(struct segment_info)); in dcssblk_is_continuous()
256 if (sort_list[j].start > sort_list[i].start) { in dcssblk_is_continuous()
257 memcpy(&temp, &sort_list[i], in dcssblk_is_continuous()
259 memcpy(&sort_list[i], &sort_list[j], in dcssblk_is_continuous()
261 memcpy(&sort_list[j], &temp, in dcssblk_is_continuous()
267 if ((sort_list[i].end + 1) != sort_list[i+1].start) { in dcssblk_is_continuous()
269 "contiguous\n", sort_list[i].segment_name, in dcssblk_is_continuous()
[all …]
|
| /linux-6.1.9/tools/perf/ui/ |
| D | hist.c | 545 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free()
561 if (fmt->sort_list.next == NULL) in perf_hpp__init()
562 INIT_LIST_HEAD(&fmt->sort_list); in perf_hpp__init()
604 list_add_tail(&format->sort_list, &list->sorts); in perf_hpp_list__register_sort_field()
610 list_add(&format->sort_list, &list->sorts); in perf_hpp_list__prepend_sort_field()
695 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
702 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
858 list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts); in add_hierarchy_fmt()
|
| /linux-6.1.9/tools/perf/ |
| D | builtin-kmem.c | 1261 struct list_head *sort_list) in sort_slab_insert() argument
1274 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1291 struct list_head *sort_list) in __sort_slab_result() argument
1303 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result()
1308 struct list_head *sort_list) in sort_page_insert() argument
1321 list_for_each_entry(sort, sort_list, list) { in sort_page_insert()
1338 struct list_head *sort_list) in __sort_page_result() argument
1350 sort_page_insert(root_sorted, data, sort_list); in __sort_page_result()
1714 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) in setup_slab_sorting() argument
1729 if (slab_sort_dimension__add(tok, sort_list) < 0) { in setup_slab_sorting()
[all …]
|
| D | builtin-kwork.c | 180 if (sort_dimension__add(kwork, tok, &kwork->sort_list) < 0) in setup_sorting()
261 struct list_head *sort_list) in work_search() argument
269 cmp = work_cmp(sort_list, key, work); in work_search()
284 struct kwork_work *key, struct list_head *sort_list) in work_insert() argument
294 cmp = work_cmp(sort_list, key, cur); in work_insert()
330 struct list_head *sort_list) in work_findnew() argument
332 struct kwork_work *work = work_search(root, key, sort_list); in work_findnew()
339 work_insert(root, work, sort_list); in work_findnew()
1287 data, &kwork->sort_list); in work_sort()
1678 .sort_list = LIST_HEAD_INIT(kwork.sort_list), in cmd_kwork()
|
| D | builtin-sched.c | 229 struct list_head sort_list, cmp_pid; member
987 struct list_head *sort_list) in thread_atoms_search() argument
998 cmp = thread_lat_cmp(sort_list, &key, atoms); in thread_atoms_search()
1013 struct list_head *sort_list) in __thread_latency_insert() argument
1025 cmp = thread_lat_cmp(sort_list, data, this); in __thread_latency_insert()
1498 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat()
3359 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
3471 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
|
| D | builtin-diff.c | 588 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
|
| D | builtin-c2c.c | 1965 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
|
| /linux-6.1.9/block/ |
| D | mq-deadline.c | 77 struct rb_root sort_list[DD_DIR_COUNT]; member
121 return &per_prio->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
457 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_READ])); in __dd_dispatch_request()
474 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_WRITE])); in __dd_dispatch_request()
690 per_prio->sort_list[DD_READ] = RB_ROOT; in dd_init_sched()
691 per_prio->sort_list[DD_WRITE] = RB_ROOT; in dd_init_sched()
731 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
|
| D | bfq-iosched.c | 1066 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
2059 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfqq->dispatched == 0) in bfq_update_io_intensity()
2296 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2369 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge()
2418 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2424 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2538 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2539 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
3105 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_release_process_ref()
3905 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire()
[all …]
|
| D | bfq-iosched.h | 266 struct rb_root sort_list; member
|
| /linux-6.1.9/tools/perf/util/ |
| D | hist.h | 289 struct list_head sort_list; member
349 list_for_each_entry(format, &(_list)->sorts, sort_list)
352 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
|
| D | kwork.h | 177 struct list_head sort_list, cmp_id; member
|
| D | block-info.c | 349 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
|
| D | sort.c | 2265 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
2287 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
2616 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
2648 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
|
| /linux-6.1.9/fs/xfs/ |
| D | xfs_log_recover.c | 1870 LIST_HEAD(sort_list); in xlog_recover_reorder_trans()
1876 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans()
1877 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans()
1890 if (!list_empty(&sort_list)) in xlog_recover_reorder_trans()
1891 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans()
1919 ASSERT(list_empty(&sort_list)); in xlog_recover_reorder_trans()
|