Searched refs:heap (Results 1 - 25 of 150) sorted by relevance

123456

/freebsd-9.3-release/contrib/gcc/
H A Dvecprim.h25 DEF_VEC_ALLOC_I(char,heap);
28 DEF_VEC_ALLOC_I(int,heap);
H A Ddomwalk.h24 DEF_VEC_ALLOC_P(void_p,heap);
101 VEC(void_p,heap) *block_data_stack;
111 VEC(void_p,heap) *free_block_data;
H A Dtree-data-ref.h53 VEC(tree,heap) *access_fns;
63 VEC(tree,heap) *access_fns;
112 DEF_VEC_ALLOC_P (data_reference_p, heap);
147 VEC_free (tree, heap, (DR)->object_info.access_fns); \
149 VEC_free (tree, heap, (DR)->first_location.access_fns); \
190 DEF_VEC_ALLOC_P (subscript_p, heap);
199 DEF_VEC_ALLOC_P (loop_p, heap);
230 VEC (subscript_p, heap) *subscripts;
233 VEC (loop_p, heap) *loop_nest;
236 VEC (lambda_vector, heap) *dir_vect
[all...]
H A Dgenextract.c74 DEF_VEC_ALLOC_P(locstr,heap);
78 VEC(locstr,heap) *oplocs;
79 VEC(locstr,heap) *duplocs;
80 VEC(int,heap) *dupnums;
81 VEC(char,heap) *pathstr;
96 acc.oplocs = VEC_alloc (locstr,heap, 10);
97 acc.duplocs = VEC_alloc (locstr,heap, 10);
98 acc.dupnums = VEC_alloc (int,heap, 10);
99 acc.pathstr = VEC_alloc (char,heap, 20);
109 VEC_safe_push (char,heap, ac
[all...]
H A Dvalue-prof.h65 DEF_VEC_ALLOC_P(histogram_value,heap);
67 typedef VEC(histogram_value,heap) *histogram_values;
H A Dtree-loop-linear.c92 gather_interchange_stats (VEC (ddr_p, heap) *dependence_relations,
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;
293 datarefs = VEC_alloc (data_reference_p, heap, 10);
294 dependence_relations = VEC_alloc (ddr_p, heap, 1
[all...]
H A Dipa-inline.c416 /* Recompute heap nodes for each of caller edge. */
419 update_caller_keys (fibheap_t heap, struct cgraph_node *node, argument
441 fibheap_delete_node (heap, edge->aux);
461 if (fibheap_replace_key (heap, n, badness))
463 fibheap_delete_node (heap, edge->aux);
465 edge->aux = fibheap_insert (heap, badness, edge);
469 /* Recompute heap nodes for each of caller edges of each of callees. */
472 update_callee_keys (fibheap_t heap, struct cgraph_node *node, argument
480 update_caller_keys (heap, e->callee, updated_nodes);
482 update_callee_keys (heap,
489 lookup_recursive_calls(struct cgraph_node *node, struct cgraph_node *where, fibheap_t heap) argument
578 fibheap_t heap; local
722 fibheap_t heap = fibheap_new (); local
[all...]
H A Dtree-ssa-reassoc.c317 DEF_VEC_ALLOC_P(operand_entry_t, heap);
365 add_to_ops_vec (VEC(operand_entry_t, heap) **ops, tree op)
371 VEC_safe_push (operand_entry_t, heap, *ops, oe);
413 VEC (operand_entry_t, heap) **ops,
462 VEC_free (operand_entry_t, heap, *ops);
491 VEC (operand_entry_t, heap) **ops,
548 VEC (operand_entry_t, heap) **ops,
598 VEC_free (operand_entry_t, heap, *ops);
600 VEC_safe_push (operand_entry_t, heap, *ops, oe);
617 VEC(operand_entry_t, heap) **op
[all...]
H A Ddomwalk.c183 VEC_safe_push (void_p, heap, walk_data->block_data_stack, bd);
259 VEC_safe_push (void_p, heap, walk_data->free_block_data, bd);
286 VEC_free (void_p, heap, walk_data->free_block_data);
287 VEC_free (void_p, heap, walk_data->block_data_stack);
/freebsd-9.3-release/contrib/bind9/lib/isc/
H A Dheap.c32 #include <isc/heap.h>
41 * element of the heap array is not used; i.e. heap subscripts are 1-based,
55 * When the heap is in a consistent state, the following invariant
60 ! heap->compare(heap->array[(i)], \
61 heap->array[heap_parent(i)]))
63 /*% ISC heap structure. */
80 isc_heap_t *heap; local
85 heap
108 isc_heap_t *heap; local
124 resize(isc_heap_t *heap) argument
146 float_up(isc_heap_t *heap, unsigned int i, void *elt) argument
164 sink_down(isc_heap_t *heap, unsigned int i, void *elt) argument
189 isc_heap_insert(isc_heap_t *heap, void *elt) argument
206 isc_heap_delete(isc_heap_t *heap, unsigned int index) argument
231 isc_heap_increased(isc_heap_t *heap, unsigned int index) argument
239 isc_heap_decreased(isc_heap_t *heap, unsigned int index) argument
247 isc_heap_element(isc_heap_t *heap, unsigned int index) argument
257 isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap) argument
[all...]
/freebsd-9.3-release/contrib/ntp/lib/isc/
H A Dheap.c32 #include <isc/heap.h>
41 * element of the heap array is not used; i.e. heap subscripts are 1-based,
55 * When the heap is in a consistent state, the following invariant
60 ! heap->compare(heap->array[(i)], \
61 heap->array[heap_parent(i)]))
63 /*% ISC heap structure. */
80 isc_heap_t *heap; local
85 heap
108 isc_heap_t *heap; local
124 resize(isc_heap_t *heap) argument
146 float_up(isc_heap_t *heap, unsigned int i, void *elt) argument
164 sink_down(isc_heap_t *heap, unsigned int i, void *elt) argument
189 isc_heap_insert(isc_heap_t *heap, void *elt) argument
206 isc_heap_delete(isc_heap_t *heap, unsigned int index) argument
231 isc_heap_increased(isc_heap_t *heap, unsigned int index) argument
239 isc_heap_decreased(isc_heap_t *heap, unsigned int index) argument
247 isc_heap_element(isc_heap_t *heap, unsigned int index) argument
257 isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap) argument
[all...]
/freebsd-9.3-release/contrib/ntp/sntp/libevent/test/
H A Dregress_minheap.c44 check_heap(struct min_heap *heap) argument
47 for (i = 1; i < heap->n; ++i) {
49 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
50 &heap->p[parent_idx]->ev_timeout, >=));
57 struct min_heap heap; local
62 min_heap_ctor_(&heap);
68 min_heap_push_(&heap, inserted[i]);
70 check_heap(&heap);
72 tt_assert(min_heap_size_(&heap) == 1024);
75 min_heap_erase_(&heap, inserte
[all...]
/freebsd-9.3-release/sys/dev/drm/
H A Dradeon_mem.c86 static struct mem_block *alloc_block(struct mem_block *heap, int size, argument
92 list_for_each(p, heap) {
101 static struct mem_block *find_block(struct mem_block *heap, int start) argument
105 list_for_each(p, heap)
117 * 'heap' to stop it being subsumed.
136 /* Initialize. How to check for an uninitialized heap?
138 static int init_heap(struct mem_block **heap, int start, int size) argument
145 *heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFS);
146 if (!*heap) {
164 radeon_mem_release(struct drm_file *file_priv, struct mem_block *heap) argument
192 radeon_mem_takedown(struct mem_block **heap) argument
227 struct mem_block *block, **heap; local
262 struct mem_block *block, **heap; local
288 struct mem_block **heap; local
[all...]
H A Di915_mem.c136 static struct mem_block *alloc_block(struct mem_block *heap, int size, argument
142 for (p = heap->next; p != heap; p = p->next) {
151 static struct mem_block *find_block(struct mem_block *heap, int start) argument
155 for (p = heap->next; p != heap; p = p->next)
167 * 'heap' to stop it being subsumed.
186 /* Initialize. How to check for an uninitialized heap?
188 static int init_heap(struct mem_block **heap, int start, int size) argument
195 *heap
214 i915_mem_release(struct drm_device * dev, struct drm_file *file_priv, struct mem_block *heap) argument
245 i915_mem_takedown(struct mem_block **heap) argument
279 struct mem_block *block, **heap; local
317 struct mem_block *block, **heap; local
345 struct mem_block **heap; local
369 struct mem_block **heap; local
[all...]
H A Dsis_ds.h89 struct mem_block_t *heap; member in struct:mem_block_t
98 /* a heap is just the first block in a chain */
118 * return: a heap pointer if OK, NULL if error
129 * startSearch = linear offset from start of heap to begin search
132 PMemBlock mmAllocMem(memHeap_t * heap, int size, int align2, int startSearch);
135 * Returns 1 if the block 'b' is part of the heap 'heap'
137 int mmBlockInHeap(PMemBlock heap, PMemBlock b);
H A Dsis_ds.c181 /* Checks if a pointer 'b' is part of the heap 'heap' */
182 int mmBlockInHeap(memHeap_t * heap, PMemBlock b) argument
186 if (heap == NULL || b == NULL)
189 p = heap;
237 PMemBlock mmAllocMem(memHeap_t * heap, int size, int align2, int startSearch) argument
242 if (heap == NULL || align2 < 0 || size <= 0)
247 p = (TMemBlock *) heap;
263 p->heap = heap;
[all...]
/freebsd-9.3-release/contrib/binutils/libiberty/
H A Dfibheap.c1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap
86 fibheap_comp_data(fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b) argument
98 fibheap_insert(fibheap_t heap, fibheapkey_t key, void *data) argument
124 fibheap_min(fibheap_t heap) argument
134 fibheap_min_key(fibheap_t heap) argument
178 fibheap_extract_min(fibheap_t heap) argument
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
237 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
244 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
253 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
266 fibheap_delete(fibheap_t heap) argument
276 fibheap_empty(fibheap_t heap) argument
283 fibheap_extr_min_node(fibheap_t heap) argument
319 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
338 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
348 fibheap_consolidate(fibheap_t heap) argument
409 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
419 fibheap_cascading_cut(fibheap_t heap, fibnode_t y) argument
[all...]
/freebsd-9.3-release/contrib/gcclibs/libiberty/
H A Dfibheap.c1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap
86 fibheap_comp_data(fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b) argument
98 fibheap_insert(fibheap_t heap, fibheapkey_t key, void *data) argument
124 fibheap_min(fibheap_t heap) argument
134 fibheap_min_key(fibheap_t heap) argument
178 fibheap_extract_min(fibheap_t heap) argument
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
237 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
244 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
253 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
266 fibheap_delete(fibheap_t heap) argument
276 fibheap_empty(fibheap_t heap) argument
283 fibheap_extr_min_node(fibheap_t heap) argument
319 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
338 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
348 fibheap_consolidate(fibheap_t heap) argument
409 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
419 fibheap_cascading_cut(fibheap_t heap, fibnode_t y) argument
[all...]
/freebsd-9.3-release/sys/dev/drm2/radeon/
H A Dradeon_mem.c85 static struct mem_block *alloc_block(struct mem_block *heap, int size, argument
91 list_for_each(p, heap) {
100 static struct mem_block *find_block(struct mem_block *heap, int start) argument
104 list_for_each(p, heap)
116 * 'heap' to stop it being subsumed.
135 /* Initialize. How to check for an uninitialized heap?
137 static int init_heap(struct mem_block **heap, int start, int size) argument
145 *heap = malloc(sizeof(**heap), DRM_MEM_DRIVER, M_ZERO | M_WAITOK);
146 if (!*heap) {
163 radeon_mem_release(struct drm_file *file_priv, struct mem_block *heap) argument
191 radeon_mem_takedown(struct mem_block **heap) argument
226 struct mem_block *block, **heap; local
261 struct mem_block *block, **heap; local
287 struct mem_block **heap; local
[all...]
/freebsd-9.3-release/contrib/bind9/lib/isc/include/isc/
H A Dheap.h18 /* $Id: heap.h,v 1.26 2009/01/17 23:47:43 tbox Exp $ */
23 /*! \file isc/heap.h */
37 * The index function allows the client of the heap to receive a callback
40 * from the heap require the index be provided.
45 * The heapaction function is used when iterating over the heap.
47 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
59 * \brief Create a new heap. The heap is implemented using a space-efficient
60 * storage method. When the heap elements are deleted space is not freed
73 * heap
[all...]
/freebsd-9.3-release/contrib/ntp/lib/isc/include/isc/
H A Dheap.h18 /* $Id: heap.h,v 1.26 2009/01/17 23:47:43 tbox Exp $ */
23 /*! \file isc/heap.h */
37 * The index function allows the client of the heap to receive a callback
40 * from the heap require the index be provided.
45 * The heapaction function is used when iterating over the heap.
47 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
59 * \brief Create a new heap. The heap is implemented using a space-efficient
60 * storage method. When the heap elements are deleted space is not freed
71 * heap
[all...]
/freebsd-9.3-release/contrib/bzip2/
H A Dhuffman.c36 zz = z; tmp = heap[zz]; \
37 while (weight[tmp] < weight[heap[zz >> 1]]) { \
38 heap[zz] = heap[zz >> 1]; \
41 heap[zz] = tmp; \
47 zz = z; tmp = heap[zz]; \
52 weight[heap[yy+1]] < weight[heap[yy]]) \
54 if (weight[tmp] < weight[heap[yy]]) break; \
55 heap[z
75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/freebsd-9.3-release/sys/boot/efi/libefi/
H A Dlibefi.c39 static EFI_PHYSICAL_ADDRESS heap; variable
77 BS->FreePages(heap, EFI_SIZE_TO_PAGES(heapsize));
97 EFI_SIZE_TO_PAGES(heapsize), &heap);
101 setheap((void *)(uintptr_t)heap, (void *)(uintptr_t)(heap + heapsize));
/freebsd-9.3-release/contrib/libarchive/libarchive/
H A Darchive_read_support_format_iso9660.c76 * add them to the heap; if it's a regular file, I return the
420 static void heap_add_entry(struct heap_queue *heap,
422 static struct file_info *heap_get_entry(struct heap_queue *heap);
1186 * this can only happen if this entry was added to the heap
2104 struct read_ce_queue *heap; local
2120 heap = &(iso9660->read_ce_req);
2121 if (heap->cnt >= heap->allocated) {
2124 if (heap->allocated < 16)
2127 new_size = heap
2164 next_CE(struct read_ce_queue *heap) argument
2209 struct read_ce_queue *heap; local
2815 heap_add_entry(struct heap_queue *heap, struct file_info *file, uint64_t key) argument
2863 heap_get_entry(struct heap_queue *heap) argument
[all...]
/freebsd-9.3-release/contrib/sendmail/libsm/
H A Dstringf.c15 #include <sm/heap.h>

Completed in 182 milliseconds

123456