Struct bitcoin_addrman::AddrManInner

pub struct AddrManInner {
    pub insecure_rand: RefCell<FastRandomContext>,
    pub n_id_count: i32,
    pub map_info: HashMap<i32, AddrInfo>,
    pub map_addr: HashMap<Service, i32, ServiceHash>,
    pub random: RefCell<Vec<i32>>,
    pub n_tried: i32,
    pub vv_tried: AddrManTriedBucketList,
    pub n_new: i32,
    pub vv_new: AddrManNewBucketList,
    pub n_last_good: i64,
}

Fields

insecure_rand: RefCell<FastRandomContext>

| Source of random numbers for randomization | in inner loops |

n_id_count: i32

| last used nId |

map_info: HashMap<i32, AddrInfo>

| table with information about all n_ids |

map_addr: HashMap<Service, i32, ServiceHash>

| find an nId based on its network address | and port. |

random: RefCell<Vec<i32>>

| randomly-ordered vector of all n_ids | | This is mutable because it is unobservable | outside the class, so any changes to it | (even in const methods) are also | unobservable.

n_tried: i32

| number of “tried” entries |

vv_tried: AddrManTriedBucketList

| list of “tried” buckets |

n_new: i32

| number of (unique) “new” entries |

vv_new: AddrManNewBucketList

| list of “new” buckets |

n_last_good: i64

| last time Good was called (memory | only). Initially set to 1 so that “never” is | strictly worse.

Implementations

impl AddrManInner

pub fn add( &mut self, addr: &Address, source: &NetAddr, n_key: &u256, asmap: &Vec<bool>, n_time_penalty: i64 ) -> bool

impl AddrManInner

pub fn attempt(&mut self, addr: &Service, count_failure: bool, n_time: i64)

impl AddrManInner

pub fn check( &self, consistency_check_ratio: i32, n_key: &u256, asmap: &Vec<bool> )

| Consistency check, taking into account | m_consistency_check_ratio. Will std::abort | if an inconsistency is detected.

pub fn force_check_addrman(&self, n_key: &u256, asmap: &Vec<bool>) -> i32

| Perform consistency check, regardless of | m_consistency_check_ratio. | | @returns an error code or zero.

impl AddrManInner

pub fn clear_new(&mut self, n_ubucket: usize, n_ubucket_pos: usize)

| Clear a position in a “new” table. This is | the only place where entries are actually | deleted.

impl AddrManInner

pub fn connected(&mut self, addr: &Service, n_time: i64)

impl AddrManInner

pub fn create( &mut self, addr: &Address, addr_source: &NetAddr, pn_id: Option<*mut i32> ) -> *mut AddrInfo

| Create a new entry and add it to the | internal data structures mapInfo, mapAddr | and vRandom.

impl AddrManInner

pub fn delete(&mut self, n_id: i32)

| Delete an entry. It must not be in tried, | and have refcount 0. |

impl AddrManInner

pub fn find(&mut self, addr: &Service, pn_id: Option<*mut i32>) -> *mut AddrInfo

| Find an entry. |

impl AddrManInner

pub fn get_addr( &self, max_addresses: usize, max_pct: usize, network: Option<Network> ) -> Vec<Address>

impl AddrManInner

pub unsafe fn good( &mut self, addr: &Service, test_before_evict: bool, n_time: i64, n_key: &u256, asmap: &Vec<bool>, tried_collisions: *mut HashSet<i32> )

impl AddrManInner

pub fn default_new_bucket_list() -> AddrManNewBucketList

pub fn default_tried_bucket_list() -> AddrManTriedBucketList

pub fn new(deterministic: bool, insecure_rand: FastRandomContext) -> Self

impl AddrManInner

pub fn make_tried( &mut self, info: &mut AddrInfo, n_id: i32, n_key: &u256, asmap: &Vec<bool> )

| Move an entry from the “new” table(s) | to the “tried” table |

impl AddrManInner

pub unsafe fn resolve_collisions( &mut self, n_key: &u256, asmap: &Vec<bool>, tried_collisions: *mut HashSet<i32> )

impl AddrManInner

pub fn select(&self, new_only: bool) -> (Address, i64)

impl AddrManInner

pub fn select_tried_collision( &mut self, n_key: &u256, asmap: &Vec<bool>, tried_collisions: &mut HashSet<i32> ) -> (Address, i64)

impl AddrManInner

pub fn set_services(&mut self, addr: &Service, n_services: ServiceFlags)

impl AddrManInner

pub fn swap_random(&self, n_rnd_pos1: usize, n_rnd_pos2: usize)

| Swap two elements in vRandom. |