Home | History | Annotate | Download | only in netinet

Lines Matching defs:elm

560 	struct s_hist_entry *elm, *elm2;
579 elm = TAILQ_FIRST(&(cb->hist));
580 while (elm != NULL) {
581 elm2 = TAILQ_NEXT(elm, linfo);
582 free(elm, M_TEMP); /* M_TEMP ?? */
583 elm = elm2;
837 struct s_hist_entry *elm, *elm2;
899 elm = TAILQ_FIRST(&(cb->hist));
900 while (elm != NULL) {
901 if (elm->seq == cb->pcb->ack_rcv)
903 elm = TAILQ_NEXT(elm, linfo);
906 if (elm == NULL) {
913 timersub(&t_now, &(elm->t_sent), &t_now);
981 /* elm points to acked package! */
983 elm2 = TAILQ_NEXT(elm, linfo);
988 elm2 = TAILQ_NEXT(elm, linfo);
1041 * elm - pointer to element (variable)
1043 * returns: elm points to found packet, otherwise NULL
1046 #define TFRC_RECV_FINDDATAPACKET(cb,elm,num) \
1048 elm = TAILQ_FIRST(&((cb)->hist)); \
1049 while ((elm) != NULL) { \
1050 if ((elm)->type == DCCP_TYPE_DATA || (elm)->type == DCCP_TYPE_DATAACK) \
1054 elm = TAILQ_NEXT((elm), linfo); \
1060 * elm - pointer to element (variable)
1061 * returns: elm points to found packet, otherwise NULL
1064 #define TFRC_RECV_NEXTDATAPACKET(cb,elm) \
1066 if (elm != NULL) { \
1067 elm = TAILQ_NEXT(elm, linfo); \
1068 while ((elm) != NULL && (elm)->type != DCCP_TYPE_DATA && (elm)->type != DCCP_TYPE_DATAACK) { \
1069 elm = TAILQ_NEXT((elm), linfo); \
1083 struct li_hist_entry *elm;
1090 elm = TAILQ_FIRST(&(cb->li_hist));
1094 if (elm == 0)
1099 I_tot0 = I_tot0 + (elm->interval * tfrc_recv_w[i]);
1102 tmp.num = elm->interval;
1108 elm = TAILQ_NEXT(elm, linfo);
1111 elm = TAILQ_FIRST(&(cb->li_hist));
1112 elm = TAILQ_NEXT(elm, linfo);
1116 if (elm == 0)
1120 I_tot1 = I_tot1 + (elm->interval * tfrc_recv_w[i - 1]);
1122 tmp.num = elm->interval;
1127 elm = TAILQ_NEXT(elm, linfo);
1171 struct r_hist_entry *elm;
1208 TFRC_RECV_FINDDATAPACKET(cb, elm, num);
1210 if (elm == NULL)
1215 timersub(&t_now, &elm->t_recv, &t_now);
1232 cb->pcb->ack_snd = elm->seq;
1233 cb->last_counter = elm->win_count;
1234 cb->seq_last_counter = elm->seq;
1238 TFRC_DEBUG_TIME((LOG_INFO, "TFRC - Sending a feedback packet with (t_elapsed %u, pinv %x, x_recv %u, ack=%llu) (tfrc_recv_send_feedback)\n", ntohs(t_elapsed), ntohl(pinv), ntohl(x_recv), elm->seq));
1252 struct r_hist_entry *elm, *elm2;
1260 TFRC_RECV_FINDDATAPACKET(cb, elm, temp);
1262 if (elm == NULL)
1264 t_temp = elm->t_recv;
1265 win_count = elm->win_count;
1266 elm2 = elm;
1275 elm = elm2;
1281 elm2 = elm;
1344 struct r_hist_entry *elm, *elm2;
1354 elm = TAILQ_FIRST(&(cb->hist));
1355 if ((seq_num > elm->seq
1356 && seq_num - elm->seq < TFRC_RECV_NEW_SEQ_RANGE) ||
1357 (seq_num < elm->seq
1358 && elm->seq - seq_num > DCCP_SEQ_NUM_LIMIT - TFRC_RECV_NEW_SEQ_RANGE)) {
1361 if (elm->type == DCCP_TYPE_DATA || elm->type == DCCP_TYPE_DATAACK)
1364 elm2 = TAILQ_NEXT(elm, linfo);
1370 TAILQ_INSERT_AFTER(&(cb->hist), elm, packet, linfo);
1373 elm = elm2;
1374 elm2 = TAILQ_NEXT(elm, linfo);
1376 if (elm->type == DCCP_TYPE_DATA || elm->type == DCCP_TYPE_DATAACK)
1397 TFRC_RECV_FINDDATAPACKET(cb, elm, num_later);
1398 if (elm != NULL) {
1399 elm2 = TAILQ_NEXT(elm, linfo);
1403 elm2 = TAILQ_NEXT(elm, linfo);
1413 TFRC_RECV_FINDDATAPACKET(cb, elm, num_later);
1414 win_count = elm->win_count;
1416 elm = elm2;
1426 elm = TAILQ_NEXT(elm2, linfo);
1428 while (elm != NULL) {
1429 TAILQ_REMOVE(&(cb->hist), elm, linfo);
1430 free(elm, M_TEMP);
1431 elm = TAILQ_NEXT(elm2, linfo);
1435 elm = elm2;
1451 struct r_hist_entry *bLoss, *aLoss, *elm, *elm2;
1476 elm = bLoss;
1477 elm2 = TAILQ_NEXT(elm, linfo);
1479 seq_temp = ((long) (elm->seq)) - ((long) elm2->seq);
1486 if (elm->type == DCCP_TYPE_DATA || elm->type == DCCP_TYPE_DATAACK)
1488 if (seq_temp % DCCP_NDP_LIMIT != ((int) elm->ndp - (int) elm2->ndp + DCCP_NDP_LIMIT) % DCCP_NDP_LIMIT)
1491 elm = elm2;
1493 } while (elm != aLoss);
1511 struct r_hist_entry *elm;
1585 TFRC_RECV_FINDDATAPACKET(cb, elm, num_later);
1587 seq_temp = ((long) (elm->seq)) -
1594 TFRC_DEBUG((LOG_INFO, "TFRC - Highest data packet received %llu (tfrc_recv_updateLI)\n", elm->seq));
1646 struct r_hist_entry *elm, *elm2;
1660 elm = TAILQ_FIRST(&(cb->hist));
1661 while (elm != NULL) {
1662 elm2 = TAILQ_NEXT(elm, linfo);
1663 free(elm, M_TEMP); /* M_TEMP ?? */
1664 elm = elm2;