Monero
Loading...
Searching...
No Matches
Macros | Functions
test_peerlist.cpp File Reference
#include "gtest/gtest.h"
#include "common/util.h"
#include "p2p/net_peerlist.h"
#include "net/net_utils_base.h"
Include dependency graph for test_peerlist.cpp:

Macros

#define MAKE_IPV4_ADDRESS(a, b, c, d, e)   epee::net_utils::ipv4_network_address{MAKE_IP(a,b,c,d),e}
 
#define ADD_GRAY_NODE(addr_, id_, last_seen_)   { nodetool::peerlist_entry ple; ple.last_seen=last_seen_;ple.adr = addr_; ple.id = id_;plm.append_with_peer_gray(ple);}
 
#define ADD_WHITE_NODE(addr_, id_, last_seen_)   { nodetool::peerlist_entry ple;ple.last_seen=last_seen_; ple.adr = addr_; ple.id = id_;plm.append_with_peer_white(ple);}
 
#define PRINT_HEAD(step)   {std::vector<nodetool::peerlist_entry> bs_head; bool r = plm.get_peerlist_head(bs_head, 100);std::cout << "step " << step << ": " << bs_head.size() << std::endl;}
 
#define ADD_NODE_TO_PL(ip_, port_, id_, timestamp_)   { nodetool::peerlist_entry ple; epee::string_tools::get_ip_int32_from_string(ple.adr.ip, ip_); ple.last_seen = timestamp_; ple.adr.port = port_; ple.id = id_;outer_bs.push_back(ple);}
 

Functions

 TEST (peer_list, peer_list_general)
 
 TEST (peer_list, merge_peer_lists)
 
 TEST (peerlist_storage, store)
 

Macro Definition Documentation

◆ ADD_GRAY_NODE

#define ADD_GRAY_NODE ( addr_,
id_,
last_seen_ )   { nodetool::peerlist_entry ple; ple.last_seen=last_seen_;ple.adr = addr_; ple.id = id_;plm.append_with_peer_gray(ple);}

◆ ADD_NODE_TO_PL

#define ADD_NODE_TO_PL ( ip_,
port_,
id_,
timestamp_ )   { nodetool::peerlist_entry ple; epee::string_tools::get_ip_int32_from_string(ple.adr.ip, ip_); ple.last_seen = timestamp_; ple.adr.port = port_; ple.id = id_;outer_bs.push_back(ple);}

◆ ADD_WHITE_NODE

#define ADD_WHITE_NODE ( addr_,
id_,
last_seen_ )   { nodetool::peerlist_entry ple;ple.last_seen=last_seen_; ple.adr = addr_; ple.id = id_;plm.append_with_peer_white(ple);}

◆ MAKE_IPV4_ADDRESS

#define MAKE_IPV4_ADDRESS ( a,
b,
c,
d,
e )   epee::net_utils::ipv4_network_address{MAKE_IP(a,b,c,d),e}

◆ PRINT_HEAD

#define PRINT_HEAD ( step)    {std::vector<nodetool::peerlist_entry> bs_head; bool r = plm.get_peerlist_head(bs_head, 100);std::cout << "step " << step << ": " << bs_head.size() << std::endl;}

Function Documentation

◆ TEST() [1/3]

TEST ( peer_list ,
merge_peer_lists  )

◆ TEST() [2/3]

TEST ( peer_list ,
peer_list_general  )

◆ TEST() [3/3]

TEST ( peerlist_storage ,
store  )