free_queue
free_queue(lp->tx_num_entries, lp->tx_base);
free_queue(lp->tx_num_entries, lp->tx_base);
free_queue(lp->rx_num_entries, lp->rx_base);
goto free_queue;
free_queue:
struct sk_buff_head free_queue;
__skb_queue_head_init(&free_queue);
skb_queue_splice_init(&dch->squeue, &free_queue);
__skb_queue_tail(&free_queue, dch->tx_skb);
__skb_queue_tail(&free_queue, dch->rx_skb);
__skb_queue_purge(&free_queue);
struct sk_buff_head free_queue;
__skb_queue_head_init(&free_queue);
skb_queue_splice_init(&dch->squeue, &free_queue);
__skb_queue_tail(&free_queue, dch->tx_skb);
__skb_queue_tail(&free_queue, dch->rx_skb);
__skb_queue_purge(&free_queue);
struct sk_buff_head free_queue;
__skb_queue_head_init(&free_queue);
skb_queue_splice_init(&dch->squeue, &free_queue);
__skb_queue_tail(&free_queue, dch->tx_skb);
__skb_queue_tail(&free_queue, dch->rx_skb);
__skb_queue_purge(&free_queue);
struct sk_buff_head free_queue;
__skb_queue_head_init(&free_queue);
skb_queue_splice_init(&dch->squeue, &free_queue);
__skb_queue_tail(&free_queue, dch->tx_skb);
__skb_queue_tail(&free_queue, dch->rx_skb);
__skb_queue_purge(&free_queue);
list_add_tail(&ccdc->lsc.request->list, &ccdc->lsc.free_queue);
ccdc_lsc_free_queue(ccdc, &ccdc->lsc.free_queue);
INIT_LIST_HEAD(&ccdc->lsc.free_queue);
ccdc_lsc_free_queue(ccdc, &ccdc->lsc.free_queue);
ccdc_lsc_free_queue(ccdc, &lsc->free_queue);
list_add_tail(&ccdc->lsc.request->list, &ccdc->lsc.free_queue);
list_add_tail(&lsc->active->list, &lsc->free_queue);
list_add_tail(&lsc->request->list, &lsc->free_queue);
if (!list_empty(&lsc->free_queue))
struct list_head free_queue; /* configurations for freeing */
int i, ret, free_queue = -ENOSPC;
if (ret && free_queue < 0) {
free_queue = i;
if (free_queue >= 0 && alloc_for_sta != IWL_INVALID_STA) {
ret = iwl_mvm_free_inactive_queue(mvm, free_queue, queue_owner,
return free_queue;
unsigned int free_queue;
free_queue = ffs(nt->qp_bitmap_free);
if (!free_queue)
free_queue--;
qp = &nt->qp_vec[free_queue];
goto free_queue;
free_queue:
tw_dev->free_queue[tw_dev->free_tail] = request_id;
*request_id = tw_dev->free_queue[tw_dev->free_head];
tw_dev->free_queue[i] = i;
tw_dev->free_queue[i] = i;
unsigned char free_queue[TW_Q_LENGTH];
tw_dev->free_queue[i] = i;
tw_dev->free_queue[i] = i;
*request_id = tw_dev->free_queue[tw_dev->free_head];
tw_dev->free_queue[tw_dev->free_tail] = request_id;
unsigned char free_queue[TW_Q_LENGTH];
tw_dev->free_queue[i] = i;
tw_dev->free_queue[i] = i;
tw_dev->free_queue[tw_dev->free_tail] = request_id;
*request_id = tw_dev->free_queue[tw_dev->free_head];
unsigned char free_queue[TW_Q_LENGTH];
struct __queue *free_queue = &pmlmepriv->free_bss_pool;
spin_lock_bh(&free_queue->lock);
if (list_empty(&free_queue->queue)) {
plist = get_next(&free_queue->queue);
spin_unlock_bh(&free_queue->lock);
struct __queue *free_queue = &pmlmepriv->free_bss_pool;
spin_lock_bh(&free_queue->lock);
list_add_tail(&pnetwork->list, &free_queue->queue);
spin_unlock_bh(&free_queue->lock);
struct __queue *free_queue = &pmlmepriv->free_bss_pool;
list_add_tail(&pnetwork->list, get_list_head(free_queue));
struct __queue *free_queue = &pmlmepriv->free_bss_pool;
spin_lock_bh(&free_queue->lock);
list_add_tail(plist, &free_queue->queue);
spin_unlock_bh(&free_queue->lock);
goto free_queue;
free_queue: