API tools faq
paste
Advertisement
potato_research

Valgrind output - indented

potato_research
Sep 22nd, 2013
86
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 16.07 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. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  6. FunctionPropertyMap<NodeIdFunctor, void*>,
  7. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >,
  8. Label,
  9. LabelExtender const,
  10. Dominance const,
  11. std::allocator<
  12. boost::r_c_shortest_paths_label<
  13. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  14. Label
  15. >
  16. >,
  17. boost::default_r_c_shortest_paths_visitor>
  18. (
  19. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&,
  20. FunctionPropertyMap<NodeIdFunctor, void*> const&,
  21. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&,
  22. boost::graph_traits<
  23. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  24. >::vertex_descriptor,
  25. boost::graph_traits<
  26. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  27. >::vertex_descriptor,
  28. std::vector<
  29. std::vector<
  30. boost::graph_traits<
  31. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  32. >::edge_descriptor,
  33. std::allocator<
  34. boost::graph_traits<
  35. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  36. >::edge_descriptor
  37. >
  38. >,
  39. std::allocator<
  40. std::vector<
  41. boost::graph_traits<
  42. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  43. >::edge_descriptor,
  44. std::allocator<
  45. boost::graph_traits<
  46. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  47. >::edge_descriptor
  48. >
  49. >
  50. >
  51. >&,
  52. std::vector<Label, std::allocator<Label> >&,
  53. bool,
  54. Label const&,
  55. LabelExtender const&,
  56. Dominance const&,
  57. std::allocator<
  58. boost::r_c_shortest_paths_label<
  59. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  60. Label
  61. >
  62. >,
  63. boost::default_r_c_shortest_paths_visitor
  64. ) (r_c_shortest_paths.hpp:425)]
  65.  
  66. ==67758== by 0x1009CCE2D:
  67. void boost::r_c_shortest_paths<
  68. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  69. FunctionPropertyMap<NodeIdFunctor, void*>,
  70. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >,
  71. Label,
  72. LabelExtender,
  73. Dominance,
  74. std::allocator<
  75. boost::r_c_shortest_paths_label<
  76. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  77. Label
  78. >
  79. >,
  80. boost::default_r_c_shortest_paths_visitor>
  81. (
  82. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&,
  83. FunctionPropertyMap<NodeIdFunctor, void*> const&,
  84. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&,
  85. boost::graph_traits<
  86. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  87. >::vertex_descriptor,
  88. boost::graph_traits<
  89. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  90. >::vertex_descriptor,
  91. std::vector<
  92. std::vector<
  93. boost::graph_traits<
  94. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  95. >::edge_descriptor,
  96. std::allocator<
  97. boost::graph_traits<
  98. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  99. >::edge_descriptor
  100. >
  101. >,
  102. std::allocator<
  103. std::vector<
  104. boost::graph_traits<
  105. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  106. >::edge_descriptor,
  107. std::allocator<
  108. boost::graph_traits<
  109. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  110. >::edge_descriptor
  111. >
  112. >
  113. >
  114. >&,
  115. std::vector<Label, std::allocator<Label> >&,
  116. Label const&,
  117. LabelExtender const&,
  118. Dominance const&,
  119. std::allocator<
  120. boost::r_c_shortest_paths_label<
  121. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  122. Label
  123. >
  124. >,
  125. boost::default_r_c_shortest_paths_visitor
  126. ) (r_c_shortest_paths.hpp:506)
  127.  
  128. ==67758== by 0x1009D4D9A: HeuristicsSolver::solve_on_reduced_graph(float) const (heuristics_solver.cpp:178)
  129.  
  130. ==67758== by 0x1009DB102: SPSolver::solve(std::vector<Column, std::allocator<Column> >&) (sp_solver.cpp:75)
  131.  
  132. ==67758== by 0x1009DEA65: main (main.cpp:35)
  133.  
  134. *********
  135. ==67758== Address 0x104903a40 is 0 bytes inside a block of size 88 free'd
  136. *********
  137.  
  138. ==67758== at 0x5632: free (in /usr/local/Cellar/valgrind/3.8.1/lib/valgrind/vgpreload_memcheck-amd64-darwin.so)
  139.  
  140. ==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)
  141.  
  142. ==67758== by 0x1009CDA18:
  143. void boost::detail::r_c_shortest_paths_dispatch<
  144. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  145. FunctionPropertyMap<NodeIdFunctor, void*>,
  146. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >,
  147. Label,
  148. LabelExtender const,
  149. Dominance const,
  150. std::allocator<
  151. boost::r_c_shortest_paths_label<
  152. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  153. Label
  154. >
  155. >,
  156. boost::default_r_c_shortest_paths_visitor>
  157. (
  158. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&,
  159. FunctionPropertyMap<NodeIdFunctor, void*> const&,
  160. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&,
  161. boost::graph_traits<
  162. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  163. >::vertex_descriptor,
  164. boost::graph_traits<
  165. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  166. >::vertex_descriptor,
  167. std::vector<
  168. std::vector<
  169. boost::graph_traits<
  170. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  171. >::edge_descriptor,
  172. std::allocator<
  173. boost::graph_traits<
  174. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  175. >::edge_descriptor
  176. >
  177. >,
  178. std::allocator<
  179. std::vector<
  180. boost::graph_traits<
  181. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  182. >::edge_descriptor,
  183. std::allocator<
  184. boost::graph_traits<
  185. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  186. >::edge_descriptor
  187. >
  188. >
  189. >
  190. >&,
  191. std::vector<Label, std::allocator<Label> >&,
  192. bool,
  193. Label const&,
  194. LabelExtender const&,
  195. Dominance const&,
  196. std::allocator<
  197. boost::r_c_shortest_paths_label<
  198. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  199. Label
  200. >
  201. >,
  202. boost::default_r_c_shortest_paths_visitor
  203. ) (r_c_shortest_paths.hpp:314)
  204.  
  205. ==67758== by 0x1009CCE2D:
  206. void boost::r_c_shortest_paths<
  207. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  208. FunctionPropertyMap<NodeIdFunctor, void*>,
  209. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >,
  210. Label,
  211. LabelExtender,
  212. Dominance,
  213. std::allocator<
  214. boost::r_c_shortest_paths_label<
  215. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  216. Label
  217. >
  218. >,
  219. boost::default_r_c_shortest_paths_visitor
  220. >
  221. (
  222. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS> const&,
  223. FunctionPropertyMap<NodeIdFunctor, void*> const&,
  224. FunctionPropertyMap<ArcIdFunctor, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > const&,
  225. boost::graph_traits<
  226. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  227. >::vertex_descriptor,
  228. boost::graph_traits<
  229. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  230. >::vertex_descriptor,
  231. std::vector<
  232. std::vector<
  233. boost::graph_traits<
  234. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  235. >::edge_descriptor,
  236. std::allocator<
  237. boost::graph_traits<
  238. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  239. >::edge_descriptor>
  240. >,
  241. std::allocator<
  242. std::vector<
  243. boost::graph_traits<
  244. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  245. >::edge_descriptor,
  246. std::allocator<
  247. boost::graph_traits<
  248. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>
  249. >::edge_descriptor
  250. >
  251. >
  252. >
  253. >&,
  254. std::vector<Label, std::allocator<Label> >&,
  255. Label const&,
  256. LabelExtender const&,
  257. Dominance const&,
  258. std::allocator<
  259. boost::r_c_shortest_paths_label<
  260. boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, std::shared_ptr<Node>, std::shared_ptr<Arc>, boost::no_property, boost::listS>,
  261. Label
  262. >
  263. >,
  264. boost::default_r_c_shortest_paths_visitor
  265. ) (r_c_shortest_paths.hpp:506)
  266.  
  267. ==67758== by 0x1009D4D9A: HeuristicsSolver::solve_on_reduced_graph(float) const (heuristics_solver.cpp:178)
  268.  
  269. ==67758== by 0x1009DB102: SPSolver::solve(std::vector<Column, std::allocator<Column> >&) (sp_solver.cpp:75)
  270.  
  271. ==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!