From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001
From: upstream source tree <ports@midipix.org>
Date: Sun, 15 Mar 2015 20:14:05 -0400
Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified
 gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream
 tarball.

downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.

if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.
---
 gcc/testsuite/go.test/test/ken/range.go | 119 ++++++++++++++++++++++++++++++++
 1 file changed, 119 insertions(+)
 create mode 100644 gcc/testsuite/go.test/test/ken/range.go

(limited to 'gcc/testsuite/go.test/test/ken/range.go')

diff --git a/gcc/testsuite/go.test/test/ken/range.go b/gcc/testsuite/go.test/test/ken/range.go
new file mode 100644
index 000000000..9535fd497
--- /dev/null
+++ b/gcc/testsuite/go.test/test/ken/range.go
@@ -0,0 +1,119 @@
+// $G $D/$F.go && $L $F.$A && ./$A.out
+
+// Copyright 2009 The Go Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package main
+
+const size = 16
+
+var a [size]byte
+var p []byte
+var m map[int]byte
+
+func f(k int) byte {
+	return byte(k * 10007 % size)
+}
+
+func init() {
+	p = make([]byte, size)
+	m = make(map[int]byte)
+	for k := 0; k < size; k++ {
+		v := f(k)
+		a[k] = v
+		p[k] = v
+		m[k] = v
+	}
+}
+
+func main() {
+	var i int
+
+	/*
+	 * key only
+	 */
+	i = 0
+	for k := range a {
+		v := a[k]
+		if v != f(k) {
+			println("key array range", k, v, a[k])
+			panic("fail")
+		}
+		i++
+	}
+	if i != size {
+		println("key array size", i)
+		panic("fail")
+	}
+
+	i = 0
+	for k := range p {
+		v := p[k]
+		if v != f(k) {
+			println("key pointer range", k, v, p[k])
+			panic("fail")
+		}
+		i++
+	}
+	if i != size {
+		println("key pointer size", i)
+		panic("fail")
+	}
+
+	i = 0
+	for k := range m {
+		v := m[k]
+		if v != f(k) {
+			println("key map range", k, v, m[k])
+			panic("fail")
+		}
+		i++
+	}
+	if i != size {
+		println("key map size", i)
+		panic("fail")
+	}
+
+	/*
+	 * key,value
+	 */
+	i = 0
+	for k, v := range a {
+		if v != f(k) {
+			println("key:value array range", k, v, a[k])
+			panic("fail")
+		}
+		i++
+	}
+	if i != size {
+		println("key:value array size", i)
+		panic("fail")
+	}
+
+	i = 0
+	for k, v := range p {
+		if v != f(k) {
+			println("key:value pointer range", k, v, p[k])
+			panic("fail")
+		}
+		i++
+	}
+	if i != size {
+		println("key:value pointer size", i)
+		panic("fail")
+	}
+
+	i = 0
+	for k, v := range m {
+		if v != f(k) {
+			println("key:value map range", k, v, m[k])
+			panic("fail")
+		}
+		i++
+	}
+	if i != size {
+		println("key:value map size", i)
+		panic("fail")
+	}
+}
-- 
cgit v1.2.3