blob: d3ec2f2298e4859dceca4dbd5496e6deec71ad49 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
/*
// Copyright (c) 2010-2017 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
*/
#ifndef _ELD_H_
#define _ELD_H_
#define PACKET_QUEUE_BITS 20
#define PACKET_QUEUE_SIZE (1 << PACKET_QUEUE_BITS)
#define PACKET_QUEUE_MASK (PACKET_QUEUE_SIZE - 1)
#define QUEUE_ID_BITS (32 - PACKET_QUEUE_BITS)
#define QUEUE_ID_SIZE (1 << QUEUE_ID_BITS)
#define QUEUE_ID_MASK (QUEUE_ID_SIZE - 1)
struct early_loss_detect {
uint32_t entries[PACKET_QUEUE_SIZE];
uint32_t last_pkt_idx;
};
static void early_loss_detect_reset(struct early_loss_detect *eld)
{
for (size_t i = 0; i < PACKET_QUEUE_SIZE; i++) {
eld->entries[i] = -1;
}
}
static uint32_t early_loss_detect_count_remaining_loss(struct early_loss_detect *eld)
{
uint32_t queue_id;
uint32_t n_loss;
uint32_t n_loss_total = 0;
/* Need to check if we lost any packet before last packet
received Any packet lost AFTER the last packet received
cannot be counted. Such a packet will be counted after both
lat and gen restarted */
queue_id = eld->last_pkt_idx >> PACKET_QUEUE_BITS;
for (uint32_t i = (eld->last_pkt_idx + 1) & PACKET_QUEUE_MASK; i < PACKET_QUEUE_SIZE; i++) {
// We ** might ** have received OOO packets; do not count them as lost next time...
if (queue_id - eld->entries[i] != 0) {
n_loss = (queue_id - eld->entries[i] - 1) & QUEUE_ID_MASK;
n_loss_total += n_loss;
}
}
for (uint32_t i = 0; i < (eld->last_pkt_idx & PACKET_QUEUE_MASK); i++) {
// We ** might ** have received OOO packets; do not count them as lost next time...
if (eld->entries[i] - queue_id != 1) {
n_loss = (queue_id - eld->entries[i]) & QUEUE_ID_MASK;
n_loss_total += n_loss;
}
}
eld->entries[eld->last_pkt_idx & PACKET_QUEUE_MASK] = -1;
return n_loss_total;
}
static uint32_t early_loss_detect_add(struct early_loss_detect *eld, uint32_t packet_index)
{
uint32_t old_queue_id, queue_pos, n_loss;
eld->last_pkt_idx = packet_index;
queue_pos = packet_index & PACKET_QUEUE_MASK;
old_queue_id = eld->entries[queue_pos];
eld->entries[queue_pos] = packet_index >> PACKET_QUEUE_BITS;
if (eld->entries[queue_pos] != old_queue_id)
return (eld->entries[queue_pos] - old_queue_id - 1) & QUEUE_ID_MASK;
else
return 0;
}
#endif /* _ELD_H_ */
|
