mirror of
https://github.com/herumi/xbyak
synced 2024-11-20 16:06:14 -07:00
add sample/ccmp.cpp
This commit is contained in:
parent
bacd8d34b6
commit
b5e115284a
2 changed files with 73 additions and 1 deletions
|
@ -30,7 +30,7 @@ else
|
|||
endif
|
||||
|
||||
ifeq ($(BIT),64)
|
||||
TARGET += test64 bf64 memfunc64 test_util64 jmp_table64 zero_upper
|
||||
TARGET += test64 bf64 memfunc64 test_util64 jmp_table64 zero_upper ccmp
|
||||
ifeq ($(BOOST_EXIST),1)
|
||||
TARGET += calc64 #calc2_64
|
||||
endif
|
||||
|
@ -107,6 +107,10 @@ zero_upper: zero_upper.cpp $(XBYAK_INC)
|
|||
$(CXX) $(CFLAGS) zero_upper.cpp -o $@
|
||||
test_zero_upper: zero_upper
|
||||
sde -future -- ./zero_upper
|
||||
ccmp: ccmp.cpp $(XBYAK_INC)
|
||||
$(CXX) $(CFLAGS) ccmp.cpp -o $@
|
||||
test_ccmp: ccmp
|
||||
sde -future -- ./ccmp
|
||||
|
||||
clean:
|
||||
rm -rf $(TARGET) profiler profiler-vtune
|
||||
|
|
68
sample/ccmp.cpp
Normal file
68
sample/ccmp.cpp
Normal file
|
@ -0,0 +1,68 @@
|
|||
/*
|
||||
An example of ccmp
|
||||
> g++ ccmp.cpp -I ../xbyak
|
||||
> sde -future -- ./a.out
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <xbyak/xbyak.h>
|
||||
#include <xbyak/xbyak_util.h>
|
||||
|
||||
using namespace Xbyak;
|
||||
|
||||
struct Code1 : Xbyak::CodeGenerator {
|
||||
Code1()
|
||||
{
|
||||
Xbyak::util::StackFrame sf(this, 2);
|
||||
const auto& p1 = sf.p[0];
|
||||
const auto& p2 = sf.p[1];
|
||||
int dfv = 0;
|
||||
cmp(p1, 3);
|
||||
ctesta(p2, 1, dfv); // eflags = (p1 > 3) ? (p2 & 1) : dfv;
|
||||
setz(al|T_zu);
|
||||
}
|
||||
};
|
||||
|
||||
struct Code2 : Xbyak::CodeGenerator {
|
||||
Code2()
|
||||
{
|
||||
Xbyak::util::StackFrame sf(this, 3);
|
||||
const auto& p1 = sf.p[0];
|
||||
const auto& p2 = sf.p[1];
|
||||
const auto& p3 = sf.p[2];
|
||||
int dfv = 0;
|
||||
cmp(p1, 1);
|
||||
ccmpe(p2, 2, dfv); // eflags = p1==1 ? p2==2 : dfv;
|
||||
ccmpe(p3, 3, dfv); // eflags = (p1==1 && p2==2) ? p3==3 : dfv;
|
||||
setz(al|T_zu); // p1==1 && p2==2 && p3==3
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
int main()
|
||||
try
|
||||
{
|
||||
{
|
||||
puts("(p1 > 3) && ((p2 & 1) == 0)");
|
||||
Code1 c;
|
||||
auto f = c.getCode<int (*)(int, int)>();
|
||||
for (int p1 = 2; p1 < 5; p1++) {
|
||||
for (int p2 = 0; p2 < 3; p2++) {
|
||||
printf("p1=%d p2=%d ret=%d (%d)\n", p1, p2, f(p1, p2), p1 > 3 && ((p2&1) == 0));
|
||||
}
|
||||
}
|
||||
}
|
||||
{
|
||||
puts("p1 == 1 && p2 == 2 && p3 == 3");
|
||||
Code2 c;
|
||||
auto f = c.getCode<int (*)(int, int, int)>();
|
||||
for (int p1 = 0; p1 < 3; p1++) {
|
||||
for (int p2 = 1; p2 < 4; p2++) {
|
||||
for (int p3 = 2; p3 < 5; p3++) {
|
||||
printf("p1=%d p2=%d p3=%d ret=%d (%d)\n", p1, p2, p3, f(p1, p2, p3), p1==1 && p2==2 && p3==3);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
} catch (std::exception& e) {
|
||||
printf("ERR %s\n", e.what());
|
||||
}
|
Loading…
Reference in a new issue