int _gnix_dgram_alloc(struct gnix_dgram_hndl *hndl, enum gnix_dgram_type type,
struct gnix_datagram **d_ptr)
{
int ret = -FI_EAGAIN;
struct gnix_datagram *d = NULL;
struct dlist_entry *the_free_list;
struct dlist_entry *the_active_list;
GNIX_TRACE(FI_LOG_EP_CTRL, "\n");
fastlock_acquire(&hndl->lock);
if (type == GNIX_DGRAM_WC) {
the_free_list = &hndl->wc_dgram_free_list;
the_active_list = &hndl->wc_dgram_active_list;
} else {
the_free_list = &hndl->bnd_dgram_free_list;
the_active_list = &hndl->bnd_dgram_active_list;
}
if (!dlist_empty(the_free_list)) {
d = dlist_first_entry(the_free_list, struct gnix_datagram,
list);
if (d != NULL) {
dlist_remove_init(&d->list);
dlist_insert_head(&d->list, the_active_list);
d->type = type;
ret = FI_SUCCESS;
}
}
Test(gnix_cancel, cancel_ep_send)
{
int ret;
struct gnix_fid_ep *gnix_ep;
struct gnix_fab_req *req;
struct fi_cq_err_entry buf;
struct gnix_vc *vc;
void *foobar_ptr = NULL;
gnix_ht_key_t *key;
/* simulate a posted request */
gnix_ep = container_of(ep[0], struct gnix_fid_ep, ep_fid);
req = _gnix_fr_alloc(gnix_ep);
req->msg.send_info[0].send_addr = 0xdeadbeef;
req->msg.cum_send_len = req->msg.send_info[0].send_len = 128;
req->user_context = foobar_ptr;
req->type = GNIX_FAB_RQ_SEND;
/* allocate, store vc */
ret = _gnix_vc_alloc(gnix_ep, NULL, &vc);
cr_assert(ret == FI_SUCCESS, "_gnix_vc_alloc failed");
key = (gnix_ht_key_t *)&gnix_ep->my_name.gnix_addr;
ret = _gnix_ht_insert(gnix_ep->vc_ht, *key, vc);
cr_assert(!ret);
/* make a dummy request */
fastlock_acquire(&vc->tx_queue_lock);
dlist_insert_head(&req->dlist, &vc->tx_queue);
fastlock_release(&vc->tx_queue_lock);
/* cancel simulated request */
ret = fi_cancel(&ep[0]->fid, foobar_ptr);
cr_assert(ret == FI_SUCCESS, "fi_cancel failed");
/* check for event */
ret = fi_cq_readerr(msg_cq[0], &buf, FI_SEND);
cr_assert(ret == 1, "did not find one error event");
cr_assert(buf.buf == (void *) 0xdeadbeef, "buffer mismatch");
cr_assert(buf.data == 0, "data mismatch");
cr_assert(buf.err == FI_ECANCELED, "error code mismatch");
cr_assert(buf.prov_errno == FI_ECANCELED, "prov error code mismatch");
cr_assert(buf.len == 128, "length mismatch");
}
dlist_item *dlist_insert_before(dlist *d, dlist_item *di, void *item)
{
/* create new dlist_item for item, set its next to di, its prev to
di's prev, di's prev to it, and di's prev next to it. if di is
head, change it to head. if di is null, then insert before the
head */
dlist_item *new_item;
if(d == NULL) {
return NULL;
}
/* if dlist_item is null, then insert before head */
if(di == NULL) {
return dlist_insert_head(d, item);
}
/* create new dlist_item in memory */
new_item = (dlist_item*)malloc(sizeof(dlist_item));
if(new_item == NULL) {
return NULL;
}
/* dup the item if fndup is not null */
if(d->fndup != NULL) {
new_item->data = d->fndup(item);
} else {
new_item->data = item;
}
/* adjust pointers to make the item part of the list */
new_item->next = di;
new_item->prev = di->prev;
new_item->is_sentinel = 0;
new_item->prev->next = new_item;
new_item->next->prev = new_item;
return new_item;
}
