kbucket Struct Reference

---

Detailed Description

The routing table is a binary tree.

Each node holds a k-bucket containing the contacts whose KUID falls within the range of the k-bucket.

Data Fields
kuid_t	prefix
	Node prefix of the k-bucket.
kbucket *	parent
	Parent node in the tree.
kbucket *	zero
	Child node for "0" prefix.
kbucket *	one
	Child node for "1" prefix.
hash_list_t *	good
	The good nodes.
hash_list_t *	stale
	The (possibly) stale nodes.
hash_list_t *	pending
	The nodes which are awaiting decision.
GHashTable *	all
	All nodes in one of the lists.
time_t	last_refresh
	Last time bucket was refreshed.
guchar	depth
	Depth in tree (meaningful bits).
gboolean	ours
	Whether our KUID falls in that bucket.

---

Field Documentation

GHashTable* kbucket::all

All nodes in one of the lists.

guchar kbucket::depth

Depth in tree (meaningful bits).

hash_list_t* kbucket::good

The good nodes.

time_t kbucket::last_refresh

Last time bucket was refreshed.

struct kbucket* kbucket::one

Child node for "1" prefix.

gboolean kbucket::ours

Whether our KUID falls in that bucket.

struct kbucket* kbucket::parent

Parent node in the tree.

hash_list_t* kbucket::pending

The nodes which are awaiting decision.

kuid_t kbucket::prefix

Node prefix of the k-bucket.

hash_list_t* kbucket::stale

The (possibly) stale nodes.

struct kbucket* kbucket::zero

Child node for "0" prefix.

---

The documentation for this struct was generated from the following file:

• dht/routing.c

---