search for: p387

...#3>, pred:%noreg Successors according to CFG: BB#3 BB#6 Several transformations are performed during branch folding: 1) As part of the branch optimization, the conditional branch is reversed. To do so, an additional instruction is added to the code that computes the complementary predicate p387, and this predicate is then used in the reversed branch. The instruction is built using BuildMI and addReg methods as I do in other parts of the backend and as worked well before r161463. The resulting basic block of this step 0 looks like this: BB#2: derived from LLVM BB %while.cond.preheader...

...oduced register is not used anywhere in the method and it is a predicate register // eliminate the instruction // TODO: fix the ugly check for PredicateRegisters if (MRI.use_empty(reg)) { if ( !TargetRegisterInfo::isPhysicalRegister(reg) || (reg >= ADRES::p0 && reg <= ADRES::p387)) { MI->eraseFromParent(); return true; } } return false; } Thanks a lot, Bjorn De Sutter Computer Systems Lab Ghent University