| /src/external/gpl3/gcc/dist/gcc/ |
| loop-iv.cc | 2298 rtx assumption, may_not_xform; local
2444 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2446 if (assumption == const_true_rtx)
2454 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2456 if (assumption == const_true_rtx)
2462 if (assumption != const0_rtx)
2464 alloc_EXPR_LIST (0, assumption, desc->noloop_assumptions);
2564 completely senseless. This is OK, as we would need this assumption
2608 assumption = simplify_gen_relational (reverse_condition (cond),
2610 if (assumption == const_true_rtx
[all...] |
| tree-ssa-loop-niter.cc | 977 tree s, c, d, bits, assumption, tmp, bound; local
1116 assumption = fold_build2 (FLOOR_MOD_EXPR, niter_type, c, d);
1117 assumption = fold_build2 (EQ_EXPR, boolean_type_node,
1118 assumption, build_int_cst (niter_type, 0));
1119 if (!integer_nonzerop (assumption))
1121 niter->assumptions, assumption);
1156 tree assumption = boolean_true_node, bound, noloop; local
1197 assumption = fold_build2 (LE_EXPR, boolean_type_node,
1199 if (integer_zerop (assumption))
1212 assumption = fold_build2 (GE_EXPR, boolean_type_node
1249 tree bound, d, assumption, diff; local
1318 tree assumption = boolean_true_node, bound, diff; local
1696 tree assumption; local
3188 tree assumption = fold_build2 (LE_EXPR, boolean_type_node, niter->niter, local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| loop-iv.cc | 2314 rtx assumption, may_not_xform; local
2460 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2462 if (assumption == const_true_rtx)
2470 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2472 if (assumption == const_true_rtx)
2478 if (assumption != const0_rtx)
2480 alloc_EXPR_LIST (0, assumption, desc->noloop_assumptions);
2580 completely senseless. This is OK, as we would need this assumption
2624 assumption = simplify_gen_relational (reverse_condition (cond),
2626 if (assumption == const_true_rtx
[all...] |
| tree-ssa-loop-niter.cc | 989 tree s, c, d, bits, assumption, tmp, bound; local
1130 assumption = fold_build2 (FLOOR_MOD_EXPR, niter_type, c, d);
1131 assumption = fold_build2 (EQ_EXPR, boolean_type_node,
1132 assumption, build_int_cst (niter_type, 0));
1133 if (!integer_nonzerop (assumption))
1135 niter->assumptions, assumption);
1171 tree assumption = boolean_true_node, bound, noloop; local
1212 assumption = fold_build2 (LE_EXPR, boolean_type_node,
1214 if (integer_zerop (assumption))
1227 assumption = fold_build2 (GE_EXPR, boolean_type_node
1267 tree bound, d, assumption, diff; local
1336 tree assumption = boolean_true_node, bound, diff; local
1714 tree assumption; local
2587 tree assumption = fold_build2 (LE_EXPR, boolean_type_node, niter->niter, local
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/asn1/ |
| README.template | 12 - assumption: code is large, tables smaller
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitors.h | 166 bool Assumption;
175 TrackConstraintBRVisitor(DefinedSVal constraint, bool assumption)
176 : Constraint(constraint), Assumption(assumption),
177 IsZeroCheck(!Assumption && Constraint.getAs<Loc>()) {}
|
| /src/usr.bin/make/unit-tests/ |
| var-scope-cmdline.mk | 52 # Another bug was the wrong assumption that "deleting a cmdline variable is
|
| varmod-ifelse.mk | 222 # wrong assumption.
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/ |
| Checker.h | 463 bool assumption) {
464 return ((const CHECKER *)checker)->evalAssume(state, cond, assumption);
|
| CheckerManager.h | 435 SVal Cond, bool Assumption);
535 bool assumption)>;
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ProgramState.h | 163 // symbolic values. A call to 'assume' indicates an assumption being placed
170 // (3) A binary value "Assumption" that indicates whether the constraint is
177 /// Assumes that the value of \p cond is zero (if \p assumption is "false")
178 /// or non-zero (if \p assumption is "true").
183 bool assumption) const;
195 bool assumption, QualType IndexType = QualType()) const;
198 /// (if \p assumption is "true") or it is fully out of this range
199 /// (if \p assumption is "false").
206 bool assumption) const;
667 bool Assumption) const
[all...] |
| ExprEngine.h | 391 bool assumption);
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/ |
| hash.d | 79 assumption is yet to be verified.
|
| /src/external/lgpl3/gmp/dist/mpn/x86/atom/sse2/ |
| sqr_basecase.asm | 560 xor n, n C make n zeroness assumption below true
|
| /src/external/gpl3/binutils/dist/zlib/contrib/masmx64/ |
| gvmat64.asm | 127 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/binutils/dist/zlib/contrib/masmx86/ |
| match686.asm | 142 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/binutils.old/dist/zlib/contrib/masmx64/ |
| gvmat64.asm | 127 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/binutils.old/dist/zlib/contrib/masmx86/ |
| match686.asm | 142 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/gdb/dist/zlib/contrib/masmx64/ |
| gvmat64.asm | 127 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/gdb/dist/zlib/contrib/masmx86/ |
| match686.asm | 142 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/gdb.old/dist/zlib/contrib/masmx64/ |
| gvmat64.asm | 127 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/gpl3/gdb.old/dist/zlib/contrib/masmx86/ |
| match686.asm | 142 ;;; assumption that the compiler will dword-align the fields. (Thus,
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| ExprEngine.cpp | 292 // top-level function. This is our starting assumption for
538 SVal cond, bool assumption) {
539 return getCheckerManager().runCheckersForEvalAssume(state, cond, assumption);
|
| /src/external/mit/isl/dist/doc/ |
| implementation.tex | 361 {\tt isl} makes the same divisibility assumption on the big parameter
1651 This is a reasonable assumption if $R$ maps elements of a given
1654 domains, then this assumption no longer holds.
|
| /src/sys/arch/sparc/sparc/ |
| locore.s | 5986 ! if so, just take the lock and return on the assumption that
|
