2
0

BitMessage.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708
  1. #include <cassert>
  2. #include <cstring>
  3. #include "BitMessage.h"
  4. namespace crown
  5. {
  6. namespace network
  7. {
  8. BitMessage::BitMessage(Allocator& allocator) :
  9. m_data(NULL),
  10. m_write(NULL),
  11. m_read(NULL),
  12. m_max_size(0),
  13. m_cur_size(0),
  14. m_write_bit(0),
  15. m_read_count(0),
  16. m_read_bit(0),
  17. m_allocator(&allocator)
  18. {
  19. }
  20. //---------------------------------------------------------------------------------------------
  21. BitMessage::~BitMessage()
  22. {
  23. if (m_data)
  24. {
  25. m_allocator->deallocate((void*)m_data);
  26. }
  27. }
  28. //---------------------------------------------------------------------------------------------
  29. uint8_t* BitMessage::get_byte_space(int32_t len)
  30. {
  31. uint8_t *ptr;
  32. if (!m_write)
  33. {
  34. printf("cannot write to message");
  35. }
  36. // round up to the next byte
  37. write_byte_align();
  38. // check for overflow
  39. check_overflow(len << 3);
  40. // allocate space
  41. ptr = m_write + m_cur_size;
  42. m_cur_size += len;
  43. return ptr;
  44. }
  45. //---------------------------------------------------------------------------------------------
  46. bool BitMessage::check_overflow(int32_t num_bits)
  47. {
  48. assert( num_bits >= 0 );
  49. if (num_bits > get_remaining_write_bits())
  50. {
  51. if (num_bits > (m_max_size << 3))
  52. {
  53. printf(" %i bits is > full message size", num_bits );
  54. }
  55. printf("overflow\n");
  56. begin_writing();
  57. m_overflowed = true;
  58. return true;
  59. }
  60. return false;
  61. }
  62. //---------------------------------------------------------------------------------------------
  63. void BitMessage::init(int32_t len)
  64. {
  65. m_data = (uint8_t*)m_allocator->allocate(len);
  66. m_write = m_data;
  67. m_read = m_data;
  68. m_max_size = len;
  69. }
  70. //---------------------------------------------------------------------------------------------
  71. uint8_t* BitMessage::get_data()
  72. {
  73. return m_write;
  74. }
  75. //---------------------------------------------------------------------------------------------
  76. const uint8_t* BitMessage::get_data() const
  77. {
  78. return m_read;
  79. }
  80. //---------------------------------------------------------------------------------------------
  81. size_t BitMessage::get_max_size() const
  82. {
  83. return m_max_size;
  84. }
  85. //---------------------------------------------------------------------------------------------
  86. bool BitMessage::is_overflowed()
  87. {
  88. return m_overflowed;
  89. }
  90. //---------------------------------------------------------------------------------------------
  91. size_t BitMessage::get_size() const
  92. {
  93. return m_cur_size;
  94. }
  95. //---------------------------------------------------------------------------------------------
  96. void BitMessage::set_size(size_t size)
  97. {
  98. if (size > m_max_size)
  99. {
  100. m_cur_size = m_max_size;
  101. }
  102. else
  103. {
  104. m_cur_size = size;
  105. }
  106. }
  107. //---------------------------------------------------------------------------------------------
  108. int32_t BitMessage::get_write_bit() const
  109. {
  110. return m_write_bit;
  111. }
  112. //---------------------------------------------------------------------------------------------
  113. void BitMessage::set_write_bit(int32_t bit)
  114. {
  115. m_write_bit = bit & 7;
  116. if (m_write_bit)
  117. {
  118. m_write[m_cur_size-1] &= (1 << m_write_bit) - 1;
  119. }
  120. }
  121. //---------------------------------------------------------------------------------------------
  122. int32_t BitMessage::get_num_bits_written() const
  123. {
  124. return ((m_cur_size << 3) - ((8 - m_write_bit) & 7));
  125. }
  126. //---------------------------------------------------------------------------------------------
  127. int32_t BitMessage::get_remaining_write_bits() const
  128. {
  129. return (m_max_size << 3) - get_num_bits_written();
  130. }
  131. //---------------------------------------------------------------------------------------------
  132. void BitMessage::save_write_state(int32_t& s,int32_t& b) const
  133. {
  134. s = m_cur_size;
  135. b = m_write_bit;
  136. }
  137. //---------------------------------------------------------------------------------------------
  138. void BitMessage::restore_write_state(int32_t s,int32_t b)
  139. {
  140. m_cur_size = s;
  141. m_write_bit = b & 7;
  142. if (m_write_bit)
  143. {
  144. m_write[m_cur_size-1] &= (1 << m_write_bit) - 1;
  145. }
  146. }
  147. //---------------------------------------------------------------------------------------------
  148. int32_t BitMessage::get_read_count() const
  149. {
  150. return m_read_count;
  151. }
  152. //---------------------------------------------------------------------------------------------
  153. void BitMessage::set_read_count(int32_t bytes)
  154. {
  155. m_read_count = bytes;
  156. }
  157. //---------------------------------------------------------------------------------------------
  158. int32_t BitMessage::get_read_bit() const
  159. {
  160. return m_read_bit;
  161. }
  162. //---------------------------------------------------------------------------------------------
  163. void BitMessage::set_read_bit(int32_t bit)
  164. {
  165. m_read_bit = bit & 7;
  166. }
  167. //---------------------------------------------------------------------------------------------
  168. int32_t BitMessage::get_num_bits_read() const
  169. {
  170. return ((m_read_count << 3) - ((8 - m_read_bit) & 7));
  171. }
  172. //---------------------------------------------------------------------------------------------
  173. int32_t BitMessage::get_remaining_read_bits() const
  174. {
  175. return (m_cur_size << 3) - get_num_bits_read();
  176. }
  177. //---------------------------------------------------------------------------------------------
  178. void BitMessage::save_read_state(int32_t& c, int32_t& b) const
  179. {
  180. c = m_read_count;
  181. b = m_read_bit;
  182. }
  183. //---------------------------------------------------------------------------------------------
  184. void BitMessage::restore_read_state(int32_t c, int32_t b)
  185. {
  186. m_read_count = c;
  187. m_read_bit = b & 7;
  188. }
  189. //---------------------------------------------------------------------------------------------
  190. void BitMessage::begin_writing()
  191. {
  192. m_cur_size = 0;
  193. m_write_bit = 0;
  194. m_overflowed = false;
  195. }
  196. //---------------------------------------------------------------------------------------------
  197. int32_t BitMessage::get_remaining_space() const
  198. {
  199. return m_max_size - m_cur_size;
  200. }
  201. //---------------------------------------------------------------------------------------------
  202. void BitMessage::write_byte_align()
  203. {
  204. m_write_bit = 0;
  205. }
  206. //---------------------------------------------------------------------------------------------
  207. void BitMessage::write_bits(int32_t value, int32_t num_bits)
  208. {
  209. int32_t put;
  210. int32_t fraction;
  211. // check if m_write is void
  212. if (!m_write)
  213. {
  214. printf( "cannot write to message" );
  215. }
  216. // check if the number of bits is valid
  217. if (num_bits == 0 || num_bits < -31 || num_bits > 32)
  218. {
  219. printf( "bad numBits %i", num_bits);
  220. }
  221. // check for value overflows
  222. // this should be an error really, as it can go unnoticed and cause either bandwidth or corrupted data transmitted
  223. if (num_bits != 32)
  224. {
  225. if (num_bits > 0)
  226. {
  227. if (value > (1 << num_bits) - 1)
  228. {
  229. printf( "value overflow %d %d", value, num_bits );
  230. }
  231. else if (value < 0)
  232. {
  233. printf( "value overflow %d %d", value, num_bits );
  234. }
  235. }
  236. else
  237. {
  238. int32_t r = 1 << (-1 - num_bits);
  239. if (value > r - 1)
  240. {
  241. printf( "value overflow %d %d", value, num_bits );
  242. }
  243. else if (value < -r)
  244. {
  245. printf( "value overflow %d %d", value, num_bits );
  246. }
  247. }
  248. }
  249. // Change sign if it is negative
  250. if (num_bits < 0 )
  251. {
  252. num_bits = -num_bits;
  253. }
  254. // check for msg overflow
  255. if (check_overflow(num_bits))
  256. {
  257. return;
  258. }
  259. // write the bits
  260. while(num_bits)
  261. {
  262. if (m_write_bit == 0)
  263. {
  264. m_write[m_cur_size] = 0;
  265. m_cur_size++;
  266. }
  267. put = 8 - m_write_bit;
  268. if (put > num_bits)
  269. {
  270. put = num_bits;
  271. }
  272. fraction = value & ((1 << put) - 1);
  273. m_write[m_cur_size - 1] |= fraction << m_write_bit;
  274. num_bits -= put;
  275. value >>= put;
  276. m_write_bit = (m_write_bit + put) & 7;
  277. }
  278. }
  279. //---------------------------------------------------------------------------------------------
  280. void BitMessage::write_int8(int32_t c)
  281. {
  282. write_bits(c, -8);
  283. }
  284. //---------------------------------------------------------------------------------------------
  285. void BitMessage::write_uint8(int32_t c)
  286. {
  287. write_bits(c, 8);
  288. }
  289. //---------------------------------------------------------------------------------------------
  290. void BitMessage::write_int16(int32_t c)
  291. {
  292. write_bits(c, -16);
  293. }
  294. //---------------------------------------------------------------------------------------------
  295. void BitMessage::write_uint16(int32_t c)
  296. {
  297. write_bits(c, 16);
  298. }
  299. //---------------------------------------------------------------------------------------------
  300. void BitMessage::write_int32(int32_t c)
  301. {
  302. write_bits(c, 32);
  303. }
  304. //---------------------------------------------------------------------------------------------
  305. void BitMessage::write_real(real f)
  306. {
  307. write_bits(*reinterpret_cast<int32_t *>(&f), 32);
  308. }
  309. //---------------------------------------------------------------------------------------------
  310. void BitMessage::write_vec3(const Vec3& v)
  311. {
  312. write_real(v.x);
  313. write_real(v.y);
  314. write_real(v.z);
  315. }
  316. //---------------------------------------------------------------------------------------------
  317. void BitMessage::write_string(const char* s, int32_t max_len, bool make_7_bit)
  318. {
  319. if (!s)
  320. {
  321. write_data("", 1);
  322. }
  323. else
  324. {
  325. int32_t i;
  326. int32_t l;
  327. uint8_t* data_ptr;
  328. const uint8_t* byte_ptr;
  329. // calculates length
  330. for (l = 0; s[l]; l++) {}
  331. if (max_len >= 0 && l >= max_len)
  332. {
  333. l = max_len - 1;
  334. }
  335. data_ptr = get_byte_space(l + 1);
  336. byte_ptr = reinterpret_cast<const uint8_t*>(s);
  337. if (make_7_bit)
  338. {
  339. for (i = 0; i < l; i++)
  340. {
  341. if ( byte_ptr[i] > 127 )
  342. {
  343. data_ptr[i] = '.';
  344. }
  345. else
  346. {
  347. data_ptr[i] = byte_ptr[i];
  348. }
  349. }
  350. }
  351. else
  352. {
  353. for (i = 0; i < l; i++)
  354. {
  355. data_ptr[i] = byte_ptr[i];
  356. }
  357. }
  358. data_ptr[i] = '\0';
  359. }
  360. }
  361. //---------------------------------------------------------------------------------------------
  362. void BitMessage::write_data(const void* data, int32_t length)
  363. {
  364. memcpy(get_byte_space(length), data, length);
  365. }
  366. //---------------------------------------------------------------------------------------------
  367. void BitMessage::write_ipv4addr(const os::NetAddress addr)
  368. {
  369. uint8_t* ptr;
  370. ptr = get_byte_space(4);
  371. memcpy(ptr, addr.address, 4);
  372. write_uint16(addr.port);
  373. }
  374. //---------------------------------------------------------------------------------------------
  375. void BitMessage::begin_reading() const
  376. {
  377. m_read_count = 0;
  378. m_read_bit = 0;
  379. }
  380. //---------------------------------------------------------------------------------------------
  381. int32_t BitMessage::get_remaing_data() const
  382. {
  383. m_cur_size - m_read_count;
  384. }
  385. //---------------------------------------------------------------------------------------------
  386. void BitMessage::read_byte_align() const
  387. {
  388. m_read_bit = 0;
  389. }
  390. //---------------------------------------------------------------------------------------------
  391. int32_t BitMessage::read_bits(int32_t num_bits) const
  392. {
  393. int32_t value;
  394. int32_t value_bits;
  395. int32_t get;
  396. int32_t fraction;
  397. bool sgn;
  398. if (!m_read)
  399. {
  400. printf("cannot read from message");
  401. }
  402. // check if the number of bits is valid
  403. if ( num_bits == 0 || num_bits < -31 || num_bits > 32 )
  404. {
  405. printf("bad number of bits %i", num_bits );
  406. }
  407. value = 0;
  408. value_bits = 0;
  409. // change sign if it is negative
  410. if (num_bits < 0)
  411. {
  412. num_bits = -num_bits;
  413. sgn = true;
  414. }
  415. else
  416. {
  417. sgn = false;
  418. }
  419. // check for overflow
  420. if (num_bits > get_remaining_read_bits())
  421. {
  422. return -1;
  423. }
  424. while (value_bits < num_bits)
  425. {
  426. if (m_read_bit == 0)
  427. {
  428. m_read_count++;
  429. }
  430. get = 8 - m_read_bit;
  431. if (get > (num_bits - value_bits))
  432. {
  433. get = num_bits - value_bits;
  434. }
  435. fraction = m_read[m_read_count - 1];
  436. fraction >>= m_read_bit;
  437. fraction &= (1 << get) - 1;
  438. value |= fraction << value_bits;
  439. value_bits += get;
  440. m_read_bit = (m_read_bit + get) & 7;
  441. }
  442. if (sgn)
  443. {
  444. if (value & (1 << (num_bits - 1)))
  445. {
  446. value |= -1 ^ (( 1 << num_bits) - 1);
  447. }
  448. }
  449. return value;
  450. }
  451. //---------------------------------------------------------------------------------------------
  452. int32_t BitMessage::read_int8() const
  453. {
  454. return (int32_t)read_bits(-8);
  455. }
  456. //---------------------------------------------------------------------------------------------
  457. int32_t BitMessage::read_uint8() const
  458. {
  459. return (int32_t)read_bits(8);
  460. }
  461. //---------------------------------------------------------------------------------------------
  462. int32_t BitMessage::read_int16() const
  463. {
  464. return (int32_t)read_bits(-16);
  465. }
  466. //---------------------------------------------------------------------------------------------
  467. int32_t BitMessage::read_uint16() const
  468. {
  469. return (int32_t)read_bits(16);
  470. }
  471. //---------------------------------------------------------------------------------------------
  472. int32_t BitMessage::read_int32() const
  473. {
  474. return (int32_t)read_bits(32);
  475. }
  476. //---------------------------------------------------------------------------------------------
  477. real BitMessage::read_real() const
  478. {
  479. float value;
  480. *reinterpret_cast<int*>(&value) = read_bits(32);
  481. return value;
  482. }
  483. //---------------------------------------------------------------------------------------------
  484. Vec3 BitMessage::read_vec3() const
  485. {
  486. Vec3 v;
  487. v.x = read_real();
  488. v.y = read_real();
  489. v.z = read_real();
  490. return v;
  491. }
  492. //---------------------------------------------------------------------------------------------
  493. int32_t BitMessage::read_string(char* buffer, int32_t buffer_size) const
  494. {
  495. int l = 0;
  496. int c;
  497. read_byte_align();
  498. while(1)
  499. {
  500. c = read_uint8();
  501. if (c <= 0 || c >= 255)
  502. {
  503. break;
  504. }
  505. // translate all fmt spec to avoid crash bugs in string routines
  506. if ( c == '%' )
  507. {
  508. c = '.';
  509. }
  510. // we will read past any excessively long string, so
  511. // the following data can be read, but the string will
  512. // be truncated
  513. if (l < buffer_size - 1)
  514. {
  515. buffer[l] = c;
  516. l++;
  517. }
  518. }
  519. buffer[l] = 0;
  520. return l;
  521. }
  522. //---------------------------------------------------------------------------------------------
  523. int32_t BitMessage::read_data(void* data, int32_t length) const
  524. {
  525. int count;
  526. read_byte_align();
  527. count = m_read_count;
  528. if (m_read_count + length > m_cur_size)
  529. {
  530. if (data)
  531. {
  532. memcpy(data, m_read + m_read_count, get_remaing_data());
  533. }
  534. m_read_count = m_cur_size;
  535. }
  536. else
  537. {
  538. if (data)
  539. {
  540. memcpy(data, m_read + m_read_count, length);
  541. }
  542. m_read_count += length;
  543. }
  544. return (m_read_count - count);
  545. }
  546. //---------------------------------------------------------------------------------------------
  547. void BitMessage::read_ipv4addr(os::NetAddress* addr) const
  548. {
  549. for (int i = 0; i < 4; i++)
  550. {
  551. addr->address[i] = read_uint8();
  552. }
  553. addr->port = read_uint16();
  554. }
  555. } //namespace network
  556. } //namespace crown