mirror of
https://gitlab.freedesktop.org/pipewire/pipewire.git
synced 2025-10-31 22:25:38 -04:00
graph: fix the API a little
Add test for atomic graph updates
This commit is contained in:
Wim Taymans
parent
c3d63983e1
commit
eba2b82c8e
5 changed files with 368 additions and 97 deletions
|
|
@ -10,6 +10,10 @@ executable('test-graph', 'test-graph.c',
|
|||
include_directories : [spa_inc ],
|
||||
dependencies : [dl_lib, pthread_lib],
|
||||
install : false)
|
||||
executable('test-graph2', 'test-graph2.c',
|
||||
include_directories : [spa_inc ],
|
||||
dependencies : [dl_lib, pthread_lib],
|
||||
install : false)
|
||||
executable('test-perf', 'test-perf.c',
|
||||
include_directories : [spa_inc, spa_libinc ],
|
||||
dependencies : [dl_lib, pthread_lib],
|
||||
|
|
|
|||
260
spa/tests/test-graph2.c
Normal file
260
spa/tests/test-graph2.c
Normal file
|
|
@ -0,0 +1,260 @@
|
|||
/* Spa
|
||||
* Copyright (C) 2017 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.
|
||||
*/
|
||||
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <dlfcn.h>
|
||||
#include <errno.h>
|
||||
#include <pthread.h>
|
||||
#include <poll.h>
|
||||
|
||||
#include <spa/node.h>
|
||||
#include <spa/log.h>
|
||||
#include <spa/log-impl.h>
|
||||
#include <spa/loop.h>
|
||||
#include <spa/type-map.h>
|
||||
#include <spa/type-map-impl.h>
|
||||
#include <spa/audio/format-utils.h>
|
||||
#include <spa/format-utils.h>
|
||||
#include <spa/format-builder.h>
|
||||
#include <spa/graph.h>
|
||||
#include <spa/graph-scheduler1.h>
|
||||
|
||||
static SPA_TYPE_MAP_IMPL(default_map, 4096);
|
||||
static SPA_LOG_IMPL(default_log);
|
||||
|
||||
struct type {
|
||||
uint32_t node;
|
||||
};
|
||||
|
||||
static inline void init_type(struct type *type, struct spa_type_map *map)
|
||||
{
|
||||
type->node = spa_type_map_get_id(map, SPA_TYPE__Node);
|
||||
}
|
||||
|
||||
struct version {
|
||||
uint16_t current;
|
||||
uint16_t pending;
|
||||
};
|
||||
|
||||
struct data {
|
||||
struct spa_type_map *map;
|
||||
struct spa_log *log;
|
||||
struct spa_loop data_loop;
|
||||
struct type type;
|
||||
|
||||
int writers;
|
||||
struct version version;
|
||||
struct spa_graph graph[2];
|
||||
|
||||
struct spa_graph_node source_node[2];
|
||||
struct spa_graph_port source_out[2];
|
||||
struct spa_graph_port volume_in[2];
|
||||
struct spa_graph_node volume_node[2];
|
||||
struct spa_graph_port volume_out[2];
|
||||
struct spa_graph_port sink_in[2];
|
||||
struct spa_graph_node sink_node[2];
|
||||
};
|
||||
|
||||
static int copy_graph(struct data *data, int current)
|
||||
{
|
||||
int c = (current)&1;
|
||||
int v = (current+1)&1;
|
||||
struct spa_graph *ng, *og;
|
||||
struct spa_graph_node *nn, *on;
|
||||
struct spa_graph_port *np, *op;
|
||||
int d;
|
||||
|
||||
d = (v - c);
|
||||
|
||||
og = &data->graph[c];
|
||||
ng = &data->graph[v];
|
||||
spa_list_init(&ng->nodes);
|
||||
|
||||
printf("copy graph %d -> %d\n", c, v);
|
||||
spa_list_for_each(on, &og->nodes, link) {
|
||||
nn = &on[d];
|
||||
*nn = *on;
|
||||
spa_list_append(&ng->nodes, &nn->link);
|
||||
|
||||
spa_list_init(&nn->ports[SPA_DIRECTION_INPUT]);
|
||||
spa_list_for_each(op, &on->ports[SPA_DIRECTION_INPUT], link) {
|
||||
np = &op[d];
|
||||
*np = *op;
|
||||
np->node = nn;
|
||||
np->peer = &op->peer[d];
|
||||
spa_list_append(&nn->ports[SPA_DIRECTION_INPUT], &np->link);
|
||||
}
|
||||
|
||||
spa_list_init(&nn->ports[SPA_DIRECTION_OUTPUT]);
|
||||
spa_list_for_each(op, &on->ports[SPA_DIRECTION_OUTPUT], link) {
|
||||
np = &op[d];
|
||||
*np = *op;
|
||||
np->node = nn;
|
||||
np->peer = &op->peer[d];
|
||||
spa_list_append(&nn->ports[SPA_DIRECTION_OUTPUT], &np->link);
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int start_write(struct data *data)
|
||||
{
|
||||
if (data->writers++ == 0) {
|
||||
printf("writer start %d %d\n", data->version.current, data->version.pending);
|
||||
if (data->version.current == data->version.pending)
|
||||
copy_graph(data, data->version.current);
|
||||
data->version.pending = data->version.current;
|
||||
}
|
||||
return (data->version.current + 1) & 1;
|
||||
}
|
||||
|
||||
static int end_write(struct data *data)
|
||||
{
|
||||
if (--data->writers == 0) {
|
||||
data->version.pending++;
|
||||
printf("writer end %d %d\n", data->version.current, data->version.pending);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static bool switch_graph(struct data *data)
|
||||
{
|
||||
bool res = data->version.current != data->version.pending;
|
||||
if (res) {
|
||||
printf("switch graph %d -> %d\n", data->version.current, data->version.pending);
|
||||
data->version.current = data->version.pending;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
static int print_graph(struct data *data, int v)
|
||||
{
|
||||
struct spa_graph *g;
|
||||
struct spa_graph_node *n;
|
||||
struct spa_graph_port *p;
|
||||
|
||||
g = &data->graph[v];
|
||||
printf("graph %p (version %d):\n", g, v);
|
||||
|
||||
spa_list_for_each(n, &g->nodes, link) {
|
||||
printf(" node %p\n", n);
|
||||
spa_list_for_each(p, &n->ports[SPA_DIRECTION_INPUT], link) {
|
||||
printf(" in: %p -> %p\n", p, p->peer);
|
||||
}
|
||||
spa_list_for_each(p, &n->ports[SPA_DIRECTION_OUTPUT], link) {
|
||||
printf(" out: %p -> %p\n", p, p->peer);
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int make_graph1(struct data *data)
|
||||
{
|
||||
int v = start_write(data);
|
||||
|
||||
spa_graph_node_init(&data->source_node[v]);
|
||||
spa_graph_node_add(&data->graph[v], &data->source_node[v]);
|
||||
spa_graph_port_add(&data->source_node[v], &data->source_out[v]);
|
||||
|
||||
spa_graph_node_init(&data->volume_node[v]);
|
||||
spa_graph_node_add(&data->graph[v], &data->volume_node[v]);
|
||||
spa_graph_port_add(&data->volume_node[v], &data->volume_in[v]);
|
||||
|
||||
spa_graph_port_link(&data->source_out[v], &data->volume_in[v]);
|
||||
|
||||
spa_graph_port_add(&data->volume_node[v], &data->volume_out[v]);
|
||||
|
||||
spa_graph_node_init(&data->sink_node[v]);
|
||||
spa_graph_node_add(&data->graph[v], &data->sink_node[v]);
|
||||
spa_graph_port_add(&data->sink_node[v], &data->sink_in[v]);
|
||||
|
||||
spa_graph_port_link(&data->volume_out[v], &data->sink_in[v]);
|
||||
|
||||
end_write(data);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int make_graph2(struct data *data)
|
||||
{
|
||||
int v = start_write(data);
|
||||
|
||||
spa_graph_port_unlink(&data->volume_in[v]);
|
||||
spa_graph_port_unlink(&data->volume_out[v]);
|
||||
spa_graph_node_remove(&data->volume_node[v]);
|
||||
|
||||
spa_graph_port_link(&data->source_out[v], &data->sink_in[v]);
|
||||
|
||||
end_write(data);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int make_graph3(struct data *data)
|
||||
{
|
||||
int v = start_write(data);
|
||||
|
||||
spa_graph_port_unlink(&data->source_out[v]);
|
||||
|
||||
spa_graph_node_add(&data->graph[v], &data->volume_node[v]);
|
||||
|
||||
spa_graph_port_link(&data->source_out[v], &data->volume_in[v]);
|
||||
spa_graph_port_link(&data->volume_out[v], &data->sink_in[v]);
|
||||
|
||||
end_write(data);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
struct data data = { NULL };
|
||||
const char *str;
|
||||
|
||||
spa_graph_init(&data.graph[0]);
|
||||
spa_graph_init(&data.graph[1]);
|
||||
|
||||
data.map = &default_map.map;
|
||||
data.log = &default_log.log;
|
||||
|
||||
if ((str = getenv("SPA_DEBUG")))
|
||||
data.log->level = atoi(str);
|
||||
|
||||
init_type(&data.type, data.map);
|
||||
|
||||
print_graph(&data, 0);
|
||||
print_graph(&data, 1);
|
||||
make_graph1(&data);
|
||||
print_graph(&data, 0);
|
||||
print_graph(&data, 1);
|
||||
switch_graph(&data);
|
||||
print_graph(&data, 0);
|
||||
print_graph(&data, 1);
|
||||
make_graph2(&data);
|
||||
print_graph(&data, 0);
|
||||
print_graph(&data, 1);
|
||||
switch_graph(&data);
|
||||
make_graph3(&data);
|
||||
print_graph(&data, 0);
|
||||
print_graph(&data, 1);
|
||||
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue