mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-10-31 08:16:47 +00:00 
			
		
		
		
	Update comment, replace theoretically impossible check with an assert.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@70391 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
		| @@ -317,13 +317,13 @@ namespace ISD { | |||||||
|     /// IDX, which must be a multiple of the result vector length. |     /// IDX, which must be a multiple of the result vector length. | ||||||
|     EXTRACT_SUBVECTOR, |     EXTRACT_SUBVECTOR, | ||||||
|  |  | ||||||
|     /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same |     /// VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as  | ||||||
|     /// type as VEC1/VEC2.  SHUFFLEVEC is a BUILD_VECTOR of constant int values |     /// VEC1/VEC2.  A VECTOR_SHUFFLE node also contains an array of constant int  | ||||||
|     /// (maybe of an illegal datatype) or undef that indicate which value each |     /// values that indicate which value (or undef) each result element will | ||||||
|     /// result element will get.  The elements of VEC1/VEC2 are enumerated in |     /// get.  These constant ints are accessible through the  | ||||||
|     /// order.  This is quite similar to the Altivec 'vperm' instruction, except |     /// ShuffleVectorSDNode class.  This is quite similar to the Altivec  | ||||||
|     /// that the indices must be constants and are in terms of the element size |     /// 'vperm' instruction, except that the indices must be constants and are | ||||||
|     /// of VEC1/VEC2, not in terms of bytes. |     /// in terms of the element size of VEC1/VEC2, not in terms of bytes. | ||||||
|     VECTOR_SHUFFLE, |     VECTOR_SHUFFLE, | ||||||
|  |  | ||||||
|     /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a |     /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a | ||||||
|   | |||||||
| @@ -5731,9 +5731,7 @@ bool ShuffleVectorSDNode::isSplatMask(const int *Mask, MVT VT) { | |||||||
|   for (i = 0, e = VT.getVectorNumElements(); i != e && Mask[i] < 0; ++i) |   for (i = 0, e = VT.getVectorNumElements(); i != e && Mask[i] < 0; ++i) | ||||||
|     /* search */; |     /* search */; | ||||||
|  |  | ||||||
|   // If we hit the end of the mask looking for a non-undef value, return false. |   assert(i != e && "VECTOR_SHUFFLE node with all undef indices!"); | ||||||
|   if (i == e) |  | ||||||
|     return false; |  | ||||||
|    |    | ||||||
|   // Make sure all remaining elements are either undef or the same as the first |   // Make sure all remaining elements are either undef or the same as the first | ||||||
|   // non-undef value. |   // non-undef value. | ||||||
|   | |||||||
		Reference in New Issue
	
	Block a user