API tools faq
paste
Advertisement
potato_research

Valgrind output for memory leak in r_c_shortest_paths.hpp

potato_research
Sep 22nd, 2013
83
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 11.42 KB | None | 0 0
raw download clone embed print report
  1. ==67758== Invalid read of size 8
  2. ==67758== at 0x1009CE2A1: void boost::detail::r_c_shortest_paths_dispatch<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, FunctionPropertyMap<NodeIdFunctor, void*>, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >, Label, LabelExtender const, Dominance const, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor>(boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&, FunctionPropertyMap<NodeIdFunctor, void*> const&, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, std::vector<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> >, std::allocator<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> > > >&, std::vector<Label, std::allocator<Label> >&, bool, Label const&, LabelExtender const&, Dominance const&, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor) (r_c_shortest_paths.hpp:425)
  3. ==67758== by 0x1009CCE2D: void boost::r_c_shortest_paths<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, FunctionPropertyMap<NodeIdFunctor, void*>, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >, Label, LabelExtender, Dominance, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor>(boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&, FunctionPropertyMap<NodeIdFunctor, void*> const&, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, std::vector<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> >, std::allocator<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> > > >&, std::vector<Label, std::allocator<Label> >&, Label const&, LabelExtender const&, Dominance const&, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor) (r_c_shortest_paths.hpp:506)
  4. ==67758== by 0x1009D4D9A: HeuristicsSolver::solve_on_reduced_graph(float) const (heuristics_solver.cpp:178)
  5. ==67758== by 0x1009DB102: SPSolver::solve(std::vector<Column, std::allocator<Column> >&) (sp_solver.cpp:75)
  6. ==67758== by 0x1009DEA65: main (main.cpp:35)
  7. ==67758== Address 0x104903a40 is 0 bytes inside a block of size 88 free'd
  8. ==67758== at 0x5632: free (in /usr/local/Cellar/valgrind/3.8.1/lib/valgrind/vgpreload_memcheck-amd64-darwin.so)
  9. ==67758== by 0x1009CF3A3: __gnu_cxx::new_allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >::deallocate(boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label>*, unsigned long) (ext/new_allocator.h:110)
  10. ==67758== by 0x1009CDA18: void boost::detail::r_c_shortest_paths_dispatch<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, FunctionPropertyMap<NodeIdFunctor, void*>, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >, Label, LabelExtender const, Dominance const, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor>(boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&, FunctionPropertyMap<NodeIdFunctor, void*> const&, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, std::vector<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> >, std::allocator<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> > > >&, std::vector<Label, std::allocator<Label> >&, bool, Label const&, LabelExtender const&, Dominance const&, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor) (r_c_shortest_paths.hpp:314)
  11. ==67758== by 0x1009CCE2D: void boost::r_c_shortest_paths<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, FunctionPropertyMap<NodeIdFunctor, void*>, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >, Label, LabelExtender, Dominance, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor>(boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&, FunctionPropertyMap<NodeIdFunctor, void*> const&, FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::vertex_descriptor, std::vector<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> >, std::allocator<std::vector<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor, std::allocator<boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> >::edge_descriptor> > > >&, std::vector<Label, std::allocator<Label> >&, Label const&, LabelExtender const&, Dominance const&, std::allocator<boost::r_c_shortest_paths_label<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>, Label> >, boost::default_r_c_shortest_paths_visitor) (r_c_shortest_paths.hpp:506)
  12. ==67758== by 0x1009D4D9A: HeuristicsSolver::solve_on_reduced_graph(float) const (heuristics_solver.cpp:178)
  13. ==67758== by 0x1009DB102: SPSolver::solve(std::vector<Column, std::allocator<Column> >&) (sp_solver.cpp:75)
  14. ==67758== by 0x1009DEA65: main (main.cpp:35)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!