Home
last modified time | relevance | path

Searched refs:heap (Results 1 – 2 of 2) sorted by relevance

/kernel/
Dcpuset.c848 static void update_tasks_cpumask(struct cpuset *cs, struct ptr_heap *heap) in update_tasks_cpumask() argument
855 scan.heap = heap; in update_tasks_cpumask()
867 struct ptr_heap heap; in update_cpumask() local
899 retval = heap_init(&heap, PAGE_SIZE, GFP_KERNEL, NULL); in update_cpumask()
913 update_tasks_cpumask(cs, &heap); in update_cpumask()
915 heap_free(&heap); in update_cpumask()
1046 struct ptr_heap *heap) in update_tasks_nodemask() argument
1055 scan.heap = heap; in update_tasks_nodemask()
1092 struct ptr_heap heap; in update_nodemask() local
1134 retval = heap_init(&heap, PAGE_SIZE, GFP_KERNEL, NULL); in update_nodemask()
[all …]
Dcgroup.c3215 struct ptr_heap *heap; in cgroup_scan_tasks() local
3218 if (scan->heap) { in cgroup_scan_tasks()
3220 heap = scan->heap; in cgroup_scan_tasks()
3221 heap->gt = &started_after; in cgroup_scan_tasks()
3224 heap = &tmp_heap; in cgroup_scan_tasks()
3225 retval = heap_init(heap, PAGE_SIZE, GFP_KERNEL, &started_after); in cgroup_scan_tasks()
3244 heap->size = 0; in cgroup_scan_tasks()
3259 dropped = heap_insert(heap, p); in cgroup_scan_tasks()
3281 if (heap->size) { in cgroup_scan_tasks()
3282 for (i = 0; i < heap->size; i++) { in cgroup_scan_tasks()
[all …]