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
180
181
182
|
/*
* Copyright (C) 2007-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include <assert.h>
#include <stdio.h>
#include "glue.h"
#include "sig_match.h"
static void
sig_match_send_event(
const struct sig_match* m,
void* s,
bool visible,
uint16_t x, uint16_t y,
uint16_t w, uint16_t h
)
{
unsigned int nr;
for (nr = 0; ; nr++) {
if (nr == m->nmembers) {
return;
}
if (m->member[nr].s == s) {
continue;
}
if (m->member[nr].f->event) {
m->member[nr].f->event(
m->member[nr].s,
visible,
x, y,
w, h);
}
}
}
void
sig_match_event(
const struct sig_match* m,
void *s,
uint16_t x, uint16_t y,
uint16_t w, uint16_t h
)
{
sig_match_send_event(m, s, true, x, y, w, h);
}
void
sig_match_invisible(const struct sig_match* m, void *s)
{
sig_match_send_event(m, s, false, 0, 0, 0, 0);
}
void
sig_match_add_match(const struct sig_match* m, void *s, const char* image)
{
unsigned int nr;
for (nr = 0; ; nr++) {
if (nr == m->nmembers) {
return;
}
if (m->member[nr].s == s) {
continue;
}
if (m->member[nr].f->add_match) {
m->member[nr].f->add_match(m->member[nr].s, image);
}
}
}
void
sig_match_add_match_partial(
const struct sig_match* m,
void *s,
const char* image,
uint16_t x,
uint16_t y,
uint16_t w,
uint16_t h
)
{
unsigned int nr;
for (nr = 0; ; nr++) {
if (nr == m->nmembers) {
return;
}
if (m->member[nr].s == s) {
continue;
}
if (m->member[nr].f->add_match_partial) {
m->member[nr].f->add_match_partial(m->member[nr].s,
image,
x, y,
w, h);
}
}
}
void
sig_match_remove_match(const struct sig_match* m, void *s)
{
unsigned int nr;
for (nr = 0; ; nr++) {
if (nr == m->nmembers) {
return;
}
if (m->member[nr].s == s) {
continue;
}
if (m->member[nr].f->remove_match) {
m->member[nr].f->remove_match(m->member[nr].s);
}
}
}
void
sig_match_connect(
struct sig_match* m,
void *s,
const struct sig_match_funcs *f
)
{
assert(m);
assert(m->type == SIG_GEN_MATCH);
assert(m->nmembers < sizeof(m->member) / sizeof(m->member[0]));
m->member[m->nmembers].f = f;
m->member[m->nmembers].s = s;
m->nmembers++;
}
struct sig_match*
sig_match_create(const char *name)
{
struct sig_match* m;
m = shm_alloc(sizeof(*m));
assert(m);
m->type = SIG_GEN_MATCH;
m->nmembers = 0;
return m;
}
void
sig_match_destroy(struct sig_match *sig)
{
assert(sig);
assert(sig->type == SIG_GEN_MATCH);
shm_free(sig);
}
void
sig_match_suspend(struct sig_match *b, FILE *fSig)
{
size_t size = sizeof(*b);
generic_suspend(b, size, fSig);
}
void
sig_match_resume(struct sig_match *b, FILE *fSig)
{
size_t size = sizeof(*b);
generic_resume(b, size, fSig);
}
|
