| 1 |
2 |
alfik |
/*
|
| 2 |
|
|
* Copyright (c) 2014, Aleksander Osman
|
| 3 |
|
|
* All rights reserved.
|
| 4 |
|
|
*
|
| 5 |
|
|
* Redistribution and use in source and binary forms, with or without
|
| 6 |
|
|
* modification, are permitted provided that the following conditions are met:
|
| 7 |
|
|
*
|
| 8 |
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
| 9 |
|
|
* list of conditions and the following disclaimer.
|
| 10 |
|
|
*
|
| 11 |
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
| 12 |
|
|
* this list of conditions and the following disclaimer in the documentation
|
| 13 |
|
|
* and/or other materials provided with the distribution.
|
| 14 |
|
|
*
|
| 15 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 16 |
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 17 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 18 |
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
| 19 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 20 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 21 |
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 22 |
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 23 |
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 24 |
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 25 |
|
|
*/
|
| 26 |
|
|
|
| 27 |
|
|
package ao486.test.arithmetic_logic;
|
| 28 |
|
|
|
| 29 |
|
|
import ao486.test.TestUnit;
|
| 30 |
|
|
import static ao486.test.TestUnit.run_test;
|
| 31 |
|
|
import ao486.test.layers.FlagsLayer;
|
| 32 |
|
|
import ao486.test.layers.GeneralRegisterLayer;
|
| 33 |
|
|
import ao486.test.layers.HandleModeChangeLayer;
|
| 34 |
|
|
import ao486.test.layers.IOLayer;
|
| 35 |
|
|
import ao486.test.layers.InstructionLayer;
|
| 36 |
|
|
import ao486.test.layers.MemoryLayer;
|
| 37 |
|
|
import ao486.test.layers.OtherLayer;
|
| 38 |
|
|
import ao486.test.layers.Pair;
|
| 39 |
|
|
import ao486.test.layers.SegmentLayer;
|
| 40 |
|
|
import ao486.test.layers.StackLayer;
|
| 41 |
|
|
import java.io.Serializable;
|
| 42 |
|
|
import java.util.LinkedList;
|
| 43 |
|
|
import java.util.Random;
|
| 44 |
|
|
|
| 45 |
|
|
public class TestXADD extends TestUnit implements Serializable {
|
| 46 |
|
|
public static void main(String args[]) throws Exception {
|
| 47 |
|
|
run_test(TestXADD.class);
|
| 48 |
|
|
}
|
| 49 |
|
|
|
| 50 |
|
|
//--------------------------------------------------------------------------
|
| 51 |
|
|
@Override
|
| 52 |
|
|
public int get_test_count() throws Exception {
|
| 53 |
|
|
return 100;
|
| 54 |
|
|
}
|
| 55 |
|
|
|
| 56 |
|
|
@Override
|
| 57 |
|
|
public void init() throws Exception {
|
| 58 |
|
|
|
| 59 |
|
|
random = new Random(3+index);
|
| 60 |
|
|
|
| 61 |
|
|
String instruction;
|
| 62 |
|
|
while(true) {
|
| 63 |
|
|
layers.clear();
|
| 64 |
|
|
|
| 65 |
|
|
LinkedList<Pair<Long, Long>> prohibited_list = new LinkedList<>();
|
| 66 |
|
|
|
| 67 |
|
|
InstructionLayer instr = new InstructionLayer(random, prohibited_list);
|
| 68 |
|
|
layers.add(instr);
|
| 69 |
|
|
layers.add(new StackLayer(random, prohibited_list));
|
| 70 |
|
|
layers.add(new OtherLayer(OtherLayer.Type.RANDOM, random));
|
| 71 |
|
|
layers.add(new FlagsLayer(FlagsLayer.Type.RANDOM, random));
|
| 72 |
|
|
layers.add(new GeneralRegisterLayer(random));
|
| 73 |
|
|
layers.add(new SegmentLayer(random));
|
| 74 |
|
|
layers.add(new MemoryLayer(random));
|
| 75 |
|
|
layers.add(new IOLayer(random));
|
| 76 |
|
|
layers.addFirst(new HandleModeChangeLayer(
|
| 77 |
|
|
getInput("cr0_pe"),
|
| 78 |
|
|
getInput("vmflag"),
|
| 79 |
|
|
getInput("cs_rpl"),
|
| 80 |
|
|
getInput("cs_p"),
|
| 81 |
|
|
getInput("cs_s"),
|
| 82 |
|
|
getInput("cs_type")
|
| 83 |
|
|
));
|
| 84 |
|
|
|
| 85 |
|
|
// instruction size
|
| 86 |
|
|
boolean cs_d_b = getInput("cs_d_b") == 1;
|
| 87 |
|
|
|
| 88 |
|
|
boolean a32 = random.nextBoolean();
|
| 89 |
|
|
boolean o32 = random.nextBoolean();
|
| 90 |
|
|
|
| 91 |
|
|
// instruction
|
| 92 |
|
|
instruction = prepare_instr(cs_d_b, a32, o32, null);
|
| 93 |
|
|
|
| 94 |
|
|
instruction += "0F0F";
|
| 95 |
|
|
|
| 96 |
|
|
// add instruction
|
| 97 |
|
|
instr.add_instruction(instruction);
|
| 98 |
|
|
|
| 99 |
|
|
// end condition
|
| 100 |
|
|
break;
|
| 101 |
|
|
}
|
| 102 |
|
|
|
| 103 |
|
|
System.out.println("Instruction: [" + instruction + "]");
|
| 104 |
|
|
}
|
| 105 |
|
|
|
| 106 |
|
|
int imm_len(boolean a16, int opcode) {
|
| 107 |
|
|
int l = opcode & 0x0F;
|
| 108 |
|
|
int h = (opcode >> 4) & 0x0F;
|
| 109 |
|
|
|
| 110 |
|
|
if((h == 0xA && l == 0x8) || (h == 0xF && l == 0x6)) return 1;
|
| 111 |
|
|
if((h == 0xA && l == 0x9) || (h == 0xF && l == 0x7)) return (a16)? 2 : 4;
|
| 112 |
|
|
|
| 113 |
|
|
return 0;
|
| 114 |
|
|
}
|
| 115 |
|
|
|
| 116 |
|
|
String prepare_instr(boolean cs_d_b, boolean a32, boolean o32, byte modregrm_bytes[]) throws Exception {
|
| 117 |
|
|
|
| 118 |
|
|
int opcodes[] = {
|
| 119 |
|
|
0xC0,0xC1
|
| 120 |
|
|
};
|
| 121 |
|
|
|
| 122 |
|
|
String prefix = "";
|
| 123 |
|
|
if(cs_d_b != o32) { prefix = "66" + prefix; }
|
| 124 |
|
|
if(cs_d_b != a32) { prefix = "67" + prefix; }
|
| 125 |
|
|
|
| 126 |
|
|
int opcode = opcodes[random.nextInt(opcodes.length)];
|
| 127 |
|
|
boolean is_modregrm = true;
|
| 128 |
|
|
|
| 129 |
|
|
byte possible_modregrm = (byte)random.nextInt();
|
| 130 |
|
|
byte possible_sib = (byte)random.nextInt();
|
| 131 |
|
|
|
| 132 |
|
|
int len = (is_modregrm == false)? 1 : 1 + modregrm_len(!a32, unsigned(possible_modregrm), unsigned(possible_sib));
|
| 133 |
|
|
System.out.println("[len final: " + len + "]");
|
| 134 |
|
|
|
| 135 |
|
|
byte instr[] = new byte[len];
|
| 136 |
|
|
instr[0] = (byte)opcode;
|
| 137 |
|
|
for(int i=1; i<len; i++) {
|
| 138 |
|
|
if(i==1) instr[1] = possible_modregrm;
|
| 139 |
|
|
else if(i==2) instr[2] = possible_sib;
|
| 140 |
|
|
else instr[i] = (byte)random.nextInt();
|
| 141 |
|
|
}
|
| 142 |
|
|
|
| 143 |
|
|
return prefix + "0F" + bytesToHex(instr);
|
| 144 |
|
|
}
|
| 145 |
|
|
}
|