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

  /dalvik/vm/compiler/
Ralloc.c 38 SSARepresentation *ssaRep = mir->ssaRep;
40 if (ssaRep) {
41 for (i=0; i< ssaRep->numUses; i++) {
42 int reg = ssaRep->uses[i];
46 for (i=0; i< ssaRep->numDefs; i++) {
47 int reg = ssaRep->defs[i];
71 SSARepresentation *ssaRep = mir->ssaRep;
72 if (ssaRep) {
    [all...]
Dataflow.c 874 char *dvmCompilerGetSSAString(CompilationUnit *cUnit, SSARepresentation *ssaRep)
881 for (i = 0; i < ssaRep->numDefs; i++) {
882 int ssa2DalvikValue = dvmConvertSSARegToDalvik(cUnit, ssaRep->defs[i]);
885 ssaRep->defs[i], DECODE_REG(ssa2DalvikValue),
889 if (ssaRep->numDefs) {
893 for (i = 0; i < ssaRep->numUses; i++) {
894 int ssa2DalvikValue = dvmConvertSSARegToDalvik(cUnit, ssaRep->uses[i]);
898 ssaRep->uses[i], DECODE_REG(ssa2DalvikValue),
1016 mir->ssaRep->numUses = numUses;
1017 mir->ssaRep->uses = dvmCompilerNew(sizeof(int) * numUses, false)
    [all...]
Loop.c 78 mir->ssaRep->numUses = 2;
79 mir->ssaRep->uses = dvmCompilerNew(sizeof(int) * 2, false);
80 mir->ssaRep->uses[0] =
82 mir->ssaRep->uses[1] =
161 if (branch->ssaRep->numUses == 0 || branch->ssaRep->numDefs != 0) {
169 if (branch->ssaRep->uses[0] != loopAnalysis->ssaBIV) {
185 int endReg = dvmConvertSSARegToDalvik(cUnit, branch->ssaRep->uses[1]);
202 branch->ssaRep->uses[1]);
323 dvmConvertSSARegToDalvik(cUnit, mir->ssaRep->uses[refIdx])
    [all...]
Compiler.h 191 struct SSARepresentation *ssaRep);
CompilerIR.h 108 struct SSARepresentation *ssaRep;
  /dalvik/vm/compiler/codegen/arm/
Ralloc.h 65 assert(mir->ssaRep->numUses > num);
66 return mir->ssaRep->uses[num];
CodegenDriver.c 812 if (mir->ssaRep->numUses == 2) {
815 } else if (mir->ssaRep->numUses == 3) {
821 assert(mir->ssaRep->numUses == 4);
823 if (mir->ssaRep->numDefs == 1) {
826 assert(mir->ssaRep->numDefs == 2);
    [all...]
RallocUtil.c 907 assert(mir->ssaRep->numDefs > num);
908 return mir->ssaRep->defs[num];

Completed in 328 milliseconds