[DAPHNE–#696] Cost-aware function specialization

[XejgaToast]

Batur (Exion007) + Ahmad (XejgaToast)

Naming convention

• Added a new naming convention of specialized Functions (more readable IR)
• Added a duplicate specialization prevention (no duplicate specializations anymore) depending on the naming convention

Recursion Detection/Prevention in specialization

• Added a call graph to keep track of recursion
• Added a recursion detection and prevention with an hard coded upper limit of 5 recursive calls per recursive cycle to prevent too many specializations

Removal of non-beneficial specializations

• Added a hash map to keep track of function bodies and compare them to find potentially equal functions with different names
• Delete specialized functions which already have an equal function and replace callee attributes to point to existing function

Documentation

• Added documentation for the Specialization Pass itself
• Adjusted documentation for a couple of functions

[pdamme]

Thanks @XejgaToast and @Exion007 for this contribution. Solving the task described in #696 is very welcome. I will make an initial pass over this PR soon.

[Exion007]

Added new test script

This test script tests 3 aspects simultaneously by comparing the IR with the expected IR output (specializeIRTest.txt), which are the following:

• Similar Function detection and prevention (function c is expected to be replaced with function b)
• Recursion detection and prevention (function a is expected to only have 5 recursive calls, meaning 6 specializations)
• Naming Convention (All function names in the IR should follow the naming convention)