HomeSort by: relevance | last modified time | path
    Searched refs:elm2 (Results 1 - 2 of 2) sorted by relevancy

  /src/sys/netinet/
dccp_tfrc.c 560 struct s_hist_entry *elm, *elm2; local in function:tfrc_send_free
581 elm2 = TAILQ_NEXT(elm, linfo);
583 elm = elm2;
837 struct s_hist_entry *elm, *elm2; local in function:tfrc_send_packet_recv
983 elm2 = TAILQ_NEXT(elm, linfo);
985 while (elm2 != NULL) {
986 TAILQ_REMOVE(&(cb->hist), elm2, linfo);
987 free(elm2, M_TEMP);
988 elm2 = TAILQ_NEXT(elm, linfo);
1252 struct r_hist_entry *elm, *elm2; local in function:tfrc_recv_calcFirstLI
1344 struct r_hist_entry *elm, *elm2; local in function:tfrc_recv_add_hist
1451 struct r_hist_entry *bLoss, *aLoss, *elm, *elm2; local in function:tfrc_recv_detectLoss
1646 struct r_hist_entry *elm, *elm2; local in function:tfrc_recv_free
    [all...]
  /src/sys/sys/
queue.h 285 #define LIST_REPLACE(elm, elm2, field) do { \
286 if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \
287 (elm2)->field.le_next->field.le_prev = \
288 &(elm2)->field.le_next; \
289 (elm2)->field.le_prev = (elm)->field.le_prev; \
290 *(elm2)->field.le_prev = (elm2); \
541 #define TAILQ_REPLACE(head, elm, elm2, field) do { \
542 if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != \
544 (elm2)->field.tqe_next->field.tqe_prev =
    [all...]

Completed in 12 milliseconds