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
|
// Copyright 2013 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/quic/quic_http_utils.h"
#include <stdint.h>
#include <limits>
#include "net/third_party/quiche/src/quiche/http2/core/spdy_alt_svc_wire_format.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace net::test {
TEST(QuicHttpUtilsTest, ConvertRequestPriorityToQuicPriority) {
EXPECT_EQ(0u, ConvertRequestPriorityToQuicPriority(HIGHEST));
EXPECT_EQ(1u, ConvertRequestPriorityToQuicPriority(MEDIUM));
EXPECT_EQ(2u, ConvertRequestPriorityToQuicPriority(LOW));
EXPECT_EQ(3u, ConvertRequestPriorityToQuicPriority(LOWEST));
EXPECT_EQ(4u, ConvertRequestPriorityToQuicPriority(IDLE));
}
TEST(QuicHttpUtilsTest, ConvertQuicPriorityToRequestPriority) {
EXPECT_EQ(HIGHEST, ConvertQuicPriorityToRequestPriority(0));
EXPECT_EQ(MEDIUM, ConvertQuicPriorityToRequestPriority(1));
EXPECT_EQ(LOW, ConvertQuicPriorityToRequestPriority(2));
EXPECT_EQ(LOWEST, ConvertQuicPriorityToRequestPriority(3));
EXPECT_EQ(IDLE, ConvertQuicPriorityToRequestPriority(4));
// These are invalid values, but we should still handle them
// gracefully. TODO(rtenneti): should we test for all possible values of
// uint32_t?
for (int i = 5; i < std::numeric_limits<uint8_t>::max(); ++i) {
EXPECT_EQ(IDLE, ConvertQuicPriorityToRequestPriority(i));
}
}
} // namespace net::test
|
