-
Notifications
You must be signed in to change notification settings - Fork 337
/
main.cpp
111 lines (95 loc) · 3.7 KB
/
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
/*
* Copyright (c) 2015 Cryptonomex, Inc., and contributors.
* 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. Any modified source or binaries are used only with the BitShares network.
*
* 2. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
*
* 3. 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.
*
* 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.
*
*/
#include <fc/io/json.hpp>
#include <fc/smart_ref_impl.hpp>
#include <fc/variant.hpp>
#include <fc/variant_object.hpp>
#include <graphene/chain/protocol/protocol.hpp>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace graphene::chain;
vector< fc::variant_object > g_op_types;
template< typename T >
uint64_t get_wire_size()
{
T data;
return fc::raw::pack( data ).size();
}
struct size_check_type_visitor
{
typedef void result_type;
int t = 0;
size_check_type_visitor(int _t ):t(_t){}
template<typename Type>
result_type operator()( const Type& op )const
{
fc::mutable_variant_object vo;
vo["name"] = fc::get_typename<Type>::name();
vo["mem_size"] = sizeof( Type );
vo["wire_size"] = get_wire_size<Type>();
g_op_types.push_back( vo );
}
};
int main( int argc, char** argv )
{
try
{
graphene::chain::operation op;
vector<uint64_t> witnesses; witnesses.resize(50);
for( uint32_t i = 0; i < 60*60*24*30; ++i )
{
witnesses[ rand() % 50 ]++;
}
std::sort( witnesses.begin(), witnesses.end() );
idump((witnesses.back() - witnesses.front()) );
idump((60*60*24*30/50));
idump(("deviation: ")((60*60*24*30/50-witnesses.front())/(60*60*24*30/50.0)));
idump( (witnesses) );
for( int32_t i = 0; i < op.count(); ++i )
{
op.set_which(i);
op.visit( size_check_type_visitor(i) );
}
// sort them by mem size
std::stable_sort( g_op_types.begin(), g_op_types.end(),
[](const variant_object& oa, const variant_object& ob) {
return oa["mem_size"].as_uint64() > ob["mem_size"].as_uint64();
});
std::cout << "[\n";
for( size_t i=0; i<g_op_types.size(); i++ )
{
std::cout << " " << fc::json::to_string( g_op_types[i] );
if( i < g_op_types.size()-1 )
std::cout << ",\n";
else
std::cout << "\n";
}
std::cout << "]\n";
std::cerr << "Size of block header: " << sizeof( block_header ) << " " << fc::raw::pack_size( block_header() ) << "\n";
}
catch ( const fc::exception& e ){ edump((e.to_detail_string())); }
idump((sizeof(signed_block)));
idump((fc::raw::pack_size(signed_block())));
return 0;
}