/**
* @return The number of leaves or zero if unknown.
*/
size_t
tth_cache_lookup(const struct tth *tth, filesize_t filesize)
{
size_t expected, leave_count = 0;
g_return_val_if_fail(tth, 0);
expected = tt_good_node_count(filesize);
if (expected > 1) {
filestat_t sb;
char *pathname;
pathname = tth_cache_pathname(tth);
if (stat(pathname, &sb)) {
leave_count = 0;
if (ENOENT != errno) {
g_warning("%s(%s): stat(\"%s\") failed: %m",
G_STRFUNC, tth_base32(tth), pathname);
}
} else {
leave_count = tth_cache_leave_count(tth, &sb);
}
HFREE_NULL(pathname);
} else {
leave_count = 1;
}
return expected != leave_count ? 0 : leave_count;
}
static size_t
tth_cache_get_leaves(const struct tth *tth,
struct tth leaves[TTH_MAX_LEAVES], size_t n)
{
int fd, num_leaves = 0;
g_return_val_if_fail(tth, 0);
g_return_val_if_fail(leaves, 0);
fd = tth_cache_file_open(tth);
if (fd >= 0) {
filestat_t sb;
if (fstat(fd, &sb)) {
g_warning("%s(%s): fstat() failed: %m", G_STRFUNC, tth_base32(tth));
} else {
size_t n_leaves;
n_leaves = tth_cache_leave_count(tth, &sb);
n_leaves = MIN(n, n_leaves);
if (n_leaves > 0) {
size_t size;
ssize_t ret;
STATIC_ASSERT(TTH_RAW_SIZE == sizeof(leaves[0]));
size = TTH_RAW_SIZE * n_leaves;
ret = read(fd, &leaves[0].data, size);
if ((size_t) ret == size) {
num_leaves = n_leaves;
}
}
}
fd_forget_and_close(&fd);
}
return num_leaves;
}
/**
* Get amount of leaves stored in the cached TTH entry.
*
* @param tth the TTH for which we want the information
*
* @return 0 if the entry could not be located, the amount of leaves otherwise.
*/
size_t
tth_cache_get_nleaves(const struct tth *tth)
{
int fd;
filesize_t nleaves = 0;
g_return_val_if_fail(tth != NULL, 0);
fd = tth_cache_file_open(tth);
if (fd >= 0) {
filestat_t sb;
if (fstat(fd, &sb)) {
g_warning("%s(%s): fstat() failed: %m", G_STRFUNC, tth_base32(tth));
} else {
nleaves = tth_cache_leave_count(tth, &sb);
}
fd_forget_and_close(&fd);
}
return nleaves;
}
