HomeSort by relevance Sort by last modified time
    Searched refs:numUses (Results 1 - 9 of 9) sorted by null

  /dalvik/vm/compiler/
Dataflow.cpp 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++) {
    [all...]
Ralloc.cpp 37 for (i=0; ssaRep->fpUse && i< ssaRep->numUses; i++) {
Dataflow.h 97 int numUses;
SSATransformation.cpp 533 int numUses = dvmCountSetBits(ssaRegV);
534 mir->ssaRep->numUses = numUses;
536 (int *) dvmCompilerNew(sizeof(int) * numUses, false);
538 (bool *) dvmCompilerNew(sizeof(bool) * numUses, true);
Loop.cpp 218 if (branch->ssaRep->numUses == 2) {
240 } else if (branch->ssaRep->numUses == 1) {
  /dalvik/vm/compiler/codegen/
Ralloc.h 75 assert(mir->ssaRep->numUses > num);
  /dalvik/vm/compiler/codegen/mips/
Ralloc.h 79 assert(mir->ssaRep->numUses > num);
CodegenDriver.cpp     [all...]
  /dalvik/vm/compiler/codegen/arm/
CodegenDriver.cpp 904 if (mir->ssaRep->numUses == 2) {
907 } else if (mir->ssaRep->numUses == 3) {
913 assert(mir->ssaRep->numUses == 4);
    [all...]

Completed in 497 milliseconds