dma: beautify queue listing output
[dragonfly.git] / lib / libthread_xu / thread / thr_setschedparam.c
blob5cbae7d64eee43237bd1f272df1bb50e0a383a9a
1 /*
2 * Copyright (c) 1998 Daniel Eischen <eischen@vigrid.com>.
3 * All rights reserved.
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, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by Daniel Eischen.
16 * 4. Neither the name of the author nor the names of any co-contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY DANIEL EISCHEN AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
32 * $DragonFly: src/lib/libthread_xu/thread/thr_setschedparam.c,v 1.7 2007/05/04 17:18:55 dillon Exp $
35 #include "namespace.h"
36 #include <machine/tls.h>
38 #include <sys/param.h>
39 #include <errno.h>
40 #include <pthread.h>
41 #include "un-namespace.h"
43 #include "thr_private.h"
45 int
46 _pthread_setschedparam(pthread_t pthread, int policy,
47 const struct sched_param *param)
49 struct pthread *curthread = tls_get_curthread();
50 int ret = 0;
52 if (pthread == curthread) {
53 THR_LOCK(curthread);
54 if (curthread->attr.sched_policy == policy &&
55 curthread->attr.prio == param->sched_priority) {
56 THR_UNLOCK(curthread);
57 return (0);
59 if (policy == SCHED_OTHER) {
60 ret = _thr_set_sched_other_prio(curthread,
61 param->sched_priority);
62 } else {
63 ret = _thr_setscheduler(curthread->tid, policy, param);
65 if (ret == -1)
66 ret = errno;
67 else {
68 curthread->attr.sched_policy = policy;
69 curthread->attr.prio = param->sched_priority;
71 THR_UNLOCK(curthread);
72 } else if ((ret = _thr_ref_add(curthread, pthread, /*include dead*/0))
73 == 0) {
74 THR_THREAD_LOCK(curthread, pthread);
75 if (pthread->attr.sched_policy == policy &&
76 pthread->attr.prio == param->sched_priority) {
77 THR_THREAD_UNLOCK(curthread, pthread);
78 return (0);
80 if (policy == SCHED_OTHER) {
81 ret = _thr_set_sched_other_prio(pthread,
82 param->sched_priority);
83 } else {
84 ret = _thr_setscheduler(pthread->tid, policy, param);
86 if (ret == -1)
87 ret = errno;
88 else {
89 pthread->attr.sched_policy = policy;
90 pthread->attr.prio = param->sched_priority;
92 THR_THREAD_UNLOCK(curthread, pthread);
93 _thr_ref_delete(curthread, pthread);
95 return (ret);
98 __strong_reference(_pthread_setschedparam, pthread_setschedparam);