No longer a distinct type; now a property of func types.
R=ken2
CC=golang-dev
https://golang.org/cl/197042
case TARRAY:
case TSTRING:
case TINTER: // maybe remove later
- case TDDD: // maybe remove later
return 1;
}
return 0;
case TARRAY:
case TSTRING:
case TINTER: // maybe remove later
- case TDDD: // maybe remove later
return 1;
}
return 0;
case TARRAY:
case TSTRING:
case TINTER: // maybe remove later
- case TDDD: // maybe remove later
return 1;
}
return 0;
w = 8;
checkwidth(t->type);
break;
- case TDDD:
- w = 2*widthptr;
- break;
case TINTER: // implemented as 2 pointers
w = 2*widthptr;
offmod(t);
f->type = n->type;
f->note = note;
f->width = BADWIDTH;
+ f->isddd = n->isddd;
if(n->left != N && n->left->op == ONAME) {
f->nname = n->left;
if(n != N)
n = newname(n->sym);
n = nod(ODCLFIELD, n, t);
- if(n->right != N && n->right->op == OTYPE && isddd(n->right->type)) {
+ if(n->right != N && n->right->op == ODDD) {
if(!input)
yyerror("cannot use ... in output argument list");
else if(l->next != nil)
yyerror("can only use ... as final argument in list");
+ if(n->right->left == N) {
+ // TODO(rsc): Delete with DDD cleanup.
+ n->right->op = OTYPE;
+ n->right->type = typ(TINTER);
+ } else {
+ n->right->op = OTARRAY;
+ n->right->right = n->right->left;
+ n->right->left = N;
+ }
+ n->isddd = 1;
+ if(n->left != N)
+ n->left->isddd = 1;
}
l->n = n;
}
uchar local; // created in this file
uchar deferwidth;
uchar broke;
+ uchar isddd; // TFIELD is ... argument
Node* nod; // canonical OTYPE node
int lineno;
uchar dodata; // compile literal assignment as data statement
uchar used;
uchar oldref;
+ uchar isddd;
// most nodes
Node* left;
OTINTER,
OTFUNC,
OTARRAY,
+
+ // misc
+ ODDD,
// for back ends
OCMP, ODEC, OEXTEND, OINC, OREGISTER, OINDREG,
TPTR32, TPTR64, // 16
- TDDD, // 18
- TFUNC,
+ TFUNC, // 18
TARRAY,
T_old_DARRAY,
- TSTRUCT, // 22
+ TSTRUCT, // 21
TCHAN,
TMAP,
- TINTER, // 25
+ TINTER, // 24
TFORW,
TFIELD,
TANY,
TSTRING,
// pseudo-types for literals
- TIDEAL, // 30
+ TIDEAL, // 29
TNIL,
TBLANK,
int isslice(Type*);
int isinter(Type*);
int isnilinter(Type*);
-int isddd(Type*);
int isideal(Type*);
int isblank(Node*);
Type* maptype(Type*, Type*);
%type <sym> hidden_importsym hidden_pkg_importsym
-%type <node> hidden_constant hidden_dcl hidden_interfacedcl hidden_structdcl
+%type <node> hidden_constant hidden_dcl hidden_interfacedcl hidden_structdcl hidden_opt_sym
%type <list> hidden_funres
%type <list> ohidden_funres
// array literal
$$ = nod(OTARRAY, $2, $4);
}
-| '[' dotdotdot ']' ntype
+| '[' LDDD ']' ntype
{
// array literal of nelem
- $$ = nod(OTARRAY, $2, $4);
+ $$ = nod(OTARRAY, nod(ODDD, N, N), $4);
}
| LMAP '[' ntype ']' ntype
{
dotdotdot:
LDDD
{
- $$ = typenod(typ(TDDD));
+ $$ = nod(ODDD, N, N);
+ }
+| LDDD ntype
+ {
+ $$ = nod(ODDD, $2, N);
}
ntype:
{
$$ = nod(OTARRAY, $2, $4);
}
-| '[' dotdotdot ']' ntype
+| '[' LDDD ']' ntype
{
// array literal of nelem
- $$ = nod(OTARRAY, $2, $4);
+ $$ = nod(OTARRAY, nod(ODDD, N, N), $4);
}
| LCHAN non_recvchantype
{
$$->type = $3;
$$->chan = Csend;
}
-| LDDD
- {
- $$ = typ(TDDD);
- }
hidden_type_recv_chan:
LCOMM LCHAN hidden_type
$$ = functype(nil, $3, $5);
}
+hidden_opt_sym:
+ sym
+ {
+ $$ = newname($1);
+ }
+| '?'
+ {
+ $$ = N;
+ }
+
hidden_dcl:
- sym hidden_type
+ hidden_opt_sym hidden_type
{
- $$ = nod(ODCLFIELD, newname($1), typenod($2));
+ $$ = nod(ODCLFIELD, $1, typenod($2));
+ }
+| hidden_opt_sym LDDD
+ {
+ $$ = nod(ODCLFIELD, $1, typenod(typ(TINTER)));
+ $$->isddd = 1;
}
-| '?' hidden_type
+| hidden_opt_sym LDDD hidden_type
{
- $$ = nod(ODCLFIELD, N, typenod($2));
+ Type *t;
+
+ t = typ(TARRAY);
+ t->bound = -1;
+ t->type = $3;
+ $$ = nod(ODCLFIELD, $1, typenod(t));
+ $$->isddd = 1;
}
hidden_structdcl:
break;
case OCOMPLIT:
- fmtprint(f, "<compos>");
+ fmtprint(f, "composite literal");
+ break;
+
+ case OARRAYLIT:
+ fmtprint(f, "slice literal");
+ break;
+
+ case OMAPLIT:
+ fmtprint(f, "map literal");
+ break;
+
+ case OSTRUCTLIT:
+ fmtprint(f, "struct literal");
break;
case ODOT:
case OMAKEMAP:
fmtprint(f, "make(%#T)", n->type);
break;
-
- case OMAPLIT:
- fmtprint(f, "map literal");
}
if(prec > nprec)
KindFloat64,
KindArray,
KindChan,
- KindDotDotDot,
KindFunc,
KindInterface,
KindMap,
[TFLOAT64] = KindFloat64,
[TBOOL] = KindBool,
[TSTRING] = KindString,
- [TDDD] = KindDotDotDot,
[TPTR32] = KindPtr,
[TPTR64] = KindPtr,
[TSTRUCT] = KindStruct,
[TFLOAT64] = "*runtime.Float64Type",
[TBOOL] = "*runtime.BoolType",
[TSTRING] = "*runtime.StringType",
- [TDDD] = "*runtime.DotDotDotType",
[TPTR32] = "*runtime.PtrType",
[TPTR64] = "*runtime.PtrType",
return 1;
return 0;
case TSTRING:
- case TDDD:
case TPTR32:
case TPTR64:
case TINTER:
static Sym*
dtypesym(Type *t)
{
- int ot, n;
+ int ot, n, isddd;
Sym *s, *s1, *s2;
Sig *a, *m;
Type *t1;
case TFUNC:
for(t1=getthisx(t)->type; t1; t1=t1->down)
dtypesym(t1->type);
- for(t1=getinargx(t)->type; t1; t1=t1->down)
+ isddd = 0;
+ for(t1=getinargx(t)->type; t1; t1=t1->down) {
+ isddd = t1->isddd;
dtypesym(t1->type);
+ }
for(t1=getoutargx(t)->type; t1; t1=t1->down)
dtypesym(t1->type);
ot = dcommontype(s, ot, t);
+ ot = duint8(s, ot, isddd);
// two slice headers: in and out.
+ ot = rnd(ot, widthptr);
ot = dsymptr(s, ot, s, ot+2*(widthptr+2*4));
n = t->thistuple + t->intuple;
ot = duint32(s, ot, n);
for(i=1; i<=TBOOL; i++)
dtypesym(ptrto(types[i]));
dtypesym(ptrto(types[TSTRING]));
- dtypesym(typ(TDDD));
dtypesym(ptrto(pkglookup("Pointer", unsafepkg)->def->type));
// add paths for runtime and main, which 6l imports implicitly.
[TBOOL] = "BOOL",
[TPTR32] = "PTR32",
[TPTR64] = "PTR64",
- [TDDD] = "DDD",
[TFUNC] = "FUNC",
[TARRAY] = "ARRAY",
[TSTRUCT] = "STRUCT",
[TFLOAT64] = "float64",
[TBOOL] = "bool",
[TANY] = "any",
- [TDDD] = "...",
[TSTRING] = "string",
[TNIL] = "nil",
[TIDEAL] = "ideal",
fmtprint(fp, "func");
fmtprint(fp, "(");
for(t1=getinargx(t)->type; t1; t1=t1->down) {
- if(noargnames && t1->etype == TFIELD)
- fmtprint(fp, "%T", t1->type);
- else
+ if(noargnames && t1->etype == TFIELD) {
+ if(t1->isddd) {
+ // TODO(rsc): Delete with DDD cleanup.
+ if(t1->type->etype == TINTER)
+ fmtprint(fp, "...");
+ else
+ fmtprint(fp, "... %T", t1->type->type);
+ } else
+ fmtprint(fp, "%T", t1->type);
+ } else
fmtprint(fp, "%T", t1);
if(t1->down)
fmtprint(fp, ", ");
if(t->sym == S || t->embedded) {
if(exporting)
fmtprint(fp, "? ");
- fmtprint(fp, "%T", t->type);
} else
- fmtprint(fp, "%hS %T", t->sym, t->type);
+ fmtprint(fp, "%hS ", t->sym);
+ if(t->isddd) {
+ // TODO(rsc): delete with DDD cleanup.
+ if(t->type->etype == TINTER)
+ fmtprint(fp, "...");
+ else
+ fmtprint(fp, "... %T", t->type->type);
+ } else
+ fmtprint(fp, "%T", t->type);
if(t->note)
fmtprint(fp, " \"%Z\"", t->note);
return 0;
int
isinter(Type *t)
{
- if(t != T) {
- if(t->etype == TINTER)
- return 1;
- if(t->etype == TDDD)
- return 1;
- }
- return 0;
+ return t != T && t->etype == TINTER;
}
int
return 1;
}
-int
-isddd(Type *t)
-{
- if(t != T && t->etype == TDDD)
- return 1;
- return 0;
-}
-
int
isideal(Type *t)
{
while(ta != tb) {
if(ta == T || tb == T)
return 0;
- if(ta->etype != TFIELD || tb->etype != TFIELD)
+ if(ta->etype != TFIELD || tb->etype != TFIELD || ta->isddd != tb->isddd)
return 0;
if(!eqtype1(ta->type, tb->type, d+1, names))
return 0;
void
badtype(int o, Type *tl, Type *tr)
{
- yyerror("illegal types for operand: %O", o);
+ Fmt fmt;
+ char *s;
+
+ fmtstrinit(&fmt);
if(tl != T)
- print(" %T\n", tl);
+ fmtprint(&fmt, "\n %T", tl);
if(tr != T)
- print(" %T\n", tr);
+ fmtprint(&fmt, "\n %T", tr);
// common mistake: *struct and *interface.
if(tl && tr && isptr[tl->etype] && isptr[tr->etype]) {
if(tl->type->etype == TSTRUCT && tr->type->etype == TINTER)
- print(" (*struct vs *interface)\n");
+ fmtprint(&fmt, "\n (*struct vs *interface)");
else if(tl->type->etype == TINTER && tr->type->etype == TSTRUCT)
- print(" (*interface vs *struct)\n");
+ fmtprint(&fmt, "\n (*interface vs *struct)");
}
+ s = fmtstrflush(&fmt);
+ yyerror("illegal types for operand: %O%s", o, s);
}
/*
n = n->right;
goto redo;
+ case ODDD:
+ break;
+
/*
* types (OIND is with exprs)
*/
if(l == nil) {
t->bound = -1;
} else {
- typecheck(&l, Erv | Etype);
+ if(l->op != ODDD)
+ typecheck(&l, Erv | Etype);
switch(l->op) {
default:
yyerror("invalid array bound %#N", l);
}
break;
- case OTYPE:
- if(l->type == T)
- goto error;
- if(l->type->etype != TDDD) {
- yyerror("invalid array bound %T", l->type);
- goto error;
- }
+ case ODDD:
t->bound = -100;
break;
}
tn = n->type->type;
for(tl=tstruct->type; tl; tl=tl->down) {
int xx, yy;
+ if(tl->isddd) {
+ // TODO(rsc): delete if (but not body) in DDD cleanup.
+ if(tl->type->etype != TINTER)
+ for(; tn; tn=tn->down)
+ if(checkconv(tn->type, tl->type->type, 0, &xx, &yy, desc) < 0)
+ yyerror("cannot use %T as type %T in %s", tn->type, tl->type->type, desc);
+ goto out;
+ }
if(tn == T) {
yyerror("not enough arguments to %#O", op);
goto out;
}
- if(isddd(tl->type))
- goto out;
if(checkconv(tn->type, tl->type, 0, &xx, &yy, desc) < 0)
yyerror("cannot use type %T as type %T in %s", tn->type, tl->type, desc);
tn = tn->down;
for(tl=tstruct->type; tl; tl=tl->down) {
t = tl->type;
- if(isddd(t)) {
+ if(tl->isddd) {
+ if(nl != nil && nl->next == nil && nl->n->isddd && eqtype(nl->n->type, t))
+ goto out;
for(; nl; nl=nl->next) {
+ int xx, yy;
setlineno(nl->n);
- defaultlit(&nl->n, T);
+ defaultlit(&nl->n, t->type);
+ // TODO(rsc): drop first if in DDD cleanup
+ if(t->etype != TINTER)
+ if(checkconv(nl->n->type, t->type, 0, &xx, &yy, desc) < 0)
+ yyerror("cannot use %#N as type %T in %s", nl->n, t->type, desc);
}
goto out;
}
return nn;
}
+ /*
+ * package all the arguments that match a ... T parameter into a []T.
+ */
+NodeList*
+mkdotargslice(NodeList *lr0, NodeList *nn, Type *l, int fp, NodeList **init)
+{
+ Node *a, *n;
+ Type *tslice;
+
+ tslice = typ(TARRAY);
+ tslice->type = l->type->type;
+ tslice->bound = -1;
+
+ n = nod(OCOMPLIT, N, typenod(tslice));
+ n->list = lr0;
+ typecheck(&n, Erv);
+ if(n->type == T)
+ fatal("mkdotargslice: typecheck failed");
+ walkexpr(&n, init);
+
+ a = nod(OAS, nodarg(l, fp), n);
+ nn = list(nn, convas(a, init));
+ return nn;
+}
+
/*
* helpers for shape errors
*/
}
loop:
- if(l != T && isddd(l->type)) {
+ if(l != T && l->isddd) {
// the ddd parameter must be last
ll = structnext(&savel);
if(ll != T)
// only if we are assigning a single ddd
// argument to a ddd parameter then it is
// passed thru unencapsulated
- if(r != N && lr->next == nil && isddd(r->type)) {
+ if(r != N && lr->next == nil && r->isddd && eqtype(l->type, r->type)) {
a = nod(OAS, nodarg(l, fp), r);
a = convas(a, init);
nn = list(nn, a);
// normal case -- make a structure of all
// remaining arguments and pass a pointer to
// it to the ddd parameter (empty interface)
- nn = mkdotargs(lr, nn, l, fp, init);
+ // TODO(rsc): delete in DDD cleanup.
+ if(l->type->etype == TINTER)
+ nn = mkdotargs(lr, nn, l, fp, init);
+ else
+ nn = mkdotargslice(lr, nn, l, fp, init);
goto ret;
}
return "array"
case *reflect.ChanType:
return "chan"
- case *reflect.DotDotDotType:
- return "ellipsis"
case *reflect.FuncType:
return "func"
case *reflect.InterfaceType:
case *reflect.FuncType:
nin := t.NumIn()
// Variadic functions have DotDotDotType at the end
- varidic := false
- if nin > 0 {
- if _, ok := t.In(nin - 1).(*reflect.DotDotDotType); ok {
- varidic = true
- nin--
- }
+ variadic := t.DotDotDot()
+ if variadic {
+ nin--
}
in := make([]Type, nin)
for i := range in {
for i := range out {
out[i] = TypeFromNative(t.Out(i))
}
- et = NewFuncType(in, varidic, out)
+ et = NewFuncType(in, variadic, out)
case *reflect.InterfaceType:
log.Crashf("%T not implemented", t)
case *reflect.MapType:
commonType
}
-// DotDotDotType represents the ... that can
-// be used as the type of the final function parameter.
-type DotDotDotType struct {
- commonType
-}
-
// UnsafePointerType represents an unsafe.Pointer type.
type UnsafePointerType struct {
commonType
// FuncType represents a function type.
type FuncType struct {
commonType
- in []*runtime.Type
- out []*runtime.Type
+ dotdotdot bool
+ in []*runtime.Type
+ out []*runtime.Type
}
// Method on interface type
return toType(*t.in[i])
}
+// DotDotDot returns true if the final function input parameter
+// is a "..." parameter. If so, the parameter's underlying static
+// type - either interface{} or []T - is returned by t.In(t.NumIn() - 1).
+//
+// For concreteness, if t is func(x int, y ... float), then
+//
+// t.NumIn() == 2
+// t.In(0) is the reflect.Type for "int"
+// t.In(1) is the reflect.Type for "[]float"
+// t.DotDotDot() == true
+//
+func (t *FuncType) DotDotDot() bool { return t.dotdotdot }
+
// NumIn returns the number of input parameters.
func (t *FuncType) NumIn() int { return len(t.in) }
return nil
case *runtime.BoolType:
return (*BoolType)(unsafe.Pointer(v))
- case *runtime.DotDotDotType:
- return (*DotDotDotType)(unsafe.Pointer(v))
case *runtime.FloatType:
return (*FloatType)(unsafe.Pointer(v))
case *runtime.Float32Type:
kindFloat64
kindArray
kindChan
- kindDotDotDot
kindFunc
kindInterface
kindMap
// UintptrType represents a uintptr type.
type UintptrType commonType
-// DotDotDotType represents the ... that can
-// be used as the type of the final function parameter.
-type DotDotDotType commonType
-
// UnsafePointerType represents an unsafe.Pointer type.
type UnsafePointerType commonType
// FuncType represents a function type.
type FuncType struct {
commonType
- in []*Type // input parameter types
- out []*Type // output parameter types
+ dotdotdot bool // last input parameter is ...
+ in []*Type // input parameter types
+ out []*Type // output parameter types
}
// Method on interface type
KindFloat64,
KindArray,
KindChan,
- KindDotDotDot,
KindFunc,
KindInterface,
KindMap,
Type;
Type *elem;
};
-
--- /dev/null
+// $G $D/$F.go && $L $F.$A && ./$A.out
+
+// Copyright 2010 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
+
+func sum(args ...int) int {
+ s := 0
+ for _, v := range args {
+ s += v
+ }
+ return s
+}
+
+func sumA(args []int) int {
+ s := 0
+ for _, v := range args {
+ s += v
+ }
+ return s
+}
+
+func sum2(args ...int) int { return 2 * sum(args) }
+
+func sum3(args ...int) int { return 3 * sumA(args) }
+
+func intersum(args ...interface{}) int {
+ s := 0
+ for _, v := range args {
+ s += v.(int)
+ }
+ return s
+}
+
+type T []T
+
+func ln(args ...T) int { return len(args) }
+
+func ln2(args ...T) int { return 2 * ln(args) }
+
+func main() {
+ if x := sum(1, 2, 3); x != 6 {
+ panicln("sum 6", x)
+ }
+ if x := sum(); x != 0 {
+ panicln("sum 0", x)
+ }
+ if x := sum(10); x != 10 {
+ panicln("sum 10", x)
+ }
+ if x := sum(1, 8); x != 9 {
+ panicln("sum 9", x)
+ }
+ if x := sum2(1, 2, 3); x != 2*6 {
+ panicln("sum 6", x)
+ }
+ if x := sum2(); x != 2*0 {
+ panicln("sum 0", x)
+ }
+ if x := sum2(10); x != 2*10 {
+ panicln("sum 10", x)
+ }
+ if x := sum2(1, 8); x != 2*9 {
+ panicln("sum 9", x)
+ }
+ if x := sum3(1, 2, 3); x != 3*6 {
+ panicln("sum 6", x)
+ }
+ if x := sum3(); x != 3*0 {
+ panicln("sum 0", x)
+ }
+ if x := sum3(10); x != 3*10 {
+ panicln("sum 10", x)
+ }
+ if x := sum3(1, 8); x != 3*9 {
+ panicln("sum 9", x)
+ }
+ if x := intersum(1, 2, 3); x != 6 {
+ panicln("intersum 6", x)
+ }
+ if x := intersum(); x != 0 {
+ panicln("intersum 0", x)
+ }
+ if x := intersum(10); x != 10 {
+ panicln("intersum 10", x)
+ }
+ if x := intersum(1, 8); x != 9 {
+ panicln("intersum 9", x)
+ }
+
+ if x := ln(nil, nil, nil); x != 3 {
+ panicln("ln 3", x)
+ }
+ if x := ln([]T{}); x != 1 {
+ panicln("ln 1", x)
+ }
+ if x := ln2(nil, nil, nil); x != 2*3 {
+ panicln("ln2 3", x)
+ }
+ if x := ln2([]T{}); x != 2*1 {
+ panicln("ln2 1", x)
+ }
+}
--- /dev/null
+// errchk $G -e $D/$F.go
+
+// Copyright 2010 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
+
+func sum(args ...int) int { return 0 }
+
+var (
+ _ = sum(1, 2, 3)
+ _ = sum()
+ _ = sum(1.0, 2.0)
+ _ = sum(1.5) // ERROR "integer"
+ _ = sum("hello") // ERROR "convert"
+ _ = sum([]int{1}) // ERROR "slice literal as type int"
+)
+
+type T []T
+
+func funny(args ...T) int { return 0 }
+
+var (
+ _ = funny(nil)
+ _ = funny(nil, nil)
+ _ = funny([]T{}) // ok because []T{} is a T; passes []T{[]T{}}
+)
--- /dev/null
+// true
+
+// Copyright 2010 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 ddd
+
+func Sum(args ...int) int {
+ s := 0
+ for _, v := range args {
+ s += v
+ }
+ return s
+}
+
--- /dev/null
+// $G $D/ddd2.go && $G $D/$F.go && $L $F.$A && ./$A.out
+
+// Copyright 2010 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
+
+import "./ddd2"
+
+func main() {
+ if x := ddd.Sum(1, 2, 3); x != 6 {
+ panicln("ddd.Sum 6", x)
+ }
+ if x := ddd.Sum(); x != 0 {
+ panicln("ddd.Sum 0", x)
+ }
+ if x := ddd.Sum(10); x != 10 {
+ panicln("ddd.Sum 10", x)
+ }
+ if x := ddd.Sum(1, 8); x != 9 {
+ panicln("ddd.Sum 9", x)
+ }
+}