| /openbsd/usr.bin/dig/lib/isc/ |
| H A D | heap.c | 53 ! heap->compare(heap->array[(i)], \
76 heap = malloc(sizeof(*heap)); in isc_heap_create()
133 heap->array[i] = heap->array[p]; in float_up()
135 (heap->index)(heap->array[i], i); in float_up()
139 (heap->index)(heap->array[i], i); in float_up()
157 heap->array[i] = heap->array[j]; in sink_down()
159 (heap->index)(heap->array[i], i); in sink_down()
164 (heap->index)(heap->array[i], i); in sink_down()
194 heap->array[heap->last] = NULL; in isc_heap_delete()
197 elt = heap->array[heap->last]; in isc_heap_delete()
[all …]
|
| H A D | timer.c | 55 isc_heap_t * heap; member
95 isc_heap_increased(manager->heap, timer->index); in schedule()
97 isc_heap_decreased(manager->heap, timer->index); in schedule()
102 result = isc_heap_insert(manager->heap, timer); in schedule()
132 isc_heap_delete(manager->heap, timer->index); in deschedule()
319 timer = isc_heap_element(manager->heap, 1); in dispatch()
362 isc_heap_delete(manager->heap, 1); in dispatch()
426 manager->heap = NULL; in isc_timermgr_create()
427 result = isc_heap_create(sooner, set_index, 0, &manager->heap); in isc_timermgr_create()
467 isc_heap_destroy(&manager->heap); in isc_timermgr_destroy()
|
| /openbsd/gnu/lib/libiberty/src/ |
| H A D | fibheap.c | 114 if (heap->min == NULL || node->key < heap->min->key) in fibheap_insert()
115 heap->min = node; in fibheap_insert()
117 heap->nodes++; in fibheap_insert()
229 if (fibheap_compare (heap, node, heap->min) <= 0) in fibheap_replace_key_data()
230 heap->min = node; in fibheap_replace_key_data()
271 free (heap); in fibheap_delete()
301 heap->nodes--; in fibheap_extr_min_node()
305 heap->min = NULL; in fibheap_extr_min_node()
383 heap->min = NULL; in fibheap_consolidate()
388 if (heap->min == NULL || fibheap_compare (heap, a[i], heap->min) < 0) in fibheap_consolidate()
[all …]
|
| /openbsd/gnu/usr.bin/perl/cpan/Compress-Raw-Bzip2/bzip2-src/ |
| H A D | huffman.c | 36 zz = z; tmp = heap[zz]; \
37 while (weight[tmp] < weight[heap[zz >> 1]]) { \
38 heap[zz] = heap[zz >> 1]; \
52 weight[heap[yy+1]] < weight[heap[yy]]) \
55 heap[zz] = heap[yy]; \
75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local
87 heap[0] = 0; in BZ2_hbMakeCodeLengths()
94 heap[nHeap] = i; in BZ2_hbMakeCodeLengths()
101 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
[all …]
|
| /openbsd/gnu/gcc/gcc/ |
| H A D | tree-data-ref.h | 53 VEC(tree,heap) *access_fns;
63 VEC(tree,heap) *access_fns;
112 DEF_VEC_ALLOC_P (data_reference_p, heap);
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_vects;
239 VEC (lambda_vector, heap) *dist_vects;
244 DEF_VEC_ALLOC_P(ddr_p,heap);
[all …]
|
| H A D | genextract.c | 74 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;
176 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()
197 VEC_safe_push (locstr, heap, *vp, 0); in VEC_safe_set_locstr()
[all …]
|
| H A D | tree-loop-linear.c | 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()
293 datarefs = VEC_alloc (data_reference_p, heap, 10); in linear_transform_loops()
294 dependence_relations = VEC_alloc (ddr_p, heap, 10 * 10); in linear_transform_loops()
354 VEC_free (tree, heap, oldivs); in linear_transform_loops()
[all …]
|
| H A D | ipa-inline.c | 490 fibheap_t heap) in lookup_recursive_calls() argument
500 fibheap_insert (heap, in lookup_recursive_calls()
578 fibheap_t heap; in cgraph_decide_recursive_inlining() local
594 heap = fibheap_new (); in cgraph_decide_recursive_inlining()
596 if (fibheap_empty (heap)) in cgraph_decide_recursive_inlining()
598 fibheap_delete (heap); in cgraph_decide_recursive_inlining()
615 while (!fibheap_empty (heap) in cgraph_decide_recursive_inlining()
668 if (!fibheap_empty (heap) && dump_file) in cgraph_decide_recursive_inlining()
671 fibheap_delete (heap); in cgraph_decide_recursive_inlining()
722 fibheap_t heap = fibheap_new (); in cgraph_decide_inlining_of_small_functions() local
[all …]
|
| H A D | tree-ssa-reassoc.c | 317 DEF_VEC_ALLOC_P(operand_entry_t, heap);
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()
598 VEC_free (operand_entry_t, heap, *ops); in eliminate_not_pairs()
617 VEC(operand_entry_t, heap) **ops) in eliminate_using_constants()
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()
736 VEC (operand_entry_t, heap) **ops) in optimize_ops_list()
[all …]
|
| H A D | tree-ssa-structalias.c | 277 DEF_VEC_ALLOC_P(varinfo_t, heap);
410 DEF_VEC_ALLOC_O(ce_s, heap);
433 DEF_VEC_ALLOC_I(int, heap);
1094 DEF_VEC_ALLOC_I(unsigned,heap);
2935 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()
4022 VEC(ce_s, heap) *rhsc = NULL; in find_global_initializers()
[all …]
|
| H A D | lambda-code.c | 120 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()
1518 VEC_free (int, heap, steps); in gcc_loopnest_to_lambda_loopnest()
1808 VEC(tree,heap) *old_ivs, 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 D | tracer.c | 207 fibheap_t heap = fibheap_new (); in tail_duplicate() local
225 blocks[bb->index] = fibheap_insert (heap, -bb->frequency, in tail_duplicate()
241 && !fibheap_empty (heap)) in tail_duplicate()
243 basic_block bb = fibheap_extract_min (heap); in tail_duplicate()
261 fibheap_delete_node (heap, blocks[bb->index]); in tail_duplicate()
271 fibheap_delete_node (heap, blocks[bb2->index]); in tail_duplicate()
290 fibheap_insert (heap, -old->frequency, old); in tail_duplicate()
314 fibheap_delete (heap); in tail_duplicate()
|
| /openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.dg/init/ |
| H A D | array16.C | 76 char heap[5000000]; variable
80 for (unsigned ix = sizeof (heap); ix--;) in main()
81 heap[ix] = ix; in main()
85 foo *f = new (heap) foo (); in main()
96 for (unsigned ix = sizeof (heap); ix--;) in main()
97 heap[ix] = ix; in main()
100 foo *f = new (heap) foo (); in main()
|
| H A D | array15.C | 32 char heap[5000000]; variable
36 for (unsigned ix = sizeof (heap); ix--;) in main()
37 heap[ix] = ix; in main()
39 foo *f = new (heap) foo (); in main()
|
| /openbsd/regress/sys/kern/fork-exit/ |
| H A D | Makefile | 57 REGRESS_TARGETS += run-fork1-heap
58 run-fork1-heap: ${PROG}
62 REGRESS_TARGETS += run-fork-heap
63 run-fork-heap: ${PROG}
67 REGRESS_TARGETS += run-fork1-thread1-heap
68 run-fork1-thread1-heap: ${PROG}
72 REGRESS_TARGETS += run-fork-thread-heap
73 run-fork-thread-heap: ${PROG}
|
| /openbsd/usr.bin/dig/lib/isc/include/isc/ |
| H A D | heap.h | 91 isc_heap_insert(isc_heap_t *heap, void *elt);
100 isc_heap_delete(isc_heap_t *heap, unsigned int index);
111 isc_heap_increased(isc_heap_t *heap, unsigned int index);
123 isc_heap_decreased(isc_heap_t *heap, unsigned int index);
135 isc_heap_element(isc_heap_t *heap, unsigned int index);
|
| /openbsd/lib/libcrypto/ec/ |
| H A D | ecp_smpl.c | 1063 heap = reallocarray(NULL, pow2, sizeof heap[0]); in ec_GFp_simple_points_make_affine()
1080 heap[0] = NULL; in ec_GFp_simple_points_make_affine()
1082 heap[i] = NULL; in ec_GFp_simple_points_make_affine()
1096 if (!bn_copy(heap[i], heap[2 * i])) in ec_GFp_simple_points_make_affine()
1100 if (!bn_copy(heap[i], heap[2 * i + 1])) in ec_GFp_simple_points_make_affine()
1104 heap[2 * i], heap[2 * i + 1], ctx)) in ec_GFp_simple_points_make_affine()
1125 if (!group->meth->field_encode(group, heap[1], heap[1], ctx)) in ec_GFp_simple_points_make_affine()
1127 if (!group->meth->field_encode(group, heap[1], heap[1], ctx)) in ec_GFp_simple_points_make_affine()
1133 if ((heap[i + 1] != NULL) && !BN_is_zero(heap[i + 1])) { in ec_GFp_simple_points_make_affine()
1143 if (!bn_copy(heap[i], heap[i / 2])) in ec_GFp_simple_points_make_affine()
[all …]
|
| /openbsd/gnu/usr.bin/binutils/gdb/testsuite/gdb.base/ |
| H A D | bigcore.exp | 92 set heap ""
100 set heap [concat $heap $expect_out(1,string)]
213 proc check_heap { dir heap } { argument
221 -re " = \\(struct list \\*\\) [lindex $heap $lim].*$gdb_prompt $" {
222 if { $lim >= [llength $heap] } {
231 fail "$test (address [lindex $heap $lim])"
|
| /openbsd/usr.bin/netstat/ |
| H A D | route.c | 206 } *heap; in getdefault() local
209 heap = calloc(1, AT_HEAPSIZE(table.at_bits)); in getdefault()
212 node = heap[1].node.ref; in getdefault()
214 free(heap); in getdefault()
227 } *heap; in p_table() local
231 heap = calloc(1, AT_HEAPSIZE(table.at_bits)); in p_table()
236 next = heap[i >> 1].node.ref; in p_table()
237 node = heap[i].node.ref; in p_table()
244 next = heap[i >> 1].node.ref; in p_table()
245 node = heap[i].node.ref; in p_table()
[all …]
|
| /openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
| H A D | nest15.C | 17 Pointer(const BDDHeap& heap);
34 BDDHeap::Pointer::Pointer(const BDDHeap& heap): in Pointer() argument
35 page(heap.half[heap.halfspace].inuse.top), in Pointer()
|
| H A D | nest16.C | 17 Pointer(const BDDHeap& heap);
34 BDDHeap::Pointer::Pointer(const BDDHeap& heap): in Pointer() argument
38 Page *x = heap.half[heap.halfspace].inuse.top; in Pointer()
|
| H A D | template8.C | 16 Double_alignt<20000> heap; in main() local
18 printf(" &heap.array[0] = %d, &heap.for_alignt = %d\n", &heap.array[0], &heap.for_alignt); in main()
|
| /openbsd/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | 930411-1.c | 1 int heap; variable
13 i2 = heap - 8; in f()
16 heap -= 8; in f()
|
| /openbsd/gnu/usr.bin/gcc/gcc/ |
| H A D | tracer.c | 207 fibheap_t heap = fibheap_new (); in tail_duplicate() local
225 blocks[bb->index] = fibheap_insert (heap, -bb->frequency, in tail_duplicate()
241 && !fibheap_empty (heap)) in tail_duplicate()
243 basic_block bb = fibheap_extract_min (heap); in tail_duplicate()
262 fibheap_delete_node (heap, blocks[bb->index]); in tail_duplicate()
272 fibheap_delete_node (heap, blocks[bb2->index]); in tail_duplicate()
291 fibheap_insert (heap, -old->frequency, old); in tail_duplicate()
315 fibheap_delete (heap); in tail_duplicate()
|
| /openbsd/gnu/llvm/libcxxabi/src/ |
| H A D | fallback_malloc.cpp | 62 char heap[HEAP_SIZE] __attribute__((aligned)); variable
90 (heap_node*)(&heap[HEAP_SIZE]); // one past the end of the heap
94 return (heap_node*)(heap + (offset * sizeof(heap_node))); in node_from_offset()
99 static_cast<size_t>(reinterpret_cast<const char*>(ptr) - heap) / in offset_from_node()
108 heap_node* node = (heap_node*)heap; in getFirstAlignedNodeInHeap()
128 return ptr >= heap && ptr < (heap + HEAP_SIZE); in is_fallback_ptr()
|