bool
huge_update_hashes(shared_file_t *sf,
const struct sha1 *sha1, const struct tth *tth)
{
struct sha1_cache_entry *cached;
filestat_t sb;
shared_file_check(sf);
g_return_val_if_fail(sha1, FALSE);
/*
* Make sure the file's timestamp is still accurate.
*/
if (-1 == stat(shared_file_path(sf), &sb)) {
g_warning("discarding SHA1 for file \"%s\": can't stat(): %m",
shared_file_path(sf));
shared_file_remove(sf);
return TRUE;
}
if (sb.st_mtime != shared_file_modification_time(sf)) {
g_warning("file \"%s\" was modified whilst SHA1 was computed",
shared_file_path(sf));
shared_file_set_modification_time(sf, sb.st_mtime);
request_sha1(sf); /* Retry! */
return TRUE;
}
if (huge_spam_check(sf, sha1)) {
shared_file_remove(sf);
return FALSE;
}
shared_file_set_sha1(sf, sha1);
shared_file_set_tth(sf, tth);
/* Update cache */
cached = hikset_lookup(sha1_cache, shared_file_path(sf));
if (cached) {
update_volatile_cache(cached, shared_file_size(sf),
shared_file_modification_time(sf), sha1, tth);
cache_dirty = TRUE;
/* Dump the cache at most about once per minute. */
if (!cache_dumped || delta_time(tm_time(), cache_dumped) > 60) {
dump_cache(FALSE);
}
} else {
add_volatile_cache_entry(shared_file_path(sf),
shared_file_size(sf), shared_file_modification_time(sf),
sha1, tth, TRUE);
add_persistent_cache_entry(shared_file_path(sf),
shared_file_size(sf), shared_file_modification_time(sf),
sha1, tth);
}
return TRUE;
}
/**
* External interface to call for getting the hash for a shared_file.
*/
void
request_sha1(shared_file_t *sf)
{
struct sha1_cache_entry *cached;
shared_file_check(sf);
if (!shared_file_indexed(sf))
return; /* "stale" shared file, has been superseded or removed */
cached = hikset_lookup(sha1_cache, shared_file_path(sf));
if (cached && cached_entry_up_to_date(cached, sf)) {
cache_dirty = TRUE;
cached->shared = TRUE;
shared_file_set_sha1(sf, cached->sha1);
shared_file_set_tth(sf, cached->tth);
request_tigertree(sf, NULL == cached->tth);
} else {
if (GNET_PROPERTY(share_debug) > 1) {
if (cached)
g_debug("cached SHA1 entry for \"%s\" outdated: "
"had mtime %lu, now %lu",
shared_file_path(sf),
(ulong) cached->mtime,
(ulong) shared_file_modification_time(sf));
else
g_debug("queuing \"%s\" for SHA1 computation",
shared_file_path(sf));
}
queue_shared_file_for_sha1_computation(sf);
}
}
/**
* Check to see if an (in-memory) entry cache is up to date.
*
* @return true (in the C sense) if it is, or false otherwise.
*/
static bool
cached_entry_up_to_date(const struct sha1_cache_entry *cache_entry,
const shared_file_t *sf)
{
return cache_entry->size == shared_file_size(sf)
&& cache_entry->mtime == shared_file_modification_time(sf);
}
/**
* Add file to the current query hit.
*
* @return TRUE if we kept the file, FALSE if we did not include it in the hit.
*/
static bool
g2_build_qh2_add(struct g2_qh2_builder *ctx, const shared_file_t *sf)
{
const sha1_t *sha1;
g2_tree_t *h, *c;
shared_file_check(sf);
/*
* Make sure the file is still in the library.
*/
if (0 == shared_file_index(sf))
return FALSE;
/*
* On G2, the H/URN child is required, meaning we need the SHA1 at least.
*/
if (!sha1_hash_available(sf))
return FALSE;
/*
* Do not send duplicates, as determined by the SHA1 of the resource.
*
* A user may share several files with different names but the same SHA1,
* and if all of them are hits, we only want to send one instance.
*
* When generating hits for host-browsing, we do not care about duplicates
* and ctx->hs is NULL then.
*/
sha1 = shared_file_sha1(sf); /* This is an atom */
if (ctx->hs != NULL) {
if (hset_contains(ctx->hs, sha1))
return FALSE;
hset_insert(ctx->hs, sha1);
}
/*
* Create the "H" child and attach it to the current tree.
*/
if (NULL == ctx->t)
g2_build_qh2_start(ctx);
h = g2_tree_alloc_empty("H");
g2_tree_add_child(ctx->t, h);
/*
* URN -- Universal Resource Name
*
* If there is a known TTH, then we can generate a bitprint, otherwise
* we just convey the SHA1.
*/
{
const tth_t * const tth = shared_file_tth(sf);
char payload[SHA1_RAW_SIZE + TTH_RAW_SIZE + sizeof G2_URN_BITPRINT];
char *p = payload;
if (NULL == tth) {
p = mempcpy(p, G2_URN_SHA1, sizeof G2_URN_SHA1);
p += clamp_memcpy(p, sizeof payload - ptr_diff(p, payload),
sha1, SHA1_RAW_SIZE);
} else {
p = mempcpy(p, G2_URN_BITPRINT, sizeof G2_URN_BITPRINT);
p += clamp_memcpy(p, sizeof payload - ptr_diff(p, payload),
sha1, SHA1_RAW_SIZE);
p += clamp_memcpy(p, sizeof payload - ptr_diff(p, payload),
tth, TTH_RAW_SIZE);
}
g_assert(ptr_diff(p, payload) <= sizeof payload);
c = g2_tree_alloc_copy("URN", payload, ptr_diff(p, payload));
g2_tree_add_child(h, c);
}
/*
* URL -- empty to indicate that we share the file via uri-res.
*/
if (ctx->flags & QHIT_F_G2_URL) {
uint known;
uint16 csc;
c = g2_tree_alloc_empty("URL");
g2_tree_add_child(h, c);
/*
* CSC -- if we know alternate sources, indicate how many in "CSC".
*
* This child is only emitted when they requested "URL".
*/
known = dmesh_count(sha1);
csc = MIN(known, MAX_INT_VAL(uint16));
if (csc != 0) {
char payload[2];
poke_le16(payload, csc);
c = g2_tree_alloc_copy("CSC", payload, sizeof payload);
g2_tree_add_child(h, c);
}
/*
* PART -- if we only have a partial file, indicate how much we have.
*
* This child is only emitted when they requested "URL".
*/
if (shared_file_is_partial(sf) && !shared_file_is_finished(sf)) {
filesize_t available = shared_file_available(sf);
char payload[8]; /* If we have to encode file size as 64-bit */
uint32 av32;
time_t mtime = shared_file_modification_time(sf);
c = g2_tree_alloc_empty("PART");
g2_tree_add_child(h, c);
av32 = available;
if (av32 == available) {
/* Fits within a 32-bit quantity */
poke_le32(payload, av32);
g2_tree_set_payload(c, payload, sizeof av32, TRUE);
} else {
/* Encode as a 64-bit quantity then */
poke_le64(payload, available);
g2_tree_set_payload(c, payload, sizeof payload, TRUE);
}
/*
* GTKG extension: encode the last modification time of the
* partial file in an "MT" child. This lets the other party
* determine whether the host is still able to actively complete
* the file.
*/
poke_le32(payload, (uint32) mtime);
g2_tree_add_child(c,
g2_tree_alloc_copy("MT", payload, sizeof(uint32)));
}
/*
* CT -- creation time of the resource (GTKG extension).
*/
{
time_t create_time = shared_file_creation_time(sf);
if ((time_t) -1 != create_time) {
char payload[8];
int n;
create_time = MAX(0, create_time);
n = vlint_encode(create_time, payload);
g2_tree_add_child(h,
g2_tree_alloc_copy("CT", payload, n)); /* No trailing 0s */
}
}
}
/*
* DN -- distinguished name.
*
* Note that the presence of DN also governs the presence of SZ if the
* file length does not fit a 32-bit unsigned quantity.
*/
if (ctx->flags & QHIT_F_G2_DN) {
char payload[8]; /* If we have to encode file size as 64-bit */
uint32 fs32;
filesize_t fs = shared_file_size(sf);
const char *name;
const char *rp;
c = g2_tree_alloc_empty("DN");
fs32 = fs;
if (fs32 == fs) {
/* Fits within a 32-bit quantity */
poke_le32(payload, fs32);
g2_tree_set_payload(c, payload, sizeof fs32, TRUE);
} else {
/* Does not fit a 32-bit quantity, emit a SZ child */
poke_le64(payload, fs);
g2_tree_add_child(h,
g2_tree_alloc_copy("SZ", payload, sizeof payload));
}
name = shared_file_name_nfc(sf);
g2_tree_append_payload(c, name, shared_file_name_nfc_len(sf));
g2_tree_add_child(h, c);
/*
* GTKG extension: if there is a file path, expose it as a "P" child
* under the DN node.
*/
rp = shared_file_relative_path(sf);
if (rp != NULL) {
g2_tree_add_child(c, g2_tree_alloc_copy("P", rp, strlen(rp)));
}
}
/*
* GTKG extension: if they requested alt-locs in the /Q2/I with "A", then
* send them some known alt-locs in an "ALT" child.
*
* Note that these alt-locs can be for Gnutella hosts: since both Gnutella
* and G2 share a common HTTP-based file transfer mechanism with compatible
* extra headers, there is no need to handle them separately.
*/
if (ctx->flags & QHIT_F_G2_ALT) {
gnet_host_t hvec[G2_BUILD_QH2_MAX_ALT];
int hcnt = 0;
hcnt = dmesh_fill_alternate(sha1, hvec, N_ITEMS(hvec));
if (hcnt > 0) {
int i;
c = g2_tree_alloc_empty("ALT");
for (i = 0; i < hcnt; i++) {
host_addr_t addr;
uint16 port;
addr = gnet_host_get_addr(&hvec[i]);
port = gnet_host_get_port(&hvec[i]);
if (host_addr_is_ipv4(addr)) {
char payload[6];
host_ip_port_poke(payload, addr, port, NULL);
g2_tree_append_payload(c, payload, sizeof payload);
}
}
/*
* If the payload is still empty, then drop the "ALT" child.
* Otherwise, attach it to the "H" node.
*/
if (NULL == g2_tree_node_payload(c, NULL)) {
g2_tree_free_null(&c);
} else {
g2_tree_add_child(h, c);
}
}
}
/*
* Update the size of the query hit we're generating.
*/
ctx->current_size += g2_frame_serialize(h, NULL, 0);
return TRUE;
}
