blob: 96ff1c331f85c7211631472437c031b2cf4e25c1 [file] [log] [blame]
JF Bastien5ca0bac2015-07-10 18:23:10 +00001// WebAssemblyInstrInteger.td-WebAssembly Integer codegen -------*- tablegen -*-
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9///
10/// \file
11/// \brief WebAssembly Integer operand code-gen constructs.
12///
13//===----------------------------------------------------------------------===//
14
Dan Gohmanfb3e0592015-11-25 19:36:19 +000015let Defs = [ARGUMENTS] in {
16
Dan Gohman1f29c682015-11-18 16:25:38 +000017// The spaces after the names are for aesthetic purposes only, to make
18// operands line up vertically after tab expansion.
Dan Gohman174b2d82015-11-29 22:59:19 +000019let isCommutable = 1 in
Dan Gohman5a68ec72016-10-05 21:24:08 +000020defm ADD : BinaryInt<add, "add ", 0x40, 0x5b>;
21defm SUB : BinaryInt<sub, "sub ", 0x41, 0x5c>;
Dan Gohman174b2d82015-11-29 22:59:19 +000022let isCommutable = 1 in
Dan Gohman5a68ec72016-10-05 21:24:08 +000023defm MUL : BinaryInt<mul, "mul ", 0x42, 0x5d>;
Dan Gohman174b2d82015-11-29 22:59:19 +000024// Divide and remainder trap on a zero denominator.
25let hasSideEffects = 1 in {
Dan Gohman5a68ec72016-10-05 21:24:08 +000026defm DIV_S : BinaryInt<sdiv, "div_s", 0x43, 0x5e>;
27defm DIV_U : BinaryInt<udiv, "div_u", 0x44, 0x5f>;
28defm REM_S : BinaryInt<srem, "rem_s", 0x45, 0x60>;
29defm REM_U : BinaryInt<urem, "rem_u", 0x46, 0x61>;
Dan Gohman174b2d82015-11-29 22:59:19 +000030} // hasSideEffects = 1
31let isCommutable = 1 in {
Dan Gohman5a68ec72016-10-05 21:24:08 +000032defm AND : BinaryInt<and, "and ", 0x47, 0x62>;
33defm OR : BinaryInt<or, "or ", 0x48, 0x63>;
34defm XOR : BinaryInt<xor, "xor ", 0x49, 0x64>;
Dan Gohman174b2d82015-11-29 22:59:19 +000035} // isCommutable = 1
Dan Gohman5a68ec72016-10-05 21:24:08 +000036defm SHL : BinaryInt<shl, "shl ", 0x4a, 0x65>;
37defm SHR_U : BinaryInt<srl, "shr_u", 0x4b, 0x66>;
38defm SHR_S : BinaryInt<sra, "shr_s", 0x4c, 0x67>;
39defm ROTL : BinaryInt<rotl, "rotl", 0xb7, 0xb9>;
40defm ROTR : BinaryInt<rotr, "rotr", 0xb6, 0xb8>;
JF Bastiend9767a32015-07-14 21:13:29 +000041
Dan Gohman174b2d82015-11-29 22:59:19 +000042let isCommutable = 1 in {
Dan Gohman5a68ec72016-10-05 21:24:08 +000043defm EQ : ComparisonInt<SETEQ, "eq ", 0x4d, 0x68>;
44defm NE : ComparisonInt<SETNE, "ne ", 0x4e, 0x69>;
Dan Gohman174b2d82015-11-29 22:59:19 +000045} // isCommutable = 1
Dan Gohman5a68ec72016-10-05 21:24:08 +000046defm LT_S : ComparisonInt<SETLT, "lt_s", 0x4f, 0x6a>;
47defm LE_S : ComparisonInt<SETLE, "le_s", 0x50, 0x6b>;
48defm LT_U : ComparisonInt<SETULT, "lt_u", 0x51, 0x6c>;
49defm LE_U : ComparisonInt<SETULE, "le_u", 0x52, 0x6d>;
50defm GT_S : ComparisonInt<SETGT, "gt_s", 0x53, 0x6e>;
51defm GE_S : ComparisonInt<SETGE, "ge_s", 0x54, 0x6f>;
52defm GT_U : ComparisonInt<SETUGT, "gt_u", 0x55, 0x70>;
53defm GE_U : ComparisonInt<SETUGE, "ge_u", 0x56, 0x71>;
JF Bastiend9767a32015-07-14 21:13:29 +000054
Dan Gohman5a68ec72016-10-05 21:24:08 +000055defm CLZ : UnaryInt<ctlz, "clz ", 0x57, 0x72>;
56defm CTZ : UnaryInt<cttz, "ctz ", 0x58, 0x73>;
57defm POPCNT : UnaryInt<ctpop, "popcnt", 0x59, 0x74>;
Dan Gohman08fc9662015-08-24 16:39:37 +000058
Dan Gohmanc8d7f142016-03-21 19:54:41 +000059def EQZ_I32 : I<(outs I32:$dst), (ins I32:$src),
60 [(set I32:$dst, (setcc I32:$src, 0, SETEQ))],
Dan Gohman5a68ec72016-10-05 21:24:08 +000061 "i32.eqz \t$dst, $src", 0x5a>;
Dan Gohmanc8d7f142016-03-21 19:54:41 +000062def EQZ_I64 : I<(outs I32:$dst), (ins I64:$src),
63 [(set I32:$dst, (setcc I64:$src, 0, SETEQ))],
Dan Gohman5a68ec72016-10-05 21:24:08 +000064 "i64.eqz \t$dst, $src", 0xba>;
Dan Gohmanc8d7f142016-03-21 19:54:41 +000065
Dan Gohmanfb3e0592015-11-25 19:36:19 +000066} // Defs = [ARGUMENTS]
67
Dan Gohman665d7e32016-03-22 18:01:49 +000068// Optimize away an explicit mask on a rotate count.
69def : Pat<(rotl I32:$lhs, (and I32:$rhs, 31)), (ROTL_I32 I32:$lhs, I32:$rhs)>;
70def : Pat<(rotr I32:$lhs, (and I32:$rhs, 31)), (ROTR_I32 I32:$lhs, I32:$rhs)>;
71def : Pat<(rotl I64:$lhs, (and I64:$rhs, 63)), (ROTL_I64 I64:$lhs, I64:$rhs)>;
72def : Pat<(rotr I64:$lhs, (and I64:$rhs, 63)), (ROTR_I64 I64:$lhs, I64:$rhs)>;
73
Dan Gohmanfb3e0592015-11-25 19:36:19 +000074let Defs = [ARGUMENTS] in {
75
Dan Gohmand46b0922016-02-05 17:14:59 +000076def SELECT_I32 : I<(outs I32:$dst), (ins I32:$lhs, I32:$rhs, I32:$cond),
Dan Gohmanaf29bd42015-11-05 20:42:30 +000077 [(set I32:$dst, (select I32:$cond, I32:$lhs, I32:$rhs))],
Dan Gohmand46b0922016-02-05 17:14:59 +000078 "i32.select\t$dst, $lhs, $rhs, $cond">;
79def SELECT_I64 : I<(outs I64:$dst), (ins I64:$lhs, I64:$rhs, I32:$cond),
Dan Gohmanaf29bd42015-11-05 20:42:30 +000080 [(set I64:$dst, (select I32:$cond, I64:$lhs, I64:$rhs))],
Dan Gohmand46b0922016-02-05 17:14:59 +000081 "i64.select\t$dst, $lhs, $rhs, $cond">;
Dan Gohmanfb3e0592015-11-25 19:36:19 +000082
83} // Defs = [ARGUMENTS]
Dan Gohmand9b42182015-11-25 22:13:48 +000084
85// ISD::SELECT requires its operand to conform to getBooleanContents, but
86// WebAssembly's select interprets any non-zero value as true, so we can fold
87// a setne with 0 into a select.
88def : Pat<(select (i32 (setne I32:$cond, 0)), I32:$lhs, I32:$rhs),
Dan Gohmand46b0922016-02-05 17:14:59 +000089 (SELECT_I32 I32:$lhs, I32:$rhs, I32:$cond)>;
Dan Gohmand9b42182015-11-25 22:13:48 +000090def : Pat<(select (i32 (setne I32:$cond, 0)), I64:$lhs, I64:$rhs),
Dan Gohmand46b0922016-02-05 17:14:59 +000091 (SELECT_I64 I64:$lhs, I64:$rhs, I32:$cond)>;
Dan Gohmand9b42182015-11-25 22:13:48 +000092
93// And again, this time with seteq instead of setne and the arms reversed.
94def : Pat<(select (i32 (seteq I32:$cond, 0)), I32:$lhs, I32:$rhs),
Dan Gohmand46b0922016-02-05 17:14:59 +000095 (SELECT_I32 I32:$rhs, I32:$lhs, I32:$cond)>;
Dan Gohmand9b42182015-11-25 22:13:48 +000096def : Pat<(select (i32 (seteq I32:$cond, 0)), I64:$lhs, I64:$rhs),
Dan Gohmand46b0922016-02-05 17:14:59 +000097 (SELECT_I64 I64:$rhs, I64:$lhs, I32:$cond)>;