/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_program.h | 61 unsigned int Pred:2; member in struct:rc_dst_register
|
/external/llvm/utils/TableGen/ |
H A D | AsmMatcherEmitter.cpp | 1322 Record *Pred = AllPredicates[i]; local 1324 if (!Pred->getValueAsBit("AssemblerMatcherPredicate")) 1327 if (Pred->getName().empty()) 1328 PrintFatalError(Pred->getLoc(), "Predicate has no name!"); 1331 SubtargetFeatures[Pred] = new SubtargetFeatureInfo(Pred, FeatureNo); 1332 DEBUG(SubtargetFeatures[Pred]->dump());
|
H A D | CodeGenDAGPatterns.cpp | 78 bool (*Pred)(MVT::SimpleValueType), 88 if (!Pred || Pred(LegalTypes[i])) 786 if (DefInit *Pred = dyn_cast<DefInit>(Predicates->getElement(i))) { 787 Record *Def = Pred->getDef(); 77 FillWithPossibleTypes(TreePattern &TP, bool (*Pred)(MVT::SimpleValueType), const char *PredicateName) argument
|
H A D | DAGISelMatcher.h | 455 TreePattern *Pred; member in class:llvm::CheckPredicateMatcher 471 return cast<CheckPredicateMatcher>(M)->Pred == Pred;
|
H A D | DAGISelMatcherEmitter.cpp | 64 unsigned getNodePredicate(TreePredicateFn Pred) { argument 65 unsigned &Entry = NodePredicateMap[Pred.getOrigPatFragRecord()]; 67 NodePredicates.push_back(Pred); 252 StringRef Pred =cast<CheckPatternPredicateMatcher>(N)->getPredicate(); local 253 OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ','; 255 OS.PadToColumn(CommentIndent) << "// " << Pred; 260 TreePredicateFn Pred = cast<CheckPredicateMatcher>(N)->getPredicate(); local 261 OS << "OPC_CheckPredicate, " << getNodePredicate(Pred) << ','; 263 OS.PadToColumn(CommentIndent) << "// " << Pred.getFnName();
|
H A D | FastISelEmitter.cpp | 50 unsigned getIDFor(TreePredicateFn Pred) { argument 51 unsigned &Entry = ImmIDs[Pred.getOrigPatFragRecord()]; 53 PredsByName.push_back(Pred);
|
/external/llvm/bindings/ocaml/llvm/ |
H A D | llvm_ocaml.c | 788 CAMLprim LLVMValueRef llvm_const_icmp(value Pred, argument 791 return LLVMConstICmp(Int_val(Pred) + LLVMIntEQ, LHSConstant, RHSConstant); 795 CAMLprim LLVMValueRef llvm_const_fcmp(value Pred, argument 798 return LLVMConstFCmp(Int_val(Pred), LHSConstant, RHSConstant); 2030 CAMLprim LLVMValueRef llvm_build_icmp(value Pred, argument 2033 return LLVMBuildICmp(Builder_val(B), Int_val(Pred) + LLVMIntEQ, LHS, RHS, 2038 CAMLprim LLVMValueRef llvm_build_fcmp(value Pred, argument 2041 return LLVMBuildFCmp(Builder_val(B), Int_val(Pred), LHS, RHS,
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineTraceMetrics.h | 136 const MachineBasicBlock *Pred; member in struct:llvm::MachineTraceMetrics::TraceBlockInfo 157 Pred(nullptr), Succ(nullptr),
|
/external/llvm/include/llvm/IR/ |
H A D | PatternMatch.h | 666 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS) argument 667 : Predicate(Pred), L(LHS), R(RHS) {} 682 m_ICmp(ICmpInst::Predicate &Pred, const LHS &L, const RHS &R) { argument 684 ICmpInst, ICmpInst::Predicate>(Pred, L, R); 689 m_FCmp(FCmpInst::Predicate &Pred, const LHS &L, const RHS &R) { argument 691 FCmpInst, FCmpInst::Predicate>(Pred, L, R); 962 typename CmpInst_t::Predicate Pred = LHS == TrueVal ? 965 if (!Pred_t::match(Pred)) 974 static bool match(ICmpInst::Predicate Pred) { argument 975 return Pred 981 match(ICmpInst::Predicate Pred) argument 988 match(ICmpInst::Predicate Pred) argument 995 match(ICmpInst::Predicate Pred) argument 1002 match(FCmpInst::Predicate Pred) argument 1009 match(FCmpInst::Predicate Pred) argument 1016 match(FCmpInst::Predicate Pred) argument 1023 match(FCmpInst::Predicate Pred) argument [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 127 BlkT *Pred = Preds[p]; local 130 BBMap.FindAndConstruct(Pred); 137 ValT PredVal = AvailableVals->lookup(Pred); 138 BBInfo *PredInfo = new (Allocator) BBInfo(Pred, PredVal); 240 BBInfo *Pred = Info->Preds[p]; local 243 if (Pred->BlkNum == 0) { 244 Pred->AvailableVal = Traits::GetUndefVal(Pred->BB, Updater); 245 (*AvailableVals)[Pred->BB] = Pred 270 IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) argument 362 BlkT *Pred = PredInfo->BB; local [all...] |
/external/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfoImpl.cpp | 263 const BlockNode &Pred, 300 if (Resolved < Pred) { 301 if (!isLoopHeader(Pred)) { 311 // If "Pred" is a loop header, then this isn't really a backedge; rather, 261 addToDist(Distribution &Dist, const LoopData *OuterLoop, const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight) argument
|
H A D | DependenceAnalysis.cpp | 878 bool DependenceAnalysis::isKnownPredicate(ICmpInst::Predicate Pred, argument 881 if (Pred == CmpInst::ICMP_EQ || 882 Pred == CmpInst::ICMP_NE) { 897 if (SE->isKnownPredicate(Pred, X, Y)) 905 switch (Pred) {
|
H A D | InstructionSimplify.cpp | 78 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"? 79 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, argument 86 if (CPred == Pred && CLHS == LHS && CRHS == RHS) 88 return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS && 358 static Value *ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, argument 368 Pred = CmpInst::getSwappedPredicate(Pred); 378 Value *TCmp = SimplifyCmpInst(Pred, TV, RHS, Q, MaxRecurse); 386 if (!isSameCompare(Cond, Pred, TV, RHS)) 392 Value *FCmp = SimplifyCmpInst(Pred, F 483 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 1637 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1682 computePointerICmp(const DataLayout *DL, const TargetLibraryInfo *TLI, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1812 CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate; local 2622 CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate; local [all...] |
H A D | LazyValueInfo.cpp | 1069 /// Pred is a CmpInst predicate. 1071 LazyValueInfo::getPredicateOnEdge(unsigned Pred, Value *V, Constant *C, argument 1078 Res = ConstantFoldCompareInstOperands(Pred, Result.getConstant(), C, DL, 1090 if (Pred == ICmpInst::ICMP_EQ) { 1096 } else if (Pred == ICmpInst::ICMP_NE) { 1106 ICmpInst::makeConstantRange((ICmpInst::Predicate)Pred, CI->getValue()); 1117 if (Pred == ICmpInst::ICMP_EQ) { 1124 } else if (Pred == ICmpInst::ICMP_NE) {
|
H A D | MemoryDependenceAnalysis.cpp | 1124 BasicBlock *Pred = *PI; local 1125 PredList.push_back(std::make_pair(Pred, Pointer)); 1130 PredPointer.PHITranslateValue(BB, Pred, nullptr); 1140 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal)); 1170 BasicBlock *Pred = PredList[i].first; local 1193 isLoad, Pred, 1196 NonLocalDepResult Entry(Pred, MemDepResult::getUnknown(), PredPtrVal);
|
H A D | RegionInfo.cpp | 166 BasicBlock *Pred; local 171 Pred = *PI; 172 if (DT->getNode(Pred) && !contains(Pred)) { 176 enteringBlock = Pred; 185 BasicBlock *Pred; local 193 Pred = *PI; 194 if (contains(Pred)) { 198 exitingBlock = Pred;
|
H A D | ScalarEvolution.cpp | 1063 ICmpInst::Predicate *Pred, 1067 *Pred = ICmpInst::ICMP_SLT; 1072 *Pred = ICmpInst::ICMP_SGT; 1135 ICmpInst::Predicate Pred; local 1136 const SCEV *OverflowLimit = getOverflowLimitForStep(Step, &Pred, SE); 1139 SE->isLoopEntryGuardedByCond(L, Pred, PreStart, OverflowLimit)) { 1298 ICmpInst::Predicate Pred; local 1299 const SCEV *OverflowLimit = getOverflowLimitForStep(Step, &Pred, this); 1301 (isLoopBackedgeGuardedByCond(L, Pred, AR, OverflowLimit) || 1302 (isLoopEntryGuardedByCond(L, Pred, Star 1062 getOverflowLimitForStep(const SCEV *Step, ICmpInst::Predicate *Pred, ScalarEvolution *SE) argument [all...] |
H A D | ScalarEvolutionExpander.cpp | 1201 BasicBlock *Pred = *HPI; local 1204 if (!L->contains(Pred)) { 1205 PN->addIncoming(StartV, Pred); 1213 IVIncInsertPos : Pred->getTerminator(); 1222 PN->addIncoming(IncV, Pred);
|
/external/llvm/lib/CodeGen/ |
H A D | Analysis.cpp | 151 ISD::CondCode llvm::getFCmpCondCode(FCmpInst::Predicate Pred) { argument 152 switch (Pred) { 188 ISD::CondCode llvm::getICmpCondCode(ICmpInst::Predicate Pred) { argument 189 switch (Pred) {
|
H A D | BranchFolding.cpp | 1088 MachineBasicBlock *Pred = *(MBB->pred_end()-1); local 1089 Pred->ReplaceUsesOfBlockWith(MBB, FallThrough);
|
H A D | CodeGenPrepare.cpp | 386 BasicBlock *Pred = DestBBPN->getIncomingBlock(i); local 387 if (BBPreds.count(Pred)) { // Common predecessor? 390 const Value *V1 = PN->getIncomingValueForBlock(Pred); 396 V2 = V2PN->getIncomingValueForBlock(Pred);
|
H A D | IfConversion.cpp | 724 SmallVectorImpl<MachineOperand> &Pred, 732 if (BBI.Predicate.size() && !TII->SubsumesPredicate(Pred, BBI.Predicate)) 740 SmallVector<MachineOperand, 4> RevPred(Pred.begin(), Pred.end()); 723 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch) argument
|
H A D | LatencyPriorityQueue.cpp | 60 SUnit &Pred = *I->getSUnit(); local 61 if (!Pred.isScheduled) { 64 if (OnlyAvailablePred && OnlyAvailablePred != &Pred) 66 OnlyAvailablePred = &Pred;
|
H A D | LiveRangeCalc.cpp | 201 MachineBasicBlock *Pred = *PI; local 204 if (Seen.test(Pred->getNumber())) { 205 if (VNInfo *VNI = LiveOut[Pred].first) { 214 std::tie(Start, End) = Indexes->getMBBRange(Pred); 216 // First time we see Pred. Try to determine the live-out value, but set 217 // it as null if Pred is live-through with an unknown value. 219 setLiveOutValue(Pred, VNI); 227 // No, we need a live-in value for Pred as well 228 if (Pred != &KillMBB) 229 WorkList.push_back(Pred [all...] |
H A D | LiveVariables.cpp | 125 MachineBasicBlock *Pred = WorkList.back(); local 127 MarkVirtRegAliveInBlock(VRInfo, DefBlock, Pred, WorkList);
|