843 lines
18 KiB
C
843 lines
18 KiB
C
/* Bluetooth Mesh */
|
|
|
|
/*
|
|
* Copyright (c) 2017 Intel Corporation
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
#include <zephyr.h>
|
|
#include <errno.h>
|
|
#include <sys/util.h>
|
|
#include <sys/byteorder.h>
|
|
|
|
#include <net/buf.h>
|
|
#include <bluetooth/bluetooth.h>
|
|
#include <bluetooth/mesh.h>
|
|
|
|
#define BT_DBG_ENABLED IS_ENABLED(CONFIG_BT_MESH_DEBUG_ACCESS)
|
|
#define LOG_MODULE_NAME bt_mesh_access
|
|
#include "common/log.h"
|
|
|
|
#include "mesh.h"
|
|
#include "adv.h"
|
|
#include "net.h"
|
|
#include "lpn.h"
|
|
#include "transport.h"
|
|
#include "access.h"
|
|
#include "foundation.h"
|
|
|
|
static const struct bt_mesh_comp *dev_comp;
|
|
static uint16_t dev_primary_addr;
|
|
|
|
void bt_mesh_model_foreach(void (*func)(struct bt_mesh_model *mod,
|
|
struct bt_mesh_elem *elem,
|
|
bool vnd, bool primary,
|
|
void *user_data),
|
|
void *user_data)
|
|
{
|
|
int i, j;
|
|
|
|
for (i = 0; i < dev_comp->elem_count; i++) {
|
|
struct bt_mesh_elem *elem = &dev_comp->elem[i];
|
|
|
|
for (j = 0; j < elem->model_count; j++) {
|
|
struct bt_mesh_model *model = &elem->models[j];
|
|
|
|
func(model, elem, false, i == 0, user_data);
|
|
}
|
|
|
|
for (j = 0; j < elem->vnd_model_count; j++) {
|
|
struct bt_mesh_model *model = &elem->vnd_models[j];
|
|
|
|
func(model, elem, true, i == 0, user_data);
|
|
}
|
|
}
|
|
}
|
|
|
|
int32_t bt_mesh_model_pub_period_get(struct bt_mesh_model *mod)
|
|
{
|
|
int32_t period;
|
|
|
|
if (!mod->pub) {
|
|
return 0;
|
|
}
|
|
|
|
switch (mod->pub->period >> 6) {
|
|
case 0x00:
|
|
/* 1 step is 100 ms */
|
|
period = (mod->pub->period & BIT_MASK(6)) * 100U;
|
|
break;
|
|
case 0x01:
|
|
/* 1 step is 1 second */
|
|
period = (mod->pub->period & BIT_MASK(6)) * MSEC_PER_SEC;
|
|
break;
|
|
case 0x02:
|
|
/* 1 step is 10 seconds */
|
|
period = (mod->pub->period & BIT_MASK(6)) * 10U * MSEC_PER_SEC;
|
|
break;
|
|
case 0x03:
|
|
/* 1 step is 10 minutes */
|
|
period = (mod->pub->period & BIT_MASK(6)) * 600U * MSEC_PER_SEC;
|
|
break;
|
|
default:
|
|
CODE_UNREACHABLE;
|
|
}
|
|
|
|
if (mod->pub->fast_period) {
|
|
return period >> mod->pub->period_div;
|
|
} else {
|
|
return period;
|
|
}
|
|
}
|
|
|
|
static int32_t next_period(struct bt_mesh_model *mod)
|
|
{
|
|
struct bt_mesh_model_pub *pub = mod->pub;
|
|
uint32_t elapsed, period;
|
|
|
|
period = bt_mesh_model_pub_period_get(mod);
|
|
if (!period) {
|
|
return 0;
|
|
}
|
|
|
|
elapsed = k_uptime_get_32() - pub->period_start;
|
|
|
|
BT_DBG("Publishing took %ums", elapsed);
|
|
|
|
if (elapsed >= period) {
|
|
BT_WARN("Publication sending took longer than the period");
|
|
/* Return smallest positive number since 0 means disabled */
|
|
return 1;
|
|
}
|
|
|
|
return period - elapsed;
|
|
}
|
|
|
|
static void publish_sent(int err, void *user_data)
|
|
{
|
|
struct bt_mesh_model *mod = user_data;
|
|
int32_t delay;
|
|
|
|
BT_DBG("err %d", err);
|
|
|
|
if (mod->pub->count) {
|
|
delay = BT_MESH_PUB_TRANSMIT_INT(mod->pub->retransmit);
|
|
} else {
|
|
delay = next_period(mod);
|
|
}
|
|
|
|
if (delay) {
|
|
BT_DBG("Publishing next time in %dms", delay);
|
|
k_delayed_work_submit(&mod->pub->timer, K_MSEC(delay));
|
|
}
|
|
}
|
|
|
|
static void publish_start(uint16_t duration, int err, void *user_data)
|
|
{
|
|
struct bt_mesh_model *mod = user_data;
|
|
struct bt_mesh_model_pub *pub = mod->pub;
|
|
|
|
if (err) {
|
|
BT_ERR("Failed to publish: err %d", err);
|
|
return;
|
|
}
|
|
|
|
/* Initialize the timestamp for the beginning of a new period */
|
|
if (pub->count == BT_MESH_PUB_TRANSMIT_COUNT(pub->retransmit)) {
|
|
pub->period_start = k_uptime_get_32();
|
|
}
|
|
}
|
|
|
|
static const struct bt_mesh_send_cb pub_sent_cb = {
|
|
.start = publish_start,
|
|
.end = publish_sent,
|
|
};
|
|
|
|
static int publish_retransmit(struct bt_mesh_model *mod)
|
|
{
|
|
NET_BUF_SIMPLE_DEFINE(sdu, BT_MESH_TX_SDU_MAX);
|
|
struct bt_mesh_model_pub *pub = mod->pub;
|
|
struct bt_mesh_msg_ctx ctx = {
|
|
.addr = pub->addr,
|
|
.send_ttl = pub->ttl,
|
|
.app_idx = pub->key,
|
|
};
|
|
struct bt_mesh_net_tx tx = {
|
|
.ctx = &ctx,
|
|
.src = bt_mesh_model_elem(mod)->addr,
|
|
.friend_cred = pub->cred,
|
|
};
|
|
|
|
net_buf_simple_add_mem(&sdu, pub->msg->data, pub->msg->len);
|
|
|
|
pub->count--;
|
|
|
|
return bt_mesh_trans_send(&tx, &sdu, &pub_sent_cb, mod);
|
|
}
|
|
|
|
static void publish_retransmit_end(int err, struct bt_mesh_model_pub *pub)
|
|
{
|
|
/* Cancel all retransmits for this publish attempt */
|
|
pub->count = 0U;
|
|
/* Make sure the publish timer gets reset */
|
|
publish_sent(err, pub->mod);
|
|
}
|
|
|
|
static void mod_publish(struct k_work *work)
|
|
{
|
|
struct bt_mesh_model_pub *pub = CONTAINER_OF(work,
|
|
struct bt_mesh_model_pub,
|
|
timer.work);
|
|
int32_t period_ms;
|
|
int err;
|
|
|
|
BT_DBG("");
|
|
|
|
period_ms = bt_mesh_model_pub_period_get(pub->mod);
|
|
BT_DBG("period %u ms", period_ms);
|
|
|
|
if (pub->count) {
|
|
err = publish_retransmit(pub->mod);
|
|
if (err) {
|
|
BT_ERR("Failed to retransmit (err %d)", err);
|
|
|
|
pub->count = 0U;
|
|
|
|
/* Continue with normal publication */
|
|
if (period_ms) {
|
|
k_delayed_work_submit(&pub->timer,
|
|
K_MSEC(period_ms));
|
|
}
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
if (!period_ms) {
|
|
return;
|
|
}
|
|
|
|
__ASSERT_NO_MSG(pub->update != NULL);
|
|
|
|
err = pub->update(pub->mod);
|
|
if (err) {
|
|
/* Cancel this publish attempt. */
|
|
BT_DBG("Update failed, skipping publish (err: %d)", err);
|
|
pub->period_start = k_uptime_get_32();
|
|
publish_retransmit_end(err, pub);
|
|
return;
|
|
}
|
|
|
|
err = bt_mesh_model_publish(pub->mod);
|
|
if (err) {
|
|
BT_ERR("Publishing failed (err %d)", err);
|
|
}
|
|
}
|
|
|
|
struct bt_mesh_elem *bt_mesh_model_elem(struct bt_mesh_model *mod)
|
|
{
|
|
return &dev_comp->elem[mod->elem_idx];
|
|
}
|
|
|
|
struct bt_mesh_model *bt_mesh_model_get(bool vnd, uint8_t elem_idx, uint8_t mod_idx)
|
|
{
|
|
struct bt_mesh_elem *elem;
|
|
|
|
if (elem_idx >= dev_comp->elem_count) {
|
|
BT_ERR("Invalid element index %u", elem_idx);
|
|
return NULL;
|
|
}
|
|
|
|
elem = &dev_comp->elem[elem_idx];
|
|
|
|
if (vnd) {
|
|
if (mod_idx >= elem->vnd_model_count) {
|
|
BT_ERR("Invalid vendor model index %u", mod_idx);
|
|
return NULL;
|
|
}
|
|
|
|
return &elem->vnd_models[mod_idx];
|
|
} else {
|
|
if (mod_idx >= elem->model_count) {
|
|
BT_ERR("Invalid SIG model index %u", mod_idx);
|
|
return NULL;
|
|
}
|
|
|
|
return &elem->models[mod_idx];
|
|
}
|
|
}
|
|
|
|
static void mod_init(struct bt_mesh_model *mod, struct bt_mesh_elem *elem,
|
|
bool vnd, bool primary, void *user_data)
|
|
{
|
|
int i;
|
|
int *err = user_data;
|
|
|
|
if (*err) {
|
|
return;
|
|
}
|
|
|
|
if (mod->pub) {
|
|
mod->pub->mod = mod;
|
|
k_delayed_work_init(&mod->pub->timer, mod_publish);
|
|
}
|
|
|
|
for (i = 0; i < ARRAY_SIZE(mod->keys); i++) {
|
|
mod->keys[i] = BT_MESH_KEY_UNUSED;
|
|
}
|
|
|
|
mod->elem_idx = elem - dev_comp->elem;
|
|
if (vnd) {
|
|
mod->mod_idx = mod - elem->vnd_models;
|
|
} else {
|
|
mod->mod_idx = mod - elem->models;
|
|
}
|
|
|
|
if (mod->cb && mod->cb->init) {
|
|
*err = mod->cb->init(mod);
|
|
}
|
|
}
|
|
|
|
int bt_mesh_comp_register(const struct bt_mesh_comp *comp)
|
|
{
|
|
int err;
|
|
|
|
/* There must be at least one element */
|
|
if (!comp->elem_count) {
|
|
return -EINVAL;
|
|
}
|
|
|
|
dev_comp = comp;
|
|
|
|
err = 0;
|
|
bt_mesh_model_foreach(mod_init, &err);
|
|
|
|
return err;
|
|
}
|
|
|
|
void bt_mesh_comp_provision(uint16_t addr)
|
|
{
|
|
int i;
|
|
|
|
dev_primary_addr = addr;
|
|
|
|
BT_DBG("addr 0x%04x elem_count %zu", addr, dev_comp->elem_count);
|
|
|
|
for (i = 0; i < dev_comp->elem_count; i++) {
|
|
struct bt_mesh_elem *elem = &dev_comp->elem[i];
|
|
|
|
elem->addr = addr++;
|
|
|
|
BT_DBG("addr 0x%04x mod_count %u vnd_mod_count %u",
|
|
elem->addr, elem->model_count, elem->vnd_model_count);
|
|
}
|
|
}
|
|
|
|
void bt_mesh_comp_unprovision(void)
|
|
{
|
|
BT_DBG("");
|
|
|
|
dev_primary_addr = BT_MESH_ADDR_UNASSIGNED;
|
|
}
|
|
|
|
uint16_t bt_mesh_primary_addr(void)
|
|
{
|
|
return dev_primary_addr;
|
|
}
|
|
|
|
static uint16_t *model_group_get(struct bt_mesh_model *mod, uint16_t addr)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < ARRAY_SIZE(mod->groups); i++) {
|
|
if (mod->groups[i] == addr) {
|
|
return &mod->groups[i];
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct find_group_visitor_ctx {
|
|
uint16_t *entry;
|
|
struct bt_mesh_model *mod;
|
|
uint16_t addr;
|
|
};
|
|
|
|
static enum bt_mesh_walk find_group_mod_visitor(struct bt_mesh_model *mod,
|
|
uint32_t depth, void *user_data)
|
|
{
|
|
struct find_group_visitor_ctx *ctx = user_data;
|
|
|
|
if (mod->elem_idx != ctx->mod->elem_idx) {
|
|
return BT_MESH_WALK_CONTINUE;
|
|
}
|
|
|
|
ctx->entry = model_group_get(mod, ctx->addr);
|
|
if (ctx->entry) {
|
|
ctx->mod = mod;
|
|
return BT_MESH_WALK_STOP;
|
|
}
|
|
|
|
return BT_MESH_WALK_CONTINUE;
|
|
}
|
|
|
|
uint16_t *bt_mesh_model_find_group(struct bt_mesh_model **mod, uint16_t addr)
|
|
{
|
|
struct find_group_visitor_ctx ctx = {
|
|
.mod = *mod,
|
|
.entry = NULL,
|
|
.addr = addr,
|
|
};
|
|
|
|
bt_mesh_model_tree_walk(bt_mesh_model_root(*mod),
|
|
find_group_mod_visitor, &ctx);
|
|
|
|
*mod = ctx.mod;
|
|
return ctx.entry;
|
|
}
|
|
|
|
static struct bt_mesh_model *bt_mesh_elem_find_group(struct bt_mesh_elem *elem,
|
|
uint16_t group_addr)
|
|
{
|
|
struct bt_mesh_model *model;
|
|
uint16_t *match;
|
|
int i;
|
|
|
|
for (i = 0; i < elem->model_count; i++) {
|
|
model = &elem->models[i];
|
|
|
|
match = model_group_get(model, group_addr);
|
|
if (match) {
|
|
return model;
|
|
}
|
|
}
|
|
|
|
for (i = 0; i < elem->vnd_model_count; i++) {
|
|
model = &elem->vnd_models[i];
|
|
|
|
match = model_group_get(model, group_addr);
|
|
if (match) {
|
|
return model;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct bt_mesh_elem *bt_mesh_elem_find(uint16_t addr)
|
|
{
|
|
uint16_t index;
|
|
|
|
if (BT_MESH_ADDR_IS_UNICAST(addr)) {
|
|
index = (addr - dev_comp->elem[0].addr);
|
|
if (index < dev_comp->elem_count) {
|
|
return &dev_comp->elem[index];
|
|
} else {
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
for (index = 0; index < dev_comp->elem_count; index++) {
|
|
struct bt_mesh_elem *elem = &dev_comp->elem[index];
|
|
|
|
if (bt_mesh_elem_find_group(elem, addr)) {
|
|
return elem;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
uint8_t bt_mesh_elem_count(void)
|
|
{
|
|
return dev_comp->elem_count;
|
|
}
|
|
|
|
static bool model_has_key(struct bt_mesh_model *mod, uint16_t key)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < ARRAY_SIZE(mod->keys); i++) {
|
|
if (mod->keys[i] == key ||
|
|
(mod->keys[i] == BT_MESH_KEY_DEV_ANY &&
|
|
BT_MESH_IS_DEV_KEY(key))) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
static bool model_has_dst(struct bt_mesh_model *mod, uint16_t dst)
|
|
{
|
|
if (BT_MESH_ADDR_IS_UNICAST(dst)) {
|
|
return (dev_comp->elem[mod->elem_idx].addr == dst);
|
|
} else if (BT_MESH_ADDR_IS_GROUP(dst) || BT_MESH_ADDR_IS_VIRTUAL(dst)) {
|
|
return !!bt_mesh_model_find_group(&mod, dst);
|
|
}
|
|
|
|
/* If a message with a fixed group address is sent to the access layer,
|
|
* the lower layers have already confirmed that we are subscribing to
|
|
* it. All models on the primary element should receive the message.
|
|
*/
|
|
return mod->elem_idx == 0;
|
|
}
|
|
|
|
static const struct bt_mesh_model_op *find_op(struct bt_mesh_model *models,
|
|
uint8_t model_count, uint32_t opcode,
|
|
struct bt_mesh_model **model)
|
|
{
|
|
uint8_t i;
|
|
|
|
for (i = 0U; i < model_count; i++) {
|
|
const struct bt_mesh_model_op *op;
|
|
|
|
*model = &models[i];
|
|
|
|
for (op = (*model)->op; op->func; op++) {
|
|
if (op->opcode == opcode) {
|
|
return op;
|
|
}
|
|
}
|
|
}
|
|
|
|
*model = NULL;
|
|
return NULL;
|
|
}
|
|
|
|
static int get_opcode(struct net_buf_simple *buf, uint32_t *opcode)
|
|
{
|
|
switch (buf->data[0] >> 6) {
|
|
case 0x00:
|
|
case 0x01:
|
|
if (buf->data[0] == 0x7f) {
|
|
BT_ERR("Ignoring RFU OpCode");
|
|
return -EINVAL;
|
|
}
|
|
|
|
*opcode = net_buf_simple_pull_u8(buf);
|
|
return 0;
|
|
case 0x02:
|
|
if (buf->len < 2) {
|
|
BT_ERR("Too short payload for 2-octet OpCode");
|
|
return -EINVAL;
|
|
}
|
|
|
|
*opcode = net_buf_simple_pull_be16(buf);
|
|
return 0;
|
|
case 0x03:
|
|
if (buf->len < 3) {
|
|
BT_ERR("Too short payload for 3-octet OpCode");
|
|
return -EINVAL;
|
|
}
|
|
|
|
*opcode = net_buf_simple_pull_u8(buf) << 16;
|
|
/* Using LE for the CID since the model layer is defined as
|
|
* little-endian in the mesh spec and using BT_MESH_MODEL_OP_3
|
|
* will declare the opcode in this way.
|
|
*/
|
|
*opcode |= net_buf_simple_pull_le16(buf);
|
|
return 0;
|
|
}
|
|
|
|
CODE_UNREACHABLE;
|
|
}
|
|
|
|
void bt_mesh_model_recv(struct bt_mesh_net_rx *rx, struct net_buf_simple *buf)
|
|
{
|
|
struct bt_mesh_model *models, *model;
|
|
const struct bt_mesh_model_op *op;
|
|
uint32_t opcode;
|
|
uint8_t count;
|
|
int i;
|
|
|
|
BT_DBG("app_idx 0x%04x src 0x%04x dst 0x%04x", rx->ctx.app_idx,
|
|
rx->ctx.addr, rx->ctx.recv_dst);
|
|
BT_DBG("len %u: %s", buf->len, bt_hex(buf->data, buf->len));
|
|
|
|
if (get_opcode(buf, &opcode) < 0) {
|
|
BT_WARN("Unable to decode OpCode");
|
|
return;
|
|
}
|
|
|
|
BT_DBG("OpCode 0x%08x", opcode);
|
|
|
|
for (i = 0; i < dev_comp->elem_count; i++) {
|
|
struct bt_mesh_elem *elem = &dev_comp->elem[i];
|
|
struct net_buf_simple_state state;
|
|
|
|
/* SIG models cannot contain 3-byte (vendor) OpCodes, and
|
|
* vendor models cannot contain SIG (1- or 2-byte) OpCodes, so
|
|
* we only need to do the lookup in one of the model lists.
|
|
*/
|
|
if (BT_MESH_MODEL_OP_LEN(opcode) < 3) {
|
|
models = elem->models;
|
|
count = elem->model_count;
|
|
} else {
|
|
models = elem->vnd_models;
|
|
count = elem->vnd_model_count;
|
|
}
|
|
|
|
op = find_op(models, count, opcode, &model);
|
|
if (!op) {
|
|
BT_DBG("No OpCode 0x%08x for elem %d", opcode, i);
|
|
continue;
|
|
}
|
|
|
|
if (!model_has_key(model, rx->ctx.app_idx)) {
|
|
continue;
|
|
}
|
|
|
|
if (!model_has_dst(model, rx->ctx.recv_dst)) {
|
|
continue;
|
|
}
|
|
|
|
if (buf->len < op->min_len) {
|
|
BT_ERR("Too short message for OpCode 0x%08x", opcode);
|
|
continue;
|
|
}
|
|
|
|
/* The callback will likely parse the buffer, so
|
|
* store the parsing state in case multiple models
|
|
* receive the message.
|
|
*/
|
|
net_buf_simple_save(buf, &state);
|
|
op->func(model, &rx->ctx, buf);
|
|
net_buf_simple_restore(buf, &state);
|
|
}
|
|
}
|
|
|
|
void bt_mesh_model_msg_init(struct net_buf_simple *msg, uint32_t opcode)
|
|
{
|
|
net_buf_simple_init(msg, 0);
|
|
|
|
switch (BT_MESH_MODEL_OP_LEN(opcode)) {
|
|
case 1:
|
|
net_buf_simple_add_u8(msg, opcode);
|
|
break;
|
|
case 2:
|
|
net_buf_simple_add_be16(msg, opcode);
|
|
break;
|
|
case 3:
|
|
net_buf_simple_add_u8(msg, ((opcode >> 16) & 0xff));
|
|
/* Using LE for the CID since the model layer is defined as
|
|
* little-endian in the mesh spec and using BT_MESH_MODEL_OP_3
|
|
* will declare the opcode in this way.
|
|
*/
|
|
net_buf_simple_add_le16(msg, opcode & 0xffff);
|
|
break;
|
|
default:
|
|
BT_WARN("Unknown opcode format");
|
|
break;
|
|
}
|
|
}
|
|
|
|
static int model_send(struct bt_mesh_model *model,
|
|
struct bt_mesh_net_tx *tx, bool implicit_bind,
|
|
struct net_buf_simple *msg,
|
|
const struct bt_mesh_send_cb *cb, void *cb_data)
|
|
{
|
|
BT_DBG("net_idx 0x%04x app_idx 0x%04x dst 0x%04x", tx->ctx->net_idx,
|
|
tx->ctx->app_idx, tx->ctx->addr);
|
|
BT_DBG("len %u: %s", msg->len, bt_hex(msg->data, msg->len));
|
|
|
|
if (!bt_mesh_is_provisioned()) {
|
|
BT_ERR("Local node is not yet provisioned");
|
|
return -EAGAIN;
|
|
}
|
|
|
|
if (net_buf_simple_tailroom(msg) < 4) {
|
|
BT_ERR("Not enough tailroom for TransMIC");
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (msg->len > BT_MESH_TX_SDU_MAX - 4) {
|
|
BT_ERR("Too big message");
|
|
return -EMSGSIZE;
|
|
}
|
|
|
|
if (!implicit_bind && !model_has_key(model, tx->ctx->app_idx)) {
|
|
BT_ERR("Model not bound to AppKey 0x%04x", tx->ctx->app_idx);
|
|
return -EINVAL;
|
|
}
|
|
|
|
return bt_mesh_trans_send(tx, msg, cb, cb_data);
|
|
}
|
|
|
|
int bt_mesh_model_send(struct bt_mesh_model *model,
|
|
struct bt_mesh_msg_ctx *ctx,
|
|
struct net_buf_simple *msg,
|
|
const struct bt_mesh_send_cb *cb, void *cb_data)
|
|
{
|
|
struct bt_mesh_net_tx tx = {
|
|
.ctx = ctx,
|
|
.src = bt_mesh_model_elem(model)->addr,
|
|
};
|
|
|
|
return model_send(model, &tx, false, msg, cb, cb_data);
|
|
}
|
|
|
|
int bt_mesh_model_publish(struct bt_mesh_model *model)
|
|
{
|
|
NET_BUF_SIMPLE_DEFINE(sdu, BT_MESH_TX_SDU_MAX);
|
|
struct bt_mesh_model_pub *pub = model->pub;
|
|
struct bt_mesh_msg_ctx ctx = {
|
|
.addr = pub->addr,
|
|
.send_ttl = pub->ttl,
|
|
.send_rel = pub->send_rel,
|
|
.app_idx = pub->key,
|
|
};
|
|
struct bt_mesh_net_tx tx = {
|
|
.ctx = &ctx,
|
|
.src = bt_mesh_model_elem(model)->addr,
|
|
};
|
|
int err;
|
|
|
|
BT_DBG("");
|
|
|
|
if (!pub) {
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
if (pub->addr == BT_MESH_ADDR_UNASSIGNED) {
|
|
return -EADDRNOTAVAIL;
|
|
}
|
|
|
|
if (pub->msg->len + 4 > BT_MESH_TX_SDU_MAX) {
|
|
BT_ERR("Message does not fit maximum SDU size");
|
|
return -EMSGSIZE;
|
|
}
|
|
|
|
if (pub->count) {
|
|
BT_WARN("Clearing publish retransmit timer");
|
|
k_delayed_work_cancel(&pub->timer);
|
|
}
|
|
|
|
net_buf_simple_add_mem(&sdu, pub->msg->data, pub->msg->len);
|
|
|
|
tx.friend_cred = pub->cred;
|
|
|
|
pub->count = BT_MESH_PUB_TRANSMIT_COUNT(pub->retransmit);
|
|
|
|
BT_DBG("Publish Retransmit Count %u Interval %ums", pub->count,
|
|
BT_MESH_PUB_TRANSMIT_INT(pub->retransmit));
|
|
|
|
err = model_send(model, &tx, true, &sdu, &pub_sent_cb, model);
|
|
if (err) {
|
|
publish_retransmit_end(err, pub);
|
|
return err;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
struct bt_mesh_model *bt_mesh_model_find_vnd(const struct bt_mesh_elem *elem,
|
|
uint16_t company, uint16_t id)
|
|
{
|
|
uint8_t i;
|
|
|
|
for (i = 0U; i < elem->vnd_model_count; i++) {
|
|
if (elem->vnd_models[i].vnd.company == company &&
|
|
elem->vnd_models[i].vnd.id == id) {
|
|
return &elem->vnd_models[i];
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct bt_mesh_model *bt_mesh_model_find(const struct bt_mesh_elem *elem,
|
|
uint16_t id)
|
|
{
|
|
uint8_t i;
|
|
|
|
for (i = 0U; i < elem->model_count; i++) {
|
|
if (elem->models[i].id == id) {
|
|
return &elem->models[i];
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
const struct bt_mesh_comp *bt_mesh_comp_get(void)
|
|
{
|
|
return dev_comp;
|
|
}
|
|
|
|
struct bt_mesh_model *bt_mesh_model_root(struct bt_mesh_model *mod)
|
|
{
|
|
#ifdef CONFIG_BT_MESH_MODEL_EXTENSIONS
|
|
while (mod->next) {
|
|
mod = mod->next;
|
|
}
|
|
#endif
|
|
return mod;
|
|
}
|
|
|
|
void bt_mesh_model_tree_walk(struct bt_mesh_model *root,
|
|
enum bt_mesh_walk (*cb)(struct bt_mesh_model *mod,
|
|
uint32_t depth,
|
|
void *user_data),
|
|
void *user_data)
|
|
{
|
|
struct bt_mesh_model *m = root;
|
|
int depth = 0;
|
|
/* 'skip' is set to true when we ascend from child to parent node.
|
|
* In that case, we want to skip calling the callback on the parent
|
|
* node and we don't want to descend onto a child node as those
|
|
* nodes have already been visited.
|
|
*/
|
|
bool skip = false;
|
|
|
|
do {
|
|
if (!skip &&
|
|
cb(m, (uint32_t)depth, user_data) == BT_MESH_WALK_STOP) {
|
|
return;
|
|
}
|
|
#ifdef CONFIG_BT_MESH_MODEL_EXTENSIONS
|
|
if (!skip && m->extends) {
|
|
m = m->extends;
|
|
depth++;
|
|
} else if (m->flags & BT_MESH_MOD_NEXT_IS_PARENT) {
|
|
m = m->next;
|
|
depth--;
|
|
skip = true;
|
|
} else {
|
|
m = m->next;
|
|
skip = false;
|
|
}
|
|
#endif
|
|
} while (m && depth > 0);
|
|
}
|
|
|
|
#ifdef CONFIG_BT_MESH_MODEL_EXTENSIONS
|
|
int bt_mesh_model_extend(struct bt_mesh_model *mod,
|
|
struct bt_mesh_model *base_mod)
|
|
{
|
|
/* Form a cyclical LCRS tree:
|
|
* The extends-pointer points to the first child, and the next-pointer
|
|
* points to the next sibling. The last sibling is marked by the
|
|
* BT_MESH_MOD_NEXT_IS_PARENT flag, and its next-pointer points back to
|
|
* the parent. This way, the whole tree is accessible from any node.
|
|
*
|
|
* We add children (extend them) by inserting them as the first child.
|
|
*/
|
|
if (base_mod->next) {
|
|
return -EALREADY;
|
|
}
|
|
|
|
if (mod->extends) {
|
|
base_mod->next = mod->extends;
|
|
} else {
|
|
base_mod->next = mod;
|
|
base_mod->flags |= BT_MESH_MOD_NEXT_IS_PARENT;
|
|
}
|
|
|
|
mod->extends = base_mod;
|
|
return 0;
|
|
}
|
|
#endif
|