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
|
// Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/dns/dns_query.h"
#include "net/base/io_buffer.h"
#include "net/dns/dns_protocol.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace net {
namespace {
TEST(DnsQueryTest, Constructor) {
// This includes \0 at the end.
const char qname_data[] = "\x03""www""\x07""example""\x03""com";
const uint8 query_data[] = {
// Header
0xbe, 0xef,
0x01, 0x00, // Flags -- set RD (recursion desired) bit.
0x00, 0x01, // Set QDCOUNT (question count) to 1, all the
// rest are 0 for a query.
0x00, 0x00,
0x00, 0x00,
0x00, 0x00,
// Question
0x03, 'w', 'w', 'w', // QNAME: www.example.com in DNS format.
0x07, 'e', 'x', 'a', 'm', 'p', 'l', 'e',
0x03, 'c', 'o', 'm',
0x00,
0x00, 0x01, // QTYPE: A query.
0x00, 0x01, // QCLASS: IN class.
};
base::StringPiece qname(qname_data, sizeof(qname_data));
DnsQuery q1(0xbeef, qname, dns_protocol::kTypeA);
EXPECT_EQ(dns_protocol::kTypeA, q1.qtype());
ASSERT_EQ(static_cast<int>(sizeof(query_data)), q1.io_buffer()->size());
EXPECT_EQ(0, memcmp(q1.io_buffer()->data(), query_data, sizeof(query_data)));
EXPECT_EQ(qname, q1.qname());
base::StringPiece question(reinterpret_cast<const char*>(query_data) + 12,
21);
EXPECT_EQ(question, q1.question());
}
TEST(DnsQueryTest, Clone) {
// This includes \0 at the end.
const char qname_data[] = "\x03""www""\x07""example""\x03""com";
base::StringPiece qname(qname_data, sizeof(qname_data));
DnsQuery q1(0, qname, dns_protocol::kTypeA);
EXPECT_EQ(0, q1.id());
scoped_ptr<DnsQuery> q2(q1.CloneWithNewId(42));
EXPECT_EQ(42, q2->id());
EXPECT_EQ(q1.io_buffer()->size(), q2->io_buffer()->size());
EXPECT_EQ(q1.qtype(), q2->qtype());
EXPECT_EQ(q1.question(), q2->question());
}
} // namespace
} // namespace net
|