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
|
/*
* BSD LICENSE
*
* Copyright (C) 2017 Cavium Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Intel Corporation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdio.h>
#include <rte_mempool.h>
#include <rte_malloc.h>
#include <rte_mbuf.h>
#include "octeontx_fpavf.h"
static int
octeontx_fpavf_alloc(struct rte_mempool *mp)
{
uintptr_t pool;
uint32_t memseg_count = mp->size;
uint32_t object_size;
int rc = 0;
object_size = mp->elt_size + mp->header_size + mp->trailer_size;
pool = octeontx_fpa_bufpool_create(object_size, memseg_count,
OCTEONTX_FPAVF_BUF_OFFSET,
mp->socket_id);
rc = octeontx_fpa_bufpool_block_size(pool);
if (rc < 0)
goto _end;
if ((uint32_t)rc != object_size)
fpavf_log_err("buffer size mismatch: %d instead of %u\n",
rc, object_size);
fpavf_log_info("Pool created %p with .. ", (void *)pool);
fpavf_log_info("obj_sz %d, cnt %d\n", object_size, memseg_count);
/* assign pool handle to mempool */
mp->pool_id = (uint64_t)pool;
return 0;
_end:
return rc;
}
static void
octeontx_fpavf_free(struct rte_mempool *mp)
{
uintptr_t pool;
pool = (uintptr_t)mp->pool_id;
octeontx_fpa_bufpool_destroy(pool, mp->socket_id);
}
static __rte_always_inline void *
octeontx_fpa_bufpool_alloc(uintptr_t handle)
{
return (void *)(uintptr_t)fpavf_read64((void *)(handle +
FPA_VF_VHAURA_OP_ALLOC(0)));
}
static __rte_always_inline void
octeontx_fpa_bufpool_free(uintptr_t handle, void *buf)
{
uint64_t free_addr = FPA_VF_FREE_ADDRS_S(FPA_VF_VHAURA_OP_FREE(0),
0 /* DWB */, 1 /* FABS */);
fpavf_write64((uintptr_t)buf, (void *)(uintptr_t)(handle + free_addr));
}
static int
octeontx_fpavf_enqueue(struct rte_mempool *mp, void * const *obj_table,
unsigned int n)
{
uintptr_t pool;
unsigned int index;
pool = (uintptr_t)mp->pool_id;
/* Get pool bar address from handle */
pool &= ~(uint64_t)FPA_GPOOL_MASK;
for (index = 0; index < n; index++, obj_table++)
octeontx_fpa_bufpool_free(pool, *obj_table);
return 0;
}
static int
octeontx_fpavf_dequeue(struct rte_mempool *mp, void **obj_table,
unsigned int n)
{
unsigned int index;
uintptr_t pool;
void *obj;
pool = (uintptr_t)mp->pool_id;
/* Get pool bar address from handle */
pool &= ~(uint64_t)FPA_GPOOL_MASK;
for (index = 0; index < n; index++, obj_table++) {
obj = octeontx_fpa_bufpool_alloc(pool);
if (obj == NULL) {
/*
* Failed to allocate the requested number of objects
* from the pool. Current pool implementation requires
* completing the entire request or returning error
* otherwise.
* Free already allocated buffers to the pool.
*/
for (; index > 0; index--) {
obj_table--;
octeontx_fpa_bufpool_free(pool, *obj_table);
}
return -ENOMEM;
}
*obj_table = obj;
}
return 0;
}
static unsigned int
octeontx_fpavf_get_count(const struct rte_mempool *mp)
{
uintptr_t pool;
pool = (uintptr_t)mp->pool_id;
return octeontx_fpa_bufpool_free_count(pool);
}
static int
octeontx_fpavf_get_capabilities(const struct rte_mempool *mp,
unsigned int *flags)
{
RTE_SET_USED(mp);
*flags |= (MEMPOOL_F_CAPA_PHYS_CONTIG |
MEMPOOL_F_CAPA_BLK_ALIGNED_OBJECTS);
return 0;
}
static int
octeontx_fpavf_register_memory_area(const struct rte_mempool *mp,
char *vaddr, rte_iova_t paddr, size_t len)
{
RTE_SET_USED(paddr);
uint8_t gpool;
uintptr_t pool_bar;
gpool = octeontx_fpa_bufpool_gpool(mp->pool_id);
pool_bar = mp->pool_id & ~(uint64_t)FPA_GPOOL_MASK;
return octeontx_fpavf_pool_set_range(pool_bar, len, vaddr, gpool);
}
static struct rte_mempool_ops octeontx_fpavf_ops = {
.name = "octeontx_fpavf",
.alloc = octeontx_fpavf_alloc,
.free = octeontx_fpavf_free,
.enqueue = octeontx_fpavf_enqueue,
.dequeue = octeontx_fpavf_dequeue,
.get_count = octeontx_fpavf_get_count,
.get_capabilities = octeontx_fpavf_get_capabilities,
.register_memory_area = octeontx_fpavf_register_memory_area,
};
MEMPOOL_REGISTER_OPS(octeontx_fpavf_ops);
|
