return nil, now
	}

	decIfPositive := func(val *atomic.Int64) bool {
		for {
			v := val.Load()
			if v <= 0 {
				return false
			}

			if val.CompareAndSwap(v, v-1) {
				return true
			}
		}
	}

	if decIfPositive(&c.dedicatedMarkWorkersNeeded) {
		// This P is now dedicated to marking until the end of
		// the concurrent mark phase.

	return
}

// This verifies that the mask is a set of
// consecutive bits including the least
// significant bit.
func isPPC64ValidShiftMask(v int64) bool {
	if (v != 0) && ((v+1)&v) == 0 {
		return true
	}
	return false
}

func getPPC64ShiftMaskLength(v int64) int64 {
	return int64(bits.Len64(uint64(v)))
}

				if v := mg.Selected("go"); v == ld.TidyGoVersion {
					rs = tidy
				} else {
					conflict := Conflict{
						Path: mg.g.FindPath(func(m module.Version) bool {
							return m.Path == "go" && m.Version == v
						})[1:],
						Constraint: module.Version{Path: "go", Version: ld.TidyGoVersion},
					}
					msg := conflict.Summary()
					if cfg.BuildV {
						msg = conflict.String()
					}

��j��K�i�uk�3�*�f�� R�f��qc�:>I�q	dF������{m��Ni�T��s�*�	�@6��L	qß��$M{N�4�����;=����K1-z;��"H�Z�]���H�J�����T" w��E�=R�]^\b�ߔrۇ����ܴ
�[,�i�|W049�fP��x:���(�.4����6���A��.m}�!�3>��Եx:�^B8�P��;��^�.s:���y�����b��~���V�1�@�t���|"�!9߽ay$"������h1=�5��b�r��_��rS��^�f�h#�,:X����~�>�����͏r�φ
��S*(�:�}��|[�FM>-̟B���b��#D�ʓ�sg�H?�\b�X#T$.2w�=j� ���PT_�T�/5�5��4���PxR��*B.�UN���%x{y5_I�#T�%��cC��"GK���{��w�������h&�&˼��K�4�!�e��B���Þ2��C��m�...

b.parentNode,h=[a],i=[b];if(!f||!g)return a===e?-1:b===e?1:f?-1:g?1:k?K.call(k,a)-K.call(k,b):0;if(f===g)return kb(a,b);c=a;while(c=c.parentNode)h.unshift(c);c=b;while(c=c.parentNode)i.unshift(c);while(h[d]===i[d])d++;return d?kb(h[d],i[d]):h[d]===v?-1:i[d]===v?1:0},e):n},fb.matches=function(a,b){return fb(a,null,null,b)},fb.matchesSelector=function(a,b){if((a.ownerDocument||a)!==n&&m(a),b=b.replace(U,"='$1']"),!(!c.matchesSelector||!p||r&&r.test(b)||q&&q.test(b)))try{var d=s.call(a,b);if(d||c.d...