mirror of
https://github.com/alsa-project/alsa-lib.git
synced 2025-11-04 13:30:08 -05:00
Added snd_ prefix to mask and interval. Divided header.h wrappers
This commit is contained in:
parent
9712a67778
commit
8712ffc6a5
28 changed files with 1122 additions and 1122 deletions
|
|
@ -19,13 +19,13 @@
|
|||
*
|
||||
*/
|
||||
|
||||
#ifdef INTERVAL_C
|
||||
#ifdef SND_INTERVAL_C
|
||||
#define INLINE inline
|
||||
#else
|
||||
#define INLINE extern inline
|
||||
#endif
|
||||
|
||||
INLINE void interval_any(interval_t *i)
|
||||
INLINE void snd_interval_any(snd_interval_t *i)
|
||||
{
|
||||
i->min = 0;
|
||||
i->openmin = 0;
|
||||
|
|
@ -35,59 +35,59 @@ INLINE void interval_any(interval_t *i)
|
|||
i->empty = 0;
|
||||
}
|
||||
|
||||
INLINE void interval_none(interval_t *i)
|
||||
INLINE void snd_interval_none(snd_interval_t *i)
|
||||
{
|
||||
i->empty = 1;
|
||||
}
|
||||
|
||||
INLINE int interval_checkempty(const interval_t *i)
|
||||
INLINE int snd_interval_checkempty(const snd_interval_t *i)
|
||||
{
|
||||
return (i->min > i->max ||
|
||||
(i->min == i->max && (i->openmin || i->openmax)));
|
||||
}
|
||||
|
||||
INLINE int interval_empty(const interval_t *i)
|
||||
INLINE int snd_interval_empty(const snd_interval_t *i)
|
||||
{
|
||||
return i->empty;
|
||||
}
|
||||
|
||||
INLINE int interval_single(const interval_t *i)
|
||||
INLINE int snd_interval_single(const snd_interval_t *i)
|
||||
{
|
||||
assert(!interval_empty(i));
|
||||
assert(!snd_interval_empty(i));
|
||||
return (i->min == i->max ||
|
||||
(i->min + 1 == i->max && i->openmax));
|
||||
}
|
||||
|
||||
INLINE int interval_value(const interval_t *i)
|
||||
INLINE int snd_interval_value(const snd_interval_t *i)
|
||||
{
|
||||
assert(interval_single(i));
|
||||
assert(snd_interval_single(i));
|
||||
return i->min;
|
||||
}
|
||||
|
||||
INLINE int interval_min(const interval_t *i)
|
||||
INLINE int snd_interval_min(const snd_interval_t *i)
|
||||
{
|
||||
assert(!interval_empty(i));
|
||||
assert(!snd_interval_empty(i));
|
||||
return i->min;
|
||||
}
|
||||
|
||||
INLINE int interval_max(const interval_t *i)
|
||||
INLINE int snd_interval_max(const snd_interval_t *i)
|
||||
{
|
||||
assert(!interval_empty(i));
|
||||
assert(!snd_interval_empty(i));
|
||||
return i->max;
|
||||
}
|
||||
|
||||
INLINE int interval_test(const interval_t *i, unsigned int val)
|
||||
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)));
|
||||
}
|
||||
|
||||
INLINE void interval_copy(interval_t *d, const interval_t *s)
|
||||
INLINE void snd_interval_copy(snd_interval_t *d, const snd_interval_t *s)
|
||||
{
|
||||
*d = *s;
|
||||
}
|
||||
|
||||
INLINE int interval_setinteger(interval_t *i)
|
||||
INLINE int snd_interval_setinteger(snd_interval_t *i)
|
||||
{
|
||||
if (i->integer)
|
||||
return 0;
|
||||
|
|
@ -97,9 +97,9 @@ INLINE int interval_setinteger(interval_t *i)
|
|||
return 1;
|
||||
}
|
||||
|
||||
INLINE void interval_floor(interval_t *i)
|
||||
INLINE void snd_interval_floor(snd_interval_t *i)
|
||||
{
|
||||
if (i->integer || interval_empty(i))
|
||||
if (i->integer || snd_interval_empty(i))
|
||||
return;
|
||||
i->openmin = 0;
|
||||
if (i->openmax) {
|
||||
|
|
@ -109,9 +109,9 @@ INLINE void interval_floor(interval_t *i)
|
|||
i->integer = 1;
|
||||
}
|
||||
|
||||
INLINE void interval_unfloor(interval_t *i)
|
||||
INLINE void snd_interval_unfloor(snd_interval_t *i)
|
||||
{
|
||||
if (interval_empty(i))
|
||||
if (snd_interval_empty(i))
|
||||
return;
|
||||
if (i->max == UINT_MAX)
|
||||
return;
|
||||
|
|
@ -123,13 +123,13 @@ INLINE void interval_unfloor(interval_t *i)
|
|||
}
|
||||
|
||||
|
||||
INLINE int interval_always_eq(const interval_t *i1, const interval_t *i2)
|
||||
INLINE int snd_interval_always_eq(const snd_interval_t *i1, const snd_interval_t *i2)
|
||||
{
|
||||
return interval_single(i1) && interval_single(i2) &&
|
||||
interval_value(i1) == interval_value(i2);
|
||||
return snd_interval_single(i1) && snd_interval_single(i2) &&
|
||||
snd_interval_value(i1) == snd_interval_value(i2);
|
||||
}
|
||||
|
||||
INLINE int interval_never_eq(const interval_t *i1, const interval_t *i2)
|
||||
INLINE int snd_interval_never_eq(const snd_interval_t *i1, const snd_interval_t *i2)
|
||||
{
|
||||
|
||||
return (i1->max < i2->min ||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue