Detection of statically linked functions in order to analyse as little as possible

This is a very interesting project. It is a lot of fun and joy to experiment with the program. Especially if you work with examples from before and after. I only noticed the following:

When I create a small program, an incredible number of static functions are integrated and linked. With the GCC, for example, this is really a lot, and so a tiny program quickly turns into one with several megabytes. As a result, the result suffers, of course, or, as described in other issues, the memory load. But actually there are only a few classes and program parts, which I built myself to analyze.

Shouldn't the analysis phase be optimized? The standard functions would have to be filtered out, and the result would have to be significantly reduced. Is it planned to be made available at some point? Apart from that, there are already problems with the crazy little test programs with the GNU Compiler Collection, which even lead to the fact that you can't decompile your own program. I didn't really manage to analyze bigger programs > 1 MB, although they didn't really contain much in the core....

No files, tests, or entry points are named. Start by reproducing the issue with a small GCC-linked program and measure how the analysis behaves as static functions and binary size increase. The scope is not defined: completion would require an agreed approach for filtering standard functions and handling larger programs without preventing decompilation.

Written by the indexing model from the issue text.