return nil
	}
	typ := ValueOf(f).Type()
	f2 := MakeFunc(typ, g).Interface().(func(string, string, string, string, string))
	f2("four", "five5", "six666", "seven77", "eight888")
}

// Issue 18635 (function version).
func TestKeepFuncLive(t *testing.T) {
	// Test that we keep makeFuncImpl live as long as it is
	// referenced on the stack.
	typ := TypeOf(func(i int) {})
	var f, g func(in []Value) []Value

		return nil, err
	}
	if _, err := p.ScalarMult(p, local.privateKey); err != nil {
		return nil, err
	}
	return p.BytesX()
}

// P256 returns a [Curve] which implements NIST P-256 (FIPS 186-3, section D.2.3),
// also known as secp256r1 or prime256v1.
//
// Multiple invocations of this function will return the same value, which can
// be used for equality checks and switch statements.

		"etcd client port to use during migration operations. "+
			"This should be a different port than typically used by etcd to avoid clients accidentally connecting during upgrade/downgrade operations. "+
			"If unset default to 18629 or 18631 depending on <data-dir>.")
	flags.Uint64Var(&opts.peerPort, "peer-port", 0,
		"etcd peer port to use during migration operations. If unset defaults to 2380 or 2381 depending on <data-dir>.")

    }

    boolean jdkTypeDuplicatesOwnerName() {
      return true;
    }
  }

  /**
   * Per <a href="https://code.google.com/p/guava-libraries/issues/detail?id=1635">issue 1635</a>,
   * In JDK 1.7.0_51-b13, {@link TypeVariableImpl#equals(Object)} is changed to no longer be equal
   * to custom TypeVariable implementations. As a result, we need to make sure our TypeVariable

    }

    boolean jdkTypeDuplicatesOwnerName() {
      return true;
    }
  }

  /**
   * Per <a href="https://code.google.com/p/guava-libraries/issues/detail?id=1635">issue 1635</a>,
   * In JDK 1.7.0_51-b13, {@link TypeVariableImpl#equals(Object)} is changed to no longer be equal
   * to custom TypeVariable implementations. As a result, we need to make sure our TypeVariable

	SYS___ISWLOWER_A                    = 0x745 // 1861
	SYS___ISWPRINT_A                    = 0x746 // 1862
	SYS___ISWPUNCT_A                    = 0x747 // 1863
	SYS___ISWSPACE_A                    = 0x748 // 1864
	SYS___ISWUPPER_A                    = 0x749 // 1865
	SYS___ISWXDIGIT_A                   = 0x74A // 1866
	SYS___CONFSTR_A                     = 0x74B // 1867
	SYS___FTOK_A                        = 0x74C // 1868

00000160  c8 35 fe c2 9a 17 33 18  51 c2 cd 19 7c dc 5d c5  |.5....3.Q...|.].|
00000170  7c e6 d0 38 ab 28 0b 8c  78 51 aa 7f ef f0 9a c3  ||..8.(..xQ......|
00000180  df 26 d2 bc 1b b6 98 b1  16 35 9d f0 73 b7 15 f7  |.&.......5..s...|
00000190  7d 9f 3e fe 4c 75 e7 c7  5d cb c2 e5 29 4a 30 32  |}.>.Lu..]...)J02|
000001a0  e2 da 3c 2c 16 ba 89 41  28 5c 33 75 b3 ed d1 e6  |..<,...A(\3u....|

struct ibv_async_event {
	union {
		int x;
	} element;
};
struct ibv_context {
	xxpthread_mutex_t mutex;
};

// issue 1635
// Mac OS X's gcc will generate scattered relocation 2/1 for
// this function on Darwin/386, and 8l couldn't handle it.
// this example is in issue 1635
void scatter() {
	void *p = scatter;
	printf("scatter = %p\n", p);
}

			delta := d.hashOffset - 1
			d.hashOffset -= delta
			d.chainHead -= delta

			// Iterate over slices instead of arrays to avoid copying
			// the entire table onto the stack (Issue #18625).
			for i, v := range d.hashPrev[:] {
				if int(v) > delta {
					d.hashPrev[i] = uint32(int(v) - delta)
				} else {
					d.hashPrev[i] = 0
				}
			}
			for i, v := range d.hashHead[:] {

GoStart dt=7 g=40 g_seq=3
GoDestroy dt=168735
ProcStop dt=43
ProcStart dt=799345 p=6 p_seq=6
ProcStop dt=33
ProcStart dt=1506 p=6 p_seq=10
ProcStop dt=26
ProcStart dt=18634 p=7 p_seq=33
ProcStop dt=34
EventBatch gen=1 m=18446744073709551615 time=7689672466616 size=28
GoStatus dt=61 g=2 m=18446744073709551615 gstatus=4
GoStatus dt=3 g=5 m=18446744073709551615 gstatus=4