Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20110808192258

Diff

Diff from 1.46 to:

Annotations

Annotate by Age | Author | Mixed | None
/fisheye/browse/pcc/pcc/cc/ccom/optim.c

Annotated File View

ragge
1.46
1 /*      $Id: optim.c,v 1.46 2011/08/08 19:22:58 ragge Exp $     */
ragge
1.10
2 /*
3  * Copyright(C) Caldera International Inc. 2001-2002. All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  *
9  * Redistributions of source code and documentation must retain the above
10  * copyright notice, this list of conditions and the following disclaimer.
11  * Redistributions in binary form must reproduce the above copyright
12  * notice, this list of conditionsand the following disclaimer in the
13  * documentation and/or other materials provided with the distribution.
14  * All advertising materials mentioning features or use of this software
15  * must display the following acknowledgement:
16  *      This product includes software developed or owned by Caldera
17  *      International, Inc.
18  * Neither the name of Caldera International, Inc. nor the names of other
19  * contributors may be used to endorse or promote products derived from
20  * this software without specific prior written permission.
21  *
22  * USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
23  * INTERNATIONAL, INC. AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
24  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
25  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
26  * DISCLAIMED.  IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE
27  * FOR ANY DIRECT, INDIRECT INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OFLIABILITY, WHETHER IN CONTRACT,
31  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
32  * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
33  * POSSIBILITY OF SUCH DAMAGE.
34  */
ragge
1.1
35
36 # include "pass1.h"
37
38 # define SWAP(p,q) {sp=p; p=q; q=sp;}
ragge
1.3
39 # define RCON(p) (p->n_right->n_op==ICON)
40 # define RO(p) p->n_right->n_op
41 # define RV(p) p->n_right->n_lval
42 # define LCON(p) (p->n_left->n_op==ICON)
43 # define LO(p) p->n_left->n_op
44 # define LV(p) p->n_left->n_lval
ragge
1.1
45
ragge
1.21
46 /* remove left node */
47 static NODE *
48 zapleft(NODE *p)
49 {
50         NODE *q;
51
52         q = p->n_left;
53         nfree(p->n_right);
54         nfree(p);
55         return q;
56 }
57
ragge
1.2
58 /*
59  * fortran function arguments
60  */
ragge
1.9
61 static NODE *
ragge
1.2
62 fortarg(NODE *p)
63 {
ragge
1.3
64         ifp->n_op == CM ){
65                 p->n_left = fortargp->n_left );
66                 p->n_right = fortargp->n_right );
ragge
1.1
67                 return(p);
ragge
1.2
68         }
ragge
1.1
69
ragge
1.3
70         whileISPTR(p->n_type) ){
ragge
1.16
71                 p = buildtreeUMULpNIL );
ragge
1.2
72         }
ragge
1.1
73         returnoptim(p) );
ragge
1.2
74 }
ragge
1.1
75
76         /* mapping relationals when the sides are reversed */
77 short revrel[] ={ EQNEGEGTLELTUGEUGTULEULT };
ragge
1.2
78
79 /*
80  * local optimizations, most of which are probably
81  * machine independent
82  */
ragge
1.1
83 NODE *
ragge
1.2
84 optim(NODE *p)
85 {
86         int oty;
ragge
1.8
87         NODE *sp, *q;
ragge
1.38
88         int isz;
ragge
1.1
89
90         ifoflag ) return(p);
ragge
1.21
91
ragge
1.44
92
ragge
1.21
93         ty = coptype(p->n_op);
ragge
1.1
94         ifty == LTYPE ) return(p);
95
ragge
1.3
96         ifty == BITYPE ) p->n_right = optim(p->n_right);
97         p->n_left = optim(p->n_left);
ragge
1.1
98
99         /* collect constants */
ragge
1.21
100 again:  o = p->n_op;
ragge
1.1
101         switch(o){
102
103         case SCONV:
ragge
1.42
104                 if (concast(p->n_leftp->n_type)) {
105                         q = p->n_left;
106                         nfree(p);
ragge
1.44
107                         p = q;
108                         break;
ragge
1.42
109                 }
110                 /* FALLTHROUGH */
ragge
1.1
111         case PCONV:
ragge
1.44
112                 p = clocal(p);
113                 break;
ragge
1.1
114
115         case FORTCALL:
ragge
1.3
116                 p->n_right = fortargp->n_right );
ragge
1.1
117                 break;
118
ragge
1.15
119         case ADDROF:
ragge
1.20
120                 if (LO(p) == TEMP)
ragge
1.44
121                         break;
ragge
1.10
122                 ifLO(p) != NAME ) cerror"& error" );
123
ragge
1.44
124                 if( !andable(p->n_left) && !statinit)
125                         break;
ragge
1.1
126
127                 LO(p) = ICON;
128
129                 setuleft:
130                 /* paint over the type of the left hand side with the type of the top */
ragge
1.3
131                 p->n_left->n_type = p->n_type;
ragge
1.7
132                 p->n_left->n_df = p->n_df;
ragge
1.35
133                 p->n_left->n_ap = p->n_ap;
ragge
1.8
134                 q = p->n_left;
135                 nfree(p);
ragge
1.44
136                 p = q;
137                 break;
ragge
1.1
138
ragge
1.45
139         case NOT:
140         case UMINUS:
141         case COMPL:
142                 if (LCON(p) && conval(p->n_leftop->n_left))
143                         p = nfree(p);
144                 break;
145
ragge
1.16
146         case UMUL:
ragge
1.46
147                 /* Do not discard ADDROF TEMP's */
148                 if (LO(p) == ADDROF && LO(p->n_left) != TEMP) {
ragge
1.36
149                         q = p->n_left->n_left;
150                         nfree(p->n_left);
151                         nfree(p);
ragge
1.44
152                         p = q;
153                         break;
ragge
1.36
154                 }
ragge
1.1
155                 ifLO(p) != ICON ) break;
156                 LO(p) = NAME;
157                 goto setuleft;
158
ragge
1.21
159         case RS:
ragge
1.37
160                 if (LCON(p) && RCON(p) && conval(p->n_leftop->n_right))
161                         goto zapright;
162
ragge
1.38
163                 sz = tsize(p->n_typep->n_dfp->n_ap);
ragge
1.34
164
ragge
1.31
165                 if (LO(p) == RS && RCON(p->n_left) && RCON(p) &&
ragge
1.38
166                     (RV(p) + RV(p->n_left)) < sz) {
ragge
1.21
167                         /* two right-shift  by constants */
168                         RV(p) += RV(p->n_left);
169                         p->n_left = zapleft(p->n_left);
ragge
1.23
170                 }
171 #if 0
172                   else if (LO(p) == LS && RCON(p->n_left) && RCON(p)) {
ragge
1.21
173                         RV(p) -= RV(p->n_left);
174                         if (RV(p) < 0)
175                                 o = p->n_op = LSRV(p) = -RV(p);
176                         p->n_left = zapleft(p->n_left);
177                 }
ragge
1.23
178 #endif
ragge
1.22
179                 if (RO(p) == ICON) {
180                         if (RV(p) < 0) {
181                                 RV(p) = -RV(p);
182                                 p->n_op = LS;
183                                 goto again;
184                         }
ragge
1.24
185 #ifdef notyet /* must check for side effects, --a >> 32; */
ragge
1.22
186                         if (RV(p) >= tsize(p->n_typep->n_dfp->n_sue) &&
187                             ISUNSIGNED(p->n_type)) { /* ignore signed shifts */
188                                 /* too many shifts */
189                                 tfree(p->n_left);
190                                 nfree(p->n_right);
191                                 p->n_op = ICONp->n_lval = 0p->n_sp = NULL;
ragge
1.24
192                         } else
193 #endif
ragge
1.26
194                         /* avoid larger shifts than type size */
ragge
1.38
195                         if (RV(p) >= sz) {
196                                 RV(p) = RV(p) % sz;
ragge
1.26
197                                 werror("shift larger than type");
198                         }
ragge
1.24
199                         if (RV(p) == 0)
ragge
1.22
200                                 p = zapleft(p);
ragge
1.21
201                 }
202                 break;
203
204         case LS:
ragge
1.37
205                 if (LCON(p) && RCON(p) && conval(p->n_leftop->n_right))
206                         goto zapright;
207
ragge
1.38
208                 sz = tsize(p->n_typep->n_dfp->n_ap);
ragge
1.34
209
ragge
1.21
210                 if (LO(p) == LS && RCON(p->n_left) && RCON(p)) {
211                         /* two left-shift  by constants */
212                         RV(p) += RV(p->n_left);
213                         p->n_left = zapleft(p->n_left);
ragge
1.23
214                 }
215 #if 0
216                   else if (LO(p) == RS && RCON(p->n_left) && RCON(p)) {
ragge
1.21
217                         RV(p) -= RV(p->n_left);
218                         p->n_left = zapleft(p->n_left);
219                 }
ragge
1.23
220 #endif
ragge
1.22
221                 if (RO(p) == ICON) {
222                         if (RV(p) < 0) {
223                                 RV(p) = -RV(p);
224                                 p->n_op = RS;
225                                 goto again;
226                         }
ragge
1.24
227 #ifdef notyet /* must check for side effects */
ragge
1.22
228                         if (RV(p) >= tsize(p->n_typep->n_dfp->n_sue)) {
229                                 /* too many shifts */
230                                 tfree(p->n_left);
231                                 nfree(p->n_right);
232                                 p->n_op = ICONp->n_lval = 0p->n_sp = NULL;
ragge
1.24
233                         } else
234 #endif
ragge
1.26
235                         /* avoid larger shifts than type size */
ragge
1.38
236                         if (RV(p) >= sz) {
237                                 RV(p) = RV(p) % sz;
ragge
1.26
238                                 werror("shift larger than type");
239                         }
ragge
1.24
240                         if (RV(p) == 0)  
ragge
1.22
241                                 p = zapleft(p);
ragge
1.21
242                 }
243                 break;
244
ragge
1.1
245         case MINUS:
ragge
1.19
246                 if (LCON(p) && RCON(p) && p->n_left->n_sp == p->n_right->n_sp) {
247                         /* link-time constants, but both are the same */
248                         /* solve it now by forgetting the symbols */
249                         p->n_left->n_sp = p->n_right->n_sp = NULL;
250                 }
ragge
1.3
251                 if( !nncon(p->n_right) ) break;
ragge
1.1
252                 RV(p) = -RV(p);
ragge
1.3
253                 o = p->n_op = PLUS;
ragge
1.1
254
255         case MUL:
ragge
1.43
256                 /*
257                  * Check for u=(x-y)+z; where all vars are pointers to
258                  * the same struct. This has two advantages:
259                  * 1: avoid a mul+div
260                  * 2: even if not allowed, people may get surprised if this
261                  *    calculation do not give correct result if using
262                  *    unaligned structs.
263                  */
264                 if (p->n_type == INTPTR && RCON(p) &&
265                     LO(p) == DIV && RCON(p->n_left) &&
266                     RV(p) == RV(p->n_left) &&
267                     LO(p->n_left) == MINUS) {
268                         q = p->n_left->n_left;
269                         if (q->n_left->n_type == PTR+STRTY &&
270                             q->n_right->n_type == PTR+STRTY &&
271                             strmemb(q->n_left->n_ap) ==
272                             strmemb(q->n_right->n_ap)) {
273                                 p = zapleft(p);
274                                 p = zapleft(p);
275                         }
276                 }
277                 /* FALLTHROUGH */
ragge
1.1
278         case PLUS:
279         case AND:
280         case OR:
281         case ER:
282                 /* commutative ops; for now, just collect constants */
283                 /* someday, do it right */
ragge
1.14
284                 ifnncon(p->n_left) || ( LCON(p) && !RCON(p) ) )
285                         SWAPp->n_leftp->n_right );
ragge
1.1
286                 /* make ops tower to the left, not the right */
287                 ifRO(p) == o ){
288                         NODE *t1, *t2, *t3;
ragge
1.3
289                         t1 = p->n_left;
290                         sp = p->n_right;
291                         t2 = sp->n_left;
292                         t3 = sp->n_right;
ragge
1.1
293                         /* now, put together again */
ragge
1.3
294                         p->n_left = sp;
295                         sp->n_left = t1;
296                         sp->n_right = t2;
ragge
1.45
297                         sp->n_type = p->n_type;
ragge
1.3
298                         p->n_right = t3;
ragge
1.1
299                         }
ragge
1.3
300                 if(o == PLUS && LO(p) == MINUS && RCON(p) && RCON(p->n_left) &&
301                    conval(p->n_rightMINUSp->n_left->n_right)){
ragge
1.1
302                         zapleft:
ragge
1.8
303
304                         q = p->n_left->n_left;
305                         nfree(p->n_left->n_right);
306                         nfree(p->n_left);
307                         p->n_left = q;
ragge
1.1
308                 }
ragge
1.14
309                 ifRCON(p) && LO(p)==o && RCON(p->n_left) &&
310                     convalp->n_rightop->n_left->n_right ) ){
ragge
1.1
311                         goto zapleft;
312                         }
ragge
1.10
313                 else ifLCON(p) && RCON(p) && convalp->n_leftop->n_right ) ){
ragge
1.1
314                         zapright:
ragge
1.8
315                         nfree(p->n_right);
ragge
1.14
316                         q = makety(p->n_leftp->n_typep->n_qual,
ragge
1.35
317                             p->n_dfp->n_ap);
ragge
1.8
318                         nfree(p);
ragge
1.44
319                         p = clocal(q);
320                         break;
ragge
1.10
321                         }
ragge
1.1
322
ragge
1.10
323                 /* change muls to shifts */
ragge
1.1
324
ragge
1.10
325                 ifo == MUL && nncon(p->n_right) && (i=ispow2(RV(p)))>=0){
326                         ifi == 0 ) { /* multiplication by 1 */
ragge
1.1
327                                 goto zapright;
328                                 }
ragge
1.10
329                         o = p->n_op = LS;
330                         p->n_right->n_type = INT;
331                         p->n_right->n_df = NULL;
332                         RV(p) = i;
ragge
1.1
333                         }
334
335                 /* change +'s of negative consts back to - */
ragge
1.3
336                 ifo==PLUS && nncon(p->n_right) && RV(p)<0 ){
ragge
1.1
337                         RV(p) = -RV(p);
ragge
1.3
338                         o = p->n_op = MINUS;
ragge
1.1
339                         }
ragge
1.28
340
341                 /* remove ops with RHS 0 */
342                 if ((o == PLUS || o == MINUS || o == OR || o == ER) &&
343                     nncon(p->n_right) && RV(p) == 0) {
344                         goto zapright;
345                 }
ragge
1.1
346                 break;
347
348         case DIV:
ragge
1.19
349                 ifnnconp->n_right ) && p->n_right->n_lval == 1 )
350                         goto zapright;
351                 if (LCON(p) && RCON(p) && conval(p->n_leftDIVp->n_right))
352                         goto zapright;
ragge
1.25
353                 if (RCON(p) && ISUNSIGNED(p->n_type) && (i=ispow2(RV(p))) > 0) {
354                         p->n_op = RS;
355                         RV(p) = i;
ragge
1.27
356                         q = p->n_right;
ragge
1.35
357                         if(tsize(q->n_typeq->n_dfq->n_ap) > SZINT)
ragge
1.38
358                                 p->n_right = makety(qINT000);
ragge
1.27
359
ragge
1.25
360                         break;
361                 }
362                 break;
363
364         case MOD:
365                 if (RCON(p) && ISUNSIGNED(p->n_type) && ispow2(RV(p)) > 0) {
366                         p->n_op = AND;
367                         RV(p) = RV(p) -1;
368                         break;
369                 }
ragge
1.1
370                 break;
371
372         case EQ:
373         case NE:
374         case LT:
375         case LE:
376         case GT:
377         case GE:
378         case ULT:
379         case ULE:
380         case UGT:
381         case UGE:
382                 if( !LCON(p) ) break;
383
384                 /* exchange operands */
385
ragge
1.3
386                 sp = p->n_left;
387                 p->n_left = p->n_right;
388                 p->n_right = sp;
389                 p->n_op = revrel[p->n_op - EQ ];
ragge
1.1
390                 break;
391
ragge
1.32
392 #ifdef notyet
393         case ASSIGN:
394                 /* Simple test to avoid two branches */
395                 if (RO(p) != NE)
396                         break;
397                 q = p->n_right;
398                 if (RCON(q) && RV(q) == 0 && LO(q) == AND &&
399                     RCON(q->n_left) && (i = ispow2(RV(q->n_left))) &&
400                     q->n_left->n_type == INT) {
401                         q->n_op = RS;
402                         RV(q) = i;
ragge
1.1
403                 }
ragge
1.32
404                 break;
405 #endif
406         }
ragge
1.1
407
408         return(p);
409         }
410
ragge
1.2
411 int
412 ispow2(CONSZ c)
413 {
414         int i;
ragge
1.1
415         ifc <= 0 || (c&(c-1)) ) return(-1);
416         fori=0c>1; ++ic >>= 1;
417         return(i);
ragge
1.2
418 }
ragge
1.10
419
420 int
421 nnconp ) NODE *p; {
422         /* is p a constant without a name */
423         returnp->n_op == ICON && p->n_sp == NULL );
424         }
FishEye: Open Source License registered to PCC.
Your maintenance has expired. You can renew your license at http://www.atlassian.com/fisheye/renew
Atlassian FishEye, CVS analysis. (Version:1.6.3 Build:build-336 2008-11-04) - Administration - Page generated 2014-09-18 21:48 +0200