tree: a13cdeec91019c5690beed11db0fef9e6190afe1
  1. CostModel/
  2. already-vectorized.ll
  3. amdlibm-calls-finite.ll
  4. amdlibm-calls.ll
  5. avx1.ll
  6. avx512.ll
  7. cast-costs.ll
  8. cleanup-runtime-checks.ll
  9. clmul.ll
  10. conditional-scalar-assignment.ll
  11. consecutive-ptr-cg-bug.ll
  12. consecutive-ptr-uniforms.ll
  13. constant-vector-operand.ll
  14. conversion-cost.ll
  15. cost-any-of.ll
  16. cost-conditional-branches.ll
  17. cost-constant-known-via-scev.ll
  18. cost-divisor-overflow.ll
  19. cost-model-assert.ll
  20. cost-model-i386.ll
  21. cost-model.ll
  22. divs-with-tail-folding.ll
  23. drop-inbounds-flags-for-reverse-vector-pointer.ll
  24. drop-poison-generating-flags.ll
  25. end-pointer-signed.ll
  26. ephemeral-recipes.ll
  27. epilog-vectorization-inductions.ll
  28. epilog-vectorization-ordered-reduction.ll
  29. fixed-order-recurrence.ll
  30. float-induction-x86.ll
  31. fminimumnum.ll
  32. fneg-cost.ll
  33. fold-tail-low-trip-count.ll
  34. fp32_to_uint32-cost-model.ll
  35. fp64_to_uint32-cost-model.ll
  36. fp80-widest-type.ll
  37. fp_to_sint8-cost-model.ll
  38. funclet.ll
  39. gather-cost.ll
  40. gather-vs-interleave.ll
  41. gather_scatter.ll
  42. gcc-examples.ll
  43. gep-use-outside-loop.ll
  44. i1-reg-usage.ll
  45. idiv-by-const.ll
  46. illegal-parallel-loop-uniform-write.ll
  47. imprecise-through-phis.ll
  48. induction-costs.ll
  49. induction-step.ll
  50. int128_no_gather.ll
  51. interleave-cost.ll
  52. interleave-opaque-pointers.ll
  53. interleave-ptradd-with-replicated-operand.ll
  54. interleave_short_tc.ll
  55. interleaved-accesses-hoist-load-across-store.ll
  56. interleaved-accesses-large-gap.ll
  57. interleaved-accesses-sink-store-across-load.ll
  58. interleaved-accesses-use-after-free.ll
  59. interleaved-accesses-waw-dependency.ll
  60. interleaving.ll
  61. intrinsiccost.ll
  62. invariant-load-gather.ll
  63. invariant-store-vectorization.ll
  64. invoke-in-preheader.ll
  65. iv-live-outs.ll
  66. libm-vector-calls-finite.ll
  67. libm-vector-calls-VF2-VF8.ll
  68. libm-vector-calls.ll
  69. limit-vf-by-tripcount.ll
  70. lit.local.cfg
  71. load-deref-pred.ll
  72. masked-store-cost.ll
  73. masked_load_store.ll
  74. max-mstore.ll
  75. min-trip-count-switch.ll
  76. mul_slm_16bit.ll
  77. multi-exit-cost.ll
  78. narrow-to-single-scalar.ll
  79. no-vector.ll
  80. no_fpmath.ll
  81. no_fpmath_with_hotness.ll
  82. nondetermisitic-widening-cost.ll
  83. nontemporal.ll
  84. optsize.ll
  85. outer-loop-non-power-of-2-type.ll
  86. outer_loop_test1_no_explicit_vect_width.ll
  87. parallel-loops-after-reg2mem.ll
  88. parallel-loops.ll
  89. pointer-runtime-checks-unprofitable.ll
  90. powof2div.ll
  91. pr109581-unused-blend.ll
  92. pr131359-dead-for-splice.ll
  93. pr141968-instsimplifyfolder.ll
  94. pr23997.ll
  95. pr34438.ll
  96. pr35432.ll
  97. pr36524.ll
  98. pr39160.ll
  99. pr42674.ll
  100. pr47437.ll
  101. pr48340.ll
  102. pr51366-sunk-instruction-used-outside-of-loop.ll
  103. pr54413-select-interleave-count-loop-with-cost-zero.ll
  104. pr54634.ll
  105. pr55096-scalarize-add.ll
  106. pr56319-vector-exit-cond-optimization-epilogue-vectorization.ll
  107. pr72969.ll
  108. pr81872.ll
  109. predicate-switch.ll
  110. predicated-instruction-cost.ll
  111. predicated-replicate-feeding-cast.ll
  112. predicated-udiv.ll
  113. propagate-metadata.ll
  114. ptr-indvar-crash.ll
  115. rauw-bug.ll
  116. reduction-crash.ll
  117. reduction-fastmath.ll
  118. reduction-small-size.ll
  119. redundant-vf2-cost.ll
  120. reg-usage-debug.ll
  121. reg-usage.ll
  122. register-assumption.ll
  123. replicate-recipe-with-only-first-lane-used.ll
  124. replicate-uniform-call.ll
  125. replicating-load-store-costs-max-bandwidth.ll
  126. replicating-load-store-costs.ll
  127. runtime-limit.ll
  128. scatter_crash.ll
  129. scev-checks-unprofitable.ll
  130. slm-no-vectorize.ll
  131. small-size.ll
  132. strided_load_cost.ll
  133. struct-store.ll
  134. svml-calls-finite.ll
  135. svml-calls.ll
  136. tail_folding_and_assume_safety.ll
  137. tail_loop_folding.ll
  138. transform-narrow-interleave-to-widen-memory-epilogue-vec.ll
  139. transform-narrow-interleave-to-widen-memory-gaps.ll
  140. transform-narrow-interleave-to-widen-memory-live-outs.ll
  141. transform-narrow-interleave-to-widen-memory.ll
  142. tripcount.ll
  143. uint64_to_fp64-cost-model.ll
  144. uniform-phi.ll
  145. uniform_load.ll
  146. uniform_mem_op.ll
  147. uniformshift.ll
  148. unroll-pm.ll
  149. unroll-small-loops.ll
  150. unroll_selection.ll
  151. veclib-calls.ll
  152. vect.omp.force.ll
  153. vect.omp.force.small-tc.ll
  154. vector-scalar-select-cost.ll
  155. vector_max_bandwidth.ll
  156. vector_ptr_load_store.ll
  157. vectorization-remarks-loopid-dbg.ll
  158. vectorization-remarks-missed.ll
  159. vectorization-remarks-profitable.ll
  160. vectorization-remarks.ll
  161. vectorize-force-tail-with-evl.ll
  162. vectorize-interleaved-accesses-gap.ll
  163. vectorize-only-for-real.ll
  164. vplan-native-inner-loop-only.ll
  165. vplan-single-bit-ind-var-width-4.ll
  166. vplan-single-bit-ind-var.ll
  167. widen-canonical-iv-register-pressure.ll
  168. widened-value-used-as-scalar-and-first-lane.ll
  169. x86-interleaved-accesses-masked-group.ll
  170. x86-interleaved-store-accesses-with-gaps.ll
  171. x86-pr39099.ll
  172. x86-predication.ll
  173. x86-prefer-no-gather.ll
  174. x86-prefer-no-scatter.ll
  175. x86_fp80-interleaved-access.ll
  176. x86_fp80-vector-store.ll