// In fact, UMOD will be translated into UREM instruction, and UREM is originally translated into
// UDIV and MSUB instructions. But if there is already an identical UDIV instruction just before or
// after UREM (case like quo, rem := z/y, z%y), then the second UDIV instruction becomes redundant.
// The purpose of this rule is to have this extra UDIV instruction removed in CSE pass.
(UMOD  <typ.UInt64> x y) => (MSUB <typ.UInt64> x y (UDIV <typ.UInt64> x y))

		{"Position.Line", Field, 0},
		{"Position.Offset", Field, 0},
		{"QUO", Const, 0},
		{"QUO_ASSIGN", Const, 0},
		{"RANGE", Const, 0},
		{"RBRACE", Const, 0},
		{"RBRACK", Const, 0},
		{"REM", Const, 0},
		{"REM_ASSIGN", Const, 0},
		{"RETURN", Const, 0},
		{"RPAREN", Const, 0},
		{"SELECT", Const, 0},
		{"SEMICOLON", Const, 0},
		{"SHL", Const, 0},
		{"SHL_ASSIGN", Const, 0},

			v := c.regoff(&p.From) & 1
			o1 = AOP_RRR(c.oprrr(p.As), 0, 0, uint32(p.To.Reg)) | uint32(v)<<21
		} else {
			o1 = AOP_RRR(c.oprrr(p.As), 0, 0, uint32(p.From.Reg))
		}

	case 50: /* rem[u] r1[,r2],r3 */
		r := int(p.Reg)

		if r == 0 {
			r = int(p.To.Reg)
		}
		v := c.oprrr(p.As)
		t := v & (1<<10 | 1) /* OE|Rc */
		o1 = AOP_RRR(v&^t, REGTMP, uint32(r), uint32(p.From.Reg))

		v.AddArg2(x, y)
		return true
	}
	return false
}
func rewriteValueRISCV64_OpMod64(v *Value) bool {
	v_1 := v.Args[1]
	v_0 := v.Args[0]
	// match: (Mod64 x y [false])
	// result: (REM x y)
	for {
		if auxIntToBool(v.AuxInt) != false {
			break
		}
		x := v_0
		y := v_1
		v.reset(OpRISCV64REM)
		v.AddArg2(x, y)
		return true
	}
	return false
}

    <alias type="application/bat"/>
    <sub-class-of type="text/plain"/>
    <magic priority="50">
      <match value="@echo off" type="stringignorecase" offset="0" />
      <match value="rem " type="stringignorecase" offset="0" />
    </magic>
    <glob pattern="*.bat"/>
    <glob pattern="*.cmd"/>
  </mime-type>

  <mime-type type="application/batch-smtp"/>
  <mime-type type="application/beep+xml"/>

`��ʙ���Pi�@Y`(�� �PV�
@�HPP(V����\r�������`�i����2b 6�UH�oR��z�
1 `�`$�IP��@�
5*��ʪ�h
IE4M*�������$������I3��7.[��lJtc>㻒���.庉��N\�N�w�k�ts��_9�;V�j�j懽%�j���懏9[�������zϧ�ի�r~m��"�=REm�bN�ϱ������u���{j6��>��Dy�rC���m��"���O޸��w�cڟ@�E��x|â�25������^�r z�C�RK�J#��kF�گ�k�
Z��V�l£Z�X h E�F���(Z�P ( o� i������AWx�;�l.�Z��p� 0�`��� T�� b4�hH��ղ�m5� ����_O�c���x~�Ç�t����kVZ�χgggavu|��5�M��'�)O�T���ǷT�zg��������...

);is();ns();St();Db=["min","max","clamp","calc"];Ib=new Set(["scroll-timeline-name","timeline-scope","view-timeline-name","font-palette","scroll-timeline","animation-timeline","view-timeline"]);Rb=["cm","mm","Q","in","pc","pt","px","em","ex","ch","rem","lh","rlh","vw","vh","vmin","vmax","vb","vi","svw","svh","lvw","lvh","dvw","dvh","cqw","cqh","cqi","cqb","cqmin","cqmax"],Mb=`(?:${Rb.join("|")})`;Bb=new Set(["thin","medium","thick"]);Fb=new Set(["conic-gradient","linear-gradient","radial-gradien...

pkg hash/maphash, type Hash struct
pkg hash/maphash, type Seed struct
pkg log, const Lmsgprefix = 64
pkg log, const Lmsgprefix ideal-int
pkg math, func FMA(float64, float64, float64) float64
pkg math/bits, func Rem(uint, uint, uint) uint
pkg math/bits, func Rem32(uint32, uint32, uint32) uint32
pkg math/bits, func Rem64(uint64, uint64, uint64) uint64
pkg mime/multipart, method (*Reader) NextRawPart() (*Part, error)

pkg go/token, const QUO Token
pkg go/token, const QUO_ASSIGN Token
pkg go/token, const RANGE Token
pkg go/token, const RBRACE Token
pkg go/token, const RBRACK Token
pkg go/token, const REM Token
pkg go/token, const REM_ASSIGN Token
pkg go/token, const RETURN Token
pkg go/token, const RPAREN Token
pkg go/token, const SELECT Token
pkg go/token, const SEMICOLON Token
pkg go/token, const SHL Token

			},
			outputs: []outputInfo{
				{0, 1006632944}, // X5 X6 X7 X8 X9 X10 X11 X12 X13 X14 X15 X16 X17 X18 X19 X20 X21 X22 X23 X24 X25 X26 X28 X29 X30
			},
		},
	},
	{
		name:   "REM",
		argLen: 2,
		asm:    riscv.AREM,
		reg: regInfo{
			inputs: []inputInfo{
				{0, 1006632944}, // X5 X6 X7 X8 X9 X10 X11 X12 X13 X14 X15 X16 X17 X18 X19 X20 X21 X22 X23 X24 X25 X26 X28 X29 X30