Searched refs:elements (Results 201 - 214 of 214) sorted by relevance

123456789

/freebsd-11-stable/crypto/openssl/crypto/bn/asm/
H A Dia64-mont.pl29 # vectors up to 8 elements, or 512 bits. This means that 256-bit
414 // load input vectors padding them to 8 elements
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp823 for (RegionNode *E : R->elements()) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DRewriteStatepointsForGC.cpp349 return llvm::any_of(ST->elements(), containsGCPtrType);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/AsmParser/
H A DLLParser.cpp3160 "vector elements must have integer, pointer or floating point type");
3162 // Verify that all the vector elements have the same type.
3184 // the element type at this point, there being no elements to examine.
3195 // Verify all elements are correct type!
3601 "getelementptr vector index has a wrong number of elements");
4555 OPTIONAL(elements, MDField, ); \
4569 elements.Val, runtimeLang.Val, vtableHolder.Val,
4580 size.Val, align.Val, offset.Val, flags.Val, elements.Val,
5233 "initializer with struct type has wrong # elements");
5237 // Verify that the elements ar
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DIRTranslator.cpp1776 for (Type *Ty : cast<StructType>(LP.getType())->elements())
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DTargetInfo.cpp175 /// should ensure that all elements of the union have the same "machine type".
3058 // If it overlaps no elements, then it is safe to process as padding.
3242 /// be used as elements of a two register pair to pass or return, return a
4170 // Complex types are passed just like their elements
4600 // Complex types are passed just like their elements.
4657 /// to the number of base elements.
5519 // Homogeneous aggregates passed in registers will have their elements split
6486 /// Coerce the given type into an array with maximum allowed size of elements.
7784 for (auto T : STy->elements()) {
7843 // Compute from the number of elements
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXISelLowering.cpp183 // Given a struct type, recursively traverse the elements with custom ComputePTXValueVTs.
187 for(auto *EI : STy->elements()) {
199 // Split vectors into individual elements, except for v2f16, which
204 // Vectors with an even number of f16 elements will be passed to
205 // us as an array of v2f16 elements. We must match this so we
258 // We don't have enough elements to vectorize.
282 PVF_INNER = 0x0, // Middle elements of a vector.
301 // Set vector size to match ValueVTs and mark all elements as
308 // Skip elements we've already processed.
313 // Mark vectorized elements
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp295 // All vector operands must have the same number of vector elements.
562 /// Vectorize the tree that starts with the elements in \p VL.
653 /// \returns number of elements in vector if isomorphism exists, 0 otherwise.
3122 for (const auto *Ty : ST->elements())
3154 // We have to extract from a vector/aggregate with the same number of elements.
3845 // Check if the same elements are inserted several times and count them as
3849 // Iterate in reverse order to consider insert elements with the high cost.
4423 // Need to cast all elements to the same type before vectorization to
4622 // Extract all of the elements with the external uses.
5696 // TODO: Handle orders of size less than number of elements i
[all...]
/freebsd-11-stable/contrib/gcc/doc/include/
H A Dtexinfo.tex6241 % had it before, so preserve previous elements in list.
/freebsd-11-stable/contrib/groff/doc/
H A Dtexinfo.tex6115 % had it before, so preserve previous elements in list.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.cpp435 // parts vector has more elements than the value vector, then we have a
437 // elements we want.
646 // undef elements.
1563 // Now that we know the number and type of the elements, get that number of
1564 // elements into the Ops array based on what kind of constant it is.
3007 /// we have the freedom to alter the elements in the result as long as the
3053 // 3 & 4 above perform a reduction on all elements of the vector. We push defs
3082 // ElemNumToReduce / 2 elements, and store the result in
3083 // ElemNumToReduce / 2 elements in another vector.
3117 // At this moment we should have reduced all elements i
[all...]
/freebsd-11-stable/contrib/amd/doc/
H A Dtexinfo.tex8157 % had it before, so preserve previous elements in list.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCISelLowering.cpp1320 for (auto *EltTy : STy->elements()) {
1715 * - Use offset of 0 to check for odd elements
1716 * - Use offset of 4 to check for even elements
1718 * - Use offset of 0 to check for even elements
1719 * - Use offset of 4 to check for odd elements
1727 * elements from the two input vectors to place in the result. The elements are
1729 * are always of type v16i8, thus each vector will contain 16 elements of size
1741 * be 16 (indices 0-15 specify elements in the first vector while indices 16
1742 * to 31 specify elements i
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelLowering.cpp1443 // elements. 512-bits can be disabled based on prefer-vector-width and
2209 for (auto *EltTy : STy->elements()) {
5435 /// simplified by widening the elements being shuffled.
5437 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
5450 // If both elements are undef, its trivial.
5484 // Otherwise we can't safely widen the elements used in this shuffle.
5488 "Incorrect size of mask after widening the elements!");
5497 // Create an alternative mask with info about zeroable elements.
5498 // Here we do not set undef elements as zeroable.
5501 assert(!Zeroable.isNullValue() && "V2's non-undef elements ar
[all...]

Completed in 534 milliseconds

123456789