Home
last modified time | relevance | path

Searched refs:min_heap (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/lib/
H A Dtest_min_heap.c9 #include <linux/min_heap.h>
32 static __init int pop_verify_heap(bool min_heap, in pop_verify_heap() argument
33 struct min_heap *heap, in pop_verify_heap()
43 if (min_heap) { in pop_verify_heap()
62 static __init int test_heapify_all(bool min_heap) in test_heapify_all() argument
66 struct min_heap heap = { in test_heapify_all()
73 .less = min_heap ? less_than : greater_than, in test_heapify_all()
80 err = pop_verify_heap(min_heap, &heap, &funcs); in test_heapify_all()
89 err += pop_verify_heap(min_heap, &heap, &funcs); in test_heapify_all()
94 static __init int test_heap_push(bool min_heap) in test_heap_push() argument
127 test_heap_pop_push(bool min_heap) test_heap_pop_push() argument
[all...]
/kernel/linux/linux-6.6/lib/
H A Dtest_min_heap.c9 #include <linux/min_heap.h>
32 static __init int pop_verify_heap(bool min_heap, in pop_verify_heap() argument
33 struct min_heap *heap, in pop_verify_heap()
43 if (min_heap) { in pop_verify_heap()
62 static __init int test_heapify_all(bool min_heap) in test_heapify_all() argument
66 struct min_heap heap = { in test_heapify_all()
73 .less = min_heap ? less_than : greater_than, in test_heapify_all()
80 err = pop_verify_heap(min_heap, &heap, &funcs); in test_heapify_all()
89 err += pop_verify_heap(min_heap, &heap, &funcs); in test_heapify_all()
94 static __init int test_heap_push(bool min_heap) in test_heap_push() argument
127 test_heap_pop_push(bool min_heap) test_heap_pop_push() argument
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dmin_heap.h10 * struct min_heap - Data structure to hold a min-heap.
15 struct min_heap { struct
22 * struct min_heap_callbacks - Data/functions to customise the min_heap.
35 void min_heapify(struct min_heap *heap, int pos, in min_heapify()
68 void min_heapify_all(struct min_heap *heap, in min_heapify_all()
79 void min_heap_pop(struct min_heap *heap, in min_heap_pop()
99 void min_heap_pop_push(struct min_heap *heap, in min_heap_pop_push()
109 void min_heap_push(struct min_heap *heap, const void *element, in min_heap_push()
/kernel/linux/linux-6.6/include/linux/
H A Dmin_heap.h10 * struct min_heap - Data structure to hold a min-heap.
15 struct min_heap { struct
22 * struct min_heap_callbacks - Data/functions to customise the min_heap.
35 void min_heapify(struct min_heap *heap, int pos, in min_heapify()
68 void min_heapify_all(struct min_heap *heap, in min_heapify_all()
79 void min_heap_pop(struct min_heap *heap, in min_heap_pop()
99 void min_heap_pop_push(struct min_heap *heap, in min_heap_pop_push()
109 void min_heap_push(struct min_heap *heap, const void *element, in min_heap_push()
/kernel/linux/linux-5.10/kernel/events/
H A Dcore.c53 #include <linux/min_heap.h>
3682 static void __heap_add(struct min_heap *heap, struct perf_event *event) in __heap_add()
3702 struct min_heap event_heap; in visit_groups_merge()
3707 event_heap = (struct min_heap){ in visit_groups_merge()
3720 event_heap = (struct min_heap){ in visit_groups_merge()
/kernel/linux/linux-6.6/kernel/events/
H A Dcore.c53 #include <linux/min_heap.h>
3707 static void __heap_add(struct min_heap *heap, struct perf_event *event) in __heap_add()
3741 struct min_heap event_heap; in visit_groups_merge()
3750 event_heap = (struct min_heap){ in visit_groups_merge()
3763 event_heap = (struct min_heap){ in visit_groups_merge()

Completed in 32 milliseconds