Home
last modified time | relevance | path

Searched refs:VEC_free (Results 1 – 25 of 49) sorted by relevance

12

/openbsd/gnu/gcc/gcc/
H A Dgenextract.c176 VEC_free (locstr,heap, acc.oplocs); in gen_insn()
177 VEC_free (locstr,heap, acc.duplocs); in gen_insn()
178 VEC_free (int,heap, acc.dupnums); in gen_insn()
179 VEC_free (char,heap, acc.pathstr); in gen_insn()
H A Ddomwalk.c286 VEC_free (void_p, heap, walk_data->free_block_data); in fini_walk_dominator_tree()
287 VEC_free (void_p, heap, walk_data->block_data_stack); in fini_walk_dominator_tree()
H A Dtree-ssa-reassoc.c462 VEC_free (operand_entry_t, heap, *ops); in eliminate_duplicate_pair()
598 VEC_free (operand_entry_t, heap, *ops); in eliminate_not_pairs()
636 VEC_free (operand_entry_t, heap, *ops); in eliminate_using_constants()
664 VEC_free (operand_entry_t, heap, *ops); in eliminate_using_constants()
691 VEC_free (operand_entry_t, heap, *ops); in eliminate_using_constants()
1369 VEC_free (operand_entry_t, heap, ops); in reassociate_bb()
1488 VEC_free (tree, heap, broken_up_subtracts); in fini_reassoc()
H A Dtree-loop-linear.c354 VEC_free (tree, heap, oldivs); in linear_transform_loops()
355 VEC_free (tree, heap, invariants); in linear_transform_loops()
H A Dtree-data-ref.h147 VEC_free (tree, heap, (DR)->object_info.access_fns); \
149 VEC_free (tree, heap, (DR)->first_location.access_fns); \
H A Dtree-ssa-structalias.c2935 VEC_free (ce_s, heap, lhsc); in do_structure_copy()
2936 VEC_free (ce_s, heap, rhsc); in do_structure_copy()
3321 VEC_free (ce_s, heap, temp); in handle_ptr_arith()
3573 VEC_free (ce_s, heap, rhsc); in find_func_aliases()
3574 VEC_free (ce_s, heap, lhsc); in find_func_aliases()
4034 VEC_free (ce_s, heap, rhsc); in find_global_initializers()
4726 VEC_free (ce_s, heap, rhsc); in find_escape_constraints()
4740 VEC_free (ce_s, heap, rhsc); in find_escape_constraints()
4761 VEC_free (ce_s, heap, rhsc); in find_escape_constraints()
4793 VEC_free (ce_s, heap, rhsc); in find_escape_constraints()
[all …]
H A Dtree-ssa-alias.c305 VEC_free (tree, heap, taglist); in compute_tag_properties()
423 VEC_free (tree, heap, worklist); in compute_call_clobbered()
424 VEC_free (int, heap, worklist2); in compute_call_clobbered()
538 VEC_free (tree, heap, calls); in recalculate_used_alone()
965 VEC_free (tree, heap, ai->processed_ptrs); in delete_alias_info()
1107 VEC_free (tree, heap, with_ptvars); in create_name_tags()
1799 VEC_free (tree, heap, varvec); in setup_pointers_and_addressables()
3064 VEC_free (fieldoff_s, heap, fieldstack); in create_overlap_variables_for()
3125 VEC_free (fieldoff_s, heap, fieldstack); in create_overlap_variables_for()
3291 VEC_free (tree, heap, varvec); in create_structure_vars()
H A Dtree-ssa-uncprop.c338 VEC_free (tree, heap, elt->equivalences); in equiv_free()
429 VEC_free (tree, heap, equiv_stack); in tree_ssa_uncprop()
H A Dtree-ssa-propagate.c514 VEC_free (tree, gc, interesting_ssa_edges); in ssa_prop_fini()
515 VEC_free (tree, gc, varying_ssa_edges); in ssa_prop_fini()
516 VEC_free (basic_block, heap, cfg_blocks); in ssa_prop_fini()
H A Dtree-ssanames.c100 VEC_free (tree, gc, ssa_names); in fini_ssanames()
H A Dgenautomata.c3249 VEC_free (alt_state_t,heap, alt_states); in uniq_sort_alt_states()
5284 VEC_free (ainsn_t,heap, last_insns); in form_ainsn_with_same_reservs()
5399 VEC_free (state_t,heap, state_stack); in make_automaton()
5565 VEC_free (state_t,heap, state_stack); in NDFA_to_DFA()
5786 VEC_free (state_t,heap, *to); in copy_equiv_class()
6023 VEC_free (state_t,heap, equiv_classes); in minimize_DFA()
7019 VEC_free (vect_el_t,heap, translate_vect); in output_translate_vect()
7382 VEC_free (state_t,heap, output_states_vect); in output_trans_table()
7383 VEC_free (vect_el_t,heap, transition_vect); in output_trans_table()
7581 VEC_free (vect_el_t,heap, dead_lock_vect); in output_dead_lock_vect()
[all …]
H A Dtree-outof-ssa.c249 VEC_free (int, heap, g->stack); in delete_elim_graph()
250 VEC_free (int, heap, g->edge_list); in delete_elim_graph()
251 VEC_free (tree, heap, g->const_copies); in delete_elim_graph()
252 VEC_free (tree, heap, g->nodes); in delete_elim_graph()
2073 VEC_free (edge, heap, edge_leader); in fini_analyze_edges_for_bb()
2074 VEC_free (tree, heap, stmt_list); in fini_analyze_edges_for_bb()
H A Dlambda-code.c1515 VEC_free (lambda_loop, heap, loops); in gcc_loopnest_to_lambda_loopnest()
1516 VEC_free (tree, heap, uboundvars); in gcc_loopnest_to_lambda_loopnest()
1517 VEC_free (tree, heap, lboundvars); in gcc_loopnest_to_lambda_loopnest()
1518 VEC_free (int, heap, steps); in gcc_loopnest_to_lambda_loopnest()
1788 VEC_free (tree, heap, results); in lle_to_gcc_expression()
1971 VEC_free (tree, heap, new_ivs); in lambda_loopnest_to_gcc_loopnest()
2498 VEC_free (tree, heap, phis); in perfect_nestify()
H A Dtree-ssa-operands.c272 VEC_free (tree, heap, build_defs); in fini_ssa_operands()
273 VEC_free (tree, heap, build_uses); in fini_ssa_operands()
274 VEC_free (tree, heap, build_v_must_defs); in fini_ssa_operands()
275 VEC_free (tree, heap, build_v_may_defs); in fini_ssa_operands()
276 VEC_free (tree, heap, build_vuses); in fini_ssa_operands()
H A Dtree-vn.c466 VEC_free (tree, gc, shared_lookup_vuses); in vn_delete()
H A Dtree-ssa.c605 VEC_free (bitmap, heap, pt_vars_for_reps); in verify_name_tags()
606 VEC_free (tree, heap, name_tag_reps); in verify_name_tags()
H A Dtree-into-ssa.c992 VEC_free (int, heap, worklist); in prune_unused_phi_nodes()
1053 VEC_free (int, heap, work_stack); in find_idf()
1984 VEC_free (tree, heap, block_defs_stack); in rewrite_blocks()
3149 VEC_free (tree, heap, phis); in update_ssa()
H A Dtree-ssa-threadupdate.c892 VEC_free (edge, heap, threaded_edges); in thread_through_all_blocks()
H A Dtree-ssa-dom.c358 VEC_free (tree, heap, avail_exprs_stack); in tree_ssa_dominator_optimize()
359 VEC_free (tree, heap, const_and_copies_stack); in tree_ssa_dominator_optimize()
360 VEC_free (tree, heap, stmts_to_rescan); in tree_ssa_dominator_optimize()
H A Dtree-ssa-live.c927 VEC_free (tree, heap, tpa->trees); in tpa_delete()
928 VEC_free (int, heap, tpa->first_partition); in tpa_delete()
1551 VEC_free (int, heap, tpa_to_clear); in build_tree_conflict_graph()
H A Dtree-ssa-pre.c1718 VEC_free (basic_block, heap, worklist); in compute_antic_aux()
1899 VEC_free (tree, heap, phis); in compute_vuse_representatives()
3728 VEC_free (tree, heap, worklist); in remove_dead_inserted_code()
3816 VEC_free (tree, heap, inserted_exprs); in fini_pre()
3817 VEC_free (tree, heap, need_creation); in fini_pre()
H A Dglobal.c2293 VEC_free (int, heap, earlyclobber_regclass); in calculate_local_reg_bb_info()
2401 VEC_free (basic_block, heap, new_bbs); in calculate_reg_pav()
2402 VEC_free (basic_block, heap, bbs); in calculate_reg_pav()
H A Dtree-vectorizer.c1493 VEC_free (dr_p, heap, STMT_VINFO_SAME_ALIGN_REFS (stmt_info)); in destroy_loop_vec_info()
1508 VEC_free (tree, heap, LOOP_VINFO_MAY_MISALIGN_STMTS (loop_vinfo)); in destroy_loop_vec_info()
H A Dtree-vect-analyze.c1690 VEC_free (tree, heap, worklist); in vect_mark_stmts_to_be_vectorized()
1717 VEC_free (tree, heap, worklist); in vect_mark_stmts_to_be_vectorized()
/openbsd/gnu/gcc/gcc/config/mt/
H A Dmt.c2008 VEC_free (loop_work, heap, works); in mt_reorg_loops()
2131 VEC_free (loop_info, heap, loop->loops); in mt_reorg_loops()
2132 VEC_free (basic_block, heap, loop->blocks); in mt_reorg_loops()

12