| Class Tree | |
|---|---|
| Description |
These are a series of tests of the search component of TOAST. They are for four different input sequences and search for a variety of diff erent lengths of code sequence. For example sequence3-ss2 searches for things matching sequence3 in the space of two instructions. All of the programs related to a given sequence should ground to the same number of atoms (using lparse) and all of the programs that search over ssN should have the same raw search space size, thus it is possible to independantly vary the size of grounding and the size of search spa ce. Searches are over the SPARC-v7 architecture. These tests are different from the plain version of the search space test is the way the search spaces are restricted (i.e. sequenceX-ssY w here X > Y), in the case of the verbose tests this is done to give additional answer sets, to aid testing / development of solvers. Sequence 1 ---------- ! input in %i0, %i1 add %i0 %i1 %o1 or %o1 %o1 %g0 or %o1 %o1 %g0 or %o1 %o1 %g0 ! output in %o1 Sequence 2 ---------- ! input in %i0, %i1 add %i0 %i1 %l1 add %i0 %l1 %o1 or %o1 %o1 %g0 or %o1 %o1 %g0 ! output in %o1 Sequence3 --------- ! input in %i0, %i1 add %i0 %i1 %l1 add %i0 %i1 %l2 add %l1 %l2 %l3 sub %g0 %l3 %o1 ! output in %o1 Sequence4 --------- ! input in %i0, %i1 and %i0 %i1 %l1 add %i0 %l1 %l2 add %i0 %l2 %l3 sub %g0 %l3 %o1 ! output in %o1 Author: Martin Brain |
| Encodings 1 - 1 of 1 |
|
Expand All
Collapse All
