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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* Copyright (C) 2018 "IoT.bzh"
* Author : Thierry Bultel <thierry.bultel@iot.bzh>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <malloc.h>
#include "hal-bluealsa-transports.h"
static bool halBlueAlsaTransportMatch(
const struct ba_msg_transport * transport1,
const struct ba_msg_transport * transport2);
int halBlueAlsaTransportsInit(bluealsa_transport_t * list) {
CDS_INIT_LIST_HEAD(&list->list);
return 0;
}
bluealsa_transport_t * halBlueAlsaTransportsAdd(
const bluealsa_watch * watch,
bluealsa_transport_t * list,
const struct ba_msg_transport * transport) {
bluealsa_transport_t * newTransport = (bluealsa_transport_t*) calloc(1, sizeof(bluealsa_transport_t));
if (newTransport == NULL)
goto fail;
memcpy(&newTransport->transport, transport, sizeof(struct ba_msg_transport));
newTransport->watch = watch;
CDS_INIT_LIST_HEAD(&newTransport->list);
cds_list_add(&newTransport->list, &list->list);
return newTransport;
fail:
return NULL;
}
bool halBlueAlsaTransportFind(
const bluealsa_watch * watch,
bluealsa_transport_t * list,
const struct ba_msg_transport * transport) {
bluealsa_transport_t *tmp;
bool found = false;
cds_list_for_each_entry(tmp, &list->list, list) {
struct ba_msg_transport * _transport = &tmp->transport;
if (watch != tmp->watch)
continue;
if (!halBlueAlsaTransportMatch(_transport, transport))
continue;
found = true;
break;
}
return found;
}
int halBlueAlsaTransportUpdate(
const bluealsa_watch * watch,
bluealsa_transport_t * list,
const struct ba_msg_transport *transports,
size_t nb,
transport_destructor destructor) {
bluealsa_transport_t *transport, *sav;
cds_list_for_each_entry_safe(transport, sav, &list->list, list) {
struct ba_msg_transport * ba_transport1 = &transport->transport;
if (watch != transport->watch)
continue;
bool found = false;
for (int ix = 0; ix<nb; ix++) {
const struct ba_msg_transport * ba_transport2 = &transports[ix];
if (halBlueAlsaTransportMatch(ba_transport1, ba_transport2)) {
found = true;
break;
}
}
if (found)
continue;
char transportS[HAL_BLUEALSA_TRANSPORT_LEN_MAX];
AFB_ApiInfo(watch->plugin->api,
"Unregister transport %s",
halBlueAlsaTransportAsString(transportS, HAL_BLUEALSA_TRANSPORT_LEN_MAX, &transport->transport));
cds_list_del(&transport->list);
if (destructor) {
destructor(transport);
}
free(transport->transactionUidS);
free(transport);
}
return 0;
}
static bool halBlueAlsaTransportMatch(const struct ba_msg_transport * transport1, const struct ba_msg_transport * transport2) {
bool ret = false;
if (transport1->type != transport2->type)
goto done;
if (transport1->stream != transport2->stream)
goto done;
if (bacmp(&transport1->addr, &transport2->addr) != 0) {
goto done;
}
ret = true;
done:
return ret;
}
char * halBlueAlsaTransportAsString(char * buff, size_t len, const struct ba_msg_transport * transport) {
char addr[18];
ba2str(&transport->addr, addr);
snprintf(buff, len, "%s,%s,%s", addr,
transport->type == BA_PCM_TYPE_A2DP?"a2dp":"sco",
transport->stream == BA_PCM_STREAM_PLAYBACK?"playback":"capture");
return buff;
}
|
