BFI_EQ:            "BFI.EQ",
	BFI_NE:            "BFI.NE",
	BFI_CS:            "BFI.CS",
	BFI_CC:            "BFI.CC",
	BFI_MI:            "BFI.MI",
	BFI_PL:            "BFI.PL",
	BFI_VS:            "BFI.VS",
	BFI_VC:            "BFI.VC",
	BFI_HI:            "BFI.HI",
	BFI_LS:            "BFI.LS",
	BFI_GE:            "BFI.GE",
	BFI_LT:            "BFI.LT",
	BFI_GT:            "BFI.GT",

	ASRW $11, R27, R25                         // 797f0b13
	BLT -1(PC)                                 // ebffff54
	JMP -1(PC)                                 // ffffff17
	BFIW $16, R20, $6, R0                      // 80161033
	BFI $27, R21, $21, R25                     // b95265b3
	BFXILW $3, R27, $23, R14                   // 6e670333
	BFXIL $26, R8, $16, R20                    // 14a55ab3

// BFX/BFXU/BFC/BFI
	BFX	$16, $8, R1, R2 // BFX $16, R1, $8, R2   // 5124afe7
	BFX	$29, $2, R8                              // 5881bce7
	BFXU	$16, $8, R1, R2 // BFXU $16, R1, $8, R2  // 5124efe7
	BFXU	$29, $2, R8                              // 5881fce7
	BFC	$29, $2, R8                              // 1f81dee7
	BFI	$29, $2, R8                              // 1881dee7

	AESE:      "AESE",
	AESIMC:    "AESIMC",
	AESMC:     "AESMC",
	AND:       "AND",
	ANDS:      "ANDS",
	ASR:       "ASR",
	ASRV:      "ASRV",
	AT:        "AT",
	B:         "B",
	BFI:       "BFI",
	BFM:       "BFM",
	BFXIL:     "BFXIL",
	BIC:       "BIC",
	BICS:      "BICS",
	BIF:       "BIF",
	BIT:       "BIT",
	BL:        "BL",
	BLR:       "BLR",
	BR:        "BR",

	}

	fileInfos, errs = readAllFileInfo(ctx, erasureDisks, "", bucket, object, "", false, true)
	nfi1, err := getLatestFileInfo(ctx, fileInfos, er.defaultParityCount, errs)
	if err != nil {
		t.Fatalf("Failed to getLatestFileInfo - %v", err)
	}

	if !reflect.DeepEqual(fi, nfi1) {
		t.Fatalf("FileInfo not equal after healing")
	}

	// Test 2: Test with a corrupted xl.meta

			rno := uint16(r)
			if rno <= uint16(WZR) {
				op += "W"
			}
		}
		args[1], args[2] = args[2], args[1]

	case STLXRB, STLXRH, STXRB, STXRH:
		args[1], args[2] = args[2], args[1]

	case BFI, BFXIL, SBFIZ, SBFX, UBFIZ, UBFX:
		if r, ok := inst.Args[0].(Reg); ok {
			rno := uint16(r)
			if rno <= uint16(WZR) {
				op += "W"
			}
		}
		args[1], args[2], args[3] = args[3], args[1], args[2]

		// bitfield ops
		// for all bitfield ops lsb is auxInt>>8, width is auxInt&0xff
		// insert low width bits of arg1 into the result starting at bit lsb, copy other bits from arg0
		{name: "BFI", argLength: 2, reg: gp21nog, asm: "BFI", aux: "ARM64BitField", resultInArg0: true},
		// extract width bits of arg1 starting at bit lsb and insert at low end of result, copy other bits from arg0

	STPW	(R3, R4), 11(RSP)   // fb2f009163130029
	STPW	(R3, R4), 1024(RSP) // fb03109163130029
	STPW	(R3, R4), x(SB)
	STPW	(R3, R4), x+8(SB)

// bit field operation
	BFI	$0, R1, $1, R2      // 220040b3
	BFIW	$0, R1, $1, R2      // 22000033
	SBFIZ	$0, R1, $1, R2      // 22004093
	SBFIZW	$0, R1, $1, R2      // 22000013
	UBFIZ	$0, R1, $1, R2      // 220040d3
	UBFIZW	$0, R1, $1, R2      // 22000053

	JB	loop

end:
	MOVQ	dig+0(FP), DI
	MOVL	AX, (0*4)(DI)
	MOVL	BX, (1*4)(DI)
	MOVL	CX, (2*4)(DI)
	MOVL	DX, (3*4)(DI)
	MOVL	BP, (4*4)(DI)
	RET


// This is the implementation using AVX2, BMI1 and BMI2. It is based on:
// "SHA-1 implementation with Intel(R) AVX2 instruction set extensions"
// From http://software.intel.com/en-us/articles
// (look for improving-the-performance-of-the-secure-hash-algorithm-1)

// bfi
(OR (UBFIZ [bfc] x) (ANDconst [ac] y))
	&& ac == ^((1<<uint(bfc.getARM64BFwidth())-1) << uint(bfc.getARM64BFlsb()))
	=> (BFI [bfc] y x)
(ORshiftRL [rc] (ANDconst [ac] x) (SLLconst [lc] y))
	&& lc > rc && ac == ^((1<<uint(64-lc)-1) << uint64(lc-rc))
	=> (BFI [armBFAuxInt(lc-rc, 64-lc)] x y)
// bfxil