1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
#include <string.h>
#include "midimonster.h"
#include "backend.h"
static size_t nbackends = 0;
static backend* backends = NULL;
static size_t ninstances = 0;
static instance** instances = NULL;
instance* mm_instance(){
instance** new_inst = realloc(instances, (ninstances + 1) * sizeof(instance*));
if(!new_inst){
//TODO free
fprintf(stderr, "Failed to allocate memory\n");
ninstances = 0;
return NULL;
}
instances = new_inst;
instances[ninstances] = calloc(1, sizeof(instance));
if(!instances[ninstances]){
fprintf(stderr, "Failed to allocate memory\n");
return NULL;
}
return instances[ninstances++];
}
int mm_backend_instances(char* name, size_t* ninst, instance*** inst){
backend* b = backend_match(name);
size_t n = 0, u;
//count number of affected instances
for(u = 0; u < ninstances; u++){
if(instances[u]->backend == b){
n++;
}
}
*ninst = n;
*inst = calloc(n, sizeof(instance*));
if(!*inst){
fprintf(stderr, "Failed to allocate memory\n");
return 1;
}
n = 0;
for(u = 0; u < ninstances; u++){
if(instances[u]->backend == b){
(*inst)[n] = instances[u];
n++;
}
}
return 0;
}
void instances_free(){
size_t u;
for(u = 0; u < ninstances; u++){
free(instances[u]->name);
instances[u]->name = NULL;
instances[u]->backend = NULL;
free(instances[u]);
instances[u] = NULL;
}
free(instances);
ninstances = 0;
}
backend* backend_match(char* name){
size_t u;
for(u = 0; u < nbackends; u++){
if(!strcmp(backends[u].name, name)){
return backends + u;
}
}
return NULL;
}
instance* instance_match(char* name){
size_t u;
for(u = 0; u < ninstances; u++){
if(!strcmp(instances[u]->name, name)){
return instances[u];
}
}
return NULL;
}
int mm_backend_register(backend b){
if(!backend_match(b.name)){
backends = realloc(backends, (nbackends + 1) * sizeof(backend));
if(!backends){
fprintf(stderr, "Failed to allocate memory\n");
nbackends = 0;
return 1;
}
backends[nbackends] = b;
nbackends++;
fprintf(stderr, "Registered backend %s\n", b.name);
return 0;
}
return 1;
}
int backends_start(){
int rv = 0;
size_t u;
for(u = 0; u < nbackends; u++){
rv |= backends[u].start();
}
return rv;
}
int backends_stop(){
size_t u;
for(u = 0; u < nbackends; u++){
backends[u].shutdown();
}
free(backends);
nbackends = 0;
return 0;
}
|
