/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
H A D | CNFFormula.cpp | 9 // A representation of a boolean formula in 3-CNF. 25 /// true/false in any model that satisfies the overall formula. 35 // Formula should outlive CNFFormulaBuilder. 36 explicit CNFFormulaBuilder(CNFFormula &CNF) : Formula(CNF) {} in CNFFormulaBuilder() 38 /// Adds the `L1 v ... v Ln` clause to the formula. Applies 71 // We already know that this formula is unsatisfiable. in addClause() 72 Formula.addClause(Simplified); in addClause() 84 Formula.addClause(Simplified); in addClause() 88 /// In this case then the formula is already known to be unsatisfiable. 89 bool isKnownContradictory() { return Formula.knownContradictory(); } in isKnownContradictory() [all …]
|
H A D | WatchedLiteralsSolver.cpp | 18 #include "clang/Analysis/FlowSensitive/Formula.h" 34 /// formula. 37 /// A boolean formula in conjunctive normal form that the solver will attempt 38 /// to prove satisfiable. The formula will be modified in the process. 53 /// clauses in the formula start from the element at index 1. 56 /// The search for a satisfying assignment of the variables in `Formula` will 57 /// proceed in levels, starting from 1 and going up to `Formula.LargestVar` 102 /// `Formula`. The vector is guaranteed to contain unique elements. 107 const llvm::ArrayRef<const Formula *> &Vals) in WatchedLiteralsSolverImpl() 114 // Skip initialization if the formula is known to be contradictory. in WatchedLiteralsSolverImpl() [all …]
|
H A D | DataflowAnalysisContext.cpp | 19 #include "clang/Analysis/FlowSensitive/Formula.h" 136 void DataflowAnalysisContext::addInvariant(const Formula &Constraint) { in addInvariant() 144 Atom Token, const Formula &Constraint) { in addFlowConditionConstraint() 172 llvm::SetVector<const Formula *> Constraints) { in querySolver() 177 const Formula &F) { in flowConditionImplies() 186 llvm::SetVector<const Formula *> Constraints; in flowConditionImplies() 194 const Formula &F) { in flowConditionAllows() 198 llvm::SetVector<const Formula *> Constraints; in flowConditionAllows() 205 bool DataflowAnalysisContext::equivalentFormulas(const Formula &Val1, in equivalentFormulas() 206 const Formula &Val2) { in equivalentFormulas() [all …]
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/ |
H A D | CNFFormula.h | 9 // A representation of a boolean formula in 3-CNF. 19 #include "clang/Analysis/FlowSensitive/Formula.h" 66 /// A boolean formula in 3-CNF (conjunctive normal form with at most 3 literals 70 /// variable in the formula. 73 /// Literals of all clauses in the formula. 76 /// set to 0 and isn't used. Literals of clauses in the formula start from the 79 /// For example, for the formula `(L1 v L2) ^ (L2 v L3 v L4)` the elements of 83 /// Start indices of clauses of the formula in `Clauses`. 86 /// is set to 0 and isn't used. Start indices of clauses in the formula start 89 /// For example, for the formula `(L1 v L2) ^ (L2 v L3 v L4)` the elements of [all …]
|
H A D | Value.h | 18 #include "clang/Analysis/FlowSensitive/Formula.h" 95 const Formula *F; 98 explicit BoolValue(Kind ValueKind, const Formula &F) in BoolValue() 107 const Formula &formula() const { return *F; } in formula() function 113 /// else in a system of formula. 118 TopBoolValue(const Formula &F) : BoolValue(Kind::TopBool, F) { in TopBoolValue() 119 assert(F.kind() == Formula::AtomRef); in TopBoolValue() 126 Atom getAtom() const { return formula().getAtom(); } in getAtom() 135 explicit AtomicBoolValue(const Formula &F) : BoolValue(Kind::AtomicBool, F) { in AtomicBoolValue() 136 assert(F.kind() == Formula::AtomRef); in AtomicBoolValue() [all …]
|
H A D | Solver.h | 17 #include "clang/Analysis/FlowSensitive/Formula.h" 33 /// formula. 37 /// formula. 41 /// assignment for a boolean formula. 48 /// Constructs a result indicating that the queried boolean formula is 54 /// Constructs a result indicating that the queried boolean formula is 59 /// queried boolean formula was not completed. 63 /// formula. 67 /// boolean formula if available. Otherwise, an empty optional is returned. 89 virtual Result solve(llvm::ArrayRef<const Formula *> Vals) = 0;
|
H A D | DataflowAnalysisContext.h | 138 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 D | DataflowEnvironment.h | 25 #include "clang/Analysis/FlowSensitive/Formula.h" 589 arena().makeAnd(LHS.formula(), RHS.formula())); in makeAnd() 598 arena().makeOr(LHS.formula(), RHS.formula())); in makeOr() 604 return arena().makeBoolValue(arena().makeNot(Val.formula())); in makeNot() 613 arena().makeImplies(LHS.formula(), RHS.formula())); in makeImplication() 622 arena().makeEquals(LHS.formula(), RHS.formula())); in makeIff() 642 void assume(const Formula &); 644 /// Returns true if the formula is always true when this point is reached. 645 /// Returns false if the formula may be false (or the flow condition isn't 653 bool proves(const Formula &) const; [all …]
|
H A D | WatchedLiteralsSolver.h | 17 #include "clang/Analysis/FlowSensitive/Formula.h" 50 Result solve(llvm::ArrayRef<const Formula *> Vals) override;
|
/freebsd/sys/dev/videomode/ |
H A D | vesagtf.h | 38 * Use VESA GTF formula to generate a monitor mode, given resolution and 49 unsigned M; /* blanking formula gradient */ 50 unsigned C; /* blanking formula offset */ 51 unsigned K; /* blanking formula scaling factor */ 52 unsigned J; /* blanking formula scaling factor */ 63 #define VESAGTF_M 600 /* blanking formula gradient */ 64 #define VESAGTF_C 40 /* blanking formula offset */ 65 #define VESAGTF_K 128 /* blanking formula scaling factor */ 66 #define VESAGTF_J 20 /* blanking formula scaling factor */ 69 * Use VESA GTF formula to generate monitor timings. Assumes default
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 481 /// This class holds information that describes a formula for computing 483 struct Formula { struct 497 /// canonical representation of a formula is 501 /// formula should be put in the ScaledReg. 503 /// registers are needed by the formula: e.g., reg1 + reg2 is reg1 + 1 * reg2. 507 /// This invariant can be temporarily broken while building a formula. 508 /// However, every formula inserted into the LSRInstance must be in canonical 521 Formula() = default; 601 /// Incorporate loop-variant parts of S into this Formula, attempting to keep 603 void Formula::initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) { in initialMatch() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/Models/ |
H A D | UncheckedOptionalAccessModel.cpp | 25 #include "clang/Analysis/FlowSensitive/Formula.h" 316 /// Ensures that `Expr` is mapped to a `BoolValue` and returns its formula. 317 const Formula &forceBoolValue(Environment &Env, const Expr &Expr) { in forceBoolValue() 320 return Value->formula(); in forceBoolValue() 324 return Value->formula(); in forceBoolValue() 418 /// `ModelPred` builds a logical formula relating the predicate in 423 const Formula &(*ModelPred)(Environment &Env, const Formula &ExprVal, in transferValueOrImpl() 424 const Formula &HasValueVal)) { in transferValueOrImpl() 436 HasValueVal->formula())); in transferValueOrImpl() 443 [](Environment &Env, const Formula &ExprVal, in transferValueOrStringEmptyCall() [all …]
|
/freebsd/contrib/libxo/packaging/ |
H A D | libxo.rb.base.in | 2 # Homebrew formula file for libxo 6 require 'formula' 8 class Libxo < Formula
|
/freebsd/contrib/arm-optimized-routines/math/ |
H A D | tgamma128.c | 45 * Compute sin(pi*x) / pi, for use in the reflection formula that 103 * Apply the reflection formula as commented below, but in tgamma_large() 215 * Euler's reflection formula is in tgamma128() 249 * in this formula by _avoiding_ an inversion that the in tgamma128() 256 * reflection formula would cause division by zero, but in tgamma128() 300 * [1,2), using the inverse of the normal recurrence formula: in tgamma128() 307 * [1,2) by repeated application of the recurrence formula. in tgamma128() 351 /* Negative domain: apply the reflection formula as commented above */ in tgamma128()
|
/freebsd/contrib/bc/manuals/ |
H A D | algorithms.md | 192 The algorithm used is to use the formula `e(y*l(x))`. 230 If at this point, the exponent is negative, we need to use the original formula 251 using the original formula, but we instead of calculating `e(y * l(x))`, we 294 The algorithm is to use the formula `n!/(n-k)!`. 302 The algorithm is to use the formula `n!/r!*(n-r)!`. 310 The algorithm is to use the formula `l(x)/l(b)` with double the `scale` because 359 The algorithm uses the formula `a*b/gcd(a,b)`. 367 The algorithm uses the formula `4*a(1)`. 375 The algorithm uses the formula `s(x)/c(x)`.
|
/freebsd/contrib/tcpdump/cmake/Modules/ |
H A D | FindCRYPTO.cmake | 120 # $BREW --prefix --installed <formula> 123 # the formula is installed or not, so we 127 # libcrypto isn't a formula, openssl is a formula.
|
/freebsd/contrib/libcbor/ |
H A D | release.sh | 79 echo "Update the Hombrew formula (https://github.com/Homebrew/homebrew-core/blob/master/Formula/lib… 81 prompt "Have you updated the formula?"
|
/freebsd/usr.sbin/pmcstudy/ |
H A D | pmcstudy.8 | 104 option is a "formula". 105 The formula can declare directly the PMCs by name 111 An example of a formula of your own might be
|
/freebsd/sys/dev/qat/qat_api/common/compression/ |
H A D | dc_buffers.c | 82 /* Formula for GEN2 deflate: in dcDeflateBoundGen2() 110 /* Formula for GEN4 static deflate: in dcDeflateBoundGen4() 116 /* Formula for GEN4 dynamic deflate: in dcDeflateBoundGen4()
|
/freebsd/sys/contrib/device-tree/Bindings/leds/ |
H A D | skyworks,aat1290.yaml | 42 formula:: I = 1A * 162 kOhm / Rset. 46 Maximum flash timeout can be calculated using following formula::
|
H A D | leds-aat1290.txt | 29 following formula: I = 1A * 162kohm / Rset. 32 formula: T = 8.82 * 10^9 * Ct.
|
H A D | richtek,rt8515.yaml | 61 according to the formula Imax = 5500 / RFS. The lowest 73 according to the formula Imax = 5500 / RTS. The lowest
|
H A D | awinic,aw200xx.yaml | 65 following formula: 67 And the minimum output current formula:
|
/freebsd/contrib/arm-optimized-routines/pl/math/ |
H A D | sv_tan_3u5.c | 60 formula. */ in SV_NAME_D1() 77 /* Recombination uses double-angle formula: in SV_NAME_D1()
|
H A D | v_tan_3u5.c | 77 formula. */ in V_NAME_D1() 93 /* Recombination uses double-angle formula: in V_NAME_D1()
|