1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*****************************************************************
* gmerlin - a general purpose multimedia framework and applications
*
* Copyright (c) 2001 - 2024 Members of the Gmerlin project
* http://github.com/bplaum
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
* *****************************************************************/
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <gmerlin/accelerator.h>
#include <gavl/keycodes.h>
struct bg_accelerator_map_s
{
int num;
int num_alloc;
bg_accelerator_t * accels;
};
void
bg_accelerator_map_append(bg_accelerator_map_t * m,
int key, int mask, int id)
{
if(m->num_alloc <= m->num + 2)
{
m->num_alloc = m->num + 100;
m->accels = realloc(m->accels, m->num_alloc * sizeof(*m->accels));
}
m->accels[m->num].key = key;
m->accels[m->num].mask = mask;
m->accels[m->num].id = id;
m->num++;
m->accels[m->num].key = GAVL_KEY_NONE;
}
/* Array is terminated with GAVL_KEY_NONE */
void
bg_accelerator_map_append_array(bg_accelerator_map_t * m,
const bg_accelerator_t * tail)
{
int num_append = 0;
while(tail[num_append].key != GAVL_KEY_NONE)
num_append++;
if(m->num_alloc <= m->num + num_append + 1)
{
m->num_alloc = m->num + num_append + 100;
m->accels = realloc(m->accels, m->num_alloc * sizeof(*m->accels));
}
memcpy(m->accels + m->num, tail, num_append * sizeof(*m->accels));
m->num += num_append;
m->accels[m->num].key = GAVL_KEY_NONE;
}
const bg_accelerator_t *
bg_accelerator_map_get_accels(const bg_accelerator_map_t * m)
{
return m->accels;
}
void
bg_accelerator_map_destroy(bg_accelerator_map_t * m)
{
if(m->accels)
free(m->accels);
free(m);
}
bg_accelerator_map_t *
bg_accelerator_map_create()
{
bg_accelerator_map_t * ret;
ret = calloc(1, sizeof(*ret));
ret->num_alloc = 1;
ret->accels = calloc(ret->num_alloc, sizeof(*ret->accels));
ret->accels[0].key = GAVL_KEY_NONE;
return ret;
}
static int find_by_id(const bg_accelerator_map_t * m, int id)
{
int i;
for(i = 0; i < m->num; i++)
{
if(m->accels[i].id == id)
return i;
}
return -1;
}
static int find_by_key(const bg_accelerator_t * m, int key, int mask)
{
int i = 0;
while(m[i].key != GAVL_KEY_NONE)
{
if((m[i].key == key) &&
(m[i].mask == mask))
return i;
i++;
}
return -1;
}
void
bg_accelerator_map_remove(bg_accelerator_map_t * m, int id)
{
int index;
index = find_by_id(m, id);
if(index < 0)
return;
if(index < m->num - 1)
{
memmove(m->accels + index,
m->accels + index + 1,
sizeof(*m->accels) * (m->num - 1 - index));
}
m->num--;
}
int
bg_accelerator_array_has_accel(const bg_accelerator_t * accel,
int key, int mask, int * id)
{
int result;
result = find_by_key(accel, key, mask);
if(result >= 0)
{
if(id)
*id = accel[result].id;
return 1;
}
return 0;
}
int
bg_accelerator_map_has_accel(const bg_accelerator_map_t * m,
int key, int mask, int * id)
{
return bg_accelerator_array_has_accel(m->accels, key, mask, id);
}
int
bg_accelerator_map_has_accel_with_id(const bg_accelerator_map_t * m,
int id)
{
if(find_by_id(m, id) < 0)
return 0;
return 1;
}
void
bg_accelerator_map_clear(bg_accelerator_map_t * m)
{
m->num = 0;
}
|
