Hi,
I have started coding in C++ and use a lot of templates, and I do mean a
lot. Unfortunately, my type names became way too long for Valgrind to
handle. Currently, it seems that it cuts the type name at around 4100
characters (slightly less than that). That is not much of a problem per se,
but it means I do not know where the error is reported to be (the file+line
number combination is missing). Any idea where the error message length is
specified? I am using memcheck and the newest stable Valgrind 3.7.0.
Here comes an example of this behavior:
==25348== by 0x4054E4:
mfmc::project::project_t<mfmc::model::model_spin_multipoint_t<mfmc::distribution::ising_t<2u,
double, int, cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> > >, mfmc::basis::basis_polynomial_t<int,
double, cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, 0u, 1u>,
mfmc::dag::coarsening::stopping_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> > >,
mfmc::dag::coarsening::reconnecting_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >,
cxxg::metric::compute_neighborhood_t<cxxg::metric::periodic_euclidean_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int>, double>,
cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t, unsigned int,
2u, unsigned int> >,
cxxg::neighborhood::neighborhood_bfs_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true>, true> >,
cxxg::algorithm::mis_frontier_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true>,
mfmc::dag::dag_natural_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >,
mfmc::dag::coarsening::stopping_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> > >,
mfmc::dag::coarsening::reconnecting_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >,
cxxg::metric::compute_neighborhood_t<cxxg::metric::periodic_euclidean_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int>, double>,
cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t, unsigned int,
2u, unsigned int> >,
cxxg::neighborhood::neighborhood_bfs_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true>, true> >,
cxxg::algorithm::mis_frontier_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true> > >,
1u>::compute(mfmc::model::model_spin_multipoint_t<mfmc::distribution::ising_t<2u,
double, int, cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> > >, mfmc::basis::basis_polynomial_t<int,
double, cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, 0u, 1u>,
mfmc::dag::coarsening::stopping_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> > >,
mfmc::dag::coarsening::reconnecting_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >,
cxxg::metric::compute_neighborhood_t<cxxg::metric::periodic_euclidean_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int>, double>,
cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t, unsigned int,
2u, unsigned int> >,
cxxg::neighborhood::neighborhood_bfs_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true>, true> >,
cxxg::algorithm::mis_frontier_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true>,
mfmc::dag::dag_natural_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >,
mfmc::dag::coarsening::stopping_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> > >,
mfmc::dag::coarsening::reconnecting_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >,
cxxg::metric::compute_neighborhood_t<cxxg::metric::periodic_euclidean_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int>, double>,
cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t, unsigned int,
2u, unsigned int> >,
cxxg::neighborhood::neighborhood_bfs_t<cxxg::graph_t<cxxg::node_equivalent_position_t<cxxg::edge_t,
unsigned int, 2u, unsigned int> >, true>, true> >,
cxxg::algorithm::mis_frontier_t<cxxg::gr
Help will be greatly appreciated!
Thanks,
Jakub
------------------------------------------------------------------------------
Virtualization & Cloud Management Using Capacity Planning
Cloud computing makes use of virtualization - but cloud computing
also focuses on allowing computing to be delivered as a service.
http://www.accelacomm.com/jaw/sfnl/114/51521223/
_______________________________________________
Valgrind-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/valgrind-users
