code review 6245069: cmd/gc: contiguous loop layout

src/cmd/gc/cplx.c

 // 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.
 
 #include <u.h>
 #include <libc.h>
 #include "gg.h"
 
 static  void    subnode(Node *nr, Node *ni, Node *nc);
 static  void    minus(Node *nl, Node *res);
@@ skipping 253 matching lines @@
                 complexadd(n->op, nl, nr, res);
                 break;
 
         case OMUL:
                 complexmul(nl, nr, res);
                 break;
         }
 }
 
 void
-complexbool(int op, Node *nl, Node *nr, int true, Prog *to)
+complexbool(int op, Node *nl, Node *nr, int true, int likely, Prog *to)
 {
         Node tnl, tnr;
         Node n1, n2, n3, n4;
         Node na, nb, nc;
 
         // make both sides addable in ullman order
         if(nr != N) {
                 if(nl->ullman > nr->ullman && !nl->addable) {
                         tempname(&tnl, nl->type);
                         cgen(nl, &tnl);
@@ skipping 31 matching lines @@
 
         memset(&nc, 0, sizeof(na));
         nc.op = OEQ;
         nc.left = &n2;
         nc.right = &n4;
         nc.type = types[TBOOL];
 
         if(op == ONE)
                 true = !true;
 
-        bgen(&na, true, to, 0);
+        bgen(&na, true, likely, to);
 }
 
 void
 nodfconst(Node *n, Type *t, Mpflt* fval)
 {
         memset(n, 0, sizeof(*n));
         n->op = OLITERAL;
         n->addable = 1;
         ullmancalc(n);
         n->val.u.fval = fval;
@@ skipping 140 matching lines @@
         memset(&ra, 0, sizeof(ra));
         ra.op = OADD;
         ra.left = &rm1;
         ra.right = &rm2;
         ra.type = rm1.type;
         cgen(&ra, &n6);
 
         // tmp ->real part
         cgen(&tmp, &n5);
 }