Searched refs:DEF_VEC_ALLOC_P (Results 1 - 18 of 18) sorted by relevance

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-armeabi-2011.09/lib/gcc/arm-none-eabi/4.6.1/plugin/include/
H A Dvecir.h29 DEF_VEC_ALLOC_P(tree,gc);
30 DEF_VEC_ALLOC_P(tree,heap);
34 DEF_VEC_ALLOC_P(gimple,heap);
35 DEF_VEC_ALLOC_P(gimple,gc);
40 DEF_VEC_ALLOC_P(gimple_p,heap);
44 DEF_VEC_ALLOC_P(gimple_seq,gc);
45 DEF_VEC_ALLOC_P(gimple_seq,heap);
49 DEF_VEC_ALLOC_P(rtx,heap);
50 DEF_VEC_ALLOC_P(rtx,gc);
H A Dipa-ref.h66 DEF_VEC_ALLOC_P(ipa_ref_ptr,heap);
H A Dcgraph.h178 DEF_VEC_ALLOC_P(ipa_replace_map_p,gc);
306 DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
307 DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
320 DEF_VEC_ALLOC_P(varpool_node_ptr,heap);
321 DEF_VEC_ALLOC_P(varpool_node_ptr,gc);
334 DEF_VEC_ALLOC_P(cgraph_node_set,gc);
335 DEF_VEC_ALLOC_P(cgraph_node_set,heap);
340 DEF_VEC_ALLOC_P(varpool_node_set,gc);
341 DEF_VEC_ALLOC_P(varpool_node_set,heap);
456 DEF_VEC_ALLOC_P(cgraph_edge_
[all...]
H A Dexcept.h193 DEF_VEC_ALLOC_P(eh_region, gc);
194 DEF_VEC_ALLOC_P(eh_region, heap);
197 DEF_VEC_ALLOC_P(eh_landing_pad, gc);
H A Dfunction.h146 DEF_VEC_ALLOC_P(call_site_record, gc);
175 DEF_VEC_ALLOC_P(temp_slot_p,gc);
180 DEF_VEC_ALLOC_P(ipa_opt_pass,heap);
H A Dbasic-block.h65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
195 DEF_VEC_ALLOC_P(basic_block,gc);
196 DEF_VEC_ALLOC_P(basic_block,heap);
H A Dcfgloop.h89 DEF_VEC_ALLOC_P (loop_p, heap);
90 DEF_VEC_ALLOC_P (loop_p, gc);
H A Dvec.h120 DEF_VEC_ALLOC_P(tree,gc); // gc'd vector of tree pointers. This must
573 #define DEF_VEC_ALLOC_P(T,A) \ macro
1320 little differently. Instead of DEF_VEC_ALLOC_P(TYPE, heap|gc), use
H A Dgimple.h42 DEF_VEC_ALLOC_P (gimple_vec, heap);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-arm-linux-2.6.36-uclibc-4.5.3/lib/gcc/arm-brcm-linux-uclibcgnueabi/4.5.3/plugin/include/
H A Dcgraph.h169 DEF_VEC_ALLOC_P(ipa_replace_map_p,gc);
271 DEF_VEC_ALLOC_P(cgraph_node_ptr,heap);
272 DEF_VEC_ALLOC_P(cgraph_node_ptr,gc);
286 DEF_VEC_ALLOC_P(cgraph_node_set,gc);
287 DEF_VEC_ALLOC_P(cgraph_node_set,heap);
353 DEF_VEC_ALLOC_P(cgraph_edge_p,heap);
H A Dexcept.h185 DEF_VEC_ALLOC_P(eh_region, gc);
186 DEF_VEC_ALLOC_P(eh_region, heap);
189 DEF_VEC_ALLOC_P(eh_landing_pad, gc);
H A Dfunction.h144 DEF_VEC_ALLOC_P(call_site_record, gc);
173 DEF_VEC_ALLOC_P(temp_slot_p,gc);
178 DEF_VEC_ALLOC_P(ipa_opt_pass,heap);
H A Dcfgloop.h86 DEF_VEC_ALLOC_P (loop_p, heap);
87 DEF_VEC_ALLOC_P (loop_p, gc);
H A Dbasic-block.h151 DEF_VEC_ALLOC_P(edge,gc);
152 DEF_VEC_ALLOC_P(edge,heap);
282 DEF_VEC_ALLOC_P(basic_block,gc);
283 DEF_VEC_ALLOC_P(basic_block,heap);
H A Dgimple.h34 DEF_VEC_ALLOC_P(gimple,heap);
35 DEF_VEC_ALLOC_P(gimple,gc);
39 DEF_VEC_ALLOC_P(gimple_p,heap);
42 DEF_VEC_ALLOC_P(gimple_seq,gc);
43 DEF_VEC_ALLOC_P(gimple_seq,heap);
49 DEF_VEC_ALLOC_P (gimple_vec, heap);
H A Drtl.h202 DEF_VEC_ALLOC_P(rtx,heap);
203 DEF_VEC_ALLOC_P(rtx,gc);
H A Dvec.h118 DEF_VEC_ALLOC_P(tree,gc); // gc'd vector of tree pointers. This must
526 #define DEF_VEC_ALLOC_P(T,A) \ macro
1208 little differently. Instead of DEF_VEC_ALLOC_P(TYPE, heap|gc), use
H A Dtree.h183 DEF_VEC_ALLOC_P(tree,gc);
184 DEF_VEC_ALLOC_P(tree,heap);

Completed in 285 milliseconds