Searched refs:Predicates (Results 1 - 14 of 14) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DInstrDocsEmitter.cpp17 // * Predicates
218 // Predicates.
219 std::vector<Record *> Predicates = local
220 II->TheDef->getValueAsListOfDefs("Predicates");
221 if (!Predicates.empty()) {
222 OS << "Predicates: ";
224 for (Record *P : Predicates) {
H A DRISCVCompressInstEmitter.cpp27 // list<Predicate> Predicates = [];
30 // let Predicates = [HasStdExtC] in {
468 std::vector<Record *> RF = Rec->getValueAsListOfDefs("Predicates");
515 std::vector<const Record *> &Predicates,
522 Predicates.push_back(Rec);
523 Entry = Predicates.size();
533 static void printPredicates(std::vector<const Record *> &Predicates, argument
535 for (unsigned i = 0; i < Predicates.size(); ++i) {
536 Init *Pred = Predicates[i]->getValueInit(Name);
539 << " // " << Predicates[
514 getPredicates(DenseMap<const Record *, unsigned> &PredicateMap, std::vector<const Record *> &Predicates, Record *Rec, StringRef Name) argument
[all...]
H A DFixedLenDecoderEmitter.cpp94 PredicateSet Predicates; member in struct:__anon4931::DecoderTableInfo
147 PredicateSet &Predicates,
483 // Emits code to check the Predicates member of an instruction are true.
939 emitPredicateFunction(formatted_raw_ostream &OS, PredicateSet &Predicates,
946 if (!Predicates.empty()) {
950 for (const auto &Predicate : Predicates) {
1187 ListInit *Predicates =
1188 AllInstructions[Opc].EncodingDef->getValueAsListInit("Predicates");
1190 for (unsigned i = 0; i < Predicates->size(); ++i) {
1191 Record *Pred = Predicates
[all...]
H A DGlobalISelEmitter.cpp988 PredicatesTy Predicates;
1000 return Predicates.begin();
1003 return Predicates.end();
1009 return Predicates.size();
1011 bool predicates_empty() const { return Predicates.empty(); }
1014 std::unique_ptr<PredicateTy> Front = std::move(Predicates.front());
1015 Predicates.pop_front();
1021 Predicates.push_front(std::move(Predicate));
1026 std::stable_partition(Predicates.begin(), Predicates
[all...]
H A DX86RecognizableInstr.cpp110 std::vector<Record*> Predicates = Rec->getValueAsListOfDefs("Predicates"); local
111 for (unsigned i = 0, e = Predicates.size(); i != e; ++i) {
112 if (Predicates[i]->getName().find("Not64Bit") != Name.npos ||
113 Predicates[i]->getName().find("In32Bit") != Name.npos) {
117 if (Predicates[i]->getName().find("In64Bit") != Name.npos) {
H A DCodeGenSchedule.h330 std::vector<PredicateInfo> Predicates; member in class:llvm::OpcodeInfo
340 ArrayRef<PredicateInfo> getPredicates() const { return Predicates; }
H A DCodeGenDAGPatterns.h1116 Predicates(std::move(preds)), Dstregs(std::move(dstregs)),
1122 std::vector<Predicate> Predicates; // Top level predicate conditions
1136 const std::vector<Predicate> &getPredicates() const { return Predicates; }
H A DCodeGenSchedule.cpp430 Predicates, [&OperandMask, &Predicate](const PredicateInfo &P) {
433 if (It == Predicates.end()) {
434 Predicates.emplace_back(CpuMask, OperandMask, Predicate);
2152 for (const Record *PredDef : Inst.TheDef->getValueAsListOfDefs("Predicates")) {
H A DCodeGenDAGPatterns.cpp1429 for (const Predicate &P : Predicates) {
4209 ListInit *Preds = TheDef->getValueAsListInit("Predicates");
4289 std::vector<Predicate> Preds = P.Predicates;
4665 const std::vector<Predicate> &Predicates = local
4675 Matches[p] = (Predicates == PatternsToMatch[p].getPredicates());
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp579 SetVector<Instruction*> Predicates; local
586 if (!Predicate || Predicates.count(Predicate))
594 Predicates.insert(Predicate);
607 Cleanup(Predicates, L);
H A DARMLowOverheadLoops.cpp137 SetVector<MachineInstr*> Predicates; member in struct:__anon4030::PredicatedMI
142 Predicates.insert(Preds.begin(), Preds.end());
164 if (!Divergent && !set_difference(Preds, PredicateThen->Predicates).empty()) {
181 return PredicateThen->Predicates.count(MI);
195 return IsPredicatedOn(MI) && PredicateThen->Predicates.size() == 1;
438 if (PredMI.Predicates.count(VCTP) || isVCTP(PredMI.MI) ||
443 for (auto *MI : PredMI.Predicates)
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp257 PredMap Predicates; member in class:__anon4717::StructurizeCFG
456 BBPredicates &Pred = Predicates[BB];
513 Predicates.clear();
555 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue];
781 BBPredicates &Preds = Predicates[Node->getEntry()];
789 BBPredicates &Preds = Predicates[Node->getEntry()];
1062 Predicates.clear();
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DScalarEvolution.h562 /// Predicates. If successful return these <AddRecExpr, Predicates>;
757 /// SCEV predicates to Predicates that are required to be true in order for
758 /// the answer to be correct. Predicates can be checked with run-time
761 SCEVUnionPredicate &Predicates);
1095 /// Re-writes the SCEV according to the Predicates in \p A.
1221 /// if all of the predicates in \c Predicates evaluate to 'true' at
1223 SmallPtrSet<const SCEVPredicate *, 4> Predicates; member in struct:llvm::ScalarEvolution::ExitLimit
1227 Predicates.insert(P);
1333 /// from AlwaysTrue, we must add a (non null) Predicates argumen
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp4436 // Predicates. If successful, return them as a pair. Also cache the results
4486 SmallVector<const SCEVPredicate *, 3> Predicates;
4622 Predicates.push_back(AddRecPred);
4625 // Create the Equal Predicates P2,P3:
4675 Predicates.push_back(Pred);
4682 // *** Part3: Predicates are ready. Now go ahead and create the new addrec in
4685 // Predicates.
4689 std::make_pair(NewAR, Predicates);
4713 assert(!(Rewrite.second).empty() && "Expected to find Predicates");
4722 SmallVector<const SCEVPredicate *, 3> Predicates;
[all...]

Completed in 209 milliseconds