summaryrefslogtreecommitdiff
path: root/message.c
blob: 58ae13503f00b7f9ac6f26f9180a9400ec248be3 (plain)
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
/*
 * Copyright (C) 2023 Mikhail Burakov. This file is part of MQhTTp.
 *
 * MQhTTp is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * MQhTTp is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with MQhTTp.  If not, see <https://www.gnu.org/licenses/>.
 */

#include "message.h"

#include <stdlib.h>
#include <string.h>

struct Message* MessageCreate(const char* topic, size_t topic_size) {
  struct Message* message = malloc(sizeof(struct Message));
  if (!message) return NULL;
  message->topic = malloc(topic_size);
  if (!message->topic) goto free_message;
  memcpy(message->topic, topic, topic_size);
  message->topic_size = topic_size;
  message->payload = NULL;
  message->payload_size = 0;
  return message;

free_message:
  free(message);
  return NULL;
}

int MessageCompare(const void* a, const void* b) {
  const struct Message* message_a = a;
  const struct Message* message_b = b;
  if (message_a->topic_size > message_b->topic_size) return 1;
  if (message_a->topic_size < message_b->topic_size) return -1;
  return memcmp(message_a->topic, message_b->topic, message_a->topic_size);
}

void MessageDestroy(void* message) {
  struct Message* instance = message;
  free(instance->payload);
  free(instance->topic);
  free(instance);
}