search_queue Struct Reference

#include <sq.h>

---

Detailed Description

A search queue.

There is one search queue per node, placed above the message queue. It is only fed by the queries sent by ourselves. Its purpose is to delay queries to avoid flooding a single connection.

Data Fields
GList *	searches
	A pointer to the GList.
GHashTable *	handles
	Keeps track of search handles in queue.
gnutella_node *	node
	Node owning this search queue, or NULL.
time_t	last_sent
	Time last msg was sent.
guint	count
	Count of number in queue.
gint	n_sent
	Number of searches sent.
gint	n_dropped
	Number dropped due to flow control.

---

Field Documentation

guint search_queue::count

Count of number in queue.

GHashTable* search_queue::handles

Keeps track of search handles in queue.

time_t search_queue::last_sent

Time last msg was sent.

gint search_queue::n_dropped

Number dropped due to flow control.

gint search_queue::n_sent

Number of searches sent.

struct gnutella_node* search_queue::node

Node owning this search queue, or NULL.

GList* search_queue::searches

A pointer to the GList.

---

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

• sq.h

---