Searched refs:vec2 (Results 1 – 5 of 5) sorted by relevance
| /freebsd-12.1/contrib/gcc/ |
| H A D | lambda.h | 242 lambda_vector_clear (vec2, size); in lambda_vector_mult_const()
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()
272 lambda_vector vec2, int const2, 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-12.1/contrib/gcc/cp/ |
| H A D | tree.c | 1550 tree vec1, vec2; in cp_tree_equal() local
1555 vec2 = TREE_OPERAND (t2, 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()
1565 TREE_VEC_ELT (vec2, ix))) in cp_tree_equal()
|
| /freebsd-12.1/contrib/llvm/lib/Target/SystemZ/ |
| H A D | SystemZPatterns.td | 175 : Pat<(tr.vt (operator (tr.vt tr.op:$vec1), (tr.vt tr.op:$vec2))),
176 (insn tr.op:$vec1, tr.op:$vec2, function)>;
|
| /freebsd-12.1/contrib/libucl/src/ |
| H A D | ucl_util.c | 3319 UCL_ARRAY_GET (vec2, o2);
3325 it2 = kv_A (*vec2, i);
|
| /freebsd-12.1/contrib/gcc/doc/ |
| H A D | rtl.texi | 2270 @item (vec_merge:@var{m} @var{vec1} @var{vec2} @var{items})
2273 @var{vec2}. Which elements are selected is described by @var{items}, which
2275 corresponding element in the result vector is taken from @var{vec2} while
2286 @item (vec_concat:@var{m} @var{vec1} @var{vec2})
2288 vectors @var{vec1} and @var{vec2}; its length is the sum of the lengths of
|