@@ -519,8 +519,8 @@ void brcombine(ref GlobalOptimizer go, ref BlockOpt bo)
519519 const bc = b.bc;
520520 if (bc == BC .iftrue)
521521 {
522- block* b2 = b.nthSucc (0 );
523- block* b3 = b.nthSucc (1 );
522+ block* b2 = b.Bsuccx (0 );
523+ block* b3 = b.Bsuccx (1 );
524524
525525 if (b2.Bpred.length > 1 ) // if more than one predecessor
526526 continue ;
@@ -533,7 +533,7 @@ void brcombine(ref GlobalOptimizer go, ref BlockOpt bo)
533533
534534 const bc2 = b2.bc;
535535 if (bc2 == BC .goto_ &&
536- b3 == b2.nthSucc (0 ))
536+ b3 == b2.Bsuccx (0 ))
537537 {
538538 b.bc = BC .goto_;
539539 if (b2.Belem)
@@ -570,9 +570,9 @@ void brcombine(ref GlobalOptimizer go, ref BlockOpt bo)
570570 }
571571 else if (bc2 == BC .goto_ &&
572572 b3.bc == BC .goto_ &&
573- b2.nthSucc (0 ) == b3.nthSucc (0 ))
573+ b2.Bsuccx (0 ) == b3.Bsuccx (0 ))
574574 {
575- block* bsucc = b2.nthSucc (0 );
575+ block* bsucc = b2.Bsuccx (0 );
576576 if (b2.Belem)
577577 {
578578 elem* e;
@@ -680,13 +680,13 @@ private void bropt(ref GlobalOptimizer go, ref BlockOpt bo)
680680 if (iftrue(n)) /* if elem is true */
681681 {
682682 // select first succ
683- db = b.nthSucc (1 );
683+ db = b.Bsuccx (1 );
684684 goto L1 ;
685685 }
686686 else if (iffalse(n))
687687 {
688688 // select second succ
689- db = b.nthSucc (0 );
689+ db = b.Bsuccx (0 );
690690
691691 L1 :
692692 list_subtract(&(b.Bsucc),db);
@@ -699,11 +699,11 @@ private void bropt(ref GlobalOptimizer go, ref BlockOpt bo)
699699 }
700700
701701 /* Look for both destinations being the same */
702- else if (b.nthSucc (0 ) ==
703- b.nthSucc (1 ))
702+ else if (b.Bsuccx (0 ) ==
703+ b.Bsuccx (1 ))
704704 {
705705 b.bc = BC .goto_;
706- db = b.nthSucc (0 );
706+ db = b.Bsuccx (0 );
707707 list_subtract(&(b.Bsucc),db);
708708 db.Bpred.subtract(b);
709709 debug if (debugc) printf(" CHANGE: if (e) goto L1; else goto L1;\n " );
@@ -727,7 +727,7 @@ private void bropt(ref GlobalOptimizer go, ref BlockOpt bo)
727727 break ;
728728 }
729729 }
730- block* db = b.nthSucc (i);
730+ block* db = b.Bsuccx (i);
731731
732732 /* delete predecessors of successors (!) */
733733 foreach (bl; ListRange(b.Bsucc))
@@ -776,7 +776,7 @@ private void brrear(ref BlockOpt bo)
776776
777777 static if (NTEXCEPTIONS )
778778 enum additionalAnd = " b.Btry == bt.Btry &&
779- bt.Btry == bt.nthSucc (0).Btry" ;
779+ bt.Btry == bt.Bsuccx (0).Btry" ;
780780 else
781781 enum additionalAnd = " true" ;
782782
@@ -814,8 +814,8 @@ private void brrear(ref BlockOpt bo)
814814
815815 if (b.bc == BC .iftrue || b.bc == BC .iffalse)
816816 {
817- block* bif = b.nthSucc (0 );
818- block* belse = b.nthSucc (1 );
817+ block* bif = b.Bsuccx (0 );
818+ block* belse = b.Bsuccx (1 );
819819
820820 if (bif == b.Bnext)
821821 {
0 commit comments