4
0

qdevice-heuristics-result-notifier.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137
  1. /*
  2. * Copyright (c) 2015-2020 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Jan Friesse (jfriesse@redhat.com)
  7. *
  8. * This software licensed under BSD license, the text of which follows:
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions are met:
  12. *
  13. * - Redistributions of source code must retain the above copyright notice,
  14. * this list of conditions and the following disclaimer.
  15. * - Redistributions in binary form must reproduce the above copyright notice,
  16. * this list of conditions and the following disclaimer in the documentation
  17. * and/or other materials provided with the distribution.
  18. * - Neither the name of the Red Hat, Inc. nor the names of its
  19. * contributors may be used to endorse or promote products derived from this
  20. * software without specific prior written permission.
  21. *
  22. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  23. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  26. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  27. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  28. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  29. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  30. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  31. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  32. * THE POSSIBILITY OF SUCH DAMAGE.
  33. */
  34. #include <stdlib.h>
  35. #include <string.h>
  36. #include "qdevice-heuristics-result-notifier.h"
  37. void
  38. qdevice_heuristics_result_notifier_list_init(struct qdevice_heuristics_result_notifier_list *notifier_list)
  39. {
  40. TAILQ_INIT(notifier_list);
  41. }
  42. struct qdevice_heuristics_result_notifier_item *
  43. qdevice_heuristics_result_notifier_list_get(struct qdevice_heuristics_result_notifier_list *notifier_list,
  44. qdevice_heuristics_result_notifier_callback callback)
  45. {
  46. struct qdevice_heuristics_result_notifier_item *item;
  47. TAILQ_FOREACH(item, notifier_list, entries) {
  48. if (item->callback == callback) {
  49. return (item);
  50. }
  51. }
  52. return (NULL);
  53. }
  54. struct qdevice_heuristics_result_notifier_item *
  55. qdevice_heuristics_result_notifier_list_add(struct qdevice_heuristics_result_notifier_list *notifier_list,
  56. qdevice_heuristics_result_notifier_callback callback,
  57. void *user_data1, void *user_data2)
  58. {
  59. struct qdevice_heuristics_result_notifier_item *item;
  60. item = qdevice_heuristics_result_notifier_list_get(notifier_list, callback);
  61. if (item != NULL) {
  62. return (item);
  63. }
  64. item = (struct qdevice_heuristics_result_notifier_item *)malloc(sizeof(*item));
  65. if (item == NULL) {
  66. return (NULL);
  67. }
  68. memset(item, 0, sizeof(*item));
  69. item->callback = callback;
  70. item->active = 0;
  71. item->user_data1 = user_data1;
  72. item->user_data2 = user_data2;
  73. TAILQ_INSERT_TAIL(notifier_list, item, entries);
  74. return (item);
  75. }
  76. int
  77. qdevice_heuristics_result_notifier_list_set_active(struct qdevice_heuristics_result_notifier_list *notifier_list,
  78. qdevice_heuristics_result_notifier_callback callback, int active)
  79. {
  80. struct qdevice_heuristics_result_notifier_item *item;
  81. item = qdevice_heuristics_result_notifier_list_get(notifier_list, callback);
  82. if (item == NULL) {
  83. return (-1);
  84. }
  85. item->active = active;
  86. return (0);
  87. }
  88. void
  89. qdevice_heuristics_result_notifier_list_free(struct qdevice_heuristics_result_notifier_list *notifier_list)
  90. {
  91. struct qdevice_heuristics_result_notifier_item *item;
  92. struct qdevice_heuristics_result_notifier_item *item_next;
  93. item = TAILQ_FIRST(notifier_list);
  94. while (item != NULL) {
  95. item_next = TAILQ_NEXT(item, entries);
  96. free(item);
  97. item = item_next;
  98. }
  99. }
  100. int
  101. qdevice_heuristics_result_notifier_notify(struct qdevice_heuristics_result_notifier_list *notifier_list,
  102. void *heuristics_instance, uint32_t seq_number, enum qdevice_heuristics_exec_result exec_result)
  103. {
  104. struct qdevice_heuristics_result_notifier_item *item;
  105. TAILQ_FOREACH(item, notifier_list, entries) {
  106. if (!item->active) {
  107. continue ;
  108. }
  109. if (item->callback(seq_number, exec_result, item->user_data1, item->user_data2) != 0) {
  110. return (-1);
  111. }
  112. }
  113. return (0);
  114. }