1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2010-2014 Intel Corporation
13 #include <rte_memory.h>
14 #include <rte_launch.h>
16 #include <rte_eal_memconfig.h>
17 #include <rte_per_lcore.h>
18 #include <rte_lcore.h>
19 #include <rte_atomic.h>
20 #include <rte_branch_prediction.h>
22 #include <rte_string_fns.h>
23 #include <rte_debug.h>
25 #include "eal_private.h"
26 #include "eal_memcfg.h"
28 TAILQ_HEAD(rte_tailq_elem_head, rte_tailq_elem);
29 /* local tailq list */
30 static struct rte_tailq_elem_head rte_tailq_elem_head =
31 TAILQ_HEAD_INITIALIZER(rte_tailq_elem_head);
33 /* number of tailqs registered, -1 before call to rte_eal_tailqs_init */
34 static int rte_tailqs_count = -1;
36 struct rte_tailq_head *
37 rte_eal_tailq_lookup(const char *name)
40 struct rte_mem_config *mcfg = rte_eal_get_configuration()->mem_config;
45 for (i = 0; i < RTE_MAX_TAILQ; i++) {
46 if (!strncmp(name, mcfg->tailq_head[i].name,
47 RTE_TAILQ_NAMESIZE-1))
48 return &mcfg->tailq_head[i];
55 rte_dump_tailq(FILE *f)
57 struct rte_mem_config *mcfg;
60 mcfg = rte_eal_get_configuration()->mem_config;
62 rte_mcfg_tailq_read_lock();
63 for (i = 0; i < RTE_MAX_TAILQ; i++) {
64 const struct rte_tailq_head *tailq = &mcfg->tailq_head[i];
65 const struct rte_tailq_entry_head *head = &tailq->tailq_head;
67 fprintf(f, "Tailq %u: qname:<%s>, tqh_first:%p, tqh_last:%p\n",
68 i, tailq->name, head->tqh_first, head->tqh_last);
70 rte_mcfg_tailq_read_unlock();
73 static struct rte_tailq_head *
74 rte_eal_tailq_create(const char *name)
76 struct rte_tailq_head *head = NULL;
78 if (!rte_eal_tailq_lookup(name) &&
79 (rte_tailqs_count + 1 < RTE_MAX_TAILQ)) {
80 struct rte_mem_config *mcfg;
82 mcfg = rte_eal_get_configuration()->mem_config;
83 head = &mcfg->tailq_head[rte_tailqs_count];
84 strlcpy(head->name, name, sizeof(head->name) - 1);
85 TAILQ_INIT(&head->tailq_head);
92 /* local register, used to store "early" tailqs before rte_eal_init() and to
93 * ensure secondary process only registers tailqs once. */
95 rte_eal_tailq_local_register(struct rte_tailq_elem *t)
97 struct rte_tailq_elem *temp;
99 TAILQ_FOREACH(temp, &rte_tailq_elem_head, next) {
100 if (!strncmp(t->name, temp->name, sizeof(temp->name)))
104 TAILQ_INSERT_TAIL(&rte_tailq_elem_head, t, next);
109 rte_eal_tailq_update(struct rte_tailq_elem *t)
111 if (rte_eal_process_type() == RTE_PROC_PRIMARY) {
112 /* primary process is the only one that creates */
113 t->head = rte_eal_tailq_create(t->name);
115 t->head = rte_eal_tailq_lookup(t->name);
120 rte_eal_tailq_register(struct rte_tailq_elem *t)
122 if (rte_eal_tailq_local_register(t) < 0) {
124 "%s tailq is already registered\n", t->name);
128 /* if a register happens after rte_eal_tailqs_init(), then we can update
130 if (rte_tailqs_count >= 0) {
131 rte_eal_tailq_update(t);
132 if (t->head == NULL) {
134 "Cannot initialize tailq: %s\n", t->name);
135 TAILQ_REMOVE(&rte_tailq_elem_head, t, next);
148 rte_eal_tailqs_init(void)
150 struct rte_tailq_elem *t;
152 rte_tailqs_count = 0;
154 TAILQ_FOREACH(t, &rte_tailq_elem_head, next) {
155 /* second part of register job for "early" tailqs, see
156 * rte_eal_tailq_register and EAL_REGISTER_TAILQ */
157 rte_eal_tailq_update(t);
158 if (t->head == NULL) {
160 "Cannot initialize tailq: %s\n", t->name);
161 /* TAILQ_REMOVE not needed, error is already fatal */
169 rte_dump_tailq(stderr);