1 /*****************************************************************************/
5 /* Optimize push sequences */
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 /*****************************************************************************/
43 /*****************************************************************************/
45 /*****************************************************************************/
49 unsigned OptPush1 (CodeSeg* S)
55 * If a/x are not used later, and Y is known, replace that by
60 * saving 3 bytes and several cycles.
66 /* Generate register info */
69 /* Walk over the entries */
71 while (I < CS_GetEntryCount (S)) {
76 L[0] = CS_GetEntry (S, I);
78 /* Check for the sequence */
79 if (CE_IsCallTo (L[0], "ldaxysp") &&
80 RegValIsKnown (L[0]->RI->In.RegY) &&
81 L[0]->RI->In.RegY < 0xFE &&
82 (L[1] = CS_GetNextEntry (S, I)) != 0 &&
83 !CE_HasLabel (L[1]) &&
84 CE_IsCallTo (L[1], "pushax") &&
85 !RegAXUsed (S, I+2)) {
87 /* Insert new code behind the pushax */
92 Arg = MakeHexArg (L[0]->RI->In.RegY+2);
93 X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, L[0]->LI);
94 CS_InsertEntry (S, X, I+2);
97 X = NewCodeEntry (OP65_JSR, AM65_ABS, "pushwysp", 0, L[1]->LI);
98 CS_InsertEntry (S, X, I+3);
100 /* Delete the old code */
101 CS_DelEntries (S, I, 2);
103 /* Remember, we had changes */
113 /* Free the register info */
116 /* Return the number of changes made */
122 unsigned OptPush2 (CodeSeg* S)
128 * may get replaced by
135 unsigned Changes = 0;
137 /* Generate register info */
140 /* Walk over the entries */
142 while (I < CS_GetEntryCount (S)) {
147 L[0] = CS_GetEntry (S, I);
149 /* Check for the sequence */
150 if (CE_IsCallTo (L[0], "ldaxidx") &&
151 (L[1] = CS_GetNextEntry (S, I)) != 0 &&
152 !CE_HasLabel (L[1]) &&
153 CE_IsCallTo (L[1], "pushax")) {
155 /* Insert new code behind the pushax */
159 X = NewCodeEntry (OP65_JSR, AM65_ABS, "pushwidx", 0, L[1]->LI);
160 CS_InsertEntry (S, X, I+2);
162 /* Delete the old code */
163 CS_DelEntries (S, I, 2);
165 /* Remember, we had changes */
175 /* Free the register info */
178 /* Return the number of changes made */