Searched refs:VEC (Results 1 - 25 of 98) sorted by relevance

1234

/freebsd-9.3-release/contrib/gcc/
H A Dtree-data-ref.h53 VEC(tree,heap) *access_fns;
63 VEC(tree,heap) *access_fns;
230 VEC (subscript_p, heap) *subscripts;
233 VEC (loop_p, heap) *loop_nest;
236 VEC (lambda_vector, heap) *dir_vects;
239 VEC (lambda_vector, heap) *dist_vects;
274 VEC (data_reference_p, heap) **);
276 VEC (data_reference_p, heap) **,
277 VEC (ddr_p, heap) **);
279 extern void print_dir_vectors (FILE *, VEC (lambda_vecto
[all...]
H A Dvec.h100 VEC(TYPEDEF,ALLOC) macro. The ALLOC argument specifies the
122 VEC(tree,gc) *v; // A (pointer to) a vector of tree pointers.
143 unsigned VEC_T_length(const VEC(T) *v);
152 int VEC_T_empty(const VEC(T) *v);
160 T VEC_T_last(VEC(T) *v); // Integer
161 T VEC_T_last(VEC(T) *v); // Pointer
162 T *VEC_T_last(VEC(T) *v); // Object
169 T VEC_T_index(VEC(T) *v, unsigned ix); // Integer
170 T VEC_T_index(VEC(T) *v, unsigned ix); // Pointer
171 T *VEC_T_index(VEC(
444 #define VEC macro
447 #define VEC macro
[all...]
H A Ddomwalk.h101 VEC(void_p,heap) *block_data_stack;
111 VEC(void_p,heap) *free_block_data;
H A Dtree-vn.c52 VEC (tree, gc) *vuses;
191 /* Copy the virtual uses from STMT into a newly allocated VEC(tree),
192 and return the VEC(tree). */
194 static VEC (tree, gc) * function
199 VEC (tree, gc) *vuses = NULL;
211 static VEC (tree, gc) *shared_lookup_vuses;
217 static VEC (tree, gc) * function
252 vn_add_with_vuses (tree expr, tree val, VEC (tree, gc) *vuses)
291 vn_lookup_with_vuses (tree expr, VEC (tree, gc) *vuses)
330 print_creation_to_file (tree v, tree expr, VEC (tre
387 sort_vuses (VEC (tree,gc) *vuses) function
[all...]
H A Dtree-loop-linear.c92 gather_interchange_stats (VEC (ddr_p, heap) *dependence_relations, function
93 VEC (data_reference_p, heap) *datarefs,
170 VEC (ddr_p, heap) *dependence_relations,
171 VEC (data_reference_p, heap) *datarefs,
246 VEC(tree,heap) *oldivs = NULL;
247 VEC(tree,heap) *invariants = NULL;
252 VEC (ddr_p, heap) *dependence_relations;
253 VEC (data_reference_p, heap) *datarefs;
H A Dvalue-prof.h67 typedef VEC(histogram_value,heap) *histogram_values;
H A Dtree-flow.h194 VEC(tree, gc) *may_aliases;
329 extern GTY(()) VEC(tree,gc) *modified_noreturn_calls;
351 static inline VEC(tree, gc) *may_aliases (tree);
411 requires a temporary vector of trees, VEC, whose lifetime is controlled by
416 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \
417 for ((ITER).i = 0, fill_referenced_var_vec (&(VEC)); \
418 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
433 extern GTY(()) VEC(tree,gc) *ssa_names;
708 extern void register_new_def (tree, VEC(tree,heap) **);
866 VEC(tre
[all...]
H A Dgenextract.c78 VEC(locstr,heap) *oplocs;
79 VEC(locstr,heap) *duplocs;
80 VEC(int,heap) *dupnums;
81 VEC(char,heap) *pathstr;
183 /* Helper subroutine of walk_rtx: given a VEC(locstr), an index, and a
188 VEC_safe_set_locstr (VEC(locstr,heap) **vp, unsigned int ix, char *str)
203 /* Another helper subroutine of walk_rtx: given a VEC(char), convert it
206 VEC_char_to_string (VEC(char,heap) *v)
187 VEC_safe_set_locstr (VEC(locstr,heap) **vp, unsigned int ix, char *str) function
H A Dtree-ssa-structalias.h40 VEC(tree,heap) *processed_ptrs;
H A Dtree-vectorizer.h125 VEC (data_reference_p, heap) *datarefs;
128 VEC (ddr_p, heap) *ddrs;
132 VEC(tree,heap) *may_misalign_stmts;
224 VEC(dr_p,heap) *same_align_refs;
H A Dtree-ssa-threadedge.c117 remove_temporary_equivalences (VEC(tree, heap) **stack) function
140 record_temporary_equivalence (tree x, tree y, VEC(tree, heap) **stack)
163 record_temporary_equivalences_from_phis (edge e, VEC(tree, heap) **stack)
213 VEC(tree, heap) **stack,
497 VEC(tree, heap) **stack,
H A Dtree-ssa-reassoc.c365 add_to_ops_vec (VEC(operand_entry_t, heap) **ops, tree op) function
413 VEC (operand_entry_t, heap) **ops,
491 VEC (operand_entry_t, heap) **ops,
548 VEC (operand_entry_t, heap) **ops,
617 VEC(operand_entry_t, heap) **ops)
736 VEC (operand_entry_t, heap) **ops)
840 VEC(operand_entry_t, heap) * ops)
1013 static VEC(tree, heap) *broken_up_subtracts;
1116 linearize_expr_tree (VEC(operand_entry_t, heap) **ops, tree stmt) function
1332 VEC(operand_entry_
1400 debug_ops_vector (VEC (operand_entry_t, heap) *ops) function
[all...]
H A Dlambda.h201 VEC(tree,heap) **,
202 VEC(tree,heap) **);
204 VEC(tree,heap) *, VEC(tree,heap) *,
369 /* Print out a vector VEC of length N to OUTFILE. */
H A Dlambda-code.c119 struct loop *, VEC(tree,heap) *,
120 VEC(tree,heap) *, VEC(int,heap) *,
121 VEC(tree,heap) *);
1115 VEC(tree,heap) *outerinductionvars,
1116 VEC(tree,heap) *invariants, int extra)
1211 VEC(tree,heap) ** invariants,
1213 VEC(tree,heap) * outerinductionvars,
1214 VEC(tree,heap) ** lboundvars,
1215 VEC(tre
[all...]
H A Dregs.h73 extern VEC(reg_info_p,heap) *reg_n_info;
H A Dtree-ssa-alias.c157 init_transitive_clobber_worklist (VEC (tree, heap) **worklist, function
158 VEC (int, heap) **worklist2)
178 add_to_worklist (tree alias, VEC (tree, heap) **worklist,
179 VEC (int, heap) **worklist2,
193 mark_aliases_call_clobbered (tree tag, VEC (tree, heap) **worklist,
194 VEC (int, heap) **worklist2)
197 VEC (tree, gc) *ma;
227 VEC (tree, heap) *taglist = NULL;
266 VEC (tree, gc) *ma;
410 VEC (tre
[all...]
H A Dtree-vect-analyze.c58 static void vect_mark_relevant (VEC(tree,heap) **, tree, bool, bool);
683 VEC (ddr_p, heap) *ddrs = LOOP_VINFO_DDRS (loop_vinfo);
816 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo);
842 VEC(dr_p,heap) *same_align_drs;
886 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo);
1060 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo);
1258 VEC(tree,heap) *may_misalign_stmts
1350 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo);
1387 VEC (data_reference_p, heap) *datarefs;
1480 vect_mark_relevant (VEC(tre function
[all...]
H A Dbasic-block.h220 VEC(edge,gc) *preds;
221 VEC(edge,gc) *succs;
370 VEC(basic_block,gc) *x_basic_block_info;
383 VEC(basic_block,gc) *x_label_to_block_map;
660 VEC(edge,gc) **container;
663 static inline VEC(edge,gc) *
675 ei_start_1 (VEC(edge,gc) **ev)
688 ei_last_1 (VEC(edge,gc) **ev)
H A Dfunction.h286 VEC(temp_slot_p,gc) *x_used_temp_slots;
345 VEC(tree,gc) *ib_boundaries_block;
H A Dsbitmap.h169 #define sbitmap_vector_free(VEC) free(VEC)
H A Dtree-ssa-structalias.c281 static VEC(varinfo_t,heap) *varmap;
411 static void get_constraint_for (tree, VEC(ce_s, heap) **);
412 static void do_deref (VEC (ce_s, heap) **);
428 static VEC(constraint_t,heap) *constraints;
476 VEC(constraint_t,heap) **complex;
661 /* Find a constraint LOOKFOR in the sorted constraint vector VEC */
664 constraint_vec_find (VEC(constraint_t,heap) *vec, function
685 constraint_set_union (VEC(constraint_t,heap) **to, function
686 VEC(constraint_t,heap) **from)
784 VEC (constraint_
2479 do_deref (VEC (ce_s, heap) **constraints) function
3271 handle_ptr_arith (VEC (ce_s, heap) *lhsc, tree expr) function
3662 sort_fieldstack (VEC(fieldoff_s,heap) *fieldstack) function
3985 check_for_overlaps (VEC (fieldoff_s,heap) *fieldstack) function
[all...]
H A Dcgraph.h320 VEC(cgraph_edge_p,heap)*,
H A Dreload.h158 extern GTY (()) VEC(rtx,gc) *reg_equiv_memory_loc_vec;
H A Dtree-data-ref.c590 dump_data_references (FILE *file, VEC (data_reference_p, heap) *datarefs)
603 VEC (ddr_p, heap) *ddrs)
723 print_dir_vectors (FILE *outf, VEC (lambda_vector, heap) *dir_vects,
736 print_dist_vectors (FILE *outf, VEC (lambda_vector, heap) *dist_vects,
855 dump_dist_dir_vectors (FILE *file, VEC (ddr_p, heap) *ddrs)
885 dump_ddrs (FILE *file, VEC (ddr_p, heap) *ddrs)
965 VEC(tree,heap) **access_fns,
1017 VEC(tree,heap) *acc_fns;
1138 VEC(tree,heap) *acc_fns;
2193 VEC (loop_
4065 compute_all_dependences (VEC (data_reference_p, heap) *datarefs, function
4460 free_dependence_relations (VEC (ddr_p, heap) *dependence_relations) function
4486 free_data_refs (VEC (data_reference_p, heap) *datarefs) function
[all...]
/freebsd-9.3-release/contrib/gcc/cp/
H A Dname-lookup.h194 VEC(tree,gc) *static_decls;
208 VEC(cp_class_binding,gc) *class_shadowed;

Completed in 280 milliseconds

1234