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
|
/*
*
* Copyright (c) 2018 Huawei Technologies Co.,Ltd.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdio.h>
#include <string.h>
#include "nstack_log.h"
#include "dmm_ring.h"
#include "dmm_ring_base.h"
#include "nsfw_mem_api.h"
#include "nstack_securec.h"
/* enqueue several objects in a ring.
ring: point to the ring
p: object pointer list array
num: number of object
fixed: enqueue fixed number
single_cons: is single producer
<return>: number of enqueued object, 0: queue is full
*/
inline static int
dmm_ring_enqueue(struct dmm_ring *ring, void **p, int num,
int fixed, int is_sp)
{
int n, pos, new_pos;
n = dmm_enqueue_prep(ring, num, &pos, fixed, is_sp);
if (n == 0)
return 0;
new_pos = dmm_enqueue_copy(ring, pos, p, n);
dmm_enqueue_done(ring, pos, new_pos, is_sp);
return n;
}
inline static int dmm_fix_enqueue(struct dmm_ring *ring, void **p, int num)
{
return dmm_ring_enqueue(ring, p, num, 1, ring->is_sp);
}
inline static int dmm_var_enqueue(struct dmm_ring *ring, void **p, int num)
{
return dmm_ring_enqueue(ring, p, num, 0, ring->is_sp);
}
inline static int dmm_enqueue(struct dmm_ring *ring, void *p)
{
return dmm_var_enqueue(ring, &p, 1);
}
inline static int
dmm_array_enqueue(struct dmm_ring *ring, void *array,
int num, size_t elt_size)
{
int n, pos, new_pos;
n = dmm_enqueue_prep(ring, num, &pos, 0, ring->is_sp);
if (n == 0)
return 0;
new_pos = dmm_enqueue_copy_array(ring, pos, array, n, elt_size);
dmm_enqueue_done(ring, pos, new_pos, ring->is_sp);
return n;
}
void dmm_ring_dump(struct dmm_ring *ring, int list)
{
if (!ring)
return;
NSFW_LOGINF("ring:%p size:%d flag:0x%x prod:%d-%d/%d cons:%d-%d/%d",
ring, ring->size, ring->flag,
ring->prod_head, ring->prod_tail, ring->is_sp,
ring->cons_head, ring->cons_tail, ring->is_sc);
if (list && dmm_ring_count(ring))
{
int count = 0;
void **p = (void **) (ring + 1);
int i = ring->cons_head;
while (i != ring->prod_tail)
{
if ((count++ & 3) == 0)
NSFW_LOGINF("\n");
NSFW_LOGINF(" %d:%p", i, p[i]);
if (++i >= ring->size)
i = 0;
}
}
NSFW_LOGINF("\n----------------\n");
}
int
dmm_ring_init(struct dmm_ring *ring, int num, size_t eltsize, int flag,
unsigned char mem_type)
{
if (num > DMM_RING_MAX_NUM)
return -1;
(void) memset_s(ring, sizeof(struct dmm_ring), 0,
sizeof(struct dmm_ring));
ring->memtype = mem_type;
ring->ringflag = NSFW_MRING_MPMC;
ring->size = num + 1;
ring->eltsize = eltsize;
ring->prod_head = 0;
ring->prod_tail = 0;
ring->is_sp = flag & DMM_RING_INIT_SP;
ring->cons_head = 0;
ring->cons_tail = 0;
ring->is_sc = flag & DMM_RING_INIT_SC;
return 0;
}
/* dequeue several objects from a ring.
ring: point to the ring
p: save object array
num: number of p
fixed: dequeue fixed number
single_cons: is single consumer
<return>: number of dequeued object, 0: queue is empty
*/
inline static int
dmm_ring_dequeue(struct dmm_ring *ring, void **p, int num,
int fixed, int single_cons)
{
int n, pos, new_pos;
n = dmm_dequeue_prep(ring, num, &pos, fixed, single_cons);
if (n == 0)
return 0;
new_pos = dmm_dequeue_copy(ring, pos, p, n);
dmm_dequeue_done(ring, pos, new_pos, single_cons);
return n;
}
inline static int dmm_fix_dequeue(struct dmm_ring *ring, void **p, int num)
{
return dmm_ring_dequeue(ring, p, num, 1, ring->is_sc);
}
inline static int dmm_var_dequeue(struct dmm_ring *ring, void **p, int num)
{
return dmm_ring_dequeue(ring, p, num, 0, ring->is_sc);
}
inline static int dmm_dequeue(struct dmm_ring *ring, void **p)
{
return dmm_var_dequeue(ring, p, 1);
}
int
dmm_pool_init(struct dmm_ring *pool, size_t elt_size, int num, int flag,
unsigned char memtype)
{
int ret;
void *array;
const size_t ring_size = dmm_ring_bufsize(num);
if (0 != dmm_ring_init(pool, num, elt_size, flag, memtype))
{
NSFW_LOGERR
("init pool's ring failed, num:%d flag:0x%x ring_size:%lu", num,
flag, ring_size);
return -1;
}
array = (char *) pool + ring_size;
ret = dmm_array_enqueue(pool, array, num, elt_size);
if (ret != num)
{
NSFW_LOGERR("enqueue failed, num:%d elt_size:%lu", num, elt_size);
return -1;
}
return 0;
}
int dmm_mem_enqueue(void *ring, void *p)
{
return dmm_enqueue((struct dmm_ring *) ring, p);
}
int dmm_mem_dequeue(void *ring, void **p)
{
return dmm_dequeue((struct dmm_ring *) ring, p);
}
|
