| /src/external/gpl3/binutils/dist/gprofng/src/ |
| BaseMetricTreeNode.h | 57 void get_nearest_registered_descendents (Vector<BaseMetricTreeNode*> *new_vec);
58 void get_all_registered_descendents (Vector<BaseMetricTreeNode*> *new_vec);
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| BaseMetricTreeNode.h | 57 void get_nearest_registered_descendents (Vector<BaseMetricTreeNode*> *new_vec);
58 void get_all_registered_descendents (Vector<BaseMetricTreeNode*> *new_vec);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| gensupport.cc | 588 rtvec new_vec = rtvec_alloc (1);
590 RTVEC_ELT (new_vec, 0) = replace_operands_with_dups (x);
591 return new_vec;
1926 rtvec new_vec;
2014 new_vec = rtvec_alloc (num_elem + 1);
2016 RTVEC_ELT (new_vec, i) = RTVEC_ELT (vec, i);
2029 RTVEC_ELT (new_vec, i) = set;
2030 XVEC (insn, 4) = new_vec;
2920 rtvec new_vec;
2998 new_vec = rtvec_alloc (vec_len + 1)
585 rtvec new_vec = rtvec_alloc (1); local
1922 rtvec new_vec; local
2915 rtvec new_vec; local
[all...] |
| vec.h | 996 vec<T, A, vl_embed> *new_vec = NULL;
1000 vec_alloc (new_vec, len PASS_MEM_STAT);
1001 new_vec->embedded_init (len, len);
1002 vec_copy_construct (new_vec->address (), address (), len);
1004 return new_vec;
1937 vec<T, va_heap, vl_ptr> new_vec{ };
1939 new_vec.m_vec = m_vec->copy (ALONE_PASS_MEM_STAT);
1940 return new_vec;
|
| tree-vect-loop.cc | 9573 tree new_vec = build_vector_from_val (vectype, t); local
9575 new_vec, vectype, NULL);
9958 tree new_vec, vec_init, vec_step, t; local
10521 new_vec = build_vector_from_val (step_vectype, t);
10523 new_vec, step_vectype, step_iv_si);
10591 new_vec = build_vector_from_val (step_vectype, t);
10593 new_vec, step_vectype, NULL);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gensupport.cc | 545 rtvec new_vec = rtvec_alloc (1);
547 RTVEC_ELT (new_vec, 0) = replace_operands_with_dups (x);
548 return new_vec;
1382 rtvec new_vec;
1470 new_vec = rtvec_alloc (num_elem + 1);
1472 RTVEC_ELT (new_vec, i) = RTVEC_ELT (vec, i);
1485 RTVEC_ELT (new_vec, i) = set;
1486 XVEC (insn, 4) = new_vec;
2376 rtvec new_vec;
2454 new_vec = rtvec_alloc (vec_len + 1)
542 rtvec new_vec = rtvec_alloc (1); local
1378 rtvec new_vec; local
2371 rtvec new_vec; local
[all...] |
| vec.h | 975 vec<T, A, vl_embed> *new_vec = NULL;
979 vec_alloc (new_vec, len PASS_MEM_STAT);
980 new_vec->embedded_init (len, len);
981 vec_copy_construct (new_vec->address (), m_vecdata, len);
983 return new_vec;
1822 vec<T, va_heap, vl_ptr> new_vec{ };
1824 new_vec.m_vec = m_vec->copy (ALONE_PASS_MEM_STAT);
1825 return new_vec;
|
| tree-vect-loop.cc | 8112 tree new_vec, vec_init, vec_step, t; local
8643 new_vec = build_vector_from_val (step_vectype, t);
8645 new_vec, step_vectype, NULL);
8711 new_vec = build_vector_from_val (step_vectype, t);
8713 new_vec, step_vectype, NULL);
|
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| tree.cc | 3791 vec<tree, va_gc> *new_vec = NULL;
3792 vec_alloc (new_vec, len + 1);
3798 new_vec->quick_push (elt);
3799 new_vec->quick_push ((*old_vec)[i]);
3802 new_vec->quick_push (elt);
3804 return new_vec;
3785 vec<tree, va_gc> *new_vec = NULL; local
|
| name-lookup.cc | 257 tree new_vec = make_binding_vec (name, want); local
258 BINDING_VECTOR_NUM_CLUSTERS (new_vec) = want;
259 binding_cluster *cluster = BINDING_VECTOR_CLUSTER_BASE (new_vec);
309 *slot = new_vec;
353 tree new_vec = make_binding_vec (name, want); local
354 BINDING_VECTOR_NUM_CLUSTERS (new_vec) = have + 1;
355 memcpy (BINDING_VECTOR_CLUSTER_BASE (new_vec),
358 *slot = new_vec;
|
| pt.cc | 13566 tree new_vec = make_tree_vec (len);
13573 TREE_VEC_ELT (new_vec, i) = elt;
13576 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec)
13579 return new_vec;
13712 tree new_vec = make_tree_vec (TREE_VEC_LENGTH (parms));
13714 for (int i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
13721 TREE_VEC_ELT (new_vec, i) =
13725 return new_vec;
13752 tree new_vec = tsubst_template_parms_level (TREE_VALUE (parms),
13757 new_vec, NULL_TREE)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| name-lookup.cc | 257 tree new_vec = make_binding_vec (name, want); local
258 BINDING_VECTOR_NUM_CLUSTERS (new_vec) = want;
259 binding_cluster *cluster = BINDING_VECTOR_CLUSTER_BASE (new_vec);
309 *slot = new_vec;
353 tree new_vec = make_binding_vec (name, want); local
354 BINDING_VECTOR_NUM_CLUSTERS (new_vec) = have + 1;
355 BINDING_VECTOR_GLOBAL_DUPS_P (new_vec)
357 BINDING_VECTOR_PARTITION_DUPS_P (new_vec)
359 memcpy (BINDING_VECTOR_CLUSTER_BASE (new_vec),
362 *slot = new_vec;
[all...] |
| tree.cc | 3815 vec<tree, va_gc> *new_vec = NULL;
3816 vec_alloc (new_vec, len + 1);
3822 new_vec->quick_push (elt);
3823 new_vec->quick_push ((*old_vec)[i]);
3826 new_vec->quick_push (elt);
3828 return new_vec;
3809 vec<tree, va_gc> *new_vec = NULL; local
|
| pt.cc | 13879 tree new_vec = make_tree_vec (len);
13886 TREE_VEC_ELT (new_vec, i) = elt;
13889 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec)
13892 return new_vec;
14086 tree new_vec = make_tree_vec (TREE_VEC_LENGTH (parms));
14088 for (int i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
14095 TREE_VEC_ELT (new_vec, i) =
14099 return new_vec;
14126 tree new_vec = tsubst_template_parms_level (TREE_VALUE (parms),
14131 new_vec, NULL_TREE)
13878 tree new_vec = make_tree_vec (len); local
14125 tree new_vec = tsubst_template_parms_level (TREE_VALUE (parms), local
30126 tree new_vec = TREE_VALUE (tparms) = make_tree_vec (flen + clen); local
[all...] |
| /src/external/apache2/mDNSResponder/dist/ServiceRegistration/ |
| srp-mdns-proxy.c | 254 type ## _vec_t *new_vec; \
257 new_vec = type ## _vec_create(vec->num); \
258 if (new_vec != NULL) { \
261 new_vec->vec[i] = vec->vec[i]; \
262 RETAIN_HERE(new_vec->vec[i], type); \
265 new_vec->num = vec->num; \
267 return new_vec; \
|
