2018-07-18 04:22:11 -04:00
|
|
|
/*
|
|
|
|
* This file is part of the MicroPython project, http://micropython.org/
|
|
|
|
*
|
|
|
|
* The MIT License (MIT)
|
|
|
|
*
|
2019-06-18 23:46:20 -04:00
|
|
|
* Copyright (c) 2019 Dan Halbert for Adafruit Industries
|
2018-07-18 04:22:11 -04:00
|
|
|
* Copyright (c) 2018 Artur Pacholec
|
2019-06-18 23:46:20 -04:00
|
|
|
* Copyright (c) 2017 Glenn Ruben Bakke
|
2018-07-18 04:22:11 -04:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2019-06-18 23:46:20 -04:00
|
|
|
#include <string.h>
|
2018-07-18 04:22:11 -04:00
|
|
|
|
2019-08-29 18:44:27 -04:00
|
|
|
#include "shared-bindings/_bleio/Address.h"
|
|
|
|
#include "shared-module/_bleio/Address.h"
|
|
|
|
#include "shared-module/_bleio/ScanEntry.h"
|
2018-07-18 04:22:11 -04:00
|
|
|
|
2019-06-18 23:46:20 -04:00
|
|
|
mp_obj_t common_hal_bleio_scanentry_get_address(bleio_scanentry_obj_t *self) {
|
2019-06-22 22:10:15 -04:00
|
|
|
return MP_OBJ_FROM_PTR(self->address);
|
2019-06-18 23:46:20 -04:00
|
|
|
}
|
2018-07-18 04:22:11 -04:00
|
|
|
|
2019-06-22 22:10:15 -04:00
|
|
|
mp_obj_t common_hal_bleio_scanentry_get_advertisement_bytes(bleio_scanentry_obj_t *self) {
|
2019-09-14 15:40:24 -04:00
|
|
|
return MP_OBJ_FROM_PTR(self->data);
|
2019-06-18 23:46:20 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
mp_int_t common_hal_bleio_scanentry_get_rssi(bleio_scanentry_obj_t *self) {
|
|
|
|
return self->rssi;
|
|
|
|
}
|
2019-09-14 15:40:24 -04:00
|
|
|
|
|
|
|
bool common_hal_bleio_scanentry_get_connectable(bleio_scanentry_obj_t *self) {
|
|
|
|
return self->connectable;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool common_hal_bleio_scanentry_get_scan_response(bleio_scanentry_obj_t *self) {
|
|
|
|
return self->scan_response;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool bleio_scanentry_data_matches(const uint8_t* data, size_t len, const uint8_t* prefixes, size_t prefixes_length, bool any) {
|
|
|
|
if (prefixes_length == 0) {
|
|
|
|
return true;
|
|
|
|
}
|
2020-06-15 16:35:51 -04:00
|
|
|
if (len == 0) {
|
|
|
|
// Prefixes exist, but no data.
|
|
|
|
return false;
|
|
|
|
}
|
2019-09-14 15:40:24 -04:00
|
|
|
size_t i = 0;
|
|
|
|
while(i < prefixes_length) {
|
|
|
|
uint8_t prefix_length = prefixes[i];
|
|
|
|
i += 1;
|
|
|
|
size_t j = 0;
|
2020-06-15 16:35:51 -04:00
|
|
|
bool prefix_matched = false;
|
2019-09-14 15:40:24 -04:00
|
|
|
while (j < len) {
|
|
|
|
uint8_t structure_length = data[j];
|
|
|
|
j += 1;
|
|
|
|
if (structure_length == 0) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (structure_length >= prefix_length && memcmp(data + j, prefixes + i, prefix_length) == 0) {
|
|
|
|
if (any) {
|
|
|
|
return true;
|
|
|
|
}
|
2020-06-15 16:35:51 -04:00
|
|
|
prefix_matched = true;
|
|
|
|
break;
|
2019-09-14 15:40:24 -04:00
|
|
|
}
|
|
|
|
j += structure_length;
|
|
|
|
}
|
2020-06-15 16:35:51 -04:00
|
|
|
// If all (!any), the current prefix must have matched at least one field.
|
|
|
|
if (!prefix_matched && !any) {
|
|
|
|
return false;
|
|
|
|
}
|
2019-09-14 15:40:24 -04:00
|
|
|
i += prefix_length;
|
|
|
|
}
|
2020-06-15 16:35:51 -04:00
|
|
|
// All prefixes matched some field (if !any), or none did (if any).
|
2019-09-14 15:40:24 -04:00
|
|
|
return !any;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool common_hal_bleio_scanentry_matches(bleio_scanentry_obj_t *self, const uint8_t* prefixes, size_t prefixes_len, bool all) {
|
|
|
|
return bleio_scanentry_data_matches(self->data->data, self->data->len, prefixes, prefixes_len, !all);
|
|
|
|
}
|