| /dflybsd-src/contrib/gcc-8.0/gcc/ |
| H A D | tree-data-ref.h | 639 lambda_vector_clear (lambda_vector vec1, int size) in lambda_vector_clear() argument
641 memset (vec1, 0, size * sizeof (*vec1)); in lambda_vector_clear()
667 lambda_vector_zerop (lambda_vector vec1, int size) in lambda_vector_zerop() argument
671 if (vec1[i] != 0) in lambda_vector_zerop()
|
| H A D | tree-vect-generic.c | 1297 tree vec1 = gimple_assign_rhs2 (stmt); in lower_vec_perm() local
1306 bool two_operand_p = !operand_equal_p (vec0, vec1, 0); in lower_vec_perm()
1337 && TREE_CODE (vec1) == VECTOR_CST in lower_vec_perm()
1338 && initializer_zerop (vec1) in lower_vec_perm()
1386 t = vector_element (gsi, vec1, i_val, &vec1tmp); in lower_vec_perm()
1418 v1_val = vector_element (gsi, vec1, i_val, &vec1tmp); in lower_vec_perm()
|
| H A D | tree-data-ref.c | 3415 lambda_vector_copy (lambda_vector vec1, lambda_vector vec2, in lambda_vector_copy() argument
3418 memcpy (vec2, vec1, size * sizeof (*vec1)); in lambda_vector_copy()
3449 lambda_vector_first_nz (lambda_vector vec1, int n, int start) in lambda_vector_first_nz() argument
3452 while (j < n && vec1[j] == 0) in lambda_vector_first_nz()
3476 lambda_vector_mult_const (lambda_vector vec1, lambda_vector vec2, in lambda_vector_mult_const() argument
3485 vec2[i] = const1 * vec1[i]; in lambda_vector_mult_const()
3491 lambda_vector_negate (lambda_vector vec1, lambda_vector vec2, in lambda_vector_negate() argument
3494 lambda_vector_mult_const (vec1, vec2, size, -1); in lambda_vector_negate()
3508 lambda_vector_equal (lambda_vector vec1, lambda_vector vec2, int size) in lambda_vector_equal() argument
3512 if (vec1[i] != vec2[i]) in lambda_vector_equal()
|
| /dflybsd-src/contrib/gcc-4.7/gcc/ |
| H A D | tree-data-ref.h | 711 lambda_vector_clear (lambda_vector vec1, int size) in lambda_vector_clear() argument
713 memset (vec1, 0, size * sizeof (*vec1)); in lambda_vector_clear()
739 lambda_vector_zerop (lambda_vector vec1, int size) in lambda_vector_zerop() argument
743 if (vec1[i] != 0) in lambda_vector_zerop()
|
| H A D | tree-vect-generic.c | 628 tree vec1 = gimple_assign_rhs2 (stmt); in lower_vec_perm() local
637 bool two_operand_p = !operand_equal_p (vec0, vec1, 0); in lower_vec_perm()
673 t = vector_element (gsi, vec1, i_val, &vec1tmp); in lower_vec_perm()
705 v1_val = vector_element (gsi, vec1, i_val, &vec1tmp); in lower_vec_perm()
|
| H A D | tree-data-ref.c | 2265 lambda_vector_copy (lambda_vector vec1, lambda_vector vec2, in lambda_vector_copy() argument
2268 memcpy (vec2, vec1, size * sizeof (*vec1)); in lambda_vector_copy()
2299 lambda_vector_first_nz (lambda_vector vec1, int n, int start) in lambda_vector_first_nz() argument
2302 while (j < n && vec1[j] == 0) in lambda_vector_first_nz()
2338 lambda_vector_mult_const (lambda_vector vec1, lambda_vector vec2, in lambda_vector_mult_const() argument
2347 vec2[i] = const1 * vec1[i]; in lambda_vector_mult_const()
2353 lambda_vector_negate (lambda_vector vec1, lambda_vector vec2, in lambda_vector_negate() argument
2356 lambda_vector_mult_const (vec1, vec2, size, -1); in lambda_vector_negate()
2370 lambda_vector_equal (lambda_vector vec1, lambda_vector vec2, int size) in lambda_vector_equal() argument
2374 if (vec1[i] != vec2[i]) in lambda_vector_equal()
|
| /dflybsd-src/contrib/gcc-4.7/gcc/doc/ |
| H A D | rtl.texi | 2602 @item (vec_merge:@var{m} @var{vec1} @var{vec2} @var{items})
2604 of mode @var{m}; its elements are selected from either @var{vec1} or
2608 a set bit indicates it is taken from @var{vec1}.
2611 @item (vec_select:@var{m} @var{vec1} @var{selection})
2612 This describes an operation that selects parts of a vector. @var{vec1} is
2617 @var{vec1} (if only one subpart is selected), or another vector mode
2621 @item (vec_concat:@var{m} @var{vec1} @var{vec2})
2623 vectors @var{vec1} and @var{vec2}; its length is the sum of the lengths of
|
| H A D | extend.texi | 6898 @code{__builtin_shuffle (vec0, vec1, mask)}.
6905 @var{vec0} beginning at 0 and @var{vec1} beginning at @var{N}. The
|