Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20140408195456

Diff

Diff from 1.57 to:

Annotations

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

Annotated File View

ragge
1.57
1 /*      $Id: optim.c,v 1.57 2014/04/08 19:54:56 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;
plunky
1.48
88         OFFSZ sz;
89         int i;
ragge
1.1
90
plunky
1.49
91         if (odebugreturn(p);
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.47
112                 if (p->n_type != VOID)
113                         p = clocal(p);
ragge
1.44
114                 break;
ragge
1.1
115
116         case FORTCALL:
ragge
1.3
117                 p->n_right = fortargp->n_right );
ragge
1.1
118                 break;
119
ragge
1.15
120         case ADDROF:
ragge
1.20
121                 if (LO(p) == TEMP)
ragge
1.44
122                         break;
ragge
1.10
123                 ifLO(p) != NAME ) cerror"& error" );
124
ragge
1.44
125                 if( !andable(p->n_left) && !statinit)
126                         break;
ragge
1.1
127
128                 LO(p) = ICON;
129
130                 setuleft:
131                 /* paint over the type of the left hand side with the type of the top */
ragge
1.3
132                 p->n_left->n_type = p->n_type;
ragge
1.7
133                 p->n_left->n_df = p->n_df;
ragge
1.35
134                 p->n_left->n_ap = p->n_ap;
ragge
1.8
135                 q = p->n_left;
136                 nfree(p);
ragge
1.44
137                 p = q;
138                 break;
ragge
1.1
139
ragge
1.45
140         case NOT:
141         case UMINUS:
142         case COMPL:
143                 if (LCON(p) && conval(p->n_leftop->n_left))
144                         p = nfree(p);
145                 break;
146
ragge
1.16
147         case UMUL:
ragge
1.46
148                 /* Do not discard ADDROF TEMP's */
149                 if (LO(p) == ADDROF && LO(p->n_left) != TEMP) {
ragge
1.36
150                         q = p->n_left->n_left;
151                         nfree(p->n_left);
152                         nfree(p);
ragge
1.44
153                         p = q;
154                         break;
ragge
1.36
155                 }
ragge
1.1
156                 ifLO(p) != ICON ) break;
157                 LO(p) = NAME;
158                 goto setuleft;
159
ragge
1.21
160         case RS:
ragge
1.37
161                 if (LCON(p) && RCON(p) && conval(p->n_leftop->n_right))
162                         goto zapright;
163
ragge
1.38
164                 sz = tsize(p->n_typep->n_dfp->n_ap);
ragge
1.34
165
ragge
1.31
166                 if (LO(p) == RS && RCON(p->n_left) && RCON(p) &&
ragge
1.38
167                     (RV(p) + RV(p->n_left)) < sz) {
ragge
1.21
168                         /* two right-shift  by constants */
169                         RV(p) += RV(p->n_left);
170                         p->n_left = zapleft(p->n_left);
ragge
1.23
171                 }
172 #if 0
173                   else if (LO(p) == LS && RCON(p->n_left) && RCON(p)) {
ragge
1.21
174                         RV(p) -= RV(p->n_left);
175                         if (RV(p) < 0)
176                                 o = p->n_op = LSRV(p) = -RV(p);
177                         p->n_left = zapleft(p->n_left);
178                 }
ragge
1.23
179 #endif
ragge
1.22
180                 if (RO(p) == ICON) {
181                         if (RV(p) < 0) {
182                                 RV(p) = -RV(p);
183                                 p->n_op = LS;
184                                 goto again;
185                         }
ragge
1.24
186 #ifdef notyet /* must check for side effects, --a >> 32; */
ragge
1.22
187                         if (RV(p) >= tsize(p->n_typep->n_dfp->n_sue) &&
188                             ISUNSIGNED(p->n_type)) { /* ignore signed shifts */
189                                 /* too many shifts */
190                                 tfree(p->n_left);
191                                 nfree(p->n_right);
192                                 p->n_op = ICONp->n_lval = 0p->n_sp = NULL;
ragge
1.24
193                         } else
194 #endif
ragge
1.26
195                         /* avoid larger shifts than type size */
ragge
1.54
196                         if (RV(p) >= sz)
ragge
1.26
197                                 werror("shift larger than type");
ragge
1.24
198                         if (RV(p) == 0)
ragge
1.22
199                                 p = zapleft(p);
ragge
1.21
200                 }
201                 break;
202
203         case LS:
ragge
1.37
204                 if (LCON(p) && RCON(p) && conval(p->n_leftop->n_right))
205                         goto zapright;
206
ragge
1.38
207                 sz = tsize(p->n_typep->n_dfp->n_ap);
ragge
1.34
208
ragge
1.21
209                 if (LO(p) == LS && RCON(p->n_left) && RCON(p)) {
210                         /* two left-shift  by constants */
211                         RV(p) += RV(p->n_left);
212                         p->n_left = zapleft(p->n_left);
ragge
1.23
213                 }
214 #if 0
215                   else if (LO(p) == RS && RCON(p->n_left) && RCON(p)) {
ragge
1.21
216                         RV(p) -= RV(p->n_left);
217                         p->n_left = zapleft(p->n_left);
218                 }
ragge
1.23
219 #endif
ragge
1.22
220                 if (RO(p) == ICON) {
221                         if (RV(p) < 0) {
222                                 RV(p) = -RV(p);
223                                 p->n_op = RS;
224                                 goto again;
225                         }
ragge
1.24
226 #ifdef notyet /* must check for side effects */
ragge
1.22
227                         if (RV(p) >= tsize(p->n_typep->n_dfp->n_sue)) {
228                                 /* too many shifts */
229                                 tfree(p->n_left);
230                                 nfree(p->n_right);
231                                 p->n_op = ICONp->n_lval = 0p->n_sp = NULL;
ragge
1.24
232                         } else
233 #endif
ragge
1.26
234                         /* avoid larger shifts than type size */
ragge
1.54
235                         if (RV(p) >= sz)
ragge
1.26
236                                 werror("shift larger than type");
ragge
1.24
237                         if (RV(p) == 0)  
ragge
1.22
238                                 p = zapleft(p);
ragge
1.21
239                 }
240                 break;
241
ragge
1.50
242         case QUEST:
plunky
1.56
243                 if (!LCON(p))
ragge
1.50
244                         break;
245                 if (LV(p) == 0) {
246                         q = p->n_right->n_right;
247                 } else {
248                         q = p->n_right->n_left;
249                         p->n_right->n_left = p->n_right->n_right;
250                 }
251                 p->n_right->n_op = UMUL/* for tfree() */
252                 tfree(p);
253                 p = q;
254                 break;
255
ragge
1.1
256         case MINUS:
ragge
1.19
257                 if (LCON(p) && RCON(p) && p->n_left->n_sp == p->n_right->n_sp) {
258                         /* link-time constants, but both are the same */
259                         /* solve it now by forgetting the symbols */
260                         p->n_left->n_sp = p->n_right->n_sp = NULL;
261                 }
ragge
1.3
262                 if( !nncon(p->n_right) ) break;
ragge
1.1
263                 RV(p) = -RV(p);
ragge
1.3
264                 o = p->n_op = PLUS;
ragge
1.55
265                 /* FALLTHROUGH */
ragge
1.1
266         case MUL:
ragge
1.43
267                 /*
268                  * Check for u=(x-y)+z; where all vars are pointers to
269                  * the same struct. This has two advantages:
270                  * 1: avoid a mul+div
271                  * 2: even if not allowed, people may get surprised if this
272                  *    calculation do not give correct result if using
273                  *    unaligned structs.
274                  */
ragge
1.55
275                 if (o == MUL && p->n_type == INTPTR && RCON(p) &&
ragge
1.43
276                     LO(p) == DIV && RCON(p->n_left) &&
277                     RV(p) == RV(p->n_left) &&
278                     LO(p->n_left) == MINUS) {
279                         q = p->n_left->n_left;
280                         if (q->n_left->n_type == PTR+STRTY &&
281                             q->n_right->n_type == PTR+STRTY &&
282                             strmemb(q->n_left->n_ap) ==
283                             strmemb(q->n_right->n_ap)) {
284                                 p = zapleft(p);
285                                 p = zapleft(p);
286                         }
287                 }
288                 /* FALLTHROUGH */
ragge
1.1
289         case PLUS:
290         case AND:
291         case OR:
292         case ER:
293                 /* commutative ops; for now, just collect constants */
294                 /* someday, do it right */
ragge
1.14
295                 ifnncon(p->n_left) || ( LCON(p) && !RCON(p) ) )
296                         SWAPp->n_leftp->n_right );
ragge
1.1
297                 /* make ops tower to the left, not the right */
298                 ifRO(p) == o ){
ragge
1.57
299                         SWAP(p->n_leftp->n_right);
300 #ifdef notdef
301                 /* Yetch, this breaks type correctness in trees */
302                 /* Code was probably written before types */
303                 /* All we can do here is swap and pray */
ragge
1.1
304                         NODE *t1, *t2, *t3;
ragge
1.3
305                         t1 = p->n_left;
306                         sp = p->n_right;
307                         t2 = sp->n_left;
308                         t3 = sp->n_right;
ragge
1.1
309                         /* now, put together again */
ragge
1.3
310                         p->n_left = sp;
311                         sp->n_left = t1;
312                         sp->n_right = t2;
ragge
1.45
313                         sp->n_type = p->n_type;
ragge
1.3
314                         p->n_right = t3;
ragge
1.57
315 #endif
ragge
1.1
316                         }
ragge
1.3
317                 if(o == PLUS && LO(p) == MINUS && RCON(p) && RCON(p->n_left) &&
318                    conval(p->n_rightMINUSp->n_left->n_right)){
ragge
1.1
319                         zapleft:
ragge
1.8
320
321                         q = p->n_left->n_left;
322                         nfree(p->n_left->n_right);
323                         nfree(p->n_left);
324                         p->n_left = q;
ragge
1.1
325                 }
ragge
1.14
326                 ifRCON(p) && LO(p)==o && RCON(p->n_left) &&
327                     convalp->n_rightop->n_left->n_right ) ){
ragge
1.1
328                         goto zapleft;
329                         }
ragge
1.10
330                 else ifLCON(p) && RCON(p) && convalp->n_leftop->n_right ) ){
ragge
1.1
331                         zapright:
ragge
1.8
332                         nfree(p->n_right);
ragge
1.14
333                         q = makety(p->n_leftp->n_typep->n_qual,
ragge
1.35
334                             p->n_dfp->n_ap);
ragge
1.8
335                         nfree(p);
ragge
1.44
336                         p = clocal(q);
337                         break;
ragge
1.10
338                         }
ragge
1.1
339
ragge
1.10
340                 /* change muls to shifts */
ragge
1.1
341
ragge
1.10
342                 ifo == MUL && nncon(p->n_right) && (i=ispow2(RV(p)))>=0){
343                         ifi == 0 ) { /* multiplication by 1 */
ragge
1.1
344                                 goto zapright;
345                                 }
ragge
1.10
346                         o = p->n_op = LS;
347                         p->n_right->n_type = INT;
348                         p->n_right->n_df = NULL;
349                         RV(p) = i;
ragge
1.1
350                         }
351
352                 /* change +'s of negative consts back to - */
ragge
1.3
353                 ifo==PLUS && nncon(p->n_right) && RV(p)<0 ){
ragge
1.1
354                         RV(p) = -RV(p);
ragge
1.3
355                         o = p->n_op = MINUS;
ragge
1.1
356                         }
ragge
1.28
357
358                 /* remove ops with RHS 0 */
359                 if ((o == PLUS || o == MINUS || o == OR || o == ER) &&
360                     nncon(p->n_right) && RV(p) == 0) {
361                         goto zapright;
362                 }
ragge
1.1
363                 break;
364
365         case DIV:
ragge
1.19
366                 ifnnconp->n_right ) && p->n_right->n_lval == 1 )
367                         goto zapright;
368                 if (LCON(p) && RCON(p) && conval(p->n_leftDIVp->n_right))
369                         goto zapright;
ragge
1.25
370                 if (RCON(p) && ISUNSIGNED(p->n_type) && (i=ispow2(RV(p))) > 0) {
371                         p->n_op = RS;
372                         RV(p) = i;
ragge
1.27
373                         q = p->n_right;
ragge
1.35
374                         if(tsize(q->n_typeq->n_dfq->n_ap) > SZINT)
ragge
1.38
375                                 p->n_right = makety(qINT000);
ragge
1.27
376
ragge
1.25
377                         break;
378                 }
379                 break;
380
381         case MOD:
382                 if (RCON(p) && ISUNSIGNED(p->n_type) && ispow2(RV(p)) > 0) {
383                         p->n_op = AND;
384                         RV(p) = RV(p) -1;
385                         break;
386                 }
ragge
1.1
387                 break;
388
389         case EQ:
390         case NE:
391         case LT:
392         case LE:
393         case GT:
394         case GE:
395         case ULT:
396         case ULE:
397         case UGT:
398         case UGE:
ragge
1.51
399                 if (LCON(p) && RCON(p) &&
400                     !ISPTR(p->n_left->n_type) && !ISPTR(p->n_right->n_type)) {
401                         /* Do constant evaluation */
402                         q = p->n_left;
403                         if (conval(qop->n_right)) {
404                                 nfree(p->n_right);
405                                 nfree(p);
406                                 p = q;
407                                 break;
408                         }
409                 }
410
ragge
1.1
411                 if( !LCON(p) ) break;
412
413                 /* exchange operands */
414
ragge
1.3
415                 sp = p->n_left;
416                 p->n_left = p->n_right;
417                 p->n_right = sp;
418                 p->n_op = revrel[p->n_op - EQ ];
ragge
1.1
419                 break;
420
ragge
1.53
421         case CBRANCH:
422                 if (LCON(p)) {
423                         if (LV(p) == 0) {
424                                 tfree(p);
425                                 p = bcon(0);
426                         } else {
427                                 tfree(p->n_left);
428                                 p->n_left = p->n_right;
429                                 p->n_op = GOTO;
430                         }
431                 }
432                 break;
433                                 
434
ragge
1.32
435 #ifdef notyet
436         case ASSIGN:
437                 /* Simple test to avoid two branches */
438                 if (RO(p) != NE)
439                         break;
440                 q = p->n_right;
441                 if (RCON(q) && RV(q) == 0 && LO(q) == AND &&
442                     RCON(q->n_left) && (i = ispow2(RV(q->n_left))) &&
443                     q->n_left->n_type == INT) {
444                         q->n_op = RS;
445                         RV(q) = i;
ragge
1.1
446                 }
ragge
1.32
447                 break;
448 #endif
449         }
ragge
1.1
450
451         return(p);
452         }
453
ragge
1.2
454 int
455 ispow2(CONSZ c)
456 {
457         int i;
ragge
1.1
458         ifc <= 0 || (c&(c-1)) ) return(-1);
459         fori=0c>1; ++ic >>= 1;
460         return(i);
ragge
1.2
461 }
ragge
1.10
462
463 int
plunky
1.52
464 nncon(NODE *p)
465 {
ragge
1.10
466         /* is p a constant without a name */
467         returnp->n_op == ICON && p->n_sp == NULL );
plunky
1.52
468 }
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-10-01 06:05 +0200