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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
/******************************************************************************
*
* Copyright (C) 2009-2012 Broadcom Corporation
*
* 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.
*
******************************************************************************/
/*******************************************************************************
*
* Filename: btif_profile_queue.c
*
* Description: Bluetooth remote device connection queuing implementation.
*
******************************************************************************/
#include <assert.h>
#include <string.h>
#include <hardware/bluetooth.h>
#include <string.h>
#define LOG_TAG "bt_btif_queue"
#include "btif_common.h"
#include "btif_profile_queue.h"
#include "gki.h"
#include "osi/include/list.h"
#include "osi/include/allocator.h"
#include "stack_manager.h"
/*******************************************************************************
** Local type definitions
*******************************************************************************/
typedef enum {
BTIF_QUEUE_CONNECT_EVT,
BTIF_QUEUE_ADVANCE_EVT,
} btif_queue_event_t;
typedef struct {
bt_bdaddr_t bda;
uint16_t uuid;
bool busy;
btif_connect_cb_t connect_cb;
} connect_node_t;
/*******************************************************************************
** Static variables
*******************************************************************************/
static list_t *connect_queue;
static const size_t MAX_REASONABLE_REQUESTS = 10;
/*******************************************************************************
** Queue helper functions
*******************************************************************************/
static void queue_int_add(connect_node_t *p_param) {
if (!connect_queue) {
connect_queue = list_new(osi_free);
assert(connect_queue != NULL);
}
// Sanity check to make sure we're not leaking connection requests
assert(list_length(connect_queue) < MAX_REASONABLE_REQUESTS);
for (const list_node_t *node = list_begin(connect_queue); node != list_end(connect_queue); node = list_next(node)) {
if (((connect_node_t *)list_node(node))->uuid == p_param->uuid) {
LOG_INFO("%s dropping duplicate connect request for uuid: %04x", __func__, p_param->uuid);
return;
}
}
connect_node_t *p_node = osi_malloc(sizeof(connect_node_t));
assert(p_node != NULL);
memcpy(p_node, p_param, sizeof(connect_node_t));
list_append(connect_queue, p_node);
}
static void queue_int_advance() {
if (connect_queue && !list_is_empty(connect_queue))
list_remove(connect_queue, list_front(connect_queue));
}
static void queue_int_handle_evt(UINT16 event, char *p_param) {
switch(event) {
case BTIF_QUEUE_CONNECT_EVT:
queue_int_add((connect_node_t *)p_param);
break;
case BTIF_QUEUE_ADVANCE_EVT:
queue_int_advance();
break;
}
if (stack_manager_get_interface()->get_stack_is_running())
btif_queue_connect_next();
}
/*******************************************************************************
**
** Function btif_queue_connect
**
** Description Add a new connection to the queue and trigger the next
** scheduled connection.
**
** Returns BT_STATUS_SUCCESS if successful
**
*******************************************************************************/
bt_status_t btif_queue_connect(uint16_t uuid, const bt_bdaddr_t *bda, btif_connect_cb_t connect_cb) {
connect_node_t node;
memset(&node, 0, sizeof(connect_node_t));
memcpy(&node.bda, bda, sizeof(bt_bdaddr_t));
node.uuid = uuid;
node.connect_cb = connect_cb;
return btif_transfer_context(queue_int_handle_evt, BTIF_QUEUE_CONNECT_EVT,
(char *)&node, sizeof(connect_node_t), NULL);
}
/*******************************************************************************
**
** Function btif_queue_advance
**
** Description Clear the queue's busy status and advance to the next
** scheduled connection.
**
** Returns void
**
*******************************************************************************/
void btif_queue_advance() {
btif_transfer_context(queue_int_handle_evt, BTIF_QUEUE_ADVANCE_EVT,
NULL, 0, NULL);
}
// This function dispatches the next pending connect request. It is called from
// stack_manager when the stack comes up.
bt_status_t btif_queue_connect_next(void) {
if (!connect_queue || list_is_empty(connect_queue))
return BT_STATUS_FAIL;
connect_node_t *p_head = list_front(connect_queue);
// If the queue is currently busy, we return success anyway,
// since the connection has been queued...
if (p_head->busy)
return BT_STATUS_SUCCESS;
p_head->busy = true;
return p_head->connect_cb(&p_head->bda, p_head->uuid);
}
/*******************************************************************************
**
** Function btif_queue_release
**
** Description Free up all the queue nodes and set the queue head to NULL
**
** Returns void
**
*******************************************************************************/
void btif_queue_release() {
list_free(connect_queue);
connect_queue = NULL;
}
|
