Lines Matching defs:elm2
560 struct s_hist_entry *elm, *elm2;
581 elm2 = TAILQ_NEXT(elm, linfo);
583 elm = elm2;
837 struct s_hist_entry *elm, *elm2;
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;
1266 elm2 = elm;
1267 TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1268 while (elm2 != NULL) {
1269 temp = win_count - (int) (elm2->win_count);
1275 elm = elm2;
1276 TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1279 if (elm2 == NULL) {
1281 elm2 = elm;
1287 timersub(&t_temp, &elm2->t_recv, &t_temp);
1344 struct r_hist_entry *elm, *elm2;
1364 elm2 = TAILQ_NEXT(elm, linfo);
1365 while (elm2 != NULL) {
1366 if ((seq_num > elm2->seq
1367 && seq_num - elm2->seq < TFRC_RECV_NEW_SEQ_RANGE) ||
1368 (seq_num < elm2->seq
1369 && elm2->seq - seq_num > DCCP_SEQ_NUM_LIMIT - TFRC_RECV_NEW_SEQ_RANGE)) {
1373 elm = elm2;
1374 elm2 = TAILQ_NEXT(elm, linfo);
1387 if (elm2 == NULL && num_later < TFRC_RECV_NUM_LATE_LOSS) {
1399 elm2 = TAILQ_NEXT(elm, linfo);
1400 while (elm2 != NULL) {
1401 TAILQ_REMOVE(&(cb->hist), elm2, linfo);
1402 free(elm2, M_TEMP);
1403 elm2 = TAILQ_NEXT(elm, linfo);
1410 TFRC_RECV_FINDDATAPACKET(cb, elm2, num_later);
1411 if (elm2 != NULL) {
1416 elm = elm2;
1417 TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1418 while (elm2 != NULL) {
1419 temp = win_count - (int) (elm2->win_count);
1426 elm = TAILQ_NEXT(elm2, linfo);
1431 elm = TAILQ_NEXT(elm2, linfo);
1435 elm = elm2;
1436 TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1451 struct r_hist_entry *bLoss, *aLoss, *elm, *elm2;
1477 elm2 = TAILQ_NEXT(elm, linfo);
1479 seq_temp = ((long) (elm->seq)) - ((long) elm2->seq);
1488 if (seq_temp % DCCP_NDP_LIMIT != ((int) elm->ndp - (int) elm2->ndp + DCCP_NDP_LIMIT) % DCCP_NDP_LIMIT)
1489 seq_loss = (elm2->seq + 1) % DCCP_SEQ_NUM_LIMIT;
1491 elm = elm2;
1492 elm2 = TAILQ_NEXT(elm2, linfo);
1646 struct r_hist_entry *elm, *elm2;
1662 elm2 = TAILQ_NEXT(elm, linfo);
1664 elm = elm2;