valgrind output new
unknown
plain_text
3 years ago
4.7 kB
6
Indexable
==160== Memcheck, a memory error detector ==160== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al. ==160== Using Valgrind-3.15.0 and LibVEX; rerun with -h for copyright info ==160== Command: ./a.out ==160== 4 2 8 1 7 4 5 5 2 ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x109A44: main (newJ2.cpp:109) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x1096EF: Node::update() (newJ2.cpp:66) ==160== by 0x10949E: Node::insert(Node*) (newJ2.cpp:40) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x109705: Node::update() (newJ2.cpp:66) ==160== by 0x10949E: Node::insert(Node*) (newJ2.cpp:40) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x1096EF: Node::update() (newJ2.cpp:66) ==160== by 0x10949E: Node::insert(Node*) (newJ2.cpp:40) ==160== by 0x1094DB: Node::insert(Node*) (newJ2.cpp:42) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x109705: Node::update() (newJ2.cpp:66) ==160== by 0x10949E: Node::insert(Node*) (newJ2.cpp:40) ==160== by 0x1094DB: Node::insert(Node*) (newJ2.cpp:42) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x1096EF: Node::update() (newJ2.cpp:66) ==160== by 0x109554: Node::insert(Node*) (newJ2.cpp:44) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x109771: Node::solve(int) (newJ2.cpp:74) ==160== by 0x1099F9: main (newJ2.cpp:108) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x1096EF: Node::update() (newJ2.cpp:66) ==160== by 0x109554: Node::insert(Node*) (newJ2.cpp:44) ==160== by 0x1094DB: Node::insert(Node*) (newJ2.cpp:42) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x1096EF: Node::update() (newJ2.cpp:66) ==160== by 0x109532: Node::insert(Node*) (newJ2.cpp:43) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x109705: Node::update() (newJ2.cpp:66) ==160== by 0x109554: Node::insert(Node*) (newJ2.cpp:44) ==160== by 0x1094DB: Node::insert(Node*) (newJ2.cpp:42) ==160== by 0x1094DB: Node::insert(Node*) (newJ2.cpp:42) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== ==160== Conditional jump or move depends on uninitialised value(s) ==160== at 0x10AE92: int const& std::max<int>(int const&, int const&) (stl_algobase.h:227) ==160== by 0x1096EF: Node::update() (newJ2.cpp:66) ==160== by 0x109532: Node::insert(Node*) (newJ2.cpp:43) ==160== by 0x1094DB: Node::insert(Node*) (newJ2.cpp:42) ==160== by 0x109A6D: main (newJ2.cpp:111) ==160== 0 0 1 1 ==160== ==160== HEAP SUMMARY: ==160== in use at exit: 200 bytes in 5 blocks ==160== total heap usage: 12 allocs, 7 frees, 75,052 bytes allocated ==160== ==160== LEAK SUMMARY: ==160== definitely lost: 40 bytes in 1 blocks ==160== indirectly lost: 120 bytes in 3 blocks ==160== possibly lost: 0 bytes in 0 blocks ==160== still reachable: 40 bytes in 1 blocks ==160== suppressed: 0 bytes in 0 blocks ==160== Rerun with --leak-check=full to see details of leaked memory ==160== ==160== Use --track-origins=yes to see where uninitialised values come from ==160== For lists of detected and suppressed errors, rerun with: -s ==160== ERROR SUMMARY: 21 errors from 11 contexts (suppressed: 0 from 0)
Editor is loading...