aboutsummaryrefslogtreecommitdiffhomepage
path: root/sample/ccmp.cpp
diff options
context:
space:
mode:
authorMITSUNARI Shigeo <[email protected]>2023-12-26 13:38:18 +0900
committerMITSUNARI Shigeo <[email protected]>2023-12-26 13:38:18 +0900
commit5438fc69dbc0ee92a1536e4f8572c45070390df9 (patch)
treeda94073429e7aaae27fdaabab95b054b2a2f8a72 /sample/ccmp.cpp
parentf17cb9d6b94c44e0c7f2b569b0e360c416e628d5 (diff)
parentee26c094ed0e2a20ca5514ea26587614d0d582ca (diff)
downloadxbyak-7.03.tar.gz
xbyak-7.03.zip
Merge branch 'dev'v7.03
Diffstat (limited to 'sample/ccmp.cpp')
-rw-r--r--sample/ccmp.cpp68
1 files changed, 68 insertions, 0 deletions
diff --git a/sample/ccmp.cpp b/sample/ccmp.cpp
new file mode 100644
index 0000000..622d3d1
--- /dev/null
+++ b/sample/ccmp.cpp
@@ -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());
+}