wr_list
STAILQ_HEAD(, wrqe) wr_list;
STAILQ_INIT(&e->wr_list);
case L2T_STATE_RESOLVING: return STAILQ_EMPTY(&e->wr_list) ? 'R' : 'A';
STAILQ_HEAD(, wrqe) wr_list; /* list of WRs awaiting resolution */
while ((wr = STAILQ_FIRST(&wrq->wr_list)) != NULL) {
STAILQ_REMOVE_HEAD(&wrq->wr_list, link);
if (TAILQ_EMPTY(&wrq->incomplete_wrs) && !STAILQ_EMPTY(&wrq->wr_list))
wr = STAILQ_FIRST(&wrq->wr_list);
STAILQ_REMOVE_HEAD(&wrq->wr_list, link);
} while ((wr = STAILQ_FIRST(&wrq->wr_list)) != NULL);
STAILQ_INSERT_TAIL(&wrq->wr_list, wr, link);
if (TAILQ_EMPTY(&wrq->incomplete_wrs) && !STAILQ_EMPTY(&wrq->wr_list))
if (!STAILQ_EMPTY(&wrq->wr_list)) {
if (TAILQ_EMPTY(&wrq->incomplete_wrs) && !STAILQ_EMPTY(&wrq->wr_list))
STAILQ_INIT(&wrq->wr_list);
MPASS(STAILQ_EMPTY(&wrq->wr_list));
while ((wr = STAILQ_FIRST(&e->wr_list)) != NULL) {
STAILQ_REMOVE_HEAD(&e->wr_list, link);
STAILQ_INSERT_TAIL(&e->wr_list, wr, link);
while ((wr = STAILQ_FIRST(&e->wr_list)) != NULL) {
STAILQ_REMOVE_HEAD(&e->wr_list, link);
STAILQ_CONCAT(&td->unsent_wr_list, &e->wr_list);
if (e->state == L2T_STATE_VALID && !STAILQ_EMPTY(&e->wr_list))
struct wr_list *w_list;