xpqueue.c 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /*
  2. * Copyright (C) 2007 - 2019 Xilinx, Inc.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without modification,
  6. * are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice,
  9. * this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright notice,
  11. * this list of conditions and the following disclaimer in the documentation
  12. * and/or other materials provided with the distribution.
  13. * 3. The name of the author may not be used to endorse or promote products
  14. * derived from this software without specific prior written permission.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
  17. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  18. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
  19. * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  20. * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
  21. * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  22. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  23. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
  24. * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
  25. * OF SUCH DAMAGE.
  26. *
  27. * This file is part of the lwIP TCP/IP stack.
  28. *
  29. */
  30. #include <stdlib.h>
  31. #include "netif/xpqueue.h"
  32. #include "xil_printf.h"
  33. #define NUM_QUEUES 2
  34. pq_queue_t pq_queue[NUM_QUEUES];
  35. pq_queue_t *
  36. pq_create_queue()
  37. {
  38. static int i;
  39. pq_queue_t *q = NULL;
  40. if (i >= NUM_QUEUES) {
  41. xil_printf("ERR: Max Queues allocated\n\r");
  42. return q;
  43. }
  44. q = &pq_queue[i++];
  45. if (!q)
  46. return q;
  47. q->head = q->tail = q->len = 0;
  48. return q;
  49. }
  50. int
  51. pq_enqueue(pq_queue_t *q, void *p)
  52. {
  53. if (q->len == PQ_QUEUE_SIZE)
  54. return -1;
  55. q->data[q->head] = p;
  56. q->head = (q->head + 1)%PQ_QUEUE_SIZE;
  57. q->len++;
  58. return 0;
  59. }
  60. void*
  61. pq_dequeue(pq_queue_t *q)
  62. {
  63. int ptail;
  64. if (q->len == 0)
  65. return NULL;
  66. ptail = q->tail;
  67. q->tail = (q->tail + 1)%PQ_QUEUE_SIZE;
  68. q->len--;
  69. return q->data[ptail];
  70. }
  71. int
  72. pq_qlength(pq_queue_t *q)
  73. {
  74. return q->len;
  75. }