1 /* 2 * Copyright (c) 2015-2020 François Tigeot <ftigeot@wolfpond.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice unmodified, this list of conditions, and the following 10 * disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25 */ 26 27 #include <drm/drmP.h> 28 #include <linux/workqueue.h> 29 30 struct workqueue_struct *system_wq; 31 struct workqueue_struct *system_highpri_wq; 32 struct workqueue_struct *system_long_wq; 33 struct workqueue_struct *system_unbound_wq; 34 struct workqueue_struct *system_power_efficient_wq; 35 36 static int init_workqueues(void *arg) 37 { 38 system_wq = alloc_workqueue("system_wq", 0, 1); 39 system_highpri_wq = alloc_workqueue("system_highpri_wq", 0, 1); 40 system_long_wq = alloc_workqueue("system_long_wq", 0, 1); 41 system_unbound_wq = alloc_workqueue("system_unbound_wq", 0, 1); 42 system_power_efficient_wq = alloc_workqueue("system_power_efficient_wq", 0, 1); 43 44 return 0; 45 } 46 47 static int destroy_workqueues(void *arg) 48 { 49 destroy_workqueue(system_wq); 50 destroy_workqueue(system_highpri_wq); 51 destroy_workqueue(system_long_wq); 52 destroy_workqueue(system_unbound_wq); 53 destroy_workqueue(system_power_efficient_wq); 54 55 return 0; 56 } 57 58 struct workqueue_struct * 59 _create_workqueue_common(char *name, int cpus) 60 { 61 struct workqueue_struct *wq; 62 63 wq = kmalloc(sizeof(*wq), M_DRM, M_WAITOK); 64 wq->taskqueue = taskqueue_create((name), M_WAITOK, 65 taskqueue_thread_enqueue, &wq->taskqueue); 66 taskqueue_start_threads(&wq->taskqueue, cpus, 67 TDPRI_KERN_DAEMON, -1, "%s", name); 68 69 return (wq); 70 } 71 72 void 73 destroy_workqueue(struct workqueue_struct *wq) 74 { 75 taskqueue_free(wq->taskqueue); 76 kfree(wq); 77 } 78 79 SYSINIT(linux_workqueue_init, SI_SUB_DRIVERS, SI_ORDER_MIDDLE, init_workqueues, NULL); 80 SYSUNINIT(linux_workqueue_destroy, SI_SUB_DRIVERS, SI_ORDER_MIDDLE, destroy_workqueues, NULL); 81 82 bool 83 flush_delayed_work(struct delayed_work *dwork) 84 { 85 callout_drain(&dwork->timer); 86 return flush_work(&dwork->work); 87 } 88 89 void 90 drain_workqueue(struct workqueue_struct *wq) 91 { 92 lockmgr(&wq->flags_lock, LK_EXCLUSIVE); 93 wq->is_draining = true; 94 lockmgr(&wq->flags_lock, LK_RELEASE); 95 96 flush_taskqueue(wq->taskqueue); 97 98 lockmgr(&wq->flags_lock, LK_EXCLUSIVE); 99 wq->is_draining = false; 100 lockmgr(&wq->flags_lock, LK_RELEASE); 101 } 102