VEXTRACTI64X2 $0, Y11, K2, -7(CX)                  // 6273fd2a3999f9ffffff00
	VEXTRACTI64X2 $0, Y31, K2, 15(DX)(BX*4)            // 6263fd2a39bc9a0f00000000
	VEXTRACTI64X2 $0, Y6, K2, 15(DX)(BX*4)             // 62f3fd2a39b49a0f00000000
	VEXTRACTI64X2 $0, Y11, K2, 15(DX)(BX*4)            // 6273fd2a399c9a0f00000000
	VEXTRACTI64X2 $2, Z27, K2, X1                      // 6263fd4a39d902

	VMOVDQU8 15(DX)(BX*1), K3, X31                     // 62617f0b6fbc1a0f000000
	VMOVDQU8 -7(CX)(DX*2), K3, X31                     // 62617f0b6fbc51f9ffffff
	VMOVDQU8 Y3, K4, Y6                                // 62f17f2c7fde
	VMOVDQU8 Y3, K4, 7(SI)(DI*1)                       // 62f17f2c7f9c3e07000000
	VMOVDQU8 Y3, K4, 15(DX)(BX*8)                      // 62f17f2c7f9cda0f000000

			fmt.Printf(" rel %#.4x/%d %s%+d\n", uint32(r.Off), r.Siz, r.Sym.Name, r.Add)
		}
	}

	// Mark nonpreemptible instruction sequences.
	// The 2-instruction TLS access sequence
	//	MOVQ TLS, BX
	//	MOVQ 0(BX)(TLS*1), BX
	// is not async preemptible, as if it is preempted and resumed on
	// a different thread, the TLS address may become invalid.
	if !CanUse1InsnTLS(ctxt) {
		useTLS := func(p *obj.Prog) bool {

		}
		return m
	}

	// Common individual register masks
	var (
		ax         = buildReg("AX")
		cx         = buildReg("CX")
		dx         = buildReg("DX")
		bx         = buildReg("BX")
		gp         = buildReg("AX CX DX BX BP SI DI R8 R9 R10 R11 R12 R13 R15")
		g          = buildReg("g")
		fp         = buildReg("X0 X1 X2 X3 X4 X5 X6 X7 X8 X9 X10 X11 X12 X13 X14")
		x15        = buildReg("X15")

			t.Errorf("%s(1000, 99) = %v, %v, want 99, %v", name, b, x, 1000+inc)
		}
	}

	CheckV := func(name string, i Value, inc int) {
		bx := i.Method(0).Call([]Value{ValueOf(1000), ValueOf(byte(99))})
		b := bx[0].Interface()
		x := bx[1].Interface()
		if b != byte(99) || x != 1000+inc {
			t.Errorf("direct %s.M(1000, 99) = %v, %v, want 99, %v", name, b, x, 1000+inc)
		}

I�H%)�)�0g���+� �nE�)�"S �tK�׏�'8ʳ��lN��i������yB9����w|�[�#���� ˸�k���x�q��� ��껂W��u�6���U���RJ�?��.�7n^S�c�R�E�(1J(F�RYI�z$F�'M"�L�Ĥ�� � ږC�*�)�ĉY�1��K4�{��9H�Ѡ�J�(%%q��(#hAR�
Ŕ(1J(F�RUI�����ݒ��hR�&/�7���f�R�m�@�F�`�D-騉S)E��m�Bx�� ����e{�͇���`����k��l�����ʪ6B�?��ð:��T|��p2���Xy�>�2�T;���n`�Պ�I�,˲6X^�q^����b�Q�X� )'�����(S-�͵���`m9��H�DkɁ��x�'�t1a���0�&�b����j����D�%R�EJlJ.�hn8�à[��ʶ�|2[�t��,�2����(ϜnxKα�wl��d�� 괦�U9�j����ҤKC�7y�x�D��2}�M__x��ϡ��r�P[�"...

// This file was originally from https://golang.org/cl/24717 by Vlad Krasnov of CloudFlare.

//go:build gc && !purego

#include "textflag.h"
// General register allocation
#define oup DI
#define inp SI
#define inl BX
#define adp CX // free to reuse, after we hash the additional data
#define keyp R8 // free to reuse, when we copy the key to stack
#define itr2 R9 // general iterator
#define itr1 CX // general iterator
#define acc0 R10

other Rings than before, and so become less distinct. [Illustration: FIG. 7.] To explain this a little farther, suppose the concentrick Circles AV, and BX, [in _Fig._ 7.] represent the red and violet of any Order, which, together with the intermediate Colours, constitute any one of these Rings. Now these being view'd through a Prism, the violet Circle BX, will, by a greater Refraction, be farther translated from its place than the red AV, and so approach nearer to it on that side of the Circles, towards...