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
|
//
// Copyright 2017 Garrett D'Amore <garrett@damore.org>
//
// This software is supplied under the terms of the MIT License, a
// copy of which should be located in the distribution where this
// file was obtained (LICENSE.txt). A copy of the license may also be
// found online at https://opensource.org/licenses/MIT.
//
#include "core/nng_impl.h"
#include <stdlib.h>
#include <string.h>
int
nni_ev_init(nni_event *event, int type, nni_sock *sock)
{
int rv;
memset(event, 0, sizeof (*event));
if ((rv = nni_cv_init(&event->e_cv, &sock->s_mx)) != 0) {
return (rv);
}
NNI_LIST_NODE_INIT(&event->e_node);
event->e_type = type;
event->e_sock = sock;
return (0);
}
void
nni_ev_fini(nni_event *event)
{
nni_cv_fini(&event->e_cv);
}
void
nni_ev_submit(nni_event *event)
{
nni_sock *sock = event->e_sock;
// If nobody is listening, don't bother submitting anything.
// This reduces pressure on the socket locks & condvars, in the
// typical case.
if (nni_list_first(&sock->s_notify) == NULL) {
event->e_pending = 0;
event->e_done = 1;
return;
}
// XXX: taskq_dispatch the event processing.
// This probably should bump a reference count on the socket
// first.
// XXX: One question of note... the aio structures we use elsewhere
// would be better than this. So instead of the handler doing two
// context switches we can just do one.
// Call with socket mutex owned!
if (event->e_pending == 0) {
event->e_pending = 1;
event->e_done = 0;
nni_list_append(&sock->s_events, event);
nni_cv_wake(&sock->s_notify_cv);
}
}
void
nni_notifier(void *arg)
{
nni_sock *sock = arg;
nni_event *event;
nni_notify *notify;
nni_mtx_lock(&sock->s_mx);
for (;;) {
if (sock->s_closing) {
break;
}
if ((event = nni_list_first(&sock->s_events)) != NULL) {
event->e_pending = 0;
nni_list_remove(&sock->s_events, event);
nni_mtx_unlock(&sock->s_mx);
// Lock the notify list, it must not change.
nni_mtx_lock(&sock->s_notify_mx);
NNI_LIST_FOREACH (&sock->s_notify, notify) {
if ((notify->n_mask & event->e_type) == 0) {
// No interest.
continue;
}
notify->n_func(event, notify->n_arg);
}
nni_mtx_unlock(&sock->s_notify_mx);
nni_mtx_lock(&sock->s_mx);
// Let the event submitter know we are done, unless
// they have resubmitted. Submitters can wait on this
// lock.
event->e_done = 1;
nni_cv_wake(&event->e_cv);
continue;
}
nni_cv_wait(&sock->s_notify_cv);
}
nni_mtx_unlock(&sock->s_mx);
}
nni_notify *
nni_add_notify(nni_sock *sock, int mask, nng_notify_func fn, void *arg)
{
nni_notify *notify;
if ((notify = NNI_ALLOC_STRUCT(notify)) == NULL) {
return (NULL);
}
notify->n_func = fn;
notify->n_arg = arg;
notify->n_mask = mask;
NNI_LIST_NODE_INIT(¬ify->n_node);
nni_mtx_lock(&sock->s_notify_mx);
nni_list_append(&sock->s_notify, notify);
nni_mtx_unlock(&sock->s_notify_mx);
return (notify);
}
void
nni_rem_notify(nni_sock *sock, nni_notify *notify)
{
nni_mtx_lock(&sock->s_notify_mx);
nni_list_remove(&sock->s_notify, notify);
nni_mtx_unlock(&sock->s_notify_mx);
NNI_FREE_STRUCT(notify);
}
|
