/linux-master/drivers/s390/block/ |
H A D | dcssblk.c | 238 struct segment_info *sort_list, *entry, temp; local 243 sort_list = kcalloc(dev_info->num_of_segments, 246 if (sort_list == NULL) 250 memcpy(&sort_list[i], entry, sizeof(struct segment_info)); 257 if (sort_list[j].start > sort_list[i].start) { 258 memcpy(&temp, &sort_list[i], 260 memcpy(&sort_list[i], &sort_list[j], 262 memcpy(&sort_list[ [all...] |
/linux-master/tools/perf/ui/ |
H A D | hist.c | 548 BUG_ON(!list_empty(&fmt->sort_list)); 563 /* sort_list may be linked by setup_sorting() */ 564 if (fmt->sort_list.next == NULL) 565 INIT_LIST_HEAD(&fmt->sort_list); 607 list_add_tail(&format->sort_list, &list->sorts); 613 list_add(&format->sort_list, &list->sorts); 698 list_del_init(&fmt->sort_list); 705 list_del_init(&fmt->sort_list); 861 list_add_tail(&fmt_copy->sort_list, &node->hpp.sorts);
|
/linux-master/tools/perf/ |
H A D | builtin-kmem.c | 1271 struct list_head *sort_list) 1284 list_for_each_entry(sort, sort_list, list) { 1301 struct list_head *sort_list) 1313 sort_slab_insert(root_sorted, data, sort_list); 1318 struct list_head *sort_list) 1331 list_for_each_entry(sort, sort_list, list) { 1348 struct list_head *sort_list) 1360 sort_page_insert(root_sorted, data, sort_list); 1724 static int setup_slab_sorting(struct list_head *sort_list, const char *arg) argument 1739 if (slab_sort_dimension__add(tok, sort_list) < 1270 sort_slab_insert(struct rb_root *root, struct alloc_stat *data, struct list_head *sort_list) argument 1300 __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted, struct list_head *sort_list) argument 1317 sort_page_insert(struct rb_root *root, struct page_stat *data, struct list_head *sort_list) argument 1347 __sort_page_result(struct rb_root *root, struct rb_root *root_sorted, struct list_head *sort_list) argument 1750 setup_page_sorting(struct list_head *sort_list, const char *arg) argument [all...] |
H A D | builtin-kwork.c | 230 if (sort_dimension__add(kwork, tok, &kwork->sort_list) < 0) 311 struct list_head *sort_list) 319 cmp = work_cmp(sort_list, key, work); 334 struct kwork_work *key, struct list_head *sort_list) 344 cmp = work_cmp(sort_list, key, cur); 380 struct list_head *sort_list) 382 struct kwork_work *work = work_search(root, key, sort_list); 389 work_insert(root, work, sort_list); 1698 data, &kwork->sort_list); 2332 .sort_list 309 work_search(struct rb_root_cached *root, struct kwork_work *key, struct list_head *sort_list) argument 333 work_insert(struct rb_root_cached *root, struct kwork_work *key, struct list_head *sort_list) argument 378 work_findnew(struct rb_root_cached *root, struct kwork_work *key, struct list_head *sort_list) argument [all...] |
H A D | builtin-sched.c | 211 struct list_head sort_list, cmp_pid; member in struct:perf_sched 969 struct list_head *sort_list) 980 cmp = thread_lat_cmp(sort_list, &key, atoms); 995 struct list_head *sort_list) 1007 cmp = thread_lat_cmp(sort_list, data, this); 1480 __thread_latency_insert(&sched->sorted_atom_root, data, &sched->sort_list); 3405 if (sort_dimension__add(tok, &sched->sort_list) < 0) { 3517 .sort_list = LIST_HEAD_INIT(sched.sort_list), 968 thread_atoms_search(struct rb_root_cached *root, struct thread *thread, struct list_head *sort_list) argument 994 __thread_latency_insert(struct rb_root_cached *root, struct work_atoms *data, struct list_head *sort_list) argument
|
H A D | builtin-kvm.c | 403 INIT_LIST_HEAD(&fmt->sort_list);
|
H A D | builtin-diff.c | 590 INIT_LIST_HEAD(&bh->block_fmt.sort_list);
|
H A D | builtin-c2c.c | 1971 INIT_LIST_HEAD(&fmt->sort_list);
|
/linux-master/tools/perf/util/ |
H A D | kwork.h | 205 struct list_head sort_list, cmp_id; member in struct:perf_kwork
|
H A D | hist.h | 297 struct list_head sort_list; member in struct:perf_hpp_fmt 357 list_for_each_entry(format, &(_list)->sorts, sort_list) 360 list_for_each_entry_safe(format, tmp, &(_list)->sorts, sort_list)
|
H A D | block-info.c | 349 INIT_LIST_HEAD(&fmt->sort_list);
|
H A D | sort.c | 2633 INIT_LIST_HEAD(&hse->hpp.sort_list); 2655 INIT_LIST_HEAD(&fmt->sort_list); 3001 INIT_LIST_HEAD(&hde->hpp.sort_list); 3036 INIT_LIST_HEAD(&new_fmt->sort_list);
|
/linux-master/block/ |
H A D | mq-deadline.c | 71 * present on both sort_list[] and fifo_list[]. 75 struct rb_root sort_list[DD_DIR_COUNT]; member in struct:dd_per_prio 119 return &per_prio->sort_list[rq_data_dir(rq)]; 166 struct rb_node *node = per_prio->sort_list[data_dir].rb_node; 480 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_READ])); 497 BUG_ON(RB_EMPTY_ROOT(&per_prio->sort_list[DD_WRITE])); 714 per_prio->sort_list[DD_READ] = RB_ROOT; 715 per_prio->sort_list[DD_WRITE] = RB_ROOT; 755 __rq = elv_rb_find(&per_prio->sort_list[bio_data_dir(bio)], sector);
|
H A D | bfq-iosched.c | 1034 rbnext = rb_first(&bfqq->sort_list); 2055 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfqq->dispatched == 0) 2294 elv_rb_add(&bfqq->sort_list, rq); 2367 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); 2400 elv_rb_del(&bfqq->sort_list, rq); 2406 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { 2520 /* Reposition request in its sort_list */ 2521 elv_rb_del(&bfqq->sort_list, req); 2522 elv_rb_add(&bfqq->sort_list, req); 3119 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) [all...] |
H A D | bfq-iosched.h | 277 struct rb_root sort_list; member in struct:bfq_queue 284 /* fifo list of requests in sort_list */
|
/linux-master/fs/xfs/ |
H A D | xfs_log_recover.c | 1864 LIST_HEAD(sort_list); 1870 list_splice_init(&trans->r_itemq, &sort_list); 1871 list_for_each_entry_safe(item, n, &sort_list, ri_list) { 1884 if (!list_empty(&sort_list)) 1885 list_splice_init(&sort_list, &trans->r_itemq); 1913 ASSERT(list_empty(&sort_list));
|