82 lines
2.5 KiB
C
82 lines
2.5 KiB
C
|
/*
|
||
|
|
* Copyright (c) 2005-2009 Brocade Communications Systems, Inc.
|
||
|
|
* All rights reserved
|
||
|
|
* www.brocade.com
|
||
|
|
*
|
||
|
|
* Linux driver for Brocade Fibre Channel Host Bus Adapter.
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or modify it
|
||
|
|
* under the terms of the GNU General Public License (GPL) Version 2 as
|
||
|
|
* published by the Free Software Foundation
|
||
|
|
*
|
||
|
|
* This program is distributed in the hope that it will be useful, but
|
||
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
|
|
* General Public License for more details.
|
||
|
|
*/
|
||
|
|
|
||
|
|
/**
|
||
|
|
* bfa_q.h Circular queue definitions.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef __BFA_Q_H__
|
||
|
|
#define __BFA_Q_H__
|
||
|
|
|
||
|
|
#define bfa_q_first(_q) ((void *)(((struct list_head *) (_q))->next))
|
||
|
|
#define bfa_q_next(_qe) (((struct list_head *) (_qe))->next)
|
||
|
|
#define bfa_q_prev(_qe) (((struct list_head *) (_qe))->prev)
|
||
|
|
|
||
|
|
/*
|
||
|
|
* bfa_q_qe_init - to initialize a queue element
|
||
|
|
*/
|
||
|
|
#define bfa_q_qe_init(_qe) { \
|
||
|
|
bfa_q_next(_qe) = (struct list_head *) NULL; \
|
||
|
|
bfa_q_prev(_qe) = (struct list_head *) NULL; \
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* bfa_q_deq - dequeue an element from head of the queue
|
||
|
|
*/
|
||
|
|
#define bfa_q_deq(_q, _qe) { \
|
||
|
|
if (!list_empty(_q)) { \
|
||
|
|
(*((struct list_head **) (_qe))) = bfa_q_next(_q); \
|
||
|
|
bfa_q_prev(bfa_q_next(*((struct list_head **) _qe))) = \
|
||
|
|
(struct list_head *) (_q); \
|
||
|
|
bfa_q_next(_q) = bfa_q_next(*((struct list_head **) _qe)); \
|
||
|
|
BFA_Q_DBG_INIT(*((struct list_head **) _qe)); \
|
||
|
|
} else { \
|
||
|
|
*((struct list_head **) (_qe)) = (struct list_head *) NULL; \
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* bfa_q_deq_tail - dequeue an element from tail of the queue
|
||
|
|
*/
|
||
|
|
#define bfa_q_deq_tail(_q, _qe) { \
|
||
|
|
if (!list_empty(_q)) { \
|
||
|
|
*((struct list_head **) (_qe)) = bfa_q_prev(_q); \
|
||
|
|
bfa_q_next(bfa_q_prev(*((struct list_head **) _qe))) = \
|
||
|
|
(struct list_head *) (_q); \
|
||
|
|
bfa_q_prev(_q) = bfa_q_prev(*(struct list_head **) _qe); \
|
||
|
|
BFA_Q_DBG_INIT(*((struct list_head **) _qe)); \
|
||
|
|
} else { \
|
||
|
|
*((struct list_head **) (_qe)) = (struct list_head *) NULL; \
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* #ifdef BFA_DEBUG (Using bfa_assert to check for debug_build is not
|
||
|
|
* consistent across modules)
|
||
|
|
*/
|
||
|
|
#ifndef BFA_PERF_BUILD
|
||
|
|
#define BFA_Q_DBG_INIT(_qe) bfa_q_qe_init(_qe)
|
||
|
|
#else
|
||
|
|
#define BFA_Q_DBG_INIT(_qe)
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#define bfa_q_is_on_q(_q, _qe) \
|
||
|
|
bfa_q_is_on_q_func(_q, (struct list_head *)(_qe))
|
||
|
|
extern int bfa_q_is_on_q_func(struct list_head *q, struct list_head *qe);
|
||
|
|
|
||
|
|
#endif
|