uint8_t *cbuf = buf;
int mod;
- for (pos=0;pos<max;pos++)
+ for (pos=0;pos<8;pos++)
+ cbuf[pos] = (uint8_t) (offset >> pos*8);
+ for (pos=8;pos<max;pos++)
{
mod = (255 - (offset / 1024 / 32));
if (mod == 0)
* implementation of GAP, but can be disabled for performance evaluation of
* the basic routing algorithm.
*/
-#define SUPPORT_DELAYS GNUNET_YES
+#define SUPPORT_DELAYS GNUNET_NO
/**
* Maximum number of outgoing messages we queue per peer.
/**
* How long until we give up on transmitting the message?
*/
-#define TIMEOUT GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 3)
+#define TIMEOUT GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 300)
#define NUM_DAEMONS 2
{ "fs", "cummulative artificial delay introduced (ms)"},
{ "core", "# bytes decrypted"},
{ "core", "# bytes encrypted"},
+ { "core", "# transmissions delayed due to corking"},
{ "transport", "# bytes received via TCP"},
{ "transport", "# bytes transmitted via TCP"},
{ "datacache", "# bytes stored"},
{
struct StatMaster *sm = cls;
fprintf (stderr,
- "Peer %2u: %12s/%50s = %4llu\n",
+ "Peer %2u: %12s/%50s = %12llu\n",
sm->daemon,
subsystem,
name,