queue.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
  1. /* str_queue.c
  2. *
  3. * Copyright (c) 2014-2015, Tuan PM <tuanpm at live dot com>
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions are met:
  8. *
  9. * * Redistributions of source code must retain the above copyright notice,
  10. * this list of conditions and the following disclaimer.
  11. * * Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * * Neither the name of Redis nor the names of its contributors may be used
  15. * to endorse or promote products derived from this software without
  16. * specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  19. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  20. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  21. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  22. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  23. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  24. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  25. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  26. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  27. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  28. * POSSIBILITY OF SUCH DAMAGE.
  29. */
  30. #include "mqtt/queue.h"
  31. #include "user_interface.h"
  32. #include "osapi.h"
  33. #include "os_type.h"
  34. #include "mem.h"
  35. #include "mqtt/proto.h"
  36. uint8_t *last_rb_p_r;
  37. uint8_t *last_rb_p_w;
  38. uint32_t last_fill_cnt;
  39. void ICACHE_FLASH_ATTR QUEUE_Init(QUEUE *queue, int bufferSize)
  40. {
  41. queue->buf = (uint8_t*)os_zalloc(bufferSize);
  42. RINGBUF_Init(&queue->rb, queue->buf, bufferSize);
  43. }
  44. int32_t ICACHE_FLASH_ATTR QUEUE_Puts(QUEUE *queue, uint8_t* buffer, uint16_t len)
  45. {
  46. uint32_t ret;
  47. last_rb_p_r = queue->rb.p_r;
  48. last_rb_p_w = queue->rb.p_w;
  49. last_fill_cnt = queue->rb.fill_cnt;
  50. ret = PROTO_AddRb(&queue->rb, buffer, len);
  51. if (ret == -1) {
  52. // rolling ring buffer back
  53. queue->rb.p_r = last_rb_p_r;
  54. queue->rb.p_w = last_rb_p_w;
  55. queue->rb.fill_cnt = last_fill_cnt;
  56. }
  57. return ret;
  58. }
  59. int32_t ICACHE_FLASH_ATTR QUEUE_Gets(QUEUE *queue, uint8_t* buffer, uint16_t* len, uint16_t maxLen)
  60. {
  61. return PROTO_ParseRb(&queue->rb, buffer, len, maxLen);
  62. }
  63. BOOL ICACHE_FLASH_ATTR QUEUE_IsEmpty(QUEUE *queue)
  64. {
  65. if (queue->rb.fill_cnt <= 0)
  66. return TRUE;
  67. return FALSE;
  68. }