Improving partial evaluator, needed for permutation fusion.
Fused permutations in interleaving.
Fixed a clean-related problem in the Makefile.
Small test for permutation fusion.
Optimizing assignments where RHS is a call to reuse storage.
Pushed modification to bit-related code generation.
Updated performance numbers
Further specializing memcopies in LUTs
Fixed inlining behaviour. This commit vastly improves the performance
of the unit tests in the TX pipeline.
Some more small optimizations regarding array reads/writes plus fixing
an incompleteness in the elimination of mitigators which hurt
performance of the QPSK modulator.
Use separate lexer
Minor fixes
Improve error messages
Special-casing the LUT packing of sub-byte index variables to avoid
creating unsigned int * pointers. Huge perf improvements as a result.
For bit-arrays < 128 bit size, we we performing parallel "or" byte by
byte(!) Ths patch provides specialized paths that use 64-bit and 32-bit
or operations.
Rewrite modulating qpsk in a more natural *and* more efficient way.
Made unpacking code more generic *and* more efficient by reusing the optimized assignByVal function.
Further optimizations: specializing permutation and interlaving code,
and re-using LUT-allocated space for anonymous returned values instead
of allocating and memcopying.
Merge branch 'release' of https://github.com/dimitriv/Ziria into release
Small tweak in the vectorizaiton annotation of the scrambler.