1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491
|
#!/usr/bin/env python3
#
# This file is open source software, licensed to you under the terms
# of the Apache License, Version 2.0 (the "License"). See the NOTICE file
# distributed with this work for additional information regarding copyright
# ownership. You may not use this file except in compliance with the License.
#
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing,
# software distributed under the License is distributed on an
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied. See the License for the
# specific language governing permissions and limitations
# under the License.
#
# Copyright (C) 2017 ScyllaDB
import bisect
import collections
import re
import sys
import subprocess
from enum import Enum
from functools import cache
from typing import Any, Optional, TypeVar, Union, cast
# special binary path/module indicating that the address is from the kernel
KERNEL_MODULE = '<kernel>'
T = TypeVar('T')
def notNone(o: Optional[T]) -> T:
"""Asserts the argument is not None then returns it."""
assert o is not None
return o
class Addr2Line:
# Matcher for a line that appears at the end a single decoded
# address, which we force by adding a dummy 0x0 address. The
# pattern varies between binutils addr2line and llvm-addr2line
# so we match both.
# The LLVM output is usually literally:
# 0x0: ?? at ??
# but not always, e.g., when ASAN is linked it may be (for example):
# 0x0: ?? at /v/llvm/llvm/src/compiler-rt/lib/asan/asan_fake_stack.h:133
# so that's why we liberally accept .* as the part after "at" below
dummy_pattern = re.compile(
r"(.*0x0000000000000000: \?\? \?\?:0\n)" # addr2line pattern
r"|"
r"(\?\? at \?\?:0\n)" # llvm-addr2line pattern for LLVM 18 and newer
r"|"
r"(,\n)" # llvm-addr2line pattern for LLVM 17 and older
)
def __init__(
self,
parent: 'BacktraceResolver',
binary: str,
concise: bool = False,
cmd_path: str = "addr2line",
):
self._parent = parent
self._binary = binary
# Print warning if binary has no debug info according to `file`.
# Note: no message is printed for system errors as they will be
# printed also by addr2line later on.
output = subprocess.check_output(["file", self._binary])
s = output.decode("utf-8")
if s.find('ELF') >= 0 and s.find('debug_info', len(self._binary)) < 0:
print('{}'.format(s))
args = [cmd_path, f"-{'C' if not concise else ''}fpia", "-e", self._binary]
self._parent.debug(f"Addr2line invoking: {' '.join(args)}")
self._input_proc = subprocess.Popen(
args,
stdin=subprocess.PIPE,
stdout=subprocess.PIPE,
universal_newlines=True,
)
if concise:
self._output_proc = subprocess.Popen(
["c++filt", "-p"],
stdin=self._input_proc.stdout,
stdout=subprocess.PIPE,
universal_newlines=True,
)
else:
self._output_proc = self._input_proc
# If a library doesn't exist in a particular path, addr2line
# will just exit. We need to be robust against that. We
# can't just wait on self._addr2line since there is no
# guarantee on what timeout is sufficient.
self._input.write(',\n')
self._input.flush()
res = self._output.readline()
self._missing = res == ''
@property
def _input(self):
"""Returns the input stream for the process/pipe."""
return notNone(self._input_proc.stdin)
@property
def _output(self):
"""Returns the output stream for the process/pipe."""
return notNone(self._output_proc.stdout)
def _read_resolved_address(self):
first = self._output.readline()
self._parent.debug('Addr2Line read output (first): ', first)
# remove the address
res = first.split(': ', 1)[1]
while True:
line = self._output.readline()
if Addr2Line.dummy_pattern.fullmatch(line):
self._parent.debug('Addr2Line read output ( dummy): ', line)
break
self._parent.debug('Addr2Line read output (non-dummy): ', line)
res += line
return res
def __call__(self, address: str):
if self._missing:
return " ".join([self._binary, address, '\n'])
# We trigger a dummy "invalid" address printout after the address we are interested in
# which we can look for in _read_address
inputline = address + '\n,\n'
self._parent.debug('Add2Line sending input to stdin:', inputline)
self._input.write(inputline)
self._input.flush()
return self._read_resolved_address()
class KernelResolver:
"""A resolver for kernel addresses which tries to read from /proc/kallsyms."""
LAST_SYMBOL_MAX_SIZE = 1024
def __init__(self, parent: 'BacktraceResolver', kallsyms: str = '/proc/kallsyms'):
syms: list[tuple[int, str]] = []
ksym_re = re.compile(r'(?P<addr>[0-9a-f]+) (?P<type>.+) (?P<name>\S+)')
warnings_left = 10
self.error = None
try:
f = open(kallsyms, 'r')
except OSError as e:
self.error = f'Cannot open {kallsyms}: {e}'
print(self.error)
return
try:
for line in f:
m = ksym_re.match(line)
if not m:
if warnings_left > 0: # don't spam too much
print(
f'WARNING: {kallsyms} regex match failure: {line.strip()}',
file=sys.stdout,
)
warnings_left -= 1
else:
syms.append((int(m.group('addr'), 16), m.group('name')))
finally:
f.close()
if not syms:
# make empty kallsyms (?) an error so we can assum len >= 1 below
self.error = 'kallsyms was empty'
print(self.error)
return
syms.sort()
if syms[-1][0] == 0:
# zero values for all symbols means that kptr_restrict blocked you
# from seeing the kernel symbol addresses
print('kallsyms is restricted, set /proc/sys/kernel/kptr_restrict to 0 to decode')
self.error = 'kallsyms is restricted'
return
# split because bisect can't take a key func before 3.10
self.sym_addrs: tuple[int]
self.sym_names: tuple[str]
self.sym_addrs, self.sym_names = zip(*syms) # type: ignore
def __call__(self, addrstr: str):
if self.error:
return addrstr + '\n'
sa = self.sym_addrs
sn = self.sym_names
slen = len(sa)
address = int(addrstr, 16)
idx = bisect.bisect_right(sa, address) - 1
assert -1 <= idx < slen
if idx == -1:
return f'{addrstr} ({sa[0] - address} bytes before first symbol)\n'
if idx == slen - 1:
# We can easily detect symbol addresses which are too small: they fall before
# the first symbol in kallsyms, but for too large it is harder: we can't really
# distinguish between an address that is in the *very last* function in the symbol map
# and one which is beyond that, since kallsyms doesn't include symbol size. Instead
# we use a bit of a quick and dirty heuristic: if the symbol is *far enough* beyond
# the last symbol we assume it is not valid. Most likely, the overwhelming majority
# of cases are invalid (e.g., due to KASLR) as the final symbol in the map is usually
# something obscure.
lastsym = sa[-1]
if address - lastsym > self.LAST_SYMBOL_MAX_SIZE:
return f'{addrstr} ({address - lastsym} bytes after last symbol)\n'
saddr = sa[idx]
assert saddr <= address
return f'{sn[idx]}+0x{address - saddr:x}\n'
LineResult = dict[
str, Union[None, 'BacktraceResolver.BacktraceParser.Type', str, list[dict[str, Any]]]
]
class BacktraceResolver:
class BacktraceParser:
class Type(Enum):
ADDRESS = 1
SEPARATOR = 2
def __init__(self):
addr = "0x[0-9a-f]+"
path = r"\S+"
token = fr"(?:{path}\+)?{addr}"
full_addr_match = fr"(?:(?P<path>{path})\s*\+\s*)?(?P<addr>{addr})"
ignore_addr_match = fr"(?:(?P<path>{path})\s*\+\s*)?(?:{addr})"
self.oneline_re = re.compile(
fr"^((?:.*(?:(?:at|backtrace):?|:))?(?:\s+))?({token}(?:\s+{token})*)(?:\).*|\s*)$",
flags=re.IGNORECASE,
)
self.address_re = re.compile(full_addr_match, flags=re.IGNORECASE)
self.syslog_re = re.compile(
fr"^(?:#\d+\s+)(?P<addr>{addr})(?:.*\s+)\({ignore_addr_match}\)\s*$",
flags=re.IGNORECASE,
)
self.kernel_re = re.compile(fr'^.*kernel callstack: (?P<addrs>(?:{addr}\s*)+)$')
self.asan_re = re.compile(
fr"^(?:.*\s+)\({full_addr_match}\)(\s+\(BuildId: [0-9a-fA-F]+\))?$",
flags=re.IGNORECASE,
)
self.asan_ignore_re = re.compile(f"^=.*$", flags=re.IGNORECASE)
self.generic_re = re.compile(fr"^(?:.*\s+){full_addr_match}\s*$", flags=re.IGNORECASE)
self.separator_re = re.compile(r'^\W*-+\W*$')
def split_addresses(self, addrstring: str, default_path: Optional[str] = None):
addresses: list[dict[str, Any]] = []
for obj in addrstring.split():
m = re.match(self.address_re, obj)
assert m, f'addr did not match address regex: {obj}'
# print(f" >>> '{obj}': address {m.groups()}")
addresses.append({'path': m.group(1) or default_path, 'addr': m.group(2)})
return addresses
def __call__(self, line: str):
def get_prefix(s: Optional[str]):
if s is not None:
s = s.strip()
return s or None
ret: LineResult
# order here is important: the kernel callstack regex
# needs to come first since it is more specific and would
# otherwise be matched by the online regex which comes next
m = self.kernel_re.match(line)
if m:
return {
'type': self.Type.ADDRESS,
'prefix': 'kernel callstack: ',
'addresses': self.split_addresses(m.group('addrs'), KERNEL_MODULE),
}
m = re.match(self.oneline_re, line)
if m:
# print(f">>> '{line}': oneline {m.groups()}")
return {
'type': self.Type.ADDRESS,
'prefix': get_prefix(m.group(1)),
'addresses': self.split_addresses(m.group(2)),
}
m = re.match(self.syslog_re, line)
if m:
# print(f">>> '{line}': syslog {m.groups()}")
ret = {'type': self.Type.ADDRESS}
ret['prefix'] = None
ret['addresses'] = [{'path': m.group('path'), 'addr': m.group('addr')}]
return ret
m = re.match(self.asan_ignore_re, line)
if m:
# print(f">>> '{line}': asan ignore")
return None
m = re.match(self.asan_re, line)
if m:
# print(f">>> '{line}': asan {m.groups()}")
ret = {'type': self.Type.ADDRESS}
ret['prefix'] = None
ret['addresses'] = [{'path': m.group('path'), 'addr': m.group('addr')}]
return ret
m = re.match(self.generic_re, line)
if m:
# print(f">>> '{line}': generic {m.groups()}")
ret = {'type': self.Type.ADDRESS}
ret['prefix'] = None
ret['addresses'] = [{'path': m.group('path'), 'addr': m.group('addr')}]
return ret
match = re.match(self.separator_re, line)
if match:
return {'type': self.Type.SEPARATOR}
# print(f">>> '{line}': None")
return None
def __init__(
self,
executable: str,
kallsyms: str = '/proc/kallsyms',
before_lines: int = 1,
context_re: Optional[str] = '',
verbose: bool = False,
concise: bool = False,
cmd_path: str = 'addr2line',
debug: bool = False,
):
self._debug = debug
self._executable = executable
self._kallsyms = kallsyms
self._current_backtrace: list[tuple[str, str]] = []
self._prefix = None
self._before_lines = before_lines
self._before_lines_queue: collections.deque[str] = collections.deque(maxlen=before_lines)
self._i = 0
self._known_backtraces: dict[str, int] = {}
if context_re is not None:
self._context_re = re.compile(context_re)
else:
self._context_re = None
self._verbose = verbose
self._concise = concise
self._cmd_path = cmd_path
self._known_modules: dict[str, Union[Addr2Line, KernelResolver]] = {}
self._get_resolver_for_module(
self._executable
) # fail fast if there is something wrong with the exe resolver
self.parser = self.BacktraceParser()
def debug(self, *args: Any):
if self._debug:
print('DEBUG >>', *args, file=sys.stderr)
def _get_resolver_for_module(self, module: str):
if not module in self._known_modules:
if module == KERNEL_MODULE:
resolver = KernelResolver(self, kallsyms=self._kallsyms)
else:
resolver = Addr2Line(self, module, self._concise, self._cmd_path)
self.debug(f'Adding resolver {resolver} for module: {module}')
self._known_modules[module] = resolver
return self._known_modules[module]
def __enter__(self):
return self
def __exit__(self, *_):
self._print_current_backtrace()
@cache
def resolve_address(
self, address: str, module: Optional[str] = None, verbose: Optional[bool] = None
):
if module is None:
module = self._executable
if verbose is None:
verbose = self._verbose
resolved_address = self._get_resolver_for_module(module)(address)
if verbose:
resolved_address = '{{{}}} {}: {}'.format(module, address, resolved_address)
return resolved_address
def _print_resolved_address(self, module: Optional[str], address: str):
sys.stdout.write(self.resolve_address(address, module))
def _backtrace_context_matches(self):
if self._context_re is None:
return True
if any(self._context_re.search(x) for x in self._before_lines_queue):
return True
if (not self._prefix is None) and self._context_re.search(self._prefix):
return True
return False
def _print_current_backtrace(self):
if len(self._current_backtrace) == 0:
return
if not self._backtrace_context_matches():
self._current_backtrace = []
return
for line in self._before_lines_queue:
sys.stdout.write(line)
if not self._prefix is None:
print(self._prefix)
self._prefix = None
backtrace = "".join(map(str, self._current_backtrace))
if backtrace in self._known_backtraces:
print(
"[Backtrace #{}] Already seen, not resolving again.".format(
self._known_backtraces[backtrace]
)
)
print("") # To separate traces with an empty line
self._current_backtrace = []
return
self._known_backtraces[backtrace] = self._i
self.debug(
f'Resolving and printing parsed backtrace with {len(self._current_backtrace)} frames'
)
print("[Backtrace #{}]".format(self._i))
for module, addr in self._current_backtrace:
self._print_resolved_address(module, addr)
print("") # To separate traces with an empty line
self._current_backtrace = []
self._i += 1
def __call__(self, line: str):
res = self.parser(line)
if not res:
self.debug('INPUT LINE [NO MATCH]:', line)
self._print_current_backtrace()
if self._before_lines > 0:
self._before_lines_queue.append(line)
elif self._before_lines < 0:
sys.stdout.write(line) # line already has a trailing newline
else:
pass # when == 0 no non-backtrace lines are printed
elif res['type'] == self.BacktraceParser.Type.SEPARATOR:
self.debug('INPUT LINE [SEPARATOR]:', line)
pass
elif res['type'] == self.BacktraceParser.Type.ADDRESS:
self.debug('INPUT LINE [ADDRESS]:', line)
addresses = cast(list[dict[str, Any]], res['addresses'])
if len(addresses) > 1:
self._print_current_backtrace()
if len(self._current_backtrace) == 0:
self._prefix = cast(Union[str, None], res['prefix'])
for r in addresses:
if r['path']:
self._current_backtrace.append((r['path'], r['addr']))
else:
self._current_backtrace.append((self._executable, r['addr']))
if len(addresses) > 1:
self._print_current_backtrace()
else:
self.debug('INPUT LINE [UNKNOWN]:', line)
print(f"Unknown '{line}': {res}")
raise RuntimeError("Unknown result type {res}")
|