Read in a crash or oops-style backtrace and access DWARF information to output the current content of the stack and registers in term of symbols, and the the crash commands to dump/pretty print them. In other words, when looking at a crash dump, answer the questions "Which variable is currently stored in $rax? What is the structure of the stack? Which variable is stored at $rsp+16?"

Status at the end of hackweek 10

git-sort is a a tool that reads a list of git commits and sorts them so that the partial ordering of parent-child relationships is respected. It performs this as a stable sort; it preserves the input order of commits that are on parallel development branches. This tool is useful when backporting a large number of commits so that the commits may be cherry-picked in an order such that no child commit appears before any of its ancestors. The current implementation of git-sort is a proof of concept that uses git merge-base --is-ancestor. Having a more efficient version would ease the handling of large input lists.

New Development In previous hack weeks, the first few days ended up being wasted on just getting it working. I'm pleased to share that the code quality has improved dramatically since the last hack week and there are now extensive test cases for both unit testing and testing against real vmcores, and we'll use both mypy and pylint (if installed) to perform static analysis. Packages for those are available in openSUSE or as part of the crash-python OBS repo for SLE15. It has been tested with kernels from 3.0 to 5.1.