API tools faq
paste
Advertisement
potato_research

Valgrind output - simplified

potato_research
Sep 22nd, 2013
88
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.91 KB | None | 0 0
raw download clone embed print report
  1. ==67758== Invalid read of size 8
  2.  
  3. ==67758== at 0x1009CE2A1:
  4. void boost::detail::r_c_shortest_paths_dispatch<
  5. BGraph,
  6. FunctionPropertyMap<NodeIdFunctor, Vertex>,
  7. FunctionPropertyMap<ArcIdFunctor, Edge>,
  8. Label,
  9. LabelExtender const,
  10. Dominance const,
  11. std::allocator<boost::r_c_shortest_paths_label<BGraph, Label>>,
  12. boost::default_r_c_shortest_paths_visitor>
  13. (
  14. BGraph const&,
  15. FunctionPropertyMap<NodeIdFunctor, Vertex> const&,
  16. FunctionPropertyMap<ArcIdFunctor, Edge> const&,
  17. Vertex,
  18. Vertex,
  19. std::vector<std::vector<Edge, std::allocator<Edge>>, std::allocator<std::vector<Edge, std::allocator<Edge>>>&,
  20. std::vector<Label, std::allocator<Label>>&,
  21. bool,
  22. Label const&,
  23. LabelExtender const&,
  24. Dominance const&,
  25. std::allocator<boost::r_c_shortest_paths_label<BGraph,Label>>,
  26. boost::default_r_c_shortest_paths_visitor
  27. ) (r_c_shortest_paths.hpp:425)]
  28.  
  29. ==67758== by 0x1009CCE2D:
  30. void boost::r_c_shortest_paths<
  31. BGraph,
  32. FunctionPropertyMap<NodeIdFunctor, Vertex>,
  33. FunctionPropertyMap<ArcIdFunctor, Edge>,
  34. Label,
  35. LabelExtender,
  36. Dominance,
  37. std::allocator<boost::r_c_shortest_paths_label<BGraph, Label>>,
  38. boost::default_r_c_shortest_paths_visitor>
  39. (
  40. BGraph const&,
  41. FunctionPropertyMap<NodeIdFunctor, Vertex> const&,
  42. FunctionPropertyMap<ArcIdFunctor, Edge> const&,
  43. Vertex,
  44. Vertex,
  45. std::vector<std::vector<Edge, std::allocator<Edge>>, std::allocator<std::vector<Edge, std::allocator<Edge>>>&,
  46. std::vector<Label, std::allocator<Label>>&,
  47. Label const&,
  48. LabelExtender const&,
  49. Dominance const&,
  50. std::allocator<boost::r_c_shortest_paths_label<BGraph, Label>>,
  51. boost::default_r_c_shortest_paths_visitor
  52. ) (r_c_shortest_paths.hpp:506)
  53.  
  54. ==67758== by 0x1009D4D9A: HeuristicsSolver::solve_on_reduced_graph(float) const (heuristics_solver.cpp:178)
  55.  
  56. ==67758== by 0x1009DB102: SPSolver::solve(std::vector<Column, std::allocator<Column> >&) (sp_solver.cpp:75)
  57.  
  58. ==67758== by 0x1009DEA65: main (main.cpp:35)
  59.  
  60. *********
  61. ==67758== Address 0x104903a40 is 0 bytes inside a block of size 88 free'd
  62. *********
  63.  
  64. ==67758== at 0x5632: free (in /usr/local/Cellar/valgrind/3.8.1/lib/valgrind/vgpreload_memcheck-amd64-darwin.so)
  65.  
  66. ==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)
  67.  
  68. ==67758== by 0x1009CDA18:
  69. void boost::detail::r_c_shortest_paths_dispatch<
  70. BGraph,
  71. FunctionPropertyMap<NodeIdFunctor, Vertex>,
  72. FunctionPropertyMap<ArcIdFunctor, Edge>,
  73. Label,
  74. LabelExtender const,
  75. Dominance const,
  76. std::allocator<boost::r_c_shortest_paths_label<BGraph, Label>>,
  77. boost::default_r_c_shortest_paths_visitor>
  78. (
  79. BGraph const&,
  80. FunctionPropertyMap<NodeIdFunctor, Vertex> const&,
  81. FunctionPropertyMap<ArcIdFunctor, Edge> const&,
  82. Vertex,
  83. Vertex,
  84. std::vector<std::vector<Edge, std::allocator<Edge>>, std::allocator<std::vector<Edge, std::allocator<Edge>>>&,
  85. std::vector<Label, std::allocator<Label>>&,
  86. bool,
  87. Label const&,
  88. LabelExtender const&,
  89. Dominance const&,
  90. std::allocator<boost::r_c_shortest_paths_label<BGraph, Label>>,
  91. boost::default_r_c_shortest_paths_visitor
  92. ) (r_c_shortest_paths.hpp:314)
  93.  
  94. ==67758== by 0x1009CCE2D:
  95. void boost::r_c_shortest_paths<
  96. BGraph,
  97. FunctionPropertyMap<NodeIdFunctor, Vertex>,
  98. FunctionPropertyMap<ArcIdFunctor, Edge>,
  99. Label,
  100. LabelExtender,
  101. Dominance,
  102. std::allocator<boost::r_c_shortest_paths_label<BGraph, Label>>,
  103. boost::default_r_c_shortest_paths_visitor>
  104. (
  105. BGraph const&,
  106. FunctionPropertyMap<NodeIdFunctor, Vertex> const&,
  107. FunctionPropertyMap<ArcIdFunctor, Edge> const&,
  108. Vertex,
  109. Vertex,
  110. std::vector<std::vector<Edge, std::allocator<Edge>>, std::allocator<std::vector<Edge, std::allocator<Edge>>>&,
  111. std::vector<Label, std::allocator<Label>>&,
  112. Label const&,
  113. LabelExtender const&,
  114. Dominance const&,
  115. std::allocator<boost::r_c_shortest_paths_label<BGraph,Label>>,
  116. boost::default_r_c_shortest_paths_visitor
  117. ) (r_c_shortest_paths.hpp:506)
  118.  
  119. ==67758== by 0x1009D4D9A: HeuristicsSolver::solve_on_reduced_graph(float) const (heuristics_solver.cpp:178)
  120.  
  121. ==67758== by 0x1009DB102: SPSolver::solve(std::vector<Column, std::allocator<Column> >&) (sp_solver.cpp:75)
  122.  
  123. ==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!