| | |
| | | strncpy(topics_buf + count, _input.topics[i], min); |
| | | count += min; |
| | | |
| | | if (total >= strlen(_input.topics[i])) { |
| | | total -= strlen(_input.topics[i]); |
| | | } |
| | | total -= min; |
| | | |
| | | if ((_input.amount > 1) && (i < (_input.amount - 1))) { |
| | | if ((total > 1) && (_input.amount > 1) && (i < (_input.amount - 1))) { |
| | | strncpy(topics_buf + count, STR_MAGIC, strlen(STR_MAGIC)); |
| | | total -= 1; |
| | | count++; |
| | |
| | | } |
| | | } |
| | | |
| | | logger->debug("the parsed compound register topics: %s!\n", topics_buf); |
| | | //logger->debug("the parsed compound register topics: %s!\n", topics_buf); |
| | | #else |
| | | memcpy(topics_buf, topics, topics_len > (sizeof(topics_buf) - 1) ? (sizeof(topics_buf) - 1) : topics_len); |
| | | #endif |
| | |
| | | strncpy(topics_buf + count, _input.topics[i], min); |
| | | count += min; |
| | | |
| | | if (total >= strlen(_input.topics[i])) { |
| | | total -= strlen(_input.topics[i]); |
| | | } |
| | | total -= min; |
| | | |
| | | if ((_input.amount > 1) && (i < (_input.amount - 1))) { |
| | | if ((total > 1) && (_input.amount > 1) && (i < (_input.amount - 1))) { |
| | | strncpy(topics_buf + count, STR_MAGIC, strlen(STR_MAGIC)); |
| | | total -= 1; |
| | | count++; |
| | |
| | | topics_buf[strlen(topics_buf) - 1] = '\0'; |
| | | } |
| | | } |
| | | logger->debug("the parsed compound sub topics: %s!\n", topics_buf); |
| | | //logger->debug("the parsed compound sub topics: %s!\n", topics_buf); |
| | | #else |
| | | memcpy(topics_buf, topics, topics_len > (sizeof(topics_buf) - 1) ? (sizeof(topics_buf) - 1) : topics_len); |
| | | #endif |
| | |
| | | int node_arr_len = 0; |
| | | |
| | | #if defined(PRO_DE_SERIALIZE) |
| | | struct _MsgPublish |
| | | struct MsgPublish |
| | | { |
| | | const char *topic; |
| | | const char *data; |