static bool
huge_verify_callback(const struct verify *ctx, enum verify_status status,
void *user_data)
{
shared_file_t *sf = user_data;
shared_file_check(sf);
switch (status) {
case VERIFY_START:
if (!huge_need_sha1(sf))
return FALSE;
gnet_prop_set_boolean_val(PROP_SHA1_REBUILDING, TRUE);
return TRUE;
case VERIFY_PROGRESS:
return 0 != (SHARE_F_INDEXED & shared_file_flags(sf));
case VERIFY_DONE:
huge_update_hashes(sf, verify_sha1_digest(ctx), NULL);
request_tigertree(sf, TRUE);
/* FALL THROUGH */
case VERIFY_ERROR:
case VERIFY_SHUTDOWN:
gnet_prop_set_boolean_val(PROP_SHA1_REBUILDING, FALSE);
shared_file_unref(&sf);
return TRUE;
case VERIFY_INVALID:
break;
}
g_assert_not_reached();
return FALSE;
}
void
request_tigertree(shared_file_t *sf, bool high_priority)
{
int inserted;
verify_tth_init();
shared_file_check(sf);
g_return_if_fail(shared_file_is_finished(sf));
if (!shared_file_is_servable(sf))
return; /* "stale" shared file, has been superseded or removed */
/*
* This routine can be called when the VERIFY_DONE event is received by
* huge_verify_callback(). We may have already shutdown the TTH
* verification thread.
*/
if G_UNLIKELY(NULL == verify_tth.verify)
return;
sf = shared_file_ref(sf);
inserted = verify_enqueue(verify_tth.verify, high_priority,
shared_file_path(sf), 0, shared_file_size(sf),
request_tigertree_callback, sf);
if (!inserted)
shared_file_unref(&sf);
}
/**
* Retry publishing after some delay.
*
* @param pe the entry to publish
* @param delay delay in seconds
* @param msg if non-NULL, logging message explaining the delay
*/
static void
publisher_retry(struct publisher_entry *pe, int delay, const char *msg)
{
struct pubdata *pd;
publisher_check(pe);
g_assert(NULL == pe->publish_ev);
g_assert(delay > 0);
pd = get_pubdata(pe->sha1);
if (pd != NULL) {
pd->next_enqueue = time_advance(tm_time(), UNSIGNED(delay));
dbmw_write(db_pubdata, pe->sha1, pd, sizeof *pd);
}
pe->publish_ev = cq_insert(publish_cq, delay * 1000, handle_entry, pe);
pe->last_delayed = tm_time();
if (GNET_PROPERTY(publisher_debug) > 3) {
shared_file_t *sf = shared_file_by_sha1(pe->sha1);
g_debug("PUBLISHER will retry SHA-1 %s %s\"%s\" in %s: %s",
sha1_to_string(pe->sha1),
(sf && sf != SHARE_REBUILDING && shared_file_is_partial(sf)) ?
"partial " : "",
(sf && sf != SHARE_REBUILDING) ? shared_file_name_nfc(sf) : "",
compact_time(delay), msg != NULL ? msg : "<no reason>");
shared_file_unref(&sf);
}
}
static bool
request_tigertree_callback(const struct verify *ctx, enum verify_status status,
void *user_data)
{
shared_file_t *sf = user_data;
shared_file_check(sf);
switch (status) {
case VERIFY_START:
if (!(SHARE_F_INDEXED & shared_file_flags(sf))) {
/*
* After a rescan, there might be files in the queue which are
* no longer shared.
*/
if (GNET_PROPERTY(verify_debug) > 1) {
g_debug("skipping TTH computation for %s: no longer shared",
shared_file_path(sf));
}
return FALSE;
}
if (
shared_file_tth(sf) &&
tth_cache_lookup(shared_file_tth(sf), shared_file_size(sf)) > 0
) {
if (
GNET_PROPERTY(tigertree_debug) > 1 ||
GNET_PROPERTY(verify_debug) > 1
) {
g_debug("TTH for %s is already cached (%s)",
shared_file_path(sf), tth_base32(shared_file_tth(sf)));
}
return FALSE;
}
gnet_prop_set_boolean_val(PROP_TTH_REBUILDING, TRUE);
return TRUE;
case VERIFY_PROGRESS:
return 0 != (SHARE_F_INDEXED & shared_file_flags(sf));
case VERIFY_DONE:
{
const struct tth *tth = verify_tth_digest(ctx);
huge_update_hashes(sf, shared_file_sha1(sf), tth);
tth_cache_insert(tth, verify_tth_leaves(ctx),
verify_tth_leave_count(ctx));
}
/* FALL THROUGH */
case VERIFY_ERROR:
case VERIFY_SHUTDOWN:
shared_file_unref(&sf);
gnet_prop_set_boolean_val(PROP_TTH_REBUILDING, FALSE);
return TRUE;
case VERIFY_INVALID:
break;
}
g_assert_not_reached();
return FALSE;
}
static void
destroy_entry(struct st_entry *entry)
{
g_assert(entry != NULL);
atom_str_free_null(&entry->string);
shared_file_unref(&entry->sf);
WFREE(entry);
}
/**
* Writes the browse host data of the context ``ctx'' to the buffer
* ``dest''. This must be called multiple times to retrieve the complete
* data until zero is returned i.e., the end of file is reached.
*
* This routine deals with query hit data generation.
*
* @param ctx an initialized browse host context.
* @param dest the destination buffer.
* @param size the amount of bytes ``dest'' can hold.
*
* @return -1 on failure, zero at the end-of-file condition or if size
* was zero. On success, the amount of bytes copied to ``dest''
* is returned.
*/
static ssize_t
browse_host_read_qhits(struct special_upload *ctx,
void *const dest, size_t size)
{
struct browse_host_upload *bh = cast_to_browse_host_upload(ctx);
size_t remain = size;
char *p = dest;
/*
* If we have no hit pending that we can send, build some more.
*/
if (NULL == bh->hits) {
pslist_t *files = NULL, *sl;
int i;
for (i = 0; i < BH_SCAN_AHEAD; i++) {
shared_file_t *sf;
do {
/* Skip holes in indices */
bh->file_index++;
sf = shared_file_sorted(bh->file_index);
} while (NULL == sf && bh->file_index <= shared_files_scanned());
if (SHARE_REBUILDING == sf || NULL == sf)
break;
files = pslist_prepend(files, sf);
}
if (NULL == files) /* Did not find any more file to include */
return 0; /* We're done */
/*
* Now build the query hits containing the files we selected.
*/
files = pslist_reverse(files); /* Preserve order */
if (bh->flags & BH_F_G2) {
g2_build_qh2_results(files, i, BH_MAX_QH2_SIZE,
browse_host_record_qh2, bh, &blank_guid, 0);
} else {
qhit_build_results(files, i, BH_MAX_QHIT_SIZE,
browse_host_record_hit, bh, &blank_guid, 0, &zero_array);
}
g_assert(bh->hits != NULL); /* At least 1 hit enqueued */
bh->hits = pslist_reverse(bh->hits); /* Preserve order */
PSLIST_FOREACH(files, sl) {
shared_file_t *sf = sl->data;
shared_file_unref(&sf);
}
/**
* Put the shared file on the stack of the things to do.
*
* We first begin with the computation of the SHA1, and when completed we
* will continue with the TTH computation.
*/
static void
queue_shared_file_for_sha1_computation(shared_file_t *sf)
{
int inserted;
shared_file_check(sf);
inserted = verify_sha1_enqueue(FALSE, shared_file_path(sf),
shared_file_size(sf), huge_verify_callback,
shared_file_ref(sf));
if (!inserted)
shared_file_unref(&sf);
}
/**
* Delete pubdata from database.
*/
static void
delete_pubdata(const sha1_t *sha1)
{
dbmw_delete(db_pubdata, sha1);
if (GNET_PROPERTY(publisher_debug) > 2) {
shared_file_t *sf = shared_file_by_sha1(sha1);
g_debug("PUBLISHER SHA-1 %s %s\"%s\" reclaimed",
sha1_to_string(sha1),
(sf && sf != SHARE_REBUILDING && shared_file_is_partial(sf)) ?
"partial " : "",
(sf && sf != SHARE_REBUILDING) ? shared_file_name_nfc(sf) : "");
shared_file_unref(&sf);
}
}
/**
* Process the files according to the initialized /QH2 context.
*
* @return the amount of files processed.
*/
static int
g2_build_qh2_process(const pslist_t *files, struct g2_qh2_builder *ctx)
{
const pslist_t *sl;
int sent = 0;
PSLIST_FOREACH(files, sl) {
shared_file_t *sf = sl->data;
if (g2_build_qh2_add(ctx, sf))
sent++;
if (ctx->current_size >= ctx->max_size)
g2_build_qh2_flush(ctx);
shared_file_unref(&sf);
}
void
request_tigertree(shared_file_t *sf, bool high_priority)
{
int inserted;
verify_tth_init();
g_return_if_fail(sf);
shared_file_check(sf);
g_return_if_fail(!shared_file_is_partial(sf));
sf = shared_file_ref(sf);
inserted = verify_enqueue(verify_tth.verify, high_priority,
shared_file_path(sf), 0, shared_file_size(sf),
request_tigertree_callback, sf);
if (!inserted)
shared_file_unref(&sf);
}
/**
* Writes the browse host data of the context ``ctx'' to the buffer
* ``dest''. This must be called multiple times to retrieve the complete
* data until zero is returned i.e., the end of file is reached.
*
* This routine deals with HTML data generation.
*
* @param ctx an initialized browse host context.
* @param dest the destination buffer.
* @param size the amount of bytes ``dest'' can hold.
*
* @return -1 on failure, zero at the end-of-file condition or if size
* was zero. On success, the amount of bytes copied to ``dest''
* is returned.
*/
static ssize_t
browse_host_read_html(struct special_upload *ctx,
void *const dest, size_t size)
{
static const char header[] =
"<!DOCTYPE html PUBLIC \"-//W3C//DTD HTML 4.01//EN\">\r\n"
"<html>\r\n"
"<head>\r\n"
"<title>Browse Host</title>\r\n"
"</head>\r\n"
"<body>\r\n";
static const char trailer[] = "</ul>\r\n</body>\r\n</html>\r\n";
struct browse_host_upload *bh = cast_to_browse_host_upload(ctx);
char *p = dest;
g_assert(NULL != bh);
g_assert(NULL != dest);
g_assert(size <= INT_MAX);
g_assert(UNSIGNED(bh->state) < NUM_BH_STATES);
g_assert(bh->b_size <= INT_MAX);
g_assert(bh->b_offset <= bh->b_size);
do {
switch (bh->state) {
case BH_STATE_HEADER:
if (!bh->b_data) {
bh->b_data = header;
bh->b_size = CONST_STRLEN(header);
}
p += browse_host_read_data(bh, p, &size);
if (bh->b_size == bh->b_offset)
browse_host_next_state(bh, BH_STATE_LIBRARY_INFO);
break;
case BH_STATE_LIBRARY_INFO:
if (!bh->b_data) {
bh->w_buf_size = w_concat_strings(&bh->w_buf,
"<h1>", product_name(), "</h1>\r\n"
"<h3>", version_get_string(),
" sharing ",
uint64_to_string(shared_files_scanned()),
" file",
plural(shared_files_scanned()),
" ",
short_kb_size(shared_kbytes_scanned(),
GNET_PROPERTY(display_metric_units)),
" total</h3>\r\n"
"<ul>\r\n", NULL_PTR);
bh->b_data = bh->w_buf;
bh->b_size = bh->w_buf_size - 1; /* minus trailing NUL */
bh->b_offset = 0;
}
p += browse_host_read_data(bh, p, &size);
if (bh->b_size == bh->b_offset)
browse_host_next_state(bh, BH_STATE_FILES);
break;
case BH_STATE_TRAILER:
if (!bh->b_data) {
bh->b_data = trailer;
bh->b_size = CONST_STRLEN(trailer);
}
p += browse_host_read_data(bh, p, &size);
if (bh->b_size == bh->b_offset)
browse_host_next_state(bh, BH_STATE_EOF);
break;
case BH_STATE_FILES:
if (bh->b_data && bh->b_size == bh->b_offset) {
g_assert(bh->w_buf == bh->b_data);
wfree(bh->w_buf, bh->w_buf_size);
bh->w_buf = NULL;
bh->w_buf_size = 0;
bh->b_data = NULL;
}
if (!bh->b_data) {
shared_file_t *sf;
bh->file_index++;
sf = shared_file_sorted(bh->file_index);
if (!sf) {
if (bh->file_index > shared_files_scanned())
browse_host_next_state(bh, BH_STATE_TRAILER);
/* Skip holes in the file_index table */
} else if (SHARE_REBUILDING == sf) {
browse_host_next_state(bh, BH_STATE_REBUILDING);
} else {
const char * const name_nfc = shared_file_name_nfc(sf);
const filesize_t file_size = shared_file_size(sf);
size_t html_size;
char *html_name;
{
const char *dir;
char *name;
dir = shared_file_relative_path(sf);
if (dir) {
name = h_strconcat(dir, "/", name_nfc, NULL_PTR);
} else {
name = deconstify_char(name_nfc);
}
html_size = 1 + html_escape(name, NULL, 0);
html_name = walloc(html_size);
html_escape(name, html_name, html_size);
if (name != name_nfc) {
HFREE_NULL(name);
}
}
if (sha1_hash_available(sf)) {
const struct sha1 *sha1 = shared_file_sha1(sf);
bh->w_buf_size = w_concat_strings(&bh->w_buf,
"<li><a href=\"/uri-res/N2R?urn:sha1:",
sha1_base32(sha1),
"\">", html_name, "</a> [",
short_html_size(file_size,
GNET_PROPERTY(display_metric_units)),
"]</li>\r\n",
NULL_PTR);
} else {
char *escaped;
escaped = url_escape(name_nfc);
bh->w_buf_size = w_concat_strings(&bh->w_buf,
"<li><a href=\"/get/",
uint32_to_string(shared_file_index(sf)),
"/", escaped, "\">", html_name, "</a>"
" [",
short_html_size(file_size,
GNET_PROPERTY(display_metric_units)),
"]</li>\r\n", NULL_PTR);
if (escaped != name_nfc) {
HFREE_NULL(escaped);
}
}
wfree(html_name, html_size);
bh->b_data = bh->w_buf;
bh->b_size = bh->w_buf_size - 1; /* minus trailing NUL */
bh->b_offset = 0;
}
shared_file_unref(&sf);
}
if (bh->b_data)
p += browse_host_read_data(bh, p, &size);
break;
case BH_STATE_REBUILDING:
if (!bh->b_data) {
static const char msg[] =
"<li>"
"<b>"
"The library is currently being rebuild. Please, "
"try again in a moment."
"</b>"
"</li>";
bh->b_data = msg;
bh->b_size = CONST_STRLEN(msg);
}
p += browse_host_read_data(bh, p, &size);
if (bh->b_size == bh->b_offset)
browse_host_next_state(bh, BH_STATE_TRAILER);
break;
case BH_STATE_EOF:
return p - cast_to_char_ptr(dest);
case NUM_BH_STATES:
g_assert_not_reached();
}
} while (size > 0);
return p - cast_to_char_ptr(dest);
}
static bool
request_tigertree_callback(const struct verify *ctx, enum verify_status status,
void *user_data)
{
shared_file_t *sf = user_data;
shared_file_check(sf);
switch (status) {
case VERIFY_START:
if (!shared_file_is_servable(sf)) {
/*
* After a rescan, there might be files in the queue which are
* no longer shared.
*/
if (GNET_PROPERTY(verify_debug) > 1) {
g_debug("skipping TTH computation for %s: not a servable file",
shared_file_path(sf));
}
return FALSE;
}
if (shared_file_tth_is_available(sf)) {
if (
GNET_PROPERTY(tigertree_debug) > 1 ||
GNET_PROPERTY(verify_debug) > 1
) {
g_debug("TTH for %s is already cached (%s)",
shared_file_path(sf), tth_base32(shared_file_tth(sf)));
}
return FALSE;
}
gnet_prop_set_boolean_val(PROP_TTH_REBUILDING, TRUE);
return TRUE;
case VERIFY_PROGRESS:
/*
* Processing can continue whilst the library file is indexed or the
* completed file is still beeing seeded.
*/
return shared_file_is_servable(sf);
case VERIFY_DONE:
{
const struct tth *tth = verify_tth_digest(ctx);
size_t n_leaves = verify_tth_leave_count(ctx);
if (GNET_PROPERTY(verify_debug)) {
g_debug("%s(): computed TTH %s (%zu lea%s) for %s",
G_STRFUNC, tth_base32(tth),
n_leaves, plural_f(n_leaves),
shared_file_path(sf));
}
/*
* Write the TTH to the cache first, before updating the hashes.
* That way, the logic behind huge_update_hashes() can rely on
* the fact that the TTH is persisted already.
*
* This is important for seeded files for which we re-compute
* the TTH once they are completed (to make sure we can serve
* THEX requests at the proper good depth). In order to update
* the GUI information, we'll need to probe the cache to determine
* how large the TTH is exactly, since all we pass back to the
* routines is the TTH root hash.
* --RAM, 2017-10-20
*/
tth_cache_insert(tth, verify_tth_leaves(ctx), n_leaves);
huge_update_hashes(sf, shared_file_sha1(sf), tth);
}
goto done;
case VERIFY_ERROR:
if (GNET_PROPERTY(verify_debug)) {
g_debug("%s(): unable to compute TTH for %s",
G_STRFUNC, shared_file_path(sf));
}
/* FALL THROUGH */
case VERIFY_SHUTDOWN:
goto done;
case VERIFY_INVALID:
break;
}
g_assert_not_reached();
return FALSE;
done:
shared_file_unref(&sf);
gnet_prop_set_boolean_val(PROP_TTH_REBUILDING, FALSE);
return TRUE;
}
/**
* Handle a SHA-1 entry, publishing its alt-loc to the DHT if still shared.
*/
static void
publisher_handle(struct publisher_entry *pe)
{
shared_file_t *sf;
bool is_partial = FALSE;
int alt_locs;
time_delta_t min_uptime;
uint32 avg_uptime;
publisher_check(pe);
g_assert(NULL == pe->publish_ev);
sf = shared_file_by_sha1(pe->sha1);
/*
* Remove SHA1 if no longer shared.
*/
if (NULL == sf) {
fileinfo_t *fi = file_info_by_sha1(pe->sha1);
/*
* If a partial file has lees than the minimum amount of data for PFSP,
* shared_file_by_sha1() will return NULL, hence we need to explicitly
* check for existence through file_info_by_sha1() and that the file
* still exists.
*/
if (fi != NULL && file_exists(fi->pathname)) {
/* Waiting for more data to be able to share, or PFSP re-enabled */
publisher_retry(pe, PUBLISH_BUSY, "partial file missing");
return;
}
if (GNET_PROPERTY(publisher_debug)) {
g_debug("PUBLISHER SHA-1 %s is no longer shared",
sha1_to_string(pe->sha1));
}
publisher_entry_free(pe, TRUE);
return;
}
/*
* Wait when rebuilding the library.
*/
if (SHARE_REBUILDING == sf) {
publisher_retry(pe, PUBLISH_BUSY, "library being rebuilt");
return;
}
is_partial = shared_file_is_partial(sf);
/*
* If the SHA1 is not available, wait.
*/
if (
!is_partial &&
(!sha1_hash_available(sf) || !sha1_hash_is_uptodate(sf))
) {
publisher_retry(pe, PUBLISH_BUSY, "SHA-1 of file unknown yet");
goto done;
}
/*
* Look whether this node has a sufficient average uptime.
*
* We're stricter to publish partial files because we want to favor
* publishing of full files in the DHT, and the benefits of publishing
* partial entries come only if we're up for a long enough time.
*
* Since publishing imposes lookup traffic in the DHT, it is not efficient
* to have transient nodes publish file sharing information because this
* will likely never be useful.
*/
min_uptime = PUBLISH_TRANSIENT;
if (is_partial)
min_uptime *= 2;
avg_uptime = get_average_servent_uptime(tm_time());
if (avg_uptime < UNSIGNED(min_uptime)) {
time_delta_t delay = min_uptime - avg_uptime;
delay = MAX(delay, PUBLISH_BUSY);
publisher_retry(pe, delay, "minimum average uptime not reached yet");
goto done;
}
/*
* If we are dealing with a file for which we know enough alternate
* locations, assume it is popular and do not publish it yet.
*
* We do not publish the SHA-1 of a partial file for which we know
* of at least two alternate locations because the purpose of us publishing
* these partial SHA-1s is to attract other PFSP-aware hosts and
* recreate a mesh.
*/
alt_locs = dmesh_count(pe->sha1);
is_partial = is_partial && !shared_file_is_finished(sf);
if (alt_locs > (is_partial ? PUBLISH_PARTIAL_MAX : PUBLISH_DMESH_MAX)) {
if (GNET_PROPERTY(publisher_debug)) {
g_debug("PUBLISHER SHA-1 %s %s\"%s\" has %d download mesh "
"entr%s, skipped", sha1_to_string(pe->sha1),
is_partial ? "partial " : "", shared_file_name_nfc(sf),
alt_locs, plural_y(alt_locs));
}
publisher_hold(pe, PUBLISH_POPULAR, "popular file");
goto done;
}
/*
* If the DHT is not enabled, postpone processing.
*/
if (!dht_enabled()) {
publisher_hold(pe, PUBLISH_BUSY, "DHT disabled");
goto done;
}
/*
* If this is a partial file for which we have less than the minimum
* for PFSP sharing, or if PFSP has been disabled, skip it.
*/
if (shared_file_is_partial(sf)) {
fileinfo_t *fi = shared_file_fileinfo(sf);
if (
!file_info_partial_shareable(fi) ||
fi->done < GNET_PROPERTY(pfsp_minimum_filesize)
) {
publisher_hold(pe, PUBLISH_BUSY, "PFSP minima not reached");
goto done;
}
}
/*
* Check whether it is time to process the entry, in case we're
* restarting quickly after a shutdown.
*/
if (0 == pe->last_publish) {
struct pubdata *pd = get_pubdata(pe->sha1);
if (pd != NULL) {
time_t now = tm_time();
time_delta_t enqueue = delta_time(pd->next_enqueue, now);
time_delta_t expire = delta_time(pd->expiration, now);
if (enqueue > 0 && (0 == pd->expiration || expire > 0)) {
int delay = MIN(enqueue, PUBLISH_POPULAR);
if (pd->expiration != 0)
delay = MIN(delay, expire);
if (GNET_PROPERTY(publisher_debug) > 1) {
g_debug("PUBLISHER SHA-1 %s delayed by %s",
sha1_to_string(pe->sha1), compact_time(enqueue));
}
publisher_retry(pe, delay, "first-time delay");
goto done;
}
}
}
/*
* Cancel possible remaining backgrounded publishing.
*/
if (pe->backgrounded) {
pdht_cancel_file(pe->sha1, FALSE);
pe->backgrounded = FALSE;
}
/*
* OK, we can publish this alternate location.
*/
if (pe->last_publish) {
if (GNET_PROPERTY(publisher_debug) > 2) {
g_debug("PUBLISHER SHA-1 %s re-enqueued %d secs "
"after last publish", sha1_to_string(pe->sha1),
(int) delta_time(tm_time(), pe->last_publish));
}
}
pe->last_enqueued = tm_time();
pdht_publish_file(sf, publisher_done, pe);
/* FALL THROUGH */
done:
shared_file_unref(&sf);
}
/**
* Publishing callback invoked when asynchronous publication is completed,
* or ended with an error.
*
* @return TRUE if we accept the publishing, FALSE otherwise to get the
* publishing layer to continue attempts to failed STORE roots and report
* on progress using the same callback.
*/
static bool
publisher_done(void *arg, pdht_error_t code, const pdht_info_t *info)
{
struct publisher_entry *pe = arg;
struct pubdata *pd;
int delay = PUBLISH_BUSY;
bool expired = FALSE;
bool accepted = TRUE;
publisher_check(pe);
pd = get_pubdata(pe->sha1);
/*
* Update stats on republishing before value expiration.
*/
if (PDHT_E_OK == code) {
if (pe->last_publish && info->roots > 0) {
if (pd != NULL) {
if (pd->expiration && delta_time(tm_time(), pd->expiration) > 0)
expired = TRUE;
} else {
time_delta_t elapsed = delta_time(tm_time(), pe->last_publish);
if (elapsed > DHT_VALUE_ALOC_EXPIRE)
expired = TRUE;
}
if (expired)
gnet_stats_inc_general(GNR_DHT_REPUBLISHED_LATE);
}
}
/*
* Compute retry delay.
*/
switch (code) {
case PDHT_E_OK:
/*
* If we were not able to publish to KDA_K nodes, decrease the
* delay before republishing. We use a non-linear decimation of
* the republish time, as a function of the number of nodes to which
* we could publish.
*/
delay = publisher_delay(info, DHT_VALUE_ALOC_EXPIRE);
accepted = publisher_is_acceptable(info);
break;
case PDHT_E_POPULAR:
/*
* Compute the suitable delay: the first time, we use PUBLISH_POPULAR,
* and then we double each time until we reach PUBLISH_POPULAR_MAX.
*
* If we already tried to publish the entry, pe->last_delayed will
* be non-zero.
*/
if (0 != pe->last_delayed) {
time_delta_t elapsed = delta_time(tm_time(), pe->last_delayed);
if (elapsed < PUBLISH_POPULAR) {
delay = PUBLISH_POPULAR;
} else if (elapsed >= PUBLISH_POPULAR_MAX / 2) {
delay = PUBLISH_POPULAR_MAX;
} else {
delay = elapsed * 2;
}
} else {
delay = PUBLISH_POPULAR;
}
break;
case PDHT_E_NOT_SHARED:
case PDHT_E_LOOKUP_EXPIRED:
case PDHT_E_LOOKUP:
case PDHT_E_UDP_CLOGGED:
case PDHT_E_PUBLISH_EXPIRED:
case PDHT_E_PUBLISH_ERROR:
case PDHT_E_SHA1:
case PDHT_E_PENDING:
case PDHT_E_CANCELLED:
case PDHT_E_GGEP:
case PDHT_E_NONE:
delay = PUBLISH_BUSY;
break;
case PDHT_E_MAX:
g_assert_not_reached();
}
/*
* For a backgrounded entry publishing, we need to adjust the computed
* delay with the time that was elapsed
*/
g_assert(!pe->backgrounded == !(pe->publish_ev != NULL));
if (pe->backgrounded) {
time_delta_t elapsed = delta_time(tm_time(), pe->last_delayed);
g_assert(pe->last_delayed > 0);
cq_cancel(&pe->publish_ev);
if (delay > elapsed) {
delay -= elapsed;
} else {
delay = 1;
}
}
/*
* Logging.
*/
if (GNET_PROPERTY(publisher_debug) > 1) {
shared_file_t *sf = shared_file_by_sha1(pe->sha1);
char retry[80];
char after[80];
const char *late = "";
after[0] = '\0';
if (pe->last_publish) {
time_delta_t elapsed = delta_time(tm_time(), pe->last_publish);
str_bprintf(after, sizeof after,
" after %s", compact_time(elapsed));
if (pd != NULL) {
if (expired)
late = "late, ";
} else {
late = "no data, ";
}
}
str_bprintf(retry, sizeof retry, "%s", compact_time(delay));
g_debug("PUBLISHER SHA-1 %s %s%s\"%s\" %spublished to %u node%s%s: %s"
" (%stook %s, total %u node%s, proba %.3f%%, retry in %s,"
" %s bg, path %u) [%s]",
sha1_to_string(pe->sha1),
pe->backgrounded ? "[bg] " : "",
(sf && sf != SHARE_REBUILDING && shared_file_is_partial(sf)) ?
"partial " : "",
(sf && sf != SHARE_REBUILDING) ? shared_file_name_nfc(sf) : "",
pe->last_publish ? "re" : "",
info->roots, plural(info->roots),
after, pdht_strerror(code), late,
compact_time(delta_time(tm_time(), pe->last_enqueued)),
info->all_roots, plural(info->all_roots),
info->presence * 100.0, retry,
info->can_bg ? "can" : "no", info->path_len,
accepted ? "OK" : "INCOMPLETE");
shared_file_unref(&sf);
}
/*
* Update last publishing time and remember expiration time.
*/
if (PDHT_E_OK == code && info->roots > 0) {
pe->last_publish = tm_time();
if (pd != NULL) {
pd->expiration =
time_advance(pe->last_publish, DHT_VALUE_ALOC_EXPIRE);
dbmw_write(db_pubdata, pe->sha1, pd, sizeof *pd);
}
}
/*
* If entry was deemed popular, we're going to delay its republishing
* by a larger amount of time and any data we published already about
* it will surely expire. Since this is our decision, we do not want
* to be told that republishing, if it occurs again, was done later than
* required. Hence call publisher_hold() to mark that we don't care.
*/
if (PDHT_E_POPULAR == code)
publisher_hold(pe, delay, "popular entry");
else
publisher_retry(pe, delay, accepted ? "accepted publish" : "published");
pe->backgrounded = !accepted;
return accepted;
}
