78 	struct qnode_pool *p = rte_malloc_socket(NULL,  in _qnode_pool_create()  local
83 	RTE_ASSERT(p);  in _qnode_pool_create()
85 	p->stub = rte_malloc_socket(NULL,  in _qnode_pool_create()
90 	RTE_ASSERT(p->stub);  in _qnode_pool_create()
93 		strncpy(p->name, name, LT_MAX_NAME_SIZE);  in _qnode_pool_create()
94 	p->name[sizeof(p->name)-1] = 0;  in _qnode_pool_create()
96 	p->stub->pool = p;  in _qnode_pool_create()
97 	p->stub->next = NULL;  in _qnode_pool_create()
98 	p->tail = p->stub;  in _qnode_pool_create()
99 	p->head = p->stub;  in _qnode_pool_create()
100 	p->pre_alloc = prealloc_size;  in _qnode_pool_create()
102 	DIAG_COUNT_INIT(p, rd);  in _qnode_pool_create()
103 	DIAG_COUNT_INIT(p, wr);  in _qnode_pool_create()
104 	DIAG_COUNT_INIT(p, available);  in _qnode_pool_create()
105 	DIAG_COUNT_INIT(p, prealloc);  in _qnode_pool_create()
106 	DIAG_COUNT_INIT(p, capacity);  in _qnode_pool_create()
108 	return p;  in _qnode_pool_create()
116 _qnode_pool_insert(struct qnode_pool *p, struct qnode *n)  in _qnode_pool_insert()  argument
121 	prev = (struct qnode *) __sync_lock_test_and_set((uint64_t *)&p->head,  in _qnode_pool_insert()
140 _pool_remove(struct qnode_pool *p)  in _pool_remove()  argument
143 	struct qnode *tail = p->tail;  in _pool_remove()
147 	if (tail == p->stub) {  in _pool_remove()
151 		p->tail = next;  in _pool_remove()
156 		p->tail = next;  in _pool_remove()
160 	head = p->head;  in _pool_remove()
165 	_qnode_pool_insert(p, p->stub);  in _pool_remove()
169 		p->tail = next;  in _pool_remove()
181 _qnode_pool_remove(struct qnode_pool *p)  in _qnode_pool_remove()  argument
186 		n = _pool_remove(p);  in _qnode_pool_remove()
191 	}  while ((p->head != p->tail) &&  in _qnode_pool_remove()
192 			(p->tail != p->stub));  in _qnode_pool_remove()
203 	struct qnode_pool *p = (THIS_SCHED)->qnode_pool;  in _qnode_alloc()  local
204 	int prealloc_size = p->pre_alloc;  in _qnode_alloc()
208 	if (likely(p->fast_alloc != NULL)) {  in _qnode_alloc()
209 		n = p->fast_alloc;  in _qnode_alloc()
210 		p->fast_alloc = NULL;  in _qnode_alloc()
214 	n = _qnode_pool_remove(p);  in _qnode_alloc()
217 		DIAG_COUNT_INC(p, prealloc);  in _qnode_alloc()
226 			DIAG_COUNT_INC(p, available);  in _qnode_alloc()
227 			DIAG_COUNT_INC(p, capacity);  in _qnode_alloc()
229 			n->pool = p;  in _qnode_alloc()
230 			_qnode_pool_insert(p, n);  in _qnode_alloc()
232 		n = _qnode_pool_remove(p);  in _qnode_alloc()
234 	n->pool = p;  in _qnode_alloc()
235 	DIAG_COUNT_INC(p, rd);  in _qnode_alloc()
236 	DIAG_COUNT_DEC(p, available);  in _qnode_alloc()
248 	struct qnode_pool *p = n->pool;  in _qnode_free()  local
251 	if (unlikely(p->fast_alloc != NULL) ||  in _qnode_free()
253 		DIAG_COUNT_INC(p, wr);  in _qnode_free()
254 		DIAG_COUNT_INC(p, available);  in _qnode_free()
255 		_qnode_pool_insert(p, n);  in _qnode_free()
258 	p->fast_alloc = n;  in _qnode_free()
266 _qnode_pool_destroy(struct qnode_pool *p)  in _qnode_pool_destroy()  argument
268 	rte_free(p->stub);  in _qnode_pool_destroy()
269 	rte_free(p);  in _qnode_pool_destroy()