| /llvm-project-15.0.7/mlir/lib/Reducer/ |
| H A D | ReductionNode.cpp | 136 ReductionNode *smallest = nullptr; in getNeighbors() local
140 if (smallest == nullptr || node->getSize() < smallest->getSize()) in getNeighbors()
141 smallest = node; in getNeighbors()
144 if (smallest != nullptr && in getNeighbors()
145 smallest->getSize() < node->getParent()->getSize()) { in getNeighbors()
147 node = smallest; in getNeighbors()
|
| /llvm-project-15.0.7/lldb/scripts/ |
| H A D | analyze-project-deps.py | 157 smallest = result[0][1]
160 smallest = min(smallest, value)
161 yield (total, smallest, result)
174 for (total, smallest, cycle) in counted:
189 for (total, smallest, cycle) in counted:
|
| /llvm-project-15.0.7/llvm/test/Assembler/ |
| H A D | invalid-inttype.ll | 3 ; i8388609 is the smallest integer type that can't be represented in LLVM IR
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/ |
| H A D | incorrect-roundings.rst | 14 2. It is incorrect. The number 0.499999975 (smallest representable float
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AArch64/ |
| H A D | setcc-takes-i32.ll | 8 ; It was expecting the smallest legal promotion of i1 to be the preferred SetCC
|
| /llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/ |
| H A D | frame-08.ll | 109 ; Like f1 but with a frame that is 8 bytes bigger. This is the smallest
176 ; Like f2 but with a frame that is 8 bytes bigger. This is the smallest
245 ; This is the smallest frame size for which the preparatory increment for
|
| H A D | frame-01.ll | 98 ; The smallest frame size that needs two instructions to both allocate
|
| H A D | memcmp-nobuiltin.ll | 162 ; Test the smallest size that needs 3 CLCs.
|
| H A D | memcmp-01.ll | 174 ; Test the smallest size that needs 3 CLCs.
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/X86/ |
| H A D | vector_max_bandwidth.ll | 15 ; Tests that the vectorization factor is determined by the smallest instead of
|
| /llvm-project-15.0.7/llvm/docs/HistoricalNotes/ |
| H A D | 2000-12-06-MeetingSummary.txt | 80 numbers are the smallest.
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/AArch64/ |
| H A D | extend-vectorization-factor-for-unprofitable-memops.ll | 7 ; maximum VF for NEON is calculated by 128/size of smallest type in loop.
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/SPIRV/IR/ |
| H A D | SPIRVAtomicOps.td | 580 2) get a New Value by finding the smallest signed integer of Original
664 2) get a New Value by finding the smallest unsigned integer of Original
|
| /llvm-project-15.0.7/llvm/lib/Target/ARM/ |
| H A D | README-Thumb.txt | 6 the smallest.
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | CycleTerminology.rst | 212 DFS, consider the smallest cycle C which contains P. For the sake
|
| H A D | HowToSubmitABug.rst | 78 reduce the preprocessed file down to the smallest amount of code that still
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | float-minmax-instruction-flag.ll | 4 ; The function finds the smallest value from a float vector.
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Mips/cconv/ |
| H A D | return-struct.ll | 176 ; This will generate inlined memcpy's anyway so pick the smallest large
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/ |
| H A D | constant-fold-fp-denormal.ll | 253 ; Output modes are tested by multiplying the smallest normal number by 0.5,
377 ; Output modes are tested by dividing the smallest normal number by 2,
|
| /llvm-project-15.0.7/clang/docs/ |
| H A D | ClangFormat.rst | 313 -p NUM strip the smallest prefix containing P slashes
|
| /llvm-project-15.0.7/llvm/test/MC/WebAssembly/ |
| H A D | tag-section-decoding.ll | 338 ; decoded with LEB128, 64 will not be correctly decoded. 64 is the smallest
|
| /llvm-project-15.0.7/mlir/docs/Dialects/ |
| H A D | Affine.md | 107 first argument by its second argument to the smallest integer greater than or
|
| /llvm-project-15.0.7/clang/docs/analyzer/developer-docs/ |
| H A D | InitializerLists.rst | 72 causes the smallest amount of layering violations), so that the core knew what
|
| /llvm-project-15.0.7/polly/lib/External/isl/doc/ |
| H A D | implementation.tex | 120 and it is defined as the (inclusion-wise) smallest basic set
146 with $\vec K_i$ the (component-wise) smallest non-negative integer vectors
224 smallest increment in the variables $\vec x$,
227 In order to be able to determine the smallest increment, the tableau
|
| /llvm-project-15.0.7/mlir/test/Conversion/ArithmeticToSPIRV/ |
| H A D | arithmetic-to-spirv.mlir | 626 %2 = arith.constant 0x3FF0000000000001 : f64 // smallest number > 1
1540 %2 = arith.constant 0x3FF0000000000001 : f64 // smallest number > 1
|