| /freebsd/contrib/llvm-project/clang/lib/Headers/ |
| H A D | amxmovrstransposeintrin.h | 23 #define _tile_2rpntlvwz0rs(tdst, base, stride) \ argument 24 __builtin_ia32_t2rpntlvwz0rs(tdst, base, stride) 25 #define _tile_2rpntlvwz0rst1(tdst, base, stride) \ argument 26 __builtin_ia32_t2rpntlvwz0rst1(tdst, base, stride) 27 #define _tile_2rpntlvwz1rs(tdst, base, stride) \ argument 28 __builtin_ia32_t2rpntlvwz1rs(tdst, base, stride) 29 #define _tile_2rpntlvwz1rst1(tdst, base, stride) \ argument 30 __builtin_ia32_t2rpntlvwz1rst1(tdst, base, stride) 35 __SIZE_TYPE__ stride) { in _tile_2rpntlvwz0rs_internal() argument 40 (__SIZE_TYPE__)(stride)); in _tile_2rpntlvwz0rs_internal() [all …]
|
| H A D | amxtransposeintrin.h | 21 #define _tile_2rpntlvwz0(tdst, base, stride) \ argument 22 __builtin_ia32_t2rpntlvwz0(tdst, base, stride) 23 #define _tile_2rpntlvwz0t1(tdst, base, stride) \ argument 24 __builtin_ia32_t2rpntlvwz0t1(tdst, base, stride) 25 #define _tile_2rpntlvwz1(tdst, base, stride) \ argument 26 __builtin_ia32_t2rpntlvwz1(tdst, base, stride) 27 #define _tile_2rpntlvwz1t1(tdst, base, stride) \ argument 28 __builtin_ia32_t2rpntlvwz1t1(tdst, base, stride) 63 __SIZE_TYPE__ stride) { in _tile_2rpntlvwz0_internal() argument 68 (__SIZE_TYPE__)(stride)); in _tile_2rpntlvwz0_internal() [all …]
|
| H A D | amxmovrsintrin.h | 20 #define _tile_loaddrs(dst, base, stride) \ argument 22 (__SIZE_TYPE__)(stride)) 23 #define _tile_stream_loaddrs(dst, base, stride) \ argument 25 (__SIZE_TYPE__)(stride)) 28 __SIZE_TYPE__ stride) { in _tile_loaddrs_internal() argument 30 (__SIZE_TYPE__)(stride)); in _tile_loaddrs_internal() 34 __SIZE_TYPE__ stride) { in _tile_loaddrst1_internal() argument 36 (__SIZE_TYPE__)(stride)); in _tile_loaddrst1_internal() 39 __tile_loaddrs(__tile1024i *dst, const void *base, __SIZE_TYPE__ stride) { in __tile_loaddrs() argument 40 dst->tile = _tile_loaddrs_internal(dst->row, dst->col, base, stride); in __tile_loaddrs() [all …]
|
| H A D | amxintrin.h | 70 /// Load tile rows from memory specifieid by "base" address and "stride" into 82 /// \param stride 83 /// The stride between the rows' data to be loaded in memory. 84 #define _tile_loadd(dst, base, stride) \ argument 86 (__SIZE_TYPE__)(stride)) 88 /// Load tile rows from memory specifieid by "base" address and "stride" into 102 /// \param stride 103 /// The stride between the rows' data to be loaded in memory. 104 #define _tile_stream_loadd(dst, base, stride) \ argument 106 (__SIZE_TYPE__)(stride)) [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVGatherScatterLowering.cpp | 43 // Cache of the BasePtr and Stride determined from this GEP. When a GEP is 71 bool matchStridedRecurrence(Value *Index, Loop *L, Value *&Stride, 87 // TODO: Should we consider the mask when looking for a stride? 115 Value *Stride = ConstantInt::get(StartVal->getType(), StrideVal); in matchStridedConstant() local 117 return std::make_pair(StartVal, Stride); in matchStridedConstant() 156 Value *Stride; in matchStridedStart() local 157 std::tie(Start, Stride) = matchStridedStart(BO->getOperand(OtherIndex), in matchStridedStart() 164 // Add the splat value to the start or multiply the start and stride by the in matchStridedStart() 178 Stride = Builder.CreateMul(Stride, Splat); in matchStridedStart() 182 Stride = Builder.CreateShl(Stride, Splat); in matchStridedStart() [all …]
|
| /freebsd/contrib/pnglite/ |
| H A D | pnglite.c | 382 png_filter_sub(unsigned stride, uint8_t *in, uint8_t *out, unsigned len) in png_filter_sub() argument 388 if (i >= stride) in png_filter_sub() 389 a = out[i - stride]; in png_filter_sub() 396 png_filter_up(unsigned stride __unused, uint8_t *in, uint8_t *out, in png_filter_up() 409 png_filter_average(unsigned stride, uint8_t *in, uint8_t *out, in png_filter_average() argument 421 if (i >= stride) in png_filter_average() 422 a = out[i - stride]; in png_filter_average() 452 png_filter_paeth(unsigned stride, uint8_t *in, uint8_t *out, uint8_t *prev_line, in png_filter_paeth() argument 461 if (prev_line && i >= stride) { in png_filter_paeth() 462 a = out[i - stride]; in png_filter_paeth() [all …]
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/cmd/ |
| H A D | stride_dd.c | 30 static off_t stride = 1; variable 48 " [-s stride] [-k seekblocks] [-K seekbytes]\n" in usage() 52 "Simplified version of dd that supports the stride option.\n" in usage() 53 "A stride of n means that for each block written, n - 1 blocks\n" in usage() 54 "are skipped in both the input and output file. A stride of 1\n" in usage() 63 " stride: Read/write a block then skip (stride - 1) blocks" in usage() 146 stride = atoi(optarg); in parse_options() 184 if (bsize <= 0 || stride <= 0 || ifile == NULL || ofile == NULL || in parse_options() 216 if (stride > 1) { in read_entire_file() 217 if (lseek(ifd, (stride - 1) * bsize, SEEK_CUR) == -1) { in read_entire_file() [all …]
|
| /freebsd/crypto/openssl/ssl/rio/ |
| H A D | poll_immediate.c | 28 #define ITEM_N(items, stride, n) \ argument 29 (*(SSL_POLL_ITEM *)((char *)(items) + (n) * (stride))) 36 ITEM_N(items, stride, j).revents = 0; \ 46 ITEM_N(items, stride, idx_).revents = SSL_POLL_EVENT_F; \ 164 size_t stride, in postpoll_translation_cleanup() argument 172 item = &ITEM_N(items, stride, i); in postpoll_translation_cleanup() 200 size_t stride, in poll_translate() argument 217 item = &ITEM_N(items, stride, i); in poll_translate() 275 postpoll_translation_cleanup(items, i, stride, wctx); in poll_translate() 284 size_t stride, in poll_block() argument [all …]
|
| /freebsd/crypto/openssl/crypto/sm4/asm/ |
| H A D | sm4-riscv64-zvksed.pl | 123 my ($ukey,$keys,$fk,$stride)=("a0","a1","t0","t1"); 153 li $stride, -4 154 @{[vsse32_v $vk7, $keys, $stride]} # rk[31:28] 156 @{[vsse32_v $vk6, $keys, $stride]} # rk[27:24] 158 @{[vsse32_v $vk5, $keys, $stride]} # rk[23:20] 160 @{[vsse32_v $vk4, $keys, $stride]} # rk[19:16] 162 @{[vsse32_v $vk3, $keys, $stride]} # rk[15:12] 164 @{[vsse32_v $vk2, $keys, $stride]} # rk[11:8] 166 @{[vsse32_v $vk1, $keys, $stride]} # rk[7:4] 168 @{[vsse32_v $vk0, $keys, $stride]} # rk[3:0] [all …]
|
| /freebsd/usr.sbin/virtual_oss/virtual_oss/ |
| H A D | mul.c | 49 * <input size> = "stride" 50 * <output size> = 2 * "stride" 54 const size_t stride, const uint8_t toggle) in voss_x3_multiply_sub_double() argument 59 if (stride >= (1UL << VOSS_X3_LOG2_COMBA)) { in voss_x3_multiply_sub_double() 60 const size_t strideh = stride >> 1; in voss_x3_multiply_sub_double() 141 for (x = 0; x != stride; x++) { in voss_x3_multiply_sub_double() 144 for (y = 0; y != (stride - x); y++) { in voss_x3_multiply_sub_double() 148 for (; y != stride; y++) { in voss_x3_multiply_sub_double() 149 ptr_high[x + y - stride] += input[y].b * value; in voss_x3_multiply_sub_double()
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/ |
| H A D | LibCxxSliceArray.cpp | 36 const size_t stride = ptr_sp->GetValueAsUnsigned(0); in LibcxxStdSliceArraySummaryProvider() local 38 stream.Printf("stride=%zu size=%zu", stride, size); in LibcxxStdSliceArraySummaryProvider() 48 /// slice(std::size_t start, std::size_t size, std::size_t stride); 52 /// - __stride_is @a stride 135 ValueObjectSP stride = m_backend.GetChildMemberWithName("__stride_"); in Update() local 137 if (!start || !size || !stride) in Update() 142 m_stride = stride->GetValueAsUnsigned(0); in Update()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/VE/ |
| H A D | VVPInstrPatternsVec.td | 23 // Unmasked (imm stride). 26 (i64 simm7:$stride), (MaskVT true_mask), i32:$avl), 28 (LO7 $stride), $addr, $val, $avl)>; 32 i64:$stride, (MaskVT true_mask), i32:$avl), 34 $stride, $addr, $val, $avl)>; 35 // Masked (imm stride). 38 (i64 simm7:$stride), MaskVT:$mask, i32:$avl), 40 (LO7 $stride), $addr, $val, $mask, $avl)>; 44 i64:$stride, MaskVT:$mask, i32:$avl), 46 $stride, $addr, $val, $mask, $avl)>; [all …]
|
| /freebsd/sys/dev/aq/ |
| H A D | aq_hw_llh_internal.h | 44 * parameter: semaphore {s} | stride size 0x4 | range [0, 15] 232 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 251 * parameter: dca {d} | stride size 0x4 | range [0, 31] 270 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 289 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 308 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 327 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 344 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 363 * parameter: descriptor {d} | stride size 0x20 | range [0, 31] 418 * parameter: dca {d} | stride size 0x4 | range [0, 31] [all …]
|
| /freebsd/contrib/ofed/libmlx5/ |
| H A D | mlx5dv_init_obj.3 | 29 uint32_t stride; 36 uint32_t stride; 65 uint32_t stride; 77 uint32_t stride;
|
| /freebsd/contrib/llvm-project/libcxx/include/__mdspan/ |
| H A D | layout_stride.h | 139 // compute the permutation for sorting the stride array 140 // we never actually sort the stride array 161 // [mdspan.layout.stride.cons], constructors 234 // stride() only compiles for rank > 0 in requires() 237 static_cast<index_type>(__other.stride(_Pos))...}; in requires() 242 // stride() only compiles for rank > 0 246 …return ((static_cast<index_type>(__other.stride(_Pos)) > static_cast<index_type>(0)) && ... && tru… 259 // [mdspan.layout.stride.obs], observers 335 // according to the standard layout_stride does not have a constraint on stride(r) for rank>0 337 _LIBCPP_HIDE_FROM_ABI constexpr index_type stride(rank_type __r) const noexcept { in stride() function [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | VectorUtils.h | 435 /// Create a stride shuffle mask. 438 /// are incremented by \p Stride. The mask can be used to deinterleave an 442 /// <Start, Start + Stride, ..., Start + Stride * (VF - 1)> 444 /// For example, the mask for Start = 0, Stride = 2, and VF = 4 is: 448 createStrideMask(unsigned Start, unsigned Stride, unsigned VF); 499 /// The group of interleaved loads/stores sharing the same stride and 504 /// value of the access's stride. 531 InterleaveGroup(InstTy *Instr, int32_t Stride, Align Alignment) in InterleaveGroup() argument 533 Factor = std::abs(Stride); in InterleaveGroup() 536 Reverse = Stride < 0; in InterleaveGroup() [all …]
|
| H A D | LoopCacheAnalysis.h | 92 /// - equal to '(TripCount * stride) / cache_line_size' if: 93 /// + the reference stride is less than the cache line size, and 112 /// the loop induction variable is the rightmost one, and the access stride is 113 /// smaller than the cache line size \p CLS. Provide a valid \p Stride value 115 bool isConsecutive(const Loop &L, const SCEV *&Stride, unsigned CLS) const; 185 /// reference stride if the reference stride is less than the cache line 188 /// - equal to the innermost loop trip count if the reference stride is greater 244 /// - equal to '(TripCount * stride) / cache_line_size' if (a) loop \p L's 246 /// with loop \p L, and (b) the reference stride is less than the cache
|
| /freebsd/crypto/openssl/doc/designs/ |
| H A D | evp-cipher-pipeline.md | 147 * @param stride The stride argument must be set to sizeof(EVP_CIPHER_buf) 150 EVP_CIPHER_buf *in, size_t stride); 155 * @param stride The stride argument must be set to sizeof(EVP_CIPHER_buf) 158 EVP_CIPHER_buf *out, size_t stride); 163 * @param bsize stride; sizeof(EVP_CIPHER_buf)
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 291 const SCEV *Stride = nullptr; in computeRefCost() local 292 if (isConsecutive(L, Stride, CLS)) { in computeRefCost() 294 // (TripCount*Stride)/CLS. in computeRefCost() 295 assert(Stride != nullptr && in computeRefCost() 296 "Stride should not be null for consecutive access!"); in computeRefCost() 297 Type *WiderType = SE.getWiderType(Stride->getType(), TripCount->getType()); in computeRefCost() 299 Stride = SE.getNoopOrAnyExtend(Stride, WiderType); in computeRefCost() 301 const SCEV *Numerator = SE.getMulExpr(Stride, TripCount); in computeRefCost() 310 << "Access is consecutive: RefCost=(TripCount*Stride)/CLS=" in computeRefCost() 473 bool IndexedReference::isConsecutive(const Loop &L, const SCEV *&Stride, in isConsecutive() argument [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86InterleavedAccess.cpp | 57 /// Reference to the interleaving stride in terms of elements. 103 /// \p 'Ind' and the interleaving stride factor \p F. In order to generate 132 // Stride 4: in isSupported() 135 // Stride 3: in isSupported() 147 // We support shuffle represents stride 4 for byte type with size of in isSupported() 195 // In the case of stride 3 with a vector of 32 elements load the information in decompose() 286 unsigned VecElems, unsigned Stride, in reorderSubVector() argument 290 for (unsigned i = 0; i < Stride; i++) in reorderSubVector() 298 for (unsigned i = 0; i < (VecElems / 16) * Stride; i += 2) { in reorderSubVector() 299 genShuffleBland(VT, VPShuf, OptimizeShuf, (i / Stride) * 16, in reorderSubVector() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | StraightLineStrengthReduce.cpp | 148 : CandidateKind(CT), Base(B), Index(Idx), Stride(S), Ins(I) {} in Candidate() 154 // Note that Index and Stride of a GEP candidate do not necessarily have the 155 // same integer type. In that case, during rewriting, Stride will be 159 Value *Stride = nullptr; member 170 // <Base: a, Index: 1, Stride: b + 2> 174 // <Base: b, Index: 2, Stride: a + 1> 186 // share the same base and stride. 234 // A helper function that factors ArrayIdx to a product of a stride and a 280 // They share the same base, stride, and candidate kind. in isBasisFor() 281 Basis.Base == C.Base && Basis.Stride == C.Stride && in isBasisFor() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Object/ |
| H A D | DXContainer.cpp | 278 StaticSamplers.Stride = sizeof(dxbc::RTS0::v1::StaticSampler); in parse() 345 if (Error Err = readInteger(Data, Current, Resources.Stride)) in parse() 349 size_t BindingDataSize = Resources.Stride * ResourceCount; in parse() 358 Resources.Stride = sizeof(v2::ResourceBindInfo); in parse() 399 if (Error Err = readInteger(Data, Current, SigInputElements.Stride)) in parse() 402 // Assign the stride to all the arrays. in parse() 403 SigOutputElements.Stride = SigPatchOrPrimElements.Stride = in parse() 404 SigInputElements.Stride; in parse() 407 (ptrdiff_t)(ElementCount * SigInputElements.Stride)) in parse() 411 size_t InputSize = SigInputElements.Stride * InputCount; in parse() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Object/ |
| H A D | DXContainer.h | 54 uint32_t Stride = sizeof(T); // size of each element in the list. member 57 ViewArray(StringRef D, size_t S) : Data(D), Stride(S) {} in ViewArray() 66 uint32_t Stride; // size of each element in the list. member 70 : Data(A.Data), Stride(A.Stride), Current(C) {} in iterator() 81 memcpy(static_cast<void *>(&Val), Current, std::min(Stride, MaxStride())); 89 Current += Stride; 101 Current -= Stride; 119 size_t size() const { return Data.size() / Stride; } in size() 211 Table.NumRanges * Table.Ranges.Stride); in read() 345 uint32_t getResourceStride() const { return Resources.Stride; } in getResourceStride() [all …]
|
| /freebsd/contrib/llvm-project/openmp/runtime/src/ |
| H A D | kmp_gsupport.cpp | 580 // "*p_ub += stride" compensates for the discrepancy. 583 // stride value. We adjust the dispatch parameters accordingly (by +-1), but 584 // we still adjust p_ub by the actual stride value. 605 long stride; \ 624 (kmp_int *)p_ub, (kmp_int *)&stride); \ 627 KMP_DEBUG_ASSERT(stride == str); \ 645 long stride; \ 664 (kmp_int *)p_ub, (kmp_int *)&stride); \ 667 KMP_DEBUG_ASSERT(stride == str); \ 690 long stride; \ [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | MatrixBuilder.h | 65 /// \p Stride - Space between columns 67 Value *Stride, bool IsVolatile, unsigned Rows, 71 Value *Ops[] = {DataPtr, Stride, B.getInt1(IsVolatile), B.getInt32(Rows), 73 Type *OverloadedTypes[] = {RetType, Stride->getType()}; 88 /// \p Stride - Space between columns 90 Value *Stride, bool IsVolatile, 94 Stride, B.getInt1(IsVolatile), 96 Type *OverloadedTypes[] = {Matrix->getType(), Stride->getType()};
|