Lines Matching refs:numUses

940             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;
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 = dInsn->vA;
1206 mir->ssaRep->numUses = numUses;
1207 mir->ssaRep->uses = (int *)dvmCompilerNew(sizeof(int) * numUses, false);
1209 for (i = 0; i < numUses; i++) {
1228 int numUses = 0;
1242 numUses++;
1244 numUses += 2;
1247 numUses++;
1249 numUses += 2;
1252 numUses++;
1254 numUses += 2;
1258 if (numUses) {
1259 mir->ssaRep->numUses = numUses;
1260 mir->ssaRep->uses = (int *)dvmCompilerNew(sizeof(int) * numUses,
1262 mir->ssaRep->fpUse = (bool *)dvmCompilerNew(sizeof(bool) * numUses,
1286 numUses = 0;
1288 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_A;
1289 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vA, numUses++);
1291 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_A;
1292 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vA, numUses++);
1293 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_A;
1294 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vA+1, numUses++);
1297 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_B;
1298 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vB, numUses++);
1300 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_B;
1301 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vB, numUses++);
1302 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_B;
1303 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vB+1, numUses++);
1306 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_C;
1307 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vC, numUses++);
1309 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_C;
1310 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vC, numUses++);
1311 mir->ssaRep->fpUse[numUses] = dfAttributes & DF_FP_C;
1312 handleSSAUse(cUnit, mir->ssaRep->uses, dInsn->vC+1, numUses++);
1401 for (i = 0; i < mir->ssaRep->numUses; i++) {
1405 if (i == mir->ssaRep->numUses) {