1 /*-------------------------------------------------------------------------
2 SDCCopt.c - calls all the optimizations routines and does some of the
3 hackier transformations, these include translating iCodes
4 to function calls and replacing local variables with their
5 register equivalents etc. Also contains the driver routine
6 for dead code elimination
8 Written By - Sandeep Dutta . sandeep.dutta@usa.net (1998)
10 This program is free software; you can redistribute it and/or modify it
11 under the terms of the GNU General Public License as published by the
12 Free Software Foundation; either version 2, or (at your option) any
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
24 In other words, you are welcome to use, share and improve this program.
25 You are forbidden to forbid anyone else to use, share and improve
26 what you give them. Help stamp out software-hoarding!
27 -------------------------------------------------------------------------*/
31 /*-----------------------------------------------------------------*/
32 /* global variables */
38 /*-----------------------------------------------------------------*/
39 /* printSymName - prints the symbol names */
40 /*-----------------------------------------------------------------*/
42 printSymName (void *vsym)
45 fprintf (stdout, " %s ", sym->name);
49 /*-----------------------------------------------------------------*/
50 /* cnvToFcall - does the actual conversion to function call */
51 /*-----------------------------------------------------------------*/
53 cnvToFcall (iCode * ic, eBBlock * ebp)
60 int lineno = ic->lineno;
63 ip = ic->next; /* insertion point */
64 /* remove it from the iCode */
65 remiCodeFromeBBlock (ebp, ic);
68 right = IC_RIGHT (ic);
104 /* if float support routines NOT compiled as reentrant */
105 if (!options.float_rent)
109 if (IS_REGPARM (FUNC_ARGS(func->type)->etype))
111 newic = newiCode (SEND, IC_LEFT (ic), NULL);
112 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
116 newic = newiCode ('=', NULL, IC_LEFT (ic));
117 IC_RESULT (newic) = operandFromValue (FUNC_ARGS(func->type));
120 addiCodeToeBBlock (ebp, newic, ip);
121 newic->lineno = lineno;
124 if (IS_REGPARM (FUNC_ARGS(func->type)->next->etype))
126 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
127 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->next->etype);
131 newic = newiCode ('=', NULL, IC_RIGHT (ic));
132 IC_RESULT (newic) = operandFromValue (FUNC_ARGS(func->type)->next);
134 addiCodeToeBBlock (ebp, newic, ip);
135 newic->lineno = lineno;
142 if (IS_REGPARM (FUNC_ARGS(func->type)->next->etype))
144 newic = newiCode (SEND, right, NULL);
145 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->next->etype);
149 newic = newiCode (IPUSH, right, NULL);
152 bytesPushed += getSize(operandType(right));
155 addiCodeToeBBlock (ebp, newic, ip);
156 newic->lineno = lineno;
158 /* insert push left */
159 if (IS_REGPARM (FUNC_ARGS(func->type)->etype))
161 newic = newiCode (SEND, left, NULL);
162 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
166 newic = newiCode (IPUSH, left, NULL);
169 bytesPushed += getSize(operandType(left));
171 addiCodeToeBBlock (ebp, newic, ip);
172 newic->lineno = lineno;
174 /* insert the call */
175 newic = newiCode (CALL, operandFromSymbol (func), NULL);
176 IC_RESULT (newic) = IC_RESULT (ic);
177 newic->lineno = lineno;
178 newic->parmBytes+=bytesPushed;
179 addiCodeToeBBlock (ebp, newic, ip);
182 /*-----------------------------------------------------------------*/
183 /* cnvToFloatCast - converts casts to floats to function calls */
184 /*-----------------------------------------------------------------*/
186 cnvToFloatCast (iCode * ic, eBBlock * ebp)
190 sym_link *type = operandType (IC_RIGHT (ic));
191 int linenno = ic->lineno;
196 /* remove it from the iCode */
197 remiCodeFromeBBlock (ebp, ic);
198 /* depending on the type */
199 for (bwd = 0; bwd < 3; bwd++)
201 for (su = 0; su < 2; su++)
203 if (compareType (type, __multypes[bwd][su]) == 1)
205 func = __conv[0][bwd][su];
213 /* if float support routines NOT compiled as reentrant */
214 if (!options.float_rent)
217 if (IS_REGPARM (FUNC_ARGS(func->type)->etype))
219 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
220 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
224 newic = newiCode ('=', NULL, IC_RIGHT (ic));
225 IC_RESULT (newic) = operandFromValue (FUNC_ARGS(func->type));
227 addiCodeToeBBlock (ebp, newic, ip);
228 newic->lineno = linenno;
234 if (IS_REGPARM (FUNC_ARGS(func->type)->etype)) {
235 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
236 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
240 newic = newiCode (IPUSH, IC_RIGHT (ic), NULL);
242 bytesPushed += getSize(operandType(IC_RIGHT(ic)));
244 addiCodeToeBBlock (ebp, newic, ip);
245 newic->lineno = linenno;
250 newic = newiCode (CALL, operandFromSymbol (func), NULL);
251 IC_RESULT (newic) = IC_RESULT (ic);
252 newic->parmBytes+=bytesPushed;
253 addiCodeToeBBlock (ebp, newic, ip);
254 newic->lineno = linenno;
258 /*-----------------------------------------------------------------*/
259 /* cnvFromFloatCast - converts casts From floats to function calls */
260 /*-----------------------------------------------------------------*/
262 cnvFromFloatCast (iCode * ic, eBBlock * ebp)
266 sym_link *type = operandType (IC_LEFT (ic));
267 int lineno = ic->lineno;
272 /* remove it from the iCode */
273 remiCodeFromeBBlock (ebp, ic);
275 /* depending on the type */
276 for (bwd = 0; bwd < 3; bwd++)
278 for (su = 0; su < 2; su++)
280 if (compareType (type, __multypes[bwd][su]) == 1)
282 func = __conv[1][bwd][su];
290 /* if float support routines NOT compiled as reentrant */
291 if (!options.float_rent)
294 if (IS_REGPARM (FUNC_ARGS(func->type)->etype)) {
295 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
296 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
300 newic = newiCode ('=', NULL, IC_RIGHT (ic));
301 IC_RESULT (newic) = operandFromValue (FUNC_ARGS(func->type));
303 addiCodeToeBBlock (ebp, newic, ip);
304 newic->lineno = lineno;
311 if (IS_REGPARM (FUNC_ARGS(func->type)->etype)) {
312 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
313 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
317 newic = newiCode (IPUSH, IC_RIGHT (ic), NULL);
319 bytesPushed += getSize(operandType(IC_RIGHT(ic)));
321 addiCodeToeBBlock (ebp, newic, ip);
322 newic->lineno = lineno;
327 newic = newiCode (CALL, operandFromSymbol (func), NULL);
328 IC_RESULT (newic) = IC_RESULT (ic);
329 newic->parmBytes+=bytesPushed;
330 addiCodeToeBBlock (ebp, newic, ip);
331 newic->lineno = lineno;
335 extern operand *geniCodeRValue (operand *, bool);
337 /*-----------------------------------------------------------------*/
338 /* convilong - converts int or long mults or divs to fcalls */
339 /*-----------------------------------------------------------------*/
341 convilong (iCode * ic, eBBlock * ebp, sym_link * type, int op)
344 iCode *ip = ic->next;
346 int lineno = ic->lineno;
351 // Easy special case which avoids function call: modulo by a literal power
352 // of two can be replaced by a bitwise AND.
353 if (op == '%' && isOperandLiteral(IC_RIGHT(ic)))
355 unsigned litVal = (unsigned)(operandLitValue(IC_RIGHT(ic)));
357 // See if literal value is a power of 2.
358 while (litVal && !(litVal & 1))
364 // discard first high bit set.
371 IC_RIGHT(ic) = operandFromLit(operandLitValue(IC_RIGHT(ic)) - 1);
376 remiCodeFromeBBlock (ebp, ic);
379 /* depending on the type */
380 for (bwd = 0; bwd < 3; bwd++)
382 for (su = 0; su < 2; su++)
384 if (compareType (type, __multypes[bwd][su]) == 1)
387 func = __muldiv[0][bwd][su];
389 func = __muldiv[1][bwd][su];
391 func = __muldiv[2][bwd][su];
393 func = __rlrr[1][bwd][su];
395 func = __rlrr[0][bwd][su];
396 else if (op == RIGHT_OP)
397 func = __rlrr[1][bwd][su];
398 else if (op == LEFT_OP)
399 func = __rlrr[0][bwd][su];
408 /* if int & long support routines NOT compiled as reentrant */
409 if (!options.intlong_rent)
412 if (IS_REGPARM (FUNC_ARGS(func->type)->etype)) {
413 newic = newiCode (SEND, IC_LEFT (ic), NULL);
414 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
418 newic = newiCode ('=', NULL, IC_LEFT (ic));
419 IC_RESULT (newic) = operandFromValue (FUNC_ARGS(func->type));
421 addiCodeToeBBlock (ebp, newic, ip);
422 newic->lineno = lineno;
425 if (IS_REGPARM (FUNC_ARGS(func->type)->next->etype)) {
426 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
427 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->next->etype);
431 newic = newiCode ('=', NULL, IC_RIGHT (ic));
432 IC_RESULT (newic) = operandFromValue (FUNC_ARGS(func->type)->next);
434 addiCodeToeBBlock (ebp, newic, ip);
435 newic->lineno = lineno;
440 /* compiled as reentrant then push */
442 if (IS_REGPARM (FUNC_ARGS(func->type)->next->etype))
444 newic = newiCode (SEND, IC_RIGHT (ic), NULL);
445 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->next->etype);
449 newic = newiCode (IPUSH, IC_RIGHT (ic), NULL);
452 bytesPushed += getSize(operandType(IC_RIGHT(ic)));
454 addiCodeToeBBlock (ebp, newic, ip);
455 newic->lineno = lineno;
457 /* insert push left */
458 if (IS_REGPARM (FUNC_ARGS(func->type)->etype))
460 newic = newiCode (SEND, IC_LEFT (ic), NULL);
461 newic->argreg = SPEC_ARGREG(FUNC_ARGS(func->type)->etype);
465 newic = newiCode (IPUSH, IC_LEFT (ic), NULL);
468 bytesPushed += getSize(operandType(IC_LEFT(ic)));
470 addiCodeToeBBlock (ebp, newic, ip);
471 newic->lineno = lineno;
476 newic = newiCode (CALL, operandFromSymbol (func), NULL);
477 IC_RESULT (newic) = IC_RESULT (ic);
478 newic->lineno = lineno;
479 newic->parmBytes+=bytesPushed; // to clear the stack after the call
480 addiCodeToeBBlock (ebp, newic, ip);
483 /*-----------------------------------------------------------------*/
484 /* convertToFcall - converts some operations to fcalls */
485 /*-----------------------------------------------------------------*/
487 convertToFcall (eBBlock ** ebbs, int count)
491 /* for all blocks do */
492 for (i = 0; i < count; i++)
496 /* for all instructions in the block do */
497 for (ic = ebbs[i]->sch; ic; ic = ic->next)
500 /* floating point operations are
501 converted to function calls */
502 if ((IS_CONDITIONAL (ic) ||
503 IS_ARITHMETIC_OP (ic)) &&
504 (IS_FLOAT (operandType (IC_RIGHT (ic)))))
507 cnvToFcall (ic, ebbs[i]);
510 /* casting is a little different */
513 if (IS_FLOAT (operandType (IC_RIGHT (ic))))
514 cnvFromFloatCast (ic, ebbs[i]);
515 else if (IS_FLOAT (operandType (IC_LEFT (ic))))
516 cnvToFloatCast (ic, ebbs[i]);
519 /* if long / int mult or divide or mod */
520 if (ic->op == '*' || ic->op == '/' || ic->op == '%')
522 sym_link *leftType = operandType (IC_LEFT (ic));
524 if (IS_INTEGRAL (leftType) && getSize (leftType) > port->support.muldiv)
526 sym_link *rightType = operandType (IC_RIGHT (ic));
528 if (port->hasNativeMulFor != NULL &&
529 port->hasNativeMulFor (ic, leftType, rightType))
531 /* Leave as native */
535 convilong (ic, ebbs[i], leftType, ic->op);
540 if (ic->op == RRC || ic->op == RLC || ic->op == LEFT_OP || ic->op == RIGHT_OP)
542 sym_link *type = operandType (IC_LEFT (ic));
544 if (IS_INTEGRAL (type) && getSize (type) > port->support.shift && port->support.shift >= 0)
546 convilong (ic, ebbs[i], type, ic->op);
553 /*-----------------------------------------------------------------*/
554 /* replaceRegEqv - replace all local variables with their reqv */
555 /*-----------------------------------------------------------------*/
557 replaceRegEqv (eBBlock ** ebbs, int count)
561 for (i = 0; i < count; i++)
566 for (ic = ebbs[i]->sch; ic; ic = ic->next)
575 if (IS_TRUE_SYMOP (IC_COND (ic)) &&
576 OP_REQV (IC_COND (ic)))
577 IC_COND (ic) = opFromOpWithDU (OP_REQV (IC_COND (ic)),
578 OP_SYMBOL (IC_COND (ic))->defs,
579 OP_SYMBOL (IC_COND (ic))->uses);
584 if (ic->op == JUMPTABLE)
586 if (IS_TRUE_SYMOP (IC_JTCOND (ic)) &&
587 OP_REQV (IC_JTCOND (ic)))
588 IC_JTCOND (ic) = opFromOpWithDU (OP_REQV (IC_JTCOND (ic)),
589 OP_SYMBOL (IC_JTCOND (ic))->defs,
590 OP_SYMBOL (IC_JTCOND (ic))->uses);
594 if (ic->op == RECEIVE)
596 if (OP_SYMBOL (IC_RESULT (ic))->addrtaken)
597 OP_SYMBOL (IC_RESULT (ic))->isspilt = 1;
601 if (IC_RESULT (ic) &&
602 IS_TRUE_SYMOP (IC_RESULT (ic)) &&
603 OP_REQV (IC_RESULT (ic)))
605 if (POINTER_SET (ic))
607 IC_RESULT (ic) = opFromOpWithDU (OP_REQV (IC_RESULT (ic)),
608 OP_SYMBOL (IC_RESULT (ic))->defs,
609 OP_SYMBOL (IC_RESULT (ic))->uses);
610 IC_RESULT (ic)->isaddr = 1;
613 IC_RESULT (ic) = opFromOpWithDU (OP_REQV (IC_RESULT (ic)),
614 OP_SYMBOL (IC_RESULT (ic))->defs,
615 OP_SYMBOL (IC_RESULT (ic))->uses);
619 IS_TRUE_SYMOP (IC_RIGHT (ic)) &&
620 OP_REQV (IC_RIGHT (ic)))
622 IC_RIGHT (ic) = opFromOpWithDU (OP_REQV (IC_RIGHT (ic)),
623 OP_SYMBOL (IC_RIGHT (ic))->defs,
624 OP_SYMBOL (IC_RIGHT (ic))->uses);
625 IC_RIGHT (ic)->isaddr = 0;
629 IS_TRUE_SYMOP (IC_LEFT (ic)) &&
630 OP_REQV (IC_LEFT (ic)))
632 IC_LEFT (ic) = opFromOpWithDU (OP_REQV (IC_LEFT (ic)),
633 OP_SYMBOL (IC_LEFT (ic))->defs,
634 OP_SYMBOL (IC_LEFT (ic))->uses);
635 IC_LEFT (ic)->isaddr = 0;
641 /*-----------------------------------------------------------------*/
642 /* killDeadCode - eliminates dead assignments */
643 /*-----------------------------------------------------------------*/
645 killDeadCode (eBBlock ** ebbs, int count)
652 /* basic algorithm :- */
653 /* first the exclusion rules :- */
654 /* 1. if result is a global or volatile then skip */
655 /* 2. if assignment and result is a temp & isaddr then skip */
656 /* since this means array & pointer access, will be taken */
657 /* care of by alias analysis. */
658 /* 3. if the result is used in the remainder of the block skip */
659 /* 4. if this definition does not reach the end of the block */
660 /* i.e. the result is not present in the outExprs then KILL */
661 /* 5. if it reaches the end of block & is used by some success */
664 /* this whole process is carried on iteratively till no change */
669 /* for all blocks do */
670 for (i = 0; i < count; i++)
674 /* for all instructions in the block do */
675 for (ic = ebbs[i]->sch; ic; ic = ic->next)
683 ic->op == DUMMY_READ_VOLATILE)
686 /* if the result is volatile then continue */
687 if (IC_RESULT (ic) && isOperandVolatile (IC_RESULT (ic), FALSE))
690 /* if the result is a temp & isaddr then skip */
691 if (IC_RESULT (ic) && POINTER_SET (ic))
694 if (POINTER_GET (ic) && IS_VOLATILE (operandType (IC_LEFT (ic))->next))
697 /* if the result is used in the remainder of the */
698 /* block then skip */
699 if (usedInRemaining (IC_RESULT (ic), ic->next))
702 /* does this definition reach the end of the block
703 or the usage is zero then we can kill */
704 if (!bitVectBitValue (ebbs[i]->outDefs, ic->key))
705 kill = 1; /* if not we can kill it */
708 /* if this is a global variable or function parameter */
709 /* we cannot kill anyway */
710 if (isOperandGlobal (IC_RESULT (ic)) ||
711 (OP_SYMBOL (IC_RESULT (ic))->_isparm &&
712 !OP_SYMBOL (IC_RESULT (ic))->ismyparm))
715 /* if we are sure there are no usages */
716 if (bitVectIsZero (OP_USES (IC_RESULT (ic))))
722 /* reset visited flag */
723 for (j = 0; j < count; ebbs[j++]->visited = 0);
725 /* find out if this definition is alive */
726 if (applyToSet (ebbs[i]->succList,
735 /* kill this one if required */
741 remiCodeFromeBBlock (ebbs[i], ic);
743 /* now delete from defUseSet */
744 deleteItemIf (&ebbs[i]->outExprs, ifDiCodeIsX, ic);
745 bitVectUnSetBit (ebbs[i]->outDefs, ic->key);
747 /* and defset of the block */
748 bitVectUnSetBit (ebbs[i]->defSet, ic->key);
750 /* for the left & right remove the usage */
751 if (IS_SYMOP (IC_LEFT (ic)))
752 bitVectUnSetBit (OP_USES (IC_LEFT (ic)), ic->key);
754 if (IS_SYMOP (IC_RIGHT (ic)))
755 bitVectUnSetBit (OP_USES (IC_RIGHT (ic)), ic->key);
758 } /* end of all instructions */
760 if (!ebbs[i]->sch && !ebbs[i]->noPath)
761 disconBBlock (ebbs[i], ebbs, count);
763 } /* end of for all blocks */
767 } /* end of while(1) */
772 /*-----------------------------------------------------------------*/
773 /* printCyclomatic - prints the cyclomatic information */
774 /*-----------------------------------------------------------------*/
776 printCyclomatic (eBBlock ** ebbs, int count)
778 int nEdges = elementsInSet (graphEdges);
781 for (i = 0; i < count; i++)
782 nNodes += (!ebbs[i]->noPath);
784 /* print the information */
785 werror (I_CYCLOMATIC, currFunc->name, nEdges, nNodes, nEdges - nNodes + 2);
788 /*-----------------------------------------------------------------*/
789 /* discardDeadParamReceives - remove any RECEIVE opcodes which */
790 /* refer to dead variables. */
791 /*-----------------------------------------------------------------*/
793 discardDeadParamReceives (eBBlock ** ebbs, int count)
799 for (i = 0; i < count; i++)
801 for (ic = ebbs[i]->sch; ic; ic = ic->next)
803 if (ic->op == RECEIVE)
805 if (IC_RESULT (ic) && OP_SYMBOL (IC_RESULT (ic))
806 && !OP_SYMBOL (IC_RESULT (ic))->used)
809 fprintf (stderr, "discarding dead receive for %s\n",
810 OP_SYMBOL (IC_RESULT (ic))->name);
812 dummyIcode.next = ic->next;
813 remiCodeFromeBBlock (ebbs[i], ic);
821 /*-----------------------------------------------------------------*/
822 /* eBBlockFromiCode - creates extended basic blocks from iCode */
823 /* will return an array of eBBlock pointers */
824 /*-----------------------------------------------------------------*/
826 eBBlockFromiCode (iCode * ic)
828 eBBlock **ebbs = NULL;
836 /* if nothing passed then return nothing */
843 /* optimize the chain for labels & gotos
844 this will eliminate redundant labels and
845 will change jump to jumps by jumps */
846 ic = iCodeLabelOptimize (ic);
848 /* break it down into basic blocks */
849 ebbs = iCodeBreakDown (ic, &count);
852 /* compute the control flow */
853 computeControlFlow (ebbs, count, 0);
855 /* dumpraw if asked for */
856 if (options.dump_raw)
857 dumpEbbsToFileExt (DUMP_RAW0, ebbs, count);
859 /* replace the local variables with their
860 register equivalents : the liveRange computation
861 along with the register allocation will determine
862 if it finally stays in the registers */
863 replaceRegEqv (ebbs, count);
865 /* create loop regions */
866 loops = createLoopRegions (ebbs, count);
868 /* dumpraw if asked for */
869 if (options.dump_raw)
870 dumpEbbsToFileExt (DUMP_RAW1, ebbs, count);
872 /* do common subexpression elimination for each block */
873 change = cseAllBlocks (ebbs, saveCount, FALSE);
875 /* dumpraw if asked for */
876 if (options.dump_raw)
877 dumpEbbsToFileExt (DUMP_CSE, ebbs, count);
879 /* compute the data flow */
880 computeDataFlow (ebbs, saveCount);
882 /* dumpraw if asked for */
883 if (options.dump_raw)
884 dumpEbbsToFileExt (DUMP_DFLOW, ebbs, count);
886 /* global common subexpression elimination */
887 if (optimize.global_cse)
889 change += cseAllBlocks (ebbs, saveCount, FALSE);
890 if (options.dump_gcse)
891 dumpEbbsToFileExt (DUMP_GCSE, ebbs, saveCount);
895 // compute the dataflow only
896 assert(cseAllBlocks (ebbs, saveCount, TRUE)==0);
899 kchange = killDeadCode (ebbs, saveCount);
901 if (options.dump_kill)
902 dumpEbbsToFileExt (DUMP_DEADCODE, ebbs, count);
904 /* do loop optimizations */
905 change += (lchange = loopOptimizations (loops, ebbs, count));
906 if (options.dump_loop)
907 dumpEbbsToFileExt (DUMP_LOOP, ebbs, count);
909 /* recompute the data flow and apply global cse again
910 if loops optimizations or dead code caused a change:
911 loops will brings out of the loop which then may be
912 available for use in the later blocks: dead code
913 elimination could potentially disconnect some blocks
914 conditional flow may be efected so we need to apply
915 subexpression once more */
916 if (lchange || kchange)
918 computeDataFlow (ebbs, saveCount);
919 change += cseAllBlocks (ebbs, saveCount, FALSE);
920 if (options.dump_loop)
921 dumpEbbsToFileExt (DUMP_LOOPG, ebbs, count);
923 /* if loop optimizations caused a change then do
924 dead code elimination once more : this will
925 get rid of the extra assignments to the induction
926 variables created during loop optimizations */
927 killDeadCode (ebbs, saveCount);
929 if (options.dump_loop)
930 dumpEbbsToFileExt (DUMP_LOOPD, ebbs, count);
934 /* sort it back by block number */
935 qsort (ebbs, saveCount, sizeof (eBBlock *), bbNumCompare);
937 if (!options.lessPedantic) {
938 // this is a good place to check missing return values
940 // the user is on his own with naked functions...
941 if (!IS_VOID(currFunc->etype)
942 && !FUNC_ISNAKED(currFunc->type)) {
944 // make sure all predecessors of the last block end in a return
945 for (bp=setFirstItem(ebbs[saveCount-1]->predList);
947 bp=setNextItem(ebbs[saveCount-1]->predList)) {
948 if (bp->ech->op != RETURN) {
949 werror (W_VOID_FUNC, currFunc->name);
956 /* if cyclomatic info requested then print it */
957 if (options.cyclomatic)
958 printCyclomatic (ebbs, saveCount);
960 /* convert operations with support routines
961 written in C to function calls : Iam doing
962 this at this point since I want all the
963 operations to be as they are for optimzations */
964 convertToFcall (ebbs, count);
966 /* compute the live ranges */
967 computeLiveRanges (ebbs, count);
969 if (options.dump_range)
970 dumpEbbsToFileExt (DUMP_RANGE, ebbs, count);
972 /* Now that we have the live ranges, discard parameter
973 * receives for unused parameters.
975 discardDeadParamReceives (ebbs, count);
977 /* allocate registers & generate code */
978 port->assignRegisters (ebbs, count);
980 /* throw away blocks */
981 setToNull ((void *) &graphEdges);
988 /* (add-hook 'c-mode-hook (lambda () (setq c-basic-offset 4))) */