代码拉取完成,页面将自动刷新
//
// Created by bluse on 2022/7/31.
//
#include <mosquitto.h>
#include <mosquitto_broker.h>
#include "hash.h"
#include "uthash.h"
void set(const char *key, struct delay_message msg) {
if (key == NULL) {
return;
}
struct dataItem *r;
HASH_FIND_STR(pData, key, r);
if (r == NULL) {
r = mosquitto_malloc(sizeof(struct dataItem));
r->key = key;
r->arr = mosquitto_malloc(sizeof(struct delay_message));
r->arr[0] = msg;
r->count = 1;
HASH_ADD_STR(pData, key, r);
} else {
r->count += 1;
struct delay_message *arr = mosquitto_calloc(r->count, sizeof(struct delay_message));
for (int i = 0; i < r->count; ++i) {
if (i < r->count - 1) {
arr[i] = r->arr[i];
} else {
arr[i] = msg;
}
}
mosquitto_free(r->arr);
r->arr = arr;
}
}
struct delay_message_array get(const char *key) {
if (key == NULL) {
return (struct delay_message_array) {NULL, 0};
}
struct dataItem *i;
HASH_FIND_STR(pData, key, i);
if (i == NULL) {
return (struct delay_message_array) {NULL, 0};
}
struct delay_message_array arr = {i->arr, i->count};
return arr;
}
void del(const char *key) {
if (key == NULL) {
return;
}
struct dataItem *r;
HASH_FIND_STR(pData, key, r);
if (r != NULL) {
HASH_DEL(pData, r);
// 完整清理
for (int i = 0; i < r->count; ++i) {
mosquitto_free(r->arr[i].topic);
mosquitto_free(r->arr[i].payload);
}
mosquitto_free(r->arr);
r->arr = NULL;
mosquitto_free(r);
r = NULL;
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。