long mul = K3;
    int topBit = 0x7;

    int lengthAligned = length & ~topBit;
    int lengthRemainder = length & topBit;
    long hash = seed ^ (length * mul);

    for (int i = 0; i < lengthAligned; i += 8) {
      long loaded = load64(bytes, offset + i);
      long data = shiftMix(loaded * mul) * mul;
      hash ^= data;
      hash *= mul;
    }

    long mul = K3;
    int topBit = 0x7;

    int lengthAligned = length & ~topBit;
    int lengthRemainder = length & topBit;
    long hash = seed ^ (length * mul);

    for (int i = 0; i < lengthAligned; i += 8) {
      long loaded = load64(bytes, offset + i);
      long data = shiftMix(loaded * mul) * mul;
      hash ^= data;
      hash *= mul;
    }

		FieldD string `gorm:"uniqueIndex;index"` // uniqueIndex and index

		FieldE1 string `gorm:"uniqueIndex:uniq_field_e1_e2"` // mul uniqueIndex
		FieldE2 string `gorm:"uniqueIndex:uniq_field_e1_e2"`

		FieldF1 string `gorm:"uniqueIndex:uniq_field_f1_f2;index"` // mul uniqueIndex and index
		FieldF2 string `gorm:"uniqueIndex:uniq_field_f1_f2;"`

		FieldG string `gorm:"unique;uniqueIndex"` // unique and uniqueIndex

var t0 = new(P256Element) var t1 = new(P256Element) z.Square(x) z.Mul(x, z) z.Square(z) z.Mul(x, z) t0.Square(z) for s := 1; s < 3; s++ { t0.Square(t0) } t0.Mul(z, t0) t1.Square(t0) for s := 1; s < 6; s++ { t1.Square(t1) } t0.Mul(t0, t1) for s := 0; s < 3; s++ { t0.Square(t0) } z.Mul(z, t0) t0.Square(z) t0.Mul(x, t0) t1.Square(t0) for s := 1; s < 16; s++ { t1.Square(t1) } t0.Mul(t0, t1) for s := 0; s < 15; s++ { t0.Square(t0) } z.Mul(z, t0) for s := 0; s < 17; s++ { t0.Square(t0) } t0.Mul(x, t0) for...

	MULALU		R1, R2, (R4, R3)     // 9231a4e0
	MULALU.S	R1, R2, (R4, R3)     // 9231b4e0

// MUL
	MUL	R2, R3, R4           // 930204e0
	MUL	R2, R4               // 940204e0
	MUL	R2, R4, R4           // 940204e0
	MUL.S	R2, R3, R4           // 930214e0
	MUL.S	R2, R4               // 940214e0
	MUL.S	R2, R4, R4           // 940214e0
	MULU	R5, R6, R7           // 960507e0
	MULU	R5, R7               // 970507e0

	BREAK				// 00002a00
	UNDEF				// 00002a00

	ANDN	R4, R5, R6		// a6901600
	ANDN	R4, R5			// a5901600
	ORN	R4, R5, R6		// a6101600
	ORN	R4, R5			// a5101600

	// mul
	MUL	R4, R5	  		// a5101c00
	MUL	R4, R5, R6	  	// a6101c00
	MULV	R4, R5	   		// a5901d00
	MULV	R4, R5, R6	   	// a6901d00
	MULVU	R4, R5			// a5901d00
	MULVU	R4, R5, R6		// a6901d00
	MULHV	R4, R5			// a5101e00

	// In some db (e.g. MySQL), Unique and UniqueIndex are indistinguishable.
	// When a column has a (not Mul) UniqueIndex, Migrator always reports its gorm.ColumnType is Unique.
	// It causes field unnecessarily migration.
	// Therefore, we need to record the UniqueIndex on this column (exclude Mul UniqueIndex) for MigrateColumnUnique.
	UniqueIndex string
}

func (field *Field) BindName() string {

	MOVBS.U	R1, R2             // ERROR "invalid .U suffix"
	MOVH.S	R1, R2             // ERROR "invalid .S suffix"
	MOVHU.P	R1, R2             // ERROR "invalid .P suffix"
	MOVHS.U	R1, R2             // ERROR "invalid .U suffix"
	MUL.P	R0, R1, R2         // ERROR "invalid .P suffix"
	MULU.W	R1, R2             // ERROR "invalid .W suffix"
	DIVHW.S	R0, R1, R2         // ERROR "invalid .S suffix"
	DIVHW.W	R1, R2             // ERROR "invalid .W suffix"

                        Item l = left.hasNext() ? left.next() : null;
                        Item r = right.hasNext() ? right.next() : null;

                        // if this is shorter, then invert the compare and mul with -1
                        int result = l == null ? (r == null ? 0 : -1 * r.compareTo(l)) : l.compareTo(r);

                        if (result != 0) {
                            return result;

	SD	X5, 4(X6)				// 23325300

	// 8.1: Base Counters and Timers (Zicntr)
	RDCYCLE		X5				// f32200c0
	RDTIME		X5				// f32210c0
	RDINSTRET	X5				// f32220c0

	// 13.1: Multiplication Operations
	MUL	X5, X6, X7				// b3035302
	MULH	X5, X6, X7				// b3135302
	MULHU	X5, X6, X7				// b3335302
	MULHSU	X5, X6, X7				// b3235302
	MULW	X5, X6, X7				// bb035302

	// 13.2: Division Operations