Searched refs:vec1 (Results 1 – 3 of 3) sorted by relevance
| /freebsd-9-stable/contrib/gcc/ |
| D | lambda.h | 236 lambda_vector_mult_const (lambda_vector vec1, lambda_vector vec2, in lambda_vector_mult_const() argument
245 vec2[i] = const1 * vec1[i]; in lambda_vector_mult_const()
251 lambda_vector_negate (lambda_vector vec1, lambda_vector vec2, in lambda_vector_negate() argument
254 lambda_vector_mult_const (vec1, vec2, size, -1); in lambda_vector_negate()
260 lambda_vector_add (lambda_vector vec1, lambda_vector vec2, in lambda_vector_add() argument
265 vec3[i] = vec1[i] + vec2[i]; in lambda_vector_add()
271 lambda_vector_add_mc (lambda_vector vec1, int const1, in lambda_vector_add_mc() argument
277 vec3[i] = const1 * vec1[i] + const2 * vec2[i]; in lambda_vector_add_mc()
283 lambda_vector_copy (lambda_vector vec1, lambda_vector vec2, in lambda_vector_copy() argument
286 memcpy (vec2, vec1, size * sizeof (*vec1)); in lambda_vector_copy()
[all …]
|
| /freebsd-9-stable/contrib/gcc/cp/ |
| D | tree.c | 1550 tree vec1, vec2; in cp_tree_equal() local
1554 vec1 = TREE_OPERAND (t1, 1); in cp_tree_equal()
1557 if (!vec1 || !vec2) in cp_tree_equal()
1558 return !vec1 && !vec2; in cp_tree_equal()
1560 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2)) in cp_tree_equal()
1563 for (ix = TREE_VEC_LENGTH (vec1); ix--;) in cp_tree_equal()
1564 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix), in cp_tree_equal()
|
| /freebsd-9-stable/contrib/gcc/doc/ |
| D | rtl.texi | 2265 @item (vec_merge:@var{m} @var{vec1} @var{vec2} @var{items})
2267 of mode @var{m}; its elements are selected from either @var{vec1} or
2271 a set bit indicates it is taken from @var{vec1}.
2274 @item (vec_select:@var{m} @var{vec1} @var{selection})
2275 This describes an operation that selects parts of a vector. @var{vec1} is
2281 @item (vec_concat:@var{m} @var{vec1} @var{vec2})
2283 vectors @var{vec1} and @var{vec2}; its length is the sum of the lengths of
|