Home
last modified time | relevance | path

Searched refs:sort_list (Results 1 - 25 of 29) sorted by relevance

12

/kernel/linux/linux-5.10/drivers/s390/block/
H A Ddcssblk.c252 struct segment_info *sort_list, *entry, temp; in dcssblk_is_continuous() local
257 sort_list = kcalloc(dev_info->num_of_segments, in dcssblk_is_continuous()
260 if (sort_list == NULL) in dcssblk_is_continuous()
264 memcpy(&sort_list[i], entry, sizeof(struct segment_info)); in dcssblk_is_continuous()
271 if (sort_list[j].start > sort_list[i].start) { in dcssblk_is_continuous()
272 memcpy(&temp, &sort_list[i], in dcssblk_is_continuous()
274 memcpy(&sort_list[i], &sort_list[j], in dcssblk_is_continuous()
276 memcpy(&sort_list[ in dcssblk_is_continuous()
[all...]
/kernel/linux/linux-6.6/drivers/s390/block/
H A Ddcssblk.c238 struct segment_info *sort_list, *entry, temp; in dcssblk_is_continuous() local
243 sort_list = kcalloc(dev_info->num_of_segments, in dcssblk_is_continuous()
246 if (sort_list == NULL) in dcssblk_is_continuous()
250 memcpy(&sort_list[i], entry, sizeof(struct segment_info)); 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[ in dcssblk_is_continuous()
[all...]
/kernel/linux/linux-5.10/block/
H A Dmq-deadline.c42 * requests (deadline_rq s) are present on both sort_list and fifo_list
44 struct rb_root sort_list[2]; member
70 return &dd->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
303 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ])); in __dd_dispatch_request()
320 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE])); in __dd_dispatch_request()
426 dd->sort_list[READ] = RB_ROOT; in dd_init_queue()
427 dd->sort_list[WRITE] = RB_ROOT; in dd_init_queue()
451 __rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
H A Dbfq-iosched.c917 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
1884 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_bfqq_sync(bfqq)) { in bfq_add_request()
2058 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2131 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge()
2176 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2182 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2295 /* Reposition request in its sort_list */ in bfq_request_merged()
2296 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2297 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
2774 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) in bfq_release_process_ref()
[all...]
H A Dbfq-iosched.h259 struct rb_root sort_list; member
268 /* fifo list of requests in sort_list */
/kernel/linux/linux-5.10/tools/perf/ui/
H A Dhist.c545 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free()
560 /* sort_list may be linked by setup_sorting() */ in perf_hpp__init()
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()
/kernel/linux/linux-6.6/tools/perf/ui/
H A Dhist.c548 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free()
563 /* sort_list may be linked by setup_sorting() */ in perf_hpp__init()
564 if (fmt->sort_list.next == NULL) in perf_hpp__init()
565 INIT_LIST_HEAD(&fmt->sort_list); in perf_hpp__init()
607 list_add_tail(&format->sort_list, &list->sorts); in perf_hpp_list__register_sort_field()
613 list_add(&format->sort_list, &list->sorts); in perf_hpp_list__prepend_sort_field()
698 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
705 list_del_init(&fmt->sort_list); in perf_hpp__reset_output_field()
861 list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts); in add_hierarchy_fmt()
/kernel/linux/linux-6.6/block/
H A Dmq-deadline.c71 * present on both sort_list[] and fifo_list[].
75 struct rb_root sort_list[DD_DIR_COUNT]; member
119 return &per_prio->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
166 struct rb_node *node = per_prio->sort_list[data_dir].rb_node; in deadline_from_pos()
480 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_READ])); in __dd_dispatch_request()
497 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_WRITE])); in __dd_dispatch_request()
715 per_prio->sort_list[DD_READ] = RB_ROOT; in dd_init_sched()
716 per_prio->sort_list[DD_WRITE] = RB_ROOT; in dd_init_sched()
756 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
H A Dbfq-iosched.c1034 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
2055 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfqq->dispatched == 0) in bfq_update_io_intensity()
2294 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2367 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge()
2400 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2406 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2520 /* Reposition request in its sort_list */ in bfq_request_merged()
2521 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2522 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
3119 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) in bfq_release_process_ref()
[all...]
H A Dbfq-iosched.h277 struct rb_root sort_list; member
284 /* fifo list of requests in sort_list */
/kernel/linux/linux-5.10/tools/perf/
H A Dbuiltin-kmem.c1249 struct list_head *sort_list) in sort_slab_insert()
1262 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1279 struct list_head *sort_list) in __sort_slab_result()
1291 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result()
1296 struct list_head *sort_list) in sort_page_insert()
1309 list_for_each_entry(sort, sort_list, list) { in sort_page_insert()
1326 struct list_head *sort_list) in __sort_page_result()
1338 sort_page_insert(root_sorted, data, sort_list); in __sort_page_result()
1702 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) in setup_slab_sorting() argument
1717 if (slab_sort_dimension__add(tok, sort_list) < in setup_slab_sorting()
1248 sort_slab_insert(struct rb_root *root, struct alloc_stat *data, struct list_head *sort_list) sort_slab_insert() argument
1278 __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted, struct list_head *sort_list) __sort_slab_result() argument
1295 sort_page_insert(struct rb_root *root, struct page_stat *data, struct list_head *sort_list) sort_page_insert() argument
1325 __sort_page_result(struct rb_root *root, struct rb_root *root_sorted, struct list_head *sort_list) __sort_page_result() argument
1728 setup_page_sorting(struct list_head *sort_list, const char *arg) setup_page_sorting() argument
[all...]
H A Dbuiltin-sched.c228 struct list_head sort_list, cmp_pid; member
965 struct list_head *sort_list) in thread_atoms_search()
976 cmp = thread_lat_cmp(sort_list, &key, atoms); in thread_atoms_search()
991 struct list_head *sort_list) in __thread_latency_insert()
1003 cmp = thread_lat_cmp(sort_list, data, this); in __thread_latency_insert()
1476 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat()
3329 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
3427 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
964 thread_atoms_search(struct rb_root_cached *root, struct thread *thread, struct list_head *sort_list) thread_atoms_search() argument
990 __thread_latency_insert(struct rb_root_cached *root, struct work_atoms *data, struct list_head *sort_list) __thread_latency_insert() argument
H A Dbuiltin-diff.c588 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
/kernel/linux/linux-6.6/tools/perf/
H A Dbuiltin-kmem.c1271 struct list_head *sort_list) in sort_slab_insert()
1284 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1301 struct list_head *sort_list) in __sort_slab_result()
1313 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result()
1318 struct list_head *sort_list) in sort_page_insert()
1331 list_for_each_entry(sort, sort_list, list) { in sort_page_insert()
1348 struct list_head *sort_list) in __sort_page_result()
1360 sort_page_insert(root_sorted, data, sort_list); in __sort_page_result()
1724 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) in setup_slab_sorting() argument
1739 if (slab_sort_dimension__add(tok, sort_list) < in setup_slab_sorting()
1270 sort_slab_insert(struct rb_root *root, struct alloc_stat *data, struct list_head *sort_list) sort_slab_insert() argument
1300 __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted, struct list_head *sort_list) __sort_slab_result() argument
1317 sort_page_insert(struct rb_root *root, struct page_stat *data, struct list_head *sort_list) sort_page_insert() argument
1347 __sort_page_result(struct rb_root *root, struct rb_root *root_sorted, struct list_head *sort_list) __sort_page_result() argument
1750 setup_page_sorting(struct list_head *sort_list, const char *arg) setup_page_sorting() argument
[all...]
H A Dbuiltin-kwork.c187 if (sort_dimension__add(kwork, tok, &kwork->sort_list) < 0) in setup_sorting()
268 struct list_head *sort_list) in work_search()
276 cmp = work_cmp(sort_list, key, work); in work_search()
291 struct kwork_work *key, struct list_head *sort_list) in work_insert()
301 cmp = work_cmp(sort_list, key, cur); in work_insert()
337 struct list_head *sort_list) in work_findnew()
339 struct kwork_work *work = work_search(root, key, sort_list); in work_findnew()
346 work_insert(root, work, sort_list); in work_findnew()
1311 data, &kwork->sort_list); in work_sort()
1703 .sort_list in cmd_kwork()
266 work_search(struct rb_root_cached *root, struct kwork_work *key, struct list_head *sort_list) work_search() argument
290 work_insert(struct rb_root_cached *root, struct kwork_work *key, struct list_head *sort_list) work_insert() argument
335 work_findnew(struct rb_root_cached *root, struct kwork_work *key, struct list_head *sort_list) work_findnew() argument
[all...]
H A Dbuiltin-sched.c229 struct list_head sort_list, cmp_pid; member
987 struct list_head *sort_list) in thread_atoms_search()
998 cmp = thread_lat_cmp(sort_list, &key, atoms); in thread_atoms_search()
1013 struct list_head *sort_list) in __thread_latency_insert()
1025 cmp = thread_lat_cmp(sort_list, data, this); in __thread_latency_insert()
1505 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat()
3368 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
3480 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
986 thread_atoms_search(struct rb_root_cached *root, struct thread *thread, struct list_head *sort_list) thread_atoms_search() argument
1012 __thread_latency_insert(struct rb_root_cached *root, struct work_atoms *data, struct list_head *sort_list) __thread_latency_insert() argument
/kernel/linux/linux-6.6/tools/perf/util/
H A Dkwork.h177 struct list_head sort_list, cmp_id; member
H A Dhist.h294 struct list_head sort_list; member
354 list_for_each_entry(format, &(_list)->sorts, sort_list)
357 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
H A Dblock-info.c349 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
H A Dsort.c2437 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
2459 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
2805 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
2840 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
/kernel/linux/linux-5.10/tools/perf/util/
H A Dhist.h277 struct list_head sort_list; member
337 list_for_each_entry(format, &(_list)->sorts, sort_list)
340 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
H A Dblock-info.c349 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
H A Dsort.c1931 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
1953 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
2280 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
2312 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
/kernel/linux/linux-6.6/fs/xfs/
H A Dxfs_log_recover.c1870 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()
/kernel/linux/linux-5.10/fs/xfs/
H A Dxfs_log_recover.c1850 LIST_HEAD(sort_list); in xlog_recover_reorder_trans()
1856 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans()
1857 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans()
1870 if (!list_empty(&sort_list)) in xlog_recover_reorder_trans()
1871 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans()
1899 ASSERT(list_empty(&sort_list)); in xlog_recover_reorder_trans()

Completed in 71 milliseconds

12