Home
last modified time | relevance | path

Searched refs:iff (Results 1 – 25 of 77) sorted by relevance

1234

/llvm-project-15.0.7/clang/unittests/Analysis/FlowSensitive/
H A DSolverTest.cpp215 auto XIffY = Ctx.iff(X, Y); in TEST()
217 auto NotEquivalent = Ctx.neg(Ctx.iff(XIffY, XIffYDNF)); in TEST()
226 auto XEqX = Ctx.iff(X, X); in TEST()
236 auto XEqY = Ctx.iff(X, Y); in TEST()
253 auto XEqY = Ctx.iff(X, Y); in TEST()
266 auto XEqY = Ctx.iff(X, Y); in TEST()
278 auto XEqY = Ctx.iff(X, Y); in TEST()
279 auto YEqZ = Ctx.iff(Y, Z); in TEST()
294 auto A = Ctx.iff(Ctx.neg(Ctx.disj(X, Y)), Ctx.conj(Ctx.neg(X), Ctx.neg(Y))); in TEST()
307 auto XEqY = Ctx.iff(X, Y); in TEST()
[all …]
H A DTestingSupport.h260 BoolValue *iff(BoolValue *LeftSubVal, BoolValue *RightSubVal) { in iff() function
H A DDebugSupportTest.cpp80 auto B = Ctx.iff(Ctx.atom(), Ctx.atom()); in TEST()
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dapint-xor1.ll8 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
46 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2
H A Dapint-xor2.ll9 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
47 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2
H A Dgep-can-replace-gep-idx-with-zero-typesize.ll4 ; canReplaceGEPIdxWithZero, which replaces a GEP index with zero iff we can show
H A Dsdiv-of-non-negative-by-negative-power-of-two.ll8 ; iff x is known non-negative.
H A Dsdiv-exact-by-power-of-two.ll8 ; iff 1<<y is non-negative
H A Dadd-mask.ll5 ; (A & 2^C1) + A => A & (2^C1 - 1) iff bit C1 in A is a sign bit
H A Dsink-not-into-another-hand-of-and.ll8 ; iff y is free to invert and all uses of z can be freely updated.
H A Dsink-not-into-another-hand-of-or.ll8 ; iff y is free to invert and all uses of z can be freely updated.
/llvm-project-15.0.7/lld/test/ELF/
H A Dppc64-undefined-weak.s15 ## Branches to an undefined weak symbol need a thunk iff a dynamic relocation is
17 ## suppress the thunk. undefweak1 needs a thunk iff -pie or -shared.
/llvm-project-15.0.7/lld/test/COFF/Inputs/
H A Dassociative-comdat-2.s2 # associative with it. foo_assoc should be discarded iff foo is discarded,
/llvm-project-15.0.7/llvm/test/CodeGen/MSP430/
H A Dshift-amount-threshold.ll113 ; select_cc setlt X, 0, A, 0 -> "and (srl X, C2), A" iff A is a single-bit
182 ; select_cc setlt X, 0, A, 0 -> "and (srl X, C2), A" iff A is a single-bit
196 ; select_cc setlt X, 0, A, 0 -> "and (srl X, C2), A" iff A is a single-bit
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dsubtract_from_imm.ll4 ; Make sure that the subfic is generated iff possible
/llvm-project-15.0.7/llvm/test/FileCheck/
H A Dvar-scope.txt2 ; CHECK-LABEL directive iff --enable-var-scope is used.
/llvm-project-15.0.7/lld/test/COFF/
H A Dassociative-comdat.s37 # associative with it. foo_assoc should be discarded iff foo is discarded,
/llvm-project-15.0.7/llvm/test/Instrumentation/AddressSanitizer/
H A Dasan-vs-gvn.ll2 ; ASAN conflicts with load widening iff the widened load accesses data out of bounds
/llvm-project-15.0.7/compiler-rt/test/
H A Dlit.common.configured.in51 # True iff the test suite supports ignoring the test compiler's runtime library path
/llvm-project-15.0.7/llvm/docs/GlobalISel/
H A DLegalizer.rst47 it's impossible to say that G_FOO is legal iff %1 is a ``G_CONSTANT`` with
52 can say that it's legal iff operand 2 is an immediate with value ``1`` because
236 * ``widenScalarToNextPow2()`` is like ``widenScalarIf()`` but is satisfied iff the type
242 * ``minScalar()`` is like ``widenScalarIf()`` but is satisfied iff the type
/llvm-project-15.0.7/lld/test/MachO/
H A Dtreat-undef-sym.s34 ## Undefined symbols in dead code should not raise an error iff
/llvm-project-15.0.7/libcxx/include/
H A Dtuple39 constexpr explicit(see-below) tuple(pair<U1, U2>&); // iff sizeof...(Types) == 2 // C++23
41 … explicit(see-below) tuple(const pair<U1, U2>&); // iff sizeof...(T) == 2 // constexpr in C++14
43 explicit(see-below) tuple(pair<U1, U2>&&); // iff sizeof...(T) == 2 // constexpr in C++14
45 … constexpr explicit(see-below) tuple(const pair<U1, U2>&&); // iff sizeof...(Types) == 2 // C++23
92 …tuple& operator=(const pair<U1, U2>&); // iff sizeof...(T) == 2 // constexpr in …
94 …constexpr const tuple& operator=(const pair<U1, U2>&) const; // iff sizeof...(Types) == 2 // C++…
96 …tuple& operator=(pair<U1, U2>&&); // iff sizeof...(T) == 2 // constexpr in …
98 … constexpr const tuple& operator=(pair<U1, U2>&&) const; // iff sizeof...(Types) == 2 // C++23
101 tuple& operator=(array<U, N> const&) // iff sizeof...(T) == N, EXTENSION
103 tuple& operator=(array<U, N>&&) // iff sizeof...(T) == N, EXTENSION
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dcombine-fcopysign.ll10 ; copysign(x, c1) -> fabs(x) iff ispos(c1)
57 ; copysign(x, c1) -> fneg(fabs(x)) iff isneg(c1)
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Dno-entry-values-with-O0.ll10 ; The call-site-params are created iff corresponding DISubprogram contains
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A D2013-05-05-IfConvertBug.ll300 ; B can be predicated with A.BrToBPredicate into A iff B.Predicate is less
301 ; "permissive" than A.BrToBPredicate, i.e., iff A.BrToBPredicate subsumes

1234