Major changes to support large file transfer
This commit is contained in:
parent
a2a08156a7
commit
03696dd6e7
40 changed files with 875 additions and 427 deletions
|
@ -235,7 +235,7 @@ int ipfs_blockstore_get_unixfs(const unsigned char* hash, size_t hash_length, st
|
||||||
* @param bytes_written the number of bytes written to the blockstore
|
* @param bytes_written the number of bytes written to the blockstore
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_blockstore_put_node(const struct Node* node, const struct FSRepo* fs_repo, size_t* bytes_written) {
|
int ipfs_blockstore_put_node(const struct HashtableNode* node, const struct FSRepo* fs_repo, size_t* bytes_written) {
|
||||||
// from blockstore.go line 118
|
// from blockstore.go line 118
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
|
|
||||||
|
@ -249,9 +249,9 @@ int ipfs_blockstore_put_node(const struct Node* node, const struct FSRepo* fs_re
|
||||||
//TODO: put this in subdirectories
|
//TODO: put this in subdirectories
|
||||||
|
|
||||||
// turn the block into a binary array
|
// turn the block into a binary array
|
||||||
size_t protobuf_len = ipfs_node_protobuf_encode_size(node);
|
size_t protobuf_len = ipfs_hashtable_node_protobuf_encode_size(node);
|
||||||
unsigned char protobuf[protobuf_len];
|
unsigned char protobuf[protobuf_len];
|
||||||
retVal = ipfs_node_protobuf_encode(node, protobuf, protobuf_len, &protobuf_len);
|
retVal = ipfs_hashtable_node_protobuf_encode(node, protobuf, protobuf_len, &protobuf_len);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
free(key);
|
free(key);
|
||||||
return 0;
|
return 0;
|
||||||
|
@ -286,7 +286,7 @@ int ipfs_blockstore_put_node(const struct Node* node, const struct FSRepo* fs_re
|
||||||
* @param fs_repo where to look for the data
|
* @param fs_repo where to look for the data
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_blockstore_get_node(const unsigned char* hash, size_t hash_length, struct Node** node, const struct FSRepo* fs_repo) {
|
int ipfs_blockstore_get_node(const unsigned char* hash, size_t hash_length, struct HashtableNode** node, const struct FSRepo* fs_repo) {
|
||||||
// get datastore key, which is a base32 key of the multihash
|
// get datastore key, which is a base32 key of the multihash
|
||||||
unsigned char* key = ipfs_blockstore_hash_to_base32(hash, hash_length);
|
unsigned char* key = ipfs_blockstore_hash_to_base32(hash, hash_length);
|
||||||
|
|
||||||
|
@ -299,7 +299,7 @@ int ipfs_blockstore_get_node(const unsigned char* hash, size_t hash_length, stru
|
||||||
size_t bytes_read = fread(buffer, 1, file_size, file);
|
size_t bytes_read = fread(buffer, 1, file_size, file);
|
||||||
fclose(file);
|
fclose(file);
|
||||||
|
|
||||||
int retVal = ipfs_node_protobuf_decode(buffer, bytes_read, node);
|
int retVal = ipfs_hashtable_node_protobuf_decode(buffer, bytes_read, node);
|
||||||
|
|
||||||
free(key);
|
free(key);
|
||||||
free(filename);
|
free(filename);
|
||||||
|
|
|
@ -7,7 +7,7 @@ endif
|
||||||
|
|
||||||
LFLAGS =
|
LFLAGS =
|
||||||
DEPS = builder.h ipfs_node.h
|
DEPS = builder.h ipfs_node.h
|
||||||
OBJS = builder.o daemon.o null.o ping.o bootstrap.o
|
OBJS = builder.o daemon.o null.o ping.o bootstrap.o ipfs_node.o
|
||||||
|
|
||||||
%.o: %.c $(DEPS)
|
%.o: %.c $(DEPS)
|
||||||
$(CC) -c -o $@ $< $(CFLAGS)
|
$(CC) -c -o $@ $< $(CFLAGS)
|
||||||
|
|
|
@ -47,7 +47,7 @@ void ipfs_bootstrap_announce_files(struct IpfsNode* local_node) {
|
||||||
enum DatastoreCursorOp op = CURSOR_FIRST;
|
enum DatastoreCursorOp op = CURSOR_FIRST;
|
||||||
while (db->datastore_cursor_get(&key, &key_size, NULL, 0, op, db)) {
|
while (db->datastore_cursor_get(&key, &key_size, NULL, 0, op, db)) {
|
||||||
libp2p_logger_debug("bootstrap", "Announcing a file to the world.\n");
|
libp2p_logger_debug("bootstrap", "Announcing a file to the world.\n");
|
||||||
local_node->routing->Provide(local_node->routing, (char*)key, key_size);
|
local_node->routing->Provide(local_node->routing, key, key_size);
|
||||||
op = CURSOR_NEXT;
|
op = CURSOR_NEXT;
|
||||||
free(key);
|
free(key);
|
||||||
}
|
}
|
||||||
|
@ -66,7 +66,6 @@ void ipfs_bootstrap_announce_files(struct IpfsNode* local_node) {
|
||||||
* @returns nothing useful
|
* @returns nothing useful
|
||||||
*/
|
*/
|
||||||
void *ipfs_bootstrap_routing(void* param) {
|
void *ipfs_bootstrap_routing(void* param) {
|
||||||
libp2p_logger_add_class("bootstrap");
|
|
||||||
struct IpfsNode* local_node = (struct IpfsNode*)param;
|
struct IpfsNode* local_node = (struct IpfsNode*)param;
|
||||||
local_node->routing = ipfs_routing_new_online(local_node, &local_node->identity->private_key, NULL);
|
local_node->routing = ipfs_routing_new_online(local_node, &local_node->identity->private_key, NULL);
|
||||||
local_node->routing->Bootstrap(local_node->routing);
|
local_node->routing->Bootstrap(local_node->routing);
|
||||||
|
|
|
@ -20,29 +20,15 @@ int ipfs_daemon_start(char* repo_path) {
|
||||||
|
|
||||||
libp2p_logger_info("daemon", "Initializing daemon...\n");
|
libp2p_logger_info("daemon", "Initializing daemon...\n");
|
||||||
|
|
||||||
// read the configuration
|
struct IpfsNode* local_node = NULL;
|
||||||
struct FSRepo* fs_repo = NULL;
|
if (!ipfs_node_online_new(repo_path, &local_node))
|
||||||
if (!ipfs_repo_fsrepo_new(repo_path, NULL, &fs_repo))
|
goto exit;
|
||||||
goto exit;
|
|
||||||
|
|
||||||
// open the repository and read the file
|
|
||||||
if (!ipfs_repo_fsrepo_open(fs_repo)) {
|
|
||||||
goto exit;
|
|
||||||
}
|
|
||||||
|
|
||||||
// create a new IpfsNode
|
|
||||||
struct IpfsNode local_node;
|
|
||||||
local_node.mode = MODE_ONLINE;
|
|
||||||
local_node.peerstore = libp2p_peerstore_new();
|
|
||||||
local_node.providerstore = libp2p_providerstore_new();
|
|
||||||
local_node.repo = fs_repo;
|
|
||||||
local_node.identity = fs_repo->config->identity;
|
|
||||||
|
|
||||||
// Set null router param
|
// Set null router param
|
||||||
ma = multiaddress_new_from_string(fs_repo->config->addresses->swarm_head->item);
|
ma = multiaddress_new_from_string(local_node->repo->config->addresses->swarm_head->item);
|
||||||
listen_param.port = multiaddress_get_ip_port(ma);
|
listen_param.port = multiaddress_get_ip_port(ma);
|
||||||
listen_param.ipv4 = 0; // ip 0.0.0.0, all interfaces
|
listen_param.ipv4 = 0; // ip 0.0.0.0, all interfaces
|
||||||
listen_param.local_node = &local_node;
|
listen_param.local_node = local_node;
|
||||||
|
|
||||||
// Create pthread for swarm listener.
|
// Create pthread for swarm listener.
|
||||||
if (pthread_create(&work_pths[count_pths++], NULL, ipfs_null_listen, &listen_param)) {
|
if (pthread_create(&work_pths[count_pths++], NULL, ipfs_null_listen, &listen_param)) {
|
||||||
|
@ -50,7 +36,7 @@ int ipfs_daemon_start(char* repo_path) {
|
||||||
goto exit;
|
goto exit;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_bootstrap_routing(&local_node);
|
//ipfs_bootstrap_routing(local_node);
|
||||||
|
|
||||||
libp2p_logger_info("daemon", "Daemon is ready\n");
|
libp2p_logger_info("daemon", "Daemon is ready\n");
|
||||||
|
|
||||||
|
@ -64,18 +50,12 @@ int ipfs_daemon_start(char* repo_path) {
|
||||||
|
|
||||||
retVal = 1;
|
retVal = 1;
|
||||||
exit:
|
exit:
|
||||||
fprintf(stderr, "Cleaning up daemon processes\n");
|
libp2p_logger_debug("daemon", "Cleaning up daemon processes\n");
|
||||||
// clean up
|
// clean up
|
||||||
if (fs_repo != NULL)
|
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
|
||||||
if (local_node.peerstore != NULL)
|
|
||||||
libp2p_peerstore_free(local_node.peerstore);
|
|
||||||
if (local_node.providerstore != NULL)
|
|
||||||
libp2p_providerstore_free(local_node.providerstore);
|
|
||||||
if (ma != NULL)
|
if (ma != NULL)
|
||||||
multiaddress_free(ma);
|
multiaddress_free(ma);
|
||||||
if (local_node.routing != NULL) {
|
if (local_node != NULL) {
|
||||||
ipfs_routing_online_free(local_node.routing);
|
ipfs_node_free(local_node);
|
||||||
}
|
}
|
||||||
return retVal;
|
return retVal;
|
||||||
|
|
||||||
|
@ -94,10 +74,5 @@ int ipfs_daemon (int argc, char **argv)
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
libp2p_logger_add_class("peerstore");
|
|
||||||
libp2p_logger_add_class("providerstore");
|
|
||||||
libp2p_logger_add_class("daemon");
|
|
||||||
libp2p_logger_add_class("online");
|
|
||||||
|
|
||||||
return ipfs_daemon_start(repo_path);
|
return ipfs_daemon_start(repo_path);
|
||||||
}
|
}
|
||||||
|
|
61
core/ipfs_node.c
Normal file
61
core/ipfs_node.c
Normal file
|
@ -0,0 +1,61 @@
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
|
||||||
|
/***
|
||||||
|
* build an online IpfsNode
|
||||||
|
* @param repo_path where the IPFS repository directory is
|
||||||
|
* @param node the completed IpfsNode struct
|
||||||
|
* @returns true(1) on success
|
||||||
|
*/
|
||||||
|
int ipfs_node_online_new(const char* repo_path, struct IpfsNode** node) {
|
||||||
|
struct FSRepo* fs_repo = NULL;
|
||||||
|
|
||||||
|
*node = (struct IpfsNode*)malloc(sizeof(struct IpfsNode));
|
||||||
|
if(*node == NULL)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
struct IpfsNode* local_node = *node;
|
||||||
|
|
||||||
|
// build the struct
|
||||||
|
if (!ipfs_repo_fsrepo_new(repo_path, NULL, &fs_repo)) {
|
||||||
|
free(local_node);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
// open the repo
|
||||||
|
if (!ipfs_repo_fsrepo_open(fs_repo)) {
|
||||||
|
free(local_node);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// fill in the node
|
||||||
|
local_node->repo = fs_repo;
|
||||||
|
local_node->identity = fs_repo->config->identity;
|
||||||
|
local_node->peerstore = libp2p_peerstore_new();
|
||||||
|
local_node->providerstore = libp2p_providerstore_new();
|
||||||
|
local_node->mode = MODE_OFFLINE;
|
||||||
|
local_node->routing = ipfs_routing_new_online(local_node, &fs_repo->config->identity->private_key, NULL);
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/***
|
||||||
|
* Free resources from the creation of an IpfsNode
|
||||||
|
* @param node the node to free
|
||||||
|
* @returns true(1)
|
||||||
|
*/
|
||||||
|
int ipfs_node_free(struct IpfsNode* node) {
|
||||||
|
if (node != NULL) {
|
||||||
|
if (node->providerstore != NULL)
|
||||||
|
libp2p_providerstore_free(node->providerstore);
|
||||||
|
if (node->peerstore != NULL)
|
||||||
|
libp2p_peerstore_free(node->peerstore);
|
||||||
|
if (node->repo != NULL)
|
||||||
|
ipfs_repo_fsrepo_free(node->repo);
|
||||||
|
if (node->mode == MODE_ONLINE) {
|
||||||
|
ipfs_routing_online_free(node->routing);
|
||||||
|
}
|
||||||
|
free(node);
|
||||||
|
}
|
||||||
|
return 1;
|
||||||
|
}
|
|
@ -54,6 +54,7 @@ void ipfs_null_connection (void *ptr)
|
||||||
session.insecure_stream = libp2p_net_multistream_stream_new(connection_param->file_descriptor, connection_param->ip, connection_param->port);
|
session.insecure_stream = libp2p_net_multistream_stream_new(connection_param->file_descriptor, connection_param->ip, connection_param->port);
|
||||||
session.default_stream = session.insecure_stream;
|
session.default_stream = session.insecure_stream;
|
||||||
session.datastore = connection_param->local_node->repo->config->datastore;
|
session.datastore = connection_param->local_node->repo->config->datastore;
|
||||||
|
session.filestore = connection_param->local_node->repo->config->filestore;
|
||||||
|
|
||||||
libp2p_logger_log("null", LOGLEVEL_INFO, "Connection %d, count %d\n", connection_param->file_descriptor, *(connection_param->count));
|
libp2p_logger_log("null", LOGLEVEL_INFO, "Connection %d, count %d\n", connection_param->file_descriptor, *(connection_param->count));
|
||||||
|
|
||||||
|
@ -100,14 +101,14 @@ void ipfs_null_connection (void *ptr)
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
// try to get the Node
|
// try to get the Node
|
||||||
struct Node* node = NULL;
|
struct HashtableNode* node = NULL;
|
||||||
if (!ipfs_merkledag_get(hash, hash_length, &node, connection_param->local_node->repo)) {
|
if (!ipfs_merkledag_get(hash, hash_length, &node, connection_param->local_node->repo)) {
|
||||||
_continue = 0;
|
_continue = 0;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
size_t results_size = ipfs_node_protobuf_encode_size(node);
|
size_t results_size = ipfs_hashtable_node_protobuf_encode_size(node);
|
||||||
unsigned char results[results_size];
|
unsigned char results[results_size];
|
||||||
if (!ipfs_node_protobuf_encode(node, results, results_size, &results_size)) {
|
if (!ipfs_hashtable_node_protobuf_encode(node, results, results_size, &results_size)) {
|
||||||
_continue = 0;
|
_continue = 0;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
|
@ -6,18 +6,62 @@
|
||||||
#include "ipfs/merkledag/node.h"
|
#include "ipfs/merkledag/node.h"
|
||||||
#include "ipfs/repo/fsrepo/fs_repo.h"
|
#include "ipfs/repo/fsrepo/fs_repo.h"
|
||||||
#include "ipfs/repo/init.h"
|
#include "ipfs/repo/init.h"
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
#include "libp2p/utils/logger.h"
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* pull objects from ipfs
|
* pull objects from ipfs
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
/***
|
||||||
|
* Helper method to retrieve a protobuf'd Node from the router
|
||||||
|
* @param local_node the context
|
||||||
|
* @param hash the hash to retrieve
|
||||||
|
* @param hash_size the length of the hash
|
||||||
|
* @param result a place to store the Node
|
||||||
|
* @returns true(1) on success, otherwise false(0)
|
||||||
|
*/
|
||||||
|
int ipfs_exporter_get_node(struct IpfsNode* local_node, const unsigned char* hash, const size_t hash_size,
|
||||||
|
struct HashtableNode** result) {
|
||||||
|
unsigned char *buffer = NULL;
|
||||||
|
size_t buffer_size = 0;
|
||||||
|
int retVal = 0;
|
||||||
|
struct Libp2pMessage* msg = NULL;
|
||||||
|
|
||||||
|
if (local_node->routing->GetValue(local_node->routing, hash, hash_size, (void**)&buffer, &buffer_size)) {
|
||||||
|
libp2p_logger_debug("exporter", "get_node got a value. Converting it to a HashtableNode\n");
|
||||||
|
// unprotobuf
|
||||||
|
if (ipfs_hashtable_node_protobuf_decode(buffer, buffer_size, result)) {
|
||||||
|
libp2p_logger_debug("exporter", "Conversion to HashtableNode successful\n");
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
libp2p_logger_debug("exporter", "get_node got no value. Returning false.\n");
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
|
||||||
|
// copy in the hash
|
||||||
|
(*result)->hash_size = hash_size;
|
||||||
|
(*result)->hash = malloc(hash_size);
|
||||||
|
memcpy((*result)->hash, hash, hash_size);
|
||||||
|
|
||||||
|
retVal = 1;
|
||||||
|
exit:
|
||||||
|
if (buffer != NULL)
|
||||||
|
free(buffer);
|
||||||
|
if (msg != NULL)
|
||||||
|
libp2p_message_free(msg);
|
||||||
|
|
||||||
|
return retVal;
|
||||||
|
}
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Get a file by its hash, and write the data to a filestream
|
* Get a file by its hash, and write the data to a filestream
|
||||||
* @param hash the base58 multihash of the cid
|
* @param hash the base58 multihash of the cid
|
||||||
* @param file_descriptor where to write
|
* @param file_descriptor where to write
|
||||||
* @param fs_repo the repo
|
* @param local_node the context
|
||||||
*/
|
*/
|
||||||
int ipfs_exporter_to_filestream(const unsigned char* hash, FILE* file_descriptor, const struct FSRepo* fs_repo) {
|
int ipfs_exporter_to_filestream(const unsigned char* hash, FILE* file_descriptor, struct IpfsNode* local_node) {
|
||||||
|
|
||||||
// convert hash to cid
|
// convert hash to cid
|
||||||
struct Cid* cid = NULL;
|
struct Cid* cid = NULL;
|
||||||
if ( ipfs_cid_decode_hash_from_base58(hash, strlen((char*)hash), &cid) == 0) {
|
if ( ipfs_cid_decode_hash_from_base58(hash, strlen((char*)hash), &cid) == 0) {
|
||||||
|
@ -25,8 +69,8 @@ int ipfs_exporter_to_filestream(const unsigned char* hash, FILE* file_descriptor
|
||||||
}
|
}
|
||||||
|
|
||||||
// find block
|
// find block
|
||||||
struct Node* read_node = NULL;
|
struct HashtableNode* read_node = NULL;
|
||||||
if (ipfs_merkledag_get(cid->hash, cid->hash_length, &read_node, fs_repo) == 0) {
|
if (!ipfs_exporter_get_node(local_node, cid->hash, cid->hash_length, &read_node)) {
|
||||||
ipfs_cid_free(cid);
|
ipfs_cid_free(cid);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -41,31 +85,31 @@ int ipfs_exporter_to_filestream(const unsigned char* hash, FILE* file_descriptor
|
||||||
size_t bytes_written = fwrite(unix_fs->bytes, 1, unix_fs->bytes_size, file_descriptor);
|
size_t bytes_written = fwrite(unix_fs->bytes, 1, unix_fs->bytes_size, file_descriptor);
|
||||||
if (bytes_written != unix_fs->bytes_size) {
|
if (bytes_written != unix_fs->bytes_size) {
|
||||||
fclose(file_descriptor);
|
fclose(file_descriptor);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
ipfs_unixfs_free(unix_fs);
|
ipfs_unixfs_free(unix_fs);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_unixfs_free(unix_fs);
|
ipfs_unixfs_free(unix_fs);
|
||||||
} else {
|
} else {
|
||||||
struct NodeLink* link = read_node->head_link;
|
struct NodeLink* link = read_node->head_link;
|
||||||
struct Node* link_node = NULL;
|
struct HashtableNode* link_node = NULL;
|
||||||
while (link != NULL) {
|
while (link != NULL) {
|
||||||
if ( ipfs_merkledag_get(link->hash, link->hash_size, &link_node, fs_repo) == 0) {
|
if ( !ipfs_exporter_get_node(local_node, link->hash, link->hash_size, &link_node)) {
|
||||||
fclose(file_descriptor);
|
fclose(file_descriptor);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
struct UnixFS* unix_fs;
|
struct UnixFS* unix_fs;
|
||||||
ipfs_unixfs_protobuf_decode(link_node->data, link_node->data_size, &unix_fs);
|
ipfs_unixfs_protobuf_decode(link_node->data, link_node->data_size, &unix_fs);
|
||||||
size_t bytes_written = fwrite(unix_fs->bytes, 1, unix_fs->bytes_size, file_descriptor);
|
size_t bytes_written = fwrite(unix_fs->bytes, 1, unix_fs->bytes_size, file_descriptor);
|
||||||
if (bytes_written != unix_fs->bytes_size) {
|
if (bytes_written != unix_fs->bytes_size) {
|
||||||
ipfs_node_free(link_node);
|
ipfs_hashtable_node_free(link_node);
|
||||||
fclose(file_descriptor);
|
fclose(file_descriptor);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
ipfs_unixfs_free(unix_fs);
|
ipfs_unixfs_free(unix_fs);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_node_free(link_node);
|
ipfs_hashtable_node_free(link_node);
|
||||||
ipfs_unixfs_free(unix_fs);
|
ipfs_unixfs_free(unix_fs);
|
||||||
link = link->next;
|
link = link->next;
|
||||||
}
|
}
|
||||||
|
@ -73,7 +117,7 @@ int ipfs_exporter_to_filestream(const unsigned char* hash, FILE* file_descriptor
|
||||||
fclose(file_descriptor);
|
fclose(file_descriptor);
|
||||||
|
|
||||||
if (read_node != NULL)
|
if (read_node != NULL)
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
@ -85,13 +129,13 @@ int ipfs_exporter_to_filestream(const unsigned char* hash, FILE* file_descriptor
|
||||||
* @param file_name the file name to write to
|
* @param file_name the file name to write to
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_exporter_to_file(const unsigned char* hash, const char* file_name, const struct FSRepo* fs_repo) {
|
int ipfs_exporter_to_file(const unsigned char* hash, const char* file_name, struct IpfsNode *local_node) {
|
||||||
// process blocks
|
// process blocks
|
||||||
FILE* file = fopen(file_name, "wb");
|
FILE* file = fopen(file_name, "wb");
|
||||||
if (file == NULL) {
|
if (file == NULL) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
return ipfs_exporter_to_filestream(hash, file, fs_repo);
|
return ipfs_exporter_to_filestream(hash, file, local_node);
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -100,7 +144,7 @@ int ipfs_exporter_to_file(const unsigned char* hash, const char* file_name, cons
|
||||||
* @param file_name the file name to write to
|
* @param file_name the file name to write to
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_exporter_to_console(const unsigned char* hash, const struct FSRepo* fs_repo) {
|
int ipfs_exporter_to_console(const unsigned char* hash, struct IpfsNode *local_node) {
|
||||||
// convert hash to cid
|
// convert hash to cid
|
||||||
struct Cid* cid = NULL;
|
struct Cid* cid = NULL;
|
||||||
if ( ipfs_cid_decode_hash_from_base58(hash, strlen((char*)hash), &cid) == 0) {
|
if ( ipfs_cid_decode_hash_from_base58(hash, strlen((char*)hash), &cid) == 0) {
|
||||||
|
@ -108,8 +152,8 @@ int ipfs_exporter_to_console(const unsigned char* hash, const struct FSRepo* fs_
|
||||||
}
|
}
|
||||||
|
|
||||||
// find block
|
// find block
|
||||||
struct Node* read_node = NULL;
|
struct HashtableNode* read_node = NULL;
|
||||||
if (ipfs_merkledag_get(cid->hash, cid->hash_length, &read_node, fs_repo) == 0) {
|
if (!ipfs_exporter_get_node(local_node, cid->hash, cid->hash_length, &read_node)) {
|
||||||
ipfs_cid_free(cid);
|
ipfs_cid_free(cid);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -133,7 +177,7 @@ int ipfs_exporter_to_console(const unsigned char* hash, const struct FSRepo* fs_
|
||||||
printf("\"}\n");
|
printf("\"}\n");
|
||||||
|
|
||||||
if (read_node != NULL)
|
if (read_node != NULL)
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
@ -147,7 +191,6 @@ int ipfs_exporter_to_console(const unsigned char* hash, const struct FSRepo* fs_
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_exporter_object_get(int argc, char** argv) {
|
int ipfs_exporter_object_get(int argc, char** argv) {
|
||||||
struct FSRepo* fs_repo = NULL;
|
|
||||||
char* repo_path = NULL;
|
char* repo_path = NULL;
|
||||||
|
|
||||||
if (!ipfs_repo_get_directory(argc, argv, &repo_path)) {
|
if (!ipfs_repo_get_directory(argc, argv, &repo_path)) {
|
||||||
|
@ -155,22 +198,19 @@ int ipfs_exporter_object_get(int argc, char** argv) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// build the struct
|
struct IpfsNode* local_node = NULL;
|
||||||
int retVal = ipfs_repo_fsrepo_new(repo_path, NULL, &fs_repo);
|
if (!ipfs_node_online_new(repo_path, &local_node))
|
||||||
if (retVal == 0) {
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
|
||||||
// open the repo
|
|
||||||
retVal = ipfs_repo_fsrepo_open(fs_repo);
|
|
||||||
if (retVal == 0) {
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
// find hash
|
// find hash
|
||||||
retVal = ipfs_exporter_to_console((unsigned char*)argv[3], fs_repo);
|
int retVal = ipfs_exporter_to_console((unsigned char*)argv[3], local_node);
|
||||||
|
|
||||||
|
ipfs_node_free(local_node);
|
||||||
|
|
||||||
return retVal;
|
return retVal;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_exporter_cat_node(struct Node* node, const struct FSRepo* fs_repo) {
|
int ipfs_exporter_cat_node(struct HashtableNode* node, struct IpfsNode* local_node) {
|
||||||
// process this node, then move on to the links
|
// process this node, then move on to the links
|
||||||
|
|
||||||
// build the unixfs
|
// build the unixfs
|
||||||
|
@ -183,12 +223,12 @@ int ipfs_exporter_cat_node(struct Node* node, const struct FSRepo* fs_repo) {
|
||||||
struct NodeLink* current = node->head_link;
|
struct NodeLink* current = node->head_link;
|
||||||
while (current != NULL) {
|
while (current != NULL) {
|
||||||
// find the node
|
// find the node
|
||||||
struct Node* child_node = NULL;
|
struct HashtableNode* child_node = NULL;
|
||||||
if (ipfs_merkledag_get(current->hash, current->hash_size, &child_node, fs_repo) == 0) {
|
if (!ipfs_exporter_get_node(local_node, current->hash, current->hash_size, &child_node)) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_exporter_cat_node(child_node, fs_repo);
|
ipfs_exporter_cat_node(child_node, local_node);
|
||||||
ipfs_node_free(child_node);
|
ipfs_hashtable_node_free(child_node);
|
||||||
current = current->next;
|
current = current->next;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -202,7 +242,7 @@ int ipfs_exporter_cat_node(struct Node* node, const struct FSRepo* fs_repo) {
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_exporter_object_cat(int argc, char** argv) {
|
int ipfs_exporter_object_cat(int argc, char** argv) {
|
||||||
struct FSRepo* fs_repo = NULL;
|
struct IpfsNode *local_node = NULL;
|
||||||
char* repo_dir = NULL;
|
char* repo_dir = NULL;
|
||||||
|
|
||||||
if (!ipfs_repo_get_directory(argc, argv, &repo_dir)) {
|
if (!ipfs_repo_get_directory(argc, argv, &repo_dir)) {
|
||||||
|
@ -210,15 +250,9 @@ int ipfs_exporter_object_cat(int argc, char** argv) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// open the repo
|
if (!ipfs_node_online_new(repo_dir, &local_node))
|
||||||
int retVal = ipfs_repo_fsrepo_new(repo_dir, NULL, &fs_repo);
|
|
||||||
if (retVal == 0) {
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
|
||||||
retVal = ipfs_repo_fsrepo_open(fs_repo);
|
|
||||||
if (retVal == 0) {
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
// find hash
|
// find hash
|
||||||
// convert hash to cid
|
// convert hash to cid
|
||||||
struct Cid* cid = NULL;
|
struct Cid* cid = NULL;
|
||||||
|
@ -227,16 +261,16 @@ int ipfs_exporter_object_cat(int argc, char** argv) {
|
||||||
}
|
}
|
||||||
|
|
||||||
// find block
|
// find block
|
||||||
struct Node* read_node = NULL;
|
struct HashtableNode* read_node = NULL;
|
||||||
if (ipfs_merkledag_get(cid->hash, cid->hash_length, &read_node, fs_repo) == 0) {
|
if (ipfs_exporter_get_node(local_node, cid->hash, cid->hash_length, &read_node)) {
|
||||||
ipfs_cid_free(cid);
|
ipfs_cid_free(cid);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
// no longer need the cid
|
// no longer need the cid
|
||||||
ipfs_cid_free(cid);
|
ipfs_cid_free(cid);
|
||||||
|
|
||||||
ipfs_exporter_cat_node(read_node, fs_repo);
|
int retVal = ipfs_exporter_cat_node(read_node, local_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
|
|
||||||
return retVal;
|
return retVal;
|
||||||
|
|
||||||
|
|
|
@ -5,6 +5,7 @@
|
||||||
#include "ipfs/importer/importer.h"
|
#include "ipfs/importer/importer.h"
|
||||||
#include "ipfs/merkledag/merkledag.h"
|
#include "ipfs/merkledag/merkledag.h"
|
||||||
#include "libp2p/os/utils.h"
|
#include "libp2p/os/utils.h"
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
#include "ipfs/repo/fsrepo/fs_repo.h"
|
#include "ipfs/repo/fsrepo/fs_repo.h"
|
||||||
#include "ipfs/repo/init.h"
|
#include "ipfs/repo/init.h"
|
||||||
#include "ipfs/unixfs/unixfs.h"
|
#include "ipfs/unixfs/unixfs.h"
|
||||||
|
@ -22,7 +23,7 @@
|
||||||
* @param blocksize the blocksize to add
|
* @param blocksize the blocksize to add
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_importer_add_filesize_to_data_section(struct Node* node, size_t bytes_read) {
|
int ipfs_importer_add_filesize_to_data_section(struct HashtableNode* node, size_t bytes_read) {
|
||||||
// now add to the data section
|
// now add to the data section
|
||||||
struct UnixFS* data_section = NULL;
|
struct UnixFS* data_section = NULL;
|
||||||
if (node->data == NULL) {
|
if (node->data == NULL) {
|
||||||
|
@ -41,7 +42,7 @@ int ipfs_importer_add_filesize_to_data_section(struct Node* node, size_t bytes_r
|
||||||
unsigned char protobuf[protobuf_size];
|
unsigned char protobuf[protobuf_size];
|
||||||
ipfs_unixfs_protobuf_encode(data_section, protobuf, protobuf_size, &protobuf_size);
|
ipfs_unixfs_protobuf_encode(data_section, protobuf, protobuf_size, &protobuf_size);
|
||||||
ipfs_unixfs_free(data_section);
|
ipfs_unixfs_free(data_section);
|
||||||
ipfs_node_set_data(node, protobuf, protobuf_size);
|
ipfs_hashtable_node_set_data(node, protobuf, protobuf_size);
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -51,13 +52,13 @@ int ipfs_importer_add_filesize_to_data_section(struct Node* node, size_t bytes_r
|
||||||
* @param node the node to add to
|
* @param node the node to add to
|
||||||
* @returns number of bytes read
|
* @returns number of bytes read
|
||||||
*/
|
*/
|
||||||
size_t ipfs_import_chunk(FILE* file, struct Node* parent_node, struct FSRepo* fs_repo, size_t* total_size, size_t* bytes_written) {
|
size_t ipfs_import_chunk(FILE* file, struct HashtableNode* parent_node, struct FSRepo* fs_repo, size_t* total_size, size_t* bytes_written) {
|
||||||
unsigned char buffer[MAX_DATA_SIZE];
|
unsigned char buffer[MAX_DATA_SIZE];
|
||||||
size_t bytes_read = fread(buffer, 1, MAX_DATA_SIZE, file);
|
size_t bytes_read = fread(buffer, 1, MAX_DATA_SIZE, file);
|
||||||
|
|
||||||
// structs used by this method
|
// structs used by this method
|
||||||
struct UnixFS* new_unixfs = NULL;
|
struct UnixFS* new_unixfs = NULL;
|
||||||
struct Node* new_node = NULL;
|
struct HashtableNode* new_node = NULL;
|
||||||
struct NodeLink* new_link = NULL;
|
struct NodeLink* new_link = NULL;
|
||||||
|
|
||||||
// put the file bits into a new UnixFS file
|
// put the file bits into a new UnixFS file
|
||||||
|
@ -90,63 +91,63 @@ size_t ipfs_import_chunk(FILE* file, struct Node* parent_node, struct FSRepo* fs
|
||||||
// if there is more to read, create a new node.
|
// if there is more to read, create a new node.
|
||||||
if (bytes_read == MAX_DATA_SIZE) {
|
if (bytes_read == MAX_DATA_SIZE) {
|
||||||
// create a new node
|
// create a new node
|
||||||
if (ipfs_node_new_from_data(protobuf, *bytes_written, &new_node) == 0) {
|
if (ipfs_hashtable_node_new_from_data(protobuf, *bytes_written, &new_node) == 0) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
// persist
|
// persist
|
||||||
size_t size_of_node = 0;
|
size_t size_of_node = 0;
|
||||||
if (ipfs_merkledag_add(new_node, fs_repo, &size_of_node) == 0) {
|
if (ipfs_merkledag_add(new_node, fs_repo, &size_of_node) == 0) {
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// put link in parent node
|
// put link in parent node
|
||||||
if (ipfs_node_link_create(NULL, new_node->hash, new_node->hash_size, &new_link) == 0) {
|
if (ipfs_node_link_create(NULL, new_node->hash, new_node->hash_size, &new_link) == 0) {
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
new_link->t_size = size_of_node;
|
new_link->t_size = size_of_node;
|
||||||
*total_size += new_link->t_size;
|
*total_size += new_link->t_size;
|
||||||
// NOTE: disposal of this link object happens when the parent is disposed
|
// NOTE: disposal of this link object happens when the parent is disposed
|
||||||
if (ipfs_node_add_link(parent_node, new_link) == 0) {
|
if (ipfs_hashtable_node_add_link(parent_node, new_link) == 0) {
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_importer_add_filesize_to_data_section(parent_node, bytes_read);
|
ipfs_importer_add_filesize_to_data_section(parent_node, bytes_read);
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
*bytes_written = size_of_node;
|
*bytes_written = size_of_node;
|
||||||
size_of_node = 0;
|
size_of_node = 0;
|
||||||
} else {
|
} else {
|
||||||
// if there are no existing links, put what we pulled from the file into parent_node
|
// if there are no existing links, put what we pulled from the file into parent_node
|
||||||
// otherwise, add it as a link
|
// otherwise, add it as a link
|
||||||
if (parent_node->head_link == NULL) {
|
if (parent_node->head_link == NULL) {
|
||||||
ipfs_node_set_data(parent_node, protobuf, *bytes_written);
|
ipfs_hashtable_node_set_data(parent_node, protobuf, *bytes_written);
|
||||||
} else {
|
} else {
|
||||||
// there are existing links. put the data in a new node, save it, then put the link in parent_node
|
// there are existing links. put the data in a new node, save it, then put the link in parent_node
|
||||||
// create a new node
|
// create a new node
|
||||||
if (ipfs_node_new_from_data(protobuf, *bytes_written, &new_node) == 0) {
|
if (ipfs_hashtable_node_new_from_data(protobuf, *bytes_written, &new_node) == 0) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
// persist
|
// persist
|
||||||
if (ipfs_merkledag_add(new_node, fs_repo, &size_of_node) == 0) {
|
if (ipfs_merkledag_add(new_node, fs_repo, &size_of_node) == 0) {
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// put link in parent node
|
// put link in parent node
|
||||||
if (ipfs_node_link_create(NULL, new_node->hash, new_node->hash_size, &new_link) == 0) {
|
if (ipfs_node_link_create(NULL, new_node->hash, new_node->hash_size, &new_link) == 0) {
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
new_link->t_size = size_of_node;
|
new_link->t_size = size_of_node;
|
||||||
*total_size += new_link->t_size;
|
*total_size += new_link->t_size;
|
||||||
// NOTE: disposal of this link object happens when the parent is disposed
|
// NOTE: disposal of this link object happens when the parent is disposed
|
||||||
if (ipfs_node_add_link(parent_node, new_link) == 0) {
|
if (ipfs_hashtable_node_add_link(parent_node, new_link) == 0) {
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_importer_add_filesize_to_data_section(parent_node, bytes_read);
|
ipfs_importer_add_filesize_to_data_section(parent_node, bytes_read);
|
||||||
ipfs_node_free(new_node);
|
ipfs_hashtable_node_free(new_node);
|
||||||
}
|
}
|
||||||
// persist the main node
|
// persist the main node
|
||||||
ipfs_merkledag_add(parent_node, fs_repo, bytes_written);
|
ipfs_merkledag_add(parent_node, fs_repo, bytes_written);
|
||||||
|
@ -162,7 +163,7 @@ size_t ipfs_import_chunk(FILE* file, struct Node* parent_node, struct FSRepo* fs
|
||||||
* @param file_name the name of the file
|
* @param file_name the name of the file
|
||||||
* @returns true(1) if successful, false(0) if couldn't generate the MultiHash to be displayed
|
* @returns true(1) if successful, false(0) if couldn't generate the MultiHash to be displayed
|
||||||
*/
|
*/
|
||||||
int ipfs_import_print_node_results(const struct Node* node, const char* file_name) {
|
int ipfs_import_print_node_results(const struct HashtableNode* node, const char* file_name) {
|
||||||
// give some results to the user
|
// give some results to the user
|
||||||
//TODO: if directory_entry is itself a directory, traverse and report files
|
//TODO: if directory_entry is itself a directory, traverse and report files
|
||||||
int buffer_len = 100;
|
int buffer_len = 100;
|
||||||
|
@ -191,7 +192,7 @@ int ipfs_import_print_node_results(const struct Node* node, const char* file_nam
|
||||||
* @param recursive true if we should navigate directories
|
* @param recursive true if we should navigate directories
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** parent_node, struct FSRepo* fs_repo, size_t* bytes_written, int recursive) {
|
int ipfs_import_file(const char* root_dir, const char* fileName, struct HashtableNode** parent_node, struct IpfsNode* local_node, size_t* bytes_written, int recursive) {
|
||||||
/**
|
/**
|
||||||
* NOTE: When this function completes, parent_node will be either:
|
* NOTE: When this function completes, parent_node will be either:
|
||||||
* 1) the complete file, in the case of a small file (<256k-ish)
|
* 1) the complete file, in the case of a small file (<256k-ish)
|
||||||
|
@ -217,7 +218,7 @@ int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** p
|
||||||
new_root_dir = path;
|
new_root_dir = path;
|
||||||
}
|
}
|
||||||
// initialize parent_node as a directory
|
// initialize parent_node as a directory
|
||||||
if (ipfs_node_create_directory(parent_node) == 0) {
|
if (ipfs_hashtable_node_create_directory(parent_node) == 0) {
|
||||||
if (path != NULL)
|
if (path != NULL)
|
||||||
free(path);
|
free(path);
|
||||||
if (file != NULL)
|
if (file != NULL)
|
||||||
|
@ -231,7 +232,7 @@ int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** p
|
||||||
while (next != NULL) {
|
while (next != NULL) {
|
||||||
// process each file. NOTE: could be an embedded directory
|
// process each file. NOTE: could be an embedded directory
|
||||||
*bytes_written = 0;
|
*bytes_written = 0;
|
||||||
struct Node* file_node;
|
struct HashtableNode* file_node;
|
||||||
// put the filename together from fileName, which is the directory, and next->file_name
|
// put the filename together from fileName, which is the directory, and next->file_name
|
||||||
// which is a file (or a directory) within the directory we just found.
|
// which is a file (or a directory) within the directory we just found.
|
||||||
size_t filename_len = strlen(fileName) + strlen(next->file_name) + 2;
|
size_t filename_len = strlen(fileName) + strlen(next->file_name) + 2;
|
||||||
|
@ -239,8 +240,8 @@ int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** p
|
||||||
os_utils_filepath_join(fileName, next->file_name, full_file_name, filename_len);
|
os_utils_filepath_join(fileName, next->file_name, full_file_name, filename_len);
|
||||||
// adjust root directory
|
// adjust root directory
|
||||||
|
|
||||||
if (ipfs_import_file(new_root_dir, full_file_name, &file_node, fs_repo, bytes_written, recursive) == 0) {
|
if (ipfs_import_file(new_root_dir, full_file_name, &file_node, local_node, bytes_written, recursive) == 0) {
|
||||||
ipfs_node_free(*parent_node);
|
ipfs_hashtable_node_free(*parent_node);
|
||||||
os_utils_free_file_list(first);
|
os_utils_free_file_list(first);
|
||||||
if (file != NULL)
|
if (file != NULL)
|
||||||
free(file);
|
free(file);
|
||||||
|
@ -259,16 +260,16 @@ int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** p
|
||||||
ipfs_node_link_create(next->file_name, file_node->hash, file_node->hash_size, &file_node_link);
|
ipfs_node_link_create(next->file_name, file_node->hash, file_node->hash_size, &file_node_link);
|
||||||
file_node_link->t_size = *bytes_written;
|
file_node_link->t_size = *bytes_written;
|
||||||
// add file_node as link to parent_node
|
// add file_node as link to parent_node
|
||||||
ipfs_node_add_link(*parent_node, file_node_link);
|
ipfs_hashtable_node_add_link(*parent_node, file_node_link);
|
||||||
// clean up file_node
|
// clean up file_node
|
||||||
ipfs_node_free(file_node);
|
ipfs_hashtable_node_free(file_node);
|
||||||
// move to next file in list
|
// move to next file in list
|
||||||
next = next->next;
|
next = next->next;
|
||||||
} // while going through files
|
} // while going through files
|
||||||
}
|
}
|
||||||
// save the parent_node (the directory)
|
// save the parent_node (the directory)
|
||||||
size_t bytes_written;
|
size_t bytes_written;
|
||||||
ipfs_merkledag_add(*parent_node, fs_repo, &bytes_written);
|
ipfs_merkledag_add(*parent_node, local_node->repo, &bytes_written);
|
||||||
if (file != NULL)
|
if (file != NULL)
|
||||||
free(file);
|
free(file);
|
||||||
if (path != NULL)
|
if (path != NULL)
|
||||||
|
@ -277,7 +278,7 @@ int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** p
|
||||||
} else {
|
} else {
|
||||||
// process this file
|
// process this file
|
||||||
FILE* file = fopen(fileName, "rb");
|
FILE* file = fopen(fileName, "rb");
|
||||||
retVal = ipfs_node_new(parent_node);
|
retVal = ipfs_hashtable_node_new(parent_node);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -285,12 +286,15 @@ int ipfs_import_file(const char* root_dir, const char* fileName, struct Node** p
|
||||||
// add all nodes (will be called multiple times for large files)
|
// add all nodes (will be called multiple times for large files)
|
||||||
while ( bytes_read == MAX_DATA_SIZE) {
|
while ( bytes_read == MAX_DATA_SIZE) {
|
||||||
size_t written = 0;
|
size_t written = 0;
|
||||||
bytes_read = ipfs_import_chunk(file, *parent_node, fs_repo, &total_size, &written);
|
bytes_read = ipfs_import_chunk(file, *parent_node, local_node->repo, &total_size, &written);
|
||||||
*bytes_written += written;
|
*bytes_written += written;
|
||||||
}
|
}
|
||||||
fclose(file);
|
fclose(file);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// notify the network
|
||||||
|
local_node->routing->Provide(local_node->routing, (*parent_node)->hash, (*parent_node)->hash_size);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -359,51 +363,45 @@ int ipfs_import_files(int argc, char** argv) {
|
||||||
* param 2: -r (optional)
|
* param 2: -r (optional)
|
||||||
* param 3: directoryname
|
* param 3: directoryname
|
||||||
*/
|
*/
|
||||||
struct FSRepo* fs_repo = NULL;
|
struct IpfsNode* local_node = NULL;
|
||||||
|
char* repo_path = NULL;
|
||||||
|
int retVal = 0;
|
||||||
|
|
||||||
int recursive = ipfs_import_is_recursive(argc, argv);
|
int recursive = ipfs_import_is_recursive(argc, argv);
|
||||||
|
|
||||||
// parse the command line
|
// parse the command line
|
||||||
struct FileList* first = ipfs_import_get_filelist(argc, argv);
|
struct FileList* first = ipfs_import_get_filelist(argc, argv);
|
||||||
|
|
||||||
// open the repo
|
// open the repo
|
||||||
char* repo_path = NULL;
|
|
||||||
if (!ipfs_repo_get_directory(argc, argv, &repo_path)) {
|
if (!ipfs_repo_get_directory(argc, argv, &repo_path)) {
|
||||||
// dir doesn't exist
|
// dir doesn't exist
|
||||||
fprintf(stderr, "Repo does not exist: %s\n", repo_path);
|
fprintf(stderr, "Repo does not exist: %s\n", repo_path);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
if (!ipfs_repo_fsrepo_new(repo_path, NULL, &fs_repo)) {
|
ipfs_node_online_new(repo_path, &local_node);
|
||||||
fprintf(stderr, "Unable to build the repo struct: %s\n", repo_path);
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
if (!ipfs_repo_fsrepo_open(fs_repo)) {
|
|
||||||
fprintf(stderr, "Unable to open repository: %s\n", repo_path);
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
int retVal = 0;
|
|
||||||
|
|
||||||
// import the file(s)
|
// import the file(s)
|
||||||
struct FileList* current = first;
|
struct FileList* current = first;
|
||||||
while (current != NULL) {
|
while (current != NULL) {
|
||||||
struct Node* directory_entry = NULL;
|
struct HashtableNode* directory_entry = NULL;
|
||||||
char* path = NULL;
|
char* path = NULL;
|
||||||
char* filename = NULL;
|
char* filename = NULL;
|
||||||
os_utils_split_filename(current->file_name, &path, &filename);
|
os_utils_split_filename(current->file_name, &path, &filename);
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
retVal = ipfs_import_file(NULL, current->file_name, &directory_entry, fs_repo, &bytes_written, recursive);
|
retVal = ipfs_import_file(NULL, current->file_name, &directory_entry, local_node, &bytes_written, recursive);
|
||||||
|
|
||||||
ipfs_import_print_node_results(directory_entry, filename);
|
ipfs_import_print_node_results(directory_entry, filename);
|
||||||
// cleanup
|
// cleanup
|
||||||
ipfs_node_free(directory_entry);
|
ipfs_hashtable_node_free(directory_entry);
|
||||||
if (path != NULL)
|
if (path != NULL)
|
||||||
free(path);
|
free(path);
|
||||||
free(filename);
|
free(filename);
|
||||||
current = current->next;
|
current = current->next;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (fs_repo != NULL)
|
if (local_node!= NULL)
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
// free file list
|
// free file list
|
||||||
current = first;
|
current = first;
|
||||||
while (current != NULL) {
|
while (current != NULL) {
|
||||||
|
|
|
@ -106,7 +106,7 @@ int ipfs_resolver_is_remote(const char* path, const struct FSRepo* fs_repo) {
|
||||||
* @param fs_repo the local repo
|
* @param fs_repo the local repo
|
||||||
* @returns the node, or NULL if not found
|
* @returns the node, or NULL if not found
|
||||||
*/
|
*/
|
||||||
struct Node* ipfs_resolver_remote_get(const char* path, struct Node* from, const struct IpfsNode* ipfs_node) {
|
struct HashtableNode* ipfs_resolver_remote_get(const char* path, struct HashtableNode* from, const struct IpfsNode* ipfs_node) {
|
||||||
// parse the path
|
// parse the path
|
||||||
const char* temp = ipfs_resolver_remove_path_prefix(path, ipfs_node->repo);
|
const char* temp = ipfs_resolver_remove_path_prefix(path, ipfs_node->repo);
|
||||||
if (temp == NULL)
|
if (temp == NULL)
|
||||||
|
@ -158,8 +158,8 @@ struct Node* ipfs_resolver_remote_get(const char* path, struct Node* from, const
|
||||||
if (response_size == 1)
|
if (response_size == 1)
|
||||||
return NULL;
|
return NULL;
|
||||||
// turn the protobuf into a Node
|
// turn the protobuf into a Node
|
||||||
struct Node* node;
|
struct HashtableNode* node;
|
||||||
ipfs_node_protobuf_decode(response, response_size, &node);
|
ipfs_hashtable_node_protobuf_decode(response, response_size, &node);
|
||||||
return node;
|
return node;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -170,7 +170,7 @@ struct Node* ipfs_resolver_remote_get(const char* path, struct Node* from, const
|
||||||
* @param from the current node (or NULL if it is the first call)
|
* @param from the current node (or NULL if it is the first call)
|
||||||
* @returns what we are looking for, or NULL if it wasn't found
|
* @returns what we are looking for, or NULL if it wasn't found
|
||||||
*/
|
*/
|
||||||
struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct IpfsNode* ipfs_node) {
|
struct HashtableNode* ipfs_resolver_get(const char* path, struct HashtableNode* from, const struct IpfsNode* ipfs_node) {
|
||||||
|
|
||||||
struct FSRepo* fs_repo = ipfs_node->repo;
|
struct FSRepo* fs_repo = ipfs_node->repo;
|
||||||
|
|
||||||
|
@ -191,7 +191,7 @@ struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct
|
||||||
char* path_section;
|
char* path_section;
|
||||||
if (ipfs_resolver_next_path(path, &path_section) == 0)
|
if (ipfs_resolver_next_path(path, &path_section) == 0)
|
||||||
return NULL;
|
return NULL;
|
||||||
struct Node* current_node = NULL;
|
struct HashtableNode* current_node = NULL;
|
||||||
if (from == NULL) {
|
if (from == NULL) {
|
||||||
// this is the first time around. Grab the root node
|
// this is the first time around. Grab the root node
|
||||||
if (path_section[0] == 'Q' && path_section[1] == 'm') {
|
if (path_section[0] == 'Q' && path_section[1] == 'm') {
|
||||||
|
@ -215,7 +215,7 @@ struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct
|
||||||
} else {
|
} else {
|
||||||
// look on...
|
// look on...
|
||||||
free(path_section);
|
free(path_section);
|
||||||
struct Node* newNode = ipfs_resolver_get(&path[pos+1], current_node, ipfs_node); // the +1 is the slash
|
struct HashtableNode* newNode = ipfs_resolver_get(&path[pos+1], current_node, ipfs_node); // the +1 is the slash
|
||||||
return newNode;
|
return newNode;
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
|
@ -225,7 +225,7 @@ struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
// we were passed a node. If it is a directory, see if what we're looking for is in it
|
// we were passed a node. If it is a directory, see if what we're looking for is in it
|
||||||
if (ipfs_node_is_directory(from)) {
|
if (ipfs_hashtable_node_is_directory(from)) {
|
||||||
struct NodeLink* curr_link = from->head_link;
|
struct NodeLink* curr_link = from->head_link;
|
||||||
while (curr_link != NULL) {
|
while (curr_link != NULL) {
|
||||||
// if it matches the name, we found what we're looking for.
|
// if it matches the name, we found what we're looking for.
|
||||||
|
@ -237,7 +237,7 @@ struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct
|
||||||
}
|
}
|
||||||
if (strlen(path_section) == strlen(path)) {
|
if (strlen(path_section) == strlen(path)) {
|
||||||
// we are at the end of our search
|
// we are at the end of our search
|
||||||
ipfs_node_free(from);
|
ipfs_hashtable_node_free(from);
|
||||||
free(path_section);
|
free(path_section);
|
||||||
return current_node;
|
return current_node;
|
||||||
} else {
|
} else {
|
||||||
|
@ -246,8 +246,8 @@ struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct
|
||||||
free(path_section);
|
free(path_section);
|
||||||
// if we're at the end of the path, return the node
|
// if we're at the end of the path, return the node
|
||||||
// continue looking for the next part of the path
|
// continue looking for the next part of the path
|
||||||
ipfs_node_free(from);
|
ipfs_hashtable_node_free(from);
|
||||||
struct Node* newNode = ipfs_resolver_get(next_path_section, current_node, ipfs_node);
|
struct HashtableNode* newNode = ipfs_resolver_get(next_path_section, current_node, ipfs_node);
|
||||||
return newNode;
|
return newNode;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -262,7 +262,7 @@ struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct
|
||||||
// it should never get here
|
// it should never get here
|
||||||
free(path_section);
|
free(path_section);
|
||||||
if (from != NULL)
|
if (from != NULL)
|
||||||
ipfs_node_free(from);
|
ipfs_hashtable_node_free(from);
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -298,7 +298,7 @@ struct Libp2pPeer* ipfs_resolver_find_peer(const char* path, const struct IpfsNo
|
||||||
|
|
||||||
// ask the swarm for the peer
|
// ask the swarm for the peer
|
||||||
const char* address_string = ipfs_resolver_remove_path_prefix(path, fs_repo);
|
const char* address_string = ipfs_resolver_remove_path_prefix(path, fs_repo);
|
||||||
ipfs_node->routing->FindPeer(ipfs_node->routing, address_string, strlen(address_string), &peer);
|
ipfs_node->routing->FindPeer(ipfs_node->routing, (const unsigned char*)address_string, strlen(address_string), &peer);
|
||||||
|
|
||||||
return peer;
|
return peer;
|
||||||
}
|
}
|
||||||
|
|
|
@ -59,7 +59,7 @@ int ipfs_blockstore_get_unixfs(const unsigned char* hash, size_t hash_length, st
|
||||||
/**
|
/**
|
||||||
* Put a struct Node in the blockstore
|
* Put a struct Node in the blockstore
|
||||||
*/
|
*/
|
||||||
int ipfs_blockstore_put_node(const struct Node* node, const struct FSRepo* fs_repo, size_t* bytes_written);
|
int ipfs_blockstore_put_node(const struct HashtableNode* node, const struct FSRepo* fs_repo, size_t* bytes_written);
|
||||||
int ipfs_blockstore_get_node(const unsigned char* hash, size_t hash_length, struct Node** node, const struct FSRepo* fs_repo);
|
int ipfs_blockstore_get_node(const unsigned char* hash, size_t hash_length, struct HashtableNode** node, const struct FSRepo* fs_repo);
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|
|
@ -5,6 +5,7 @@
|
||||||
|
|
||||||
#include "ipfs/commands/context.h"
|
#include "ipfs/commands/context.h"
|
||||||
#include "ipfs/repo/config/config.h"
|
#include "ipfs/repo/config/config.h"
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
|
||||||
struct BuildCfg {
|
struct BuildCfg {
|
||||||
int online;
|
int online;
|
||||||
|
|
|
@ -19,3 +19,17 @@ struct IpfsNode {
|
||||||
//struct Mount** mounts;
|
//struct Mount** mounts;
|
||||||
// TODO: Add more here
|
// TODO: Add more here
|
||||||
};
|
};
|
||||||
|
|
||||||
|
/***
|
||||||
|
* build an online IpfsNode
|
||||||
|
* @param repo_path where the IPFS repository directory is
|
||||||
|
* @param node the completed IpfsNode struct
|
||||||
|
* @returns true(1) on success
|
||||||
|
*/
|
||||||
|
int ipfs_node_online_new(const char* repo_path, struct IpfsNode** node);
|
||||||
|
/***
|
||||||
|
* Free resources from the creation of an IpfsNode
|
||||||
|
* @param node the node to free
|
||||||
|
* @returns true(1)
|
||||||
|
*/
|
||||||
|
int ipfs_node_free(struct IpfsNode* node);
|
||||||
|
|
|
@ -1,5 +1,11 @@
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Pull bytes from the hashtable
|
||||||
|
*/
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* get a file by its hash, and write the data to a file
|
* get a file by its hash, and write the data to a file
|
||||||
* @param hash the base58 multihash of the cid
|
* @param hash the base58 multihash of the cid
|
||||||
|
@ -8,6 +14,16 @@
|
||||||
*/
|
*/
|
||||||
int ipfs_exporter_to_file(const unsigned char* hash, const char* file_name, const struct FSRepo* fs_repo);
|
int ipfs_exporter_to_file(const unsigned char* hash, const char* file_name, const struct FSRepo* fs_repo);
|
||||||
|
|
||||||
|
/***
|
||||||
|
* Retrieve a protobuf'd Node from the router
|
||||||
|
* @param local_node the context
|
||||||
|
* @param hash the hash to retrieve
|
||||||
|
* @param hash_size the length of the hash
|
||||||
|
* @param result a place to store the Node
|
||||||
|
* @returns true(1) on success, otherwise false(0)
|
||||||
|
*/
|
||||||
|
int ipfs_exporter_get_node(struct IpfsNode* local_node, const unsigned char* hash, const size_t hash_size, struct HashtableNode** result);
|
||||||
|
|
||||||
int ipfs_exporter_object_get(int argc, char** argv);
|
int ipfs_exporter_object_get(int argc, char** argv);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
|
|
|
@ -2,7 +2,7 @@
|
||||||
#define __IPFS_IMPORTER_IMPORTER_H__
|
#define __IPFS_IMPORTER_IMPORTER_H__
|
||||||
|
|
||||||
#include "ipfs/merkledag/node.h"
|
#include "ipfs/merkledag/node.h"
|
||||||
#include "ipfs/repo/fsrepo/fs_repo.h"
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Creates a node based on an incoming file or directory
|
* Creates a node based on an incoming file or directory
|
||||||
|
@ -19,7 +19,7 @@
|
||||||
* @param recursive true if we should navigate directories
|
* @param recursive true if we should navigate directories
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_import_file(const char* root, const char* fileName, struct Node** parent_node, struct FSRepo* fs_repo, size_t* bytes_written, int recursive);
|
int ipfs_import_file(const char* root, const char* fileName, struct HashtableNode** parent_node, struct IpfsNode *local_node, size_t* bytes_written, int recursive);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* called from the command line
|
* called from the command line
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
* @param from the current node (or NULL if it is the first call)
|
* @param from the current node (or NULL if it is the first call)
|
||||||
* @returns what we are looking for, or NULL if it wasn't found
|
* @returns what we are looking for, or NULL if it wasn't found
|
||||||
*/
|
*/
|
||||||
struct Node* ipfs_resolver_get(const char* path, struct Node* from, const struct IpfsNode* ipfs_node);
|
struct HashtableNode* ipfs_resolver_get(const char* path, struct HashtableNode* from, const struct IpfsNode* ipfs_node);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Interrogate the path, looking for the peer
|
* Interrogate the path, looking for the peer
|
||||||
|
|
|
@ -43,7 +43,7 @@ int main(int argc, char** argv)
|
||||||
////Nodes/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
////Nodes/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
//N_Create_From_Link
|
//N_Create_From_Link
|
||||||
struct Node * Mynode;
|
struct HashtableNode * Mynode;
|
||||||
Mynode = N_Create_From_Link(mylink);
|
Mynode = N_Create_From_Link(mylink);
|
||||||
mylink->name = "HAHA";//Testing for valid node creation
|
mylink->name = "HAHA";//Testing for valid node creation
|
||||||
printf("Node Link[0] Name: %s\nHash: %s\n",Mynode->head_link[0]->name, Mynode->head_link[0]->Lcid->hash);
|
printf("Node Link[0] Name: %s\nHash: %s\n",Mynode->head_link[0]->name, Mynode->head_link[0]->Lcid->hash);
|
||||||
|
@ -72,7 +72,7 @@ int main(int argc, char** argv)
|
||||||
printf("Outlinkamt: %d\n", Mynode->link_ammount);
|
printf("Outlinkamt: %d\n", Mynode->link_ammount);
|
||||||
|
|
||||||
//Node Copy
|
//Node Copy
|
||||||
struct Node * Node2;
|
struct HashtableNode * Node2;
|
||||||
Node2 = Node_Copy(Mynode);
|
Node2 = Node_Copy(Mynode);
|
||||||
printf("NODE COPY TEST: [0]: %s\n", Node2->head_link[0]->Lcid->hash);
|
printf("NODE COPY TEST: [0]: %s\n", Node2->head_link[0]->Lcid->hash);
|
||||||
Node_Delete(Node2);
|
Node_Delete(Node2);
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
* @param bytes_written the number of bytes written
|
* @param bytes_written the number of bytes written
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_merkledag_add(struct Node* node, struct FSRepo* fs_repo, size_t* bytes_written);
|
int ipfs_merkledag_add(struct HashtableNode* node, struct FSRepo* fs_repo, size_t* bytes_written);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Retrieves a node from the datastore based on the cid
|
* Retrieves a node from the datastore based on the cid
|
||||||
|
@ -23,7 +23,7 @@ int ipfs_merkledag_add(struct Node* node, struct FSRepo* fs_repo, size_t* bytes_
|
||||||
* @param fs_repo the repository
|
* @param fs_repo the repository
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_merkledag_get(const unsigned char* hash, size_t hash_size, struct Node** node, const struct FSRepo* fs_repo);
|
int ipfs_merkledag_get(const unsigned char* hash, size_t hash_size, struct HashtableNode** node, const struct FSRepo* fs_repo);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Retrieves a node from the datastore based on the multihash
|
* Retrieves a node from the datastore based on the multihash
|
||||||
|
@ -32,6 +32,6 @@ int ipfs_merkledag_get(const unsigned char* hash, size_t hash_size, struct Node*
|
||||||
* @param fs_repo the repository
|
* @param fs_repo the repository
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_merkledag_get_by_multihash(const unsigned char* multihash, size_t multihash_length, struct Node** node, const struct FSRepo* fs_repo);
|
int ipfs_merkledag_get_by_multihash(const unsigned char* multihash, size_t multihash_length, struct HashtableNode** node, const struct FSRepo* fs_repo);
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|
|
@ -22,7 +22,7 @@ struct NodeLink
|
||||||
struct NodeLink* next;
|
struct NodeLink* next;
|
||||||
};
|
};
|
||||||
|
|
||||||
struct Node
|
struct HashtableNode
|
||||||
{
|
{
|
||||||
// saved in protobuf
|
// saved in protobuf
|
||||||
size_t data_size;
|
size_t data_size;
|
||||||
|
@ -103,7 +103,7 @@ int ipfs_node_link_protobuf_decode(unsigned char* buffer, size_t buffer_length,
|
||||||
* @param node the node to examine
|
* @param node the node to examine
|
||||||
* @returns the max size of an encoded stream of bytes, if it were encoded
|
* @returns the max size of an encoded stream of bytes, if it were encoded
|
||||||
*/
|
*/
|
||||||
size_t ipfs_node_protobuf_encode_size(const struct Node* node);
|
size_t ipfs_hashtable_node_protobuf_encode_size(const struct HashtableNode* node);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Encode a node into a protobuf byte stream
|
* Encode a node into a protobuf byte stream
|
||||||
|
@ -113,7 +113,7 @@ size_t ipfs_node_protobuf_encode_size(const struct Node* node);
|
||||||
* @param bytes_written how much of buffer was used
|
* @param bytes_written how much of buffer was used
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_protobuf_encode(const struct Node* node, unsigned char* buffer, size_t max_buffer_length, size_t* bytes_written);
|
int ipfs_hashtable_node_protobuf_encode(const struct HashtableNode* node, unsigned char* buffer, size_t max_buffer_length, size_t* bytes_written);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Decode a stream of bytes into a Node structure
|
* Decode a stream of bytes into a Node structure
|
||||||
|
@ -122,7 +122,7 @@ int ipfs_node_protobuf_encode(const struct Node* node, unsigned char* buffer, si
|
||||||
* @param node pointer to the Node to be created
|
* @param node pointer to the Node to be created
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struct Node** node);
|
int ipfs_hashtable_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struct HashtableNode** node);
|
||||||
|
|
||||||
/*====================================================================================
|
/*====================================================================================
|
||||||
* Node Functions
|
* Node Functions
|
||||||
|
@ -133,7 +133,7 @@ int ipfs_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struc
|
||||||
* @param node the pointer to the memory allocated
|
* @param node the pointer to the memory allocated
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new(struct Node** node);
|
int ipfs_hashtable_node_new(struct HashtableNode** node);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Allocates memory for a node, and sets the data section to indicate
|
* Allocates memory for a node, and sets the data section to indicate
|
||||||
|
@ -141,14 +141,14 @@ int ipfs_node_new(struct Node** node);
|
||||||
* @param node the node to initialize
|
* @param node the node to initialize
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_node_create_directory(struct Node** node);
|
int ipfs_hashtable_node_create_directory(struct HashtableNode** node);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* Determine if this node is actually a directory
|
* Determine if this node is actually a directory
|
||||||
* @param node the node to examine
|
* @param node the node to examine
|
||||||
* @returns true(1) if this node is a directory. Otherwise, false(0)
|
* @returns true(1) if this node is a directory. Otherwise, false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_node_is_directory(struct Node* node);
|
int ipfs_hashtable_node_is_directory(struct HashtableNode* node);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* sets the Cid into the struct element titled cached
|
* sets the Cid into the struct element titled cached
|
||||||
|
@ -156,7 +156,7 @@ int ipfs_node_is_directory(struct Node* node);
|
||||||
* @param cid the cid
|
* @param cid the cid
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_set_hash(struct Node* node, const unsigned char* hash, size_t hash_size);
|
int ipfs_hashtable_node_set_hash(struct HashtableNode* node, const unsigned char* hash, size_t hash_size);
|
||||||
|
|
||||||
/*ipfs_node_set_data
|
/*ipfs_node_set_data
|
||||||
* Sets the data of a node
|
* Sets the data of a node
|
||||||
|
@ -165,42 +165,42 @@ int ipfs_node_set_hash(struct Node* node, const unsigned char* hash, size_t hash
|
||||||
* Sets pointers of encoded & cached to NULL /following go method
|
* Sets pointers of encoded & cached to NULL /following go method
|
||||||
* returns 1 on success 0 on failure
|
* returns 1 on success 0 on failure
|
||||||
*/
|
*/
|
||||||
int ipfs_node_set_data(struct Node * N, unsigned char * Data, size_t data_size);
|
int ipfs_hashtable_node_set_data(struct HashtableNode * N, unsigned char * Data, size_t data_size);
|
||||||
|
|
||||||
/*ipfs_node_set_encoded
|
/*ipfs_node_set_encoded
|
||||||
* @param NODE: the node you wish to alter (struct Node *)
|
* @param NODE: the node you wish to alter (struct Node *)
|
||||||
* @param Data: The data you wish to set in encoded.(unsigned char *)
|
* @param Data: The data you wish to set in encoded.(unsigned char *)
|
||||||
* returns 1 on success 0 on failure
|
* returns 1 on success 0 on failure
|
||||||
*/
|
*/
|
||||||
int ipfs_node_set_encoded(struct Node * N, unsigned char * Data);
|
int ipfs_hashtable_node_set_encoded(struct HashtableNode * N, unsigned char * Data);
|
||||||
|
|
||||||
/*ipfs_node_get_data
|
/*ipfs_node_get_data
|
||||||
* Gets data from a node
|
* Gets data from a node
|
||||||
* @param Node: = The node you want to get data from. (unsigned char *)
|
* @param Node: = The node you want to get data from. (unsigned char *)
|
||||||
* Returns data of node.
|
* Returns data of node.
|
||||||
*/
|
*/
|
||||||
unsigned char * ipfs_node_get_data(struct Node * N);
|
unsigned char * ipfs_hashtable_node_get_data(struct HashtableNode * N);
|
||||||
|
|
||||||
/*ipfs_node_free
|
/*ipfs_node_free
|
||||||
* Once you are finished using a node, always delete it using this.
|
* Once you are finished using a node, always delete it using this.
|
||||||
* It will take care of the links inside it.
|
* It will take care of the links inside it.
|
||||||
* @param N: the node you want to free. (struct Node *)
|
* @param N: the node you want to free. (struct Node *)
|
||||||
*/
|
*/
|
||||||
int ipfs_node_free(struct Node * N);
|
int ipfs_hashtable_node_free(struct HashtableNode * N);
|
||||||
|
|
||||||
/*ipfs_node_get_link_by_name
|
/*ipfs_node_get_link_by_name
|
||||||
* Returns a copy of the link with given name
|
* Returns a copy of the link with given name
|
||||||
* @param Name: (char * name) searches for link with this name
|
* @param Name: (char * name) searches for link with this name
|
||||||
* Returns the link struct if it's found otherwise returns NULL
|
* Returns the link struct if it's found otherwise returns NULL
|
||||||
*/
|
*/
|
||||||
struct NodeLink * ipfs_node_get_link_by_name(struct Node * N, char * Name);
|
struct NodeLink * ipfs_hashtable_node_get_link_by_name(struct HashtableNode * N, char * Name);
|
||||||
|
|
||||||
/*ipfs_node_remove_link_by_name
|
/*ipfs_node_remove_link_by_name
|
||||||
* Removes a link from node if found by name.
|
* Removes a link from node if found by name.
|
||||||
* @param name: Name of link (char * name)
|
* @param name: Name of link (char * name)
|
||||||
* returns 1 on success, 0 on failure.
|
* returns 1 on success, 0 on failure.
|
||||||
*/
|
*/
|
||||||
int ipfs_node_remove_link_by_name(char * Name, struct Node * mynode);
|
int ipfs_hashtable_node_remove_link_by_name(char * Name, struct HashtableNode * mynode);
|
||||||
|
|
||||||
/* ipfs_node_add_link
|
/* ipfs_node_add_link
|
||||||
* Adds a link to your node
|
* Adds a link to your node
|
||||||
|
@ -209,7 +209,7 @@ int ipfs_node_remove_link_by_name(char * Name, struct Node * mynode);
|
||||||
* @param linksz: sizeof(your cid here)
|
* @param linksz: sizeof(your cid here)
|
||||||
* Returns your node with the newly added link
|
* Returns your node with the newly added link
|
||||||
*/
|
*/
|
||||||
int ipfs_node_add_link(struct Node * mynode, struct NodeLink * mylink);
|
int ipfs_hashtable_node_add_link(struct HashtableNode * mynode, struct NodeLink * mylink);
|
||||||
|
|
||||||
/*ipfs_node_new_from_link
|
/*ipfs_node_new_from_link
|
||||||
* Create a node from a link
|
* Create a node from a link
|
||||||
|
@ -217,7 +217,7 @@ int ipfs_node_add_link(struct Node * mynode, struct NodeLink * mylink);
|
||||||
* @param node the pointer to the new node
|
* @param node the pointer to the new node
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new_from_link(struct NodeLink * mylink, struct Node** node);
|
int ipfs_hashtable_node_new_from_link(struct NodeLink * mylink, struct HashtableNode** node);
|
||||||
|
|
||||||
/*ipfs_node_new_from_data
|
/*ipfs_node_new_from_data
|
||||||
* @param data: bytes buffer you want to create the node from
|
* @param data: bytes buffer you want to create the node from
|
||||||
|
@ -225,7 +225,7 @@ int ipfs_node_new_from_link(struct NodeLink * mylink, struct Node** node);
|
||||||
* @param node the pointer to the new node
|
* @param node the pointer to the new node
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new_from_data(unsigned char * data, size_t data_size, struct Node** node);
|
int ipfs_hashtable_node_new_from_data(unsigned char * data, size_t data_size, struct HashtableNode** node);
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* create a Node struct from encoded data
|
* create a Node struct from encoded data
|
||||||
|
@ -233,7 +233,7 @@ int ipfs_node_new_from_data(unsigned char * data, size_t data_size, struct Node*
|
||||||
* @param node a pointer to the node that will be created
|
* @param node a pointer to the node that will be created
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new_from_encoded(unsigned char * data, struct Node** node);
|
int ipfs_hashtable_node_new_from_encoded(unsigned char * data, struct HashtableNode** node);
|
||||||
|
|
||||||
/*Node_Resolve_Max_Size
|
/*Node_Resolve_Max_Size
|
||||||
* !!!This shouldn't concern you!
|
* !!!This shouldn't concern you!
|
||||||
|
@ -278,7 +278,7 @@ struct Link_Proc
|
||||||
* @param N: The node you want to get links from
|
* @param N: The node you want to get links from
|
||||||
* @param path: The "foo/bar/bin" path
|
* @param path: The "foo/bar/bin" path
|
||||||
*/
|
*/
|
||||||
struct Link_Proc * Node_Resolve_Links(struct Node * N, char * path);
|
struct Link_Proc * Node_Resolve_Links(struct HashtableNode * N, char * path);
|
||||||
|
|
||||||
/*Free_link_Proc
|
/*Free_link_Proc
|
||||||
* frees the Link_Proc struct you created.
|
* frees the Link_Proc struct you created.
|
||||||
|
|
|
@ -33,6 +33,7 @@ struct Reprovider {
|
||||||
struct RepoConfig {
|
struct RepoConfig {
|
||||||
struct Identity* identity;
|
struct Identity* identity;
|
||||||
struct Datastore* datastore;
|
struct Datastore* datastore;
|
||||||
|
struct Filestore* filestore;
|
||||||
struct Addresses* addresses;
|
struct Addresses* addresses;
|
||||||
struct Mounts mounts;
|
struct Mounts mounts;
|
||||||
struct Discovery discovery;
|
struct Discovery discovery;
|
||||||
|
|
|
@ -91,8 +91,8 @@ int ipfs_repo_fsrepo_unixfs_read(const unsigned char* hash, size_t hash_length,
|
||||||
* @param fs_repo the repo to write to
|
* @param fs_repo the repo to write to
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_repo_fsrepo_node_write(const struct Node* unix_fs, const struct FSRepo* fs_repo, size_t* bytes_written);
|
int ipfs_repo_fsrepo_node_write(const struct HashtableNode* unix_fs, const struct FSRepo* fs_repo, size_t* bytes_written);
|
||||||
int ipfs_repo_fsrepo_node_read(const unsigned char* hash, size_t hash_length, struct Node** node, const struct FSRepo* fs_repo);
|
int ipfs_repo_fsrepo_node_read(const unsigned char* hash, size_t hash_length, struct HashtableNode** node, const struct FSRepo* fs_repo);
|
||||||
|
|
||||||
|
|
||||||
#endif /* fs_repo_h */
|
#endif /* fs_repo_h */
|
||||||
|
|
|
@ -23,16 +23,16 @@ struct IpfsRouting {
|
||||||
* @param 5 the size of the value
|
* @param 5 the size of the value
|
||||||
* @returns 0 on success, otherwise -1
|
* @returns 0 on success, otherwise -1
|
||||||
*/
|
*/
|
||||||
int (*PutValue) (struct IpfsRouting*, char*, size_t, void*, size_t);
|
int (*PutValue) (struct IpfsRouting*, const unsigned char*, size_t, const void*, size_t);
|
||||||
/**
|
/**
|
||||||
* Get a value from the datastore
|
* Get a value from the filestore
|
||||||
* @param 1 the struct that contains the connection information
|
* @param 1 the struct that contains the connection information
|
||||||
* @param 2 the key to look for
|
* @param 2 the key to look for
|
||||||
* @param 3 the size of the key
|
* @param 3 the size of the key
|
||||||
* @param 4 a place to store the value
|
* @param 4 a place to store the value
|
||||||
* @param 5 the size of the value
|
* @param 5 the size of the value
|
||||||
*/
|
*/
|
||||||
int (*GetValue) (struct IpfsRouting*, char*, size_t, void**, size_t*);
|
int (*GetValue) (struct IpfsRouting*, const unsigned char*, size_t, void**, size_t*);
|
||||||
/**
|
/**
|
||||||
* Find a provider
|
* Find a provider
|
||||||
* @param routing the context
|
* @param routing the context
|
||||||
|
@ -41,7 +41,7 @@ struct IpfsRouting {
|
||||||
* @param peers a vector of peers found that can provide the value for the key
|
* @param peers a vector of peers found that can provide the value for the key
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int (*FindProviders) (struct IpfsRouting* routing, unsigned char* key, size_t key_size, struct Libp2pVector** peers);
|
int (*FindProviders) (struct IpfsRouting* routing, const unsigned char* key, size_t key_size, struct Libp2pVector** peers);
|
||||||
/**
|
/**
|
||||||
* Find a peer
|
* Find a peer
|
||||||
* @param 1 the context
|
* @param 1 the context
|
||||||
|
@ -51,7 +51,7 @@ struct IpfsRouting {
|
||||||
* @param 5 the size of the results
|
* @param 5 the size of the results
|
||||||
* @returns 0 or error code
|
* @returns 0 or error code
|
||||||
*/
|
*/
|
||||||
int (*FindPeer) (struct IpfsRouting*, const char*, size_t, struct Libp2pPeer** result);
|
int (*FindPeer) (struct IpfsRouting*, const unsigned char*, size_t, struct Libp2pPeer** result);
|
||||||
/**
|
/**
|
||||||
* Announce to the network that this host can provide this key
|
* Announce to the network that this host can provide this key
|
||||||
* @param 1 the context
|
* @param 1 the context
|
||||||
|
@ -59,7 +59,7 @@ struct IpfsRouting {
|
||||||
* @param 3 the key size
|
* @param 3 the key size
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int (*Provide) (struct IpfsRouting*, char*, size_t);
|
int (*Provide) (struct IpfsRouting*, const unsigned char*, size_t);
|
||||||
/**
|
/**
|
||||||
* Ping
|
* Ping
|
||||||
* @param routing the context
|
* @param routing the context
|
||||||
|
@ -84,8 +84,8 @@ int ipfs_routing_online_free(ipfs_routing*);
|
||||||
// online using DHT/kademlia, the recommended router
|
// online using DHT/kademlia, the recommended router
|
||||||
ipfs_routing* ipfs_routing_new_kademlia(struct IpfsNode* local_node, struct RsaPrivateKey* private_key, struct Stream* stream);
|
ipfs_routing* ipfs_routing_new_kademlia(struct IpfsNode* local_node, struct RsaPrivateKey* private_key, struct Stream* stream);
|
||||||
// generic routines
|
// generic routines
|
||||||
int ipfs_routing_generic_put_value (ipfs_routing* offlineRouting, char *key, size_t key_size, void *val, size_t vlen);
|
int ipfs_routing_generic_put_value (ipfs_routing* offlineRouting, const unsigned char *key, size_t key_size, const void *val, size_t vlen);
|
||||||
int ipfs_routing_generic_get_value (ipfs_routing* offlineRouting, char *key, size_t key_size, void **val, size_t *vlen);
|
int ipfs_routing_generic_get_value (ipfs_routing* offlineRouting, const unsigned char *key, size_t key_size, void **val, size_t *vlen);
|
||||||
|
|
||||||
// supernode
|
// supernode
|
||||||
int ipfs_routing_supernode_parse_provider(const unsigned char* in, size_t in_size, struct Libp2pLinkedList** multiaddresses);
|
int ipfs_routing_supernode_parse_provider(const unsigned char* in, size_t in_size, struct Libp2pLinkedList** multiaddresses);
|
||||||
|
|
|
@ -7,7 +7,7 @@ OBJS = main.o \
|
||||||
../cid/cid.o \
|
../cid/cid.o \
|
||||||
../cmd/ipfs/init.o \
|
../cmd/ipfs/init.o \
|
||||||
../commands/argument.o ../commands/command_option.o ../commands/command.o ../commands/cli/parse.o \
|
../commands/argument.o ../commands/command_option.o ../commands/command.o ../commands/cli/parse.o \
|
||||||
../core/builder.o ../core/daemon.o ../core/null.o ../core/ping.o ../core/bootstrap.o \
|
../core/builder.o ../core/daemon.o ../core/null.o ../core/ping.o ../core/bootstrap.o ../core/ipfs_node.o \
|
||||||
../datastore/ds_helper.o \
|
../datastore/ds_helper.o \
|
||||||
../datastore/key.o \
|
../datastore/key.o \
|
||||||
../dnslink/*.o \
|
../dnslink/*.o \
|
||||||
|
|
|
@ -19,16 +19,16 @@
|
||||||
* @param bytes_written the number of bytes written
|
* @param bytes_written the number of bytes written
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_merkledag_add(struct Node* node, struct FSRepo* fs_repo, size_t* bytes_written) {
|
int ipfs_merkledag_add(struct HashtableNode* node, struct FSRepo* fs_repo, size_t* bytes_written) {
|
||||||
// taken from merkledag.go line 59
|
// taken from merkledag.go line 59
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
|
|
||||||
// compute the hash if necessary
|
// compute the hash if necessary
|
||||||
if (node->hash == NULL) {
|
if (node->hash == NULL) {
|
||||||
size_t protobuf_size = ipfs_node_protobuf_encode_size(node);
|
size_t protobuf_size = ipfs_hashtable_node_protobuf_encode_size(node);
|
||||||
unsigned char protobuf[protobuf_size];
|
unsigned char protobuf[protobuf_size];
|
||||||
size_t bytes_encoded;
|
size_t bytes_encoded;
|
||||||
retVal = ipfs_node_protobuf_encode(node, protobuf, protobuf_size, &bytes_encoded);
|
retVal = ipfs_hashtable_node_protobuf_encode(node, protobuf, protobuf_size, &bytes_encoded);
|
||||||
|
|
||||||
node->hash_size = 32;
|
node->hash_size = 32;
|
||||||
node->hash = (unsigned char*)malloc(node->hash_size);
|
node->hash = (unsigned char*)malloc(node->hash_size);
|
||||||
|
@ -59,7 +59,7 @@ int ipfs_merkledag_add(struct Node* node, struct FSRepo* fs_repo, size_t* bytes_
|
||||||
* @param fs_repo the repository
|
* @param fs_repo the repository
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_merkledag_get(const unsigned char* hash, size_t hash_size, struct Node** node, const struct FSRepo* fs_repo) {
|
int ipfs_merkledag_get(const unsigned char* hash, size_t hash_size, struct HashtableNode** node, const struct FSRepo* fs_repo) {
|
||||||
int retVal = 1;
|
int retVal = 1;
|
||||||
size_t key_length = 100;
|
size_t key_length = 100;
|
||||||
unsigned char key[key_length];
|
unsigned char key[key_length];
|
||||||
|
@ -77,12 +77,12 @@ int ipfs_merkledag_get(const unsigned char* hash, size_t hash_size, struct Node*
|
||||||
}
|
}
|
||||||
|
|
||||||
// set the hash
|
// set the hash
|
||||||
ipfs_node_set_hash(*node, hash, hash_size);
|
ipfs_hashtable_node_set_hash(*node, hash, hash_size);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_merkledag_get_by_multihash(const unsigned char* multihash, size_t multihash_length, struct Node** node, const struct FSRepo* fs_repo) {
|
int ipfs_merkledag_get_by_multihash(const unsigned char* multihash, size_t multihash_length, struct HashtableNode** node, const struct FSRepo* fs_repo) {
|
||||||
// convert to hash
|
// convert to hash
|
||||||
size_t hash_size = 0;
|
size_t hash_size = 0;
|
||||||
unsigned char* hash = NULL;
|
unsigned char* hash = NULL;
|
||||||
|
|
|
@ -223,7 +223,7 @@ exit:
|
||||||
/***
|
/***
|
||||||
* return an approximate size of the encoded node
|
* return an approximate size of the encoded node
|
||||||
*/
|
*/
|
||||||
size_t ipfs_node_protobuf_encode_size(const struct Node* node) {
|
size_t ipfs_hashtable_node_protobuf_encode_size(const struct HashtableNode* node) {
|
||||||
size_t size = 0;
|
size_t size = 0;
|
||||||
// links
|
// links
|
||||||
struct NodeLink* current = node->head_link;
|
struct NodeLink* current = node->head_link;
|
||||||
|
@ -246,7 +246,7 @@ size_t ipfs_node_protobuf_encode_size(const struct Node* node) {
|
||||||
* @param bytes_written how much of buffer was used
|
* @param bytes_written how much of buffer was used
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_protobuf_encode(const struct Node* node, unsigned char* buffer, size_t max_buffer_length, size_t* bytes_written) {
|
int ipfs_hashtable_node_protobuf_encode(const struct HashtableNode* node, unsigned char* buffer, size_t max_buffer_length, size_t* bytes_written) {
|
||||||
size_t bytes_used = 0;
|
size_t bytes_used = 0;
|
||||||
*bytes_written = 0;
|
*bytes_written = 0;
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
|
@ -282,7 +282,7 @@ int ipfs_node_protobuf_encode(const struct Node* node, unsigned char* buffer, si
|
||||||
* @param node pointer to the Node to be created
|
* @param node pointer to the Node to be created
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struct Node** node) {
|
int ipfs_hashtable_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struct HashtableNode** node) {
|
||||||
/*
|
/*
|
||||||
* Field 1: data
|
* Field 1: data
|
||||||
* Field 2: link
|
* Field 2: link
|
||||||
|
@ -293,7 +293,7 @@ int ipfs_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struc
|
||||||
size_t temp_size;
|
size_t temp_size;
|
||||||
struct NodeLink* temp_link = NULL;
|
struct NodeLink* temp_link = NULL;
|
||||||
|
|
||||||
if (ipfs_node_new(node) == 0)
|
if (ipfs_hashtable_node_new(node) == 0)
|
||||||
goto exit;
|
goto exit;
|
||||||
|
|
||||||
while(pos < buffer_length) {
|
while(pos < buffer_length) {
|
||||||
|
@ -319,7 +319,7 @@ int ipfs_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struc
|
||||||
goto exit;
|
goto exit;
|
||||||
free(temp_buffer);
|
free(temp_buffer);
|
||||||
temp_buffer = NULL;
|
temp_buffer = NULL;
|
||||||
ipfs_node_add_link(*node, temp_link);
|
ipfs_hashtable_node_add_link(*node, temp_link);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -329,7 +329,7 @@ int ipfs_node_protobuf_decode(unsigned char* buffer, size_t buffer_length, struc
|
||||||
|
|
||||||
exit:
|
exit:
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_node_free(*node);
|
ipfs_hashtable_node_free(*node);
|
||||||
}
|
}
|
||||||
if (temp_buffer != NULL)
|
if (temp_buffer != NULL)
|
||||||
free(temp_buffer);
|
free(temp_buffer);
|
||||||
|
@ -344,9 +344,9 @@ exit:
|
||||||
* Creates an empty node, allocates the required memory
|
* Creates an empty node, allocates the required memory
|
||||||
* Returns a fresh new node with no data set in it.
|
* Returns a fresh new node with no data set in it.
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new(struct Node** node)
|
int ipfs_hashtable_node_new(struct HashtableNode** node)
|
||||||
{
|
{
|
||||||
*node = (struct Node *)malloc(sizeof(struct Node));
|
*node = (struct HashtableNode *)malloc(sizeof(struct HashtableNode));
|
||||||
if (*node == NULL)
|
if (*node == NULL)
|
||||||
return 0;
|
return 0;
|
||||||
(*node)->hash = NULL;
|
(*node)->hash = NULL;
|
||||||
|
@ -364,30 +364,30 @@ int ipfs_node_new(struct Node** node)
|
||||||
* @param node the node to initialize
|
* @param node the node to initialize
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_node_create_directory(struct Node** node) {
|
int ipfs_hashtable_node_create_directory(struct HashtableNode** node) {
|
||||||
// initialize parent_node
|
// initialize parent_node
|
||||||
if (ipfs_node_new(node) == 0)
|
if (ipfs_hashtable_node_new(node) == 0)
|
||||||
return 0;
|
return 0;
|
||||||
// put a UnixFS protobuf in the data section
|
// put a UnixFS protobuf in the data section
|
||||||
struct UnixFS* unix_fs;
|
struct UnixFS* unix_fs;
|
||||||
if (ipfs_unixfs_new(&unix_fs) == 0) {
|
if (ipfs_unixfs_new(&unix_fs) == 0) {
|
||||||
ipfs_node_free(*node);
|
ipfs_hashtable_node_free(*node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
unix_fs->data_type = UNIXFS_DIRECTORY;
|
unix_fs->data_type = UNIXFS_DIRECTORY;
|
||||||
size_t protobuf_len = ipfs_unixfs_protobuf_encode_size(unix_fs);
|
size_t protobuf_len = ipfs_unixfs_protobuf_encode_size(unix_fs);
|
||||||
unsigned char protobuf[protobuf_len];
|
unsigned char protobuf[protobuf_len];
|
||||||
if (ipfs_unixfs_protobuf_encode(unix_fs, protobuf, protobuf_len, &protobuf_len) == 0) {
|
if (ipfs_unixfs_protobuf_encode(unix_fs, protobuf, protobuf_len, &protobuf_len) == 0) {
|
||||||
ipfs_node_free(*node);
|
ipfs_hashtable_node_free(*node);
|
||||||
ipfs_unixfs_free(unix_fs);
|
ipfs_unixfs_free(unix_fs);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_unixfs_free(unix_fs);
|
ipfs_unixfs_free(unix_fs);
|
||||||
ipfs_node_set_data(*node, protobuf, protobuf_len);
|
ipfs_hashtable_node_set_data(*node, protobuf, protobuf_len);
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_node_is_directory(struct Node* node) {
|
int ipfs_hashtable_node_is_directory(struct HashtableNode* node) {
|
||||||
if (node->data_size < 2) {
|
if (node->data_size < 2) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -406,7 +406,7 @@ int ipfs_node_is_directory(struct Node* node) {
|
||||||
* @param cid the Cid to be copied into the Node->cached element
|
* @param cid the Cid to be copied into the Node->cached element
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_set_hash(struct Node* node, const unsigned char* hash, size_t hash_size)
|
int ipfs_hashtable_node_set_hash(struct HashtableNode* node, const unsigned char* hash, size_t hash_size)
|
||||||
{
|
{
|
||||||
// don't reallocate if it is the same size
|
// don't reallocate if it is the same size
|
||||||
if (node->hash != NULL && hash_size != node->hash_size) {
|
if (node->hash != NULL && hash_size != node->hash_size) {
|
||||||
|
@ -434,7 +434,7 @@ int ipfs_node_set_hash(struct Node* node, const unsigned char* hash, size_t hash
|
||||||
* Sets pointers of encoded & cached to NULL /following go method
|
* Sets pointers of encoded & cached to NULL /following go method
|
||||||
* returns 1 on success 0 on failure
|
* returns 1 on success 0 on failure
|
||||||
*/
|
*/
|
||||||
int ipfs_node_set_data(struct Node* node, unsigned char * Data, size_t data_size)
|
int ipfs_hashtable_node_set_data(struct HashtableNode* node, unsigned char * Data, size_t data_size)
|
||||||
{
|
{
|
||||||
if(!node || !Data)
|
if(!node || !Data)
|
||||||
{
|
{
|
||||||
|
@ -457,7 +457,7 @@ int ipfs_node_set_data(struct Node* node, unsigned char * Data, size_t data_size
|
||||||
* @param Data: The data you wish to set in encoded.(unsigned char *)
|
* @param Data: The data you wish to set in encoded.(unsigned char *)
|
||||||
* returns 1 on success 0 on failure
|
* returns 1 on success 0 on failure
|
||||||
*/
|
*/
|
||||||
int ipfs_node_set_encoded(struct Node * N, unsigned char * Data)
|
int ipfs_hashtable_node_set_encoded(struct HashtableNode * N, unsigned char * Data)
|
||||||
{
|
{
|
||||||
if(!N || !Data)
|
if(!N || !Data)
|
||||||
{
|
{
|
||||||
|
@ -474,14 +474,14 @@ int ipfs_node_set_encoded(struct Node * N, unsigned char * Data)
|
||||||
* @param Node: = The node you want to get data from. (unsigned char *)
|
* @param Node: = The node you want to get data from. (unsigned char *)
|
||||||
* Returns data of node.
|
* Returns data of node.
|
||||||
*/
|
*/
|
||||||
unsigned char * ipfs_node_get_data(struct Node * N)
|
unsigned char * ipfs_hashtable_node_get_data(struct HashtableNode * N)
|
||||||
{
|
{
|
||||||
unsigned char * DATA;
|
unsigned char * DATA;
|
||||||
DATA = N->data;
|
DATA = N->data;
|
||||||
return DATA;
|
return DATA;
|
||||||
}
|
}
|
||||||
|
|
||||||
struct NodeLink* ipfs_node_link_last(struct Node* node) {
|
struct NodeLink* ipfs_node_link_last(struct HashtableNode* node) {
|
||||||
struct NodeLink* current = node->head_link;
|
struct NodeLink* current = node->head_link;
|
||||||
while(current != NULL) {
|
while(current != NULL) {
|
||||||
if (current->next == NULL)
|
if (current->next == NULL)
|
||||||
|
@ -491,7 +491,7 @@ struct NodeLink* ipfs_node_link_last(struct Node* node) {
|
||||||
return current;
|
return current;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_node_remove_link(struct Node* node, struct NodeLink* toRemove) {
|
int ipfs_node_remove_link(struct HashtableNode* node, struct NodeLink* toRemove) {
|
||||||
struct NodeLink* current = node->head_link;
|
struct NodeLink* current = node->head_link;
|
||||||
struct NodeLink* previous = NULL;
|
struct NodeLink* previous = NULL;
|
||||||
while(current != NULL && current != toRemove) {
|
while(current != NULL && current != toRemove) {
|
||||||
|
@ -519,7 +519,7 @@ int ipfs_node_remove_link(struct Node* node, struct NodeLink* toRemove) {
|
||||||
* It will take care of the links inside it.
|
* It will take care of the links inside it.
|
||||||
* @param N: the node you want to free. (struct Node *)
|
* @param N: the node you want to free. (struct Node *)
|
||||||
*/
|
*/
|
||||||
int ipfs_node_free(struct Node * N)
|
int ipfs_hashtable_node_free(struct HashtableNode * N)
|
||||||
{
|
{
|
||||||
if(N != NULL)
|
if(N != NULL)
|
||||||
{
|
{
|
||||||
|
@ -552,7 +552,7 @@ int ipfs_node_free(struct Node * N)
|
||||||
* @param Name: (char * name) searches for link with this name
|
* @param Name: (char * name) searches for link with this name
|
||||||
* Returns the link struct if it's found otherwise returns NULL
|
* Returns the link struct if it's found otherwise returns NULL
|
||||||
*/
|
*/
|
||||||
struct NodeLink * ipfs_node_get_link_by_name(struct Node * N, char * Name)
|
struct NodeLink * ipfs_hashtable_node_get_link_by_name(struct HashtableNode * N, char * Name)
|
||||||
{
|
{
|
||||||
struct NodeLink* current = N->head_link;
|
struct NodeLink* current = N->head_link;
|
||||||
while(current != NULL && strcmp(Name, current->name) != 0) {
|
while(current != NULL && strcmp(Name, current->name) != 0) {
|
||||||
|
@ -566,7 +566,7 @@ struct NodeLink * ipfs_node_get_link_by_name(struct Node * N, char * Name)
|
||||||
* @param name: Name of link (char * name)
|
* @param name: Name of link (char * name)
|
||||||
* returns 1 on success, 0 on failure.
|
* returns 1 on success, 0 on failure.
|
||||||
*/
|
*/
|
||||||
int ipfs_node_remove_link_by_name(char * Name, struct Node * mynode)
|
int ipfs_hashtable_node_remove_link_by_name(char * Name, struct HashtableNode * mynode)
|
||||||
{
|
{
|
||||||
struct NodeLink* current = mynode->head_link;
|
struct NodeLink* current = mynode->head_link;
|
||||||
struct NodeLink* previous = NULL;
|
struct NodeLink* previous = NULL;
|
||||||
|
@ -600,7 +600,7 @@ int ipfs_node_remove_link_by_name(char * Name, struct Node * mynode)
|
||||||
* @param mylink: the link to add
|
* @param mylink: the link to add
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_add_link(struct Node* node, struct NodeLink * mylink)
|
int ipfs_hashtable_node_add_link(struct HashtableNode* node, struct NodeLink * mylink)
|
||||||
{
|
{
|
||||||
if(node->head_link != NULL) {
|
if(node->head_link != NULL) {
|
||||||
// add to existing by finding last one
|
// add to existing by finding last one
|
||||||
|
@ -624,13 +624,13 @@ int ipfs_node_add_link(struct Node* node, struct NodeLink * mylink)
|
||||||
* @param linksize: sizeof(the link in mylink) (size_T)
|
* @param linksize: sizeof(the link in mylink) (size_T)
|
||||||
* Returns a fresh new node with the link you specified. Has to be freed with Node_Free preferably.
|
* Returns a fresh new node with the link you specified. Has to be freed with Node_Free preferably.
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new_from_link(struct NodeLink * mylink, struct Node** node)
|
int ipfs_hashtable_node_new_from_link(struct NodeLink * mylink, struct HashtableNode** node)
|
||||||
{
|
{
|
||||||
*node = (struct Node *) malloc(sizeof(struct Node));
|
*node = (struct HashtableNode *) malloc(sizeof(struct HashtableNode));
|
||||||
if (*node == NULL)
|
if (*node == NULL)
|
||||||
return 0;
|
return 0;
|
||||||
(*node)->head_link = NULL;
|
(*node)->head_link = NULL;
|
||||||
ipfs_node_add_link(*node, mylink);
|
ipfs_hashtable_node_add_link(*node, mylink);
|
||||||
(*node)->hash = NULL;
|
(*node)->hash = NULL;
|
||||||
(*node)->hash_size = 0;
|
(*node)->hash_size = 0;
|
||||||
(*node)->data = NULL;
|
(*node)->data = NULL;
|
||||||
|
@ -646,13 +646,13 @@ int ipfs_node_new_from_link(struct NodeLink * mylink, struct Node** node)
|
||||||
* @param node a pointer to the node to be created
|
* @param node a pointer to the node to be created
|
||||||
* returns a node with the data you inputted.
|
* returns a node with the data you inputted.
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new_from_data(unsigned char * data, size_t data_size, struct Node** node)
|
int ipfs_hashtable_node_new_from_data(unsigned char * data, size_t data_size, struct HashtableNode** node)
|
||||||
{
|
{
|
||||||
if(data)
|
if(data)
|
||||||
{
|
{
|
||||||
if (ipfs_node_new(node) == 0)
|
if (ipfs_hashtable_node_new(node) == 0)
|
||||||
return 0;
|
return 0;
|
||||||
return ipfs_node_set_data(*node, data, data_size);
|
return ipfs_hashtable_node_set_data(*node, data, data_size);
|
||||||
}
|
}
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -663,11 +663,11 @@ int ipfs_node_new_from_data(unsigned char * data, size_t data_size, struct Node*
|
||||||
* @param node a pointer to the node that will be created
|
* @param node a pointer to the node that will be created
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_node_new_from_encoded(unsigned char * data, struct Node** node)
|
int ipfs_hashtable_node_new_from_encoded(unsigned char * data, struct HashtableNode** node)
|
||||||
{
|
{
|
||||||
if(data)
|
if(data)
|
||||||
{
|
{
|
||||||
if (ipfs_node_new(node) == 0)
|
if (ipfs_hashtable_node_new(node) == 0)
|
||||||
return 0;
|
return 0;
|
||||||
(*node)->encoded = data;
|
(*node)->encoded = data;
|
||||||
return 1;
|
return 1;
|
||||||
|
@ -734,7 +734,7 @@ int Node_Resolve(char ** result, char * input1)
|
||||||
* @param N: The node you want to get links from
|
* @param N: The node you want to get links from
|
||||||
* @param path: The "foo/bar/bin" path
|
* @param path: The "foo/bar/bin" path
|
||||||
*/
|
*/
|
||||||
struct Link_Proc * Node_Resolve_Links(struct Node * N, char * path)
|
struct Link_Proc * Node_Resolve_Links(struct HashtableNode * N, char * path)
|
||||||
{
|
{
|
||||||
if(!N || !path)
|
if(!N || !path)
|
||||||
{
|
{
|
||||||
|
@ -748,7 +748,7 @@ struct Link_Proc * Node_Resolve_Links(struct Node * N, char * path)
|
||||||
for(int i=0;i<expected_link_ammount; i++)
|
for(int i=0;i<expected_link_ammount; i++)
|
||||||
{
|
{
|
||||||
struct NodeLink * proclink;
|
struct NodeLink * proclink;
|
||||||
proclink = ipfs_node_get_link_by_name(N, linknames[i]);
|
proclink = ipfs_hashtable_node_get_link_by_name(N, linknames[i]);
|
||||||
if(proclink)
|
if(proclink)
|
||||||
{
|
{
|
||||||
LProc->links[i] = (struct NodeLink *)malloc(sizeof(struct NodeLink));
|
LProc->links[i] = (struct NodeLink *)malloc(sizeof(struct NodeLink));
|
||||||
|
|
|
@ -119,7 +119,7 @@ int ipfs_pin_has_child (struct FSRepo *ds,
|
||||||
unsigned char *hash, size_t hash_size,
|
unsigned char *hash, size_t hash_size,
|
||||||
unsigned char *child, size_t child_size)
|
unsigned char *child, size_t child_size)
|
||||||
{
|
{
|
||||||
struct Node *node;
|
struct HashtableNode *node;
|
||||||
struct NodeLink *node_link;
|
struct NodeLink *node_link;
|
||||||
|
|
||||||
if (ipfs_merkledag_get (hash, hash_size, &node, ds)) {
|
if (ipfs_merkledag_get (hash, hash_size, &node, ds)) {
|
||||||
|
|
|
@ -7,6 +7,7 @@
|
||||||
#include "libp2p/os/utils.h"
|
#include "libp2p/os/utils.h"
|
||||||
#include "ipfs/repo/config/bootstrap_peers.h"
|
#include "ipfs/repo/config/bootstrap_peers.h"
|
||||||
#include "ipfs/repo/config/swarm.h"
|
#include "ipfs/repo/config/swarm.h"
|
||||||
|
#include "libp2p/db/filestore.h"
|
||||||
|
|
||||||
/***
|
/***
|
||||||
* public
|
* public
|
||||||
|
@ -172,6 +173,8 @@ int ipfs_repo_config_new(struct RepoConfig** config) {
|
||||||
if (retVal == 0)
|
if (retVal == 0)
|
||||||
return 0;
|
return 0;
|
||||||
|
|
||||||
|
(*config)->filestore = libp2p_filestore_new();
|
||||||
|
|
||||||
retVal = repo_config_addresses_new(&((*config)->addresses));
|
retVal = repo_config_addresses_new(&((*config)->addresses));
|
||||||
if (retVal == 0)
|
if (retVal == 0)
|
||||||
return 0;
|
return 0;
|
||||||
|
@ -196,6 +199,8 @@ int ipfs_repo_config_free(struct RepoConfig* config) {
|
||||||
repo_config_bootstrap_peers_free(config->bootstrap_peers);
|
repo_config_bootstrap_peers_free(config->bootstrap_peers);
|
||||||
if (config->datastore != NULL)
|
if (config->datastore != NULL)
|
||||||
libp2p_datastore_free(config->datastore);
|
libp2p_datastore_free(config->datastore);
|
||||||
|
if (config->filestore != NULL)
|
||||||
|
libp2p_filestore_free(config->filestore);
|
||||||
if (config->addresses != NULL)
|
if (config->addresses != NULL)
|
||||||
repo_config_addresses_free(config->addresses);
|
repo_config_addresses_free(config->addresses);
|
||||||
if (config->gateway != NULL)
|
if (config->gateway != NULL)
|
||||||
|
|
|
@ -7,6 +7,7 @@
|
||||||
#include "ipfs/blocks/blockstore.h"
|
#include "ipfs/blocks/blockstore.h"
|
||||||
#include "ipfs/datastore/ds_helper.h"
|
#include "ipfs/datastore/ds_helper.h"
|
||||||
#include "libp2p/db/datastore.h"
|
#include "libp2p/db/datastore.h"
|
||||||
|
#include "libp2p/db/filestore.h"
|
||||||
#include "ipfs/repo/fsrepo/fs_repo.h"
|
#include "ipfs/repo/fsrepo/fs_repo.h"
|
||||||
#include "libp2p/os/utils.h"
|
#include "libp2p/os/utils.h"
|
||||||
#include "ipfs/repo/fsrepo/lmdb_datastore.h"
|
#include "ipfs/repo/fsrepo/lmdb_datastore.h"
|
||||||
|
@ -511,6 +512,28 @@ int fs_repo_open_datastore(struct FSRepo* repo) {
|
||||||
return retVal;
|
return retVal;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* For interface of Filestore. Retrieves a node from the filestore
|
||||||
|
* @param hash the hash to pull
|
||||||
|
* @param hash_length the length of the hash
|
||||||
|
* @param node_obj where to put the results
|
||||||
|
* @param filestore a reference to the filestore struct
|
||||||
|
* @returns true(1) on success, false(0) otherwise
|
||||||
|
*/
|
||||||
|
int ipfs_repo_fsrepo_node_get(const unsigned char* hash, size_t hash_length, void** node_obj, size_t *node_size, const struct Filestore* filestore) {
|
||||||
|
struct FSRepo* fs_repo = (struct FSRepo*)filestore->handle;
|
||||||
|
struct HashtableNode* node = NULL;
|
||||||
|
int retVal = ipfs_repo_fsrepo_node_read(hash, hash_length, &node, fs_repo);
|
||||||
|
if (retVal == 1) {
|
||||||
|
*node_size = ipfs_hashtable_node_protobuf_encode_size(node);
|
||||||
|
*node_obj = malloc(*node_size);
|
||||||
|
retVal = ipfs_hashtable_node_protobuf_encode(node, *node_obj, *node_size, node_size);
|
||||||
|
}
|
||||||
|
if (node != NULL)
|
||||||
|
ipfs_hashtable_node_free(node);
|
||||||
|
return retVal;
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* public methods
|
* public methods
|
||||||
*/
|
*/
|
||||||
|
@ -539,6 +562,10 @@ int ipfs_repo_fsrepo_open(struct FSRepo* repo) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// init the filestore
|
||||||
|
repo->config->filestore->handle = repo;
|
||||||
|
repo->config->filestore->node_get = ipfs_repo_fsrepo_node_get;
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -693,7 +720,7 @@ int ipfs_repo_fsrepo_unixfs_write(const struct UnixFS* unix_fs, const struct FSR
|
||||||
* @param bytes_written number of bytes written to the repo
|
* @param bytes_written number of bytes written to the repo
|
||||||
* @returns true(1) on success
|
* @returns true(1) on success
|
||||||
*/
|
*/
|
||||||
int ipfs_repo_fsrepo_node_write(const struct Node* node, const struct FSRepo* fs_repo, size_t* bytes_written) {
|
int ipfs_repo_fsrepo_node_write(const struct HashtableNode* node, const struct FSRepo* fs_repo, size_t* bytes_written) {
|
||||||
/**
|
/**
|
||||||
* What is put in the blockstore is the node.
|
* What is put in the blockstore is the node.
|
||||||
* What is put in the datastore is the multihash as the key,
|
* What is put in the datastore is the multihash as the key,
|
||||||
|
@ -715,7 +742,7 @@ int ipfs_repo_fsrepo_node_write(const struct Node* node, const struct FSRepo* fs
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_repo_fsrepo_node_read(const unsigned char* hash, size_t hash_length, struct Node** node, const struct FSRepo* fs_repo) {
|
int ipfs_repo_fsrepo_node_read(const unsigned char* hash, size_t hash_length, struct HashtableNode** node, const struct FSRepo* fs_repo) {
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
|
|
||||||
// get the base32 hash from the database
|
// get the base32 hash from the database
|
||||||
|
@ -731,6 +758,7 @@ int ipfs_repo_fsrepo_node_read(const unsigned char* hash, size_t hash_length, st
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
int ipfs_repo_fsrepo_block_read(const unsigned char* hash, size_t hash_length, struct Block** block, const struct FSRepo* fs_repo) {
|
int ipfs_repo_fsrepo_block_read(const unsigned char* hash, size_t hash_length, struct Block** block, const struct FSRepo* fs_repo) {
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
|
|
||||||
|
|
|
@ -18,7 +18,7 @@
|
||||||
* @param value_size the size of the value
|
* @param value_size the size of the value
|
||||||
* @returns 0 on success, otherwise -1
|
* @returns 0 on success, otherwise -1
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_kademlia_put_value(struct IpfsRouting* routing, char* key, size_t key_size, void* value, size_t value_size) {
|
int ipfs_routing_kademlia_put_value(struct IpfsRouting* routing, const unsigned char* key, size_t key_size, const void* value, size_t value_size) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -30,7 +30,7 @@ int ipfs_routing_kademlia_put_value(struct IpfsRouting* routing, char* key, size
|
||||||
* @param 4 a place to store the value
|
* @param 4 a place to store the value
|
||||||
* @param 5 the size of the value
|
* @param 5 the size of the value
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_kademlia_get_value(struct IpfsRouting* routing, char* key, size_t key_size, void** value, size_t* value_size) {
|
int ipfs_routing_kademlia_get_value(struct IpfsRouting* routing, const unsigned char* key, size_t key_size, void** value, size_t* value_size) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -46,7 +46,7 @@ int ipfs_routing_kademlia_get_value(struct IpfsRouting* routing, char* key, size
|
||||||
* @param results_size the size of the results buffer
|
* @param results_size the size of the results buffer
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_kademlia_find_providers(struct IpfsRouting* routing, unsigned char* key, size_t key_size, struct Libp2pVector** results) {
|
int ipfs_routing_kademlia_find_providers(struct IpfsRouting* routing, const unsigned char* key, size_t key_size, struct Libp2pVector** results) {
|
||||||
*results = libp2p_utils_vector_new(1);
|
*results = libp2p_utils_vector_new(1);
|
||||||
struct Libp2pVector* vector = *results;
|
struct Libp2pVector* vector = *results;
|
||||||
// see if I can provide it
|
// see if I can provide it
|
||||||
|
@ -92,7 +92,7 @@ int ipfs_routing_kademlia_find_providers(struct IpfsRouting* routing, unsigned c
|
||||||
/**
|
/**
|
||||||
* Find a peer
|
* Find a peer
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_kademlia_find_peer(struct IpfsRouting* routing, const char* param1, size_t param2, struct Libp2pPeer **result) {
|
int ipfs_routing_kademlia_find_peer(struct IpfsRouting* routing, const unsigned char* param1, size_t param2, struct Libp2pPeer **result) {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -103,7 +103,7 @@ int ipfs_routing_kademlia_find_peer(struct IpfsRouting* routing, const char* par
|
||||||
* @param key_size the size of the key
|
* @param key_size the size of the key
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_kademlia_provide(struct IpfsRouting* routing, char* key, size_t key_size) {
|
int ipfs_routing_kademlia_provide(struct IpfsRouting* routing, const unsigned char* key, size_t key_size) {
|
||||||
//TODO: Announce to the network that I can provide this file
|
//TODO: Announce to the network that I can provide this file
|
||||||
// save in a cache
|
// save in a cache
|
||||||
// store key and address in cache. Key is the hash, peer id is the value
|
// store key and address in cache. Key is the hash, peer id is the value
|
||||||
|
|
|
@ -8,13 +8,13 @@
|
||||||
#include "ipfs/routing/routing.h"
|
#include "ipfs/routing/routing.h"
|
||||||
#include "ipfs/importer/resolver.h"
|
#include "ipfs/importer/resolver.h"
|
||||||
|
|
||||||
int ipfs_routing_generic_put_value (ipfs_routing* offlineRouting, char *key, size_t key_size, void *val, size_t vlen)
|
int ipfs_routing_generic_put_value (ipfs_routing* offlineRouting, const unsigned char *key, size_t key_size, const void *val, size_t vlen)
|
||||||
{
|
{
|
||||||
int err;
|
int err;
|
||||||
char *record, *nkey;
|
char *record, *nkey;
|
||||||
size_t len, nkey_len;
|
size_t len, nkey_len;
|
||||||
|
|
||||||
err = libp2p_record_make_put_record (&record, &len, offlineRouting->sk, key, val, vlen, 0);
|
err = libp2p_record_make_put_record (&record, &len, offlineRouting->sk, (const char*)key, val, vlen, 0);
|
||||||
|
|
||||||
if (err) {
|
if (err) {
|
||||||
return err;
|
return err;
|
||||||
|
@ -26,7 +26,7 @@ int ipfs_routing_generic_put_value (ipfs_routing* offlineRouting, char *key, siz
|
||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!ipfs_datastore_helper_ds_key_from_binary((unsigned char*)key, key_size, (unsigned char*)nkey, key_size+1, &nkey_len)) {
|
if (!ipfs_datastore_helper_ds_key_from_binary(key, key_size, (unsigned char*)nkey, key_size+1, &nkey_len)) {
|
||||||
free (nkey);
|
free (nkey);
|
||||||
free (record);
|
free (record);
|
||||||
return -1;
|
return -1;
|
||||||
|
@ -37,34 +37,34 @@ int ipfs_routing_generic_put_value (ipfs_routing* offlineRouting, char *key, siz
|
||||||
return 0; // success.
|
return 0; // success.
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_routing_generic_get_value (ipfs_routing* routing, char *key, size_t key_size, void **val, size_t *vlen)
|
int ipfs_routing_generic_get_value (ipfs_routing* routing, const unsigned char *key, size_t key_size, void **val, size_t *vlen)
|
||||||
{
|
{
|
||||||
char key_str[key_size + 1];
|
char key_str[key_size + 1];
|
||||||
strncpy(key_str, key, key_size);
|
strncpy(key_str, (const char*)key, key_size);
|
||||||
key_str[key_size] = 0;
|
key_str[key_size] = 0;
|
||||||
struct Node* node = ipfs_resolver_get(key_str, NULL, routing->local_node);
|
struct HashtableNode* node = ipfs_resolver_get(key_str, NULL, routing->local_node);
|
||||||
if (node == NULL)
|
if (node == NULL)
|
||||||
return -1;
|
return -1;
|
||||||
// protobuf the node
|
// protobuf the node
|
||||||
int protobuf_size = ipfs_node_protobuf_encode_size(node);
|
int protobuf_size = ipfs_hashtable_node_protobuf_encode_size(node);
|
||||||
*val = malloc(protobuf_size);
|
*val = malloc(protobuf_size);
|
||||||
if (ipfs_node_protobuf_encode(node, *val, protobuf_size, vlen) == 0)
|
if (ipfs_hashtable_node_protobuf_encode(node, *val, protobuf_size, vlen) == 0)
|
||||||
return -1;
|
return -1;
|
||||||
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_routing_offline_find_providers (ipfs_routing* offlineRouting, unsigned char *key, size_t key_size, struct Libp2pVector** peers)
|
int ipfs_routing_offline_find_providers (ipfs_routing* offlineRouting, const unsigned char *key, size_t key_size, struct Libp2pVector** peers)
|
||||||
{
|
{
|
||||||
return ErrOffline;
|
return ErrOffline;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_routing_offline_find_peer (ipfs_routing* offlineRouting, const char *peer_id, size_t pid_size, struct Libp2pPeer **result)
|
int ipfs_routing_offline_find_peer (ipfs_routing* offlineRouting, const unsigned char *peer_id, size_t pid_size, struct Libp2pPeer **result)
|
||||||
{
|
{
|
||||||
return ErrOffline;
|
return ErrOffline;
|
||||||
}
|
}
|
||||||
|
|
||||||
int ipfs_routing_offline_provide (ipfs_routing* offlineRouting, char *cid, size_t cid_size)
|
int ipfs_routing_offline_provide (ipfs_routing* offlineRouting, const unsigned char *cid, size_t cid_size)
|
||||||
{
|
{
|
||||||
return ErrOffline;
|
return ErrOffline;
|
||||||
}
|
}
|
||||||
|
|
137
routing/online.c
137
routing/online.c
|
@ -61,7 +61,7 @@ struct Libp2pMessage* ipfs_routing_online_send_receive_message(struct Stream* st
|
||||||
* @param peers an array of Peer structs that can provide the hash
|
* @param peers an array of Peer structs that can provide the hash
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_online_find_remote_providers(struct IpfsRouting* routing, unsigned char* key, size_t key_size, struct Libp2pVector** peers) {
|
int ipfs_routing_online_find_remote_providers(struct IpfsRouting* routing, const unsigned char* key, size_t key_size, struct Libp2pVector** peers) {
|
||||||
int found = 0;
|
int found = 0;
|
||||||
// build the message to be transmitted
|
// build the message to be transmitted
|
||||||
struct Libp2pMessage* message = libp2p_message_new();
|
struct Libp2pMessage* message = libp2p_message_new();
|
||||||
|
@ -75,8 +75,10 @@ int ipfs_routing_online_find_remote_providers(struct IpfsRouting* routing, unsig
|
||||||
struct Libp2pPeer* peer = ((struct PeerEntry*)current_entry->item)->peer;
|
struct Libp2pPeer* peer = ((struct PeerEntry*)current_entry->item)->peer;
|
||||||
if (peer->connection_type == CONNECTION_TYPE_CONNECTED) {
|
if (peer->connection_type == CONNECTION_TYPE_CONNECTED) {
|
||||||
// Ask for hash, if it has it, break out of the loop and stop looking
|
// Ask for hash, if it has it, break out of the loop and stop looking
|
||||||
|
libp2p_logger_debug("online", "FindRemoteProviders: Asking for who can provide\n");
|
||||||
struct Libp2pMessage* return_message = ipfs_routing_online_send_receive_message(peer->connection, message);
|
struct Libp2pMessage* return_message = ipfs_routing_online_send_receive_message(peer->connection, message);
|
||||||
if (return_message != NULL && return_message->provider_peer_head != NULL) {
|
if (return_message != NULL && return_message->provider_peer_head != NULL) {
|
||||||
|
libp2p_logger_debug("online", "FindRemoteProviders: Return value is not null\n");
|
||||||
found = 1;
|
found = 1;
|
||||||
*peers = libp2p_utils_vector_new(1);
|
*peers = libp2p_utils_vector_new(1);
|
||||||
struct Libp2pLinkedList * current_provider_peer_list_item = return_message->provider_peer_head;
|
struct Libp2pLinkedList * current_provider_peer_list_item = return_message->provider_peer_head;
|
||||||
|
@ -87,7 +89,10 @@ int ipfs_routing_online_find_remote_providers(struct IpfsRouting* routing, unsig
|
||||||
}
|
}
|
||||||
libp2p_message_free(return_message);
|
libp2p_message_free(return_message);
|
||||||
break;
|
break;
|
||||||
|
} else {
|
||||||
|
libp2p_logger_debug("online", "FindRemoteProviders: Return value is null or providers are empty.\n");
|
||||||
}
|
}
|
||||||
|
libp2p_message_free(return_message);
|
||||||
// TODO: Make this multithreaded
|
// TODO: Make this multithreaded
|
||||||
}
|
}
|
||||||
if (found)
|
if (found)
|
||||||
|
@ -108,17 +113,19 @@ int ipfs_routing_online_find_remote_providers(struct IpfsRouting* routing, unsig
|
||||||
* @param multiaddresses the results
|
* @param multiaddresses the results
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_online_find_providers(struct IpfsRouting* routing, unsigned char* key, size_t key_size, struct Libp2pVector** peers) {
|
int ipfs_routing_online_find_providers(struct IpfsRouting* routing, const unsigned char* key, size_t key_size, struct Libp2pVector** peers) {
|
||||||
unsigned char* peer_id;
|
unsigned char* peer_id;
|
||||||
int peer_id_size;
|
int peer_id_size;
|
||||||
struct Libp2pPeer *peer;
|
struct Libp2pPeer *peer;
|
||||||
|
|
||||||
// see if we can find the key, and retrieve the peer who has it
|
// see if we can find the key, and retrieve the peer who has it
|
||||||
if (!libp2p_providerstore_get(routing->local_node->providerstore, key, key_size, &peer_id, &peer_id_size)) {
|
if (!libp2p_providerstore_get(routing->local_node->providerstore, key, key_size, &peer_id, &peer_id_size)) {
|
||||||
|
libp2p_logger_debug("online", "Unable to find provider locally... Asking network\n");
|
||||||
// we need to look remotely
|
// we need to look remotely
|
||||||
return ipfs_routing_online_find_remote_providers(routing, key, key_size, peers);
|
return ipfs_routing_online_find_remote_providers(routing, key, key_size, peers);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
libp2p_logger_debug("online", "FindProviders: Found provider locally. Searching for peer.\n");
|
||||||
// now translate the peer id into a peer to get the multiaddresses
|
// now translate the peer id into a peer to get the multiaddresses
|
||||||
peer = libp2p_peerstore_get_peer(routing->local_node->peerstore, peer_id, peer_id_size);
|
peer = libp2p_peerstore_get_peer(routing->local_node->peerstore, peer_id, peer_id_size);
|
||||||
if (peer == NULL)
|
if (peer == NULL)
|
||||||
|
@ -133,7 +140,7 @@ int ipfs_routing_online_find_providers(struct IpfsRouting* routing, unsigned cha
|
||||||
* helper method. Connect to a peer and ask it for information
|
* helper method. Connect to a peer and ask it for information
|
||||||
* about another peer
|
* about another peer
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_online_ask_peer_for_peer(struct Libp2pPeer* whoToAsk, const char* peer_id, size_t peer_id_size, struct Libp2pPeer **result) {
|
int ipfs_routing_online_ask_peer_for_peer(struct Libp2pPeer* whoToAsk, const unsigned char* peer_id, size_t peer_id_size, struct Libp2pPeer **result) {
|
||||||
if (whoToAsk->connection_type == CONNECTION_TYPE_CONNECTED) {
|
if (whoToAsk->connection_type == CONNECTION_TYPE_CONNECTED) {
|
||||||
struct Libp2pMessage *message = libp2p_message_new();
|
struct Libp2pMessage *message = libp2p_message_new();
|
||||||
if (message == NULL)
|
if (message == NULL)
|
||||||
|
@ -160,7 +167,7 @@ int ipfs_routing_online_ask_peer_for_peer(struct Libp2pPeer* whoToAsk, const cha
|
||||||
* @param peer the result of the search
|
* @param peer the result of the search
|
||||||
* @returns true(1) on success, otherwise false(0)
|
* @returns true(1) on success, otherwise false(0)
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_online_find_peer(struct IpfsRouting* routing, const char* peer_id, size_t peer_id_size, struct Libp2pPeer **result) {
|
int ipfs_routing_online_find_peer(struct IpfsRouting* routing, const unsigned char* peer_id, size_t peer_id_size, struct Libp2pPeer **result) {
|
||||||
// first look to see if we have it in the peerstore
|
// first look to see if we have it in the peerstore
|
||||||
struct Peerstore* peerstore = routing->local_node->peerstore;
|
struct Peerstore* peerstore = routing->local_node->peerstore;
|
||||||
*result = libp2p_peerstore_get_peer(peerstore, (unsigned char*)peer_id, peer_id_size);
|
*result = libp2p_peerstore_get_peer(peerstore, (unsigned char*)peer_id, peer_id_size);
|
||||||
|
@ -187,7 +194,7 @@ int ipfs_routing_online_find_peer(struct IpfsRouting* routing, const char* peer_
|
||||||
* @param key_size the length of the key
|
* @param key_size the length of the key
|
||||||
* @returns true(1) on success, otherwise false
|
* @returns true(1) on success, otherwise false
|
||||||
*/
|
*/
|
||||||
int ipfs_routing_online_provide(struct IpfsRouting* routing, char* key, size_t key_size) {
|
int ipfs_routing_online_provide(struct IpfsRouting* routing, const unsigned char* key, size_t key_size) {
|
||||||
struct Libp2pPeer* local_peer = libp2p_peer_new();
|
struct Libp2pPeer* local_peer = libp2p_peer_new();
|
||||||
local_peer->id_size = strlen(routing->local_node->identity->peer_id);
|
local_peer->id_size = strlen(routing->local_node->identity->peer_id);
|
||||||
local_peer->id = malloc(local_peer->id_size);
|
local_peer->id = malloc(local_peer->id_size);
|
||||||
|
@ -203,6 +210,7 @@ int ipfs_routing_online_provide(struct IpfsRouting* routing, char* key, size_t k
|
||||||
libp2p_logger_debug("online", "Adding local MultiAddress %s to peer.\n", ma->string);
|
libp2p_logger_debug("online", "Adding local MultiAddress %s to peer.\n", ma->string);
|
||||||
local_peer->addr_head->item = ma;
|
local_peer->addr_head->item = ma;
|
||||||
|
|
||||||
|
// create the message
|
||||||
struct Libp2pMessage* msg = libp2p_message_new();
|
struct Libp2pMessage* msg = libp2p_message_new();
|
||||||
msg->key_size = key_size;
|
msg->key_size = key_size;
|
||||||
msg->key = malloc(msg->key_size);
|
msg->key = malloc(msg->key_size);
|
||||||
|
@ -211,6 +219,7 @@ int ipfs_routing_online_provide(struct IpfsRouting* routing, char* key, size_t k
|
||||||
msg->provider_peer_head = libp2p_utils_linked_list_new();
|
msg->provider_peer_head = libp2p_utils_linked_list_new();
|
||||||
msg->provider_peer_head->item = local_peer;
|
msg->provider_peer_head->item = local_peer;
|
||||||
|
|
||||||
|
// loop through all peers in peerstre, and let them know (if we're still connected)
|
||||||
struct Libp2pLinkedList *current = routing->local_node->peerstore->head_entry;
|
struct Libp2pLinkedList *current = routing->local_node->peerstore->head_entry;
|
||||||
while (current != NULL) {
|
while (current != NULL) {
|
||||||
struct PeerEntry* current_peer_entry = (struct PeerEntry*)current->item;
|
struct PeerEntry* current_peer_entry = (struct PeerEntry*)current->item;
|
||||||
|
@ -263,6 +272,120 @@ int ipfs_routing_online_ping(struct IpfsRouting* routing, struct Libp2pPeer* pee
|
||||||
return retVal;
|
return retVal;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/***
|
||||||
|
* Ask a peer for a value
|
||||||
|
* @param routing the context
|
||||||
|
* @param peer the peer to ask
|
||||||
|
* @param key the key to ask for
|
||||||
|
* @param key_size the size of the key
|
||||||
|
* @param buffer where to put the results
|
||||||
|
* @param buffer_length the size of the buffer
|
||||||
|
* @returns true(1) on success
|
||||||
|
*/
|
||||||
|
int ipfs_routing_online_get_peer_value(ipfs_routing* routing, const struct Libp2pPeer* peer, const unsigned char* key, size_t key_size, void** buffer, size_t *buffer_size) {
|
||||||
|
// build message
|
||||||
|
struct Libp2pMessage* msg = libp2p_message_new();
|
||||||
|
msg->key_size = key_size;
|
||||||
|
msg->key = malloc(msg->key_size);
|
||||||
|
memcpy(msg->key, key, msg->key_size);
|
||||||
|
msg->message_type = MESSAGE_TYPE_GET_VALUE;
|
||||||
|
|
||||||
|
// send message and receive results
|
||||||
|
struct Libp2pMessage* ret_msg = ipfs_routing_online_send_receive_message(peer->connection, msg);
|
||||||
|
libp2p_message_free(msg);
|
||||||
|
|
||||||
|
if (ret_msg == NULL)
|
||||||
|
return 0;
|
||||||
|
if (ret_msg->record == NULL || ret_msg->record->value_size <= 0) {
|
||||||
|
libp2p_message_free(ret_msg);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
// put message results into buffer
|
||||||
|
*buffer_size = ret_msg->record->value_size;
|
||||||
|
*buffer = malloc(*buffer_size);
|
||||||
|
if (*buffer == NULL) {
|
||||||
|
*buffer_size = 0;
|
||||||
|
libp2p_message_free(ret_msg);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
memcpy(*buffer, ret_msg->record->value, *buffer_size);
|
||||||
|
libp2p_message_free(ret_msg);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Retrieve a value from the dht
|
||||||
|
* @param routing the context
|
||||||
|
* @param key the key
|
||||||
|
* @param key_size the size of the key
|
||||||
|
* @param buffer where to put the results
|
||||||
|
* @param buffer_size the length of the buffer
|
||||||
|
*/
|
||||||
|
int ipfs_routing_online_get_value (ipfs_routing* routing, const unsigned char *key, size_t key_size, void **buffer, size_t *buffer_size)
|
||||||
|
{
|
||||||
|
struct Libp2pVector *peers = NULL;
|
||||||
|
int retVal = 0;
|
||||||
|
|
||||||
|
// find a provider
|
||||||
|
routing->FindProviders(routing, key, key_size, &peers);
|
||||||
|
if (peers == NULL) {
|
||||||
|
libp2p_logger_debug("online", "online_get_value returned no providers\n");
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
|
||||||
|
libp2p_logger_debug("online", "FindProviders returned %d providers\n", peers->total);
|
||||||
|
|
||||||
|
for(int i = 0; i < peers->total; i++) {
|
||||||
|
struct Libp2pPeer* current_peer = libp2p_peerstore_get_or_add_peer(routing->local_node->peerstore, libp2p_utils_vector_get(peers, i));
|
||||||
|
if (libp2p_peer_matches_id(current_peer, (unsigned char*)routing->local_node->identity->peer_id)) {
|
||||||
|
// it's a local fetch. Retrieve it
|
||||||
|
if (!ipfs_routing_generic_get_value(routing, key, key_size, buffer, buffer_size))
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if (libp2p_peer_is_connected(current_peer)) {
|
||||||
|
// ask a connected peer for the file. If unsuccessful, continue in the loop.
|
||||||
|
if (ipfs_routing_online_get_peer_value(routing, current_peer, key, key_size, buffer, buffer_size)) {
|
||||||
|
retVal = 1;
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// we didn't get the file. Try to connect to the peers we're not connected to, and ask for the file
|
||||||
|
for(int i = 0; i < peers->total; i++) {
|
||||||
|
struct Libp2pPeer* current_peer = libp2p_utils_vector_get(peers, i);
|
||||||
|
if (libp2p_peer_matches_id(current_peer, (unsigned char*)routing->local_node->identity->peer_id)) {
|
||||||
|
// we tried this once, it didn't work. Skip it.
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if (!libp2p_peer_is_connected(current_peer)) {
|
||||||
|
// attempt to connect. If unsuccessful, continue in the loop.
|
||||||
|
libp2p_logger_debug("online", "Attempting to connect to peer to retrieve file\n");
|
||||||
|
if (libp2p_peer_connect(current_peer)) {
|
||||||
|
libp2p_logger_debug("online", "Peer connected\n");
|
||||||
|
if (ipfs_routing_online_get_peer_value(routing, current_peer, key, key_size, buffer, buffer_size)) {
|
||||||
|
libp2p_logger_debug("online", "Retrieved a value\n");
|
||||||
|
retVal = 1;
|
||||||
|
goto exit;
|
||||||
|
} else {
|
||||||
|
libp2p_logger_debug("online", "Did not retrieve a value\n");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
retVal = 0;
|
||||||
|
exit:
|
||||||
|
if (peers != NULL) {
|
||||||
|
for (int i = 0; i < peers->total; i++) {
|
||||||
|
struct Libp2pPeer* current = libp2p_utils_vector_get(peers, i);
|
||||||
|
libp2p_peer_free(current);
|
||||||
|
}
|
||||||
|
libp2p_utils_vector_free(peers);
|
||||||
|
}
|
||||||
|
return retVal;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Connects to swarm
|
* Connects to swarm
|
||||||
* @param routing the routing struct
|
* @param routing the routing struct
|
||||||
|
@ -331,7 +454,7 @@ ipfs_routing* ipfs_routing_new_online (struct IpfsNode* local_node, struct RsaPr
|
||||||
onlineRouting->stream = stream;
|
onlineRouting->stream = stream;
|
||||||
|
|
||||||
onlineRouting->PutValue = ipfs_routing_generic_put_value;
|
onlineRouting->PutValue = ipfs_routing_generic_put_value;
|
||||||
onlineRouting->GetValue = ipfs_routing_generic_get_value;
|
onlineRouting->GetValue = ipfs_routing_online_get_value;
|
||||||
onlineRouting->FindProviders = ipfs_routing_online_find_providers;
|
onlineRouting->FindProviders = ipfs_routing_online_find_providers;
|
||||||
onlineRouting->FindPeer = ipfs_routing_online_find_peer;
|
onlineRouting->FindPeer = ipfs_routing_online_find_peer;
|
||||||
onlineRouting->Provide = ipfs_routing_online_provide;
|
onlineRouting->Provide = ipfs_routing_online_provide;
|
||||||
|
@ -339,6 +462,8 @@ ipfs_routing* ipfs_routing_new_online (struct IpfsNode* local_node, struct RsaPr
|
||||||
onlineRouting->Bootstrap = ipfs_routing_online_bootstrap;
|
onlineRouting->Bootstrap = ipfs_routing_online_bootstrap;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
onlineRouting->local_node->mode = MODE_ONLINE;
|
||||||
|
|
||||||
return onlineRouting;
|
return onlineRouting;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -12,6 +12,7 @@ OBJS = testit.o test_helper.o \
|
||||||
../core/null.o \
|
../core/null.o \
|
||||||
../core/bootstrap.o \
|
../core/bootstrap.o \
|
||||||
../core/ping.o \
|
../core/ping.o \
|
||||||
|
../core/ipfs_node.o \
|
||||||
../datastore/ds_helper.o \
|
../datastore/ds_helper.o \
|
||||||
../flatfs/flatfs.o \
|
../flatfs/flatfs.o \
|
||||||
../importer/importer.o ../importer/exporter.o ../importer/resolver.o \
|
../importer/importer.o ../importer/exporter.o ../importer/resolver.o \
|
||||||
|
|
53
test/core/test_node.h
Normal file
53
test/core/test_node.h
Normal file
|
@ -0,0 +1,53 @@
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#include "../test_helper.h"
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
|
||||||
|
int test_node_peerstore() {
|
||||||
|
int retVal = 0;
|
||||||
|
const char *repo_path = "/tmp/test1";
|
||||||
|
char* peer_id = NULL;
|
||||||
|
struct IpfsNode *local_node = NULL;
|
||||||
|
struct Libp2pPeer* peer = NULL;
|
||||||
|
|
||||||
|
if (!drop_and_build_repository(repo_path, 4001, NULL, &peer_id))
|
||||||
|
goto exit;
|
||||||
|
|
||||||
|
if (!ipfs_node_online_new(repo_path, &local_node))
|
||||||
|
goto exit;
|
||||||
|
|
||||||
|
// add a peer to the peerstore
|
||||||
|
peer = libp2p_peer_new();
|
||||||
|
if (peer == NULL)
|
||||||
|
goto exit;
|
||||||
|
|
||||||
|
peer->id_size = strlen(peer_id);
|
||||||
|
peer->id = malloc(peer->id_size);
|
||||||
|
memcpy(peer->id, peer_id, peer->id_size);
|
||||||
|
|
||||||
|
if (!libp2p_peerstore_add_peer(local_node->peerstore, peer))
|
||||||
|
goto exit;
|
||||||
|
|
||||||
|
// add a second peer by changing the id a bit
|
||||||
|
char tmp = peer->id[3];
|
||||||
|
char tmp2 = peer->id[4];
|
||||||
|
char tmp3 = peer->id[5];
|
||||||
|
peer->id[3] = tmp2;
|
||||||
|
peer->id[4] = tmp3;
|
||||||
|
peer->id[5] = tmp;
|
||||||
|
|
||||||
|
if (!libp2p_peerstore_add_peer(local_node->peerstore, peer))
|
||||||
|
goto exit;
|
||||||
|
|
||||||
|
|
||||||
|
retVal = 1;
|
||||||
|
exit:
|
||||||
|
if (peer_id != NULL)
|
||||||
|
free(peer_id);
|
||||||
|
if (peer != NULL)
|
||||||
|
libp2p_peer_free(peer);
|
||||||
|
if (local_node != NULL)
|
||||||
|
ipfs_node_free(local_node);
|
||||||
|
|
||||||
|
return retVal;
|
||||||
|
}
|
|
@ -4,7 +4,7 @@ int test_null_add_provider() {
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
char* peer_id_1;
|
char* peer_id_1;
|
||||||
char* peer_id_2;
|
char* peer_id_2;
|
||||||
struct FSRepo *fs_repo_2 = NULL;
|
struct IpfsNode *local_node2 = NULL;
|
||||||
pthread_t thread1;
|
pthread_t thread1;
|
||||||
pthread_t thread2;
|
pthread_t thread2;
|
||||||
struct MultiAddress* ma_peer1;
|
struct MultiAddress* ma_peer1;
|
||||||
|
@ -29,11 +29,10 @@ int test_null_add_provider() {
|
||||||
// add a file, to prime the connection to peer 1
|
// add a file, to prime the connection to peer 1
|
||||||
//TODO: Find a better way to do this...
|
//TODO: Find a better way to do this...
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
ipfs_repo_fsrepo_new(ipfs_path, NULL, &fs_repo_2);
|
ipfs_node_online_new(ipfs_path, &local_node2);
|
||||||
ipfs_repo_fsrepo_open(fs_repo_2);
|
struct HashtableNode* node = NULL;
|
||||||
struct Node* node = NULL;
|
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, local_node2, &bytes_written, 0);
|
||||||
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, fs_repo_2, &bytes_written, 0);
|
ipfs_node_free(local_node2);
|
||||||
ipfs_repo_fsrepo_free(fs_repo_2);
|
|
||||||
// start the daemon in a separate thread
|
// start the daemon in a separate thread
|
||||||
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0)
|
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0)
|
||||||
goto exit;
|
goto exit;
|
||||||
|
@ -46,8 +45,8 @@ int test_null_add_provider() {
|
||||||
|
|
||||||
retVal = 1;
|
retVal = 1;
|
||||||
exit:
|
exit:
|
||||||
if (fs_repo_2 != NULL)
|
if (local_node2 != NULL)
|
||||||
ipfs_repo_fsrepo_free(fs_repo_2);
|
ipfs_node_free(local_node2);
|
||||||
if (ma_peer1 != NULL)
|
if (ma_peer1 != NULL)
|
||||||
multiaddress_free(ma_peer1);
|
multiaddress_free(ma_peer1);
|
||||||
pthread_cancel(thread1);
|
pthread_cancel(thread1);
|
||||||
|
|
|
@ -40,29 +40,29 @@ int test_merkledag_get_data() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// create a node
|
// create a node
|
||||||
struct Node* node1;
|
struct HashtableNode* node1;
|
||||||
retVal = ipfs_node_new_from_data(binary_data, binary_data_size, &node1);
|
retVal = ipfs_hashtable_node_new_from_data(binary_data, binary_data_size, &node1);
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// now retrieve it
|
// now retrieve it
|
||||||
struct Node* results_node;
|
struct HashtableNode* results_node;
|
||||||
retVal = ipfs_merkledag_get(node1->hash, node1->hash_size, &results_node, fs_repo);
|
retVal = ipfs_merkledag_get(node1->hash, node1->hash_size, &results_node, fs_repo);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(results_node);
|
ipfs_hashtable_node_free(results_node);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (results_node->data_size != 256) {
|
if (results_node->data_size != 256) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(results_node);
|
ipfs_hashtable_node_free(results_node);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -70,15 +70,15 @@ int test_merkledag_get_data() {
|
||||||
// the data should be the same
|
// the data should be the same
|
||||||
for(int i = 0; i < results_node->data_size; i++) {
|
for(int i = 0; i < results_node->data_size; i++) {
|
||||||
if (results_node->data[i] != node1->data[i]) {
|
if (results_node->data[i] != node1->data[i]) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(results_node);
|
ipfs_hashtable_node_free(results_node);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(results_node);
|
ipfs_hashtable_node_free(results_node);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
|
|
||||||
return retVal;
|
return retVal;
|
||||||
|
@ -102,13 +102,13 @@ int test_merkledag_add_data() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// create a node
|
// create a node
|
||||||
struct Node* node1;
|
struct HashtableNode* node1;
|
||||||
retVal = ipfs_node_new_from_data(binary_data, binary_data_size, &node1);
|
retVal = ipfs_hashtable_node_new_from_data(binary_data, binary_data_size, &node1);
|
||||||
|
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -118,31 +118,31 @@ int test_merkledag_add_data() {
|
||||||
|
|
||||||
int first_add_size = os_utils_file_size("/tmp/.ipfs/datastore/data.mdb");
|
int first_add_size = os_utils_file_size("/tmp/.ipfs/datastore/data.mdb");
|
||||||
if (first_add_size == start_file_size) { // uh oh, database should have increased in size
|
if (first_add_size == start_file_size) { // uh oh, database should have increased in size
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// adding the same binary again should do nothing (the hash should be the same)
|
// adding the same binary again should do nothing (the hash should be the same)
|
||||||
struct Node* node2;
|
struct HashtableNode* node2;
|
||||||
retVal = ipfs_node_new_from_data(binary_data, binary_data_size, &node2);
|
retVal = ipfs_hashtable_node_new_from_data(binary_data, binary_data_size, &node2);
|
||||||
retVal = ipfs_merkledag_add(node2, fs_repo, &bytes_written);
|
retVal = ipfs_merkledag_add(node2, fs_repo, &bytes_written);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// make sure everything is correct
|
// make sure everything is correct
|
||||||
if (node2->hash == NULL) {
|
if (node2->hash == NULL) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
for(int i = 0; i < node1->hash_size; i++) {
|
for(int i = 0; i < node1->hash_size; i++) {
|
||||||
if (node1->hash[i] != node2->hash[i]) {
|
if (node1->hash[i] != node2->hash[i]) {
|
||||||
printf("hash of node1 does not match node2 at position %d\n", i);
|
printf("hash of node1 does not match node2 at position %d\n", i);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -150,36 +150,36 @@ int test_merkledag_add_data() {
|
||||||
int second_add_size = os_utils_file_size("/tmp/.ipfs/datastore/data.mdb");
|
int second_add_size = os_utils_file_size("/tmp/.ipfs/datastore/data.mdb");
|
||||||
if (first_add_size != second_add_size) { // uh oh, the database shouldn't have changed size
|
if (first_add_size != second_add_size) { // uh oh, the database shouldn't have changed size
|
||||||
printf("looks as if a new record was added when it shouldn't have. Old file size: %d, new file size: %d\n", first_add_size, second_add_size);
|
printf("looks as if a new record was added when it shouldn't have. Old file size: %d, new file size: %d\n", first_add_size, second_add_size);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// now change 1 byte, which should change the hash
|
// now change 1 byte, which should change the hash
|
||||||
binary_data[10] = 0;
|
binary_data[10] = 0;
|
||||||
// create a node
|
// create a node
|
||||||
struct Node* node3;
|
struct HashtableNode* node3;
|
||||||
retVal = ipfs_node_new_from_data(binary_data, binary_data_size, &node3);
|
retVal = ipfs_hashtable_node_new_from_data(binary_data, binary_data_size, &node3);
|
||||||
|
|
||||||
retVal = ipfs_merkledag_add(node3, fs_repo, &bytes_written);
|
retVal = ipfs_merkledag_add(node3, fs_repo, &bytes_written);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
ipfs_node_free(node3);
|
ipfs_hashtable_node_free(node3);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// make sure everything is correct
|
// make sure everything is correct
|
||||||
if (node3->hash == NULL) {
|
if (node3->hash == NULL) {
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
ipfs_node_free(node3);
|
ipfs_hashtable_node_free(node3);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
ipfs_node_free(node3);
|
ipfs_hashtable_node_free(node3);
|
||||||
int third_add_size = os_utils_file_size("/tmp/.ipfs/datastore/data.mdb");
|
int third_add_size = os_utils_file_size("/tmp/.ipfs/datastore/data.mdb");
|
||||||
if (third_add_size == second_add_size || third_add_size < second_add_size) {// uh oh, it didn't add it
|
if (third_add_size == second_add_size || third_add_size < second_add_size) {// uh oh, it didn't add it
|
||||||
printf("Node 3 should have been added, but the file size did not change from %d.\n", third_add_size);
|
printf("Node 3 should have been added, but the file size did not change from %d.\n", third_add_size);
|
||||||
|
@ -193,7 +193,7 @@ int test_merkledag_add_data() {
|
||||||
|
|
||||||
int test_merkledag_add_node() {
|
int test_merkledag_add_node() {
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
struct Node* node1 = NULL;
|
struct HashtableNode* node1 = NULL;
|
||||||
|
|
||||||
struct FSRepo* fs_repo = createAndOpenRepo("/tmp/.ipfs");
|
struct FSRepo* fs_repo = createAndOpenRepo("/tmp/.ipfs");
|
||||||
if (fs_repo == NULL) {
|
if (fs_repo == NULL) {
|
||||||
|
@ -201,7 +201,7 @@ int test_merkledag_add_node() {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
retVal = ipfs_node_new(&node1);
|
retVal = ipfs_hashtable_node_new(&node1);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
printf("Unable to make node\n");
|
printf("Unable to make node\n");
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
|
@ -212,12 +212,12 @@ int test_merkledag_add_node() {
|
||||||
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
printf("Unable to add node\n");
|
printf("Unable to add node\n");
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
|
@ -229,8 +229,8 @@ int test_merkledag_add_node() {
|
||||||
int test_merkledag_add_node_with_links() {
|
int test_merkledag_add_node_with_links() {
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
struct NodeLink* link = NULL;
|
struct NodeLink* link = NULL;
|
||||||
struct Node* node1 = NULL;
|
struct HashtableNode* node1 = NULL;
|
||||||
struct Node* node2 = NULL;
|
struct HashtableNode* node2 = NULL;
|
||||||
|
|
||||||
struct FSRepo* fs_repo = createAndOpenRepo("/tmp/.ipfs");
|
struct FSRepo* fs_repo = createAndOpenRepo("/tmp/.ipfs");
|
||||||
if (fs_repo == NULL) {
|
if (fs_repo == NULL) {
|
||||||
|
@ -245,7 +245,7 @@ int test_merkledag_add_node_with_links() {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
retVal = ipfs_node_new_from_link(link, &node1);
|
retVal = ipfs_hashtable_node_new_from_link(link, &node1);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
printf("Unable to make node\n");
|
printf("Unable to make node\n");
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
|
@ -256,7 +256,7 @@ int test_merkledag_add_node_with_links() {
|
||||||
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
retVal = ipfs_merkledag_add(node1, fs_repo, &bytes_written);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
printf("Unable to add node\n");
|
printf("Unable to add node\n");
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -265,7 +265,7 @@ int test_merkledag_add_node_with_links() {
|
||||||
retVal = ipfs_merkledag_get(node1->hash, node1->hash_size, &node2, fs_repo);
|
retVal = ipfs_merkledag_get(node1->hash, node1->hash_size, &node2, fs_repo);
|
||||||
if (retVal == 0) {
|
if (retVal == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -275,8 +275,8 @@ int test_merkledag_add_node_with_links() {
|
||||||
if (node1_link->hash_size != node2_link->hash_size) {
|
if (node1_link->hash_size != node2_link->hash_size) {
|
||||||
printf("Hashes are not of the same length. Hash1: %lu, Hash2: %lu\n", node1_link->hash_size, node2_link->hash_size);
|
printf("Hashes are not of the same length. Hash1: %lu, Hash2: %lu\n", node1_link->hash_size, node2_link->hash_size);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
while(node1_link != NULL) {
|
while(node1_link != NULL) {
|
||||||
|
@ -284,8 +284,8 @@ int test_merkledag_add_node_with_links() {
|
||||||
if(node1_link->hash[i] != node2_link->hash[i]) {
|
if(node1_link->hash[i] != node2_link->hash[i]) {
|
||||||
printf("Hashes do not match for node %s\n", node1_link->name);
|
printf("Hashes do not match for node %s\n", node1_link->name);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -293,8 +293,8 @@ int test_merkledag_add_node_with_links() {
|
||||||
node2_link = node2_link->next;
|
node2_link = node2_link->next;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(node1);
|
ipfs_hashtable_node_free(node1);
|
||||||
ipfs_node_free(node2);
|
ipfs_hashtable_node_free(node2);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
|
|
|
@ -7,27 +7,30 @@
|
||||||
#include "mh/hashes.h"
|
#include "mh/hashes.h"
|
||||||
#include "mh/multihash.h"
|
#include "mh/multihash.h"
|
||||||
#include "libp2p/crypto/encoding/base58.h"
|
#include "libp2p/crypto/encoding/base58.h"
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
|
|
||||||
int test_import_large_file() {
|
int test_import_large_file() {
|
||||||
size_t bytes_size = 1000000; //1mb
|
size_t bytes_size = 1000000; //1mb
|
||||||
unsigned char file_bytes[bytes_size];
|
unsigned char file_bytes[bytes_size];
|
||||||
const char* fileName = "/tmp/test_import_large.tmp";
|
const char* fileName = "/tmp/test_import_large.tmp";
|
||||||
|
const char* repo_dir = "/tmp/.ipfs";
|
||||||
|
struct IpfsNode* local_node = NULL;
|
||||||
|
|
||||||
// create the necessary file
|
// create the necessary file
|
||||||
create_bytes(file_bytes, bytes_size);
|
create_bytes(file_bytes, bytes_size);
|
||||||
create_file(fileName, file_bytes, bytes_size);
|
create_file(fileName, file_bytes, bytes_size);
|
||||||
|
|
||||||
// get the repo
|
// get the repo
|
||||||
drop_and_build_repository("/tmp/.ipfs", 4001, NULL, NULL);
|
drop_and_build_repository(repo_dir, 4001, NULL, NULL);
|
||||||
struct FSRepo* fs_repo;
|
if (!ipfs_node_online_new(repo_dir, &local_node)) {
|
||||||
ipfs_repo_fsrepo_new("/tmp/.ipfs", NULL, &fs_repo);
|
return 0;
|
||||||
ipfs_repo_fsrepo_open(fs_repo);
|
}
|
||||||
|
|
||||||
// write to ipfs
|
// write to ipfs
|
||||||
struct Node* write_node;
|
struct HashtableNode* write_node;
|
||||||
size_t bytes_written;
|
size_t bytes_written;
|
||||||
if (ipfs_import_file("/tmp", fileName, &write_node, fs_repo, &bytes_written, 1) == 0) {
|
if (ipfs_import_file("/tmp", fileName, &write_node, local_node, &bytes_written, 1) == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -44,46 +47,46 @@ int test_import_large_file() {
|
||||||
for(int i = 0; i < 10; i++) {
|
for(int i = 0; i < 10; i++) {
|
||||||
if (write_node->hash[i] != cid_test[i]) {
|
if (write_node->hash[i] != cid_test[i]) {
|
||||||
printf("Hashes should be the same each time, and do not match at position %d, should be %02x but is %02x\n", i, cid_test[i], write_node->hash[i]);
|
printf("Hashes should be the same each time, and do not match at position %d, should be %02x but is %02x\n", i, cid_test[i], write_node->hash[i]);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// make sure all went okay
|
// make sure all went okay
|
||||||
struct Node* read_node;
|
struct HashtableNode* read_node;
|
||||||
if (ipfs_merkledag_get(write_node->hash, write_node->hash_size, &read_node, fs_repo) == 0) {
|
if (ipfs_merkledag_get(write_node->hash, write_node->hash_size, &read_node, local_node->repo) == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// the second block should be there
|
// the second block should be there
|
||||||
struct Node* read_node2;
|
struct HashtableNode* read_node2;
|
||||||
if (ipfs_merkledag_get(read_node->head_link->hash, read_node->head_link->hash_size, &read_node2, fs_repo) == 0) {
|
if (ipfs_merkledag_get(read_node->head_link->hash, read_node->head_link->hash_size, &read_node2, local_node->repo) == 0) {
|
||||||
printf("Unable to find the linked node.\n");
|
printf("Unable to find the linked node.\n");
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(read_node2);
|
ipfs_hashtable_node_free(read_node2);
|
||||||
|
|
||||||
// compare data
|
// compare data
|
||||||
if (write_node->data_size != read_node->data_size) {
|
if (write_node->data_size != read_node->data_size) {
|
||||||
printf("Data size of nodes are not equal. Should be %lu but are %lu\n", write_node->data_size, read_node->data_size);
|
printf("Data size of nodes are not equal. Should be %lu but are %lu\n", write_node->data_size, read_node->data_size);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
for(int i = 0; i < write_node->data_size; i++) {
|
for(int i = 0; i < write_node->data_size; i++) {
|
||||||
if (write_node->data[i] != read_node->data[i]) {
|
if (write_node->data[i] != read_node->data[i]) {
|
||||||
printf("Data within node is different at position %d. The value should be %02x, but was %02x.\n", i, write_node->data[i], read_node->data[i]);
|
printf("Data within node is different at position %d. The value should be %02x, but was %02x.\n", i, write_node->data[i], read_node->data[i]);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -93,18 +96,18 @@ int test_import_large_file() {
|
||||||
unsigned char base58[base58_size];
|
unsigned char base58[base58_size];
|
||||||
if ( ipfs_cid_hash_to_base58(read_node->hash, read_node->hash_size, base58, base58_size) == 0) {
|
if ( ipfs_cid_hash_to_base58(read_node->hash, read_node->hash_size, base58, base58_size) == 0) {
|
||||||
printf("Unable to convert cid to multihash\n");
|
printf("Unable to convert cid to multihash\n");
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// attempt to write file
|
// attempt to write file
|
||||||
if (ipfs_exporter_to_file(base58, "/tmp/test_import_large_file.rsl", fs_repo) == 0) {
|
if (ipfs_exporter_to_file(base58, "/tmp/test_import_large_file.rsl", local_node->repo) == 0) {
|
||||||
printf("Unable to write file.\n");
|
printf("Unable to write file.\n");
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -112,9 +115,9 @@ int test_import_large_file() {
|
||||||
size_t new_file_size = os_utils_file_size("/tmp/test_import_large_file.rsl");
|
size_t new_file_size = os_utils_file_size("/tmp/test_import_large_file.rsl");
|
||||||
if (new_file_size != bytes_size) {
|
if (new_file_size != bytes_size) {
|
||||||
printf("File sizes are different. Should be %lu but the new one is %lu\n", bytes_size, new_file_size);
|
printf("File sizes are different. Should be %lu but the new one is %lu\n", bytes_size, new_file_size);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -131,27 +134,27 @@ int test_import_large_file() {
|
||||||
bytes_read2 = fread(buf2, 1, 100, f2);
|
bytes_read2 = fread(buf2, 1, 100, f2);
|
||||||
if (bytes_read1 != bytes_read2) {
|
if (bytes_read1 != bytes_read2) {
|
||||||
printf("Error reading files for comparison. Read %lu bytes of file 1, but %lu bytes of file 2\n", bytes_read1, bytes_read2);
|
printf("Error reading files for comparison. Read %lu bytes of file 1, but %lu bytes of file 2\n", bytes_read1, bytes_read2);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
fclose(f1);
|
fclose(f1);
|
||||||
fclose(f2);
|
fclose(f2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
if (memcmp(buf1, buf2, bytes_read1) != 0) {
|
if (memcmp(buf1, buf2, bytes_read1) != 0) {
|
||||||
printf("The bytes between the files are different\n");
|
printf("The bytes between the files are different\n");
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
fclose(f1);
|
fclose(f1);
|
||||||
fclose(f2);
|
fclose(f2);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
|
|
||||||
|
@ -161,22 +164,22 @@ int test_import_small_file() {
|
||||||
size_t bytes_size = 1000;
|
size_t bytes_size = 1000;
|
||||||
unsigned char file_bytes[bytes_size];
|
unsigned char file_bytes[bytes_size];
|
||||||
const char* fileName = "/tmp/test_import_small.tmp";
|
const char* fileName = "/tmp/test_import_small.tmp";
|
||||||
|
const char* repo_path = "/tmp/.ipfs";
|
||||||
|
struct IpfsNode *local_node = NULL;
|
||||||
|
|
||||||
// create the necessary file
|
// create the necessary file
|
||||||
create_bytes(file_bytes, bytes_size);
|
create_bytes(file_bytes, bytes_size);
|
||||||
create_file(fileName, file_bytes, bytes_size);
|
create_file(fileName, file_bytes, bytes_size);
|
||||||
|
|
||||||
// get the repo
|
// get the repo
|
||||||
drop_and_build_repository("/tmp/.ipfs", 4001, NULL, NULL);
|
drop_and_build_repository(repo_path, 4001, NULL, NULL);
|
||||||
struct FSRepo* fs_repo;
|
ipfs_node_online_new(repo_path, &local_node);
|
||||||
ipfs_repo_fsrepo_new("/tmp/.ipfs", NULL, &fs_repo);
|
|
||||||
ipfs_repo_fsrepo_open(fs_repo);
|
|
||||||
|
|
||||||
// write to ipfs
|
// write to ipfs
|
||||||
struct Node* write_node;
|
struct HashtableNode* write_node;
|
||||||
size_t bytes_written;
|
size_t bytes_written;
|
||||||
if (ipfs_import_file("/tmp", fileName, &write_node, fs_repo, &bytes_written, 1) == 0) {
|
if (ipfs_import_file("/tmp", fileName, &write_node, local_node, &bytes_written, 1) == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -192,42 +195,42 @@ int test_import_small_file() {
|
||||||
for(int i = 0; i < 10; i++) {
|
for(int i = 0; i < 10; i++) {
|
||||||
if (write_node->hash[i] != cid_test[i]) {
|
if (write_node->hash[i] != cid_test[i]) {
|
||||||
printf("Hashes do not match at position %d, should be %02x but is %02x\n", i, cid_test[i], write_node->hash[i]);
|
printf("Hashes do not match at position %d, should be %02x but is %02x\n", i, cid_test[i], write_node->hash[i]);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// make sure all went okay
|
// make sure all went okay
|
||||||
struct Node* read_node;
|
struct HashtableNode* read_node;
|
||||||
if (ipfs_merkledag_get(write_node->hash, write_node->hash_size, &read_node, fs_repo) == 0) {
|
if (ipfs_merkledag_get(write_node->hash, write_node->hash_size, &read_node, local_node->repo) == 0) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
// compare data
|
// compare data
|
||||||
if (write_node->data_size != bytes_size + 8 || write_node->data_size != read_node->data_size) {
|
if (write_node->data_size != bytes_size + 8 || write_node->data_size != read_node->data_size) {
|
||||||
printf("Data size of nodes are not equal or are incorrect. Should be %lu but are %lu\n", write_node->data_size, read_node->data_size);
|
printf("Data size of nodes are not equal or are incorrect. Should be %lu but are %lu\n", write_node->data_size, read_node->data_size);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
for(int i = 0; i < bytes_size; i++) {
|
for(int i = 0; i < bytes_size; i++) {
|
||||||
if (write_node->data[i] != read_node->data[i]) {
|
if (write_node->data[i] != read_node->data[i]) {
|
||||||
printf("Data within node is different at position %d\n", i);
|
printf("Data within node is different at position %d\n", i);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_node_free(local_node);
|
||||||
ipfs_node_free(write_node);
|
ipfs_hashtable_node_free(write_node);
|
||||||
ipfs_node_free(read_node);
|
ipfs_hashtable_node_free(read_node);
|
||||||
|
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
|
@ -16,14 +16,14 @@ int test_node() {
|
||||||
retVal = ipfs_node_link_create(name2, ahash2, strlen((char*)ahash2), &mylink2);
|
retVal = ipfs_node_link_create(name2, ahash2, strlen((char*)ahash2), &mylink2);
|
||||||
|
|
||||||
//Nodes
|
//Nodes
|
||||||
struct Node * Mynode;
|
struct HashtableNode * Mynode;
|
||||||
retVal = ipfs_node_new_from_link(mylink, &Mynode);
|
retVal = ipfs_hashtable_node_new_from_link(mylink, &Mynode);
|
||||||
//mylink->name = "HAHA";//Testing for valid node creation
|
//mylink->name = "HAHA";//Testing for valid node creation
|
||||||
retVal = ipfs_node_add_link(Mynode, mylink2);
|
retVal = ipfs_hashtable_node_add_link(Mynode, mylink2);
|
||||||
//mylink2->name = "HAHA";//Testing for valid node creation
|
//mylink2->name = "HAHA";//Testing for valid node creation
|
||||||
//struct NodeLink * ResultLink = ipfs_node_get_link_by_name(Mynode, "Simo");
|
//struct NodeLink * ResultLink = ipfs_node_get_link_by_name(Mynode, "Simo");
|
||||||
ipfs_node_remove_link_by_name("Simo", Mynode);
|
ipfs_hashtable_node_remove_link_by_name("Simo", Mynode);
|
||||||
ipfs_node_free(Mynode);
|
ipfs_hashtable_node_free(Mynode);
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -86,8 +86,8 @@ l_exit:
|
||||||
* Test a node with 2 links
|
* Test a node with 2 links
|
||||||
*/
|
*/
|
||||||
int test_node_encode_decode() {
|
int test_node_encode_decode() {
|
||||||
struct Node* control = NULL;
|
struct HashtableNode* control = NULL;
|
||||||
struct Node* results = NULL;
|
struct HashtableNode* results = NULL;
|
||||||
struct NodeLink* link1 = NULL;
|
struct NodeLink* link1 = NULL;
|
||||||
struct NodeLink* link2 = NULL;
|
struct NodeLink* link2 = NULL;
|
||||||
int retVal = 0;
|
int retVal = 0;
|
||||||
|
@ -95,29 +95,29 @@ int test_node_encode_decode() {
|
||||||
unsigned char* buffer = NULL;
|
unsigned char* buffer = NULL;
|
||||||
|
|
||||||
// node
|
// node
|
||||||
if (ipfs_node_new(&control) == 0)
|
if (ipfs_hashtable_node_new(&control) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
|
|
||||||
// first link
|
// first link
|
||||||
if (ipfs_node_link_create((char*)"Link1", (unsigned char*)"QmLink1", 7, &link1) == 0)
|
if (ipfs_node_link_create((char*)"Link1", (unsigned char*)"QmLink1", 7, &link1) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
|
|
||||||
if ( ipfs_node_add_link(control, link1) == 0)
|
if ( ipfs_hashtable_node_add_link(control, link1) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
|
|
||||||
// second link
|
// second link
|
||||||
if (ipfs_node_link_create((char*)"Link2", (unsigned char*)"QmLink2", 7, &link2) == 0)
|
if (ipfs_node_link_create((char*)"Link2", (unsigned char*)"QmLink2", 7, &link2) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
if ( ipfs_node_add_link(control, link2) == 0)
|
if ( ipfs_hashtable_node_add_link(control, link2) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
// encode
|
// encode
|
||||||
buffer_length = ipfs_node_protobuf_encode_size(control);
|
buffer_length = ipfs_hashtable_node_protobuf_encode_size(control);
|
||||||
buffer = (unsigned char*)malloc(buffer_length);
|
buffer = (unsigned char*)malloc(buffer_length);
|
||||||
if (ipfs_node_protobuf_encode(control, buffer, buffer_length, &buffer_length) == 0)
|
if (ipfs_hashtable_node_protobuf_encode(control, buffer, buffer_length, &buffer_length) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
|
|
||||||
// decode
|
// decode
|
||||||
if (ipfs_node_protobuf_decode(buffer, buffer_length, &results) == 0)
|
if (ipfs_hashtable_node_protobuf_decode(buffer, buffer_length, &results) == 0)
|
||||||
goto ed_exit;
|
goto ed_exit;
|
||||||
|
|
||||||
// compare results
|
// compare results
|
||||||
|
@ -144,9 +144,9 @@ int test_node_encode_decode() {
|
||||||
ed_exit:
|
ed_exit:
|
||||||
// clean up
|
// clean up
|
||||||
if (control != NULL)
|
if (control != NULL)
|
||||||
ipfs_node_free(control);
|
ipfs_hashtable_node_free(control);
|
||||||
if (results != NULL)
|
if (results != NULL)
|
||||||
ipfs_node_free(results);
|
ipfs_hashtable_node_free(results);
|
||||||
if (buffer != NULL)
|
if (buffer != NULL)
|
||||||
free(buffer);
|
free(buffer);
|
||||||
|
|
||||||
|
|
|
@ -35,14 +35,14 @@ int test_resolver_get() {
|
||||||
ipfs_node.repo = fs_repo;
|
ipfs_node.repo = fs_repo;
|
||||||
|
|
||||||
// find something that is already in the repository
|
// find something that is already in the repository
|
||||||
struct Node* result = ipfs_resolver_get("QmbMecmXESf96ZNry7hRuzaRkEBhjqXpoYfPCwgFzVGDzB", NULL, &ipfs_node);
|
struct HashtableNode* result = ipfs_resolver_get("QmbMecmXESf96ZNry7hRuzaRkEBhjqXpoYfPCwgFzVGDzB", NULL, &ipfs_node);
|
||||||
if (result == NULL) {
|
if (result == NULL) {
|
||||||
free(test_dir);
|
free(test_dir);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(result);
|
ipfs_hashtable_node_free(result);
|
||||||
|
|
||||||
// find something where path includes the local node
|
// find something where path includes the local node
|
||||||
char path[255];
|
char path[255];
|
||||||
|
@ -55,7 +55,7 @@ int test_resolver_get() {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
ipfs_node_free(result);
|
ipfs_hashtable_node_free(result);
|
||||||
|
|
||||||
// find something by path
|
// find something by path
|
||||||
result = ipfs_resolver_get("QmZBvycPAYScBoPEzm35zXHt6gYYV5t9PyWmr4sksLPNFS/hello_world.txt", NULL, &ipfs_node);
|
result = ipfs_resolver_get("QmZBvycPAYScBoPEzm35zXHt6gYYV5t9PyWmr4sksLPNFS/hello_world.txt", NULL, &ipfs_node);
|
||||||
|
@ -65,7 +65,7 @@ int test_resolver_get() {
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(result);
|
ipfs_hashtable_node_free(result);
|
||||||
free(test_dir);
|
free(test_dir);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
|
|
||||||
|
@ -129,14 +129,14 @@ int test_resolver_remote_get() {
|
||||||
strcpy(path, "/ipfs/");
|
strcpy(path, "/ipfs/");
|
||||||
strcat(path, remote_peer_id);
|
strcat(path, remote_peer_id);
|
||||||
strcat(path, "/QmZBvycPAYScBoPEzm35zXHt6gYYV5t9PyWmr4sksLPNFS/hello_world.txt");
|
strcat(path, "/QmZBvycPAYScBoPEzm35zXHt6gYYV5t9PyWmr4sksLPNFS/hello_world.txt");
|
||||||
struct Node* result = ipfs_resolver_get(path, NULL, &local_node);
|
struct HashtableNode* result = ipfs_resolver_get(path, NULL, &local_node);
|
||||||
if (result == NULL) {
|
if (result == NULL) {
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
pthread_cancel(thread);
|
pthread_cancel(thread);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
ipfs_node_free(result);
|
ipfs_hashtable_node_free(result);
|
||||||
ipfs_repo_fsrepo_free(fs_repo);
|
ipfs_repo_fsrepo_free(fs_repo);
|
||||||
pthread_cancel(thread);
|
pthread_cancel(thread);
|
||||||
return 1;
|
return 1;
|
||||||
|
|
|
@ -6,7 +6,9 @@
|
||||||
#include "multiaddr/multiaddr.h"
|
#include "multiaddr/multiaddr.h"
|
||||||
|
|
||||||
#include "ipfs/core/daemon.h"
|
#include "ipfs/core/daemon.h"
|
||||||
|
#include "ipfs/core/ipfs_node.h"
|
||||||
#include "ipfs/routing/routing.h"
|
#include "ipfs/routing/routing.h"
|
||||||
|
#include "ipfs/importer/exporter.h"
|
||||||
|
|
||||||
#include "../test_helper.h"
|
#include "../test_helper.h"
|
||||||
|
|
||||||
|
@ -21,7 +23,7 @@ int test_routing_find_peer() {
|
||||||
os_utils_setenv("IPFS_PATH", ipfs_path, 1);
|
os_utils_setenv("IPFS_PATH", ipfs_path, 1);
|
||||||
char* peer_id_1;
|
char* peer_id_1;
|
||||||
char* peer_id_2;
|
char* peer_id_2;
|
||||||
struct FSRepo* fs_repo_2;
|
struct IpfsNode *local_node2;
|
||||||
char* peer_id_3;
|
char* peer_id_3;
|
||||||
pthread_t thread1;
|
pthread_t thread1;
|
||||||
pthread_t thread2;
|
pthread_t thread2;
|
||||||
|
@ -45,11 +47,10 @@ int test_routing_find_peer() {
|
||||||
// add a file, to prime the connection to peer 1
|
// add a file, to prime the connection to peer 1
|
||||||
//TODO: Find a better way to do this...
|
//TODO: Find a better way to do this...
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
ipfs_repo_fsrepo_new(ipfs_path, NULL, &fs_repo_2);
|
ipfs_node_online_new(ipfs_path, &local_node2);
|
||||||
ipfs_repo_fsrepo_open(fs_repo_2);
|
struct HashtableNode* node = NULL;
|
||||||
struct Node* node = NULL;
|
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, local_node2, &bytes_written, 0);
|
||||||
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, fs_repo_2, &bytes_written, 0);
|
ipfs_node_free(local_node2);
|
||||||
ipfs_repo_fsrepo_free(fs_repo_2);
|
|
||||||
// start the daemon in a separate thread
|
// start the daemon in a separate thread
|
||||||
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0)
|
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0)
|
||||||
return 0;
|
return 0;
|
||||||
|
@ -74,7 +75,7 @@ int test_routing_find_peer() {
|
||||||
local_node.routing->Bootstrap(local_node.routing);
|
local_node.routing->Bootstrap(local_node.routing);
|
||||||
|
|
||||||
struct Libp2pPeer* result;
|
struct Libp2pPeer* result;
|
||||||
if (!local_node.routing->FindPeer(local_node.routing, peer_id_2, strlen(peer_id_2), &result))
|
if (!local_node.routing->FindPeer(local_node.routing, (unsigned char*)peer_id_2, strlen(peer_id_2), &result))
|
||||||
return 0;
|
return 0;
|
||||||
|
|
||||||
if (result == NULL) {
|
if (result == NULL) {
|
||||||
|
@ -101,7 +102,7 @@ int test_routing_find_providers() {
|
||||||
os_utils_setenv("IPFS_PATH", ipfs_path, 1);
|
os_utils_setenv("IPFS_PATH", ipfs_path, 1);
|
||||||
char* peer_id_1 = NULL;
|
char* peer_id_1 = NULL;
|
||||||
char* peer_id_2 = NULL;
|
char* peer_id_2 = NULL;
|
||||||
struct FSRepo* fs_repo_2 = NULL;;
|
struct IpfsNode *local_node2 = NULL;;
|
||||||
char* peer_id_3 = NULL;
|
char* peer_id_3 = NULL;
|
||||||
char* remote_peer_id = NULL;
|
char* remote_peer_id = NULL;
|
||||||
pthread_t thread1, thread2;
|
pthread_t thread1, thread2;
|
||||||
|
@ -134,11 +135,10 @@ int test_routing_find_providers() {
|
||||||
// add a file, to prime the connection to peer 1
|
// add a file, to prime the connection to peer 1
|
||||||
//TODO: Find a better way to do this...
|
//TODO: Find a better way to do this...
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
ipfs_repo_fsrepo_new(ipfs_path, NULL, &fs_repo_2);
|
ipfs_node_online_new(ipfs_path, &local_node2);
|
||||||
ipfs_repo_fsrepo_open(fs_repo_2);
|
struct HashtableNode* node = NULL;
|
||||||
struct Node* node = NULL;
|
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, local_node2, &bytes_written, 0);
|
||||||
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, fs_repo_2, &bytes_written, 0);
|
ipfs_node_free(local_node2);
|
||||||
ipfs_repo_fsrepo_free(fs_repo_2);
|
|
||||||
// start the daemon in a separate thread
|
// start the daemon in a separate thread
|
||||||
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0) {
|
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0) {
|
||||||
fprintf(stderr, "Unable to start thread 2\n");
|
fprintf(stderr, "Unable to start thread 2\n");
|
||||||
|
@ -234,7 +234,7 @@ int test_routing_find_providers() {
|
||||||
ipfs_routing_online_free(local_node.routing);
|
ipfs_routing_online_free(local_node.routing);
|
||||||
}
|
}
|
||||||
if (node != NULL)
|
if (node != NULL)
|
||||||
ipfs_node_free(node);
|
ipfs_hashtable_node_free(node);
|
||||||
if (result != NULL) {
|
if (result != NULL) {
|
||||||
// we have a vector of peers. Clean 'em up:
|
// we have a vector of peers. Clean 'em up:
|
||||||
for(int i = 0; i < result->total; i++) {
|
for(int i = 0; i < result->total; i++) {
|
||||||
|
@ -258,7 +258,7 @@ int test_routing_provide() {
|
||||||
os_utils_setenv("IPFS_PATH", ipfs_path, 1);
|
os_utils_setenv("IPFS_PATH", ipfs_path, 1);
|
||||||
char* peer_id_1 = NULL;
|
char* peer_id_1 = NULL;
|
||||||
char* peer_id_2 = NULL;
|
char* peer_id_2 = NULL;
|
||||||
struct FSRepo* fs_repo_2 = NULL;
|
struct IpfsNode *local_node2 = NULL;
|
||||||
pthread_t thread1, thread2;
|
pthread_t thread1, thread2;
|
||||||
int thread1_started = 0, thread2_started = 0;
|
int thread1_started = 0, thread2_started = 0;
|
||||||
struct MultiAddress* ma_peer1 = NULL;
|
struct MultiAddress* ma_peer1 = NULL;
|
||||||
|
@ -287,11 +287,10 @@ int test_routing_provide() {
|
||||||
// add a file, to prime the connection to peer 1
|
// add a file, to prime the connection to peer 1
|
||||||
//TODO: Find a better way to do this...
|
//TODO: Find a better way to do this...
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
ipfs_repo_fsrepo_new(ipfs_path, NULL, &fs_repo_2);
|
ipfs_node_online_new(ipfs_path, &local_node2);
|
||||||
ipfs_repo_fsrepo_open(fs_repo_2);
|
struct HashtableNode* node = NULL;
|
||||||
struct Node* node = NULL;
|
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, local_node2, &bytes_written, 0);
|
||||||
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, fs_repo_2, &bytes_written, 0);
|
ipfs_node_free(local_node2);
|
||||||
ipfs_repo_fsrepo_free(fs_repo_2);
|
|
||||||
// start the daemon in a separate thread
|
// start the daemon in a separate thread
|
||||||
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0) {
|
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0) {
|
||||||
fprintf(stderr, "Unable to start thread 2\n");
|
fprintf(stderr, "Unable to start thread 2\n");
|
||||||
|
@ -318,7 +317,135 @@ int test_routing_provide() {
|
||||||
libp2p_utils_vector_free(ma_vector2);
|
libp2p_utils_vector_free(ma_vector2);
|
||||||
}
|
}
|
||||||
if (node != NULL)
|
if (node != NULL)
|
||||||
ipfs_node_free(node);
|
ipfs_hashtable_node_free(node);
|
||||||
|
libp2p_logger_free();
|
||||||
|
return retVal;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
/***
|
||||||
|
* Attempt to retrieve a file from a previously unknown node
|
||||||
|
*/
|
||||||
|
int test_routing_retrieve_file_third_party() {
|
||||||
|
int retVal = 0;
|
||||||
|
|
||||||
|
/*
|
||||||
|
libp2p_logger_add_class("online");
|
||||||
|
libp2p_logger_add_class("multistream");
|
||||||
|
libp2p_logger_add_class("null");
|
||||||
|
libp2p_logger_add_class("dht_protocol");
|
||||||
|
libp2p_logger_add_class("providerstore");
|
||||||
|
libp2p_logger_add_class("peerstore");
|
||||||
|
libp2p_logger_add_class("exporter");
|
||||||
|
libp2p_logger_add_class("peer");
|
||||||
|
libp2p_logger_add_class("test_routing");
|
||||||
|
*/
|
||||||
|
|
||||||
|
// clean out repository
|
||||||
|
char* ipfs_path = "/tmp/test1";
|
||||||
|
char* peer_id_1 = NULL, *peer_id_2 = NULL, *peer_id_3 = NULL;
|
||||||
|
struct IpfsNode* ipfs_node2 = NULL, *ipfs_node3 = NULL;
|
||||||
|
pthread_t thread1, thread2;
|
||||||
|
int thread1_started = 0, thread2_started = 0;
|
||||||
|
struct MultiAddress* ma_peer1 = NULL;
|
||||||
|
struct Libp2pVector* ma_vector2 = NULL, *ma_vector3 = NULL;
|
||||||
|
struct HashtableNode* node = NULL, *result_node = NULL;
|
||||||
|
|
||||||
|
// create peer 1
|
||||||
|
drop_and_build_repository(ipfs_path, 4001, NULL, &peer_id_1);
|
||||||
|
char multiaddress_string[255];
|
||||||
|
sprintf(multiaddress_string, "/ip4/127.0.0.1/tcp/4001/ipfs/%s", peer_id_1);
|
||||||
|
ma_peer1 = multiaddress_new_from_string(multiaddress_string);
|
||||||
|
// start the daemon in a separate thread
|
||||||
|
libp2p_logger_debug("test_routing", "Firing up daemon 1.\n");
|
||||||
|
if (pthread_create(&thread1, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0) {
|
||||||
|
fprintf(stderr, "Unable to start thread 1\n");
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
thread1_started = 1;
|
||||||
|
|
||||||
|
// wait for everything to start up
|
||||||
|
// JMJ debugging =
|
||||||
|
sleep(3);
|
||||||
|
|
||||||
|
// create peer 2
|
||||||
|
ipfs_path = "/tmp/test2";
|
||||||
|
// create a vector to hold peer1's multiaddress so we can connect as a peer
|
||||||
|
ma_vector2 = libp2p_utils_vector_new(1);
|
||||||
|
libp2p_utils_vector_add(ma_vector2, ma_peer1);
|
||||||
|
// note: this distroys some things, as it frees the fs_repo_3:
|
||||||
|
drop_and_build_repository(ipfs_path, 4002, ma_vector2, &peer_id_2);
|
||||||
|
// add a file, to prime the connection to peer 1
|
||||||
|
//TODO: Find a better way to do this...
|
||||||
|
size_t bytes_written = 0;
|
||||||
|
if (!ipfs_node_online_new(ipfs_path, &ipfs_node2))
|
||||||
|
goto exit;
|
||||||
|
ipfs_node2->routing->Bootstrap(ipfs_node2->routing);
|
||||||
|
ipfs_import_file(NULL, "/home/parallels/ipfstest/hello_world.txt", &node, ipfs_node2, &bytes_written, 0);
|
||||||
|
ipfs_node_free(ipfs_node2);
|
||||||
|
// start the daemon in a separate thread
|
||||||
|
libp2p_logger_debug("test_routing", "Firing up daemon 2.\n");
|
||||||
|
if (pthread_create(&thread2, NULL, test_routing_daemon_start, (void*)ipfs_path) < 0) {
|
||||||
|
fprintf(stderr, "Unable to start thread 2\n");
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
thread2_started = 1;
|
||||||
|
|
||||||
|
// wait for everything to start up
|
||||||
|
// JMJ debugging =
|
||||||
|
sleep(3);
|
||||||
|
|
||||||
|
libp2p_logger_debug("test_routing", "Firing up the 3rd client\n");
|
||||||
|
// create my peer, peer 3
|
||||||
|
ipfs_path = "/tmp/test3";
|
||||||
|
ma_peer1 = multiaddress_new_from_string(multiaddress_string);
|
||||||
|
ma_vector3 = libp2p_utils_vector_new(1);
|
||||||
|
libp2p_utils_vector_add(ma_vector3, ma_peer1);
|
||||||
|
drop_and_build_repository(ipfs_path, 4003, ma_vector3, &peer_id_3);
|
||||||
|
ipfs_node_online_new(ipfs_path, &ipfs_node3);
|
||||||
|
|
||||||
|
ipfs_node3->routing->Bootstrap(ipfs_node3->routing);
|
||||||
|
|
||||||
|
if (!ipfs_exporter_get_node(ipfs_node3, node->hash, node->hash_size, &result_node)) {
|
||||||
|
fprintf(stderr, "Get_Node returned false\n");
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (node->hash_size != result_node->hash_size) {
|
||||||
|
fprintf(stderr, "Node hash sizes do not match. Should be %lu but is %lu\n", node->hash_size, result_node->hash_size);
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (node->data_size != result_node->data_size) {
|
||||||
|
fprintf(stderr, "Result sizes do not match. Should be %lu but is %lu\n", node->data_size, result_node->data_size);
|
||||||
|
goto exit;
|
||||||
|
}
|
||||||
|
|
||||||
|
retVal = 1;
|
||||||
|
exit:
|
||||||
|
ipfs_daemon_stop();
|
||||||
|
if (thread1_started)
|
||||||
|
pthread_join(thread1, NULL);
|
||||||
|
if (thread2_started)
|
||||||
|
pthread_join(thread2, NULL);
|
||||||
|
if (ipfs_node3 != NULL)
|
||||||
|
ipfs_node_free(ipfs_node3);
|
||||||
|
if (peer_id_1 != NULL)
|
||||||
|
free(peer_id_1);
|
||||||
|
if (peer_id_2 != NULL)
|
||||||
|
free(peer_id_2);
|
||||||
|
if (peer_id_3 != NULL)
|
||||||
|
free(peer_id_3);
|
||||||
|
if (ma_vector2 != NULL) {
|
||||||
|
libp2p_utils_vector_free(ma_vector2);
|
||||||
|
}
|
||||||
|
if (ma_vector3 != NULL) {
|
||||||
|
libp2p_utils_vector_free(ma_vector3);
|
||||||
|
}
|
||||||
|
if (node != NULL)
|
||||||
|
ipfs_hashtable_node_free(node);
|
||||||
|
if (result_node != NULL)
|
||||||
|
ipfs_hashtable_node_free(result_node);
|
||||||
libp2p_logger_free();
|
libp2p_logger_free();
|
||||||
return retVal;
|
return retVal;
|
||||||
|
|
||||||
|
|
|
@ -64,7 +64,7 @@ int test_routing_supernode_get_remote_value() {
|
||||||
struct SessionContext context;
|
struct SessionContext context;
|
||||||
unsigned char* results = NULL;
|
unsigned char* results = NULL;
|
||||||
size_t results_size = 0;
|
size_t results_size = 0;
|
||||||
struct Node* node;
|
struct HashtableNode* node;
|
||||||
|
|
||||||
// unencode the base58
|
// unencode the base58
|
||||||
if (!libp2p_crypto_encoding_base58_decode(orig_multihash, strlen((char*)orig_multihash), &hash_ptr, &hash_size))
|
if (!libp2p_crypto_encoding_base58_decode(orig_multihash, strlen((char*)orig_multihash), &hash_ptr, &hash_size))
|
||||||
|
@ -130,7 +130,7 @@ int test_routing_supernode_get_remote_value() {
|
||||||
if (!libp2p_nodeio_get(&context, hash, hash_size, &results, &results_size))
|
if (!libp2p_nodeio_get(&context, hash, hash_size, &results, &results_size))
|
||||||
goto exit;
|
goto exit;
|
||||||
|
|
||||||
if (!ipfs_node_protobuf_decode(results, results_size, &node))
|
if (!ipfs_hashtable_node_protobuf_decode(results, results_size, &node))
|
||||||
goto exit;
|
goto exit;
|
||||||
|
|
||||||
//we got it
|
//we got it
|
||||||
|
@ -155,12 +155,12 @@ int test_routing_supernode_get_value() {
|
||||||
int file_size = 1000;
|
int file_size = 1000;
|
||||||
unsigned char bytes[file_size];
|
unsigned char bytes[file_size];
|
||||||
char* fullFileName = "/tmp/temp_file.bin";
|
char* fullFileName = "/tmp/temp_file.bin";
|
||||||
struct Node* write_node = NULL;
|
struct HashtableNode* write_node = NULL;
|
||||||
size_t bytes_written = 0;
|
size_t bytes_written = 0;
|
||||||
struct Libp2pVector* multiaddresses;
|
struct Libp2pVector* multiaddresses;
|
||||||
unsigned char* results;
|
unsigned char* results;
|
||||||
size_t results_size = 0;
|
size_t results_size = 0;
|
||||||
struct Node* node = NULL;
|
struct HashtableNode* node = NULL;
|
||||||
char* ip = NULL;
|
char* ip = NULL;
|
||||||
|
|
||||||
if (!drop_build_and_open_repo("/tmp/.ipfs", &fs_repo))
|
if (!drop_build_and_open_repo("/tmp/.ipfs", &fs_repo))
|
||||||
|
@ -194,13 +194,15 @@ int test_routing_supernode_get_value() {
|
||||||
create_file(fullFileName, bytes, file_size);
|
create_file(fullFileName, bytes, file_size);
|
||||||
|
|
||||||
// write to ipfs
|
// write to ipfs
|
||||||
if (ipfs_import_file("/tmp", fullFileName, &write_node, fs_repo, &bytes_written, 1) == 0) {
|
if (ipfs_import_file("/tmp", fullFileName, &write_node, ipfs_node, &bytes_written, 1) == 0) {
|
||||||
goto exit;
|
goto exit;
|
||||||
}
|
}
|
||||||
|
|
||||||
// announce to network that this can be provided
|
// announce to network that this can be provided
|
||||||
if (!ipfs_node->routing->Provide(ipfs_node->routing, (char*)write_node->hash, write_node->hash_size))
|
/*
|
||||||
|
if (!ipfs_node->routing->Provide(ipfs_node->routing, (unsigned char*)write_node->hash, write_node->hash_size))
|
||||||
goto exit;
|
goto exit;
|
||||||
|
*/
|
||||||
|
|
||||||
// ask the network who can provide this
|
// ask the network who can provide this
|
||||||
if (!ipfs_node->routing->FindProviders(ipfs_node->routing, write_node->hash, write_node->hash_size, &multiaddresses))
|
if (!ipfs_node->routing->FindProviders(ipfs_node->routing, write_node->hash, write_node->hash_size, &multiaddresses))
|
||||||
|
@ -236,7 +238,7 @@ int test_routing_supernode_get_value() {
|
||||||
if (!libp2p_nodeio_get(&context, write_node->hash, write_node->hash_size, &results, &results_size))
|
if (!libp2p_nodeio_get(&context, write_node->hash, write_node->hash_size, &results, &results_size))
|
||||||
goto exit;
|
goto exit;
|
||||||
|
|
||||||
if (!ipfs_node_protobuf_decode(results, results_size, &node))
|
if (!ipfs_hashtable_node_protobuf_decode(results, results_size, &node))
|
||||||
goto exit;
|
goto exit;
|
||||||
|
|
||||||
//we got it
|
//we got it
|
||||||
|
|
|
@ -18,6 +18,7 @@
|
||||||
#include "core/test_ping.h"
|
#include "core/test_ping.h"
|
||||||
#include "core/test_null.h"
|
#include "core/test_null.h"
|
||||||
#include "core/test_daemon.h"
|
#include "core/test_daemon.h"
|
||||||
|
#include "core/test_node.h"
|
||||||
|
|
||||||
int testit(const char* name, int (*func)(void)) {
|
int testit(const char* name, int (*func)(void)) {
|
||||||
printf("Testing %s...\n", name);
|
printf("Testing %s...\n", name);
|
||||||
|
@ -57,6 +58,7 @@ const char* names[] = {
|
||||||
"test_node",
|
"test_node",
|
||||||
"test_node_link_encode_decode",
|
"test_node_link_encode_decode",
|
||||||
"test_node_encode_decode",
|
"test_node_encode_decode",
|
||||||
|
"test_node_peerstore",
|
||||||
"test_merkledag_add_data",
|
"test_merkledag_add_data",
|
||||||
"test_merkledag_get_data",
|
"test_merkledag_get_data",
|
||||||
"test_merkledag_add_node",
|
"test_merkledag_add_node",
|
||||||
|
@ -67,6 +69,7 @@ const char* names[] = {
|
||||||
"test_routing_provide",
|
"test_routing_provide",
|
||||||
"test_routing_supernode_get_value",
|
"test_routing_supernode_get_value",
|
||||||
"test_routing_supernode_get_remote_value",
|
"test_routing_supernode_get_remote_value",
|
||||||
|
"test_routing_retrieve_file_third_party",
|
||||||
"test_unixfs_encode_decode",
|
"test_unixfs_encode_decode",
|
||||||
"test_unixfs_encode_smallfile",
|
"test_unixfs_encode_smallfile",
|
||||||
"test_ping",
|
"test_ping",
|
||||||
|
@ -103,6 +106,7 @@ int (*funcs[])(void) = {
|
||||||
test_node,
|
test_node,
|
||||||
test_node_link_encode_decode,
|
test_node_link_encode_decode,
|
||||||
test_node_encode_decode,
|
test_node_encode_decode,
|
||||||
|
test_node_peerstore,
|
||||||
test_merkledag_add_data,
|
test_merkledag_add_data,
|
||||||
test_merkledag_get_data,
|
test_merkledag_get_data,
|
||||||
test_merkledag_add_node,
|
test_merkledag_add_node,
|
||||||
|
@ -113,6 +117,7 @@ int (*funcs[])(void) = {
|
||||||
test_routing_provide,
|
test_routing_provide,
|
||||||
test_routing_supernode_get_value,
|
test_routing_supernode_get_value,
|
||||||
test_routing_supernode_get_remote_value,
|
test_routing_supernode_get_remote_value,
|
||||||
|
test_routing_retrieve_file_third_party,
|
||||||
test_unixfs_encode_decode,
|
test_unixfs_encode_decode,
|
||||||
test_unixfs_encode_smallfile,
|
test_unixfs_encode_smallfile,
|
||||||
test_ping,
|
test_ping,
|
||||||
|
|
Loading…
Reference in a new issue