LSST Applications  21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
LSST Data Management Base Package
Backtrace.cc
Go to the documentation of this file.
1 // -*- lsst-c++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2008-2017 AURA/LSST.
6  *
7  * This product includes software developed by the
8  * LSST Project (http://www.lsst.org/).
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the LSST License Statement and
21  * the GNU General Public License along with this program. If not,
22  * see <https://www.lsstcorp.org/LegalNotices/>.
23  */
24 
25 #if defined(LSST_CPPUTILS_BACKTRACE_ENABLE) && (defined(__clang__) || defined(__GNUC__))
26 
27 #include <cerrno>
28 #include <cstdio>
29 #include <cstdlib>
30 #include <csignal>
31 
32 #include <cxxabi.h>
33 #include <execinfo.h>
34 
35 #include <regex>
36 
38 
39 namespace lsst {
40 namespace cpputils {
41 
42 namespace {
43 
45 static constexpr size_t MAX_FRAMES = 128;
47 static constexpr size_t NAME_SIZE_ESTIMATE = 1024;
48 
61 char *demangleAndPrint(char *input, char *buffer, size_t *bufferSize) noexcept {
62  int status = 1;
63 
64  try {
65  std::cmatch matches;
66  std::regex rgx(
67  "(.*[\\s|\\(])" // before
68  "(_\\w+)" // mangled name
69  "(.*\\+.*)" // after
70  );
71 
72  if (std::regex_match(input, matches, rgx)) {
73  buffer = abi::__cxa_demangle(matches.str(2).c_str(), buffer, bufferSize, &status);
74  fprintf(stderr, "%s%s%s\n", matches.str(1).c_str(), buffer, matches.str(3).c_str());
75  }
76  } catch(const std::regex_error &e) {
77  fprintf(stderr, "[demangleAndPrint] %s\n", e.what());
78  status = 1;
79  } catch(const std::runtime_error &e) {
80  fprintf(stderr, "[demangleAndPrint] %s\n", e.what());
81  status = 1;
82  } catch(const std::exception &e) {
83  fprintf(stderr, "[demangleAndPrint] %s\n", e.what());
84  status = 1;
85  } catch(...) {
86  fprintf(stderr, "[demangleAndPrint] unknown error occurred in demangling\n");
87  status = 1;
88  }
89 
90  if (status != 0) {
91  // no name found to demangle or name demangling failed
92  fprintf(stderr, "%s\n", input);
93  }
94  return buffer;
95 }
96 
104 void raiseWithDefaultHandler(int signum) noexcept {
105  signal(signum, SIG_DFL);
106  raise(signum);
107 }
108 
114 void signalHandler(int signum) noexcept {
115  fprintf(stderr, "Caught signal %d, backtrace follows:\n", signum);
116 
117  // retrieve current stack addresses
118  void *addressList[MAX_FRAMES + 1];
119  size_t addressLength = backtrace(addressList, MAX_FRAMES);
120  if (addressLength == 0) {
121  fprintf(stderr, " \n");
122  return;
123  }
124 
125  // translate the addresses into an array of strings
126  // that describe the addresses symbolically.
127  // return value symbolList is malloc'ed and must be free'd
128  char **symbolList = backtrace_symbols(addressList, addressLength);
129  if (symbolList == NULL) {
130  fprintf(stderr, "[backtrace_symbols] cannot dump trace, probably out of memory\n");
131  raiseWithDefaultHandler(signum);
132  }
133 
134  // allocate storage for demangled name
135  // this will be reallocated by abi::__cxa_demangle in demangleAndPrint
136  // if storage is insufficient, but if it is sufficient
137  // this reduces the number of allocations
138  size_t nameSize = NAME_SIZE_ESTIMATE;
139  char *name = (char *)malloc(nameSize * sizeof(char));
140  if (name == NULL) {
141  fprintf(stderr, "[malloc] cannot dump trace, probably out of memory\n");
142  raiseWithDefaultHandler(signum);
143  }
144 
145  for (size_t i = 0; i < addressLength; ++i) {
146  if (char *buffer = demangleAndPrint(symbolList[i], name, &nameSize)) {
147  // buffer may have been realloc'ed
148  name = buffer;
149  }
150  }
151 
152  free(name);
153  free(symbolList);
154  raiseWithDefaultHandler(signum);
155 }
156 
157 } // namespace
158 
159 Backtrace::Backtrace() noexcept : enabled(true) {
160  // Register abort handlers
161  signal(SIGABRT, signalHandler);
162  signal(SIGSEGV, signalHandler);
163  signal(SIGILL, signalHandler);
164  signal(SIGFPE, signalHandler);
165 }
166 
167 } // namespace cpputils
168 } // namespace lsst
169 
170 #else
171 
172 #include "lsst/cpputils/Backtrace.h"
173 
174 namespace lsst {
175 namespace cpputils {
176 
177 Backtrace::Backtrace() noexcept : enabled(false) {}
178 
179 } // namespace cpputils
180 } // namespace lsst
181 
182 #endif
table::Key< std::string > name
Definition: Amplifier.cc:116
T fprintf(T... args)
T free(T... args)
T malloc(T... args)
A base class for image defects.
T regex_match(T... args)
T signal(T... args)
T str(T... args)
T what(T... args)