sys/sys/sched.h

   1 /*-
   2  * Copyright (c) 1996, 1997
   3  *      HD Associates, Inc.  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, 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 HD Associates, Inc
  16  *      and Jukka Antero Ukkonen.
  17  * 4. Neither the name of the author nor the names of any co-contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY HD ASSOCIATES AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL HD ASSOCIATES OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  * $FreeBSD: src/sys/posix4/sched.h,v 1.4 1999/12/29 04:55:02 peter Exp $
  34  */
  35
  36 /* sched.h: POSIX 1003.1b Process Scheduling header */
  37
  38 #ifndef _SCHED_H_
  39 #define _SCHED_H_
  40
  41 /* Scheduling policies
  42  */
  43 #define SCHED_FIFO      1
  44 #define SCHED_OTHER     2
  45 #define SCHED_RR        3
  46
  47 struct sched_param
  48 {
  49         int sched_priority;
  50 };
  51
  52 #ifndef _KERNEL
  53 #include <sys/cdefs.h>
  54 #include <sys/types.h>          /* For pid_t */
  55
  56 #include <time.h>               /* Per P1003.4 */
  57
  58 #if __BSD_VISIBLE
  59 #include <machine/cpumask.h>
  60
  61 typedef cpumask_t               cpu_set_t;
  62 typedef cpumask_t               cpuset_t;       /* FreeBSD compat */
  63
  64 #define CPU_SETSIZE             ((int)(sizeof(cpumask_t) * 8))
  65
  66 #define CPU_ZERO(set)           CPUMASK_ASSZERO(*set)
  67 #define CPU_SET(cpu, set)       CPUMASK_ORBIT(*set, cpu)
  68 #define CPU_CLR(cpu, set)       CPUMASK_NANDBIT(*set, cpu)
  69 #define CPU_ISSET(cpu, set)     CPUMASK_TESTBIT(*set, cpu)
  70
  71 #define CPU_COUNT(set)                          \
  72         (__builtin_popcountl((set)->ary[0]) +   \
  73          __builtin_popcountl((set)->ary[1]) +   \
  74          __builtin_popcountl((set)->ary[2]) +   \
  75          __builtin_popcountl((set)->ary[3]))
  76
  77 #define CPU_AND(dst, set1, set2)                \
  78 do {                                            \
  79         if (dst == set1) {                      \
  80                 CPUMASK_ANDMASK(*dst, *set2);   \
  81         } else {                                \
  82                 *dst = *set2;                   \
  83                 CPUMASK_ANDMASK(*dst, *set1);   \
  84         }                                       \
  85 } while (0)
  86
  87 #define CPU_OR(dst, set1, set2)                 \
  88 do {                                            \
  89         if (dst == set1) {                      \
  90                 CPUMASK_ORMASK(*dst, *set2);    \
  91         } else {                                \
  92                 *dst = *set2;                   \
  93                 CPUMASK_ORMASK(*dst, *set1);    \
  94         }                                       \
  95 } while (0)
  96
  97 #define CPU_XOR(dst, set1, set2)                \
  98 do {                                            \
  99         if (dst == set1) {                      \
 100                 CPUMASK_XORMASK(*dst, *set2);   \
 101         } else {                                \
 102                 *dst = *set2;                   \
 103                 CPUMASK_XORMASK(*dst, *set1);   \
 104         }                                       \
 105 } while (0)
 106
 107 #define CPU_EQUAL(set1, set2)   CPUMASK_CMPMASKEQ(*set1, *set2)
 108 #endif /* __BSD_VISIBLE */
 109
 110 __BEGIN_DECLS
 111 int sched_setparam(pid_t, const struct sched_param *);
 112 int sched_getparam(pid_t, struct sched_param *);
 113
 114 int sched_setscheduler(pid_t, int, const struct sched_param *);
 115 int sched_getscheduler(pid_t);
 116
 117 int sched_yield(void);
 118 int sched_get_priority_max(int);
 119 int sched_get_priority_min(int);
 120 int sched_rr_get_interval(pid_t, struct timespec *);
 121
 122 #if __BSD_VISIBLE
 123 int sched_setaffinity(pid_t, size_t, const cpu_set_t *);
 124 int sched_getaffinity(pid_t, size_t, cpu_set_t *);
 125
 126 int sched_getcpu(void);
 127 #endif
 128 __END_DECLS
 129
 130 #endif
 131
 132 #endif /* _SCHED_H_ */