4 * Copyright(c) 2016 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 #include <rte_mempool.h>
36 #include <rte_malloc.h>
38 struct rte_mempool_stack
{
47 stack_alloc(struct rte_mempool
*mp
)
49 struct rte_mempool_stack
*s
;
50 unsigned n
= mp
->size
;
51 int size
= sizeof(*s
) + (n
+16)*sizeof(void *);
53 /* Allocate our local memory structure */
54 s
= rte_zmalloc_socket("mempool-stack",
59 RTE_LOG(ERR
, MEMPOOL
, "Cannot allocate stack!\n");
63 rte_spinlock_init(&s
->sl
);
72 stack_enqueue(struct rte_mempool
*mp
, void * const *obj_table
,
75 struct rte_mempool_stack
*s
= mp
->pool_data
;
79 rte_spinlock_lock(&s
->sl
);
80 cache_objs
= &s
->objs
[s
->len
];
82 /* Is there sufficient space in the stack ? */
83 if ((s
->len
+ n
) > s
->size
) {
84 rte_spinlock_unlock(&s
->sl
);
88 /* Add elements back into the cache */
89 for (index
= 0; index
< n
; ++index
, obj_table
++)
90 cache_objs
[index
] = *obj_table
;
94 rte_spinlock_unlock(&s
->sl
);
99 stack_dequeue(struct rte_mempool
*mp
, void **obj_table
,
102 struct rte_mempool_stack
*s
= mp
->pool_data
;
106 rte_spinlock_lock(&s
->sl
);
108 if (unlikely(n
> s
->len
)) {
109 rte_spinlock_unlock(&s
->sl
);
113 cache_objs
= s
->objs
;
115 for (index
= 0, len
= s
->len
- 1; index
< n
;
116 ++index
, len
--, obj_table
++)
117 *obj_table
= cache_objs
[len
];
120 rte_spinlock_unlock(&s
->sl
);
125 stack_get_count(const struct rte_mempool
*mp
)
127 struct rte_mempool_stack
*s
= mp
->pool_data
;
133 stack_free(struct rte_mempool
*mp
)
135 rte_free((void *)(mp
->pool_data
));
138 static struct rte_mempool_ops ops_stack
= {
140 .alloc
= stack_alloc
,
142 .enqueue
= stack_enqueue
,
143 .dequeue
= stack_dequeue
,
144 .get_count
= stack_get_count
147 MEMPOOL_REGISTER_OPS(ops_stack
);