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
|
/*
* Copyright 2016 Garrett D'Amore <garrett@damore.org>
*
* 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 "../nng.h"
#include "nng_impl.h"
/*
* Message queue. These operate in some respects like Go channels,
* but as we have access to the internals, we have made some fundamental
* differences and improvements. For example, these can grow, and either
* side can close, and they may be closed more than once.
*/
struct nni_msgqueue {
nni_mutex_t mq_lock;
nni_cond_t mq_readable;
nni_cond_t mq_writeable;
int mq_cap;
int mq_len;
int mq_get;
int mq_put;
int mq_closed;
nng_msg_t *mq_msgs;
};
int
nni_msgqueue_create(nni_msgqueue_t *mqp, int cap)
{
struct nni_msgqueue *mq;
int rv;
if (cap < 1) {
return (NNG_EINVAL);
}
if ((mq = nni_alloc(sizeof (*mq))) == NULL) {
return (NNG_ENOMEM);
}
if ((rv = nni_mutex_create(&mq->mq_lock)) != 0) {
nni_free(mq, sizeof (*mq));
return (rv);
}
if ((rv = nni_cond_create(&mq->mq_readable, mq->mq_lock)) != 0) {
nni_mutex_destroy(mq->mq_lock);
nni_free(mq, sizeof (*mq));
return (NNG_ENOMEM);
}
if ((rv = nni_cond_create(&mq->mq_writeable, mq->mq_lock)) != 0) {
nni_cond_destroy(mq->mq_readable);
nni_mutex_destroy(mq->mq_lock);
return (NNG_ENOMEM);
}
if ((mq->mq_msgs = nni_alloc(sizeof (nng_msg_t) * cap)) == NULL) {
nni_cond_destroy(mq->mq_writeable);
nni_cond_destroy(mq->mq_readable);
nni_mutex_destroy(mq->mq_lock);
return (NNG_ENOMEM);
}
mq->mq_cap = cap;
mq->mq_len = 0;
mq->mq_get = 0;
mq->mq_put = 0;
mq->mq_closed = 0;
*mqp = mq;
return (0);
}
void
nni_msgqueue_destroy(nni_msgqueue_t mq)
{
nng_msg_t msg;
nni_cond_destroy(mq->mq_writeable);
nni_cond_destroy(mq->mq_readable);
nni_mutex_destroy(mq->mq_lock);
/* Free any orphaned messages. */
while (mq->mq_len > 0) {
msg = mq->mq_msgs[mq->mq_get];
mq->mq_get++;
if (mq->mq_get > mq->mq_cap) {
mq->mq_get = 0;
}
mq->mq_len--;
nng_msg_free(msg);
}
nni_free(mq->mq_msgs, mq->mq_cap * sizeof (nng_msg_t));
nni_free(mq, sizeof (*mq));
}
|
