Searched refs:vec1 (Results 1 - 3 of 3) sorted by relevance
| /freebsd-11.0-release/contrib/gcc/ |
| H A D | lambda.h | 236 lambda_vector_mult_const (lambda_vector vec1, lambda_vector vec2, argument
245 vec2[i] = const1 * vec1[i];
251 lambda_vector_negate (lambda_vector vec1, lambda_vector vec2, argument
254 lambda_vector_mult_const (vec1, vec2, size, -1);
260 lambda_vector_add (lambda_vector vec1, lambda_vector vec2, argument
265 vec3[i] = vec1[i] + vec2[i];
271 lambda_vector_add_mc (lambda_vector vec1, int const1, argument
277 vec3[i] = const1 * vec1[i] + const2 * vec2[i];
283 lambda_vector_copy (lambda_vector vec1, lambda_vector vec2, argument
286 memcpy (vec2, vec1, siz
292 lambda_vector_zerop(lambda_vector vec1, int size) argument
304 lambda_vector_clear(lambda_vector vec1, int size) argument
312 lambda_vector_equal(lambda_vector vec1, lambda_vector vec2, int size) argument
325 lambda_vector_min_nz(lambda_vector vec1, int n, int start) argument
346 lambda_vector_first_nz(lambda_vector vec1, int n, int start) argument
[all...] |
| /freebsd-11.0-release/contrib/gcc/cp/ |
| H A D | tree.c | 1557 tree vec1, vec2;
1561 vec1 = TREE_OPERAND (t1, 1);
1564 if (!vec1 || !vec2)
1565 return !vec1 && !vec2;
1567 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1570 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1571 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1550 tree vec1, vec2; local
|
| /freebsd-11.0-release/contrib/libucl/src/ |
| H A D | ucl_util.c | 3270 UCL_ARRAY_GET (vec1, o1);
3275 for (i = 0; i < vec1->n; i ++) {
3276 it1 = kv_A (*vec1, i);
|
Completed in 181 milliseconds