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.
39 #include <sys/queue.h>
41 #include <cmdline_parse.h>
43 #include <rte_string_fns.h>
44 #include <rte_tailq.h>
48 #define do_return(...) do { \
49 printf("Error at %s, line %d: ", __func__, __LINE__); \
50 printf(__VA_ARGS__); \
54 #define DEFAULT_TAILQ "dummy_q0"
56 static struct rte_dummy d_elem;
59 test_tailq_create(void)
61 struct rte_dummy_head *d_head;
62 char name[RTE_TAILQ_NAMESIZE];
65 /* create a first tailq and check its non-null */
66 d_head = RTE_TAILQ_RESERVE(DEFAULT_TAILQ, rte_dummy_head);
68 do_return("Error allocating "DEFAULT_TAILQ"\n");
70 /* check we can add an item to it
72 TAILQ_INSERT_TAIL(d_head, &d_elem, next);
74 /* try allocating dummy_q0 again, and check for failure */
75 if (RTE_TAILQ_RESERVE(DEFAULT_TAILQ, rte_dummy_head) != NULL)
76 do_return("Error, non-null result returned when attemption to "
77 "re-allocate a tailq\n");
79 /* now fill up the tailq slots available and check we get an error */
80 for (i = 1; i < RTE_MAX_TAILQ; i++){
81 rte_snprintf(name, sizeof(name), "dummy_q%u", i);
82 if ((d_head = RTE_TAILQ_RESERVE(name, rte_dummy_head)) == NULL)
86 /* check that we had an error return before RTE_MAX_TAILQ */
87 if (i == RTE_MAX_TAILQ)
88 do_return("Error, we did not have a reservation failure as expected\n");
94 test_tailq_lookup(void)
96 /* run successful test - check result is found */
97 struct rte_dummy_head *d_head;
98 struct rte_dummy *d_ptr;
100 d_head = RTE_TAILQ_LOOKUP(DEFAULT_TAILQ, rte_dummy_head);
102 do_return("Error with tailq lookup\n");
104 TAILQ_FOREACH(d_ptr, d_head, next)
105 if (d_ptr != &d_elem)
106 do_return("Error with tailq returned from lookup - "
107 "expected element not found\n");
109 /* now try a bad/error lookup */
110 d_head = RTE_TAILQ_LOOKUP("does_not_exist_queue", rte_dummy_head);
112 do_return("Error, lookup does not return NULL for bad tailq name\n");
121 ret |= test_tailq_create();
122 ret |= test_tailq_lookup();