Home
last modified time | relevance | path

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

/linux/drivers/s390/block/
H A Ddcssblk.c238 struct segment_info *sort_list, *entry, temp; in dcssblk_is_continuous() local
243 sort_list = kzalloc_objs(struct segment_info, 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/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()
2345 .sort_list = LIST_HEAD_INIT(kwork.sort_list), in cmd_kwork()
H A Dbuiltin-sched.c218 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()
1513 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in perf_sched__sort_lat()
3733 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
4824 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
H A Dbuiltin-diff.c575 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
H A Dbuiltin-kvm.c404 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
H A Dbuiltin-c2c.c1992 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
/linux/tools/perf/ui/
H A Dhist.c810 BUG_ON(!list_empty(&fmt->sort_list)); in fmt_free()
831 if (fmt->sort_list.next == NULL) in perf_hpp__init()
832 INIT_LIST_HEAD(&fmt->sort_list); in perf_hpp__init()
894 list_add_tail(&format->sort_list, &list->sorts); in perf_hpp_list__register_sort_field()
900 list_add(&format->sort_list, &list->sorts); in perf_hpp_list__prepend_sort_field()
906 list_del_init(&format->sort_list); in perf_hpp__column_unregister()
1203 list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts); in add_hierarchy_fmt()
/linux/block/
H A Dbfq-iosched.c1036 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
2057 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()
2402 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2408 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2516 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2517 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
3118 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_release_process_ref()
3914 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire()
[all …]
H A Dbfq-iosched.h277 struct rb_root sort_list; member
/linux/tools/perf/util/
H A Dhist.h505 struct list_head sort_list; member
565 list_for_each_entry(format, &(_list)->sorts, sort_list)
568 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
H A Dblock-info.c382 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
H A Dsort.c2900 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
2922 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
3269 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
3304 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
/linux/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()