xbyak/test/jmp.cpp

662 lines
13 KiB
C++
Raw Normal View History

2010-04-16 01:33:04 +00:00
#include <stdio.h>
#include <string.h>
2012-03-19 15:07:29 +00:00
#include <string>
#include <xbyak/xbyak.h>
2010-04-16 01:33:04 +00:00
#define NUM_OF_ARRAY(x) (sizeof(x) / sizeof(x[0]))
2012-03-19 15:07:29 +00:00
#if !defined(_WIN64) && !defined(__x86_64__)
#define ONLY_32BIT
#endif
2010-04-16 01:33:04 +00:00
using namespace Xbyak;
2012-03-19 15:07:29 +00:00
struct TestJmp : public Xbyak::CodeGenerator {
2010-04-16 01:33:04 +00:00
void putNop(int n)
{
for (int i = 0; i < n; i++) {
nop();
}
}
/*
4 X0:
5 00000004 EBFE jmp short X0
6
7 X1:
8 00000006 <res 00000001> dummyX1 resb 1
9 00000007 EBFD jmp short X1
10
11 X126:
12 00000009 <res 0000007E> dummyX126 resb 126
13 00000087 EB80 jmp short X126
14
15 X127:
16 00000089 <res 0000007F> dummyX127 resb 127
17 00000108 E97CFFFFFF jmp near X127
18
19 0000010D EB00 jmp short Y0
20 Y0:
21
22 0000010F EB01 jmp short Y1
23 00000111 <res 00000001> dummyY1 resb 1
24 Y1:
25
26 00000112 EB7F jmp short Y127
27 00000114 <res 0000007F> dummyY127 resb 127
28 Y127:
29
30 00000193 E980000000 jmp near Y128
31 00000198 <res 00000080> dummyY128 resb 128
32 Y128:
*/
TestJmp(int offset, bool isBack, bool isShort)
{
if (isBack) {
2012-03-19 15:07:29 +00:00
L("@@");
2010-04-16 01:33:04 +00:00
putNop(offset);
2012-03-19 15:07:29 +00:00
jmp("@b");
2010-04-16 01:33:04 +00:00
} else {
if (isShort) {
2012-03-19 15:07:29 +00:00
jmp("@f");
2010-04-16 01:33:04 +00:00
} else {
2012-03-19 15:07:29 +00:00
jmp("@f", T_NEAR);
2010-04-16 01:33:04 +00:00
}
putNop(offset);
2012-03-19 15:07:29 +00:00
L("@@");
2010-04-16 01:33:04 +00:00
}
}
};
2012-03-16 06:47:23 +00:00
void test1()
2010-04-16 01:33:04 +00:00
{
static const struct Tbl {
int offset;
bool isBack;
bool isShort;
2012-03-19 15:07:29 +00:00
uint8 result[6];
int size;
2010-04-16 01:33:04 +00:00
} tbl[] = {
2012-03-19 15:07:29 +00:00
{ 0, true, true, { 0xeb, 0xfe }, 2 },
{ 1, true, true, { 0xeb, 0xfd }, 2 },
{ 126, true, true, { 0xeb, 0x80 }, 2 },
{ 127, true, false, {0xe9, 0x7c, 0xff, 0xff, 0xff }, 5 },
{ 0, false, true, { 0xeb, 0x00 }, 2 },
{ 1, false, true, { 0xeb, 0x01 }, 2 },
{ 127, false, true, { 0xeb, 0x7f }, 2 },
{ 128, false, false, { 0xe9, 0x80, 0x00, 0x00, 0x00 }, 5 },
2010-04-16 01:33:04 +00:00
};
for (size_t i = 0; i < NUM_OF_ARRAY(tbl); i++) {
2010-04-16 01:33:04 +00:00
const Tbl *p = &tbl[i];
TestJmp jmp(p->offset, p->isBack, p->isShort);
const uint8 *q = (const uint8*)jmp.getCode();
if (p->isBack) q += p->offset; /* skip nop */
2012-03-19 15:07:29 +00:00
for (int j = 0; j < p->size; j++) {
if (q[j] != p->result[j]) {
printf("err (%d,%d) %02x assume=%02x\n", (int)i, j, q[j], p->result[j]);
}
}
}
puts("ok");
}
struct TestJmp2 : public CodeGenerator {
void putNop(int n)
{
for (int i = 0; i < n; i++) {
nop();
2010-04-16 01:33:04 +00:00
}
2012-03-19 15:07:29 +00:00
}
/*
1 00000000 90 nop
2 00000001 90 nop
3 f1:
4 00000002 <res 0000007E> dummyX1 resb 126
6 00000080 EB80 jmp f1
7
8 f2:
9 00000082 <res 0000007F> dummyX2 resb 127
11 00000101 E97CFFFFFF jmp f2
12
13
14 00000106 EB7F jmp f3
15 00000108 <res 0000007F> dummyX3 resb 127
17 f3:
18
19 00000187 E980000000 jmp f4
20 0000018C <res 00000080> dummyX4 resb 128
22 f4:
*/
explicit TestJmp2(void *p)
: Xbyak::CodeGenerator(8192, p)
{
inLocalLabel();
nop();
nop();
L(".f1");
putNop(126);
jmp(".f1");
L(".f2");
putNop(127);
jmp(".f2", T_NEAR);
jmp(".f3");
putNop(127);
L(".f3");
jmp(".f4", T_NEAR);
putNop(128);
L(".f4");
outLocalLabel();
}
};
2013-03-13 06:22:35 +00:00
struct TestJmpCx : public CodeGenerator {
explicit TestJmpCx(void *p)
: Xbyak::CodeGenerator(16, p)
{
inLocalLabel();
L(".lp");
#ifdef XBYAK64
puts("TestJmpCx 64bit");
/*
67 E3 FD ; jecxz lp
E3 FB ; jrcxz lp
*/
jecxz(".lp");
jrcxz(".lp");
#else
puts("TestJmpCx 32bit");
/*
E3FE ; jecxz lp
67E3FB ; jcxz lp
*/
jecxz(".lp");
jcxz(".lp");
#endif
outLocalLabel();
}
};
void testJmpCx()
{
const struct {
const char *p;
size_t len;
} tbl = {
#ifdef XBYAK64
"\x67\xe3\xfd\xe3\xfb", 5
#else
"\xe3\xfe\x67\xe3\xfb", 5
#endif
};
char buf[16] = {};
TestJmpCx code(buf);
if (memcmp(buf, tbl.p, tbl.len) == 0) {
puts("ok");
} else {
puts("ng");
for (int i = 0; i < 8; i++) {
printf("%02x ", (unsigned char)buf[i]);
}
printf("\n");
}
}
2013-03-25 03:08:13 +00:00
#ifdef _MSC_VER
#pragma warning(disable : 4310)
#endif
2012-03-19 15:07:29 +00:00
void test2()
{
puts("test2");
std::string ok;
ok.resize(0x18C + 128, (char)0x90);
ok[0x080] = (char)0xeb;
ok[0x081] = (char)0x80;
ok[0x101] = (char)0xe9;
ok[0x102] = (char)0x7c;
ok[0x103] = (char)0xff;
ok[0x104] = (char)0xff;
ok[0x105] = (char)0xff;
ok[0x106] = (char)0xeb;
ok[0x107] = (char)0x7f;
ok[0x187] = (char)0xe9;
ok[0x188] = (char)0x80;
ok[0x189] = (char)0x00;
ok[0x18a] = (char)0x00;
ok[0x18b] = (char)0x00;
for (int j = 0; j < 2; j++) {
TestJmp2 c(j == 0 ? 0 : Xbyak::AutoGrow);
c.ready();
std::string m((const char*)c.getCode(), c.getSize());
if (m.size() != ok.size()) {
printf("test2 err %d %d\n", (int)m.size(), (int)ok.size());
2010-04-16 01:33:04 +00:00
} else {
2012-03-19 15:07:29 +00:00
if (m != ok) {
for (size_t i = 0; i < m.size(); i++) {
if (m[i] != ok[i]) {
printf("diff 0x%03x %02x %02x\n", (int)i, (unsigned char)m[i], (unsigned char)ok[i]);
}
}
} else {
puts("ok");
}
2010-04-16 01:33:04 +00:00
}
}
}
2012-03-16 06:47:23 +00:00
2012-03-19 15:07:29 +00:00
#ifdef ONLY_32BIT
2012-03-16 06:47:23 +00:00
int add5(int x) { return x + 5; }
int add2(int x) { return x + 2; }
struct Grow : Xbyak::CodeGenerator {
Grow(int dummySize)
: Xbyak::CodeGenerator(128, Xbyak::AutoGrow)
{
mov(eax, 100);
push(eax);
2012-03-16 14:14:55 +00:00
call((void*)add5);
2012-03-16 06:47:23 +00:00
add(esp, 4);
push(eax);
2012-03-16 14:14:55 +00:00
call((void*)add2);
2012-03-16 06:47:23 +00:00
add(esp, 4);
ret();
for (int i = 0; i < dummySize; i++) {
db(0);
}
}
};
2012-03-19 15:07:29 +00:00
void test3()
2012-03-16 06:47:23 +00:00
{
for (int dummySize = 0; dummySize < 40000; dummySize += 10000) {
printf("dummySize=%d\n", dummySize);
Grow g(dummySize);
g.ready();
int (*f)() = (int (*)())g.getCode();
int x = f();
const int ok = 107;
if (x != ok) {
printf("err %d assume %d\n", x, ok);
} else {
printf("ok\n");
}
}
}
2012-03-19 15:07:29 +00:00
#endif
Xbyak::uint8 bufL[4096 * 32];
Xbyak::uint8 bufS[4096 * 2];
struct MyAllocator : Xbyak::Allocator {
Xbyak::uint8 *alloc(size_t size)
{
if (size < sizeof(bufS)) {
printf("use bufS(%d)\n", (int)size);
return bufS;
}
if (size < sizeof(bufL)) {
printf("use bufL(%d)\n", (int)size);
return bufL;
}
fprintf(stderr, "no memory %d\n", (int)size);
exit(1);
}
void free(Xbyak::uint8 *)
{
}
} myAlloc;
void dump(const std::string& m)
{
printf("size=%d\n ", (int)m.size());
for (int i = 0; i < 16; i++) {
printf("%02x ", i);
}
printf("\n ");
for (int i = 0; i < 16; i++) {
printf("---");
}
printf("\n");
for (size_t i = 0; i < m.size(); i++) {
if ((i % 16) == 0) printf("%04x ", (int)(i / 16));
printf("%02x ", (unsigned char)m[i]);
if ((i % 16) == 15) putchar('\n');
}
putchar('\n');
}
void diff(const std::string& a, const std::string& b)
{
puts("diff");
if (a.size() != b.size()) printf("size diff %d %d\n", (int)a.size(), (int)b.size());
for (size_t i = 0; i < a.size(); i++) {
if (a[i] != b[i]) {
printf("diff %d(%04x) %02x %02x\n", (int)i, (int)i, (unsigned char)a[i], (unsigned char)b[i]);
}
}
puts("end");
}
struct Test4 : Xbyak::CodeGenerator {
explicit Test4(int size, void *mode)
: CodeGenerator(size, mode)
{
using namespace Xbyak;
inLocalLabel();
outLocalLabel();
jmp(".x");
for (int i = 0; i < 10; i++) {
nop();
}
L(".x");
ret();
}
};
void test4()
{
std::string fm, gm;
Test4 fc(1024, 0);
Test4 gc(5, Xbyak::AutoGrow);
gc.ready();
fm.assign((const char*)fc.getCode(), fc.getSize());
gm.assign((const char*)gc.getCode(), gc.getSize());
// dump(fm);
// dump(gm);
diff(gm, gm);
}
struct Test5 : Xbyak::CodeGenerator {
explicit Test5(int size, int count, void *mode)
: CodeGenerator(size, mode, &myAlloc)
{
using namespace Xbyak;
inLocalLabel();
mov(ecx, count);
xor(eax, eax);
L(".lp");
for (int i = 0; i < count; i++) {
2013-09-17 23:34:57 +00:00
L(Label::toStr(i));
2012-03-19 15:07:29 +00:00
add(eax, 1);
int to = 0;
if (i < count / 2) {
to = count - 1 - i;
} else {
to = count - i;
}
if (i == count / 2) {
jmp(".exit", T_NEAR);
} else {
2013-09-17 23:34:57 +00:00
jmp(Label::toStr(to), T_NEAR);
2012-03-19 15:07:29 +00:00
}
}
L(".exit");
sub(ecx, 1);
jnz(".lp", T_NEAR);
ret();
outLocalLabel();
}
};
void test5()
{
std::string fm, gm;
const int count = 50;
int ret;
Test5 fc(1024 * 64, count, 0);
ret = ((int (*)())fc.getCode())();
if (ret != count * count) {
printf("err ret=%d, %d\n", ret, count * count);
} else {
puts("ok");
}
fm.assign((const char*)fc.getCode(), fc.getSize());
Test5 gc(10, count, Xbyak::AutoGrow);
gc.ready();
#if 0
ret = ((int (*)())gc.getCode())();
if (ret != count * count) {
printf("err ret=%d, %d\n", ret, count * count);
} else {
puts("ok");
}
#endif
gm.assign((const char*)gc.getCode(), gc.getSize());
diff(fm, gm);
}
2012-03-16 06:47:23 +00:00
2013-03-25 03:08:13 +00:00
struct MovLabelCode : Xbyak::CodeGenerator {
MovLabelCode(bool grow)
: Xbyak::CodeGenerator(grow ? 128 : 4096, grow ? Xbyak::AutoGrow : 0)
{
#ifdef XBYAK64
const Reg64& a = rax;
#else
const Reg32& a = eax;
#endif
inLocalLabel();
nop(); // 0x90
L(".lp1");
nop();
mov(a, ".lp1"); // 0xb8 + <4byte> / 0x48bb + <8byte>
nop();
mov(a, ".lp2"); // 0xb8
// force realloc if AutoGrow
for (int i = 0; i < 256; i++) {
nop();
}
nop();
L(".lp2");
outLocalLabel();
}
};
size_t getValue(const uint8* p)
{
size_t v = 0;
for (size_t i = 0; i < sizeof(size_t); i++) {
v |= p[i] << (i * 8);
}
return v;
}
bool checkAddr(const uint8 *p, size_t offset, size_t expect)
{
size_t v = getValue(p + offset);
2013-03-27 05:28:22 +00:00
if (v == size_t(p) + expect) return true;
printf("err p=%p, offset=%lld, v=%llx(%llx), expect=%d\n", p, (long long)offset, (long long)v, (long long)(expect + size_t(p)), (int)expect);
2013-03-25 03:08:13 +00:00
return false;
}
void testMovLabel(bool grow)
{
bool isOK = true;
MovLabelCode code(grow);
code.ready();
const uint8* const p = code.getCode();
const struct {
int pos;
uint8 ok;
} tbl[] = {
#ifdef XBYAK32
{ 0x00, 0x90 },
// lp1:0x001
{ 0x001, 0x90 },
{ 0x002, 0xb8 },
// 0x003
{ 0x007, 0x90 },
{ 0x008, 0xb8 },
// 0x009
{ 0x10d, 0x90 },
// lp2:0x10e
#else
{ 0x000, 0x90 },
// lp1:0x001
{ 0x001, 0x90 },
{ 0x002, 0x48 },
{ 0x003, 0xb8 },
// 0x004
{ 0x00c, 0x90 },
{ 0x00d, 0x48 },
{ 0x00e, 0xb8 },
// 0x00f
{ 0x117, 0x90 },
// lp2:0x118
#endif
};
for (size_t i = 0; i < NUM_OF_ARRAY(tbl); i++) {
int pos = tbl[i].pos;
uint8 x = p[pos];
uint8 ok = tbl[i].ok;
if (x != ok) {
printf("err pos=%d, x=%02x, ok=%02x\n", pos, x, ok);
isOK = false;
}
}
#ifdef XBYAK32
isOK &= checkAddr(p, 0x03, 0x001);
isOK &= checkAddr(p, 0x09, 0x10e);
#else
isOK &= checkAddr(p, 0x04, 0x001);
isOK &= checkAddr(p, 0x0f, 0x118);
#endif
if (isOK) puts("ok");
}
2013-03-27 05:41:45 +00:00
struct MovLabel2Code : Xbyak::CodeGenerator {
MovLabel2Code()
{
#ifdef XBYAK64
const Reg64& a = rax;
const Reg64& c = rcx;
#else
const Reg32& a = eax;
const Reg32& c = ecx;
#endif
xor(a, a);
xor(c, c);
jmp("in");
ud2();
L("@@"); // L1
add(a, 2);
mov(c, "@f");
jmp(c); // goto L2
ud2();
L("in");
mov(c, "@b");
add(a, 1);
jmp(c); // goto L1
ud2();
L("@@"); // L2
add(a, 4);
ret();
}
};
void testMovLabel2()
{
MovLabel2Code code;
int ret = code.getCode<int (*)()>()();
printf("MovLabel2Test ret=%d, %s\n", ret, ret == 7 ? "ok" : "ng");
}
2014-03-04 13:36:00 +00:00
struct TestLocal : public Xbyak::CodeGenerator {
TestLocal()
{
xor_(eax, eax);
inLocalLabel();
jmp("start0");
L(".back");
inc(eax); // 8
jmp(".next");
L("start2");
inc(eax); // 7
jmp(".back");
inLocalLabel();
L(".back");
inc(eax); // 5
jmp(".next");
L("start1");
inc(eax); // 4
jmp(".back");
inLocalLabel();
L(".back");
inc(eax); // 2
jmp(".next");
L("start0");
inc(eax); // 1
jmp(".back");
L(".next");
inc(eax); // 3
jmp("start1");
outLocalLabel();
L(".next");
inc(eax); // 6
jmp("start2");
outLocalLabel();
L(".next");
inc(eax); // 9
2014-03-08 00:43:09 +00:00
jmp("start3");
inLocalLabel();
L(".back");
inc(eax); // 14
jmp("exit");
L("start4");
inc(eax); // 13
jmp(".back");
outLocalLabel();
L("start3");
inc(eax); // 10
inLocalLabel();
jmp(".next");
L(".back");
inc(eax); // 12
jmp("start4");
L(".next");
inc(eax); // 11
jmp(".back");
outLocalLabel();
2014-03-04 13:36:00 +00:00
outLocalLabel();
L("exit");
2014-03-08 00:43:09 +00:00
inc(eax); // 15
2014-03-04 13:36:00 +00:00
ret();
}
};
void test6()
{
puts("test6");
TestLocal code;
int (*f)() = code.getCode<int (*)()>();
int a = f();
2014-03-08 00:43:09 +00:00
if (a != 15) {
2014-03-04 13:36:00 +00:00
printf("ERR a=%d\n", a);
} else {
puts("ok");
}
}
2012-03-16 06:47:23 +00:00
int main()
{
try {
test1();
test2();
2012-03-19 15:07:29 +00:00
#ifdef ONLY_32BIT
test3();
#endif
test4();
test5();
2014-03-04 13:36:00 +00:00
test6();
2013-03-13 06:22:35 +00:00
testJmpCx();
2013-03-25 03:08:13 +00:00
puts("test MovLabelCode");
testMovLabel(false);
puts("test MovLabelCode:grow");
testMovLabel(true);
2013-03-27 05:41:45 +00:00
testMovLabel2();
} catch (std::exception& e) {
printf("ERR:%s\n", e.what());
2012-03-16 06:47:23 +00:00
} catch (...) {
printf("unknown error\n");
}
}