Advertisement
Guest User

Untitled

a guest
Jan 18th, 2012
71
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.55 KB | None | 0 0
  1. ==2064== Memcheck, a memory error detector
  2. ==2064== Copyright (C) 2002-2011, and GNU GPL'd, by Julian Seward et al.
  3. ==2064== Using Valgrind-3.7.0 and LibVEX; rerun with -h for copyright info
  4. ==2064== Command: ./g01
  5. ==2064==
  6. * Put 42
  7. 42: foo
  8. --------
  9. * Put 17
  10. 17: spam 42: foo
  11. --------
  12. * Put 23
  13. 17: spam 23: bar 42: foo
  14. --------
  15. Get 1: key not found!
  16. --------
  17. Get 42: foo
  18. --------
  19. Get 17: spam
  20. --------
  21. Get 23: bar
  22. --------
  23. * Del 1
  24. 17: spam 23: bar 42: foo
  25. --------
  26. * Del 23
  27. 17: spam 42: foo
  28. --------
  29. * Del 42
  30. 17: spam
  31. --------
  32. * Del 17
  33.  
  34. --------
  35. ==2064==
  36. ==2064== HEAP SUMMARY:
  37. ==2064== in use at exit: 49 bytes in 3 blocks
  38. ==2064== total heap usage: 9 allocs, 6 frees, 239 bytes allocated
  39. ==2064==
  40. ==2064== 49 bytes in 3 blocks are definitely lost in loss record 1 of 1
  41. ==2064== at 0x402AB64: operator new(unsigned int) (in /usr/lib/valgrind/vgpreload_memcheck-x86-linux.so)
  42. ==2064== by 0x40D5663: std::string::_Rep::_S_create(unsigned int, unsigned int, std::allocator<char> const&) (in /usr/lib/libstdc++.so.6.0.16)
  43. ==2064== by 0x40D78C7: char* std::string::_S_construct<char const*>(char const*, char const*, std::allocator<char> const&, std::forward_iterator_tag) (in /usr/lib/libstdc++.so.6.0.16)
  44. ==2064== by 0x40D7A35: std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string(char const*, std::allocator<char> const&) (in /usr/lib/libstdc++.so.6.0.16)
  45. ==2064== by 0x418C482: (below main) (in /lib/libc-2.15.so)
  46. ==2064==
  47. ==2064== LEAK SUMMARY:
  48. ==2064== definitely lost: 49 bytes in 3 blocks
  49. ==2064== indirectly lost: 0 bytes in 0 blocks
  50. ==2064== possibly lost: 0 bytes in 0 blocks
  51. ==2064== still reachable: 0 bytes in 0 blocks
  52. ==2064== suppressed: 0 bytes in 0 blocks
  53. ==2064==
  54. ==2064== For counts of detected and suppressed errors, rerun with: -v
  55. ==2064== ERROR SUMMARY: 1 errors from 1 contexts (suppressed: 0 from 0)
  56. [eue@aarika g01]$ valgrind --leak-check=full ./g01 > /dev/null
  57. ==2065== Memcheck, a memory error detector
  58. ==2065== Copyright (C) 2002-2011, and GNU GPL'd, by Julian Seward et al.
  59. ==2065== Using Valgrind-3.7.0 and LibVEX; rerun with -h for copyright info
  60. ==2065== Command: ./g01
  61. ==2065==
  62. ==2065==
  63. ==2065== HEAP SUMMARY:
  64. ==2065== in use at exit: 49 bytes in 3 blocks
  65. ==2065== total heap usage: 9 allocs, 6 frees, 239 bytes allocated
  66. ==2065==
  67. ==2065== 49 bytes in 3 blocks are definitely lost in loss record 1 of 1
  68. ==2065== at 0x402AB64: operator new(unsigned int) (in /usr/lib/valgrind/vgpreload_memcheck-x86-linux.so)
  69. ==2065== by 0x40D5663: std::string::_Rep::_S_create(unsigned int, unsigned int, std::allocator<char> const&) (in /usr/lib/libstdc++.so.6.0.16)
  70. ==2065== by 0x40D78C7: char* std::string::_S_construct<char const*>(char const*, char const*, std::allocator<char> const&, std::forward_iterator_tag) (in /usr/lib/libstdc++.so.6.0.16)
  71. ==2065== by 0x40D7A35: std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string(char const*, std::allocator<char> const&) (in /usr/lib/libstdc++.so.6.0.16)
  72. ==2065== by 0x418C482: (below main) (in /lib/libc-2.15.so)
  73. ==2065==
  74. ==2065== LEAK SUMMARY:
  75. ==2065== definitely lost: 49 bytes in 3 blocks
  76. ==2065== indirectly lost: 0 bytes in 0 blocks
  77. ==2065== possibly lost: 0 bytes in 0 blocks
  78. ==2065== still reachable: 0 bytes in 0 blocks
  79. ==2065== suppressed: 0 bytes in 0 blocks
  80. ==2065==
  81. ==2065== For counts of detected and suppressed errors, rerun with: -v
  82. ==2065== ERROR SUMMARY: 1 errors from 1 contexts (suppressed: 0 from 0)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement