Home
last modified time | relevance | path

Searched refs:Formula (Results 1 – 25 of 29) sorted by relevance

12

/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DArena.cpp17 static std::pair<const Formula *, const Formula *>
18 canonicalFormulaPair(const Formula &LHS, const Formula &RHS) { in canonicalFormulaPair()
26 static const Formula &cached(llvm::DenseMap<Key, const Formula *> &Cache, Key K, in cached()
34 const Formula &Arena::makeAtomRef(Atom A) { in makeAtomRef()
36 return &Formula::create(Alloc, Formula::AtomRef, {}, in makeAtomRef()
41 const Formula &Arena::makeAnd(const Formula &LHS, const Formula &RHS) { in makeAnd()
45 if (LHS.kind() == Formula::Literal) in makeAnd()
47 if (RHS.kind() == Formula::Literal) in makeAnd()
50 return &Formula::create(Alloc, Formula::And, {&LHS, &RHS}); in makeAnd()
54 const Formula &Arena::makeOr(const Formula &LHS, const Formula &RHS) { in makeOr()
[all …]
H A DFormula.cpp19 const Formula &Formula::create(llvm::BumpPtrAllocator &Alloc, Kind K, in create()
20 ArrayRef<const Formula *> Operands, in create()
25 void *Mem = Alloc.Allocate(sizeof(Formula) + in create()
27 alignof(Formula)); in create()
28 Formula *Result = new (Mem) Formula(); in create()
34 llvm::copy(Operands, reinterpret_cast<const Formula **>(Result + 1)); in create()
38 static llvm::StringLiteral sigil(Formula::Kind K) { in sigil()
40 case Formula::AtomRef: in sigil()
41 case Formula::Literal: in sigil()
43 case Formula::Not: in sigil()
[all …]
H A DSimplifyConstraints.cpp17 static const Formula &
18 substitute(const Formula &F, in substitute()
19 const llvm::DenseMap<Atom, const Formula *> &Substitutions, in substitute()
22 case Formula::AtomRef: in substitute()
27 case Formula::Literal: in substitute()
29 case Formula::Not: in substitute()
31 case Formula::And: in substitute()
34 case Formula::Or: in substitute()
37 case Formula::Implies: in substitute()
41 case Formula::Equal: in substitute()
[all …]
H A DCNFFormula.cpp36 explicit CNFFormulaBuilder(CNFFormula &CNF) : Formula(CNF) {} in CNFFormulaBuilder()
71 Formula.addClause(Simplified); in addClause()
83 Formula.addClause(Simplified); in addClause()
88 bool isKnownContradictory() { return Formula.knownContradictory(); } in isKnownContradictory()
91 CNFFormula &Formula; member
115 CNFFormula buildCNF(const llvm::ArrayRef<const Formula *> &Formulas, in buildCNF()
124 llvm::DenseMap<const Formula *, Variable> FormulaToVar; in buildCNF()
128 std::queue<const Formula *> UnprocessedFormulas; in buildCNF()
129 for (const Formula *F : Formulas) in buildCNF()
133 const Formula *F = UnprocessedFormulas.front(); in buildCNF()
[all …]
H A DDataflowAnalysisContext.cpp134 void DataflowAnalysisContext::addInvariant(const Formula &Constraint) { in addInvariant()
142 Atom Token, const Formula &Constraint) { in addFlowConditionConstraint()
171 llvm::SetVector<const Formula *> Constraints) { in querySolver()
176 const Formula &F) { in flowConditionImplies()
185 llvm::SetVector<const Formula *> Constraints; in flowConditionImplies()
193 const Formula &F) { in flowConditionAllows()
197 llvm::SetVector<const Formula *> Constraints; in flowConditionAllows()
204 bool DataflowAnalysisContext::equivalentFormulas(const Formula &Val1, in equivalentFormulas()
205 const Formula &Val2) { in equivalentFormulas()
206 llvm::SetVector<const Formula *> Constraints; in equivalentFormulas()
[all …]
H A DWatchedLiteralsSolver.cpp107 const llvm::ArrayRef<const Formula *> &Vals) in WatchedLiteralsSolverImpl()
409 WatchedLiteralsSolver::solve(llvm::ArrayRef<const Formula *> Vals) { in solve()
H A DDataflowEnvironment.cpp1135 void Environment::assume(const Formula &F) { in assume()
1139 bool Environment::proves(const Formula &F) const { in proves()
1143 bool Environment::allows(const Formula &F) const { in allows()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/
H A DDataflowAnalysisContext.h138 void addInvariant(const Formula &Constraint);
141 void addFlowConditionConstraint(Atom Token, const Formula &Constraint);
156 bool flowConditionImplies(Atom Token, const Formula &F);
162 bool flowConditionAllows(Atom Token, const Formula &F);
167 bool equivalentFormulas(const Formula &Val1, const Formula &Val2);
186 Solver::Result querySolver(llvm::SetVector<const Formula *> Constraints);
238 llvm::SetVector<const Formula *> &Out);
242 bool isSatisfiable(llvm::SetVector<const Formula *> Constraints) { in isSatisfiable()
249 bool isUnsatisfiable(llvm::SetVector<const Formula *> Constraints) { in isUnsatisfiable()
290 llvm::DenseMap<Atom, const Formula *> FlowConditionConstraints;
[all …]
H A DValue.h95 const Formula *F;
98 explicit BoolValue(Kind ValueKind, const Formula &F) in BoolValue()
107 const Formula &formula() const { return *F; } in formula()
118 TopBoolValue(const Formula &F) : BoolValue(Kind::TopBool, F) { in TopBoolValue()
119 assert(F.kind() == Formula::AtomRef); in TopBoolValue()
135 explicit AtomicBoolValue(const Formula &F) : BoolValue(Kind::AtomicBool, F) { in AtomicBoolValue()
136 assert(F.kind() == Formula::AtomRef); in AtomicBoolValue()
149 explicit FormulaBoolValue(const Formula &F) in FormulaBoolValue()
151 assert(F.kind() != Formula::AtomRef && "For now, use AtomicBoolValue"); in FormulaBoolValue()
H A DWatchedLiteralsSolver.h50 Result solve(llvm::ArrayRef<const Formula *> Vals) override;
H A DDataflowEnvironment.h642 void assume(const Formula &);
653 bool proves(const Formula &) const;
658 bool allows(const Formula &) const;
H A DSolver.h89 virtual Result solve(llvm::ArrayRef<const Formula *> Vals) = 0;
H A DCNFFormula.h173 CNFFormula buildCNF(const llvm::ArrayRef<const Formula *> &Formulas,
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DSemaConcept.h180 using Formula = llvm::SmallVector<Clause, 5>; variable
182 struct CNFFormula : Formula {
184 using Formula::Formula;
186 struct DNFFormula : Formula {
188 using Formula::Formula;
235 void AddUniqueClauseToFormula(Formula &F, Clause C);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp474 struct Formula { struct
512 Formula() = default;
598 void Formula::initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) { in initialMatch()
626 bool Formula::isCanonical(const Loop &L) const { in isCanonical()
656 void Formula::canonicalize(const Loop &L) { in canonicalize()
693 bool Formula::unscale() { in unscale()
702 bool Formula::hasZeroEnd() const { in hasZeroEnd()
710 bool Formula::countsDownToZero() const { in countsDownToZero()
722 size_t Formula::getNumRegs() const { in getNumRegs()
728 Type *Formula::getType() const { in getType()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/Models/
H A DUncheckedOptionalAccessModel.cpp368 const Formula &forceBoolValue(Environment &Env, const Expr &Expr) { in forceBoolValue()
483 const Formula &(*ModelPred)(Environment &Env, const Formula &ExprVal, in transferValueOrImpl()
484 const Formula &HasValueVal)) { in transferValueOrImpl()
503 [](Environment &Env, const Formula &ExprVal, in transferValueOrStringEmptyCall()
504 const Formula &HasValueVal) -> const Formula & { in transferValueOrStringEmptyCall()
521 [](Environment &Env, const Formula &ExprVal, in transferValueOrNotEqX()
522 const Formula &HasValueVal) -> const Formula & { in transferValueOrNotEqX()
817 const Formula &evaluateEquality(Arena &A, const Formula &EqVal, in evaluateEquality()
818 const Formula &LHS, const Formula &RHS) { in evaluateEquality()
/freebsd/contrib/libxo/packaging/
H A Dlibxo.rb.base.in8 class Libxo < Formula
/freebsd/sys/contrib/device-tree/Bindings/leds/
H A Dleds-ktd2692.txt30 Formula : I(mA) = 15000 / Rset.
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DTargetInstrInfo.h96 enum class Formula { enum
106 Formula Form = Formula::Basic;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DImplicitNullChecks.cpp374 if (!AM || AM->Form != ExtAddrMode::Formula::Basic) in isSuitableMemoryOp()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.cpp3164 AM.Form = ExtAddrMode::Formula::SExtScaledReg; in canFoldIntoAddrMode()
3195 AM.Form = ExtAddrMode::Formula::ZExtScaledReg; in canFoldIntoAddrMode()
3239 AM.Form = ExtAddrMode::Formula::Basic; in canFoldIntoAddrMode()
3245 ExtAddrMode::Formula Form = ExtAddrMode::Formula::Basic) -> bool { in canFoldIntoAddrMode()
3340 (Extend == AArch64_AM::SXTW) ? ExtAddrMode::Formula::SExtScaledReg in canFoldIntoAddrMode()
3341 : ExtAddrMode::Formula::ZExtScaledReg); in canFoldIntoAddrMode()
3702 if (AM.Form == ExtAddrMode::Formula::Basic) { in emitLdStWithAddr()
3740 if (AM.Form == ExtAddrMode::Formula::SExtScaledReg || in emitLdStWithAddr()
3741 AM.Form == ExtAddrMode::Formula::ZExtScaledReg) { in emitLdStWithAddr()
3760 .addImm(AM.Form == ExtAddrMode::Formula::SExtScaledReg) in emitLdStWithAddr()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaConcept.cpp2013 void SubsumptionChecker::AddUniqueClauseToFormula(Formula &F, Clause C) { in AddUniqueClauseToFormula()
/freebsd/contrib/file/magic/Magdir/
H A Darchive2009 >>>>80 byte !0x2d Formula
2012 >>>>80 string -template Formula Template
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVInstrInfo.cpp3097 AM.Form = ExtAddrMode::Formula::Basic; in canFoldIntoAddrMode()
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.ok935 Richard Harter The Optimality of Winograd's Formula . . 352--352

12