/freebsd-11.0-release/contrib/gcc/ |
H A D | tree-ssa-threadupdate.c | 152 DEF_VEC_ALLOC_P(edge,heap); 153 static VEC(edge,heap) *threaded_edges; 892 VEC_free (edge, heap, threaded_edges); 909 threaded_edges = VEC_alloc (edge, heap, 10); 911 VEC_safe_push (edge, heap, threaded_edges, e); 912 VEC_safe_push (edge, heap, threaded_edges, e2);
|
H A D | tree-ssa-alias.c | 157 init_transitive_clobber_worklist (VEC (tree, heap) **worklist, 158 VEC (int, heap) **worklist2) 167 VEC_safe_push (tree, heap, *worklist, curr); 168 VEC_safe_push (int, heap, *worklist2, var_ann (curr)->escape_mask); 178 add_to_worklist (tree alias, VEC (tree, heap) **worklist, 179 VEC (int, heap) **worklist2, 184 VEC_safe_push (tree, heap, *worklist, alias); 185 VEC_safe_push (int, heap, *worklist2, reason); 193 mark_aliases_call_clobbered (tree tag, VEC (tree, heap) **worklist, 194 VEC (int, heap) **worklist [all...] |
H A D | genautomata.c | 209 DEF_VEC_ALLOC_P(alt_state_t,heap); 211 DEF_VEC_ALLOC_P(ainsn_t,heap); 213 DEF_VEC_ALLOC_P(state_t,heap); 215 DEF_VEC_ALLOC_P(decl_t,heap); 217 DEF_VEC_ALLOC_P(reserv_sets_t,heap); 220 DEF_VEC_ALLOC_I(vect_el_t, heap); 221 typedef VEC(vect_el_t,heap) *vla_hwint_t; 1135 static VEC(decl_t,heap) *decls; 1263 VEC_safe_push (decl_t,heap, decls, decl); 1291 VEC_safe_push (decl_t,heap, decl [all...] |
H A D | cgraph.h | 197 DEF_VEC_ALLOC_P(cgraph_edge_p,heap); 322 VEC(cgraph_edge_p,heap)*,
|
H A D | tree-data-ref.c | 590 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, 987 VEC_safe_push (tree, heap, *access_fns, access_fn); 1017 VEC(tree,heap) *acc_fns; 1031 acc_fns = VEC_alloc (tree, heap, [all...] |
H A D | cfglayout.c | 235 static VEC(int,heap) *block_locators_locs; 237 static VEC(int,heap) *line_locators_locs; 238 static VEC(int,heap) *line_locators_lines; 239 static VEC(int,heap) *file_locators_locs; 260 block_locators_locs = VEC_alloc (int, heap, 32); 262 line_locators_locs = VEC_alloc (int, heap, 32); 263 line_locators_lines = VEC_alloc (int, heap, 32); 264 file_locators_locs = VEC_alloc (int, heap, 32); 299 VEC_safe_push (int, heap, block_locators_locs, loc); 306 VEC_safe_push (int, heap, line_locators_loc [all...] |
H A D | tree-ssa-operands.c | 105 static VEC(tree,heap) *build_defs; 108 static VEC(tree,heap) *build_uses; 111 static VEC(tree,heap) *build_v_may_defs; 114 static VEC(tree,heap) *build_vuses; 117 static VEC(tree,heap) *build_v_must_defs; 182 operand_build_sort_virtual (VEC(tree,heap) *list) 253 build_defs = VEC_alloc (tree, heap, 5); 254 build_uses = VEC_alloc (tree, heap, 10); 255 build_vuses = VEC_alloc (tree, heap, 25); 256 build_v_may_defs = VEC_alloc (tree, heap, 2 [all...] |
H A D | tree-ssa-dom.c | 95 static VEC(tree,heap) *avail_exprs_stack; 104 static VEC(tree,heap) *stmts_to_rescan; 136 static VEC(tree,heap) *const_and_copies_stack; 249 avail_exprs_stack = VEC_alloc (tree, heap, 20); 250 const_and_copies_stack = VEC_alloc (tree, heap, 20); 251 stmts_to_rescan = VEC_alloc (tree, heap, 20); 358 VEC_free (tree, heap, avail_exprs_stack); 359 VEC_free (tree, heap, const_and_copies_stack); 360 VEC_free (tree, heap, stmts_to_rescan); 452 VEC_safe_push (tree, heap, avail_exprs_stac [all...] |
H A D | c-pragma.c | 599 DEF_VEC_ALLOC_I (visibility, heap); 600 static VEC (visibility, heap) *visstack; 608 VEC_safe_push (visibility, heap, visstack, 733 DEF_VEC_ALLOC_O (pragma_handler, heap); 735 static VEC(pragma_handler, heap) *registered_pragmas; 746 VEC_safe_push (pragma_handler, heap, registered_pragmas, &handler);
|
H A D | tree-flow.h | 708 extern void register_new_def (tree, VEC(tree,heap) **); 866 VEC(tree, heap) **, tree (*) (tree, tree)); 1024 DEF_VEC_ALLOC_O(fieldoff_s,heap); 1025 int push_fields_onto_fieldstack (tree, VEC(fieldoff_s,heap) **, 1027 void sort_fieldstack (VEC(fieldoff_s,heap) *);
|
H A D | tree-ssa-dce.c | 79 static VEC(tree,heap) *worklist; 244 VEC_safe_push (tree, heap, worklist, stmt); 272 VEC_safe_push (tree, heap, worklist, stmt); 849 worklist = VEC_alloc (tree, heap, 64); 872 VEC_free (tree, heap, worklist);
|
H A D | tree-ssa-propagate.c | 133 static VEC(basic_block,heap) *cfg_blocks; 201 VEC_safe_grow (basic_block, heap, cfg_blocks, 2 * cfg_blocks_tail); 497 cfg_blocks = VEC_alloc (basic_block, heap, 20); 498 VEC_safe_grow (basic_block, heap, cfg_blocks, 20); 532 VEC_free (basic_block, heap, cfg_blocks);
|
H A D | tree-ssa.c | 492 DEF_VEC_ALLOC_P (bitmap,heap); 511 VEC(tree,heap) *name_tag_reps = NULL; 512 VEC(bitmap,heap) *pt_vars_for_reps = NULL; 538 VEC_safe_push (tree, heap, name_tag_reps, ptr); 539 VEC_safe_push (bitmap, heap, pt_vars_for_reps, pi->pt_vars); 605 VEC_free (bitmap, heap, pt_vars_for_reps); 606 VEC_free (tree, heap, name_tag_reps);
|
H A D | tree-ssa-live.c | 884 tpa->trees = VEC_alloc (tree, heap, x); 885 tpa->first_partition = VEC_alloc (int, heap, x); 927 VEC_free (tree, heap, tpa->trees); 928 VEC_free (int, heap, tpa->first_partition); 1054 VEC_safe_push (tree, heap, rv->trees, t); 1055 VEC_safe_push (int, heap, rv->first_partition, p); 1124 VEC_safe_push (tree, heap, tv->trees, t); 1125 VEC_safe_push (int, heap, tv->first_partition, p); 1405 VEC(int,heap) *tpa_to_clear; 1420 tpa_to_clear = VEC_alloc (int, heap, 5 [all...] |
/freebsd-11.0-release/contrib/sendmail/include/sm/ |
H A D | rpool.h | 21 # include <sm/heap.h>
|
/freebsd-11.0-release/contrib/sendmail/libsm/ |
H A D | config.c | 15 #include <sm/heap.h>
|
H A D | fclose.c | 23 #include <sm/heap.h>
|
H A D | t-exc.c | 14 #include <sm/heap.h>
|
H A D | makebuf.c | 22 #include <sm/heap.h>
|
H A D | niprop.c | 21 #include <sm/heap.h>
|
H A D | setvbuf.c | 21 #include <sm/heap.h>
|
H A D | ungetc.c | 24 #include <sm/heap.h>
|
H A D | util.c | 17 #include <sm/heap.h>
|
/freebsd-11.0-release/lib/libsm/ |
H A D | Makefile | 25 SRCS+= assert.c debug.c errstring.c exc.c heap.c match.c rpool.c \
|
/freebsd-11.0-release/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_xar.c | 1192 struct heap_queue *heap, struct xar_file *file) 1198 if (heap->used >= heap->allocated) { 1200 int new_size = heap->allocated * 2; 1202 if (heap->allocated < 1024) 1205 if (new_size <= heap->allocated) { 1217 memcpy(new_pending_files, heap->files, 1218 heap->allocated * sizeof(new_pending_files[0])); 1219 if (heap->files != NULL) 1220 free(heap 1191 heap_add_entry(struct archive_read *a, struct heap_queue *heap, struct xar_file *file) argument 1248 heap_get_entry(struct heap_queue *heap) argument [all...] |