/openbmc/linux/drivers/s390/block/ |
H A D | dcssblk.c | 238 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[j], &temp, in dcssblk_is_continuous() 268 if ((sort_list[i].end + 1) != sort_list[i+1].start) { in dcssblk_is_continuous() 270 "contiguous\n", sort_list[i].segment_name, in dcssblk_is_continuous() [all …]
|
/openbmc/linux/tools/perf/ui/ |
H A D | hist.c | 548 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free() 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()
|
/openbmc/linux/tools/perf/ |
H A D | builtin-kmem.c | 1271 struct list_head *sort_list) in sort_slab_insert() argument 1284 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert() 1301 struct list_head *sort_list) in __sort_slab_result() argument 1313 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result() 1318 struct list_head *sort_list) in sort_page_insert() argument 1331 list_for_each_entry(sort, sort_list, list) { in sort_page_insert() 1348 struct list_head *sort_list) in __sort_page_result() argument 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) < 0) { in setup_slab_sorting() [all …]
|
H A D | builtin-kwork.c | 187 if (sort_dimension__add(kwork, tok, &kwork->sort_list) < 0) in setup_sorting() 268 struct list_head *sort_list) in work_search() argument 276 cmp = work_cmp(sort_list, key, work); in work_search() 291 struct kwork_work *key, struct list_head *sort_list) in work_insert() argument 301 cmp = work_cmp(sort_list, key, cur); in work_insert() 337 struct list_head *sort_list) in work_findnew() argument 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 = LIST_HEAD_INIT(kwork.sort_list), in cmd_kwork()
|
H A 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() 1505 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat() 3449 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting() 3561 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
|
H A D | builtin-diff.c | 590 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
|
H A D | builtin-kvm.c | 403 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
|
H A D | builtin-c2c.c | 1971 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
|
/openbmc/linux/block/ |
H A D | mq-deadline.c | 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() 728 per_prio->sort_list[DD_READ] = RB_ROOT; in dd_init_sched() 729 per_prio->sort_list[DD_WRITE] = RB_ROOT; in dd_init_sched() 769 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
|
H A D | bfq-iosched.c | 1045 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq() 2066 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfqq->dispatched == 0) in bfq_update_io_intensity() 2305 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request() 2378 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge() 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() 3134 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_release_process_ref() 3930 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire() [all …]
|
H A D | bfq-iosched.h | 277 struct rb_root sort_list; member
|
/openbmc/u-boot/fs/jffs2/ |
H A D | mergesort.c | 13 int sort_list(struct b_list *list) in sort_list() function
|
H A D | jffs2_private.h | 103 int sort_list(struct b_list *list);
|
H A D | jffs2_1pass.c | 1783 sort_list(&pL->frag); in jffs2_1pass_build_lists() 1784 sort_list(&pL->dir); in jffs2_1pass_build_lists()
|
/openbmc/linux/tools/perf/util/ |
H A D | hist.h | 294 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 D | kwork.h | 177 struct list_head sort_list, cmp_id; member
|
H A D | block-info.c | 349 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
|
H A D | sort.c | 2437 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()
|
/openbmc/linux/fs/xfs/ |
H A D | xfs_log_recover.c | 1864 LIST_HEAD(sort_list); in xlog_recover_reorder_trans() 1870 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans() 1871 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans() 1884 if (!list_empty(&sort_list)) in xlog_recover_reorder_trans() 1885 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans() 1913 ASSERT(list_empty(&sort_list)); in xlog_recover_reorder_trans()
|