Finds the shortest instruction sequence for a given function
GSO is a function sequence generator that uses exhaustive generate-and-test approach to find the shortest instruction sequence for a given function. You must tell the superoptimizer which function and which CPU you want to get code for. It cannot generate very long sequences unless you have a very fast computer.
This is a GNU package:superopt
released on 3 June 1995
This entry (in part or in whole) was last reviewed on 7 September 2010.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.