1 #ifndef EVE_NET_EP_H_INCLUDED 2 #define EVE_NET_EP_H_INCLUDED 231 ep->
c->
xfer(ep, urb);
ep_complete_cb_t complete
static void ep_schedule_urb(struct ep_t *ep, struct urb_t *urb)
int ep_xfer_done(ep_xfer_status_t status, uint32_t xferred, uint32_t remaining, struct ep_t *ep)
ep_if_xfer_cb_t ep_done_trap_t
static void ep_free_urb(struct ep_t *ep, struct urb_t *urb)
The code implements Dummy Headed Doubly Linked Circularlist (DHDLC) primitive.
static bool ep_is_empty(struct ep_t *ep)
static int dlist_is_empty(struct dlist_t *list)
void(* ep_xfer_cb_t)(struct ep_t *ep, struct urb_t *urb)
ep_xfer_status_t(* ep_if_xfer_cb_t)(ep_xfer_status_t status, uint32_t xferred, uint32_t remaining)
void(* ep_complete_cb_t)(struct ep_t *ep, struct urb_t *urb, ep_xfer_status_t status)
void ep_xfer_in(struct ep_t *ep, struct urb_t *urb)
static struct urb_t * ep_alloc_urb(struct ep_t *ep)
void ep_init(const struct ep_init_t *ep)
static void dlist_append(struct dlist_t *list, struct dlist_t *item)
void ep_xfer_out(struct ep_t *ep, struct urb_t *urb)
void ep_kill_all_urbs(struct ep_t *ep, void *device)
static struct dlist_t * dlist_del(struct dlist_t *list)