Packetizer.h 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. #pragma once
  2. #ifndef PACKETIZER_IMPL_H
  3. #define PACKETIZER_IMPL_H
  4. #ifdef __AVR__
  5. #include "RingBuffer.h"
  6. #else
  7. #include <vector>
  8. #include <queue>
  9. // #include <map>
  10. #include <functional>
  11. #endif // __AVR__
  12. namespace Packetizer
  13. {
  14. static constexpr uint8_t START_BYTE = 0x7D;
  15. static constexpr uint8_t FINISH_BYTE = 0x7E;
  16. static constexpr uint8_t ESCAPE_BYTE = 0x7F;
  17. static constexpr uint8_t ESCAPE_MASK = 0x20;
  18. static constexpr uint8_t INDEX_OFFSET_INDEX = 1;
  19. static constexpr uint8_t INDEX_OFFSET_DATA = 2;
  20. static constexpr uint8_t INDEX_OFFSET_CRC_ESCAPE_FROM_END = 2;
  21. static constexpr uint8_t N_HEADER_SIZE = 2;
  22. static constexpr uint8_t N_FOOTER_SIZE = 1; // footer is not bufferred
  23. static constexpr uint8_t N_HEADER_FOOTER_SIZE = N_HEADER_SIZE + N_FOOTER_SIZE;
  24. struct endp {}; // for end of packet sign
  25. uint8_t crc8(const uint8_t* data, size_t size)
  26. {
  27. uint8_t result = 0xFF;
  28. for (result = 0; size != 0; --size)
  29. {
  30. result ^= *data++;
  31. for (size_t i = 0 ; i < 8; ++i)
  32. {
  33. if (result & 0x80)
  34. {
  35. result <<= 1;
  36. result ^= 0x85; // x8 + x7 + x2 + x0
  37. }
  38. else
  39. result <<= 1;
  40. }
  41. }
  42. return result;
  43. }
  44. #ifdef __AVR__
  45. template <uint8_t N_PACKET_DATA_SIZE>
  46. class Packer_
  47. {
  48. using Packer = Packer_;
  49. using Buffer = RingBuffer<uint8_t, N_PACKET_DATA_SIZE>;
  50. using EscapeBuffer = RingBuffer<uint8_t, N_PACKET_DATA_SIZE>;
  51. public:
  52. Packer_(uint8_t idx = 0) { init(idx); }
  53. #else
  54. class Packer
  55. {
  56. using Buffer = std::vector<uint8_t>;
  57. using EscapeBuffer = std::queue<uint8_t>;
  58. public:
  59. Packer(uint8_t idx = 0) { init(idx); }
  60. #endif // __AVR__
  61. // get packing info
  62. size_t size() const { return buffer.size(); }
  63. const uint8_t* data() const { return buffer.data(); }
  64. void init(uint8_t index = 0)
  65. {
  66. buffer.clear();
  67. append((uint8_t)START_BYTE, false);
  68. append((uint8_t)index);
  69. }
  70. // ---------- pack w/ insertion operator ----------
  71. const endp& operator<< (const endp& e)
  72. {
  73. footer();
  74. return e; // dummy
  75. }
  76. Packer& operator<< (const uint8_t arg)
  77. {
  78. append(arg);
  79. return *this;
  80. }
  81. // ---------- pack w/ variadic arguments ----------
  82. template <typename ...Rest>
  83. void pack(uint8_t first, Rest&& ...args)
  84. {
  85. append((uint8_t)first);
  86. pack(args...);
  87. }
  88. void pack()
  89. {
  90. footer();
  91. }
  92. // ---------- pack w/ data pointer and size ----------
  93. void pack(const uint8_t* const sbuf, uint8_t size, uint8_t index = 0)
  94. {
  95. init(index);
  96. append((uint8_t*)sbuf, size);
  97. footer();
  98. }
  99. private:
  100. void append(const uint8_t* const data, uint8_t size, bool b_escape = true)
  101. {
  102. if (b_escape)
  103. {
  104. EscapeBuffer escapes;
  105. for (uint8_t i = 0; i < size; ++i)
  106. if (is_escape_byte(data[i]))
  107. escapes.push(i);
  108. if (escapes.empty())
  109. for (uint8_t i = 0; i < size; ++i) buffer.push_back(data[i]);
  110. else
  111. {
  112. size_t start = 0;
  113. while (!escapes.empty())
  114. {
  115. const uint8_t& idx = escapes.front();
  116. append(data + start, idx - start);
  117. append(data[idx], true);
  118. start = idx + 1;
  119. escapes.pop();
  120. }
  121. if (start < size) append(data + start, size - start);
  122. }
  123. }
  124. else
  125. for (uint8_t i = 0; i < size; ++i) buffer.push_back(data[i]);
  126. }
  127. void append(uint8_t data, bool b_escape = true)
  128. {
  129. if (b_escape && is_escape_byte(data))
  130. {
  131. buffer.push_back(ESCAPE_BYTE);
  132. buffer.push_back((uint8_t)(data ^ ESCAPE_MASK));
  133. }
  134. else
  135. buffer.push_back(data);
  136. }
  137. void footer()
  138. {
  139. append(crc8(buffer.data(), buffer.size()));
  140. append(FINISH_BYTE, false);
  141. }
  142. bool is_escape_byte(uint8_t d) const
  143. {
  144. return ((d == START_BYTE) || (d == ESCAPE_BYTE) || (d == FINISH_BYTE));
  145. }
  146. Buffer buffer;
  147. };
  148. #ifdef __AVR__
  149. template <uint8_t N_PACKET_QUEUE_SIZE, uint8_t N_PACKET_DATA_SIZE, uint8_t N_CALLBACK_SIZE = 8>
  150. class Unpacker_
  151. {
  152. using Buffer = RingBuffer<uint8_t, N_PACKET_DATA_SIZE>;
  153. typedef void (*CallbackType)(const uint8_t* data, uint8_t size);
  154. struct Map { uint8_t key; CallbackType func; };
  155. using PacketQueue = RingBuffer<Buffer, N_PACKET_QUEUE_SIZE>;
  156. using CallbackMap = RingBuffer<Map, N_CALLBACK_SIZE>;
  157. #else
  158. template <uint8_t N_PACKET_QUEUE_SIZE>
  159. class Unpacker_
  160. {
  161. using Buffer = std::vector<uint8_t>;
  162. using CallbackType = std::function<void(const uint8_t* data, uint8_t size)>;
  163. struct Map { uint8_t key; CallbackType func; };
  164. using PacketQueue = std::queue<Buffer>;
  165. using CallbackMap = std::vector<Map>;
  166. #endif // __AVR__
  167. public:
  168. // TODO: std::map / unordered_map compile error for teensy in Arduino IDE...
  169. void subscribe(uint8_t index, CallbackType func) { callbacks.push_back({index, func}); }
  170. size_t available() const { return packets.size(); }
  171. uint8_t index() const { return packets.front()[INDEX_OFFSET_INDEX]; }
  172. uint8_t size() const { return packets.front().size() - N_HEADER_FOOTER_SIZE; }
  173. uint8_t data(uint8_t i) const { return data()[i]; }
  174. const uint8_t* data() const { return packets.front().data() + INDEX_OFFSET_DATA; }
  175. void pop() { packets.pop(); }
  176. void feed(const uint8_t* const data, size_t size)
  177. {
  178. for (size_t i = 0; i < size; ++i) feed(data[i]);
  179. }
  180. void feed(uint8_t d)
  181. {
  182. if (!b_processing)
  183. {
  184. if (d == START_BYTE)
  185. {
  186. reset();
  187. buffer.push_back(d);
  188. b_processing = true;
  189. }
  190. }
  191. else
  192. {
  193. if (d == FINISH_BYTE) check_crc();
  194. else buffer.push_back(d);
  195. }
  196. // TODO: std::map / unordered_map compile error...
  197. // if (available() && !callbacks.empty())
  198. // {
  199. // auto it = callbacks.find(index());
  200. // if (it != callbacks.end()) { it->second(data(), size()); pop(); }
  201. // }
  202. if (!callbacks.empty())
  203. {
  204. for (auto& c : callbacks)
  205. {
  206. if (available())
  207. {
  208. if (c.key == index())
  209. {
  210. c.func(data(), size());
  211. pop();
  212. }
  213. else if (available() > N_PACKET_QUEUE_SIZE)
  214. {
  215. // TODO: discard if unpacker have callbacks?
  216. // TODO: that is select callback or manual switch-case / if-else
  217. pop();
  218. }
  219. }
  220. }
  221. }
  222. }
  223. private:
  224. void check_crc()
  225. {
  226. uint8_t crc_received = buffer.back();
  227. uint8_t crc_offset_size = 1;
  228. if (*(buffer.end() - INDEX_OFFSET_CRC_ESCAPE_FROM_END) == ESCAPE_BYTE) // before CRC byte can be ESCAPE_BYTE only if CRC is escaped
  229. {
  230. crc_received ^= ESCAPE_MASK;
  231. crc_offset_size = 2;
  232. }
  233. uint8_t crc = crc8(buffer.data(), buffer.size() - crc_offset_size);
  234. if (crc == crc_received)
  235. {
  236. for (auto it = buffer.begin(); it != buffer.end(); ++it)
  237. {
  238. if (*it == ESCAPE_BYTE)
  239. {
  240. it = buffer.erase(it);
  241. *it = *it ^ ESCAPE_MASK;
  242. }
  243. }
  244. packets.push(buffer);
  245. }
  246. reset();
  247. }
  248. void reset()
  249. {
  250. buffer.clear();
  251. b_processing = false;
  252. }
  253. bool b_processing {false};
  254. bool b_escape {false};
  255. Buffer buffer;
  256. PacketQueue packets;
  257. CallbackMap callbacks;
  258. };
  259. #ifdef __AVR__
  260. using Packer = Packer_<64>;
  261. using Unpacker = Unpacker_<2, 64>;
  262. #else
  263. using Unpacker = Unpacker_<4>;
  264. #endif // __AVR__
  265. }
  266. #endif // PACKETIZER_IMPL_H