alsa-lib/src/pcm/interval_inline.h

145 lines
3 KiB
C
Raw Normal View History

2000-12-21 20:44:10 +00:00
/*
* 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 Library General Public License as
* published by the Free Software Foundation; either version 2 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 Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*/
#ifdef INTERVAL_C
#define INLINE inline
#else
#define INLINE extern inline
2000-12-21 20:44:10 +00:00
#endif
INLINE void interval_any(interval_t *i)
2000-12-21 20:44:10 +00:00
{
i->min = 0;
i->openmin = 0;
2000-12-21 20:44:10 +00:00
i->max = UINT_MAX;
i->openmax = 0;
i->integer = 0;
i->empty = 0;
}
INLINE void interval_none(interval_t *i)
{
i->empty = 1;
2000-12-21 20:44:10 +00:00
}
2000-12-23 10:14:15 +00:00
INLINE int interval_checkempty(const interval_t *i)
{
return (i->min > i->max ||
(i->min == i->max && (i->openmin || i->openmax)));
}
2000-12-21 20:44:10 +00:00
INLINE int interval_empty(const interval_t *i)
{
return i->empty;
}
INLINE int interval_single(const interval_t *i)
{
assert(!interval_empty(i));
return (i->min == i->max ||
(i->min + 1 == i->max && i->openmax));
}
INLINE int interval_value(const interval_t *i)
{
assert(interval_single(i));
return i->min;
}
INLINE int interval_min(const interval_t *i)
{
assert(!interval_empty(i));
return i->min;
}
INLINE int interval_max(const interval_t *i)
{
assert(!interval_empty(i));
return i->max;
2000-12-21 20:44:10 +00:00
}
INLINE int interval_test(const interval_t *i, unsigned int val)
{
return !((i->min > val || (i->min == val && i->openmin) ||
i->max < val || (i->max == val && i->openmax)));
}
INLINE void interval_copy(interval_t *d, const interval_t *s)
{
*d = *s;
}
INLINE int interval_setinteger(interval_t *i)
{
if (i->integer)
return 0;
if (i->openmin && i->openmax && i->min == i->max)
return -EINVAL;
i->integer = 1;
return 1;
}
2001-01-19 18:28:50 +00:00
INLINE void interval_floor(interval_t *i)
2000-12-21 20:44:10 +00:00
{
2001-01-19 16:19:29 +00:00
if (i->integer || interval_empty(i))
return;
i->openmin = 0;
2001-01-19 18:28:50 +00:00
if (i->openmax) {
i->max--;
i->openmax = 0;
}
i->integer = 1;
}
2001-01-19 18:28:50 +00:00
INLINE void interval_unfloor(interval_t *i)
{
if (interval_empty(i))
return;
if (i->max == UINT_MAX)
return;
if (i->openmax)
return;
i->max++;
i->openmax = 1;
i->integer = 0;
}
INLINE int interval_always_eq(const interval_t *i1, const interval_t *i2)
{
return interval_single(i1) && interval_single(i2) &&
interval_value(i1) == interval_value(i2);
2000-12-21 20:44:10 +00:00
}
INLINE int interval_never_eq(const interval_t *i1, const interval_t *i2)
2000-12-21 20:44:10 +00:00
{
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)));
2000-12-21 20:44:10 +00:00
}