_linters/src/honnef.co/go/tools/ssa/builder.go
func (b *builder) rangeStmt(fn *Function, s *ast.RangeStmt, label *lblock) {
	var tk, tv types.Type
	if s.Key != nil && !isBlankIdent(s.Key) {
		tk = fn.Pkg.typeOf(s.Key)
	}
	if s.Value != nil && !isBlankIdent(s.Value) {
		tv = fn.Pkg.typeOf(s.Value)
	}

	// If iteration variables are defined (:=), this
	// occurs once outside the loop.
	//
	// Unlike a short variable declaration, a RangeStmt
	// using := never redeclares an existing variable; it
	// always creates a new one.
	if s.Tok == token.DEFINE {
		if tk != nil {
			fn.addLocalForIdent(s.Key.(*ast.Ident))
		}
		if tv != nil {
			fn.addLocalForIdent(s.Value.(*ast.Ident))
		}
	}

	x := b.expr(fn, s.X)

	var k, v Value
	var loop, done *BasicBlock
	switch rt := x.Type().Underlying().(type) {
	case *types.Slice, *types.Array, *types.Pointer: // *array
		k, v, loop, done = b.rangeIndexed(fn, x, tv, s.For)

	case *types.Chan:
		k, loop, done = b.rangeChan(fn, x, tk, s.For)

	case *types.Map, *types.Basic: // string
		k, v, loop, done = b.rangeIter(fn, x, tk, tv, s.For)

	default:
		panic("Cannot range over: " + rt.String())
	}

	// Evaluate both LHS expressions before we update either.
	var kl, vl lvalue
	if tk != nil {
		kl = b.addr(fn, s.Key, false) // non-escaping
	}
	if tv != nil {
		vl = b.addr(fn, s.Value, false) // non-escaping
	}
	if tk != nil {
		kl.store(fn, k)
	}
	if tv != nil {
		vl.store(fn, v)
	}

	if label != nil {
		label._break = done
		label._continue = loop
	}

	fn.targets = &targets{
		tail:      fn.targets,
		_break:    done,
		_continue: loop,
	}
	b.stmt(fn, s.Body)
	fn.targets = fn.targets.tail
	emitJump(fn, loop) // back-edge
	fn.currentBlock = done
}
func (b *builder) rangeStmt(fn *Function, s *ast.RangeStmt, label *lblock) {
	var tk, tv types.Type
	if s.Key != nil && !isBlankIdent(s.Key) {
		tk = fn.Pkg.typeOf(s.Key)
	}
	if s.Value != nil && !isBlankIdent(s.Value) {
		tv = fn.Pkg.typeOf(s.Value)
	}

	// If iteration variables are defined (:=), this
	// occurs once outside the loop.
	//
	// Unlike a short variable declaration, a RangeStmt
	// using := never redeclares an existing variable; it
	// always creates a new one.
	if s.Tok == token.DEFINE {
		if tk != nil {
			fn.addLocalForIdent(s.Key.(*ast.Ident))
		}
		if tv != nil {
			fn.addLocalForIdent(s.Value.(*ast.Ident))
		}
	}

	x := b.expr(fn, s.X)

	var k, v Value
	var loop, done *BasicBlock
	switch rt := x.Type().Underlying().(type) {
	case *types.Slice, *types.Array, *types.Pointer: // *array
		k, v, loop, done = b.rangeIndexed(fn, x, tv, s.For)

	case *types.Chan:
		k, loop, done = b.rangeChan(fn, x, tk, s.For)

	case *types.Map, *types.Basic: // string
		k, v, loop, done = b.rangeIter(fn, x, tk, tv, s.For)

	default:
		panic("Cannot range over: " + rt.String())
	}

	// Evaluate both LHS expressions before we update either.
	var kl, vl lvalue
	if tk != nil {
		kl = b.addr(fn, s.Key, false) // non-escaping
	}
	if tv != nil {
		vl = b.addr(fn, s.Value, false) // non-escaping
	}
	if tk != nil {
		kl.store(fn, k)
	}
	if tv != nil {
		vl.store(fn, v)
	}

	if label != nil {
		label._break = done
		label._continue = loop
	}

	fn.targets = &targets{
		tail:      fn.targets,
		_break:    done,
		_continue: loop,
	}
	b.stmt(fn, s.Body)
	fn.targets = fn.targets.tail
	emitJump(fn, loop) // back-edge
	fn.currentBlock = done
}
func ( b * builder ) rangeStmt ( fn * Function , s * ast . RangeStmt , label * lblock ) { var tk , tv types . Type if s . Key != nil && ! isBlankIdent ( s . Key ) { tk = fn . Pkg . typeOf ( s . Key ) } if s . Value != nil && ! isBlankIdent ( s . Value ) { tv = fn . Pkg . typeOf ( s . Value ) } // If iteration variables are defined (:=), this // occurs once outside the loop. // // Unlike a short variable declaration, a RangeStmt // using := never redeclares an existing variable; it // always creates a new one. if s . Tok == token . DEFINE { if tk != nil { fn . addLocalForIdent ( s . Key . ( * ast . Ident ) ) } if tv != nil { fn . addLocalForIdent ( s . Value . ( * ast . Ident ) ) } } x := b . expr ( fn , s . X ) var k , v Value var loop , done * BasicBlock switch rt := x . Type ( ) . Underlying ( ) . ( type ) { case * types . Slice , * types . Array , * types . Pointer : // *array k , v , loop , done = b . rangeIndexed ( fn , x , tv , s . For ) case * types . Chan : k , loop , done = b . rangeChan ( fn , x , tk , s . For ) case * types . Map , * types . Basic : // string k , v , loop , done = b . rangeIter ( fn , x , tk , tv , s . For ) default : panic ( " " + rt . String ( ) ) } // Evaluate both LHS expressions before we update either. var kl , vl lvalue if tk != nil { kl = b . addr ( fn , s . Key , false ) // non-escaping } if tv != nil { vl = b . addr ( fn , s . Value , false ) // non-escaping } if tk != nil { kl . store ( fn , k ) } if tv != nil { vl . store ( fn , v ) } if label != nil { label . _break = done label . _continue = loop } fn . targets = & targets { tail : fn . targets , _break : done , _continue : loop , } b . stmt ( fn , s . Body ) fn . targets = fn . targets . tail emitJump ( fn , loop ) // back-edge fn . currentBlock = done }
// rangeStmt emits to fn code for the range statement s, optionally
// labelled by label.
//
rangeStmt emits to fn code for the range statement s optionally labelled by label .