1 /*****************************************************************************/
5 /* Optimizer subroutines */
9 /* (C) 2001-2002 Ullrich von Bassewitz */
11 /* D-70597 Stuttgart */
12 /* EMail: uz@cc65.org */
15 /* This software is provided 'as-is', without any expressed or implied */
16 /* warranty. In no event will the authors be held liable for any damages */
17 /* arising from the use of this software. */
19 /* Permission is granted to anyone to use this software for any purpose, */
20 /* including commercial applications, and to alter it and redistribute it */
21 /* freely, subject to the following restrictions: */
23 /* 1. The origin of this software must not be misrepresented; you must not */
24 /* claim that you wrote the original software. If you use this software */
25 /* in a product, an acknowledgment in the product documentation would be */
26 /* appreciated but is not required. */
27 /* 2. Altered source versions must be plainly marked as such, and must not */
28 /* be misrepresented as being the original software. */
29 /* 3. This notice may not be removed or altered from any source */
32 /*****************************************************************************/
58 #include "coptstore.h"
68 /*****************************************************************************/
70 /*****************************************************************************/
85 /*****************************************************************************/
87 /*****************************************************************************/
91 static unsigned OptShift1 (CodeSeg* S)
92 /* A call to the shlaxN routine may get replaced by one or more asl insns
93 * if the value of X is not used later.
98 /* Walk over the entries */
100 while (I < CS_GetEntryCount (S)) {
103 CodeEntry* E = CS_GetEntry (S, I);
105 /* Check for the sequence */
106 if (E->OPC == OP65_JSR &&
107 (strncmp (E->Arg, "shlax", 5) == 0 ||
108 strncmp (E->Arg, "aslax", 5) == 0) &&
109 strlen (E->Arg) == 6 &&
110 IsDigit (E->Arg[5]) &&
111 !RegXUsed (S, I+1)) {
113 /* Insert shift insns */
114 unsigned Count = E->Arg[5] - '0';
116 CodeEntry* X = NewCodeEntry (OP65_ASL, AM65_ACC, "a", 0, E->LI);
117 CS_InsertEntry (S, X, I+1);
120 /* Delete the call to shlax */
123 /* Remember, we had changes */
133 /* Return the number of changes made */
139 static unsigned OptShift2 (CodeSeg* S)
140 /* A call to the shraxN routine may get replaced by one or more lsr insns
141 * if the value of X is not used later, or if the value of X is known and
145 unsigned Changes = 0;
148 /* Generate register info */
151 /* Walk over the entries */
153 while (I < CS_GetEntryCount (S)) {
156 CodeEntry* E = CS_GetEntry (S, I);
158 /* Check for the sequence */
159 if (E->OPC == OP65_JSR &&
160 strncmp (E->Arg, "shrax", 5) == 0 &&
161 strlen (E->Arg) == 6 &&
162 IsDigit (E->Arg[5]) &&
163 (E->RI->In.RegX == 0 || !RegXUsed (S, I+1))) {
165 /* Insert shift insns */
166 unsigned Count = E->Arg[5] - '0';
168 CodeEntry* X = NewCodeEntry (OP65_LSR, AM65_ACC, "a", 0, E->LI);
169 CS_InsertEntry (S, X, I+1);
172 /* Delete the call to shlax */
175 /* Remember, we had changes */
185 /* Free the register info */
188 /* Return the number of changes made */
194 static unsigned GetShiftType (const char* Sub)
195 /* Helper function for OptShift3 */
198 if (strcmp (Sub+1, "slax1") == 0) {
200 } else if (strcmp (Sub+1, "srax1") == 0) {
203 } else if (*Sub == 's') {
204 if (strcmp (Sub+1, "hlax1") == 0) {
206 } else if (strcmp (Sub+1, "hrax1") == 0) {
215 static unsigned OptShift3 (CodeSeg* S)
216 /* Search for the sequence
220 * jsr aslax1/asrax1/shlax1/shrax1
233 * or similar, provided that a/x is not used later
236 unsigned Changes = 0;
238 /* Walk over the entries */
240 while (I < CS_GetEntryCount (S)) {
246 L[0] = CS_GetEntry (S, I);
248 /* Check for the sequence */
249 if (L[0]->OPC == OP65_LDA &&
250 (L[0]->AM == AM65_ABS || L[0]->AM == AM65_ZP) &&
251 CS_GetEntries (S, L+1, I+1, 4) &&
252 !CS_RangeHasLabel (S, I+1, 4) &&
253 L[1]->OPC == OP65_LDX &&
254 (L[1]->AM == AM65_ABS || L[1]->AM == AM65_ZP) &&
255 L[2]->OPC == OP65_JSR &&
256 (ShiftType = GetShiftType (L[2]->Arg)) != SHIFT_NONE&&
257 L[3]->OPC == OP65_STA &&
258 (L[3]->AM == AM65_ABS || L[3]->AM == AM65_ZP) &&
259 L[4]->OPC == OP65_STX &&
260 (L[4]->AM == AM65_ABS || L[4]->AM == AM65_ZP) &&
261 !RegAXUsed (S, I+5)) {
265 /* Handle the four shift types differently */
269 X = NewCodeEntry (OP65_LDA, L[1]->AM, L[1]->Arg, 0, L[1]->LI);
270 CS_InsertEntry (S, X, I+5);
271 X = NewCodeEntry (OP65_CMP, AM65_IMM, "$80", 0, L[2]->LI);
272 CS_InsertEntry (S, X, I+6);
273 X = NewCodeEntry (OP65_ROR, AM65_ACC, "a", 0, L[2]->LI);
274 CS_InsertEntry (S, X, I+7);
275 X = NewCodeEntry (OP65_STA, L[4]->AM, L[4]->Arg, 0, L[4]->LI);
276 CS_InsertEntry (S, X, I+8);
277 X = NewCodeEntry (OP65_LDA, L[0]->AM, L[0]->Arg, 0, L[0]->LI);
278 CS_InsertEntry (S, X, I+9);
279 X = NewCodeEntry (OP65_ROR, AM65_ACC, "a", 0, L[2]->LI);
280 CS_InsertEntry (S, X, I+10);
281 X = NewCodeEntry (OP65_STA, L[3]->AM, L[3]->Arg, 0, L[3]->LI);
282 CS_InsertEntry (S, X, I+11);
283 CS_DelEntries (S, I, 5);
287 X = NewCodeEntry (OP65_LDA, L[1]->AM, L[1]->Arg, 0, L[1]->LI);
288 CS_InsertEntry (S, X, I+5);
289 X = NewCodeEntry (OP65_LSR, AM65_ACC, "a", 0, L[2]->LI);
290 CS_InsertEntry (S, X, I+6);
291 X = NewCodeEntry (OP65_STA, L[4]->AM, L[4]->Arg, 0, L[4]->LI);
292 CS_InsertEntry (S, X, I+7);
293 X = NewCodeEntry (OP65_LDA, L[0]->AM, L[0]->Arg, 0, L[0]->LI);
294 CS_InsertEntry (S, X, I+8);
295 X = NewCodeEntry (OP65_ROR, AM65_ACC, "a", 0, L[2]->LI);
296 CS_InsertEntry (S, X, I+9);
297 X = NewCodeEntry (OP65_STA, L[3]->AM, L[3]->Arg, 0, L[3]->LI);
298 CS_InsertEntry (S, X, I+10);
299 CS_DelEntries (S, I, 5);
304 /* These two are identical */
305 X = NewCodeEntry (OP65_ASL, AM65_ACC, "a", 0, L[2]->LI);
306 CS_InsertEntry (S, X, I+1);
307 X = NewCodeEntry (OP65_STA, L[3]->AM, L[3]->Arg, 0, L[3]->LI);
308 CS_InsertEntry (S, X, I+2);
309 X = NewCodeEntry (OP65_LDA, L[1]->AM, L[1]->Arg, 0, L[1]->LI);
310 CS_InsertEntry (S, X, I+3);
311 X = NewCodeEntry (OP65_ROL, AM65_ACC, "a", 0, L[2]->LI);
312 CS_InsertEntry (S, X, I+4);
313 X = NewCodeEntry (OP65_STA, L[4]->AM, L[4]->Arg, 0, L[4]->LI);
314 CS_InsertEntry (S, X, I+5);
315 CS_DelEntries (S, I+6, 4);
320 /* Remember, we had changes */
330 /* Return the number of changes made */
336 /*****************************************************************************/
338 /*****************************************************************************/
342 static unsigned OptLoad1 (CodeSeg* S)
343 /* Search for a call to ldaxysp where X is not used later and replace it by
344 * a load of just the A register.
348 unsigned Changes = 0;
350 /* Generate register info */
353 /* Walk over the entries */
355 while (I < CS_GetEntryCount (S)) {
360 E = CS_GetEntry (S, I);
362 /* Check for the sequence */
363 if (CE_IsCallTo (E, "ldaxysp") &&
364 RegValIsKnown (E->RI->In.RegY) &&
365 !RegXUsed (S, I+1)) {
369 /* Reload the Y register */
370 const char* Arg = MakeHexArg (E->RI->In.RegY - 1);
371 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
372 CS_InsertEntry (S, X, I+1);
374 /* Load from stack */
375 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, E->LI);
376 CS_InsertEntry (S, X, I+2);
378 /* Now remove the call to the subroutine */
381 /* Remember, we had changes */
391 /* Free the register info */
394 /* Return the number of changes made */
400 /*****************************************************************************/
401 /* Optimize stores through pointers */
402 /*****************************************************************************/
406 static unsigned OptPtrStore1Sub (CodeSeg* S, unsigned I, CodeEntry** const L)
407 /* Check if this is one of the allowed suboperation for OptPtrStore1 */
409 /* Check for a label attached to the entry */
410 if (CE_HasLabel (L[0])) {
414 /* Check for single insn sub ops */
415 if (L[0]->OPC == OP65_AND ||
416 L[0]->OPC == OP65_EOR ||
417 L[0]->OPC == OP65_ORA ||
418 (L[0]->OPC == OP65_JSR && strncmp (L[0]->Arg, "shlax", 5) == 0) ||
419 (L[0]->OPC == OP65_JSR && strncmp (L[0]->Arg, "shrax", 5) == 0)) {
424 } else if (L[0]->OPC == OP65_CLC &&
425 (L[1] = CS_GetNextEntry (S, I)) != 0 &&
426 L[1]->OPC == OP65_ADC &&
427 !CE_HasLabel (L[1])) {
429 } else if (L[0]->OPC == OP65_SEC &&
430 (L[1] = CS_GetNextEntry (S, I)) != 0 &&
431 L[1]->OPC == OP65_SBC &&
432 !CE_HasLabel (L[1])) {
444 static unsigned OptPtrStore1 (CodeSeg* S)
445 /* Search for the sequence:
466 unsigned Changes = 0;
468 /* Walk over the entries */
470 while (I < CS_GetEntryCount (S)) {
476 L[0] = CS_GetEntry (S, I);
478 /* Check for the sequence */
479 if (CE_IsCallTo (L[0], "pushax") &&
480 CS_GetEntries (S, L+1, I+1, 3) &&
481 L[1]->OPC == OP65_LDY &&
482 CE_KnownImm (L[1]) &&
483 !CE_HasLabel (L[1]) &&
484 CE_IsCallTo (L[2], "ldauidx") &&
485 !CE_HasLabel (L[2]) &&
486 (K = OptPtrStore1Sub (S, I+3, L+3)) > 0 &&
487 CS_GetEntries (S, L+3+K, I+3+K, 2) &&
488 L[3+K]->OPC == OP65_LDY &&
489 CE_KnownImm (L[3+K]) &&
490 !CE_HasLabel (L[3+K]) &&
491 CE_IsCallTo (L[4+K], "staspidx") &&
492 !CE_HasLabel (L[4+K])) {
496 /* Create and insert the stores */
497 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1", 0, L[0]->LI);
498 CS_InsertEntry (S, X, I+1);
500 X = NewCodeEntry (OP65_STX, AM65_ZP, "ptr1+1", 0, L[0]->LI);
501 CS_InsertEntry (S, X, I+2);
503 /* Delete the call to pushax */
506 /* Delete the call to ldauidx */
507 CS_DelEntry (S, I+3);
509 /* Insert the load from ptr1 */
510 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[3]->LI);
511 CS_InsertEntry (S, X, I+3);
512 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "ptr1", 0, L[2]->LI);
513 CS_InsertEntry (S, X, I+4);
515 /* Insert the store through ptr1 */
516 X = NewCodeEntry (OP65_STA, AM65_ZP_INDY, "ptr1", 0, L[3]->LI);
517 CS_InsertEntry (S, X, I+6+K);
519 /* Delete the call to staspidx */
520 CS_DelEntry (S, I+7+K);
522 /* Remember, we had changes */
532 /* Return the number of changes made */
538 static unsigned OptPtrStore2 (CodeSeg* S)
539 /* Search for the sequence:
555 unsigned Changes = 0;
557 /* Walk over the entries */
559 while (I < CS_GetEntryCount (S)) {
564 L[0] = CS_GetEntry (S, I);
566 /* Check for the sequence */
567 if (CE_IsCallTo (L[0], "pushax") &&
568 CS_GetEntries (S, L+1, I+1, 3) &&
569 L[1]->OPC == OP65_LDA &&
570 !CE_HasLabel (L[1]) &&
571 L[2]->OPC == OP65_LDY &&
572 !CE_HasLabel (L[2]) &&
573 CE_IsCallTo (L[3], "staspidx") &&
574 !CE_HasLabel (L[3])) {
578 /* Create and insert the stores */
579 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1", 0, L[0]->LI);
580 CS_InsertEntry (S, X, I+1);
582 X = NewCodeEntry (OP65_STX, AM65_ZP, "ptr1+1", 0, L[0]->LI);
583 CS_InsertEntry (S, X, I+2);
585 /* Delete the call to pushax */
588 /* Insert the store through ptr1 */
589 X = NewCodeEntry (OP65_STA, AM65_ZP_INDY, "ptr1", 0, L[3]->LI);
590 CS_InsertEntry (S, X, I+4);
592 /* Delete the call to staspidx */
593 CS_DelEntry (S, I+5);
595 /* Remember, we had changes */
605 /* Return the number of changes made */
611 /*****************************************************************************/
612 /* Optimize loads through pointers */
613 /*****************************************************************************/
617 static unsigned OptPtrLoad1 (CodeSeg* S)
618 /* Search for the sequence:
622 * lda (sp),y # May be any destination
637 unsigned Changes = 0;
639 /* Walk over the entries */
641 while (I < CS_GetEntryCount (S)) {
646 L[0] = CS_GetEntry (S, I);
648 /* Check for the sequence */
649 if (L[0]->OPC == OP65_TAX &&
650 CS_GetEntries (S, L+1, I+1, 4) &&
651 L[1]->OPC == OP65_DEY &&
652 !CE_HasLabel (L[1]) &&
653 L[2]->OPC == OP65_LDA &&
654 !CE_HasLabel (L[2]) &&
655 L[3]->OPC == OP65_LDY &&
656 !CE_HasLabel (L[3]) &&
657 CE_IsCallTo (L[4], "ldauidx") &&
658 !CE_HasLabel (L[4])) {
662 /* Store the high byte and remove the TAX instead */
663 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1+1", 0, L[0]->LI);
664 CS_InsertEntry (S, X, I+1);
667 /* Store the low byte */
668 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1", 0, L[2]->LI);
669 CS_InsertEntry (S, X, I+3);
671 /* Delete the call to ldauidx */
672 CS_DelEntry (S, I+5);
674 /* Load high and low byte */
675 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[3]->LI);
676 CS_InsertEntry (S, X, I+5);
677 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "ptr1", 0, L[3]->LI);
678 CS_InsertEntry (S, X, I+6);
680 /* Remember, we had changes */
690 /* Return the number of changes made */
696 static unsigned OptPtrLoad2 (CodeSeg* S)
697 /* Search for the sequence:
722 unsigned Changes = 0;
724 /* Walk over the entries */
726 while (I < CS_GetEntryCount (S)) {
731 L[0] = CS_GetEntry (S, I);
733 /* Check for the sequence */
734 if (L[0]->OPC == OP65_CLC &&
735 CS_GetEntries (S, L+1, I+1, 8) &&
736 L[1]->OPC == OP65_ADC &&
737 !CE_HasLabel (L[1]) &&
738 L[2]->OPC == OP65_TAY &&
739 !CE_HasLabel (L[2]) &&
740 L[3]->OPC == OP65_TXA &&
741 !CE_HasLabel (L[3]) &&
742 L[4]->OPC == OP65_ADC &&
743 !CE_HasLabel (L[4]) &&
744 L[5]->OPC == OP65_TAX &&
745 !CE_HasLabel (L[5]) &&
746 L[6]->OPC == OP65_TYA &&
747 !CE_HasLabel (L[6]) &&
748 L[7]->OPC == OP65_LDY &&
749 !CE_HasLabel (L[7]) &&
750 CE_IsCallTo (L[8], "ldauidx") &&
751 !CE_HasLabel (L[8])) {
756 /* Store the low byte and remove the TAY instead */
757 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1", 0, L[1]->LI);
758 CS_InsertEntry (S, X, I+2);
759 CS_DelEntry (S, I+3);
761 /* Store the high byte */
762 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1+1", 0, L[4]->LI);
763 CS_InsertEntry (S, X, I+5);
765 /* If the instruction before the adc is a ldx, replace the
766 * txa by and lda with the same location of the ldx.
768 if ((P = CS_GetPrevEntry (S, I)) != 0 &&
769 P->OPC == OP65_LDX &&
772 X = NewCodeEntry (OP65_LDA, P->AM, P->Arg, 0, P->LI);
773 CS_InsertEntry (S, X, I+4);
774 CS_DelEntry (S, I+3);
777 /* Delete more transfer insns */
778 CS_DelEntry (S, I+7);
779 CS_DelEntry (S, I+6);
781 /* Delete the call to ldauidx */
782 CS_DelEntry (S, I+7);
784 /* Load high and low byte */
785 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[7]->LI);
786 CS_InsertEntry (S, X, I+7);
787 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "ptr1", 0, L[7]->LI);
788 CS_InsertEntry (S, X, I+8);
790 /* Remember, we had changes */
800 /* Return the number of changes made */
806 static unsigned OptPtrLoad3 (CodeSeg* S)
807 /* Search for the sequence:
832 unsigned Changes = 0;
834 /* Walk over the entries */
836 while (I < CS_GetEntryCount (S)) {
841 L[0] = CS_GetEntry (S, I);
843 /* Check for the sequence */
844 if (L[0]->OPC == OP65_ADC &&
845 CS_GetEntries (S, L+1, I+1, 8) &&
846 L[1]->OPC == OP65_PHA &&
847 !CE_HasLabel (L[1]) &&
848 L[2]->OPC == OP65_TXA &&
849 !CE_HasLabel (L[2]) &&
850 L[3]->OPC == OP65_INY &&
851 !CE_HasLabel (L[3]) &&
852 L[4]->OPC == OP65_ADC &&
853 !CE_HasLabel (L[4]) &&
854 L[5]->OPC == OP65_TAX &&
855 !CE_HasLabel (L[5]) &&
856 L[6]->OPC == OP65_PLA &&
857 !CE_HasLabel (L[6]) &&
858 L[7]->OPC == OP65_LDY &&
859 !CE_HasLabel (L[7]) &&
860 CE_IsCallTo (L[8], "ldauidx") &&
861 !CE_HasLabel (L[8])) {
865 /* Store the low byte and remove the PHA instead */
866 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1", 0, L[0]->LI);
867 CS_InsertEntry (S, X, I+1);
868 CS_DelEntry (S, I+2);
870 /* Store the high byte */
871 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1+1", 0, L[4]->LI);
872 CS_InsertEntry (S, X, I+5);
874 /* Delete more transfer and PLA insns */
875 CS_DelEntry (S, I+7);
876 CS_DelEntry (S, I+6);
878 /* Delete the call to ldauidx */
879 CS_DelEntry (S, I+7);
881 /* Load high and low byte */
882 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[6]->LI);
883 CS_InsertEntry (S, X, I+7);
884 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "ptr1", 0, L[6]->LI);
885 CS_InsertEntry (S, X, I+8);
887 /* Remember, we had changes */
897 /* Return the number of changes made */
903 static unsigned OptPtrLoad4 (CodeSeg* S)
904 /* Search for the sequence:
922 unsigned Changes = 0;
924 /* Walk over the entries */
926 while (I < CS_GetEntryCount (S)) {
932 L[0] = CS_GetEntry (S, I);
934 /* Check for the sequence */
935 if (L[0]->OPC == OP65_LDA &&
936 L[0]->AM == AM65_IMM &&
937 CS_GetEntries (S, L+1, I+1, 7) &&
938 L[1]->OPC == OP65_LDX &&
939 L[1]->AM == AM65_IMM &&
940 !CE_HasLabel (L[1]) &&
941 L[2]->OPC == OP65_CLC &&
942 !CE_HasLabel (L[2]) &&
943 L[3]->OPC == OP65_ADC &&
944 (L[3]->AM == AM65_ABS || L[3]->AM == AM65_ZP) &&
945 !CE_HasLabel (L[3]) &&
946 (L[4]->OPC == OP65_BCC || L[4]->OPC == OP65_JCC) &&
948 L[4]->JumpTo->Owner == L[6] &&
949 !CE_HasLabel (L[4]) &&
950 L[5]->OPC == OP65_INX &&
951 !CE_HasLabel (L[5]) &&
952 L[6]->OPC == OP65_LDY &&
953 CE_KnownImm (L[6]) &&
955 CE_IsCallTo (L[7], "ldauidx") &&
956 !CE_HasLabel (L[7]) &&
957 /* Check the label last because this is quite costly */
958 (Len = strlen (L[0]->Arg)) > 3 &&
959 L[0]->Arg[0] == '<' &&
960 L[0]->Arg[1] == '(' &&
961 strlen (L[1]->Arg) == Len &&
962 L[1]->Arg[0] == '>' &&
963 memcmp (L[0]->Arg+1, L[1]->Arg+1, Len-1) == 0) {
968 /* We will create all the new stuff behind the current one so
969 * we keep the line references.
971 X = NewCodeEntry (OP65_LDY, L[3]->AM, L[3]->Arg, 0, L[0]->LI);
972 CS_InsertEntry (S, X, I+8);
974 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[0]->LI);
975 CS_InsertEntry (S, X, I+9);
977 Label = memcpy (xmalloc (Len-2), L[0]->Arg+2, Len-3);
979 X = NewCodeEntry (OP65_LDA, AM65_ABSY, Label, 0, L[0]->LI);
980 CS_InsertEntry (S, X, I+10);
983 /* Remove the old code */
984 CS_DelEntries (S, I, 8);
986 /* Remember, we had changes */
996 /* Return the number of changes made */
1002 static unsigned OptPtrLoad5 (CodeSeg* S)
1003 /* Search for the sequence:
1015 * and replace it by:
1024 unsigned Changes = 0;
1026 /* Walk over the entries */
1028 while (I < CS_GetEntryCount (S)) {
1033 /* Get next entry */
1034 L[0] = CS_GetEntry (S, I);
1036 /* Check for the sequence */
1037 if (L[0]->OPC == OP65_LDA &&
1038 L[0]->AM == AM65_IMM &&
1039 CS_GetEntries (S, L+1, I+1, 8) &&
1040 L[1]->OPC == OP65_LDX &&
1041 L[1]->AM == AM65_IMM &&
1042 !CE_HasLabel (L[1]) &&
1043 L[2]->OPC == OP65_LDY &&
1044 CE_KnownImm (L[2]) &&
1045 !CE_HasLabel (L[2]) &&
1046 L[3]->OPC == OP65_CLC &&
1047 !CE_HasLabel (L[3]) &&
1048 L[4]->OPC == OP65_ADC &&
1049 L[4]->AM == AM65_ZP_INDY &&
1050 !CE_HasLabel (L[4]) &&
1051 (L[5]->OPC == OP65_BCC || L[5]->OPC == OP65_JCC) &&
1052 L[5]->JumpTo != 0 &&
1053 L[5]->JumpTo->Owner == L[7] &&
1054 !CE_HasLabel (L[5]) &&
1055 L[6]->OPC == OP65_INX &&
1056 !CE_HasLabel (L[6]) &&
1057 L[7]->OPC == OP65_LDY &&
1058 CE_KnownImm (L[7]) &&
1060 CE_IsCallTo (L[8], "ldauidx") &&
1061 !CE_HasLabel (L[8]) &&
1062 /* Check the label last because this is quite costly */
1063 (Len = strlen (L[0]->Arg)) > 3 &&
1064 L[0]->Arg[0] == '<' &&
1065 L[0]->Arg[1] == '(' &&
1066 strlen (L[1]->Arg) == Len &&
1067 L[1]->Arg[0] == '>' &&
1068 memcmp (L[0]->Arg+1, L[1]->Arg+1, Len-1) == 0) {
1074 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, L[4]->Arg, 0, L[0]->LI);
1075 CS_InsertEntry (S, X, I+3);
1078 X = NewCodeEntry (OP65_TAY, AM65_IMP, 0, 0, L[0]->LI);
1079 CS_InsertEntry (S, X, I+4);
1082 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[0]->LI);
1083 CS_InsertEntry (S, X, I+5);
1086 Label = memcpy (xmalloc (Len-2), L[0]->Arg+2, Len-3);
1087 Label[Len-3] = '\0';
1088 X = NewCodeEntry (OP65_LDA, AM65_ABSY, Label, 0, L[0]->LI);
1089 CS_InsertEntry (S, X, I+6);
1092 /* Remove the old code */
1093 CS_DelEntries (S, I, 2);
1094 CS_DelEntries (S, I+5, 6);
1096 /* Remember, we had changes */
1106 /* Return the number of changes made */
1112 static unsigned OptPtrLoad6 (CodeSeg* S)
1113 /* Search for the sequence
1118 * and replace it by:
1126 * This step must be execute *after* OptPtrLoad1!
1129 unsigned Changes = 0;
1131 /* Walk over the entries */
1133 while (I < CS_GetEntryCount (S)) {
1137 /* Get next entry */
1138 L[0] = CS_GetEntry (S, I);
1140 /* Check for the sequence */
1141 if (L[0]->OPC == OP65_LDY &&
1142 CS_GetEntries (S, L+1, I+1, 1) &&
1143 CE_IsCallTo (L[1], "ldauidx") &&
1144 !CE_HasLabel (L[1])) {
1148 /* Store the high byte */
1149 X = NewCodeEntry (OP65_STA, AM65_ZP, "ptr1", 0, L[0]->LI);
1150 CS_InsertEntry (S, X, I+1);
1152 /* Store the low byte */
1153 X = NewCodeEntry (OP65_STX, AM65_ZP, "ptr1+1", 0, L[0]->LI);
1154 CS_InsertEntry (S, X, I+2);
1156 /* Delete the call to ldauidx */
1157 CS_DelEntry (S, I+3);
1159 /* Load the high and low byte */
1160 X = NewCodeEntry (OP65_LDX, AM65_IMM, "$00", 0, L[0]->LI);
1161 CS_InsertEntry (S, X, I+3);
1162 X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "ptr1", 0, L[0]->LI);
1163 CS_InsertEntry (S, X, I+4);
1165 /* Remember, we had changes */
1175 /* Return the number of changes made */
1181 /*****************************************************************************/
1182 /* Decouple operations */
1183 /*****************************************************************************/
1187 static unsigned OptDecouple (CodeSeg* S)
1188 /* Decouple operations, that is, do the following replacements:
1198 * lda zp -> lda #imm
1199 * ldx zp -> ldx #imm
1200 * ldy zp -> ldy #imm
1202 * Provided that the register values are known of course.
1205 unsigned Changes = 0;
1208 /* Generate register info for the following step */
1211 /* Walk over the entries */
1213 while (I < CS_GetEntryCount (S)) {
1217 /* Get next entry and it's input register values */
1218 CodeEntry* E = CS_GetEntry (S, I);
1219 const RegContents* In = &E->RI->In;
1221 /* Assume we have no replacement */
1224 /* Check the instruction */
1228 if (E->RI->In.RegX >= 0) {
1229 Arg = MakeHexArg ((E->RI->In.RegX - 1) & 0xFF);
1230 X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
1235 if (E->RI->In.RegY >= 0) {
1236 Arg = MakeHexArg ((E->RI->In.RegY - 1) & 0xFF);
1237 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
1242 if (E->RI->In.RegX >= 0) {
1243 Arg = MakeHexArg ((E->RI->In.RegX + 1) & 0xFF);
1244 X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
1249 if (E->RI->In.RegY >= 0) {
1250 Arg = MakeHexArg ((E->RI->In.RegY + 1) & 0xFF);
1251 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
1256 if (E->AM == AM65_ZP) {
1257 switch (GetKnownReg (E->Use, In)) {
1259 Arg = MakeHexArg (In->Tmp1);
1260 X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
1264 Arg = MakeHexArg (In->SRegLo);
1265 X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
1269 Arg = MakeHexArg (In->SRegHi);
1270 X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
1277 if (E->AM == AM65_ZP) {
1278 switch (GetKnownReg (E->Use, In)) {
1280 Arg = MakeHexArg (In->Tmp1);
1281 X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
1285 Arg = MakeHexArg (In->SRegLo);
1286 X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
1290 Arg = MakeHexArg (In->SRegHi);
1291 X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
1298 if (E->AM == AM65_ZP) {
1299 switch (GetKnownReg (E->Use, In)) {
1301 Arg = MakeHexArg (In->Tmp1);
1302 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
1306 Arg = MakeHexArg (In->SRegLo);
1307 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
1311 Arg = MakeHexArg (In->SRegHi);
1312 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
1319 if (E->RI->In.RegA >= 0) {
1320 Arg = MakeHexArg (In->RegA);
1321 X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
1326 if (E->RI->In.RegA >= 0) {
1327 Arg = MakeHexArg (In->RegA);
1328 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
1333 if (E->RI->In.RegX >= 0) {
1334 Arg = MakeHexArg (In->RegX);
1335 X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
1340 if (E->RI->In.RegY >= 0) {
1341 Arg = MakeHexArg (In->RegY);
1342 X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
1347 /* Avoid gcc warnings */
1352 /* Insert the replacement if we have one */
1354 CS_InsertEntry (S, X, I+1);
1364 /* Free register info */
1367 /* Return the number of changes made */
1373 /*****************************************************************************/
1374 /* struct OptFunc */
1375 /*****************************************************************************/
1379 typedef struct OptFunc OptFunc;
1381 unsigned (*Func) (CodeSeg*); /* Optimizer function */
1382 const char* Name; /* Name of the function/group */
1383 unsigned CodeSizeFactor; /* Code size factor for this opt func */
1384 unsigned long TotalRuns; /* Total number of runs */
1385 unsigned long LastRuns; /* Last number of runs */
1386 unsigned long TotalChanges; /* Total number of changes */
1387 unsigned long LastChanges; /* Last number of changes */
1388 char Disabled; /* True if function disabled */
1393 /*****************************************************************************/
1395 /*****************************************************************************/
1399 /* A list of all the function descriptions */
1400 static OptFunc DOpt65C02BitOps = { Opt65C02BitOps, "Opt65C02BitOps", 66, 0, 0, 0, 0, 0 };
1401 static OptFunc DOpt65C02Ind = { Opt65C02Ind, "Opt65C02Ind", 100, 0, 0, 0, 0, 0 };
1402 static OptFunc DOpt65C02Stores = { Opt65C02Stores, "Opt65C02Stores", 100, 0, 0, 0, 0, 0 };
1403 static OptFunc DOptAdd1 = { OptAdd1, "OptAdd1", 125, 0, 0, 0, 0, 0 };
1404 static OptFunc DOptAdd2 = { OptAdd2, "OptAdd2", 200, 0, 0, 0, 0, 0 };
1405 static OptFunc DOptAdd3 = { OptAdd3, "OptAdd3", 40, 0, 0, 0, 0, 0 };
1406 static OptFunc DOptBoolTrans = { OptBoolTrans, "OptBoolTrans", 100, 0, 0, 0, 0, 0 };
1407 static OptFunc DOptBranchDist = { OptBranchDist, "OptBranchDist", 0, 0, 0, 0, 0, 0 };
1408 static OptFunc DOptCmp1 = { OptCmp1, "OptCmp1", 85, 0, 0, 0, 0, 0 };
1409 static OptFunc DOptCmp2 = { OptCmp2, "OptCmp2", 75, 0, 0, 0, 0, 0 };
1410 static OptFunc DOptCmp3 = { OptCmp3, "OptCmp3", 75, 0, 0, 0, 0, 0 };
1411 static OptFunc DOptCmp4 = { OptCmp4, "OptCmp4", 100, 0, 0, 0, 0, 0 };
1412 static OptFunc DOptCmp5 = { OptCmp5, "OptCmp5", 100, 0, 0, 0, 0, 0 };
1413 static OptFunc DOptCmp6 = { OptCmp6, "OptCmp6", 85, 0, 0, 0, 0, 0 };
1414 static OptFunc DOptCmp7 = { OptCmp7, "OptCmp7", 50, 0, 0, 0, 0, 0 };
1415 static OptFunc DOptCondBranches = { OptCondBranches, "OptCondBranches", 80, 0, 0, 0, 0, 0 };
1416 static OptFunc DOptDeadCode = { OptDeadCode, "OptDeadCode", 100, 0, 0, 0, 0, 0 };
1417 static OptFunc DOptDeadJumps = { OptDeadJumps, "OptDeadJumps", 100, 0, 0, 0, 0, 0 };
1418 static OptFunc DOptDecouple = { OptDecouple, "OptDecouple", 100, 0, 0, 0, 0, 0 };
1419 static OptFunc DOptDupLoads = { OptDupLoads, "OptDupLoads", 0, 0, 0, 0, 0, 0 };
1420 static OptFunc DOptJumpCascades = { OptJumpCascades, "OptJumpCascades", 100, 0, 0, 0, 0, 0 };
1421 static OptFunc DOptJumpTarget = { OptJumpTarget, "OptJumpTarget", 100, 0, 0, 0, 0, 0 };
1422 static OptFunc DOptLoad1 = { OptLoad1, "OptLoad1", 100, 0, 0, 0, 0, 0 };
1423 static OptFunc DOptRTS = { OptRTS, "OptRTS", 100, 0, 0, 0, 0, 0 };
1424 static OptFunc DOptRTSJumps1 = { OptRTSJumps1, "OptRTSJumps1", 100, 0, 0, 0, 0, 0 };
1425 static OptFunc DOptRTSJumps2 = { OptRTSJumps2, "OptRTSJumps2", 100, 0, 0, 0, 0, 0 };
1426 static OptFunc DOptNegA1 = { OptNegA1, "OptNegA1", 100, 0, 0, 0, 0, 0 };
1427 static OptFunc DOptNegA2 = { OptNegA2, "OptNegA2", 100, 0, 0, 0, 0, 0 };
1428 static OptFunc DOptNegAX1 = { OptNegAX1, "OptNegAX1", 100, 0, 0, 0, 0, 0 };
1429 static OptFunc DOptNegAX2 = { OptNegAX2, "OptNegAX2", 100, 0, 0, 0, 0, 0 };
1430 static OptFunc DOptNegAX3 = { OptNegAX3, "OptNegAX3", 100, 0, 0, 0, 0, 0 };
1431 static OptFunc DOptNegAX4 = { OptNegAX4, "OptNegAX4", 100, 0, 0, 0, 0, 0 };
1432 static OptFunc DOptPtrLoad1 = { OptPtrLoad1, "OptPtrLoad1", 100, 0, 0, 0, 0, 0 };
1433 static OptFunc DOptPtrLoad2 = { OptPtrLoad2, "OptPtrLoad2", 100, 0, 0, 0, 0, 0 };
1434 static OptFunc DOptPtrLoad3 = { OptPtrLoad3, "OptPtrLoad3", 100, 0, 0, 0, 0, 0 };
1435 static OptFunc DOptPtrLoad4 = { OptPtrLoad4, "OptPtrLoad4", 100, 0, 0, 0, 0, 0 };
1436 static OptFunc DOptPtrLoad5 = { OptPtrLoad5, "OptPtrLoad5", 100, 0, 0, 0, 0, 0 };
1437 static OptFunc DOptPtrLoad6 = { OptPtrLoad6, "OptPtrLoad6", 100, 0, 0, 0, 0, 0 };
1438 static OptFunc DOptPtrStore1 = { OptPtrStore1, "OptPtrStore1", 100, 0, 0, 0, 0, 0 };
1439 static OptFunc DOptPtrStore2 = { OptPtrStore2, "OptPtrStore2", 100, 0, 0, 0, 0, 0 };
1440 static OptFunc DOptPush1 = { OptPush1, "OptPush1", 65, 0, 0, 0, 0, 0 };
1441 static OptFunc DOptPushPop = { OptPushPop, "OptPushPop", 0, 0, 0, 0, 0, 0 };
1442 static OptFunc DOptShift1 = { OptShift1, "OptShift1", 100, 0, 0, 0, 0, 0 };
1443 static OptFunc DOptShift2 = { OptShift2, "OptShift2", 100, 0, 0, 0, 0, 0 };
1444 static OptFunc DOptShift3 = { OptShift3, "OptShift3", 110, 0, 0, 0, 0, 0 };
1445 static OptFunc DOptSize1 = { OptSize1, "OptSize1", 100, 0, 0, 0, 0, 0 };
1446 static OptFunc DOptSize2 = { OptSize2, "OptSize2", 100, 0, 0, 0, 0, 0 };
1447 static OptFunc DOptStackOps = { OptStackOps, "OptStackOps", 100, 0, 0, 0, 0, 0 };
1448 static OptFunc DOptStore1 = { OptStore1, "OptStore1", 220, 0, 0, 0, 0, 0 };
1449 static OptFunc DOptStore2 = { OptStore2, "OptStore2", 120, 0, 0, 0, 0, 0 };
1450 static OptFunc DOptStoreLoad = { OptStoreLoad, "OptStoreLoad", 0, 0, 0, 0, 0, 0 };
1451 static OptFunc DOptSub1 = { OptSub1, "OptSub1", 100, 0, 0, 0, 0, 0 };
1452 static OptFunc DOptSub2 = { OptSub2, "OptSub2", 100, 0, 0, 0, 0, 0 };
1453 static OptFunc DOptTest1 = { OptTest1, "OptTest1", 100, 0, 0, 0, 0, 0 };
1454 static OptFunc DOptTransfers = { OptTransfers, "OptTransfers", 0, 0, 0, 0, 0, 0 };
1455 static OptFunc DOptUnusedLoads = { OptUnusedLoads, "OptUnusedLoads", 0, 0, 0, 0, 0, 0 };
1456 static OptFunc DOptUnusedStores = { OptUnusedStores, "OptUnusedStores", 0, 0, 0, 0, 0, 0 };
1459 /* Table containing all the steps in alphabetical order */
1460 static OptFunc* OptFuncs[] = {
1519 #define OPTFUNC_COUNT (sizeof(OptFuncs) / sizeof(OptFuncs[0]))
1523 static int CmpOptStep (const void* Key, const void* Func)
1524 /* Compare function for bsearch */
1526 return strcmp (Key, (*(const OptFunc**)Func)->Name);
1531 static OptFunc* FindOptFunc (const char* Name)
1532 /* Find an optimizer step by name in the table and return a pointer. Return
1533 * NULL if no such step is found.
1536 /* Search for the function in the list */
1537 OptFunc** O = bsearch (Name, OptFuncs, OPTFUNC_COUNT, sizeof (OptFuncs[0]), CmpOptStep);
1543 static OptFunc* GetOptFunc (const char* Name)
1544 /* Find an optimizer step by name in the table and return a pointer. Print an
1545 * error and call AbEnd if not found.
1548 /* Search for the function in the list */
1549 OptFunc* F = FindOptFunc (Name);
1552 AbEnd ("Optimization step `%s' not found", Name);
1559 void DisableOpt (const char* Name)
1560 /* Disable the optimization with the given name */
1562 if (strcmp (Name, "any") == 0) {
1564 for (I = 0; I < OPTFUNC_COUNT; ++I) {
1565 OptFuncs[I]->Disabled = 1;
1568 GetOptFunc(Name)->Disabled = 1;
1574 void EnableOpt (const char* Name)
1575 /* Enable the optimization with the given name */
1577 if (strcmp (Name, "any") == 0) {
1579 for (I = 0; I < OPTFUNC_COUNT; ++I) {
1580 OptFuncs[I]->Disabled = 0;
1583 GetOptFunc(Name)->Disabled = 0;
1589 void ListOptSteps (FILE* F)
1590 /* List all optimization steps */
1593 for (I = 0; I < OPTFUNC_COUNT; ++I) {
1594 fprintf (F, "%s\n", OptFuncs[I]->Name);
1600 static void ReadOptStats (const char* Name)
1601 /* Read the optimizer statistics file */
1606 /* Try to open the file */
1607 FILE* F = fopen (Name, "r");
1609 /* Ignore the error */
1613 /* Read and parse the lines */
1615 while (fgets (Buf, sizeof (Buf), F) != 0) {
1623 unsigned long TotalRuns;
1624 unsigned long TotalChanges;
1629 /* Remove trailing white space including the line terminator */
1632 while (Len > 0 && IsSpace (B[Len-1])) {
1637 /* Remove leading whitespace */
1638 while (IsSpace (*B)) {
1642 /* Check for empty and comment lines */
1643 if (*B == '\0' || *B == ';' || *B == '#') {
1647 /* Parse the line */
1648 if (sscanf (B, "%31s %lu %*u %lu %*u", Name, &TotalRuns, &TotalChanges) != 3) {
1653 /* Search for the optimizer step. */
1654 Func = FindOptFunc (Name);
1660 /* Found the step, set the fields */
1661 Func->TotalRuns = TotalRuns;
1662 Func->TotalChanges = TotalChanges;
1666 /* Close the file, ignore errors here. */
1672 static void WriteOptStats (const char* Name)
1673 /* Write the optimizer statistics file */
1677 /* Try to open the file */
1678 FILE* F = fopen (Name, "w");
1680 /* Ignore the error */
1684 /* Write a header */
1686 "; Optimizer Total Last Total Last\n"
1687 "; Step Runs Runs Chg Chg\n");
1690 /* Write the data */
1691 for (I = 0; I < OPTFUNC_COUNT; ++I) {
1692 const OptFunc* O = OptFuncs[I];
1694 "%-20s %6lu %6lu %6lu %6lu\n",
1702 /* Close the file, ignore errors here. */
1708 static unsigned RunOptFunc (CodeSeg* S, OptFunc* F, unsigned Max)
1709 /* Run one optimizer function Max times or until there are no more changes */
1711 unsigned Changes, C;
1713 /* Don't run the function if it is disabled or if it is prohibited by the
1716 if (F->Disabled || CodeSizeFactor < F->CodeSizeFactor) {
1720 /* Run this until there are no more changes */
1724 /* Run the function */
1731 F->TotalChanges += C;
1732 F->LastChanges += C;
1734 } while (--Max && C > 0);
1736 /* Return the number of changes */
1742 static unsigned RunOptGroup1 (CodeSeg* S)
1743 /* Run the first group of optimization steps. These steps translate known
1744 * patterns emitted by the code generator into more optimal patterns. Order
1745 * of the steps is important, because some of the steps done earlier cover
1746 * the same patterns as later steps as subpatterns.
1749 unsigned Changes = 0;
1751 Changes += RunOptFunc (S, &DOptPtrStore1, 1);
1752 Changes += RunOptFunc (S, &DOptPtrStore2, 1);
1753 Changes += RunOptFunc (S, &DOptPtrLoad1, 1);
1754 Changes += RunOptFunc (S, &DOptPtrLoad2, 1);
1755 Changes += RunOptFunc (S, &DOptPtrLoad3, 1);
1756 Changes += RunOptFunc (S, &DOptPtrLoad4, 1);
1757 Changes += RunOptFunc (S, &DOptPtrLoad5, 1);
1758 Changes += RunOptFunc (S, &DOptNegAX1, 1);
1759 Changes += RunOptFunc (S, &DOptNegAX2, 1);
1760 Changes += RunOptFunc (S, &DOptNegAX3, 1);
1761 Changes += RunOptFunc (S, &DOptNegAX4, 1);
1762 Changes += RunOptFunc (S, &DOptAdd1, 1);
1763 Changes += RunOptFunc (S, &DOptAdd2, 1);
1764 Changes += RunOptFunc (S, &DOptShift1, 1);
1765 Changes += RunOptFunc (S, &DOptShift2, 1);
1766 Changes += RunOptFunc (S, &DOptShift3, 1);
1767 Changes += RunOptFunc (S, &DOptStore1, 5);
1768 Changes += RunOptFunc (S, &DOptStore2, 5);
1770 /* Return the number of changes */
1776 static unsigned RunOptGroup2 (CodeSeg* S)
1777 /* Run one group of optimization steps. This step involves just decoupling
1778 * instructions by replacing them by instructions that do not depend on
1779 * previous instructions. This makes it easier to find instructions that
1783 unsigned Changes = 0;
1785 Changes += RunOptFunc (S, &DOptDecouple, 1);
1787 /* Return the number of changes */
1793 static unsigned RunOptGroup3 (CodeSeg* S)
1794 /* Run one group of optimization steps. These steps depend on each other,
1795 * that means that one step may allow another step to do additional work,
1796 * so we will repeat the steps as long as we see any changes.
1799 unsigned Changes, C;
1805 C += RunOptFunc (S, &DOptPtrLoad6, 1);
1806 C += RunOptFunc (S, &DOptNegA1, 1);
1807 C += RunOptFunc (S, &DOptNegA2, 1);
1808 C += RunOptFunc (S, &DOptSub1, 1);
1809 C += RunOptFunc (S, &DOptSub2, 1);
1810 C += RunOptFunc (S, &DOptAdd3, 1);
1811 C += RunOptFunc (S, &DOptStackOps, 1);
1812 C += RunOptFunc (S, &DOptJumpCascades, 1);
1813 C += RunOptFunc (S, &DOptDeadJumps, 1);
1814 C += RunOptFunc (S, &DOptRTS, 1);
1815 C += RunOptFunc (S, &DOptDeadCode, 1);
1816 C += RunOptFunc (S, &DOptJumpTarget, 1);
1817 C += RunOptFunc (S, &DOptCondBranches, 1);
1818 C += RunOptFunc (S, &DOptRTSJumps1, 1);
1819 C += RunOptFunc (S, &DOptBoolTrans, 1);
1820 C += RunOptFunc (S, &DOptCmp1, 1);
1821 C += RunOptFunc (S, &DOptCmp2, 1);
1822 C += RunOptFunc (S, &DOptCmp3, 1);
1823 C += RunOptFunc (S, &DOptCmp4, 1);
1824 C += RunOptFunc (S, &DOptCmp5, 1);
1825 C += RunOptFunc (S, &DOptCmp6, 1);
1826 C += RunOptFunc (S, &DOptCmp7, 1);
1827 C += RunOptFunc (S, &DOptTest1, 1);
1828 C += RunOptFunc (S, &DOptLoad1, 1);
1829 C += RunOptFunc (S, &DOptUnusedLoads, 1);
1830 C += RunOptFunc (S, &DOptUnusedStores, 1);
1831 C += RunOptFunc (S, &DOptDupLoads, 1);
1832 C += RunOptFunc (S, &DOptStoreLoad, 1);
1833 C += RunOptFunc (S, &DOptTransfers, 1);
1834 C += RunOptFunc (S, &DOptPushPop, 1);
1840 /* Return the number of changes */
1846 static unsigned RunOptGroup4 (CodeSeg* S)
1847 /* 65C02 specific optimizations. */
1849 unsigned Changes = 0;
1851 if (CPU >= CPU_65C02) {
1852 Changes += RunOptFunc (S, &DOpt65C02BitOps, 1);
1853 Changes += RunOptFunc (S, &DOpt65C02Ind, 1);
1854 Changes += RunOptFunc (S, &DOpt65C02Stores, 1);
1856 /* The 65C02 replacement codes do often make the use of a register
1857 * value unnecessary, so if we have changes, run another load
1860 Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
1864 /* Return the number of changes */
1870 static unsigned RunOptGroup5 (CodeSeg* S)
1871 /* Run another round of pattern replacements. These are done late, since there
1872 * may be better replacements before.
1875 unsigned Changes = 0;
1877 Changes += RunOptFunc (S, &DOptPush1, 1);
1879 /* Return the number of changes */
1885 static unsigned RunOptGroup6 (CodeSeg* S)
1886 /* The last group of optimization steps. Adjust branches, do size optimizations.
1889 unsigned Changes = 0;
1892 if (CodeSizeFactor <= 100) {
1893 /* Optimize for size, that is replace operations by shorter ones, even
1894 * if this does hinder further optimizations (no problem since we're
1897 C = RunOptFunc (S, &DOptSize1, 1);
1900 /* Run some optimization passes again, since the size optimizations
1901 * may have opened new oportunities.
1903 Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
1904 Changes += RunOptFunc (S, &DOptJumpTarget, 5);
1907 C = RunOptFunc (S, &DOptSize2, 1);
1910 /* Run some optimization passes again, since the size optimizations
1911 * may have opened new oportunities.
1913 Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
1914 Changes += RunOptFunc (S, &DOptJumpTarget, 5);
1917 /* Adjust branch distances */
1918 Changes += RunOptFunc (S, &DOptBranchDist, 3);
1920 /* Replace conditional branches to RTS. If we had changes, we must run dead
1921 * code elimination again, since the change may have introduced dead code.
1923 C = RunOptFunc (S, &DOptRTSJumps2, 1);
1926 Changes += RunOptFunc (S, &DOptDeadCode, 1);
1929 /* Return the number of changes */
1935 void RunOpt (CodeSeg* S)
1936 /* Run the optimizer */
1938 const char* StatFileName;
1940 /* If we shouldn't run the optimizer, bail out */
1945 /* Check if we are requested to write optimizer statistics */
1946 StatFileName = getenv ("CC65_OPTSTATS");
1948 ReadOptStats (StatFileName);
1951 /* Print the name of the function we are working on */
1953 Print (stdout, 1, "Running optimizer for function `%s'\n", S->Func->Name);
1955 Print (stdout, 1, "Running optimizer for global code segment\n");
1958 /* Run groups of optimizations */
1966 /* Write statistics */
1968 WriteOptStats (StatFileName);