ctimap.c 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (C) 2008, Creative Technology Ltd. All Rights Reserved.
  4. *
  5. * @File ctimap.c
  6. *
  7. * @Brief
  8. * This file contains the implementation of generic input mapper operations
  9. * for input mapper management.
  10. *
  11. * @Author Liu Chun
  12. * @Date May 23 2008
  13. */
  14. #include "ctimap.h"
  15. #include <linux/slab.h>
  16. int input_mapper_add(struct list_head *mappers, struct imapper *entry,
  17. int (*map_op)(void *, struct imapper *), void *data)
  18. {
  19. struct list_head *pos, *pre, *head;
  20. struct imapper *pre_ent, *pos_ent;
  21. head = mappers;
  22. if (list_empty(head)) {
  23. entry->next = entry->addr;
  24. map_op(data, entry);
  25. list_add(&entry->list, head);
  26. return 0;
  27. }
  28. list_for_each(pos, head) {
  29. pos_ent = list_entry(pos, struct imapper, list);
  30. if (pos_ent->slot > entry->slot) {
  31. /* found a position in list */
  32. break;
  33. }
  34. }
  35. if (pos != head) {
  36. pre = pos->prev;
  37. if (pre == head)
  38. pre = head->prev;
  39. __list_add(&entry->list, pos->prev, pos);
  40. } else {
  41. pre = head->prev;
  42. pos = head->next;
  43. list_add_tail(&entry->list, head);
  44. }
  45. pre_ent = list_entry(pre, struct imapper, list);
  46. pos_ent = list_entry(pos, struct imapper, list);
  47. entry->next = pos_ent->addr;
  48. map_op(data, entry);
  49. pre_ent->next = entry->addr;
  50. map_op(data, pre_ent);
  51. return 0;
  52. }
  53. int input_mapper_delete(struct list_head *mappers, struct imapper *entry,
  54. int (*map_op)(void *, struct imapper *), void *data)
  55. {
  56. struct list_head *next, *pre, *head;
  57. struct imapper *pre_ent, *next_ent;
  58. head = mappers;
  59. if (list_empty(head))
  60. return 0;
  61. pre = (entry->list.prev == head) ? head->prev : entry->list.prev;
  62. next = (entry->list.next == head) ? head->next : entry->list.next;
  63. if (pre == &entry->list) {
  64. /* entry is the only one node in mappers list */
  65. entry->next = entry->addr = entry->user = entry->slot = 0;
  66. map_op(data, entry);
  67. list_del(&entry->list);
  68. return 0;
  69. }
  70. pre_ent = list_entry(pre, struct imapper, list);
  71. next_ent = list_entry(next, struct imapper, list);
  72. pre_ent->next = next_ent->addr;
  73. map_op(data, pre_ent);
  74. list_del(&entry->list);
  75. return 0;
  76. }
  77. void free_input_mapper_list(struct list_head *head)
  78. {
  79. struct imapper *entry;
  80. struct list_head *pos;
  81. while (!list_empty(head)) {
  82. pos = head->next;
  83. list_del(pos);
  84. entry = list_entry(pos, struct imapper, list);
  85. kfree(entry);
  86. }
  87. }