Home
last modified time | relevance | path

Searched refs:sort_list (Results 1 – 15 of 15) 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/block/
H A Dmq-deadline.c74 struct rb_root sort_list[DD_DIR_COUNT]; member
117 return &per_prio->sort_list[rq_data_dir(rq)]; in deadline_rb_root()
135 struct rb_node *node = per_prio->sort_list[data_dir].rb_node; in deadline_from_pos()
347 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_READ])); in __dd_dispatch_request()
364 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_WRITE])); in __dd_dispatch_request()
543 per_prio->sort_list[DD_READ] = RB_ROOT; in dd_init_sched()
544 per_prio->sort_list[DD_WRITE] = RB_ROOT; in dd_init_sched()
581 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector); in dd_request_merge()
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()
3119 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_release_process_ref()
3915 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/
H A Dbuiltin-kmem.c1287 struct list_head *sort_list) in sort_slab_insert()
1300 list_for_each_entry(sort, sort_list, list) { in __sort_slab_result()
1317 struct list_head *sort_list) in sort_page_insert()
1329 sort_slab_insert(root_sorted, data, sort_list); in sort_page_insert()
1334 struct list_head *sort_list) in sort_page_insert()
1347 list_for_each_entry(sort, sort_list, list) { in __sort_page_result()
1364 struct list_head *sort_list) in sort_result()
1376 sort_page_insert(root_sorted, data, sort_list); in sort_result()
1740 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) in setup_slab_sorting()
1755 if (slab_sort_dimension__add(tok, sort_list) < in setup_page_sorting()
1264 sort_slab_insert(struct rb_root * root,struct alloc_stat * data,struct list_head * sort_list) sort_slab_insert() argument
1294 __sort_slab_result(struct rb_root * root,struct rb_root * root_sorted,struct list_head * sort_list) __sort_slab_result() argument
1311 sort_page_insert(struct rb_root * root,struct page_stat * data,struct list_head * sort_list) sort_page_insert() argument
1341 __sort_page_result(struct rb_root * root,struct rb_root * root_sorted,struct list_head * sort_list) __sort_page_result() argument
1717 setup_slab_sorting(struct list_head * sort_list,const char * arg) setup_slab_sorting() argument
1743 setup_page_sorting(struct list_head * sort_list,const char * arg) setup_page_sorting() argument
[all...]
H A Dbuiltin-kwork.c232 if (sort_dimension__add(kwork, tok, &kwork->sort_list) < 0) in setup_sorting()
313 struct list_head *sort_list) in work_search()
321 cmp = work_cmp(sort_list, key, work); in work_search()
336 struct kwork_work *key, struct list_head *sort_list) in work_insert()
346 cmp = work_cmp(sort_list, key, cur); in work_insert()
419 INIT_LIST_HEAD(&kwork->sort_list); in profile_event_match()
425 struct list_head *sort_list) in profile_event_match()
427 struct kwork_work *work = work_search(root, key, sort_list); in profile_event_match()
434 work_insert(root, work, sort_list); in profile_event_match()
1738 data, &kwork->sort_list); in perf_kwork__check_config()
312 work_search(struct rb_root_cached * root,struct kwork_work * key,struct list_head * sort_list) work_search() argument
335 work_insert(struct rb_root_cached * root,struct kwork_work * key,struct list_head * sort_list) work_insert() argument
381 work_findnew(struct rb_root_cached * root,struct kwork_work * key,struct list_head * sort_list) work_findnew() argument
[all...]
H A Dbuiltin-sched.c282 struct list_head sort_list, cmp_pid;
1160 struct list_head *sort_list) in latency_switch_event()
1171 cmp = thread_lat_cmp(sort_list, &key, atoms); in latency_switch_event()
1186 struct list_head *sort_list) in latency_switch_event()
1198 cmp = thread_lat_cmp(sort_list, data, this); in latency_switch_event()
1732 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); in map_switch_event()
4065 if (sort_dimension__add(tok, &sched->sort_list) < 0) { in print_domain_stats()
5272 .sort_list = LIST_HEAD_INIT(sched.sort_list),
218 struct list_head sort_list, cmp_pid; global() member
987 thread_atoms_search(struct rb_root_cached * root,struct thread * thread,struct list_head * sort_list) thread_atoms_search() argument
1013 __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.c577 INIT_LIST_HEAD(&bh->block_fmt.sort_list); in init_block_hist()
H A Dbuiltin-kvm.c406 INIT_LIST_HEAD(&fmt->sort_list); in get_format()
H A Dbuiltin-c2c.c1918 INIT_LIST_HEAD(&fmt->sort_list); in fmt_equal()
/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/tools/perf/util/
H A Dhist.h506 struct list_head sort_list;
567 list_for_each_entry(format, &(_list)->sorts, sort_list)
570 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
505 struct list_head sort_list; global() member
H A Dblock-info.c382 INIT_LIST_HEAD(&fmt->sort_list); in hpp_register()
H A Dsort.c3041 INIT_LIST_HEAD(&hse->hpp.sort_list); in update_dynamic_len()
3063 INIT_LIST_HEAD(&fmt->sort_list); in update_dynamic_len()
3410 INIT_LIST_HEAD(&hde->hpp.sort_list); in add_all_dynamic_fields()
3445 INIT_LIST_HEAD(&new_fmt->sort_list); in add_all_matching_fields()
/linux/fs/xfs/
H A Dxfs_log_recover.c1900 LIST_HEAD(sort_list); in xlog_recover_reorder_trans()
1906 list_splice_init(&trans->r_itemq, &sort_list); in xlog_recover_reorder_trans()
1907 list_for_each_entry_safe(item, n, &sort_list, ri_list) { in xlog_recover_reorder_trans()
1956 if (!list_empty(&sort_list)) { in xlog_recover_reorder_trans()
1958 list_splice_init(&sort_list, &trans->r_itemq); in xlog_recover_reorder_trans()