Home
last modified time | relevance | path

Searched refs:VEC (Results 1 – 25 of 126) sorted by relevance

123456

/openbsd/gnu/gcc/gcc/
H A Dvec.h436 #define VEC_ASSERT_FAIL(OP,VEC) vec_assert_fail (OP,#VEC VEC_CHECK_PASS) argument
444 #define VEC(T,A) VEC_##T##_##A macro
447 #define VEC(T,A) VEC_ T _ A macro
460 } VEC(T,B)
468 } VEC(T,B)
474 VEC(T,B) base; \
475 } VEC(T,A)
715 (VEC(T,A) **vec_) \
722 static inline VEC(T,A) *VEC_OP (T,A,copy) (VEC(T,base) *vec_ MEM_STAT_DECL) \
989 static inline VEC(T,A) *VEC_OP (T,A,copy) (VEC(T,base) *vec_ MEM_STAT_DECL) \
[all …]
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;
273 VEC (data_reference_p, heap) **);
275 VEC (data_reference_p, heap) **,
276 VEC (ddr_p, heap) **);
281 extern void dump_ddrs (FILE *, VEC (ddr_p, heap) *);
[all …]
H A Dtree-vn.c52 VEC (tree, gc) *vuses;
194 static VEC (tree, gc) * in VEC() function
199 VEC (tree, gc) *vuses = NULL; in VEC()
211 static VEC (tree, gc) *shared_lookup_vuses; in VEC() function
217 static VEC (tree, gc) *
252 vn_add_with_vuses (tree expr, tree val, VEC (tree, gc) *vuses) in vn_add_with_vuses()
291 vn_lookup_with_vuses (tree expr, VEC (tree, gc) *vuses) in vn_lookup_with_vuses()
330 print_creation_to_file (tree v, tree expr, VEC (tree, gc) *vuses) in print_creation_to_file()
365 VEC(tree,gc) *vuses; in vn_lookup_or_add()
387 sort_vuses (VEC (tree,gc) *vuses) in sort_vuses()
[all …]
H A Dtree-loop-linear.c92 gather_interchange_stats (VEC (ddr_p, heap) *dependence_relations, in gather_interchange_stats()
93 VEC (data_reference_p, heap) *datarefs, in gather_interchange_stats()
170 VEC (ddr_p, heap) *dependence_relations, in try_interchange_loops()
171 VEC (data_reference_p, heap) *datarefs, in try_interchange_loops()
246 VEC(tree,heap) *oldivs = NULL; in linear_transform_loops()
247 VEC(tree,heap) *invariants = NULL; in linear_transform_loops()
252 VEC (ddr_p, heap) *dependence_relations; in linear_transform_loops()
253 VEC (data_reference_p, heap) *datarefs; in linear_transform_loops()
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);
416 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \ argument
418 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
433 extern GTY(()) VEC(tree,gc) *ssa_names;
864 VEC(tree, heap) **, tree (*) (tree, tree));
923 void sort_vuses (VEC (tree, gc) *);
927 void vn_add_with_vuses (tree, tree, VEC (tree, gc) *);
929 tree vn_lookup_with_vuses (tree, VEC (tree, gc) *);
[all …]
H A Dgenextract.c78 VEC(locstr,heap) *oplocs;
79 VEC(locstr,heap) *duplocs;
80 VEC(int,heap) *dupnums;
81 VEC(char,heap) *pathstr;
187 VEC_safe_set_locstr (VEC(locstr,heap) **vp, unsigned int ix, char *str) in VEC_safe_set_locstr()
205 VEC_char_to_string (VEC(char,heap) *v) in VEC_char_to_string()
H A Dlambda-code.c120 VEC(tree,heap) *, VEC(int,heap) *,
121 VEC(tree,heap) *);
1216 VEC(int,heap) ** steps) in gcc_loop_to_lambda_loop()
1472 VEC(int,heap) *steps = NULL; in gcc_loopnest_to_lambda_loopnest()
1808 VEC(tree,heap) *old_ivs, in lambda_loopnest_to_gcc_loopnest()
1809 VEC(tree,heap) *invariants, in lambda_loopnest_to_gcc_loopnest()
2444 VEC(tree,heap) *lbounds, in perfect_nestify()
2445 VEC(tree,heap) *ubounds, in perfect_nestify()
2446 VEC(int,heap) *steps, in perfect_nestify()
2447 VEC(tree,heap) *loopivs) in perfect_nestify()
[all …]
H A Dtree-ssa-reassoc.c365 add_to_ops_vec (VEC(operand_entry_t, heap) **ops, tree op) in add_to_ops_vec()
413 VEC (operand_entry_t, heap) **ops, in eliminate_duplicate_pair()
491 VEC (operand_entry_t, heap) **ops, in eliminate_plus_minus_pair()
548 VEC (operand_entry_t, heap) **ops, in eliminate_not_pairs()
617 VEC(operand_entry_t, heap) **ops) in eliminate_using_constants()
736 VEC (operand_entry_t, heap) **ops) in optimize_ops_list()
840 VEC(operand_entry_t, heap) * ops) in rewrite_expr_tree()
1013 static VEC(tree, heap) *broken_up_subtracts; in VEC() function
1332 VEC(operand_entry_t, heap) *ops = NULL; in reassociate_bb()
1380 void debug_ops_vector (VEC (operand_entry_t, heap) *ops);
[all …]
H A Ddomwalk.h101 VEC(void_p,heap) *block_data_stack;
111 VEC(void_p,heap) *free_block_data;
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-alias.c158 VEC (int, heap) **worklist2) in init_transitive_clobber_worklist()
179 VEC (int, heap) **worklist2, in add_to_worklist()
194 VEC (int, heap) **worklist2) in mark_aliases_call_clobbered()
197 VEC (tree, gc) *ma; in mark_aliases_call_clobbered()
227 VEC (tree, heap) *taglist = NULL; in compute_tag_properties()
266 VEC (tree, gc) *ma; in compute_tag_properties()
411 VEC(int,heap) *worklist2 = NULL; in compute_call_clobbered()
454 VEC (tree, heap) *calls = NULL; in recalculate_used_alone()
1576 VEC(tree,gc) *aliases; in group_aliases()
2603 VEC(tree, gc) *aliases; in dump_may_aliases_for()
[all …]
H A Dtree-ssa-threadedge.c117 remove_temporary_equivalences (VEC(tree, heap) **stack) in remove_temporary_equivalences()
140 record_temporary_equivalence (tree x, tree y, VEC(tree, heap) **stack) in record_temporary_equivalence()
163 record_temporary_equivalences_from_phis (edge e, VEC(tree, heap) **stack) in record_temporary_equivalences_from_phis()
213 VEC(tree, heap) **stack, in record_temporary_equivalences_from_stmts_at_dest()
497 VEC(tree, heap) **stack, in thread_across_edge()
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;
659 VEC(edge,gc) **container;
662 static inline VEC(edge,gc) * in VEC() function
674 ei_start_1 (VEC(edge,gc) **ev) in ei_start_1()
687 ei_last_1 (VEC(edge,gc) **ev) in ei_last_1()
H A Dlambda.h201 VEC(tree,heap) **,
202 VEC(tree,heap) **);
204 VEC(tree,heap) *, VEC(tree,heap) *,
H A Dtree-vect-analyze.c57 static void vect_mark_relevant (VEC(tree,heap) **, tree, bool, bool);
682 VEC (ddr_p, heap) *ddrs = LOOP_VINFO_DDRS (loop_vinfo); in vect_analyze_data_ref_dependences()
815 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_compute_data_refs_alignment()
841 VEC(dr_p,heap) *same_align_drs; in vect_update_misalignment_for_peel()
885 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_verify_datarefs_alignment()
1008 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_enhance_data_refs_alignment()
1203 VEC(tree,heap) *may_misalign_stmts in vect_enhance_data_refs_alignment()
1295 VEC (data_reference_p, heap) *datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_analyze_data_ref_accesses()
1332 VEC (data_reference_p, heap) *datarefs; in vect_analyze_data_refs()
1425 vect_mark_relevant (VEC(tree,heap) **worklist, tree stmt, in vect_mark_relevant()
[all …]
H A Dtree-data-ref.c602 VEC (ddr_p, heap) *ddrs) in dump_data_dependence_relations()
884 dump_ddrs (FILE *file, VEC (ddr_p, heap) *ddrs) in dump_ddrs()
963 VEC(tree,heap) **access_fns, in analyze_array_indexes()
1015 VEC(tree,heap) *acc_fns; in analyze_array()
1136 VEC(tree,heap) *acc_fns; in init_data_ref()
2190 VEC (loop_p, heap) *loop_nest) in initialize_data_dependence_relation()
4066 VEC (ddr_p, heap) **dependence_relations, in compute_all_dependences()
4067 VEC (loop_p, heap) *loop_nest, in compute_all_dependences()
4384 VEC (data_reference_p, heap) *datarefs =
4386 VEC (ddr_p, heap) *dependence_relations =
[all …]
H A Dtree-ssa-structalias.c281 static VEC(varinfo_t,heap) *varmap; in VEC() function
476 VEC(constraint_t,heap) **complex;
686 VEC(constraint_t,heap) **from) in constraint_set_union()
1106 VEC(unsigned,heap) *scc_stack;
1272 VEC(unsigned,heap) *topo_order;
1993 VEC(unsigned,heap) *queue = NULL; in eliminate_indirect_cycles()
3277 VEC (ce_s, heap) *temp = NULL; in handle_ptr_arith()
3336 VEC(ce_s, heap) *lhsc = NULL; in find_func_aliases()
3337 VEC(ce_s, heap) *rhsc = NULL; in find_func_aliases()
4022 VEC(ce_s, heap) *rhsc = NULL; in find_global_initializers()
[all …]
H A Dsbitmap.h169 #define sbitmap_vector_free(VEC) free(VEC) argument
H A Dtree-ssa-pre.c364 VEC (tree, gc) *vuses;
994 static VEC(tree, gc) * in VEC() function
998 VEC(tree, gc) *result = NULL; in VEC()
1080 VEC (tree, gc) *tvuses; in phi_translate()
1165 VEC (tree, gc) * oldvuses = NULL; in phi_translate()
1166 VEC (tree, gc) * newvuses = NULL; in phi_translate()
1190 VEC (tree, gc) * oldvuses = NULL; in phi_translate()
1191 VEC (tree, gc) * newvuses = NULL; in phi_translate()
1395 VEC (tree, gc) *vuses; in phi_translate_set()
1837 VEC (tree, heap) *phis = NULL; in compute_vuse_representatives()
[all …]
/openbsd/gnu/gcc/gcc/config/alpha/
H A Dunicosmk.h342 #define ASM_OUTPUT_ADDR_VEC(LAB,VEC) \ argument
343 unicosmk_defer_case_vector ((LAB),(VEC))
345 #define ASM_OUTPUT_ADDR_DIFF_VEC(LAB,VEC) gcc_unreachable () argument
/openbsd/gnu/usr.bin/gcc/gcc/config/alpha/
H A Dunicosmk.h439 #define ASM_OUTPUT_ADDR_VEC(LAB,VEC) \ argument
440 unicosmk_defer_case_vector ((LAB),(VEC))
442 #define ASM_OUTPUT_ADDR_DIFF_VEC(LAB,VEC) abort () argument
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dsbitmap.h117 #define sbitmap_vector_free(VEC) free(VEC) argument
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.law/
H A Dcode-gen5.C17 typedef double VEC ; typedef
38 VEC *vec;
/openbsd/regress/lib/libcrypto/x509/bettertls/certificates/
H A D1128.crt15 jfqbKDOzZ2B+8bEkrfzJILxoFAOs5hW2q0WsB2waOJmNul/Md9DUg6VoM/sP/VEC
/openbsd/gnu/gcc/gcc/cp/
H A Dname-lookup.h192 VEC(tree,gc) *static_decls;
206 VEC(cp_class_binding,gc) *class_shadowed;

123456