• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1// 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
15let Defs = [ARGUMENTS] in {
16
17// The spaces after the names are for aesthetic purposes only, to make
18// operands line up vertically after tab expansion.
19let isCommutable = 1 in
20defm ADD : BinaryInt<add, "add ">;
21defm SUB : BinaryInt<sub, "sub ">;
22let isCommutable = 1 in
23defm MUL : BinaryInt<mul, "mul ">;
24// Divide and remainder trap on a zero denominator.
25let hasSideEffects = 1 in {
26defm DIV_S : BinaryInt<sdiv, "div_s">;
27defm DIV_U : BinaryInt<udiv, "div_u">;
28defm REM_S : BinaryInt<srem, "rem_s">;
29defm REM_U : BinaryInt<urem, "rem_u">;
30} // hasSideEffects = 1
31let isCommutable = 1 in {
32defm AND : BinaryInt<and, "and ">;
33defm OR : BinaryInt<or, "or  ">;
34defm XOR : BinaryInt<xor, "xor ">;
35} // isCommutable = 1
36defm SHL : BinaryInt<shl, "shl ">;
37defm SHR_U : BinaryInt<srl, "shr_u">;
38defm SHR_S : BinaryInt<sra, "shr_s">;
39
40let isCommutable = 1 in {
41defm EQ : ComparisonInt<SETEQ, "eq  ">;
42defm NE : ComparisonInt<SETNE, "ne  ">;
43} // isCommutable = 1
44defm LT_S : ComparisonInt<SETLT, "lt_s">;
45defm LE_S : ComparisonInt<SETLE, "le_s">;
46defm LT_U : ComparisonInt<SETULT, "lt_u">;
47defm LE_U : ComparisonInt<SETULE, "le_u">;
48defm GT_S : ComparisonInt<SETGT, "gt_s">;
49defm GE_S : ComparisonInt<SETGE, "ge_s">;
50defm GT_U : ComparisonInt<SETUGT, "gt_u">;
51defm GE_U : ComparisonInt<SETUGE, "ge_u">;
52
53defm CLZ : UnaryInt<ctlz, "clz ">;
54defm CTZ : UnaryInt<cttz, "ctz ">;
55defm POPCNT : UnaryInt<ctpop, "popcnt">;
56
57} // Defs = [ARGUMENTS]
58
59// Expand the "don't care" operations to supported operations.
60def : Pat<(ctlz_zero_undef I32:$src), (CLZ_I32 I32:$src)>;
61def : Pat<(ctlz_zero_undef I64:$src), (CLZ_I64 I64:$src)>;
62def : Pat<(cttz_zero_undef I32:$src), (CTZ_I32 I32:$src)>;
63def : Pat<(cttz_zero_undef I64:$src), (CTZ_I64 I64:$src)>;
64
65let Defs = [ARGUMENTS] in {
66
67def SELECT_I32 : I<(outs I32:$dst), (ins I32:$cond, I32:$lhs, I32:$rhs),
68                   [(set I32:$dst, (select I32:$cond, I32:$lhs, I32:$rhs))],
69                   "i32.select\t$dst, $cond, $lhs, $rhs">;
70def SELECT_I64 : I<(outs I64:$dst), (ins I32:$cond, I64:$lhs, I64:$rhs),
71                   [(set I64:$dst, (select I32:$cond, I64:$lhs, I64:$rhs))],
72                   "i64.select\t$dst, $cond, $lhs, $rhs">;
73
74} // Defs = [ARGUMENTS]
75
76// ISD::SELECT requires its operand to conform to getBooleanContents, but
77// WebAssembly's select interprets any non-zero value as true, so we can fold
78// a setne with 0 into a select.
79def : Pat<(select (i32 (setne I32:$cond, 0)), I32:$lhs, I32:$rhs),
80          (SELECT_I32 I32:$cond, I32:$lhs, I32:$rhs)>;
81def : Pat<(select (i32 (setne I32:$cond, 0)), I64:$lhs, I64:$rhs),
82          (SELECT_I64 I32:$cond, I64:$lhs, I64:$rhs)>;
83
84// And again, this time with seteq instead of setne and the arms reversed.
85def : Pat<(select (i32 (seteq I32:$cond, 0)), I32:$lhs, I32:$rhs),
86          (SELECT_I32 I32:$cond, I32:$rhs, I32:$lhs)>;
87def : Pat<(select (i32 (seteq I32:$cond, 0)), I64:$lhs, I64:$rhs),
88          (SELECT_I64 I32:$cond, I64:$rhs, I64:$lhs)>;
89