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