nghttp2_outbound_item.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. /*
  2. * nghttp2 - HTTP/2 C Library
  3. *
  4. * Copyright (c) 2012 Tatsuhiro Tsujikawa
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining
  7. * a copy of this software and associated documentation files (the
  8. * "Software"), to deal in the Software without restriction, including
  9. * without limitation the rights to use, copy, modify, merge, publish,
  10. * distribute, sublicense, and/or sell copies of the Software, and to
  11. * permit persons to whom the Software is furnished to do so, subject to
  12. * the following conditions:
  13. *
  14. * The above copyright notice and this permission notice shall be
  15. * included in all copies or substantial portions of the Software.
  16. *
  17. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  18. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  19. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  20. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
  21. * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  22. * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  23. * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  24. */
  25. #include "nghttp2_outbound_item.h"
  26. #include <assert.h>
  27. #include <string.h>
  28. void nghttp2_outbound_item_init(nghttp2_outbound_item *item) {
  29. item->cycle = 0;
  30. item->qnext = NULL;
  31. item->queued = 0;
  32. memset(&item->aux_data, 0, sizeof(nghttp2_aux_data));
  33. }
  34. void nghttp2_outbound_item_free(nghttp2_outbound_item *item, nghttp2_mem *mem) {
  35. nghttp2_frame *frame;
  36. if (item == NULL) {
  37. return;
  38. }
  39. frame = &item->frame;
  40. switch (frame->hd.type) {
  41. case NGHTTP2_DATA:
  42. nghttp2_frame_data_free(&frame->data);
  43. break;
  44. case NGHTTP2_HEADERS:
  45. nghttp2_frame_headers_free(&frame->headers, mem);
  46. break;
  47. case NGHTTP2_PRIORITY:
  48. nghttp2_frame_priority_free(&frame->priority);
  49. break;
  50. case NGHTTP2_RST_STREAM:
  51. nghttp2_frame_rst_stream_free(&frame->rst_stream);
  52. break;
  53. case NGHTTP2_SETTINGS:
  54. nghttp2_frame_settings_free(&frame->settings, mem);
  55. break;
  56. case NGHTTP2_PUSH_PROMISE:
  57. nghttp2_frame_push_promise_free(&frame->push_promise, mem);
  58. break;
  59. case NGHTTP2_PING:
  60. nghttp2_frame_ping_free(&frame->ping);
  61. break;
  62. case NGHTTP2_GOAWAY:
  63. nghttp2_frame_goaway_free(&frame->goaway, mem);
  64. break;
  65. case NGHTTP2_WINDOW_UPDATE:
  66. nghttp2_frame_window_update_free(&frame->window_update);
  67. break;
  68. default: {
  69. nghttp2_ext_aux_data *aux_data;
  70. aux_data = &item->aux_data.ext;
  71. if (aux_data->builtin == 0) {
  72. nghttp2_frame_extension_free(&frame->ext);
  73. break;
  74. }
  75. switch (frame->hd.type) {
  76. case NGHTTP2_ALTSVC:
  77. nghttp2_frame_altsvc_free(&frame->ext, mem);
  78. break;
  79. case NGHTTP2_ORIGIN:
  80. nghttp2_frame_origin_free(&frame->ext, mem);
  81. break;
  82. case NGHTTP2_PRIORITY_UPDATE:
  83. nghttp2_frame_priority_update_free(&frame->ext, mem);
  84. break;
  85. default:
  86. assert(0);
  87. break;
  88. }
  89. }
  90. }
  91. }
  92. void nghttp2_outbound_queue_init(nghttp2_outbound_queue *q) {
  93. q->head = q->tail = NULL;
  94. q->n = 0;
  95. }
  96. void nghttp2_outbound_queue_push(nghttp2_outbound_queue *q,
  97. nghttp2_outbound_item *item) {
  98. if (q->tail) {
  99. q->tail = q->tail->qnext = item;
  100. } else {
  101. q->head = q->tail = item;
  102. }
  103. ++q->n;
  104. }
  105. void nghttp2_outbound_queue_pop(nghttp2_outbound_queue *q) {
  106. nghttp2_outbound_item *item;
  107. if (!q->head) {
  108. return;
  109. }
  110. item = q->head;
  111. q->head = q->head->qnext;
  112. item->qnext = NULL;
  113. if (!q->head) {
  114. q->tail = NULL;
  115. }
  116. --q->n;
  117. }