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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
|
/* t-eventloop.c - Regression test.
* Copyright (C) 2000 Werner Koch (dd9jn)
* Copyright (C) 2001, 2002, 2003, 2004 g10 Code GmbH
*
* This file is part of GPGME.
*
* GPGME is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* GPGME 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program; if not, see <https://gnu.org/licenses/>.
* SPDX-License-Identifier: LGPL-2.1-or-later
*/
/* We need to include config.h so that we know whether we are building
with large file system (LFS) support. */
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <errno.h>
#include <sys/types.h>
#ifdef HAVE_POLL_H
# include <poll.h>
#else
# ifdef HAVE_SYS_SELECT_H
# include <sys/select.h>
# else
# ifdef HAVE_SYS_TIME_H
# include <sys/time.h>
# endif
# endif
#endif
#include <gpgme.h>
#include "t-support.h"
/* Stripped down version of gpgme/wait.c. */
struct op_result
{
int done;
gpgme_error_t err;
};
struct op_result op_result;
struct one_fd
{
int fd;
int dir;
gpgme_io_cb_t fnc;
void *fnc_data;
};
#define FDLIST_MAX 32
struct one_fd fdlist[FDLIST_MAX];
gpgme_error_t
add_io_cb (void *data, int fd, int dir, gpgme_io_cb_t fnc, void *fnc_data,
void **r_tag)
{
struct one_fd *fds = data;
int i;
for (i = 0; i < FDLIST_MAX; i++)
{
if (fds[i].fd == -1)
{
fds[i].fd = fd;
fds[i].dir = dir;
fds[i].fnc = fnc;
fds[i].fnc_data = fnc_data;
break;
}
}
if (i == FDLIST_MAX)
return gpgme_err_make (GPG_ERR_SOURCE_USER_1, GPG_ERR_GENERAL);
*r_tag = &fds[i];
return 0;
}
void
remove_io_cb (void *tag)
{
struct one_fd *fd = tag;
fd->fd = -1;
}
void
io_event (void *data, gpgme_event_io_t type, void *type_data)
{
struct op_result *result = data;
if (type == GPGME_EVENT_DONE)
{
result->done = 1;
result->err = * (gpgme_error_t *) type_data;
}
}
#ifdef HAVE_POLL_H
int
do_select (void)
{
struct pollfd poll_fds[FDLIST_MAX];
nfds_t poll_nfds;
int i, n;
int any = 0;
poll_nfds = 0;
for (i = 0; i < FDLIST_MAX; i++)
if (fdlist[i].fd != -1)
{
poll_fds[poll_nfds].fd = fdlist[i].fd;
poll_fds[poll_nfds].events = 0;
poll_fds[poll_nfds].revents = 0;
if (fdlist[i].dir)
poll_fds[poll_nfds].events |= POLLIN;
else
poll_fds[poll_nfds].events |= POLLOUT;
poll_nfds++;
}
do
{
n = poll (poll_fds, poll_nfds, 1000);
}
while (n < 0 && (errno == EINTR || errno == EAGAIN));
if (n < 0)
return n; /* Error or timeout. */
poll_nfds = 0;
for (i = 0; i < FDLIST_MAX && n; i++)
{
if (fdlist[i].fd != -1)
{
if ((poll_fds[poll_nfds++].revents
& (fdlist[i].dir ? (POLLIN|POLLHUP) : POLLOUT)))
{
assert (n);
n--;
any = 1;
(*fdlist[i].fnc) (fdlist[i].fnc_data, fdlist[i].fd);
}
}
}
return any;
}
#else
int
do_select (void)
{
fd_set rfds;
fd_set wfds;
int i, n;
int any = 0;
struct timeval tv;
FD_ZERO (&rfds);
FD_ZERO (&wfds);
for (i = 0; i < FDLIST_MAX; i++)
if (fdlist[i].fd != -1)
FD_SET (fdlist[i].fd, fdlist[i].dir ? &rfds : &wfds);
tv.tv_sec = 0;
tv.tv_usec = 1000;
do
{
n = select (FD_SETSIZE, &rfds, &wfds, NULL, &tv);
}
while (n < 0 && errno == EINTR);
if (n < 0)
return n; /* Error or timeout. */
for (i = 0; i < FDLIST_MAX && n; i++)
{
if (fdlist[i].fd != -1)
{
if (FD_ISSET (fdlist[i].fd, fdlist[i].dir ? &rfds : &wfds))
{
assert (n);
n--;
any = 1;
(*fdlist[i].fnc) (fdlist[i].fnc_data, fdlist[i].fd);
}
}
}
return any;
}
#endif
int
my_wait (void)
{
int n;
do
{
n = do_select ();
}
while (n >= 0 && !op_result.done);
return 0;
}
struct gpgme_io_cbs io_cbs =
{
add_io_cb,
fdlist,
remove_io_cb,
io_event,
&op_result
};
int
main (void)
{
gpgme_ctx_t ctx;
gpgme_error_t err;
gpgme_data_t in, out;
gpgme_key_t key[3] = { NULL, NULL, NULL };
int i;
init_gpgme (GPGME_PROTOCOL_OpenPGP);
for (i = 0; i < FDLIST_MAX; i++)
fdlist[i].fd = -1;
err = gpgme_engine_check_version (GPGME_PROTOCOL_OpenPGP);
fail_if_err (err);
err = gpgme_new (&ctx);
fail_if_err (err);
gpgme_set_armor (ctx, 1);
gpgme_set_io_cbs (ctx, &io_cbs);
op_result.done = 0;
err = gpgme_data_new_from_mem (&in, "Hallo Leute\n", 12, 0);
fail_if_err (err);
err = gpgme_data_new (&out);
fail_if_err (err);
err = gpgme_get_key (ctx, "A0FF4590BB6122EDEF6E3C542D727CC768697734",
&key[0], 0);
fail_if_err (err);
err = gpgme_get_key (ctx, "D695676BDCEDCC2CDD6152BCFE180B1DA9E3B0B2",
&key[1], 0);
fail_if_err (err);
err = gpgme_op_encrypt_start (ctx, key, GPGME_ENCRYPT_ALWAYS_TRUST, in, out);
fail_if_err (err);
my_wait ();
fail_if_err (op_result.err);
fail_if_err (err);
fflush (NULL);
fputs ("Begin Result:\n", stdout);
print_data (out);
fputs ("End Result.\n", stdout);
gpgme_key_unref (key[0]);
gpgme_key_unref (key[1]);
gpgme_data_release (in);
gpgme_data_release (out);
gpgme_release (ctx);
return 0;
}
|