Home
last modified time | relevance | path

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

/linux/drivers/s390/block/
A Ddcssblk.c258 if (sort_list == NULL) in dcssblk_is_continuous()
269 if (sort_list[j].start > sort_list[i].start) { in dcssblk_is_continuous()
270 memcpy(&temp, &sort_list[i], in dcssblk_is_continuous()
272 memcpy(&sort_list[i], &sort_list[j], in dcssblk_is_continuous()
274 memcpy(&sort_list[j], &temp, in dcssblk_is_continuous()
280 if ((sort_list[i].end + 1) != sort_list[i+1].start) { in dcssblk_is_continuous()
283 sort_list[i+1].segment_name); in dcssblk_is_continuous()
288 if (sort_list[i].segment_type != sort_list[i+1].segment_type) { in dcssblk_is_continuous()
291 !(sort_list[i+1].segment_type & in dcssblk_is_continuous()
296 sort_list[i].segment_name, in dcssblk_is_continuous()
[all …]
/linux/tools/perf/ui/
A Dhist.c545 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/tools/perf/
A Dbuiltin-kmem.c1249 struct list_head *sort_list) in sort_slab_insert() argument
1262 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1279 struct list_head *sort_list) in __sort_slab_result() argument
1291 sort_slab_insert(root_sorted, data, sort_list); in __sort_slab_result()
1296 struct list_head *sort_list) in sort_page_insert() argument
1309 list_for_each_entry(sort, sort_list, list) { in sort_page_insert()
1326 struct list_head *sort_list) in __sort_page_result() argument
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) < 0) { in setup_slab_sorting()
[all …]
A Dbuiltin-sched.c228 struct list_head sort_list, cmp_pid; member
965 struct list_head *sort_list) in thread_atoms_search() argument
976 cmp = thread_lat_cmp(sort_list, &key, atoms); in thread_atoms_search()
991 struct list_head *sort_list) in __thread_latency_insert() argument
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()
3327 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in setup_sorting()
3425 .sort_list = LIST_HEAD_INIT(sched.sort_list), in cmd_sched()
A Dbuiltin-diff.c588 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
A Dbuiltin-c2c.c1736 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
/linux/block/
A Dmq-deadline.c77 struct rb_root sort_list[DD_DIR_COUNT]; member
121 return &per_prio->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
399 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_READ])); in __dd_dispatch_request()
416 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_WRITE])); in __dd_dispatch_request()
632 per_prio->sort_list[DD_READ] = RB_ROOT; in dd_init_sched()
633 per_prio->sort_list[DD_WRITE] = RB_ROOT; in dd_init_sched()
670 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
A Dbfq-iosched.c949 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
2160 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2278 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2284 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2393 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2394 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
3739 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire()
3759 !RB_EMPTY_ROOT(&bfqq->sort_list))) in __bfq_bfqq_expire()
4199 RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_bfqq_expire()
4527 if (!RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_choose_bfqq_for_injection()
[all …]
A Dbfq-iosched.h264 struct rb_root sort_list; member
/linux/tools/perf/util/
A Dhist.h284 struct list_head sort_list; member
344 list_for_each_entry(format, &(_list)->sorts, sort_list)
347 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
A Dblock-info.c349 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
A Dsort.c2087 INIT_LIST_HEAD(&hse->hpp.sort_list); in __sort_dimension__alloc_hpp()
2109 INIT_LIST_HEAD(&fmt->sort_list); in __hpp_dimension__alloc_hpp()
2436 INIT_LIST_HEAD(&hde->hpp.sort_list); in __alloc_dynamic_entry()
2468 INIT_LIST_HEAD(&new_fmt->sort_list); in perf_hpp_fmt__dup()
/linux/fs/xfs/
A Dxfs_log_recover.c1875 LIST_HEAD(sort_list); in xlog_recover_reorder_trans()
1881 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans()
1882 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans()
1895 if (!list_empty(&sort_list)) in xlog_recover_reorder_trans()
1896 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans()
1924 ASSERT(list_empty(&sort_list)); in xlog_recover_reorder_trans()

Completed in 62 milliseconds