Annotation of libaitsched/inc/defs.h, revision 1.18
1.1 misho 1: /*************************************************************************
2: * (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com>
3: * by Michael Pounov <misho@openbsd-bg.org>
4: *
5: * $Author: misho $
1.18 ! misho 6: * $Id: defs.h,v 1.17.10.2 2023/02/25 15:40:48 misho Exp $
1.1 misho 7: *
8: **************************************************************************
9: The ELWIX and AITNET software is distributed under the following
10: terms:
11:
12: All of the documentation and software included in the ELWIX and AITNET
13: Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>
14:
1.18 ! misho 15: Copyright 2004 - 2023
1.1 misho 16: by Michael Pounov <misho@elwix.org>. All rights reserved.
17:
18: Redistribution and use in source and binary forms, with or without
19: modification, are permitted provided that the following conditions
20: are met:
21: 1. Redistributions of source code must retain the above copyright
22: notice, this list of conditions and the following disclaimer.
23: 2. Redistributions in binary form must reproduce the above copyright
24: notice, this list of conditions and the following disclaimer in the
25: documentation and/or other materials provided with the distribution.
26: 3. All advertising materials mentioning features or use of this software
27: must display the following acknowledgement:
28: This product includes software developed by Michael Pounov <misho@elwix.org>
29: ELWIX - Embedded LightWeight unIX and its contributors.
30: 4. Neither the name of AITNET nor the names of its contributors
31: may be used to endorse or promote products derived from this software
32: without specific prior written permission.
33:
34: THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND
35: ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
36: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
37: ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
38: FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
39: DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
40: OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
41: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
42: LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
43: OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44: SUCH DAMAGE.
45: */
46: #ifndef __DEFS_H
47: #define __DEFS_H
48:
49:
1.7 misho 50: #ifndef STRSIZ
1.1 misho 51: #define STRSIZ 256
1.7 misho 52: #endif
53:
1.10 misho 54: #ifndef KQ_EVENTS
1.6 misho 55: #define KQ_EVENTS 32
1.10 misho 56: #endif
57:
1.12 misho 58: #ifndef EV_EOF
59: #define EV_EOF 0x8000
60: #endif
61:
1.13 misho 62: #ifndef SIGRTMIN
63: #define SIGRTMIN 65
64: #endif
65:
1.14 misho 66: #ifndef FIONWRITE
67: #define FIONWRITE SIOCOUTQ
68: #endif
69:
70: #ifndef TIMER_RELTIME
71: #define TIMER_RELTIME 0
72: #endif
73:
74: #ifndef EV_EOF
75: #define EV_EOF 0x8000 /* EOF detected */
76: #endif
77: #ifndef EV_ERROR
78: #define EV_ERROR 0x4000 /* error, data contains errno */
79: #endif
80:
81: #ifndef __unused
82: #define __unused __attribute__((unused))
83: #endif
84:
1.17 misho 85: #ifndef __ELWIX
86: #define e_malloc malloc
87: #define e_calloc calloc
88: #define e_realloc realloc
89: #define e_free free
90: #define e_strdup strdup
91: #endif
92:
1.8 misho 93: #define MAX_TASK_MISS 12
1.1 misho 94:
95: #define LOGERR { \
96: sched_Errno = errno; \
97: strlcpy(sched_Error, strerror(errno), STRSIZ); \
98: }
99:
1.14 misho 100: #ifndef HAVE_LIBPTHREAD
101: #define pthread_mutex_lock(x)
102: #define pthread_mutex_unlock(x)
103: #endif
104:
1.16 misho 105: #define SCHED_QTRYLOCK(r, x) pthread_mutex_trylock(&(r)->root_mtx[(x)])
1.14 misho 106: #define SCHED_QLOCK(r, x) pthread_mutex_lock(&(r)->root_mtx[(x)])
107: #define SCHED_QUNLOCK(r, x) pthread_mutex_unlock(&(r)->root_mtx[(x)])
108:
1.4 misho 109: #define sched_timespecclear(tsp) ((tsp)->tv_sec = (tsp)->tv_nsec = 0)
110: #define sched_timespecinf(tsp) ((tsp)->tv_sec = (tsp)->tv_nsec = -1)
111: #define sched_timespecisinf(tsp) ((tsp)->tv_sec == -1 && (tsp)->tv_nsec == -1)
112: #define sched_timespecisset(tsp) (((tsp)->tv_sec && (tsp)->tv_sec != -1) || \
113: ((tsp)->tv_nsec && (tsp)->tv_nsec != -1))
114: #define sched_timespeccmp(tsp, usp, cmp) \
115: (((tsp)->tv_sec == (usp)->tv_sec) ? \
116: ((tsp)->tv_nsec cmp (usp)->tv_nsec) : \
117: ((tsp)->tv_sec cmp (usp)->tv_sec))
118: #define sched_timespecadd(tsp, usp, vsp) \
119: do { \
120: (vsp)->tv_sec = (tsp)->tv_sec + (usp)->tv_sec; \
121: (vsp)->tv_nsec = (tsp)->tv_nsec + (usp)->tv_nsec; \
122: if ((vsp)->tv_nsec >= 1000000000L) { \
123: (vsp)->tv_sec++; \
124: (vsp)->tv_nsec -= 1000000000L; \
125: } \
126: } while (0)
127: #define sched_timespecsub(tsp, usp, vsp) \
128: do { \
129: (vsp)->tv_sec = (tsp)->tv_sec - (usp)->tv_sec; \
130: (vsp)->tv_nsec = (tsp)->tv_nsec - (usp)->tv_nsec; \
131: if ((vsp)->tv_nsec < 0) { \
132: (vsp)->tv_sec--; \
133: (vsp)->tv_nsec += 1000000000L; \
134: } \
135: } while (0)
1.1 misho 136:
1.12 misho 137: #define sched_timespec2val(tsp, tvp) ((tvp)->tv_sec = (tsp)->tv_sec, \
138: (tvp)->tv_usec = (tsp)->tv_nsec / 1000)
139: #define sched_timeval2spec(tvp, tsp) ((tsp)->tv_sec = (tvp)->tv_sec, \
140: (tsp)->tv_nsec = (tvp)->tv_usec * 1000)
141:
142: #define sched_timevalclear(tvp) ((tvp)->tv_sec = (tvp)->tv_usec = 0)
143: #define sched_timevalinf(tvp) ((tvp)->tv_sec = (tvp)->tv_usec = -1)
144: #define sched_timevalisinf(tvp) ((tvp)->tv_sec == -1 && (tvp)->tv_usec == -1)
145: #define sched_timevalisset(tvp) (((tvp)->tv_sec && (tvp)->tv_sec != -1) || \
146: ((tvp)->tv_usec && (tvp)->tv_usec != -1))
147: #define sched_timevalcmp(tvp, uvp, cmp) \
148: (((tvp)->tv_sec == (uvp)->tv_sec) ? \
149: ((tvp)->tv_usec cmp (uvp)->tv_usec) : \
150: ((tvp)->tv_sec cmp (uvp)->tv_sec))
151: #define sched_timevaladd(tvp, uvp, vvp) \
152: do { \
153: (vvp)->tv_sec = (tvp)->tv_sec + (uvp)->tv_sec; \
154: (vvp)->tv_usec = (tvp)->tv_usec + (uvp)->tv_usec; \
155: if ((vvp)->tv_usec >= 1000000) { \
156: (vvp)->tv_sec++; \
157: (vvp)->tv_usec -= 1000000; \
158: } \
159: } while (0)
160: #define sched_timevalsub(tvp, uvp, vvp) \
161: do { \
162: (vvp)->tv_sec = (tvp)->tv_sec - (uvp)->tv_sec; \
163: (vvp)->tv_usec = (tvp)->tv_usec - (uvp)->tv_usec; \
164: if ((vvp)->tv_usec < 0) { \
165: (vvp)->tv_sec--; \
166: (vvp)->tv_usec += 1000000; \
167: } \
168: } while (0)
169:
170:
1.14 misho 171: #ifndef HAVE_STRLCAT
172: size_t strlcat(char * __restrict dst, const char * __restrict src, size_t siz);
173: #endif
174: #ifndef HAVE_STRLCPY
175: size_t strlcpy(char * __restrict dst, const char * __restrict src, size_t siz);
176: #endif
177:
178:
1.1 misho 179: extern int sched_Errno;
180: extern char sched_Error[];
181:
1.12 misho 182: void sched_SetErr(int, char *, ...);
1.1 misho 183:
1.14 misho 184:
1.18 ! misho 185: static inline struct timespec *
! 186: sched_timespecmin(struct timespec * __restrict spa, struct timespec * __restrict spb)
! 187: {
! 188: assert(spa && spb);
! 189:
! 190: if (sched_timespecisinf(spa))
! 191: return spb;
! 192: if (sched_timespecisinf(spb))
! 193: return spa;
! 194:
! 195: if (spa->tv_sec == spb->tv_sec)
! 196: return (spa->tv_nsec < spb->tv_nsec) ? spa : spb;
! 197: else
! 198: return (spa->tv_sec < spb->tv_sec) ? spa : spb;
! 199: }
! 200:
1.14 misho 201: static inline void
202: remove_task_from(sched_task_t * __restrict t, sched_queue_t * __restrict q)
203: {
204: assert(t && q);
205:
206: SCHED_QLOCK(TASK_ROOT(t), TASK_TYPE(t));
207: TAILQ_REMOVE(q, t, task_node);
208: SCHED_QUNLOCK(TASK_ROOT(t), TASK_TYPE(t));
209: }
210:
211: static inline void
212: insert_task_to(sched_task_t * __restrict t, sched_queue_t * __restrict q)
213: {
214: assert(t && q);
215:
216: SCHED_QLOCK(TASK_ROOT(t), TASK_TYPE(t));
217: TAILQ_INSERT_TAIL(q, t, task_node);
218: SCHED_QUNLOCK(TASK_ROOT(t), TASK_TYPE(t));
219: }
220:
221: static inline void
222: transit_task2unuse(sched_task_t * __restrict t, sched_queue_t * __restrict q)
223: {
224: assert(t && q);
225:
226: remove_task_from(t, q);
227:
228: TASK_UNLOCK(t);
229: TASK_TYPE(t) = taskUNUSE;
230: insert_task_to(t, &(TASK_ROOT(t))->root_unuse);
231: }
1.3 misho 232:
1.18 ! misho 233: static inline void
! 234: transit_task2ready(sched_task_t * __restrict t, sched_queue_t * __restrict q)
! 235: {
! 236: remove_task_from(t, q);
! 237:
! 238: t->task_type = taskREADY;
! 239: insert_task_to(t, &(TASK_ROOT(t))->root_ready);
! 240: }
! 241:
1.1 misho 242:
243: #endif
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to defs.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / libaitsched / inc