4 * Copyright(c) 2010-2012 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 <sys/queue.h>
42 #include <rte_memory.h>
43 #include <rte_memzone.h>
44 #include <rte_launch.h>
45 #include <rte_tailq.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 "eal_private.h"
56 static unsigned tailq_idx = 0;
58 struct rte_tailq_head *
59 rte_eal_tailq_lookup(const char *name)
62 struct rte_mem_config *mcfg = rte_eal_get_configuration()->mem_config;
65 * the algorithm is not optimal (linear), but there are few
66 * tailq's and this function should be called at init only
68 for (i = 0; i < RTE_MAX_TAILQ; i++) {
69 if (!strncmp(name, mcfg->tailq_head[i].qname, RTE_TAILQ_NAMESIZE-1))
70 return &mcfg->tailq_head[i];
75 struct rte_tailq_head *
76 rte_eal_tailq_reserve(const char *name)
78 struct rte_mem_config *mcfg = rte_eal_get_configuration()->mem_config;
80 if (rte_eal_process_type() == RTE_PROC_SECONDARY)
81 return rte_eal_tailq_lookup(name);
83 if (tailq_idx == RTE_MAX_TAILQ){
84 RTE_LOG(ERR, EAL, "%s(): No more room in config\n", __func__);
88 /* zone already exist */
89 if (rte_eal_tailq_lookup(name) != NULL) {
90 RTE_LOG(DEBUG, EAL, "%s(): tailq <%s> already exists\n",
95 rte_snprintf(mcfg->tailq_head[tailq_idx].qname, RTE_TAILQ_NAMESIZE,
96 "%.*s", (int)(RTE_TAILQ_NAMESIZE - 1), name);
98 return &mcfg->tailq_head[tailq_idx++];
102 rte_eal_tailqs_init(void)
105 struct rte_config *cfg = rte_eal_get_configuration();
107 if (rte_eal_process_type() == RTE_PROC_PRIMARY)
108 for (i = 0; i < RTE_MAX_TAILQ; i++)
109 TAILQ_INIT(&cfg->mem_config->tailq_head[i].tailq_head);