libaitsched/inc/defs.h - view

File: [ELWIX - Embedded LightWeight unIX -] / libaitsched / inc / defs.h
Revision 1.16: download - view: text, annotated - select for diffs - revision graph
Wed Jul 22 19:50:45 2015 UTC (9 years, 3 months ago) by misho
Branches: MAIN
CVS tags: sched6_9, sched6_8, sched6_7, sched6_6, sched6_5, sched6_4, sched6_3, SCHED6_8, SCHED6_7, SCHED6_6, SCHED6_5, SCHED6_4, SCHED6_3, SCHED6_2, HEAD

version 6.2

1: /************************************************************************* 2: * (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com> 3: * by Michael Pounov <misho@openbsd-bg.org> 4: * 5: * $Author: misho $ 6: * $Id: defs.h,v 1.16 2015/07/22 19:50:45 misho Exp $ 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: 15: Copyright 2004 - 2015 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: 50: #ifndef STRSIZ 51: #define STRSIZ 256 52: #endif 53: 54: #ifndef KQ_EVENTS 55: #define KQ_EVENTS 32 56: #endif 57: 58: #ifndef EV_EOF 59: #define EV_EOF 0x8000 60: #endif 61: 62: #ifndef SIGRTMIN 63: #define SIGRTMIN 65 64: #endif 65: 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: 85: #define MAX_TASK_MISS 12 86: 87: #define LOGERR { \ 88: sched_Errno = errno; \ 89: strlcpy(sched_Error, strerror(errno), STRSIZ); \ 90: } 91: 92: #ifndef HAVE_LIBPTHREAD 93: #define pthread_mutex_lock(x) 94: #define pthread_mutex_unlock(x) 95: #endif 96: 97: #define SCHED_QTRYLOCK(r, x) pthread_mutex_trylock(&(r)->root_mtx[(x)]) 98: #define SCHED_QLOCK(r, x) pthread_mutex_lock(&(r)->root_mtx[(x)]) 99: #define SCHED_QUNLOCK(r, x) pthread_mutex_unlock(&(r)->root_mtx[(x)]) 100: 101: #define sched_timespecclear(tsp) ((tsp)->tv_sec = (tsp)->tv_nsec = 0) 102: #define sched_timespecinf(tsp) ((tsp)->tv_sec = (tsp)->tv_nsec = -1) 103: #define sched_timespecisinf(tsp) ((tsp)->tv_sec == -1 && (tsp)->tv_nsec == -1) 104: #define sched_timespecisset(tsp) (((tsp)->tv_sec && (tsp)->tv_sec != -1) || \ 105: ((tsp)->tv_nsec && (tsp)->tv_nsec != -1)) 106: #define sched_timespeccmp(tsp, usp, cmp) \ 107: (((tsp)->tv_sec == (usp)->tv_sec) ? \ 108: ((tsp)->tv_nsec cmp (usp)->tv_nsec) : \ 109: ((tsp)->tv_sec cmp (usp)->tv_sec)) 110: #define sched_timespecadd(tsp, usp, vsp) \ 111: do { \ 112: (vsp)->tv_sec = (tsp)->tv_sec + (usp)->tv_sec; \ 113: (vsp)->tv_nsec = (tsp)->tv_nsec + (usp)->tv_nsec; \ 114: if ((vsp)->tv_nsec >= 1000000000L) { \ 115: (vsp)->tv_sec++; \ 116: (vsp)->tv_nsec -= 1000000000L; \ 117: } \ 118: } while (0) 119: #define sched_timespecsub(tsp, usp, vsp) \ 120: do { \ 121: (vsp)->tv_sec = (tsp)->tv_sec - (usp)->tv_sec; \ 122: (vsp)->tv_nsec = (tsp)->tv_nsec - (usp)->tv_nsec; \ 123: if ((vsp)->tv_nsec < 0) { \ 124: (vsp)->tv_sec--; \ 125: (vsp)->tv_nsec += 1000000000L; \ 126: } \ 127: } while (0) 128: 129: #define sched_timespec2val(tsp, tvp) ((tvp)->tv_sec = (tsp)->tv_sec, \ 130: (tvp)->tv_usec = (tsp)->tv_nsec / 1000) 131: #define sched_timeval2spec(tvp, tsp) ((tsp)->tv_sec = (tvp)->tv_sec, \ 132: (tsp)->tv_nsec = (tvp)->tv_usec * 1000) 133: 134: #define sched_timevalclear(tvp) ((tvp)->tv_sec = (tvp)->tv_usec = 0) 135: #define sched_timevalinf(tvp) ((tvp)->tv_sec = (tvp)->tv_usec = -1) 136: #define sched_timevalisinf(tvp) ((tvp)->tv_sec == -1 && (tvp)->tv_usec == -1) 137: #define sched_timevalisset(tvp) (((tvp)->tv_sec && (tvp)->tv_sec != -1) || \ 138: ((tvp)->tv_usec && (tvp)->tv_usec != -1)) 139: #define sched_timevalcmp(tvp, uvp, cmp) \ 140: (((tvp)->tv_sec == (uvp)->tv_sec) ? \ 141: ((tvp)->tv_usec cmp (uvp)->tv_usec) : \ 142: ((tvp)->tv_sec cmp (uvp)->tv_sec)) 143: #define sched_timevaladd(tvp, uvp, vvp) \ 144: do { \ 145: (vvp)->tv_sec = (tvp)->tv_sec + (uvp)->tv_sec; \ 146: (vvp)->tv_usec = (tvp)->tv_usec + (uvp)->tv_usec; \ 147: if ((vvp)->tv_usec >= 1000000) { \ 148: (vvp)->tv_sec++; \ 149: (vvp)->tv_usec -= 1000000; \ 150: } \ 151: } while (0) 152: #define sched_timevalsub(tvp, uvp, vvp) \ 153: do { \ 154: (vvp)->tv_sec = (tvp)->tv_sec - (uvp)->tv_sec; \ 155: (vvp)->tv_usec = (tvp)->tv_usec - (uvp)->tv_usec; \ 156: if ((vvp)->tv_usec < 0) { \ 157: (vvp)->tv_sec--; \ 158: (vvp)->tv_usec += 1000000; \ 159: } \ 160: } while (0) 161: 162: 163: #ifndef HAVE_STRLCAT 164: size_t strlcat(char * __restrict dst, const char * __restrict src, size_t siz); 165: #endif 166: #ifndef HAVE_STRLCPY 167: size_t strlcpy(char * __restrict dst, const char * __restrict src, size_t siz); 168: #endif 169: 170: 171: extern int sched_Errno; 172: extern char sched_Error[]; 173: 174: void sched_SetErr(int, char *, ...); 175: 176: 177: static inline void 178: remove_task_from(sched_task_t * __restrict t, sched_queue_t * __restrict q) 179: { 180: assert(t && q); 181: 182: SCHED_QLOCK(TASK_ROOT(t), TASK_TYPE(t)); 183: TAILQ_REMOVE(q, t, task_node); 184: SCHED_QUNLOCK(TASK_ROOT(t), TASK_TYPE(t)); 185: } 186: 187: static inline void 188: insert_task_to(sched_task_t * __restrict t, sched_queue_t * __restrict q) 189: { 190: assert(t && q); 191: 192: SCHED_QLOCK(TASK_ROOT(t), TASK_TYPE(t)); 193: TAILQ_INSERT_TAIL(q, t, task_node); 194: SCHED_QUNLOCK(TASK_ROOT(t), TASK_TYPE(t)); 195: } 196: 197: static inline void 198: transit_task2unuse(sched_task_t * __restrict t, sched_queue_t * __restrict q) 199: { 200: assert(t && q); 201: 202: remove_task_from(t, q); 203: 204: TASK_UNLOCK(t); 205: TASK_TYPE(t) = taskUNUSE; 206: insert_task_to(t, &(TASK_ROOT(t))->root_unuse); 207: } 208: 209: 210: #endif