Skip to content

Latest commit

 

History

History
36 lines (30 loc) · 1.54 KB

README.md

File metadata and controls

36 lines (30 loc) · 1.54 KB

Generic search for the minimal distance to a target in llvm bitcode

This project provides a stand-alone version of a search algorithm for an arbitrary target in bitcode files. Given a starting point inside a program, the search finds the shortest path to an instruction qualified as a target using Dijkstra's algorithm. Thereby, it is considering the call hierarchy on the stack, as well as avoiding endless loops or infinite recursions. It provides a small interface, where own definitions of target instructions and distance measures can be implemented.

Possible targets are:

  • a call to a specific function
  • the end of a specific function
  • a failing assert statement
  • a specific line of code using debug information inside the bitcode
  • (for testing) no target at all to traverse the whole program

Possible distance measures are:

  • the number of passed instructions
  • the number of decisions taken
  • any complex heuristic that you can think of using positive integers

For implementing your own measures/targets, just add new inheritances for the StratDistance/StratTarget class.

Build instructions

This project heavily relies on LLVM. So before doing anything install LLVM on your machine or build it on your own from its sources.

make all test

or if you need a local version of LLVM

make LLVM_SRC_PATH=<DirOfYourLLVMSrc> all test

or if you have followed our build instruction

make LLVM_SRC_PATH=~/build/llvm all test