4626b69381
Pushing through on the ipfs block put use case. Building out the necessary code to write to the blockstore.
59 lines
1.3 KiB
C
59 lines
1.3 KiB
C
/**
|
|
* The implementation of methods around IPFS blocks
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "libp2p/crypto/sha256.h"
|
|
#include "ipfs/blocks/block.h"
|
|
#include "ipfs/cid/cid.h"
|
|
|
|
/***
|
|
* Create a new block based on the incoming data
|
|
* @param data the data to base the block on
|
|
* @param data_size the length of the data array
|
|
* @param block a pointer to the struct Block that will be created
|
|
* @returns true(1) on success
|
|
*/
|
|
int ipfs_blocks_block_new(unsigned char* data, size_t data_size, struct Block** block) {
|
|
|
|
// allocate memory for structure
|
|
(*block) = (struct Block*)malloc(sizeof(struct Block));
|
|
if ((*block) == NULL)
|
|
return 0;
|
|
|
|
// cid
|
|
char hash[32];
|
|
if (libp2p_crypto_hashing_sha256(data, hash, 32) == 0) {
|
|
free(*block);
|
|
return 0;
|
|
}
|
|
|
|
if (ipfs_cid_new(0, hash, 32, CID_PROTOBUF, (*block)->cid) == 0) {
|
|
free(*block);
|
|
return 0;
|
|
}
|
|
|
|
block->data = malloc(sizeof(unsigned char) * data_size);
|
|
if (block->data == NULL) {
|
|
ipfs_ci_free((*block)->cid);
|
|
free(*block);
|
|
return 0;
|
|
}
|
|
|
|
memcpy(block->data, data, data_size);
|
|
return 1;
|
|
}
|
|
|
|
/***
|
|
* Free resources used by the creation of a block
|
|
* @param block the block to free
|
|
* @returns true(1) on success
|
|
*/
|
|
int ipfs_blocks_block_free(struct Block* block) {
|
|
ipfs_cid_free(block->cid);
|
|
if (block->data != NULL)
|
|
free(block->data);
|
|
free(block);
|
|
return 1;
|
|
}
|