171b3fa15SDavid Xu /* 271b3fa15SDavid Xu * Copyright (c) 1998 Daniel Eischen <eischen@vigrid.com>. 371b3fa15SDavid Xu * All rights reserved. 471b3fa15SDavid Xu * 571b3fa15SDavid Xu * Redistribution and use in source and binary forms, with or without 671b3fa15SDavid Xu * modification, are permitted provided that the following conditions 771b3fa15SDavid Xu * are met: 871b3fa15SDavid Xu * 1. Redistributions of source code must retain the above copyright 971b3fa15SDavid Xu * notice, this list of conditions and the following disclaimer. 1071b3fa15SDavid Xu * 2. Redistributions in binary form must reproduce the above copyright 1171b3fa15SDavid Xu * notice, this list of conditions and the following disclaimer in the 1271b3fa15SDavid Xu * documentation and/or other materials provided with the distribution. 1371b3fa15SDavid Xu * 3. All advertising materials mentioning features or use of this software 1471b3fa15SDavid Xu * must display the following acknowledgement: 1571b3fa15SDavid Xu * This product includes software developed by Daniel Eischen. 1671b3fa15SDavid Xu * 4. Neither the name of the author nor the names of any co-contributors 1771b3fa15SDavid Xu * may be used to endorse or promote products derived from this software 1871b3fa15SDavid Xu * without specific prior written permission. 1971b3fa15SDavid Xu * 2071b3fa15SDavid Xu * THIS SOFTWARE IS PROVIDED BY DANIEL EISCHEN AND CONTRIBUTORS ``AS IS'' AND 2171b3fa15SDavid Xu * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2271b3fa15SDavid Xu * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2371b3fa15SDavid Xu * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 2471b3fa15SDavid Xu * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2571b3fa15SDavid Xu * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2671b3fa15SDavid Xu * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2771b3fa15SDavid Xu * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2871b3fa15SDavid Xu * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2971b3fa15SDavid Xu * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3071b3fa15SDavid Xu * SUCH DAMAGE. 3171b3fa15SDavid Xu * 32*a31d0705SMatthew Dillon * $DragonFly: src/lib/libthread_xu/thread/thr_setschedparam.c,v 1.6 2007/05/03 23:08:34 dillon Exp $ 3371b3fa15SDavid Xu */ 349e2ee207SJoerg Sonnenberger 35fc71f871SDavid Xu #include "namespace.h" 369e2ee207SJoerg Sonnenberger #include <machine/tls.h> 379e2ee207SJoerg Sonnenberger 3871b3fa15SDavid Xu #include <sys/param.h> 39fc71f871SDavid Xu #include <errno.h> 4071b3fa15SDavid Xu #include <pthread.h> 41fc71f871SDavid Xu #include "un-namespace.h" 42fc71f871SDavid Xu 4371b3fa15SDavid Xu #include "thr_private.h" 4471b3fa15SDavid Xu 4571b3fa15SDavid Xu int 4671b3fa15SDavid Xu _pthread_setschedparam(pthread_t pthread, int policy, 4771b3fa15SDavid Xu const struct sched_param *param) 4871b3fa15SDavid Xu { 499e2ee207SJoerg Sonnenberger struct pthread *curthread = tls_get_curthread(); 5071b3fa15SDavid Xu int ret = 0; 5171b3fa15SDavid Xu 52*a31d0705SMatthew Dillon if (pthread == curthread) { 53*a31d0705SMatthew Dillon THR_LOCK(curthread); 54*a31d0705SMatthew Dillon if (curthread->attr.sched_policy == policy && 55*a31d0705SMatthew Dillon curthread->attr.prio == param->sched_priority) { 56*a31d0705SMatthew Dillon THR_UNLOCK(curthread); 57*a31d0705SMatthew Dillon return (0); 58*a31d0705SMatthew Dillon } 59*a31d0705SMatthew Dillon if (policy == SCHED_OTHER) { 60*a31d0705SMatthew Dillon ret = _thr_set_sched_other_prio(curthread, 61*a31d0705SMatthew Dillon param->sched_priority); 62*a31d0705SMatthew Dillon } else { 63*a31d0705SMatthew Dillon ret = _thr_setscheduler(curthread->tid, policy, param); 64*a31d0705SMatthew Dillon } 65*a31d0705SMatthew Dillon if (ret == -1) 66*a31d0705SMatthew Dillon ret = errno; 67*a31d0705SMatthew Dillon else { 68*a31d0705SMatthew Dillon curthread->attr.sched_policy = policy; 69*a31d0705SMatthew Dillon curthread->attr.prio = param->sched_priority; 70*a31d0705SMatthew Dillon } 71*a31d0705SMatthew Dillon THR_UNLOCK(curthread); 7271b3fa15SDavid Xu } else if ((ret = _thr_ref_add(curthread, pthread, /*include dead*/0)) 7371b3fa15SDavid Xu == 0) { 7471b3fa15SDavid Xu THR_THREAD_LOCK(curthread, pthread); 75*a31d0705SMatthew Dillon if (pthread->attr.sched_policy == policy && 76*a31d0705SMatthew Dillon pthread->attr.prio == param->sched_priority) { 7771b3fa15SDavid Xu THR_THREAD_UNLOCK(curthread, pthread); 78*a31d0705SMatthew Dillon return (0); 7971b3fa15SDavid Xu } 80*a31d0705SMatthew Dillon if (policy == SCHED_OTHER) { 81*a31d0705SMatthew Dillon ret = _thr_set_sched_other_prio(curthread, 82*a31d0705SMatthew Dillon param->sched_priority); 83*a31d0705SMatthew Dillon } else { 84*a31d0705SMatthew Dillon ret = _thr_setscheduler(curthread->tid, policy, param); 85*a31d0705SMatthew Dillon } 86*a31d0705SMatthew Dillon if (ret == -1) 87*a31d0705SMatthew Dillon ret = errno; 8871b3fa15SDavid Xu else { 89*a31d0705SMatthew Dillon pthread->attr.sched_policy = policy; 90*a31d0705SMatthew Dillon pthread->attr.prio = param->sched_priority; 9171b3fa15SDavid Xu } 92*a31d0705SMatthew Dillon THR_THREAD_UNLOCK(curthread, pthread); 9371b3fa15SDavid Xu _thr_ref_delete(curthread, pthread); 9471b3fa15SDavid Xu } 9571b3fa15SDavid Xu return (ret); 9671b3fa15SDavid Xu } 975a1048c8SDavid Xu 985a1048c8SDavid Xu __strong_reference(_pthread_setschedparam, pthread_setschedparam); 99