Searched refs:numUses (Results 1 - 9 of 9) sorted by relevance

/dalvik/vm/compiler/
H A DDataflow.cpp940 for (i = 1; i < mir->ssaRep->numUses; i++) {
1000 if (mir->ssaRep->numUses) {
1004 for (udIdx = 1; udIdx < mir->ssaRep->numUses; udIdx++) {
1070 for (i = 0; i < ssaRep->numUses; i++) {
1188 int numUses = dInsn->vA; local
1191 mir->ssaRep->numUses = numUses;
1192 mir->ssaRep->uses = (int *)dvmCompilerNew(sizeof(int) * numUses, false);
1194 for (i = 0; i < numUses; i++) {
1203 int numUses local
1228 int numUses = 0; local
[all...]
H A DRalloc.cpp37 for (i=0; ssaRep->fpUse && i< ssaRep->numUses; i++) {
H A DDataflow.h97 int numUses; member in struct:SSARepresentation
H A DSSATransformation.cpp533 int numUses = dvmCountSetBits(ssaRegV); local
534 mir->ssaRep->numUses = numUses;
536 (int *) dvmCompilerNew(sizeof(int) * numUses, false);
538 (bool *) dvmCompilerNew(sizeof(bool) * numUses, true);
H A DLoop.cpp218 if (branch->ssaRep->numUses == 2) {
240 } else if (branch->ssaRep->numUses == 1) {
/dalvik/vm/compiler/codegen/
H A DRalloc.h75 assert(mir->ssaRep->numUses > num);
/dalvik/vm/compiler/codegen/mips/
H A DRalloc.h79 assert(mir->ssaRep->numUses > num);
H A DCodegenDriver.cpp941 if (mir->ssaRep->numUses == 2) {
944 } else if (mir->ssaRep->numUses == 3) {
950 assert(mir->ssaRep->numUses == 4);
2032 if (mir->ssaRep->numUses == 2)
2761 if (mir->ssaRep->numUses == 3) {
2766 assert(mir->ssaRep->numUses == 4);
2773 if (mir->ssaRep->numUses == 4) {
2777 assert(mir->ssaRep->numUses == 2);
/dalvik/vm/compiler/codegen/arm/
H A DCodegenDriver.cpp904 if (mir->ssaRep->numUses == 2) {
907 } else if (mir->ssaRep->numUses == 3) {
913 assert(mir->ssaRep->numUses == 4);
1986 if (mir->ssaRep->numUses == 2)
2690 if (mir->ssaRep->numUses == 3) {
2695 assert(mir->ssaRep->numUses == 4);
2702 if (mir->ssaRep->numUses == 4) {
2706 assert(mir->ssaRep->numUses == 2);

Completed in 71 milliseconds