| /llvm-project-15.0.7/flang/test/Evaluate/ |
| H A D | folding20.f90 | 6 logical, parameter :: odds(2,3) = mod(intmatrix, 2) == 1 variable
10 logical, parameter :: test_all = .not. all(odds)
11 logical, parameter :: test_alldim1 = all(.not. all(odds,1))
12 logical, parameter :: test_alldim2 = all(all(odds,2) .eqv. [.true., .false.])
14 logical, parameter :: test_any = any(odds)
15 logical, parameter :: test_anydim1 = all(any(odds,1))
20 logical, parameter :: test_iall_masked = iall(intmatrix,odds) == 1
25 logical, parameter :: test_iany_masked = iany(intmatrix,odds) == 7
30 logical, parameter :: test_iparity_masked = iparity(intmatrix,odds) == 7
38 logical, parameter :: test_imaxval_masked = maxval(intmatrix,odds) == 5
[all …]
|
| H A D | folding24.f90 | 5 logical, parameter :: odds(*,*) = modulo(arr, 2) /= 0 variable
9 logical, parameter :: test_pack_3 = all(pack(arr, odds) == [1, 3, 5])
10 logical, parameter :: test_pack_4 = all(pack(arr, .not. odds) == [2, 4, 6])
13 …logical, parameter :: test_pack_7 = all(pack(arr, odds, vect) == [1, 3, 5, -7, -6, -5, -4, -3, -2,…
14 …logical, parameter :: test_pack_8 = all(pack(arr, .not. odds, vect) == [2, 4, 6, -7, -6, -5, -4, -…
|
| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | PresburgerSetTest.cpp | 445 PresburgerSet odds{parsePoly("(x) : (x - 2 * (x floordiv 2) - 1 == 0)")}; in TEST() local
454 expectEmpty(PresburgerSet(evens).intersect(PresburgerSet(odds))); in TEST()
456 expectEqual(evens.unionSet(odds), in TEST()
458 expectEqual(evens.complement(), odds); in TEST()
459 expectEqual(odds.complement(), evens); in TEST()
486 PresburgerSet odds{ in TEST() local
498 expectEmpty(PresburgerSet(evens).intersect(PresburgerSet(odds))); in TEST()
500 expectEqual(evens.unionSet(odds), in TEST()
502 expectEqual(evens.complement(), odds); in TEST()
503 expectEqual(odds.complement(), evens); in TEST()
|
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | IteratorTest.cpp | 527 auto odds = [](decltype(zipped)::value_type tup) { return get<1>(tup); }; in TEST() local
529 for (auto tup : make_filter_range(reverse(zipped), odds)) { in TEST()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/ |
| H A D | select.ll | 80 ; block generated, odds are good that we have close to the ideal code for this:
|
| /llvm-project-15.0.7/llvm/unittests/TableGen/ |
| H A D | Automata.td | 101 // Can use bins {0-3} but only odds (1 and 3).
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | HowToSubmitABug.rst | 10 about it. This document describes what you can do to increase the odds of
|
| H A D | DeveloperPolicy.rst | 487 changes increases the odds that any of the work will be committed to the main
1123 odds of patent lawsuits in general.
|
| H A D | AMDGPUDwarfExtensionsForHeterogeneousDebugging.rst | 1452 first one and ignores the rest. This seems fundamentally at odds with
|
| /llvm-project-15.0.7/llvm/docs/AMDGPUDwarfExtensionAllowLocationDescriptionOnTheDwarfExpressionStack/ |
| H A D | AMDGPUDwarfExtensionAllowLocationDescriptionOnTheDwarfExpressionStack.md | 1676 > first one and ignores the rest. This seems fundamentally at odds with
|