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
|
/*
This file is part of GNUnet.
(C) 2009, 2010 Christian Grothoff (and other contributing authors)
GNUnet is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published
by the Free Software Foundation; either version 3, or (at your
option) any later version.
GNUnet 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. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNUnet; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
/**
* @file fs/gnunet-service-fs.h
* @brief shared data structures of gnunet-service-fs.c
* @author Christian Grothoff
*/
#ifndef GNUNET_SERVICE_FS_H
#define GNUNET_SERVICE_FS_H
#include "gnunet_util_lib.h"
#include "gnunet_statistics_service.h"
#include "gnunet_transport_service.h"
#include "gnunet_core_service.h"
#include "gnunet_block_lib.h"
#include "fs.h"
/**
* Should we introduce random latency in processing? Required for proper
* implementation of GAP, but can be disabled for performance evaluation of
* the basic routing algorithm.
*
* Note that with delays enabled, performance can be significantly lower
* (several orders of magnitude in 2-peer test runs); if you want to
* measure throughput of other components, set this to NO. Also, you
* might want to consider changing 'RETRY_PROBABILITY_INV' to 1 for
* a rather wasteful mode of operation (that might still get the highest
* throughput overall).
*
* Performance measurements (for 50 MB file, 2 peers):
*
* - Without delays: 3300 kb/s
* - With delays: 101 kb/s
*/
#define SUPPORT_DELAYS GNUNET_NO
/**
* A connected peer.
*/
struct GSF_ConnectedPeer;
/**
* An active request.
*/
struct GSF_PendingRequest;
/**
* A local client.
*/
struct GSF_LocalClient;
/**
* Our connection to the datastore.
*/
extern struct GNUNET_DATASTORE_Handle *GSF_dsh;
/**
* Our configuration.
*/
extern const struct GNUNET_CONFIGURATION_Handle *GSF_cfg;
/**
* Handle for reporting statistics.
*/
extern struct GNUNET_STATISTICS_Handle *GSF_stats;
/**
* Pointer to handle to the core service (points to NULL until we've
* connected to it).
*/
extern struct GNUNET_CORE_Handle *GSF_core;
/**
* Handle for DHT operations.
*/
extern struct GNUNET_DHT_Handle *GSF_dht;
/**
* How long do requests typically stay in the routing table?
*/
extern struct GNUNET_LOAD_Value *GSF_rt_entry_lifetime;
/**
* Typical priorities we're seeing from other peers right now. Since
* most priorities will be zero, this value is the weighted average of
* non-zero priorities seen "recently". In order to ensure that new
* values do not dramatically change the ratio, values are first
* "capped" to a reasonable range (+N of the current value) and then
* averaged into the existing value by a ratio of 1:N. Hence
* receiving the largest possible priority can still only raise our
* "current_priorities" by at most 1.
*/
extern double GSF_current_priorities;
/**
* How many query messages have we received 'recently' that
* have not yet been claimed as cover traffic?
*/
extern unsigned int GSF_cover_query_count;
/**
* How many content messages have we received 'recently' that
* have not yet been claimed as cover traffic?
*/
extern unsigned int GSF_cover_content_count;
/**
* Our block context.
*/
extern struct GNUNET_BLOCK_Context *GSF_block_ctx;
#endif
/* end of gnunet-service-fs.h */
|
