forked from OSchip/llvm-project
				
			
		
			
				
	
	
		
			98 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			TableGen
		
	
	
	
			
		
		
	
	
			98 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			TableGen
		
	
	
	
// WebAssemblyInstrInteger.td-WebAssembly Integer codegen -------*- tablegen -*-
 | 
						|
//
 | 
						|
//                     The LLVM Compiler Infrastructure
 | 
						|
//
 | 
						|
// This file is distributed under the University of Illinois Open Source
 | 
						|
// License. See LICENSE.TXT for details.
 | 
						|
//
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
///
 | 
						|
/// \file
 | 
						|
/// \brief WebAssembly Integer operand code-gen constructs.
 | 
						|
///
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
 | 
						|
let Defs = [ARGUMENTS] in {
 | 
						|
 | 
						|
// The spaces after the names are for aesthetic purposes only, to make
 | 
						|
// operands line up vertically after tab expansion.
 | 
						|
let isCommutable = 1 in
 | 
						|
defm ADD : BinaryInt<add, "add ">;
 | 
						|
defm SUB : BinaryInt<sub, "sub ">;
 | 
						|
let isCommutable = 1 in
 | 
						|
defm MUL : BinaryInt<mul, "mul ">;
 | 
						|
// Divide and remainder trap on a zero denominator.
 | 
						|
let hasSideEffects = 1 in {
 | 
						|
defm DIV_S : BinaryInt<sdiv, "div_s">;
 | 
						|
defm DIV_U : BinaryInt<udiv, "div_u">;
 | 
						|
defm REM_S : BinaryInt<srem, "rem_s">;
 | 
						|
defm REM_U : BinaryInt<urem, "rem_u">;
 | 
						|
} // hasSideEffects = 1
 | 
						|
let isCommutable = 1 in {
 | 
						|
defm AND : BinaryInt<and, "and ">;
 | 
						|
defm OR : BinaryInt<or, "or  ">;
 | 
						|
defm XOR : BinaryInt<xor, "xor ">;
 | 
						|
} // isCommutable = 1
 | 
						|
defm SHL : BinaryInt<shl, "shl ">;
 | 
						|
defm SHR_U : BinaryInt<srl, "shr_u">;
 | 
						|
defm SHR_S : BinaryInt<sra, "shr_s">;
 | 
						|
defm ROTL : BinaryInt<rotl, "rotl">;
 | 
						|
defm ROTR : BinaryInt<rotr, "rotr">;
 | 
						|
 | 
						|
let isCommutable = 1 in {
 | 
						|
defm EQ : ComparisonInt<SETEQ, "eq  ">;
 | 
						|
defm NE : ComparisonInt<SETNE, "ne  ">;
 | 
						|
} // isCommutable = 1
 | 
						|
defm LT_S : ComparisonInt<SETLT, "lt_s">;
 | 
						|
defm LE_S : ComparisonInt<SETLE, "le_s">;
 | 
						|
defm LT_U : ComparisonInt<SETULT, "lt_u">;
 | 
						|
defm LE_U : ComparisonInt<SETULE, "le_u">;
 | 
						|
defm GT_S : ComparisonInt<SETGT, "gt_s">;
 | 
						|
defm GE_S : ComparisonInt<SETGE, "ge_s">;
 | 
						|
defm GT_U : ComparisonInt<SETUGT, "gt_u">;
 | 
						|
defm GE_U : ComparisonInt<SETUGE, "ge_u">;
 | 
						|
 | 
						|
defm CLZ : UnaryInt<ctlz, "clz ">;
 | 
						|
defm CTZ : UnaryInt<cttz, "ctz ">;
 | 
						|
defm POPCNT : UnaryInt<ctpop, "popcnt">;
 | 
						|
 | 
						|
def EQZ_I32 : I<(outs I32:$dst), (ins I32:$src),
 | 
						|
                [(set I32:$dst, (setcc I32:$src, 0, SETEQ))],
 | 
						|
                "i32.eqz \t$dst, $src">;
 | 
						|
def EQZ_I64 : I<(outs I32:$dst), (ins I64:$src),
 | 
						|
                [(set I32:$dst, (setcc I64:$src, 0, SETEQ))],
 | 
						|
                "i64.eqz \t$dst, $src">;
 | 
						|
 | 
						|
} // Defs = [ARGUMENTS]
 | 
						|
 | 
						|
// Optimize away an explicit mask on a rotate count.
 | 
						|
def : Pat<(rotl I32:$lhs, (and I32:$rhs, 31)), (ROTL_I32 I32:$lhs, I32:$rhs)>;
 | 
						|
def : Pat<(rotr I32:$lhs, (and I32:$rhs, 31)), (ROTR_I32 I32:$lhs, I32:$rhs)>;
 | 
						|
def : Pat<(rotl I64:$lhs, (and I64:$rhs, 63)), (ROTL_I64 I64:$lhs, I64:$rhs)>;
 | 
						|
def : Pat<(rotr I64:$lhs, (and I64:$rhs, 63)), (ROTR_I64 I64:$lhs, I64:$rhs)>;
 | 
						|
 | 
						|
let Defs = [ARGUMENTS] in {
 | 
						|
 | 
						|
def SELECT_I32 : I<(outs I32:$dst), (ins I32:$lhs, I32:$rhs, I32:$cond),
 | 
						|
                   [(set I32:$dst, (select I32:$cond, I32:$lhs, I32:$rhs))],
 | 
						|
                   "i32.select\t$dst, $lhs, $rhs, $cond">;
 | 
						|
def SELECT_I64 : I<(outs I64:$dst), (ins I64:$lhs, I64:$rhs, I32:$cond),
 | 
						|
                   [(set I64:$dst, (select I32:$cond, I64:$lhs, I64:$rhs))],
 | 
						|
                   "i64.select\t$dst, $lhs, $rhs, $cond">;
 | 
						|
 | 
						|
} // Defs = [ARGUMENTS]
 | 
						|
 | 
						|
// ISD::SELECT requires its operand to conform to getBooleanContents, but
 | 
						|
// WebAssembly's select interprets any non-zero value as true, so we can fold
 | 
						|
// a setne with 0 into a select.
 | 
						|
def : Pat<(select (i32 (setne I32:$cond, 0)), I32:$lhs, I32:$rhs),
 | 
						|
          (SELECT_I32 I32:$lhs, I32:$rhs, I32:$cond)>;
 | 
						|
def : Pat<(select (i32 (setne I32:$cond, 0)), I64:$lhs, I64:$rhs),
 | 
						|
          (SELECT_I64 I64:$lhs, I64:$rhs, I32:$cond)>;
 | 
						|
 | 
						|
// And again, this time with seteq instead of setne and the arms reversed.
 | 
						|
def : Pat<(select (i32 (seteq I32:$cond, 0)), I32:$lhs, I32:$rhs),
 | 
						|
          (SELECT_I32 I32:$rhs, I32:$lhs, I32:$cond)>;
 | 
						|
def : Pat<(select (i32 (seteq I32:$cond, 0)), I64:$lhs, I64:$rhs),
 | 
						|
          (SELECT_I64 I64:$rhs, I64:$lhs, I32:$cond)>;
 |