Lines Matching refs:End
354 printf("Optimize: End dead code removal.\n");
371 END
379 * Return READ, WRITE, FLOW or END to indicate the next usage or an indicator
406 return END;
428 return END;
590 printf("Optimize: End remove extra move use.\n");
630 if (use == WRITE || use == END)
800 if (next_use == WRITE || next_use == END) {
831 printf("Optimize: End remove extra moves. %u instructions removed\n", rem);
843 GLuint Start, End; /** Start/end instruction numbers */
862 /** Insert interval inv into list, sorted by interval end */
868 while (i >= 0 && list->Intervals[i].End > inv->End) {
879 ASSERT(list->Intervals[i].End <= list->Intervals[i + 1].End);
896 ASSERT(list->Intervals[k].End == inv->End);
940 GLuint Start, End; /**< Start, end instructions of loop */
954 GLuint end = ic;
956 /* If the register is used in a loop, extend its lifetime through the end
961 end = loopStack[i].End;
966 /* Variables that are live at the end of a loop will also be live at the
970 if (loopStackDepth > 0 && ic > loopStack[0].Start && ic < loopStack[0].End) {
978 intEnd[index] = end;
981 intEnd[index] = end;
1008 loopStack[loopStackDepth].End = inst->BranchTarget;
1080 inv.End = intEnd[i];
1093 inv->Reg, inv->Start, inv->End);
1098 for (j = inv->Start; j <= inv->End; j++)
1175 if (inv->End >= live->Start) {
1216 * by increasing end points.
1233 printf("Optimize: End live-interval register reallocation\n");
1336 printf("Optimize: End reads without writes\n");
