@@ -462,33 +462,6 @@ func finishCompare(n *ir.BinaryExpr, r ir.Node, init *ir.Nodes) ir.Node {
462
462
return r
463
463
}
464
464
465
- func eqFor (t * types.Type ) (n ir.Node , needsize bool ) {
466
- // Should only arrive here with large memory or
467
- // a struct/array containing a non-memory field/element.
468
- // Small memory is handled inline, and single non-memory
469
- // is handled by walkCompare.
470
- switch a , _ := types .AlgType (t ); a {
471
- case types .AMEM :
472
- n := typecheck .LookupRuntime ("memequal" )
473
- n = typecheck .SubstArgTypes (n , t , t )
474
- return n , true
475
- case types .ASPECIAL :
476
- sym := reflectdata .TypeSymPrefix (".eq" , t )
477
- // TODO(austin): This creates an ir.Name with a nil Func.
478
- n := typecheck .NewName (sym )
479
- ir .MarkFunc (n )
480
- n .SetType (types .NewSignature (nil , []* types.Field {
481
- types .NewField (base .Pos , nil , types .NewPtr (t )),
482
- types .NewField (base .Pos , nil , types .NewPtr (t )),
483
- }, []* types.Field {
484
- types .NewField (base .Pos , nil , types .Types [types .TBOOL ]),
485
- }))
486
- return n , false
487
- }
488
- base .Fatalf ("eqFor %v" , t )
489
- return nil , false
490
- }
491
-
492
465
// brcom returns !(op).
493
466
// For example, brcom(==) is !=.
494
467
func brcom (op ir.Op ) ir.Op {
0 commit comments