Searched refs:heap (Results 76 - 100 of 151) sorted by relevance

1234567

/freebsd-11.0-release/contrib/sendmail/libsm/
H A Ddebug.c31 #include <sm/heap.h>
281 ** F:sm.heap -- out of memory.
342 ** F:sm.heap -- out of memory
H A Dfopen.c20 #include <sm/heap.h>
97 ** Raises exception on heap exhaustion.
214 ** Raises an exception on heap exhaustion.
H A Dsem.c18 # include <sm/heap.h>
H A Dt-shm.c20 # include <sm/heap.h>
H A Dlocal.h27 #include <sm/heap.h>
H A Dstdio.c23 #include <sm/heap.h>
465 ** Raises an exception on heap exhaustion.
H A Dstrio.c24 #include <sm/heap.h>
H A Dt-qic.c16 #include <sm/heap.h>
H A Dt-sem.c19 # include <sm/heap.h>
H A Dt-strl.c16 #include <sm/heap.h>
/freebsd-11.0-release/contrib/gcc/
H A Dopts.c370 DEF_VEC_ALLOC_P(char_p,heap);
372 static VEC(char_p,heap) *flag_instrument_functions_exclude_functions;
373 static VEC(char_p,heap) *flag_instrument_functions_exclude_files;
625 add_instrument_functions_exclude_list (VEC(char_p,heap) **pvec,
646 VEC_safe_push (char_p, heap, *pvec, token_start);
658 VEC_safe_push (char_p, heap, *pvec, token_start);
H A Dtree-ssa-pre.c1709 VEC(basic_block, heap) * worklist;
1715 worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs));
1735 VEC_free (basic_block, heap, worklist);
1854 VEC (tree, heap) *phis = NULL;
1864 VEC_safe_push (tree, heap, phis, phi);
1916 VEC_free (tree, heap, phis);
2182 static VEC(tree,heap) *inserted_exprs;
2187 static VEC(tree, heap) *need_creation;
2424 VEC_safe_push (tree, heap, inserted_exprs, stmt);
2455 VEC_safe_push (tree, heap, inserted_expr
[all...]
H A Dtree-complex.c52 DEF_VEC_ALLOC_I(complex_lattice_t, heap);
54 static VEC(complex_lattice_t, heap) *complex_lattice_values;
61 static VEC(tree, heap) *complex_ssa_name_components;
1496 complex_lattice_values = VEC_alloc (complex_lattice_t, heap, num_ssa_names);
1497 VEC_safe_grow (complex_lattice_t, heap,
1508 complex_ssa_name_components = VEC_alloc (tree, heap, 2*num_ssa_names);
1509 VEC_safe_grow (tree, heap, complex_ssa_name_components, 2*num_ssa_names);
1529 VEC_free (tree, heap, complex_ssa_name_components);
1530 VEC_free (complex_lattice_t, heap, complex_lattice_values);
H A Dloop-invariant.c149 DEF_VEC_ALLOC_P(invariant_p, heap);
153 static VEC(invariant_p,heap) *invariants;
656 VEC_safe_push (invariant_p, heap, invariants, inv);
1252 invariants = VEC_alloc (invariant_p, heap, 100);
1287 VEC_free (invariant_p, heap, invariants);
H A Dtree-vectorizer.c1374 STMT_VINFO_SAME_ALIGN_REFS (res) = VEC_alloc (dr_p, heap, 5);
1426 LOOP_VINFO_DATAREFS (res) = VEC_alloc (data_reference_p, heap, 10);
1427 LOOP_VINFO_DDRS (res) = VEC_alloc (ddr_p, heap, 10 * 10);
1430 = VEC_alloc (tree, heap, PARAM_VALUE (PARAM_VECT_MAX_VERSION_CHECKS));
1494 VEC_free (dr_p, heap, STMT_VINFO_SAME_ALIGN_REFS (stmt_info));
1509 VEC_free (tree, heap, LOOP_VINFO_MAY_MISALIGN_STMTS (loop_vinfo));
H A Dglobal.c2149 static VEC(int,heap) *earlyclobber_regclass;
2296 earlyclobber_regclass = VEC_alloc (int, heap, N_REG_CLASSES);
2308 VEC_free (int, heap, earlyclobber_regclass);
2355 VEC(basic_block,heap) *bbs, *new_bbs, *temp;
2359 bbs = VEC_alloc (basic_block, heap, n_basic_blocks);
2360 new_bbs = VEC_alloc (basic_block, heap, n_basic_blocks);
2416 VEC_free (basic_block, heap, new_bbs);
2417 VEC_free (basic_block, heap, bbs);
H A Dtree-scalar-evolution.c999 VEC(tree,heap) **exit_conditions)
1013 VEC_safe_push (tree, heap, *exit_conditions, loop_condition);
1022 VEC(tree,heap) **exit_conditions)
2517 number_of_iterations_for_all_loops (VEC(tree,heap) **exit_conditions)
2670 analyze_scalar_evolution_for_all_loop_phi_nodes (VEC(tree,heap) **exit_conditions)
2857 VEC(tree,heap) *exit_conditions;
2859 exit_conditions = VEC_alloc (tree, heap, 37);
2866 VEC_free (tree, heap, exit_conditions);
H A Dtree-ssa-live.h341 VEC(tree,heap) *trees;
342 VEC(int,heap) *first_partition;
H A Dfunction.c134 static VEC(int,heap) *prologue;
135 static VEC(int,heap) *epilogue;
139 static VEC(int,heap) *sibcall_epilogue;
205 static void reorder_blocks_1 (rtx, tree, VEC(tree,heap) **);
211 static void record_insns (rtx, VEC(int,heap) **) ATTRIBUTE_UNUSED;
212 static int contains (rtx, VEC(int,heap) **);
322 VEC_free (int, heap, prologue);
323 VEC_free (int, heap, epilogue);
324 VEC_free (int, heap, sibcall_epilogue);
3600 VEC(tree,heap) *block_stac
[all...]
H A Dtoplev.c172 DEF_VEC_ALLOC_P(fs_p,heap);
173 static VEC(fs_p,heap) *input_file_stack_history;
1017 VEC_safe_push (fs_p, heap, input_file_stack_history, input_file_stack);
1037 VEC_safe_push (fs_p, heap, input_file_stack_history, input_file_stack);
/freebsd-11.0-release/contrib/apr-util/include/
H A Dapr_buckets.h189 * the heap (HEAP). For these buckets, apr_bucket_setaside_noop can
216 * apr_bucket structures are allocated on the malloc() heap and
541 * A bucket referring to data allocated off the heap.
562 /** The pool bucket must be able to be easily morphed to a heap
567 * regular heap bucket. (To avoid having to do many extra refcount
573 apr_bucket_heap heap; member in struct:apr_bucket_pool
582 * to pool_read() that the data is now on the heap and
583 * so it should morph the bucket into a regular heap
588 * needed in the cleanup phase in order to allocate space on the heap
635 apr_bucket_heap heap; /**< Hea member in union:apr_bucket_structs
[all...]
/freebsd-11.0-release/sys/libkern/
H A Dzlib.c308 /* maximum heap size */
460 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:deflate_state
461 int heap_len; /* number of elements in the heap */
463 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
464 * The same heap array is used to build all trees.
1930 * need for the L_CODES extra codes used during heap constructio
[all...]
/freebsd-11.0-release/lib/libc/isc/
H A Deventlib_p.h44 #include <isc/heap.h>
/freebsd-11.0-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Ddeflate.h46 /* maximum heap size */
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
204 int heap_len; /* number of elements in the heap */
206 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
207 * The same heap array is used to build all trees.
/freebsd-11.0-release/lib/libz/
H A Ddeflate.h46 /* maximum heap size */
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
207 int heap_len; /* number of elements in the heap */
209 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
210 * The same heap array is used to build all trees.

Completed in 132 milliseconds

1234567