2019-03-05 22:05:34 +01:00
|
|
|
// Copyright (c) 2016-2019, The Monero Project
|
2017-09-05 18:20:27 +02:00
|
|
|
//
|
|
|
|
// All rights reserved.
|
|
|
|
//
|
|
|
|
// Redistribution and use in source and binary forms, with or without modification, are
|
|
|
|
// permitted provided that the following conditions are met:
|
|
|
|
//
|
|
|
|
// 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
|
|
// conditions and the following disclaimer.
|
|
|
|
//
|
|
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
|
|
// of conditions and the following disclaimer in the documentation and/or other
|
|
|
|
// materials provided with the distribution.
|
|
|
|
//
|
|
|
|
// 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
|
|
// used to endorse or promote products derived from this software without specific
|
|
|
|
// prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
|
|
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
|
|
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
|
|
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "crypto/hash.h"
|
|
|
|
#include "cryptonote_basic/cryptonote_basic.h"
|
|
|
|
#include "ringct/rctSigs.h"
|
2018-10-20 04:06:03 +02:00
|
|
|
#include "rpc/rpc_handler.h"
|
2017-09-05 18:20:27 +02:00
|
|
|
|
|
|
|
#include <unordered_map>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
namespace cryptonote
|
|
|
|
{
|
|
|
|
|
|
|
|
namespace rpc
|
|
|
|
{
|
|
|
|
|
|
|
|
struct block_with_transactions
|
|
|
|
{
|
|
|
|
cryptonote::block block;
|
2018-08-02 04:10:09 +02:00
|
|
|
std::vector<cryptonote::transaction> transactions;
|
2017-09-05 18:20:27 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef std::vector<uint64_t> tx_output_indices;
|
|
|
|
|
|
|
|
typedef std::vector<tx_output_indices> block_output_indices;
|
|
|
|
|
|
|
|
struct transaction_info
|
|
|
|
{
|
|
|
|
cryptonote::transaction transaction;
|
|
|
|
bool in_pool;
|
|
|
|
uint64_t height;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct output_key_and_amount_index
|
|
|
|
{
|
|
|
|
uint64_t amount_index;
|
|
|
|
crypto::public_key key;
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef std::vector<output_key_and_amount_index> outputs_for_amount;
|
|
|
|
|
|
|
|
struct amount_with_random_outputs
|
|
|
|
{
|
|
|
|
uint64_t amount;
|
|
|
|
outputs_for_amount outputs;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct peer
|
|
|
|
{
|
|
|
|
uint64_t id;
|
|
|
|
uint32_t ip;
|
|
|
|
uint16_t port;
|
2019-02-24 09:47:49 +01:00
|
|
|
uint16_t rpc_port;
|
2017-09-05 18:20:27 +02:00
|
|
|
uint64_t last_seen;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-30 00:30:51 +02:00
|
|
|
uint32_t pruning_seed;
|
2017-09-05 18:20:27 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
struct tx_in_pool
|
|
|
|
{
|
|
|
|
cryptonote::transaction tx;
|
|
|
|
crypto::hash tx_hash;
|
|
|
|
uint64_t blob_size;
|
2018-07-18 23:24:53 +02:00
|
|
|
uint64_t weight;
|
2017-09-05 18:20:27 +02:00
|
|
|
uint64_t fee;
|
|
|
|
crypto::hash max_used_block_hash;
|
|
|
|
uint64_t max_used_block_height;
|
|
|
|
bool kept_by_block;
|
|
|
|
crypto::hash last_failed_block_hash;
|
|
|
|
uint64_t last_failed_block_height;
|
|
|
|
uint64_t receive_time;
|
|
|
|
uint64_t last_relayed_time;
|
|
|
|
bool relayed;
|
|
|
|
bool do_not_relay;
|
2017-09-22 14:57:20 +02:00
|
|
|
bool double_spend_seen;
|
2017-09-05 18:20:27 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef std::unordered_map<crypto::key_image, std::vector<crypto::hash> > key_images_with_tx_hashes;
|
|
|
|
|
|
|
|
struct output_amount_count
|
|
|
|
{
|
|
|
|
uint64_t amount;
|
|
|
|
uint64_t total_count;
|
|
|
|
uint64_t unlocked_count;
|
|
|
|
uint64_t recent_count;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct output_amount_and_index
|
|
|
|
{
|
|
|
|
uint64_t amount;
|
|
|
|
uint64_t index;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct output_key_mask_unlocked
|
|
|
|
{
|
|
|
|
crypto::public_key key;
|
|
|
|
rct::key mask;
|
|
|
|
bool unlocked;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct hard_fork_info
|
|
|
|
{
|
|
|
|
uint8_t version;
|
|
|
|
bool enabled;
|
|
|
|
uint32_t window;
|
|
|
|
uint32_t votes;
|
|
|
|
uint32_t threshold;
|
|
|
|
uint8_t voting;
|
|
|
|
uint32_t state;
|
|
|
|
uint64_t earliest_height;
|
|
|
|
};
|
|
|
|
|
|
|
|
//required by JSON-RPC 2.0 spec
|
|
|
|
struct error
|
|
|
|
{
|
|
|
|
// not really using code, maybe later.
|
|
|
|
error() : use(false), code(1) { }
|
|
|
|
|
|
|
|
bool use; // do not serialize
|
|
|
|
|
|
|
|
int32_t code;
|
|
|
|
|
|
|
|
// not required by spec, but int error codes aren't perfect
|
|
|
|
std::string error_str;
|
|
|
|
|
|
|
|
std::string message;
|
|
|
|
|
|
|
|
//TODO: data member? not required, may want later.
|
|
|
|
};
|
|
|
|
|
|
|
|
struct BlockHeaderResponse
|
|
|
|
{
|
|
|
|
uint64_t major_version;
|
|
|
|
uint64_t minor_version;
|
|
|
|
uint64_t timestamp;
|
|
|
|
crypto::hash prev_id;
|
|
|
|
uint32_t nonce;
|
|
|
|
uint64_t height;
|
|
|
|
uint64_t depth;
|
|
|
|
crypto::hash hash;
|
|
|
|
uint64_t difficulty;
|
|
|
|
uint64_t reward;
|
|
|
|
};
|
|
|
|
|
2017-09-05 18:20:40 +02:00
|
|
|
struct DaemonInfo
|
|
|
|
{
|
|
|
|
uint64_t height;
|
|
|
|
uint64_t target_height;
|
|
|
|
uint64_t difficulty;
|
|
|
|
uint64_t target;
|
|
|
|
uint64_t tx_count;
|
|
|
|
uint64_t tx_pool_size;
|
|
|
|
uint64_t alt_blocks_count;
|
|
|
|
uint64_t outgoing_connections_count;
|
|
|
|
uint64_t incoming_connections_count;
|
|
|
|
uint64_t white_peerlist_size;
|
|
|
|
uint64_t grey_peerlist_size;
|
2018-02-16 12:04:04 +01:00
|
|
|
bool mainnet;
|
2017-09-05 18:20:40 +02:00
|
|
|
bool testnet;
|
2018-02-16 12:04:04 +01:00
|
|
|
bool stagenet;
|
2018-06-13 22:38:26 +02:00
|
|
|
std::string nettype;
|
2017-09-05 18:20:40 +02:00
|
|
|
crypto::hash top_block_hash;
|
|
|
|
uint64_t cumulative_difficulty;
|
|
|
|
uint64_t block_size_limit;
|
2018-07-18 23:24:53 +02:00
|
|
|
uint64_t block_weight_limit;
|
|
|
|
uint64_t block_size_median;
|
|
|
|
uint64_t block_weight_median;
|
2017-09-05 18:20:40 +02:00
|
|
|
uint64_t start_time;
|
2018-11-20 19:18:08 +01:00
|
|
|
std::string version;
|
2017-09-05 18:20:40 +02:00
|
|
|
};
|
|
|
|
|
2018-10-20 04:06:03 +02:00
|
|
|
struct output_distribution
|
|
|
|
{
|
|
|
|
output_distribution_data data;
|
|
|
|
uint64_t amount;
|
|
|
|
bool cumulative;
|
|
|
|
};
|
2017-09-05 18:20:27 +02:00
|
|
|
} // namespace rpc
|
|
|
|
|
|
|
|
} // namespace cryptonote
|