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 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411
|
// -*- c-basic-offset: 4; tab-width: 8; indent-tabs-mode: t -*-
// Copyright (c) 2001-2011 XORP, Inc and Others
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License, Version 2, June
// 1991 as published by the Free Software Foundation. Redistribution
// and/or modification of this program under the terms of any other
// version of the GNU General Public License is not permitted.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For more details,
// see the GNU General Public License, Version 2, a copy of which can be
// found in the XORP LICENSE.gpl file.
//
// XORP Inc, 2953 Bunker Hill Lane, Suite 204, Santa Clara, CA 95054, USA;
// http://xorp.net
#include "rip_module.h"
#include "libxorp/xlog.h"
#include "libxorp/c_format.hh"
#include "libxorp/eventloop.hh"
#include "libxorp/ipv4.hh"
#include "libxorp/ipv4net.hh"
#include "port.hh"
#include "peer.hh"
#include "route_db.hh"
#include "system.hh"
#include "update_queue.hh"
#include "test_utils.hh"
#ifdef HAVE_GETOPT_H
#include <getopt.h>
#endif
///////////////////////////////////////////////////////////////////////////////
//
// Constants
//
static const char *program_name = "test_updates";
static const char *program_description = "Test RIP update queue";
static const char *program_version_id = "0.1";
static const char *program_date = "July, 2003";
static const char *program_copyright = "See file LICENSE";
static const char *program_return_value = "0 on success, 1 if test error, 2 if internal error";
// ----------------------------------------------------------------------------
// Spoof Port that supports just a single Peer
//
template <typename A>
class SpoofPort : public Port<A> {
public:
SpoofPort(PortManagerBase<A>& pm, A addr) : Port<A>(pm)
{
this->_peers.push_back(new Peer<A>(*this, addr));
verbose_log("Constructing SpoofPort instance\n");
}
~SpoofPort()
{
verbose_log("Destructing SpoofPort instance\n");
while (this->_peers.empty() == false) {
delete this->_peers.front();
this->_peers.pop_front();
}
}
};
// ----------------------------------------------------------------------------
// Type specific helpers
template <typename A>
struct DefaultPeer {
static A get();
};
template <>
IPv4 DefaultPeer<IPv4>::get() { return IPv4("10.0.0.1"); }
template <>
IPv6 DefaultPeer<IPv6>::get() { return IPv6("10::1"); }
// ----------------------------------------------------------------------------
// Spoof Port Manager instance support a single Spoof Port which in turn
// contains a single Peer.
//
template <typename A>
class SpoofPortManager : public PortManagerBase<A> {
public:
SpoofPortManager(System<A>& s, const IfMgrIfTree& iftree)
: PortManagerBase<A>(s, iftree)
{
this->_ports.push_back(new SpoofPort<A>(*this, DefaultPeer<A>::get()));
}
~SpoofPortManager()
{
while (!this->_ports.empty()) {
delete this->_ports.front();
this->_ports.pop_front();
}
}
Port<A>* the_port()
{
XLOG_ASSERT(this->_ports.size() == 1);
return this->_ports.front();
}
Peer<A>* the_peer()
{
XLOG_ASSERT(this->_ports.size() == 1);
XLOG_ASSERT(this->_ports.front()->peers().size() == 1);
return this->_ports.front()->peers().front();
}
};
static const IfMgrIfTree ift_dummy = IfMgrIfTree();
template <typename A>
class UpdateQueueTester
{
public:
UpdateQueueTester(EventLoop& e)
: _e(e), _rip_system(_e), _pm(_rip_system, ift_dummy)
{
_pm.the_port()->constants().set_expiry_secs(3);
_pm.the_port()->constants().set_deletion_secs(2);
}
~UpdateQueueTester()
{
RouteDB<A>& rdb = _rip_system.route_db();
rdb.flush_routes();
UpdateQueue<A>& uq = rdb.update_queue();
uq.flush();
}
int run_test()
{
string ifname, vifname; // XXX: not set, because not needed
const uint32_t n_routes = 20000;
verbose_log("Running test for IPv%u\n",
XORP_UINT_CAST(A::ip_version()));
RouteDB<A>& rdb = _rip_system.route_db();
UpdateQueue<A>& uq = _rip_system.route_db().update_queue();
_fast_reader = uq.create_reader();
_slow_reader = uq.create_reader();
if (uq.updates_queued() != 0) {
verbose_log("Have updates when none expected\n");
return 1;
}
verbose_log("Generating nets\n");
set<IPNet<A> > nets;
make_nets(nets, n_routes);
verbose_log("Creating routes for nets\n");
for_each(nets.begin(), nets.end(),
RouteInjector<A>(rdb, A::ZERO(), ifname, vifname, 5,
_pm.the_peer()));
if (uq.updates_queued() != n_routes) {
verbose_log("%u updates queued, expected %u\n",
XORP_UINT_CAST(uq.updates_queued()),
XORP_UINT_CAST(n_routes));
return 1;
}
uint32_t n = 0;
for (n = 0; n < n_routes; n++) {
if (uq.get(_fast_reader) == 0) {
verbose_log("Ran out of updates at %u.\n", XORP_UINT_CAST(n));
return 1;
}
uq.next(_fast_reader);
}
if (uq.get(_fast_reader) != 0) {
verbose_log("Got an extra update.\n");
return 1;
}
bool expire = false;
XorpTimer t = _e.set_flag_after_ms(6000, &expire);
while (t.scheduled()) {
_e.run();
}
verbose_log("%u updates queued, expected %u\n",
XORP_UINT_CAST(uq.updates_queued()),
XORP_UINT_CAST(n_routes));
for (n = 0; n < n_routes; n++) {
if (uq.get(_fast_reader) == 0) {
verbose_log("Ran out of updates at %u.\n", XORP_UINT_CAST(n));
return 1;
}
uq.next(_fast_reader);
}
for (n = 0; n < 2 * n_routes; n++) {
if (uq.get(_slow_reader) == 0) {
verbose_log("Ran out of updates at %u.\n", XORP_UINT_CAST(n));
return 1;
}
uq.next(_slow_reader);
}
if (uq.get(_slow_reader) != 0) {
verbose_log("Got an extra update.\n");
return 1;
}
uq.destroy_reader(_fast_reader);
uq.destroy_reader(_slow_reader);
if (uq.updates_queued() != 0) {
verbose_log("Updates queued (%u) when no readers present\n",
XORP_UINT_CAST(uq.updates_queued()));
return 1;
}
_slow_reader = uq.create_reader();
_fast_reader = uq.create_reader();
verbose_log("Creating routes for nets (again)\n");
for (typename set<IPNet<A> >::const_iterator n = nets.begin();
n != nets.end(); ++n) {
if (rdb.update_route(*n, A::ZERO(), ifname, vifname, 5, 0,
_pm.the_peer(), PolicyTags(),
false) == false) {
verbose_log("Failed to add route for %s\n",
n->str().c_str());
return 1;
}
}
verbose_log("flushing and waiting for route updates\n");
uq.ffwd(_fast_reader);
uq.flush();
if (uq.updates_queued() != 0) {
verbose_log("Flushed and route count != 0\n");
return 1;
}
if (uq.get(_fast_reader) != 0) {
verbose_log("Got an extra update.\n");
return 1;
}
if (uq.get(_slow_reader) != 0) {
verbose_log("Got an extra update.\n");
return 1;
}
expire = false;
t = _e.set_flag_after_ms(6000, &expire);
while (t.scheduled()) {
_e.run();
}
for (n = 0; n < n_routes; n++) {
if (uq.get(_slow_reader) == 0) {
verbose_log("Ran out of updates at %u.\n", XORP_UINT_CAST(n));
return 1;
}
uq.next(_slow_reader);
if (uq.get(_fast_reader) == 0) {
verbose_log("Ran out of updates at %u.\n", XORP_UINT_CAST(n));
return 1;
}
uq.next(_fast_reader);
}
if (uq.get(_fast_reader) != 0) {
verbose_log("Got an extra update.\n");
return 1;
}
if (uq.get(_slow_reader) != 0) {
verbose_log("Got an extra update.\n");
return 1;
}
verbose_log("Success\n");
return 0;
}
protected:
EventLoop& _e;
System<A> _rip_system;
SpoofPortManager<A> _pm;
typename UpdateQueue<A>::ReadIterator _fast_reader;
typename UpdateQueue<A>::ReadIterator _slow_reader;
};
/**
* Print program info to output stream.
*
* @param stream the output stream the print the program info to.
*/
static void
print_program_info(FILE *stream)
{
fprintf(stream, "Name: %s\n", program_name);
fprintf(stream, "Description: %s\n", program_description);
fprintf(stream, "Version: %s\n", program_version_id);
fprintf(stream, "Date: %s\n", program_date);
fprintf(stream, "Copyright: %s\n", program_copyright);
fprintf(stream, "Return: %s\n", program_return_value);
}
/*
* Print program usage information to the stderr.
*
* @param progname the name of the program.
*/
static void
usage(const char* progname)
{
print_program_info(stderr);
fprintf(stderr, "usage: %s [-v] [-h]\n", progname);
fprintf(stderr, " -h : usage (this message)\n");
fprintf(stderr, " -v : verbose output\n");
}
int
main(int argc, char* const argv[])
{
//
// Initialize and start xlog
//
xlog_init(argv[0], NULL);
xlog_set_verbose(XLOG_VERBOSE_LOW); // Least verbose messages
// XXX: verbosity of the error messages temporary increased
xlog_level_set_verbose(XLOG_LEVEL_ERROR, XLOG_VERBOSE_HIGH);
xlog_add_default_output();
xlog_start();
int ch;
while ((ch = getopt(argc, argv, "hv")) != -1) {
switch (ch) {
case 'v':
set_verbose(true);
break;
case 'h':
case '?':
default:
usage(argv[0]);
xlog_stop();
xlog_exit();
if (ch == 'h')
return (0);
else
return (1);
}
}
argc -= optind;
argv += optind;
int rval = 0;
XorpUnexpectedHandler x(xorp_unexpected_handler);
try {
EventLoop e;
UpdateQueueTester<IPv4> uqt4(e);
rval |= uqt4.run_test();
UpdateQueueTester<IPv6> uqt6(e);
rval |= uqt6.run_test();
} catch (...) {
// Internal error
xorp_print_standard_exceptions();
rval = 2;
}
//
// Gracefully stop and exit xlog
//
xlog_stop();
xlog_exit();
return rval;
}
|