diff options
Diffstat (limited to 'alsa-lib/src/pcm/interval_inline.h')
-rw-r--r-- | alsa-lib/src/pcm/interval_inline.h | 157 |
1 files changed, 0 insertions, 157 deletions
diff --git a/alsa-lib/src/pcm/interval_inline.h b/alsa-lib/src/pcm/interval_inline.h deleted file mode 100644 index bf6b784..0000000 --- a/alsa-lib/src/pcm/interval_inline.h +++ /dev/null @@ -1,157 +0,0 @@ -/* - * Interval inlines - * Copyright (c) 2000 by Abramo Bagnara <abramo@alsa-project.org> - * - * - * This library is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as - * published by the Free Software Foundation; either version 2.1 of - * the License, or (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public - * License along with this library; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA - * - */ - -#define INTERVAL_INLINE static inline - -INTERVAL_INLINE void snd_interval_any(snd_interval_t *i) -{ - i->min = 0; - i->openmin = 0; - i->max = UINT_MAX; - i->openmax = 0; - i->integer = 0; - i->empty = 0; -} - -INTERVAL_INLINE void snd_interval_none(snd_interval_t *i) -{ - i->empty = 1; -} - -INTERVAL_INLINE int snd_interval_checkempty(const snd_interval_t *i) -{ - return (i->min > i->max || - (i->min == i->max && (i->openmin || i->openmax))); -} - -INTERVAL_INLINE int snd_interval_empty(const snd_interval_t *i) -{ - return i->empty; -} - -INTERVAL_INLINE int snd_interval_single(const snd_interval_t *i) -{ - assert(!snd_interval_empty(i)); - return (i->min == i->max || - (i->min + 1 == i->max && i->openmax)); -} - -INTERVAL_INLINE int snd_interval_value(const snd_interval_t *i) -{ - assert(snd_interval_single(i)); - return i->min; -} - -INTERVAL_INLINE void snd_interval_set_value(snd_interval_t *i, unsigned int val) -{ - i->openmax = i->openmin = 0; - i->min = i->max = val; - i->integer = 0; - i->empty = 0; -} - -INTERVAL_INLINE int snd_interval_min(const snd_interval_t *i) -{ - assert(!snd_interval_empty(i)); - return i->min; -} - -INTERVAL_INLINE int snd_interval_max(const snd_interval_t *i) -{ - assert(!snd_interval_empty(i)); - return i->max; -} - -INTERVAL_INLINE void snd_interval_set_minmax(snd_interval_t *i, unsigned int min, unsigned int max) -{ - i->openmax = i->openmin = 0; - i->min = min; - i->max = max; - i->integer = 0; - i->empty = 0; -} - -INTERVAL_INLINE int snd_interval_test(const snd_interval_t *i, unsigned int val) -{ - return !((i->min > val || (i->min == val && i->openmin) || - i->max < val || (i->max == val && i->openmax))); -} - -INTERVAL_INLINE void snd_interval_copy(snd_interval_t *d, const snd_interval_t *s) -{ - *d = *s; -} - -INTERVAL_INLINE int snd_interval_setinteger(snd_interval_t *i) -{ - if (i->integer) - return 0; - if (i->openmin && i->openmax && i->min == i->max) - return -EINVAL; - i->integer = 1; - return 1; -} - -INTERVAL_INLINE void snd_interval_floor(snd_interval_t *i) -{ - if (i->integer || snd_interval_empty(i)) - return; - i->openmin = 0; - if (i->openmax) { - i->max--; - i->openmax = 0; - } - i->integer = 1; -} - -INTERVAL_INLINE void snd_interval_unfloor(snd_interval_t *i) -{ - if (snd_interval_empty(i)) - return; - if (i->max == UINT_MAX) - return; - if (i->openmax) - return; - i->max++; - i->openmax = 1; - i->integer = 0; -} - - -INTERVAL_INLINE int snd_interval_always_eq(const snd_interval_t *i1, const snd_interval_t *i2) -{ - return snd_interval_single(i1) && snd_interval_single(i2) && - snd_interval_value(i1) == snd_interval_value(i2); -} - -INTERVAL_INLINE int snd_interval_never_eq(const snd_interval_t *i1, const snd_interval_t *i2) -{ - - return (i1->max < i2->min || - (i1->max == i2->min && - (i1->openmax || i1->openmin)) || - i1->min > i2->max || - (i1->min == i2->max && - (i1->openmin || i2->openmax))); -} - - - |