Home
last modified time | relevance | path

Searched refs:adjacent (Results 1 – 25 of 61) sorted by relevance

123

/llvm-project-15.0.7/libcxx/docs/Status/
H A DZipProjects.csv18 | `[range.adjacent.view] <https://wg21.link/range.adjacent.view>`_, "adjacent_view", "| `adjacent_v…
20 | `[range.adjacent.iterator] <https://wg21.link/range.adjacent.iterator>`_, "adjacent_view::iterato…
21 | `[range.adjacent.sentinel] <https://wg21.link/range.adjacent.sentinel>`_, "adjacent_view::sentine…
22 | `[range.adjacent.transform.view] <https://wg21.link/range.adjacent.transform.view>`_, "adjacent_t…
24 | `[range.adjacent.transform.iterator] <https://wg21.link/range.adjacent.transform.iterator>`_, "ad…
25 | `[range.adjacent.transform.sentinel] <https://wg21.link/range.adjacent.transform.sentinel>`_, "ad…
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A Dnoopt-dmb-v7.ll1 ; Ensure that adjacent duplicated barriers are not removed at -O0.
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DIntervalMap.h155 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
179 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
641 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { in insertFrom()
644 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
666 if (value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
1633 Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1642 return Node.value(i) == Value && Traits::adjacent(Node.stop(i), Start); in canCoalesceLeft()
1662 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1667 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1670 return Node.value(0) == Value && Traits::adjacent(Stop, Node.start(0)); in canCoalesceRight()
[all …]
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/modernize/
H A Dmacro-to-enum.rst6 Replaces groups of adjacent macros with an unscoped anonymous enum.
32 - Macros must not be defined adjacent to other preprocessor directives.
/llvm-project-15.0.7/lld/test/ELF/
H A Dmips-got-page.s3 # two adjacent 0xffff-bytes pages. We need to create two GOT entries
H A Driscv-tls-le.s73 ## Test non-adjacent instructions.
H A Dx86-64-tlsdesc-gd.s97 ## leaq/call may not be adjacent: https://gitlab.freedesktop.org/mesa/mesa/-/issues/5665
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dsmem-no-clause-coalesced.mir4 # from the two adjacent smem instructions, because the first one has its
H A Dlower-lds-struct-aa.ll11 ; are not adjacent. They are only moved later by MachineScheduler.
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dwin64_call_epi.ll54 ; Check nop is not emitted when call is not adjacent to epilogue.
H A Dpr38952.mir73 ; not being adjacent to the def, see PR38952
/llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/
H A Dframe-pointer.ll39 ; must use two push/pop instructions to ensure that fp and sp are adjacent on
109 ; push into two, to ensure that r7 and sp are adjacent on the stack.
/llvm-project-15.0.7/clang/test/Modules/
H A Dimplicit-private-with-different-name.m3 // Build PCH using A, with adjacent private module APrivate, which winds up being implicitly refere…
H A Dimplicit-private-canonical.m2 // Build PCH using A, with adjacent private module APrivate, which winds up being implicitly refere…
/llvm-project-15.0.7/llvm/test/MC/X86/AlignedBundling/
H A Dlabeloffset.s40 # and for 2 adjacent labels that both point to the correct instruction
/llvm-project-15.0.7/llvm/test/CodeGen/AVR/
H A Davr-rust-issue-123.ll4 ; pass inserts an unconditional branch to the previous adjacent
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/
H A Deasily-swappable-parameters.rst104 The minimum length required from an adjacent parameter sequence to be
115 swappable adjacent parameter sequence.
129 considered part of a swappable adjacent parameter sequence.
/llvm-project-15.0.7/lld/test/COFF/
H A Dpdb-type-server-missing.yaml2 # adjacent type server PDB. Test that LLD fails gracefully on it.
/llvm-project-15.0.7/llvm/test/Transforms/LoopFusion/
H A Dnonadjacent_peel.ll5 ; the loops are not adjacent, hence they are not valid to be fused (after
H A Dloop_nest.ll41 ; fused because they are not control flow equivalent and adjacent. These are
/llvm-project-15.0.7/mlir/include/mlir/Dialect/SCF/Transforms/
H A DPasses.td49 let summary = "Fuse adjacent parallel loops";
/llvm-project-15.0.7/llvm/test/Transforms/LoopStrengthReduce/X86/
H A Dlsr-cond-dbg.ll4 ; immediately adjacent to the terminating branch and it has more than one use,
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_scheduler.c3512 int adjacent; in unconditionalize_adjacent_validity() local
3521 adjacent = domain_intersects(validity, condition_sink); in unconditionalize_adjacent_validity()
3522 if (adjacent >= 0 && !adjacent) in unconditionalize_adjacent_validity()
3523 adjacent = range_intersects(validity, condition_source); in unconditionalize_adjacent_validity()
3524 if (adjacent < 0) in unconditionalize_adjacent_validity()
3526 if (!adjacent) in unconditionalize_adjacent_validity()
5666 int adjacent, local; in has_adjacent_true_conditions() local
5676 if (adjacent >= 0 && !adjacent) in has_adjacent_true_conditions()
5677 adjacent = range_intersects(condition, in has_adjacent_true_conditions()
5679 if (adjacent < 0) in has_adjacent_true_conditions()
[all …]
/llvm-project-15.0.7/llvm/test/DebugInfo/MIR/X86/
H A Ddvl-livedebugvars-stackptr.mir3 # This is a copy of the adjacent "-movements.mir" file, but where one of the
/llvm-project-15.0.7/llvm/test/Transforms/CorrelatedValuePropagation/
H A Ddeopt.ll72 ;; producing 1 of several adjacent constants to test generality

123