122 lines
3.5 KiB
C++
122 lines
3.5 KiB
C++
/*
|
|
* This file is open source software, licensed to you under the terms
|
|
* of the Apache License, Version 2.0 (the "License"). See the NOTICE file
|
|
* distributed with this work for additional information regarding copyright
|
|
* ownership. 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.
|
|
*/
|
|
/*
|
|
* Copyright (C) 2015 Cloudius Systems, Ltd.
|
|
*/
|
|
|
|
|
|
#define BOOST_TEST_MODULE core
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
#include <seastar/net/packet.hh>
|
|
#include <array>
|
|
|
|
using namespace seastar;
|
|
using namespace net;
|
|
|
|
BOOST_AUTO_TEST_CASE(test_many_fragments) {
|
|
std::vector<char> expected;
|
|
|
|
auto append = [&expected] (net::packet p, char c, size_t n) {
|
|
auto tmp = temporary_buffer<char>(n);
|
|
std::fill_n(tmp.get_write(), n, c);
|
|
std::fill_n(std::back_inserter(expected), n, c);
|
|
return net::packet(std::move(p), std::move(tmp));
|
|
};
|
|
|
|
net::packet p;
|
|
p = append(std::move(p), 'a', 5);
|
|
p = append(std::move(p), 'b', 31);
|
|
p = append(std::move(p), 'c', 65);
|
|
p = append(std::move(p), 'c', 4096);
|
|
p = append(std::move(p), 'd', 4096);
|
|
|
|
auto verify = [&expected] (const net::packet& p) {
|
|
BOOST_CHECK_EQUAL(p.len(), expected.size());
|
|
auto expected_it = expected.begin();
|
|
for (auto&& frag : p.fragments()) {
|
|
BOOST_CHECK_LE(frag.size, static_cast<size_t>(expected.end() - expected_it));
|
|
BOOST_CHECK(std::equal(frag.base, frag.base + frag.size, expected_it));
|
|
expected_it += frag.size;
|
|
}
|
|
};
|
|
|
|
auto trim_front = [&expected] (net::packet& p, size_t n) {
|
|
p.trim_front(n);
|
|
expected.erase(expected.begin(), expected.begin() + n);
|
|
};
|
|
|
|
verify(p);
|
|
|
|
trim_front(p, 1);
|
|
verify(p);
|
|
|
|
trim_front(p, 6);
|
|
verify(p);
|
|
|
|
trim_front(p, 29);
|
|
verify(p);
|
|
|
|
trim_front(p, 1024);
|
|
verify(p);
|
|
|
|
net::packet p2;
|
|
p2 = append(std::move(p2), 'z', 9);
|
|
p2 = append(std::move(p2), 'x', 7);
|
|
|
|
p.append(std::move(p2));
|
|
verify(p);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(test_headers_are_contiguous) {
|
|
using tcp_header = std::array<char, 20>;
|
|
using ip_header = std::array<char, 20>;
|
|
char data[1000] = {};
|
|
fragment f{data, sizeof(data)};
|
|
packet p(f);
|
|
p.prepend_header<tcp_header>();
|
|
p.prepend_header<ip_header>();
|
|
BOOST_REQUIRE_EQUAL(p.nr_frags(), 2u);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(test_headers_are_contiguous_even_with_small_fragment) {
|
|
using tcp_header = std::array<char, 20>;
|
|
using ip_header = std::array<char, 20>;
|
|
char data[100] = {};
|
|
fragment f{data, sizeof(data)};
|
|
packet p(f);
|
|
p.prepend_header<tcp_header>();
|
|
p.prepend_header<ip_header>();
|
|
BOOST_REQUIRE_EQUAL(p.nr_frags(), 2u);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(test_headers_are_contiguous_even_with_many_fragments) {
|
|
using tcp_header = std::array<char, 20>;
|
|
using ip_header = std::array<char, 20>;
|
|
char data[100] = {};
|
|
fragment f{data, sizeof(data)};
|
|
packet p(f);
|
|
for (int i = 0; i < 7; ++i) {
|
|
p.append(packet(f));
|
|
}
|
|
p.prepend_header<tcp_header>();
|
|
p.prepend_header<ip_header>();
|
|
BOOST_REQUIRE_EQUAL(p.nr_frags(), 9u);
|
|
}
|
|
|