42 	struct rte_tailq_entry_head *d_head;  in test_tailq_early()  local
44 	d_head = RTE_TAILQ_CAST(rte_dummy_tailq.head, rte_tailq_entry_head);  in test_tailq_early()
45 	if (d_head == NULL)  in test_tailq_early()
50 	TAILQ_INSERT_TAIL(d_head, &d_elem, next);  in test_tailq_early()
58 	struct rte_tailq_entry_head *d_head;  in test_tailq_create()  local
65 	d_head = RTE_TAILQ_CAST(rte_dummy_dyn_tailq.head, rte_tailq_entry_head);  in test_tailq_create()
68 	TAILQ_INSERT_TAIL(d_head, &d_dyn_elem, next);  in test_tailq_create()
85 	struct rte_tailq_entry_head *d_head;  in test_tailq_lookup()  local
88 	d_head = RTE_TAILQ_LOOKUP(rte_dummy_tailq.name, rte_tailq_entry_head);  in test_tailq_lookup()
90 	if (d_head == NULL ||  in test_tailq_lookup()
91 	    d_head != RTE_TAILQ_CAST(rte_dummy_tailq.head, rte_tailq_entry_head))  in test_tailq_lookup()
94 	TAILQ_FOREACH(d_ptr, d_head, next)  in test_tailq_lookup()
99 	d_head = RTE_TAILQ_LOOKUP(rte_dummy_dyn_tailq.name, rte_tailq_entry_head);  in test_tailq_lookup()
101 	if (d_head == NULL ||  in test_tailq_lookup()
102 	    d_head != RTE_TAILQ_CAST(rte_dummy_dyn_tailq.head, rte_tailq_entry_head))  in test_tailq_lookup()
105 	TAILQ_FOREACH(d_ptr, d_head, next)  in test_tailq_lookup()
111 	d_head = RTE_TAILQ_LOOKUP("coucou", rte_tailq_entry_head);  in test_tailq_lookup()
112 	if (d_head != NULL)  in test_tailq_lookup()