Searched refs:heap (Results 26 - 50 of 73) sorted by relevance
123
/illumos-gate/usr/src/cmd/sendmail/libsm/ |
H A D | vasprintf.c | 33 #include <sm/heap.h>
|
H A D | Makefile | 42 fwalk.o fwrite.o get.o heap.o ldap.o makebuf.o match.o mbdb.o \ 51 TESTS= t-event t-exc t-rpool t-string t-smstdio t-match t-strio t-heap \
|
H A D | config.c | 17 #include <sm/heap.h>
|
H A D | fclose.c | 25 #include <sm/heap.h>
|
H A D | t-exc.c | 16 #include <sm/heap.h>
|
H A D | makebuf.c | 24 #include <sm/heap.h>
|
H A D | niprop.c | 23 #include <sm/heap.h>
|
H A D | setvbuf.c | 23 #include <sm/heap.h>
|
H A D | ungetc.c | 26 #include <sm/heap.h>
|
H A D | util.c | 19 #include <sm/heap.h>
|
H A D | debug.c | 31 #include <sm/heap.h> 281 ** F:sm.heap -- out of memory. 342 ** F:sm.heap -- out of memory
|
H A D | fopen.c | 22 #include <sm/heap.h> 99 ** Raises exception on heap exhaustion. 216 ** Raises an exception on heap exhaustion.
|
H A D | sem.c | 18 # include <sm/heap.h>
|
H A D | t-shm.c | 22 # include <sm/heap.h>
|
H A D | local.h | 28 #include <sm/heap.h>
|
H A D | stdio.c | 25 #include <sm/heap.h> 467 ** Raises an exception on heap exhaustion.
|
H A D | strio.c | 26 #include <sm/heap.h>
|
/illumos-gate/usr/src/lib/smbsrv/libmlrpc/common/ |
H A D | ndr_ops.c | 121 * operations and the reference to the heap. An external heap is provided 122 * to the stream, rather than each stream creating its own heap. 126 int composite_op, ndr_heap_t *heap) 131 assert(heap); 135 nds->heap = (struct ndr_heap *)heap; 198 * Allocate memory from the stream heap. 204 return (ndr_heap_malloc((ndr_heap_t *)nds->heap, len)); 365 * with the stream heap 125 nds_initialize(ndr_stream_t *nds, unsigned pdu_size_hint, int composite_op, ndr_heap_t *heap) argument [all...] |
H A D | ndr_server.c | 103 if ((mxa->heap = ndr_heap_create()) == NULL) 107 rc = nds_initialize(recv_nds, 0, NDR_MODE_CALL_RECV, mxa->heap); 112 rc = nds_initialize(send_nds, 0, NDR_MODE_RETURN_SEND, mxa->heap); 129 ndr_heap_destroy(mxa->heap); 537 * The transaction and the two nds streams use the same heap, which 538 * should already exist at this point. The heap will also be available 553 if (mxa->heap == NULL) { 554 ndo_printf(0, 0, "%s[0x%02x]: no heap", msvc->name, opnum); 564 if ((param = ndr_heap_malloc(mxa->heap, p_len)) == NULL)
|
/illumos-gate/usr/src/cmd/sendmail/include/sm/ |
H A D | rpool.h | 23 # include <sm/heap.h>
|
/illumos-gate/usr/src/uts/common/os/ |
H A D | cyclic.c | 150 * The cyclics are kept sorted by expiration time in the cyc_cpu's heap. The 151 * heap is keyed by cyclic expiration time, with parents expiring earlier 156 * The heap is managed primarily by cyclic_fire(). Upon entry, cyclic_fire() 165 * (guaranteed to be the earliest in the heap) is then communicated to the 170 * heap as an array (the cyp_heap member of the cyc_cpu structure), with each 173 * The heap is laid out in the array according to the following: 175 * 1. The root of the heap is always in the 0th element of the heap array 180 * that these constraints correctly lay out a heap (or indeed, any binary 183 * To see the heap b 737 cyc_index_t *heap; local 780 cyc_index_t *heap = cpu->cyp_heap; local 945 cyc_index_t *heap = cpu->cyp_heap; local 1763 cyc_index_t *heap, last; local 1961 cyc_index_t *heap; local [all...] |
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
H A D | zlib.c | 171 /* maximum heap size */ 324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:deflate_state 325 int heap_len; /* number of elements in the heap */ 327 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. 328 * The same heap array is used to build all trees. 1523 * need for the L_CODES extra codes used during heap constructio [all...] |
/illumos-gate/usr/src/lib/libresolv2/ |
H A D | Makefile.com | 62 heap.o hex.o logging.o memcluster.o \
|
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
H A D | zlib.c | 317 /* maximum heap size */ 486 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:deflate_state 487 int heap_len; /* number of elements in the heap */ 490 * The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] 491 * is not used. The same heap array is used to build all 2308 * is no need for the L_CODES extra codes used during heap [all...] |
/illumos-gate/usr/src/lib/libresolv2/common/isc/ |
H A D | eventlib_p.h | 42 #include <isc/heap.h>
|
Completed in 113 milliseconds
123