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

12

/barrelfish-2018-10-04/include/barrelfish/
H A Dheap.h3 * \brief Simple heap allocator
30 struct heap;
32 typedef union heap_header *(*Morecore_func_t)(struct heap *h, unsigned nu);
34 struct heap { struct
40 void heap_init(struct heap *heap, void *buf, size_t buflen,
42 void *heap_alloc(struct heap *heap, size_t nbytes);
43 void heap_free(struct heap *heap, voi
[all...]
H A Ddispatcher.h20 #include <barrelfish/heap.h>
55 /// LMP endpoint heap state
56 struct heap lmp_endpoint_heap;
/barrelfish-2018-10-04/lib/barrelfish/
H A Dheap.c3 * \brief Simple heap allocator.
5 * This file implements a very simple heap allocator, based on K&R malloc.
18 #include <barrelfish/heap.h>
21 * \brief Initialise a new heap
23 * \param heap Heap structure to be filled in
26 * \param morecore_func Function to call to increase heap, or NULL
28 void heap_init(struct heap *heap, void *buf, size_t buflen, argument
31 assert(heap != NULL);
36 heap
53 heap_alloc(struct heap *heap, size_t nbytes) argument
90 heap_free(struct heap *heap, void *ap) argument
146 heap_default_morecore(struct heap *heap, unsigned nu) argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Shm/src/
H A Dalloc.c30 * DESCRIPTION heap allocator
43 * alloc_size(heap, bytes)
44 * free_size(heap, ptr, bytes)
45 * realloc_size(heap, ptr, oldbytes, newbytes)
47 * h_alloc(heap, bytes)
48 * h_free(heap, ptr)
49 * h_realloc(heap, ptr, newbytes)
326 _print("SHM: attempt to free out-of-heap pointer!\n");
465 * This is used to forcibly free all heap space (allocated or not)
466 * when the heap i
709 struct heap *heap = hd->heap; local
741 struct heap *heap = hd->heap; local
833 struct heap *heap = hd->heap; local
1017 struct heap *heap = hd->heap; local
[all...]
H A Dprivate_mem.c83 struct heap heap; member in struct:prmem
142 * Set up the private heap
158 hd->heap = &private_memory->heap;
196 * Private heap interface
H A Dmemman.h159 struct heap { struct
186 struct heap *magic;
231 struct heap *heap; member in struct:heap_descriptor
257 struct heap heap; /* block manager structure */ member in struct:shm_desc
264 * Simplified private heap interface
H A Dshared_mem.c118 struct heap_descriptor *hd) /* output: heap descriptor */
203 hd->heap = &hd->shared_header->heap;
281 hd->heap = &hd->shared_header->heap;
333 perror("ECLiPSe: shared heap overflow");
463 * Check whether a given address is in this heap
/barrelfish-2018-10-04/lib/cxx/cxxabi/
H A Dcxa_vector.cpp149 st_heap_block2 heap ( dealloc, heap_block );
159 heap.release (); // We're good!
178 st_heap_block3 heap ( dealloc, heap_block, heap_size );
188 heap.release (); // We're good!
334 st_heap_block2 heap ( dealloc, heap_block );
357 st_heap_block3 heap ( dealloc, heap_block, heap_block_size );
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ec/
H A Decp_smpl.c1545 BIGNUM **heap = NULL; local
1576 heap = OPENSSL_malloc(pow2 * sizeof heap[0]);
1577 if (heap == NULL) goto err;
1581 * heap[1]
1582 * heap[2] heap[3]
1583 * heap[4] heap[5] heap[
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dheaps.pl42 A heap is a labelled binary tree where the key of each node is less
43 than or equal to the keys of its sons. The point of a heap is that
44 we can keep on adding new elements to the heap and we can keep on
51 A heap is represented as a triple t(N, Free, Tree) where N is the
67 the heap so far is M, and the tree currently has K elements, the tree
72 the heap is O(NlgM) instead of O(NlgN). For M say 100 and N say 10^4
74 The storage cost of a heap in a copying Prolog (which Dec-10 Prolog is
80 summary:"inserts the new Key-Datum pair into the heap",
83 inserts the new Key-Datum pair into the heap. The insertion is
87 history of the heap
[all...]
H A Dcprolog.pl138 It returns the sum of code heap and general heap usage.
/barrelfish-2018-10-04/lib/zlib/
H A Dtrees.c92 * need for the L_CODES extra codes used during heap construction. However
427 /* Index within the heap array of least frequent node in the Huffman tree */
431 * Remove the smallest element from the heap and recreate the heap with
432 * one less element. Updates heap and heap_len.
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
450 * Restore the heap property by moving down the tree starting at node k,
452 * when the heap propert
[all...]
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.
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Dglobalstate.tex32 \item[shared heap]
37 \item heap terms
39 \item[private heap]
40 In a non-parallel \eclipse\ this is the same as the shared heap\footnote{
41 In parallel \eclipse\ the private heap is private to each worker, while
42 the shared heap is shared between workers}.
60 The heap management (for shared memory, but the code is also used
H A Dbuiltins.tex57 Built-ins to store data across backtracking. All these relay on a single heap
59 discarded on backtracking) to the heap, where the memory is managed explicitly.
66 \item property.c - heap copying routines
H A Dinternal.tex127 \item[Shm/] A memory management library in C, used for heap management in
H A Druntime.tex161 \item The name of the atom or functor in the form of a string buffer on the heap.
403 not constructed on the global stack at runtime, but on the heap at
414 being set in pointers that point to (or into) these persistent heap
H A Dkernel.tex71 \index{shared heap}
76 \item[shared heap] abstract machine code, shared ground terms,
77 heap copied terms (setval, record, etc)
172 but may also be in the heap (e.g. for constants\index{constants} occurring in program code).
340 located on the shared heap. The instruction just loads a pointer
1434 point to a properly tagged pword) or an arbitrary heap
1835 to support that (but preferably without full heap copying).
2053 as a property of an atom (for symbolic events), or copied from a heap term
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsmemory.tex91 \index{shared heap}
92 \index{private heap}
93 \index{heap}
94 The heap is used to store a variety of data:
98 The heap is used to store compiled Prolog code.
115 heap to do so. This includes the handle-based facilities
141 streams, operators, etc.) that are also allocated on the heap.
145 heap. They are freed when the stream is closed.
149 from the heap. It is the allocating code's responsibility to free
153 Note that the distinction between shared and private heap i
[all...]
H A Dumsbugs.tex49 \item The stack and heap sizes have virtual memory limits which can be
79 heap copying predicates (\predspec{setval/2}, \predspec{bag_enter/2},
/barrelfish-2018-10-04/lib/libc/isc/
H A Deventlib_p.h44 #include <isc/heap.h>
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Decoptions.tex64 amount of memory per heap.
H A Dembvb.tex149 The maximum size of the {\eclipse} shared heap.
153 The maximum size of the {\eclipse} private heap.
/barrelfish-2018-10-04/doc/004-virtual_memory/
H A DVirtualMemory.tex156 Currently, the memory object is used in the heap, slot allocator, spawning domains, pci domain, and vmkit domain.
/barrelfish-2018-10-04/lib/tommath/
H A Dbn.tex351 hold the structure itself by yourself (whether off stack or heap it doesn't matter). The very first thing that must be
407 When you are finished with an mp\_int it is ideal to return the heap it used back to the system. The following function
415 The function expects a pointer to a previously initialized mp\_int structure and frees the heap it uses. It sets the
455 from the heap at the same time.
549 digits can be removed to return memory to the heap with the mp\_shrink() function.
558 will require heap operations which can be slow. It is not ideal to shrink mp\_int variables that you will further
693 this function can fail if it runs out of heap memory.

Completed in 121 milliseconds

12