Home
last modified time | relevance | path

Searched refs:heap (Results 1 – 25 of 128) sorted by relevance

123456

/freebsd/contrib/ntp/sntp/libevent/test/
H A Dregress_minheap.c44 check_heap(struct min_heap *heap) in check_heap() argument
47 for (i = 1; i < heap->n; ++i) { in check_heap()
49 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout, in check_heap()
50 &heap->p[parent_idx]->ev_timeout, >=)); in check_heap()
57 struct min_heap heap; in test_heap_randomized() local
62 min_heap_ctor_(&heap); in test_heap_randomized()
67 min_heap_push_(&heap, inserted[i]); in test_heap_randomized()
69 check_heap(&heap); in test_heap_randomized()
71 tt_assert(min_heap_size_(&heap) == 1024); in test_heap_randomized()
74 min_heap_erase_(&heap, inserted[i]); in test_heap_randomized()
[all …]
/freebsd/contrib/libevent/test/
H A Dregress_minheap.c44 check_heap(struct min_heap *heap) in check_heap() argument
47 for (i = 1; i < heap->n; ++i) { in check_heap()
49 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout, in check_heap()
50 &heap->p[parent_idx]->ev_timeout, >=)); in check_heap()
57 struct min_heap heap; in test_heap_randomized() local
62 min_heap_ctor_(&heap); in test_heap_randomized()
67 min_heap_push_(&heap, inserted[i]); in test_heap_randomized()
69 check_heap(&heap); in test_heap_randomized()
71 tt_assert(min_heap_size_(&heap) == 1024); in test_heap_randomized()
74 min_heap_erase_(&heap, inserted[i]); in test_heap_randomized()
[all …]
/freebsd/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[zz] = heap[yy]; \
58 heap[zz] = tmp; \
75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local
[all …]
/freebsd/crypto/openssl/doc/man3/
H A DOPENSSL_secure_malloc.pod11 CRYPTO_secure_used - secure heap storage
45 information might be stored, OpenSSL supports the concept of a "secure heap."
50 If a secure heap is used, then private key B<BIGNUM> values are stored there.
54 CRYPTO_secure_malloc_init() creates the secure heap, with the specified
56 allocate from the heap or zero to use a reasonable default value.
62 heap as been initialized and is available.
64 CRYPTO_secure_malloc_done() releases the heap and makes the memory unavailable
68 OPENSSL_secure_malloc() allocates C<num> bytes from the heap.
78 OPENSSL_secure_free() releases the memory at C<ptr> back to the heap.
90 the memory if it was not allocated from the secure heap.
[all …]
H A DPEM_bytes_read_bio.pod43 memory from the secure heap for its temporary buffers and the storage
49 PEM_bytes_read_bio_secmem() only enforces that the secure heap is used for
52 allocated from the secure heap. In cases where it is desirable to ensure
53 that the contents of the PEM file only appears in memory from the secure heap,
H A DBIO_ADDR.pod80 returned string has been allocated on the heap and must be freed
87 returned string has been allocated on the heap and must be freed
93 on the heap and must be freed with OPENSSL_free().
/freebsd/contrib/libarchive/libarchive/
H A Darchive_read_support_format_iso9660.c447 static int heap_add_entry(struct archive_read *a, struct heap_queue *heap,
449 static struct file_info *heap_get_entry(struct heap_queue *heap);
2369 struct read_ce_queue *heap; in register_CE() local
2389 heap = &(iso9660->read_ce_req); in register_CE()
2390 if (heap->cnt >= heap->allocated) { in register_CE()
2393 if (heap->allocated < 16) in register_CE()
2396 new_size = heap->allocated * 2; in register_CE()
2398 if (new_size <= heap->allocated) { in register_CE()
2407 if (heap->reqs != NULL) { in register_CE()
2408 memcpy(p, heap->reqs, heap->cnt * sizeof(*p)); in register_CE()
[all …]
H A Darchive_write_set_format_xar.c975 struct heap_data *heap) in xmlwrite_heap() argument
980 r = xmlwrite_fstring(a, writer, "length", "%ju", heap->length); in xmlwrite_heap()
983 r = xmlwrite_fstring(a, writer, "offset", "%ju", heap->temp_offset); in xmlwrite_heap()
986 r = xmlwrite_fstring(a, writer, "size", "%ju", heap->size); in xmlwrite_heap()
989 switch (heap->compression) { in xmlwrite_heap()
1005 r = xmlwrite_sum(a, writer, "archived-checksum", &(heap->a_sum)); in xmlwrite_heap()
1008 r = xmlwrite_sum(a, writer, "extracted-checksum", &(heap->e_sum)); in xmlwrite_heap()
1154 struct heap_data *heap; in make_file_entry() local
1432 for (heap = file->xattr.first; heap != NULL; heap = heap->next) { in make_file_entry()
1447 BAD_CAST("id"), "%d", heap->id); in make_file_entry()
[all …]
H A Darchive_read_support_format_xar.c1224 struct heap_queue *heap, struct xar_file *file) in heap_add_entry() argument
1230 if (heap->used >= heap->allocated) { in heap_add_entry()
1234 if (heap->allocated < 1024) in heap_add_entry()
1237 new_size = heap->allocated * 2; in heap_add_entry()
1239 if (new_size <= heap->allocated) { in heap_add_entry()
1251 if (heap->allocated) { in heap_add_entry()
1252 memcpy(new_pending_files, heap->files, in heap_add_entry()
1253 heap->allocated * sizeof(new_pending_files[0])); in heap_add_entry()
1254 free(heap->files); in heap_add_entry()
1256 heap->files = new_pending_files; in heap_add_entry()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/hwasan/
H A Dhwasan_report.cpp486 heap(CopyHeapChunk()), in BaseReport()
503 } heap; member
516 ArrayRef<HeapAllocation> heap; member
555 const HeapChunk heap; member in __hwasan::__anon865875d10511::BaseReport
710 result.heap.is_allocated = true; in FindBufferOverflowCandidate()
711 result.heap.begin = chunk.Beg(); in FindBufferOverflowCandidate()
712 result.heap.end = chunk.End(); in FindBufferOverflowCandidate()
713 result.heap.thread_id = chunk.GetAllocThreadId(); in FindBufferOverflowCandidate()
714 result.heap.stack_id = chunk.GetAllocStackId(); in FindBufferOverflowCandidate()
721 if (candidate.heap.is_allocated) { in PrintHeapOrGlobalCandidate()
[all …]
H A Dhwasan_flags.inc56 "The number of heap (de)allocations remembered per thread. "
57 "Affects the quality of heap-related reports, but not the ability "
/freebsd/lib/libc/tests/secure/
H A Dgenerate-fortify-tests.lua1077 local function generate_test_name(func, variant, disposition, heap)
1082 if heap then
1116 local function generate_stackframe(buftype, bufsize, disposition, heap, def)
1167 if not heap and buftype_elem then
1177 if heap then
1194 if heap then
1224 local function write_test(fh, func, disposition, heap, def)
1225 local testname = generate_test_name(func, def.variant, disposition, heap)
1230 if def.exclude and def.exclude(disposition, heap) then
1238 if heap then
[all …]
/freebsd/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dfsssp.c186 static inline uint32_t heap_smaller(binary_heap_t * heap, uint32_t i, in heap_smaller() argument
189 return (heap->nodes[i]->distance < heap->nodes[j]->distance) ? 1 : 0; in heap_smaller()
193 static void heap_exchange(binary_heap_t * heap, uint32_t i, uint32_t j) in heap_exchange() argument
199 tmp_heap_id = heap->nodes[i]->heap_id; in heap_exchange()
200 heap->nodes[i]->heap_id = heap->nodes[j]->heap_id; in heap_exchange()
201 heap->nodes[j]->heap_id = tmp_heap_id; in heap_exchange()
203 tmp_node = heap->nodes[i]; in heap_exchange()
204 heap->nodes[i] = heap->nodes[j]; in heap_exchange()
205 heap->nodes[j] = tmp_node; in heap_exchange()
209 static uint32_t heap_up(binary_heap_t * heap, uint32_t i) in heap_up() argument
[all …]
/freebsd/sys/contrib/zlib/
H A Dtrees.c488 top = s->heap[SMALLEST]; \
489 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
508 int v = s->heap[k]; in pqdownheap()
513 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) { in pqdownheap()
517 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
520 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
525 s->heap[k] = v; in pqdownheap()
557 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
560 n = s->heap[h]; in gen_bitlen()
601 m = s->heap[--h]; in gen_bitlen()
[all …]
/freebsd/stand/efi/loader/
H A Defi_main.c33 static EFI_PHYSICAL_ADDRESS heap; variable
41 BS->FreePages(heap, EFI_SIZE_TO_PAGES(heapsize)); in efi_exit()
98 EFI_SIZE_TO_PAGES(heapsize), &heap); in efi_main()
104 setheap((void *)(uintptr_t)heap, (void *)(uintptr_t)(heap + heapsize)); in efi_main()
/freebsd/stand/powerpc/ofw/
H A Dmain.c47 static char heap[HEAP_SIZE]; // In BSS, so uses no space variable
64 bzero(heap, HEAP_SIZE); in init_heap()
66 setheap(heap, (void *)((uintptr_t)heap + HEAP_SIZE)); in init_heap()
/freebsd/contrib/llvm-project/compiler-rt/lib/asan/
H A Dasan_descriptions.h200 HeapAddressDescription heap; member
225 return data.heap.addr; in Address()
241 return data.heap.Print();
257 return data.kind == kAddressKindHeap ? &data.heap : nullptr; in AsHeap()
H A Dasan_debugging.cpp102 } else if (auto heap = descr.AsHeap()) { in __asan_locate_address() local
104 region_address = heap->chunk_access.chunk_begin; in __asan_locate_address()
105 region_size = heap->chunk_access.chunk_size; in __asan_locate_address()
H A Dasan_flags.inc32 "Minimal size (in bytes) of redzones around heap objects. "
35 "Maximal size (in bytes) of redzones around heap objects.")
111 "Poison (or not) the heap memory on [de]allocation. Zero value is useful "
115 "(default=true). This flag affects heap and global buffers, but not "
136 "If true, ASan tweaks a bunch of other flags (quarantine, redzone, heap "
/freebsd/stand/efi/boot1/
H A Dboot1.c53 static EFI_PHYSICAL_ADDRESS heap; variable
189 EFI_SIZE_TO_PAGES(heapsize), &heap); in efi_main()
197 setheap((void *)(uintptr_t)heap, (void *)(uintptr_t)(heap + heapsize)); in efi_main()
295 BS->FreePages(heap, EFI_SIZE_TO_PAGES(heapsize)); in efi_exit()
/freebsd/stand/i386/loader/
H A Dhelp.i38611 heap
13 Requests debugging output from the heap manager. For debugging use
/freebsd/contrib/jemalloc/
H A DChangeLog218 - Use pairing heap instead of red-black tree for extents_avail. (@djwatson)
567 - Fix large allocation to search starting in the optimal size class heap,
606 - Fix heap profiling context leaks in reallocation edge cases. (@jasone)
644 unlikely to cause deadlocks in practice except when heap profiling was
685 + Add raw heap profile support. (@jasone)
739 This bugfix release continues the trend of xallocx() and heap profiling fixes.
746 - Fix prof_tctx_dump_iter() to filter out nodes that were created after heap
753 This bugfix release addresses a few bugs specific to heap profiling.
769 optional extra space. Note that a couple of minor heap profiling
775 fast path when heap profiling is enabled. Additionally, split a special
[all …]
/freebsd/sys/netinet/
H A Din_fib_dxr.c187 struct heap_entry heap[33];
345 struct heap_entry *fhp = &da->heap[0]; in dxr_lookup()
432 /* Copy from heap into the recycled chunk */ in chunk_ref()
459 /* Alloc a new descriptor at the top of the heap*/ in chunk_ref()
548 /* Free the chunk on the top of the range heap, trim the heap */ in chunk_unref()
670 if (preflen > da->heap[i].preflen) in trie_unref()
672 else if (preflen < da->heap[i].preflen)
673 da->heap[i + 1] = da->heap[
190 struct heap_entry heap[33]; global() member
[all...]
/freebsd/contrib/llvm-project/openmp/runtime/src/
H A Dompt-specific.cpp270 lwt->heap = 0; in __ompt_lw_taskteam_init()
284 link_lwt->heap = on_heap; in __ompt_lw_taskteam_link()
335 if (lwtask->heap) { in __ompt_lw_taskteam_unlink()
/freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DDXContainerConstants.def43 SHADER_FEATURE_FLAG(25, 30, ResourceDescriptorHeapIndexing, "Resource descriptor heap indexing")
44 SHADER_FEATURE_FLAG(26, 31, SamplerDescriptorHeapIndexing, "Sampler descriptor heap indexing")

123456