mirror of
https://gitlab.freedesktop.org/pipewire/pipewire.git
synced 2025-11-02 09:01:50 -05:00
d2f877912a
Make real spa_graph nodes and ports and schedule those. This makes it possible to add explicit tee and mixers in the real graph. Rework the way we add and remove ports and nodes from the graph. Remove confusing pw_port_link and merge core with pw_link_new() Move scheduling in separate files, add some more graph-schedulers.
87 lines
2.5 KiB
C
87 lines
2.5 KiB
C
/* Simple Plugin API
|
|
* Copyright (C) 2016 Wim Taymans <wim.taymans@gmail.com>
|
|
*
|
|
* 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 library 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., 51 Franklin St, Fifth Floor,
|
|
* Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#ifndef __SPA_LIST_H__
|
|
#define __SPA_LIST_H__
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#include <spa/defs.h>
|
|
|
|
struct spa_list {
|
|
struct spa_list *next;
|
|
struct spa_list *prev;
|
|
};
|
|
|
|
static inline void spa_list_init(struct spa_list *list)
|
|
{
|
|
list->next = list;
|
|
list->prev = list;
|
|
}
|
|
|
|
static inline void spa_list_insert(struct spa_list *list, struct spa_list *elem)
|
|
{
|
|
elem->prev = list;
|
|
elem->next = list->next;
|
|
list->next = elem;
|
|
elem->next->prev = elem;
|
|
}
|
|
|
|
static inline void spa_list_insert_list(struct spa_list *list, struct spa_list *other)
|
|
{
|
|
other->next->prev = list;
|
|
other->prev->next = list->next;
|
|
list->next->prev = other->prev;
|
|
list->next = other->next;
|
|
}
|
|
|
|
static inline void spa_list_remove(struct spa_list *elem)
|
|
{
|
|
elem->prev->next = elem->next;
|
|
elem->next->prev = elem->prev;
|
|
}
|
|
|
|
#define spa_list_is_empty(l) ((l)->next == (l))
|
|
|
|
#define spa_list_first(head, type, member) \
|
|
SPA_CONTAINER_OF((head)->next, type, member)
|
|
|
|
#define spa_list_last(item, type, member) \
|
|
SPA_CONTAINER_OF((head)->prev, type, member)
|
|
|
|
#define spa_list_for_each(pos, head, member) \
|
|
for (pos = SPA_CONTAINER_OF((head)->next, __typeof__(*pos), member); \
|
|
&pos->member != (head); \
|
|
pos = SPA_CONTAINER_OF(pos->member.next, __typeof__(*pos), member))
|
|
|
|
#define spa_list_for_each_safe(pos, tmp, head, member) \
|
|
for (pos = SPA_CONTAINER_OF((head)->next, __typeof__(*pos), member), \
|
|
tmp = SPA_CONTAINER_OF((pos)->member.next, __typeof__(*tmp), member); \
|
|
&pos->member != (head); \
|
|
pos = tmp, \
|
|
tmp = SPA_CONTAINER_OF(pos->member.next, __typeof__(*tmp), member))
|
|
|
|
|
|
#ifdef __cplusplus
|
|
} /* extern "C" */
|
|
#endif
|
|
|
|
#endif /* __SPA_LIST_H__ */
|