1*042d53a7SEvalZero /*
2*042d53a7SEvalZero * Licensed to the Apache Software Foundation (ASF) under one
3*042d53a7SEvalZero * or more contributor license agreements. See the NOTICE file
4*042d53a7SEvalZero * distributed with this work for additional information
5*042d53a7SEvalZero * regarding copyright ownership. The ASF licenses this file
6*042d53a7SEvalZero * to you under the Apache License, Version 2.0 (the
7*042d53a7SEvalZero * "License"); you may not use this file except in compliance
8*042d53a7SEvalZero * with the License. You may obtain a copy of the License at
9*042d53a7SEvalZero *
10*042d53a7SEvalZero * http://www.apache.org/licenses/LICENSE-2.0
11*042d53a7SEvalZero *
12*042d53a7SEvalZero * Unless required by applicable law or agreed to in writing,
13*042d53a7SEvalZero * software distributed under the License is distributed on an
14*042d53a7SEvalZero * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15*042d53a7SEvalZero * KIND, either express or implied. See the License for the
16*042d53a7SEvalZero * specific language governing permissions and limitations
17*042d53a7SEvalZero * under the License.
18*042d53a7SEvalZero */
19*042d53a7SEvalZero
20*042d53a7SEvalZero #include "host/ble_store.h"
21*042d53a7SEvalZero #include "ble_hs_priv.h"
22*042d53a7SEvalZero
23*042d53a7SEvalZero struct ble_store_util_peer_set {
24*042d53a7SEvalZero ble_addr_t *peer_id_addrs;
25*042d53a7SEvalZero int num_peers;
26*042d53a7SEvalZero int max_peers;
27*042d53a7SEvalZero int status;
28*042d53a7SEvalZero };
29*042d53a7SEvalZero
30*042d53a7SEvalZero static int
ble_store_util_iter_unique_peer(int obj_type,union ble_store_value * val,void * arg)31*042d53a7SEvalZero ble_store_util_iter_unique_peer(int obj_type,
32*042d53a7SEvalZero union ble_store_value *val,
33*042d53a7SEvalZero void *arg)
34*042d53a7SEvalZero {
35*042d53a7SEvalZero struct ble_store_util_peer_set *set;
36*042d53a7SEvalZero int i;
37*042d53a7SEvalZero
38*042d53a7SEvalZero BLE_HS_DBG_ASSERT(obj_type == BLE_STORE_OBJ_TYPE_OUR_SEC ||
39*042d53a7SEvalZero obj_type == BLE_STORE_OBJ_TYPE_PEER_SEC);
40*042d53a7SEvalZero
41*042d53a7SEvalZero set = arg;
42*042d53a7SEvalZero
43*042d53a7SEvalZero /* Do nothing if this peer is a duplicate. */
44*042d53a7SEvalZero for (i = 0; i < set->num_peers; i++) {
45*042d53a7SEvalZero if (ble_addr_cmp(set->peer_id_addrs + i, &val->sec.peer_addr) == 0) {
46*042d53a7SEvalZero return 0;
47*042d53a7SEvalZero }
48*042d53a7SEvalZero }
49*042d53a7SEvalZero
50*042d53a7SEvalZero if (set->num_peers >= set->max_peers) {
51*042d53a7SEvalZero /* Overflow; abort the iterate procedure. */
52*042d53a7SEvalZero set->status = BLE_HS_ENOMEM;
53*042d53a7SEvalZero return 1;
54*042d53a7SEvalZero }
55*042d53a7SEvalZero
56*042d53a7SEvalZero set->peer_id_addrs[set->num_peers] = val->sec.peer_addr;
57*042d53a7SEvalZero set->num_peers++;
58*042d53a7SEvalZero
59*042d53a7SEvalZero return 0;
60*042d53a7SEvalZero }
61*042d53a7SEvalZero
62*042d53a7SEvalZero /**
63*042d53a7SEvalZero * Retrieves the set of peer addresses for which a bond has been established.
64*042d53a7SEvalZero *
65*042d53a7SEvalZero * @param out_peer_id_addrs On success, the set of bonded peer addresses
66*042d53a7SEvalZero * gets written here.
67*042d53a7SEvalZero * @param out_num_peers On success, the number of bonds gets written
68*042d53a7SEvalZero * here.
69*042d53a7SEvalZero * @param max_peers The capacity of the destination buffer.
70*042d53a7SEvalZero *
71*042d53a7SEvalZero * @return 0 on success;
72*042d53a7SEvalZero * BLE_HS_ENOMEM if the destination buffer is too
73*042d53a7SEvalZero * small;
74*042d53a7SEvalZero * Other nonzero on error.
75*042d53a7SEvalZero */
76*042d53a7SEvalZero int
ble_store_util_bonded_peers(ble_addr_t * out_peer_id_addrs,int * out_num_peers,int max_peers)77*042d53a7SEvalZero ble_store_util_bonded_peers(ble_addr_t *out_peer_id_addrs, int *out_num_peers,
78*042d53a7SEvalZero int max_peers)
79*042d53a7SEvalZero {
80*042d53a7SEvalZero struct ble_store_util_peer_set set = {
81*042d53a7SEvalZero .peer_id_addrs = out_peer_id_addrs,
82*042d53a7SEvalZero .num_peers = 0,
83*042d53a7SEvalZero .max_peers = max_peers,
84*042d53a7SEvalZero .status = 0,
85*042d53a7SEvalZero };
86*042d53a7SEvalZero int rc;
87*042d53a7SEvalZero
88*042d53a7SEvalZero rc = ble_store_iterate(BLE_STORE_OBJ_TYPE_OUR_SEC,
89*042d53a7SEvalZero ble_store_util_iter_unique_peer,
90*042d53a7SEvalZero &set);
91*042d53a7SEvalZero if (rc != 0) {
92*042d53a7SEvalZero return rc;
93*042d53a7SEvalZero }
94*042d53a7SEvalZero if (set.status != 0) {
95*042d53a7SEvalZero return set.status;
96*042d53a7SEvalZero }
97*042d53a7SEvalZero
98*042d53a7SEvalZero *out_num_peers = set.num_peers;
99*042d53a7SEvalZero return 0;
100*042d53a7SEvalZero }
101*042d53a7SEvalZero
102*042d53a7SEvalZero /**
103*042d53a7SEvalZero * Deletes all entries from the store that are attached to the specified peer
104*042d53a7SEvalZero * address. This function deletes security entries and CCCD records.
105*042d53a7SEvalZero *
106*042d53a7SEvalZero * @param peer_id_addr Entries with this peer address get deleted.
107*042d53a7SEvalZero *
108*042d53a7SEvalZero * @return 0 on success;
109*042d53a7SEvalZero * Other nonzero on error.
110*042d53a7SEvalZero */
111*042d53a7SEvalZero int
ble_store_util_delete_peer(const ble_addr_t * peer_id_addr)112*042d53a7SEvalZero ble_store_util_delete_peer(const ble_addr_t *peer_id_addr)
113*042d53a7SEvalZero {
114*042d53a7SEvalZero union ble_store_key key;
115*042d53a7SEvalZero int rc;
116*042d53a7SEvalZero
117*042d53a7SEvalZero memset(&key, 0, sizeof key);
118*042d53a7SEvalZero key.sec.peer_addr = *peer_id_addr;
119*042d53a7SEvalZero
120*042d53a7SEvalZero rc = ble_store_util_delete_all(BLE_STORE_OBJ_TYPE_OUR_SEC, &key);
121*042d53a7SEvalZero if (rc != 0) {
122*042d53a7SEvalZero return rc;
123*042d53a7SEvalZero }
124*042d53a7SEvalZero
125*042d53a7SEvalZero rc = ble_store_util_delete_all(BLE_STORE_OBJ_TYPE_PEER_SEC, &key);
126*042d53a7SEvalZero if (rc != 0) {
127*042d53a7SEvalZero return rc;
128*042d53a7SEvalZero }
129*042d53a7SEvalZero
130*042d53a7SEvalZero memset(&key, 0, sizeof key);
131*042d53a7SEvalZero key.cccd.peer_addr = *peer_id_addr;
132*042d53a7SEvalZero
133*042d53a7SEvalZero rc = ble_store_util_delete_all(BLE_STORE_OBJ_TYPE_CCCD, &key);
134*042d53a7SEvalZero if (rc != 0) {
135*042d53a7SEvalZero return rc;
136*042d53a7SEvalZero }
137*042d53a7SEvalZero
138*042d53a7SEvalZero return 0;
139*042d53a7SEvalZero }
140*042d53a7SEvalZero
141*042d53a7SEvalZero /**
142*042d53a7SEvalZero * Deletes all entries from the store that match the specified key.
143*042d53a7SEvalZero *
144*042d53a7SEvalZero * @param type The type of store entry to delete.
145*042d53a7SEvalZero * @param key Entries matching this key get deleted.
146*042d53a7SEvalZero *
147*042d53a7SEvalZero * @return 0 on success;
148*042d53a7SEvalZero * Other nonzero on error.
149*042d53a7SEvalZero */
150*042d53a7SEvalZero int
ble_store_util_delete_all(int type,const union ble_store_key * key)151*042d53a7SEvalZero ble_store_util_delete_all(int type, const union ble_store_key *key)
152*042d53a7SEvalZero {
153*042d53a7SEvalZero int rc;
154*042d53a7SEvalZero
155*042d53a7SEvalZero do {
156*042d53a7SEvalZero rc = ble_store_delete(type, key);
157*042d53a7SEvalZero } while (rc == 0);
158*042d53a7SEvalZero
159*042d53a7SEvalZero if (rc != BLE_HS_ENOENT) {
160*042d53a7SEvalZero return rc;
161*042d53a7SEvalZero }
162*042d53a7SEvalZero
163*042d53a7SEvalZero return 0;
164*042d53a7SEvalZero }
165*042d53a7SEvalZero
166*042d53a7SEvalZero static int
ble_store_util_iter_count(int obj_type,union ble_store_value * val,void * arg)167*042d53a7SEvalZero ble_store_util_iter_count(int obj_type,
168*042d53a7SEvalZero union ble_store_value *val,
169*042d53a7SEvalZero void *arg)
170*042d53a7SEvalZero {
171*042d53a7SEvalZero int *count;
172*042d53a7SEvalZero
173*042d53a7SEvalZero count = arg;
174*042d53a7SEvalZero (*count)++;
175*042d53a7SEvalZero
176*042d53a7SEvalZero return 0;
177*042d53a7SEvalZero }
178*042d53a7SEvalZero
179*042d53a7SEvalZero int
ble_store_util_count(int type,int * out_count)180*042d53a7SEvalZero ble_store_util_count(int type, int *out_count)
181*042d53a7SEvalZero {
182*042d53a7SEvalZero int rc;
183*042d53a7SEvalZero
184*042d53a7SEvalZero *out_count = 0;
185*042d53a7SEvalZero rc = ble_store_iterate(type,
186*042d53a7SEvalZero ble_store_util_iter_count,
187*042d53a7SEvalZero out_count);
188*042d53a7SEvalZero if (rc != 0) {
189*042d53a7SEvalZero return rc;
190*042d53a7SEvalZero }
191*042d53a7SEvalZero
192*042d53a7SEvalZero return 0;
193*042d53a7SEvalZero }
194*042d53a7SEvalZero
195*042d53a7SEvalZero int
ble_store_util_delete_oldest_peer(void)196*042d53a7SEvalZero ble_store_util_delete_oldest_peer(void)
197*042d53a7SEvalZero {
198*042d53a7SEvalZero ble_addr_t peer_id_addrs[MYNEWT_VAL(BLE_STORE_MAX_BONDS)];
199*042d53a7SEvalZero int num_peers;
200*042d53a7SEvalZero int rc;
201*042d53a7SEvalZero
202*042d53a7SEvalZero rc = ble_store_util_bonded_peers(
203*042d53a7SEvalZero peer_id_addrs, &num_peers,
204*042d53a7SEvalZero sizeof peer_id_addrs / sizeof peer_id_addrs[0]);
205*042d53a7SEvalZero if (rc != 0) {
206*042d53a7SEvalZero return rc;
207*042d53a7SEvalZero }
208*042d53a7SEvalZero
209*042d53a7SEvalZero if (num_peers == 0) {
210*042d53a7SEvalZero return 0;
211*042d53a7SEvalZero }
212*042d53a7SEvalZero
213*042d53a7SEvalZero rc = ble_store_util_delete_peer(&peer_id_addrs[0]);
214*042d53a7SEvalZero if (rc != 0) {
215*042d53a7SEvalZero return rc;
216*042d53a7SEvalZero }
217*042d53a7SEvalZero
218*042d53a7SEvalZero return 0;
219*042d53a7SEvalZero }
220*042d53a7SEvalZero
221*042d53a7SEvalZero /**
222*042d53a7SEvalZero * Round-robin status callback. If a there is insufficient storage capacity
223*042d53a7SEvalZero * for a new record, delete the oldest bond and proceed with the persist
224*042d53a7SEvalZero * operation.
225*042d53a7SEvalZero *
226*042d53a7SEvalZero * Note: This is not the best behavior for an actual product because
227*042d53a7SEvalZero * uninteresting peers could cause important bonds to be deleted. This is
228*042d53a7SEvalZero * useful for demonstrations and sample apps.
229*042d53a7SEvalZero */
230*042d53a7SEvalZero int
ble_store_util_status_rr(struct ble_store_status_event * event,void * arg)231*042d53a7SEvalZero ble_store_util_status_rr(struct ble_store_status_event *event, void *arg)
232*042d53a7SEvalZero {
233*042d53a7SEvalZero switch (event->event_code) {
234*042d53a7SEvalZero case BLE_STORE_EVENT_OVERFLOW:
235*042d53a7SEvalZero switch (event->overflow.obj_type) {
236*042d53a7SEvalZero case BLE_STORE_OBJ_TYPE_OUR_SEC:
237*042d53a7SEvalZero case BLE_STORE_OBJ_TYPE_PEER_SEC:
238*042d53a7SEvalZero case BLE_STORE_OBJ_TYPE_CCCD:
239*042d53a7SEvalZero return ble_gap_unpair_oldest_peer();
240*042d53a7SEvalZero
241*042d53a7SEvalZero default:
242*042d53a7SEvalZero return BLE_HS_EUNKNOWN;
243*042d53a7SEvalZero }
244*042d53a7SEvalZero
245*042d53a7SEvalZero case BLE_STORE_EVENT_FULL:
246*042d53a7SEvalZero /* Just proceed with the operation. If it results in an overflow,
247*042d53a7SEvalZero * we'll delete a record when the overflow occurs.
248*042d53a7SEvalZero */
249*042d53a7SEvalZero return 0;
250*042d53a7SEvalZero
251*042d53a7SEvalZero default:
252*042d53a7SEvalZero return BLE_HS_EUNKNOWN;
253*042d53a7SEvalZero }
254*042d53a7SEvalZero }
255