123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282 |
- // Copyright Antony Polukhin, 2016-2019.
- //
- // Distributed under the Boost Software License, Version 1.0. (See
- // accompanying file LICENSE_1_0.txt or copy at
- // http://www.boost.org/LICENSE_1_0.txt)
- #include <boost/stacktrace/stacktrace_fwd.hpp>
- #include <boost/stacktrace.hpp>
- #include <stdexcept>
- #include <iostream>
- #include <sstream>
- #include <cctype>
- #include <boost/core/lightweight_test.hpp>
- #include <boost/functional/hash.hpp>
- #include "test_impl.hpp"
- using boost::stacktrace::stacktrace;
- using boost::stacktrace::frame;
- #if (defined(BOOST_GCC) && defined(BOOST_WINDOWS) && !defined(BOOST_STACKTRACE_USE_BACKTRACE) && !defined(BOOST_STACKTRACE_USE_ADDR2LINE)) \
- || defined(BOOST_STACKTRACE_TEST_NO_DEBUG_AT_ALL)
- # define BOOST_STACKTRACE_TEST_SHOULD_OUTPUT_READABLE_NAMES 0
- #else
- # define BOOST_STACKTRACE_TEST_SHOULD_OUTPUT_READABLE_NAMES 1
- #endif
- void test_deeply_nested_namespaces() {
- std::stringstream ss;
- ss << return_from_nested_namespaces();
- std::cout << ss.str() << '\n';
- #if BOOST_STACKTRACE_TEST_SHOULD_OUTPUT_READABLE_NAMES
- BOOST_TEST(ss.str().find("main") != std::string::npos);
- BOOST_TEST(ss.str().find("get_backtrace_from_nested_namespaces") != std::string::npos
- || ss.str().find("1# return_from_nested_namespaces") != std::string::npos); // GCC with -O1 has strange inlining, so this line is true while the prev one is false.
- BOOST_TEST(ss.str().find("return_from_nested_namespaces") != std::string::npos);
- #endif
- stacktrace ns1 = return_from_nested_namespaces();
- BOOST_TEST(ns1 != return_from_nested_namespaces()); // Different addresses in test_deeply_nested_namespaces() function
- }
- std::size_t count_unprintable_chars(const std::string& s) {
- std::size_t result = 0;
- for (std::size_t i = 0; i < s.size(); ++i) {
- result += (std::isprint(s[i]) ? 0 : 1);
- }
- return result;
- }
- void test_frames_string_data_validity() {
- stacktrace trace = return_from_nested_namespaces();
- for (std::size_t i = 0; i < trace.size(); ++i) {
- BOOST_TEST_EQ(count_unprintable_chars(trace[i].source_file()), 0);
- BOOST_TEST_EQ(count_unprintable_chars(trace[i].name()), 0);
- }
- BOOST_TEST(to_string(trace).find('\0') == std::string::npos);
- }
- // Template parameter Depth is to produce different functions on each Depth. This simplifies debugging when one of the tests catches error
- template <std::size_t Depth>
- void test_nested(bool print = true) {
- std::pair<stacktrace, stacktrace> res = function_from_library(Depth, function_from_main_translation_unit);
- std::stringstream ss1, ss2;
- ss1 << res.first;
- ss2 << res.second;
- if (print) {
- std::cout << "'" << ss1.str() << "'\n\n" << ss2.str() << std::endl;
- }
- BOOST_TEST(!ss1.str().empty());
- BOOST_TEST(!ss2.str().empty());
- BOOST_TEST(ss1.str().find(" 0# ") != std::string::npos);
- BOOST_TEST(ss2.str().find(" 0# ") != std::string::npos);
- BOOST_TEST(ss1.str().find(" 1# ") != std::string::npos);
- BOOST_TEST(ss2.str().find(" 1# ") != std::string::npos);
-
- BOOST_TEST(ss1.str().find(" in ") != std::string::npos);
- BOOST_TEST(ss2.str().find(" in ") != std::string::npos);
- #if BOOST_STACKTRACE_TEST_SHOULD_OUTPUT_READABLE_NAMES
- BOOST_TEST(ss1.str().find("main") != std::string::npos);
- BOOST_TEST(ss2.str().find("main") != std::string::npos);
- BOOST_TEST(ss1.str().find("function_from_library") != std::string::npos);
- BOOST_TEST(ss2.str().find("function_from_library") != std::string::npos);
- BOOST_TEST(ss1.str().find("function_from_main_translation_unit") != std::string::npos);
- BOOST_TEST(ss2.str().find("function_from_main_translation_unit") != std::string::npos);
- #endif
- }
- template <class Bt>
- void test_comparisons_base(Bt nst, Bt st) {
- Bt cst(st);
- st = st;
- cst = cst;
- BOOST_TEST(nst);
- BOOST_TEST(st);
- #if !defined(BOOST_MSVC) && !defined(BOOST_STACKTRACE_USE_WINDBG)
- // This is very dependent on compiler and link flags. No sane way to make it work, because
- // BOOST_NOINLINE could be ignored by MSVC compiler if link-time optimization is enabled.
- BOOST_TEST(nst[0] != st[0]);
- #endif
- BOOST_TEST(nst != st);
- BOOST_TEST(st != nst);
- BOOST_TEST(st == st);
- BOOST_TEST(nst == nst);
- BOOST_TEST(nst != cst);
- BOOST_TEST(cst != nst);
- BOOST_TEST(cst == st);
- BOOST_TEST(cst == cst);
- BOOST_TEST(nst < st || nst > st);
- BOOST_TEST(st < nst || nst < st);
- BOOST_TEST(st <= st);
- BOOST_TEST(nst <= nst);
- BOOST_TEST(st >= st);
- BOOST_TEST(nst >= nst);
- BOOST_TEST(nst < cst || cst < nst);
- BOOST_TEST(nst > cst || cst > nst);
- BOOST_TEST(hash_value(nst) == hash_value(nst));
- BOOST_TEST(hash_value(cst) == hash_value(st));
- BOOST_TEST(hash_value(nst) != hash_value(cst));
- BOOST_TEST(hash_value(st) != hash_value(nst));
- }
- void test_comparisons() {
- stacktrace nst = return_from_nested_namespaces();
- stacktrace st;
- test_comparisons_base(nst, st);
- }
- void test_iterators() {
- stacktrace st;
- BOOST_TEST(st.begin() == st.begin());
- BOOST_TEST(st.cbegin() == st.cbegin());
- BOOST_TEST(st.crbegin() == st.crbegin());
- BOOST_TEST(st.rbegin() == st.rbegin());
- BOOST_TEST(st.begin() + 1 == st.begin() + 1);
- BOOST_TEST(st.cbegin() + 1 == st.cbegin() + 1);
- BOOST_TEST(st.crbegin() + 1 == st.crbegin() + 1);
- BOOST_TEST(st.rbegin() + 1 == st.rbegin() + 1);
- BOOST_TEST(st.end() == st.end());
- BOOST_TEST(st.cend() == st.cend());
- BOOST_TEST(st.crend() == st.crend());
- BOOST_TEST(st.rend() == st.rend());
- BOOST_TEST(st.end() > st.begin());
- BOOST_TEST(st.end() > st.cbegin());
- BOOST_TEST(st.cend() > st.cbegin());
- BOOST_TEST(st.cend() > st.begin());
- BOOST_TEST(st.size() == static_cast<std::size_t>(st.end() - st.begin()));
- BOOST_TEST(st.size() == static_cast<std::size_t>(st.end() - st.cbegin()));
- BOOST_TEST(st.size() == static_cast<std::size_t>(st.cend() - st.cbegin()));
- BOOST_TEST(st.size() == static_cast<std::size_t>(st.cend() - st.begin()));
- BOOST_TEST(st.size() == static_cast<std::size_t>(std::distance(st.rbegin(), st.rend())));
- BOOST_TEST(st.size() == static_cast<std::size_t>(std::distance(st.crbegin(), st.rend())));
- BOOST_TEST(st.size() == static_cast<std::size_t>(std::distance(st.crbegin(), st.crend())));
- BOOST_TEST(st.size() == static_cast<std::size_t>(std::distance(st.rbegin(), st.crend())));
- boost::stacktrace::stacktrace::iterator it = st.begin();
- ++ it;
- BOOST_TEST(it == st.begin() + 1);
- }
- void test_frame() {
- stacktrace nst = return_from_nested_namespaces();
- stacktrace st = make_some_stacktrace1();
- const std::size_t min_size = (nst.size() < st.size() ? nst.size() : st.size());
- BOOST_TEST(min_size > 2);
- for (std::size_t i = 0; i < min_size; ++i) {
- BOOST_TEST(st[i] == st[i]);
- BOOST_TEST(st[i].source_file() == st[i].source_file());
- BOOST_TEST(st[i].source_line() == st[i].source_line());
- BOOST_TEST(st[i] <= st[i]);
- BOOST_TEST(st[i] >= st[i]);
- frame fv = nst[i];
- BOOST_TEST(fv);
- if (i > 1 && i < min_size - 3) { // Begin ...and end of the trace may match, skipping
- BOOST_TEST(st[i] != fv);
-
- #if !(defined(BOOST_STACKTRACE_TEST_NO_DEBUG_AT_ALL) && defined(BOOST_MSVC))
- // MSVC can not get function name withhout debug symbols even if it is exported
- BOOST_TEST(st[i].name() != fv.name());
- BOOST_TEST(st[i] != fv);
- BOOST_TEST(st[i] < fv || st[i] > fv);
- BOOST_TEST(hash_value(st[i]) != hash_value(fv));
- #endif
- if (st[i].source_line()) {
- BOOST_TEST(st[i].source_file() != fv.source_file() || st[i].source_line() != fv.source_line());
- }
- BOOST_TEST(st[i]);
- }
- fv = st[i];
- BOOST_TEST(hash_value(st[i]) == hash_value(fv));
- }
- boost::stacktrace::frame empty_frame;
- BOOST_TEST(!empty_frame);
- BOOST_TEST_EQ(empty_frame.source_file(), "");
- BOOST_TEST_EQ(empty_frame.name(), "");
- BOOST_TEST_EQ(empty_frame.source_line(), 0);
- }
- // Template parameter bool BySkip is to produce different functions on each BySkip. This simplifies debugging when one of the tests catches error
- template <bool BySkip>
- void test_empty_basic_stacktrace() {
- typedef boost::stacktrace::stacktrace st_t;
- st_t st = BySkip ? st_t(100500, 1024) : st_t(0, 0);
- BOOST_TEST(!st);
- BOOST_TEST(st.empty());
- BOOST_TEST(st.size() == 0);
- BOOST_TEST(st.begin() == st.end());
- BOOST_TEST(st.cbegin() == st.end());
- BOOST_TEST(st.cbegin() == st.cend());
- BOOST_TEST(st.begin() == st.cend());
- BOOST_TEST(st.rbegin() == st.rend());
- BOOST_TEST(st.crbegin() == st.rend());
- BOOST_TEST(st.crbegin() == st.crend());
- BOOST_TEST(st.rbegin() == st.crend());
- BOOST_TEST(hash_value(st) == hash_value(st_t(0, 0)));
- BOOST_TEST(st == st_t(0, 0));
- BOOST_TEST(!(st < st_t(0, 0)));
- BOOST_TEST(!(st > st_t(0, 0)));
- }
- int main() {
- test_deeply_nested_namespaces();
- test_frames_string_data_validity();
- test_nested<15>();
- test_comparisons();
- test_iterators();
- test_frame();
- test_empty_basic_stacktrace<true>();
- test_empty_basic_stacktrace<false>();
- BOOST_TEST(&make_some_stacktrace1 != &make_some_stacktrace2);
- boost::stacktrace::stacktrace b1 = make_some_stacktrace1();
- BOOST_TEST(b1.size() == 4);
- boost::stacktrace::stacktrace b2 = make_some_stacktrace2();
- BOOST_TEST(b2.size() == 4);
- test_comparisons_base(make_some_stacktrace1(), make_some_stacktrace2());
- test_nested<260>(false);
- BOOST_TEST(boost::stacktrace::stacktrace(0, 1).size() == 1);
- BOOST_TEST(boost::stacktrace::stacktrace(1, 1).size() == 1);
- return boost::report_errors();
- }
|