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
|
/*
* Copyright (c) 2019-2022 David Timber <dxdt@dev.snart.me>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <errno.h>
#include "util_rt.h"
#include "pth.h"
void prne_init_worker (prne_worker_t *w) {
prne_memzero(w, sizeof(prne_worker_t));
}
void prne_free_worker (prne_worker_t *w) {
if (w == NULL) {
return;
}
if (w->ctx != NULL) {
prne_assert(w->free_ctx != NULL);
w->free_ctx(w->ctx);
}
if (w->pth != NULL) {
pth_abort(w->pth);
}
pth_attr_destroy(w->attr);
prne_memzero(w, sizeof(prne_worker_t));
}
void prne_fin_worker (prne_worker_t *w) {
if (w->fin != NULL) {
w->fin(w->ctx);
}
}
int prne_pth_poll (
struct pollfd *pfd,
const nfds_t nfs,
const int timeout,
pth_event_t ev)
{
struct pollfd my_pfd[nfs];
nfds_t p;
int ret;
p = 0;
for (nfds_t i = 0; i < nfs; i += 1) {
if (pfd[i].fd >= FD_SETSIZE) {
errno = EINVAL;
return -1;
}
if (0 <= pfd[i].fd) {
my_pfd[p].fd = pfd[i].fd;
my_pfd[p].events = pfd[i].events;
p += 1;
}
}
if (p == 0) {
return 0;
}
ret = pth_poll_ev(my_pfd, p, timeout, ev);
if (ret >= 0) {
p = 0;
for (nfds_t i = 0; i < nfs; i += 1) {
if (0 <= pfd[i].fd) {
pfd[i].revents = my_pfd[p].revents;
p += 1;
}
else {
pfd[i].revents = 0;
}
}
}
return ret;
}
void prne_pth_cv_notify (pth_mutex_t *lock, pth_cond_t *cond, bool broadcast) {
prne_dbgtrap(pth_mutex_acquire(lock, FALSE, NULL));
prne_dbgtrap(pth_cond_notify(cond, broadcast));
pth_mutex_release(lock);
}
pth_time_t prne_pth_tstimeout (const struct timespec ts) {
return pth_timeout(ts.tv_sec, ts.tv_nsec / 1000);
}
void prne_pth_reset_timer (pth_event_t *ev, const struct timespec *ts) {
pth_event_free(*ev, FALSE);
if (ts != NULL) {
*ev = pth_event(
PTH_EVENT_TIME,
prne_pth_tstimeout(*ts));
prne_assert(*ev != NULL);
}
}
|
