mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

about summary refs log tree commit diff stats

path: root/html/064list.mu.html

	Commit message (Expand)	Author	Age	Files	Lines
*	4239	Kartik Agaram	2018-05-08	1	-5/+5
*	4200	Kartik K. Agaram	2018-01-27	1	-106/+106
*	4199	Kartik K. Agaram	2018-01-25	1	-195/+194
*	4165	Kartik K. Agaram	2017-12-27	1	-4/+4
*	4161	Kartik K. Agaram	2017-12-15	1	-6/+6
*	4134 - 'input' = 'ingredient'	Kartik K. Agaram	2017-12-03	1	-12/+12
*	4008	Kartik K. Agaram	2017-09-25	1	-355/+354
*	4003	Kartik K. Agaram	2017-09-23	1	-5/+5
*	3901	Kartik K. Agaram	2017-06-09	1	-2/+2
*	3895	Kartik K. Agaram	2017-05-29	1	-34/+34
*	3883	Kartik K. Agaram	2017-05-27	1	-62/+75
*	3837	Kartik K. Agaram	2017-04-19	1	-2/+2
*	3830 - crosslink shape-shifting containers in html	Kartik K. Agaram	2017-04-18	1	-73/+73
*	3829	Kartik K. Agaram	2017-04-18	1	-5/+5
*	3808 - 'length' for duplex lists	Kartik K. Agaram	2017-03-31	1	-295/+298
*	3764 - better colors for cross-links	Kartik K. Agaram	2017-03-08	1	-3/+4
*	3761	Kartik K. Agaram	2017-03-07	1	-128/+129
*	3716	Kartik K. Agaram	2016-12-26	1	-0/+2
*	3713 - cross-link calls with definitions in html	Kartik K. Agaram	2016-12-26	1	-50/+50
*	3710	Kartik K. Agaram	2016-12-26	1	-351/+351
*	3709 - line numbers in html	Kartik K. Agaram	2016-12-26	1	-354/+378
*	3667	Kartik K. Agaram	2016-11-11	1	-2/+2
*	3569	Kartik K. Agaram	2016-10-23	1	-160/+160
*	3524	Kartik K. Agaram	2016-10-20	1	-4/+5
*	3431	Kartik K. Agaram	2016-09-30	1	-5/+5
*	3430	Kartik K. Agaram	2016-09-28	1	-34/+45
*	3420	Kartik K. Agaram	2016-09-27	1	-0/+28
*	3395	Kartik K. Agaram	2016-09-17	1	-66/+66
*	3355	Kartik K. Agaram	2016-09-15	1	-2/+2
*	3102	Kartik K. Agaram	2016-07-05	1	-0/+349

diate " e8 a0 00 00 00 \n" // call function offset at 0xa0 // next EIP is 6 ); CHECK_TRACE_CONTENTS( "run: call imm32 0x000000a0\n" "run: decrementing ESP to 0xbd000060\n" "run: pushing value 0x00000006\n" "run: jumping to 0x000000a6\n" ); } :(before "End Single-Byte Opcodes") case 0xe8: { // call disp32 relative to next EIP const int32_t offset = next32(); ++Callstack_depth; trace(Callstack_depth+1, "run") << "call imm32 0x" << HEXWORD << offset << end(); //? cerr << "push: EIP: " << EIP << " => " << Reg[ESP].u << '\n'; push(EIP); EIP += offset; trace(Callstack_depth+1, "run") << "jumping to 0x" << HEXWORD << EIP << end(); break; } //: :(code) void test_call_r32() { Mem.push_back(vma(0xbd000000)); // manually allocate memory Reg[ESP].u = 0xbd000064; Reg[EBX].u = 0x000000a0; run( "== code 0x1\n" // op ModR/M SIB displacement immediate " ff d3 \n" // call function offset at EBX // next EIP is 3 ); CHECK_TRACE_CONTENTS( "run: call to r/m32\n" "run: r/m32 is EBX\n" "run: decrementing ESP to 0xbd000060\n" "run: pushing value 0x00000003\n" "run: jumping to 0x000000a0\n" ); } :(before "End Op ff Subops") case 2: { // call function pointer at r/m32 trace(Callstack_depth+1, "run") << "call to r/m32" << end(); const int32_t* offset = effective_address(modrm); push(EIP); EIP = *offset; trace(Callstack_depth+1, "run") << "jumping to 0x" << HEXWORD << EIP << end(); ++Callstack_depth; break; } :(code) void test_call_mem_at_rm32() { Mem.push_back(vma(0xbd000000)); // manually allocate memory Reg[ESP].u = 0xbd000064; Reg[EBX].u = 0x2000; run( "== code 0x1\n" // op ModR/M SIB displacement immediate " ff 13 \n" // call function offset at *EBX // next EIP is 3 "== data 0x2000\n" "a0 00 00 00\n" // 0xa0 ); CHECK_TRACE_CONTENTS( "run: call to r/m32\n" "run: effective address is 0x00002000 (EBX)\n" "run: decrementing ESP to 0xbd000060\n" "run: pushing value 0x00000003\n" "run: jumping to 0x000000a0\n" ); } //:: ret :(before "End Initialize Op Names") put_new(Name, "c3", "return from most recent unfinished call (ret)"); :(code) void test_ret() { Mem.push_back(vma(0xbd000000)); // manually allocate memory Reg[ESP].u = 0xbd000064; write_mem_u32(Reg[ESP].u, 0x10); run( "== code 0x1\n" // op ModR/M SIB displacement immediate " c3 \n" // return "== data 0x2000\n" "10 00 00 00\n" // 0x10 ); CHECK_TRACE_CONTENTS( "run: return\n" "run: popping value 0x00000010\n" "run: jumping to 0x00000010\n" ); } :(before "End Single-Byte Opcodes") case 0xc3: { // return from a call trace(Callstack_depth+1, "run") << "return" << end(); --Callstack_depth; EIP = pop(); trace(Callstack_depth+1, "run") << "jumping to 0x" << HEXWORD << EIP << end(); break; }