PPhying中文
Curated security research, vulnerabilities, advisories and tools for practitioners.

C your data structures with rellic-headergen

blog.trailofbits.com | blog | #reverse-engineering | #static-analysis | #tool-release | #llvm | #compilers | #c-plus-plus | #memory-layout
📄 Raw .md⬇️ Download .md🔗 Original ↗

Summary

rellic-headergen converts LLVM bitcode debug information into equivalent C type definitions, making it easier to reason about memory layouts of complex C++ types with templates and inheritance.
Published
Collected

Related coverage

blog · blog.trailofbits.com
ReMASTering Applications by Obfuscating during Compilation
Introducing MAST, an LLVM-based obfuscation toolkit: symbol mangling, opaque predicates, code diffusion and environmental keying, inspired by nation-state malware; funded via DARPA Cyber Fast Track.
blog · blog.trailofbits.com
Using Static Analysis and Clang To Find Heartbleed
Trail of Bits built a Clang analyzer plugin that statically detects Heartbleed-style bugs: it taints ntohl/ntohs return values and flags unconstrained data used as memcpy sizes, tested on OpenSSL.
research · blog.quarkslab.com
Implementing a Custom Directive Handler in Clang
How-to on implementing a custom #pragma directive handler in clang, used to drive an LLVM-based obfuscator while keeping sources compilable elsewhere; a tour of the preprocessing and parsing stages.
research · blog.quarkslab.com
llvm_dev_meeting:
Report from the 2015 LLVM Developer Meeting: Quarkslab's out-of-tree pass tutorial and a lightning talk on LLVM's limits, plus recaps of talks on WebAssembly, OpenCL and performance tracking.
research · blog.quarkslab.com
goto llvm_dev_meeting;
Announcement: Quarkslab's compiler crew is off to the LLVM Developer Meeting in California, presenting an out-of-tree LLVM pass tutorial and a lightning talk on bytecode obfuscation.
research · blog.quarkslab.com
Turning Regular Code Into Atrocities With LLVM: The Return
LLVM obfuscation tutorial, part two: a pass that hides XOR operations by converting operands from base 2 to base 3 before adding them, turning a simple xor into a much harder-to-recognise sequence.
Back