4 * Copyright(c) 2010-2014 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.
34 #include <sys/queue.h>
42 #include <rte_memory.h>
43 #include <rte_memzone.h>
44 #include <rte_launch.h>
46 #include <rte_eal_memconfig.h>
47 #include <rte_per_lcore.h>
48 #include <rte_lcore.h>
49 #include <rte_memory.h>
50 #include <rte_atomic.h>
51 #include <rte_branch_prediction.h>
53 #include <rte_string_fns.h>
54 #include <rte_debug.h>
56 #include "eal_private.h"
58 TAILQ_HEAD(rte_tailq_elem_head, rte_tailq_elem);
59 /* local tailq list */
60 static struct rte_tailq_elem_head rte_tailq_elem_head =
61 TAILQ_HEAD_INITIALIZER(rte_tailq_elem_head);
63 /* number of tailqs registered, -1 before call to rte_eal_tailqs_init */
64 static int rte_tailqs_count = -1;
66 struct rte_tailq_head *
67 rte_eal_tailq_lookup(const char *name)
70 struct rte_mem_config *mcfg = rte_eal_get_configuration()->mem_config;
75 for (i = 0; i < RTE_MAX_TAILQ; i++) {
76 if (!strncmp(name, mcfg->tailq_head[i].name,
77 RTE_TAILQ_NAMESIZE-1))
78 return &mcfg->tailq_head[i];
85 rte_dump_tailq(FILE *f)
87 struct rte_mem_config *mcfg;
90 mcfg = rte_eal_get_configuration()->mem_config;
92 rte_rwlock_read_lock(&mcfg->qlock);
93 for (i = 0; i < RTE_MAX_TAILQ; i++) {
94 const struct rte_tailq_head *tailq = &mcfg->tailq_head[i];
95 const struct rte_tailq_entry_head *head = &tailq->tailq_head;
97 fprintf(f, "Tailq %u: qname:<%s>, tqh_first:%p, tqh_last:%p\n",
98 i, tailq->name, head->tqh_first, head->tqh_last);
100 rte_rwlock_read_unlock(&mcfg->qlock);
103 static struct rte_tailq_head *
104 rte_eal_tailq_create(const char *name)
106 struct rte_tailq_head *head = NULL;
108 if (!rte_eal_tailq_lookup(name) &&
109 (rte_tailqs_count + 1 < RTE_MAX_TAILQ)) {
110 struct rte_mem_config *mcfg;
112 mcfg = rte_eal_get_configuration()->mem_config;
113 head = &mcfg->tailq_head[rte_tailqs_count];
114 snprintf(head->name, sizeof(head->name) - 1, "%s", name);
115 TAILQ_INIT(&head->tailq_head);
122 /* local register, used to store "early" tailqs before rte_eal_init() and to
123 * ensure secondary process only registers tailqs once. */
125 rte_eal_tailq_local_register(struct rte_tailq_elem *t)
127 struct rte_tailq_elem *temp;
129 TAILQ_FOREACH(temp, &rte_tailq_elem_head, next) {
130 if (!strncmp(t->name, temp->name, sizeof(temp->name)))
134 TAILQ_INSERT_TAIL(&rte_tailq_elem_head, t, next);
139 rte_eal_tailq_update(struct rte_tailq_elem *t)
141 if (rte_eal_process_type() == RTE_PROC_PRIMARY) {
142 /* primary process is the only one that creates */
143 t->head = rte_eal_tailq_create(t->name);
145 t->head = rte_eal_tailq_lookup(t->name);
150 rte_eal_tailq_register(struct rte_tailq_elem *t)
152 if (rte_eal_tailq_local_register(t) < 0) {
154 "%s tailq is already registered\n", t->name);
158 /* if a register happens after rte_eal_tailqs_init(), then we can update
160 if (rte_tailqs_count >= 0) {
161 rte_eal_tailq_update(t);
162 if (t->head == NULL) {
164 "Cannot initialize tailq: %s\n", t->name);
165 TAILQ_REMOVE(&rte_tailq_elem_head, t, next);
178 rte_eal_tailqs_init(void)
180 struct rte_tailq_elem *t;
182 rte_tailqs_count = 0;
184 TAILQ_FOREACH(t, &rte_tailq_elem_head, next) {
185 /* second part of register job for "early" tailqs, see
186 * rte_eal_tailq_register and EAL_REGISTER_TAILQ */
187 rte_eal_tailq_update(t);
188 if (t->head == NULL) {
190 "Cannot initialize tailq: %s\n", t->name);
191 /* no need to TAILQ_REMOVE, we are going to panic in
200 rte_dump_tailq(stderr);