usr/src/boot/efi/loader/efi_main.c
195
(void *)(uintptr_t)heap, sbrk(0),
usr/src/boot/efi/loader/efi_main.c
196
(void *)(uintptr_t)heap + heapsize);
usr/src/boot/efi/loader/efi_main.c
200
COMMAND_SET(heap, "heap", "show heap usage", command_heap);
usr/src/boot/efi/loader/efi_main.c
34
static EFI_PHYSICAL_ADDRESS heap;
usr/src/boot/efi/loader/efi_main.c
42
BS->FreePages(heap, EFI_SIZE_TO_PAGES(heapsize));
usr/src/boot/efi/loader/efi_main.c
88
heap = 0x0000000100000000;
usr/src/boot/efi/loader/efi_main.c
90
EFI_SIZE_TO_PAGES(heapsize), &heap);
usr/src/boot/efi/loader/efi_main.c
94
setheap((void *)(uintptr_t)heap, (void *)(uintptr_t)(heap + heapsize));
usr/src/boot/i386/loader/main.c
338
COMMAND_SET(heap, "heap", "show heap usage", command_heap);
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1794
top = s->heap[SMALLEST]; \
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1795
s->heap[SMALLEST] = s->heap[s->heap_len--]; \
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1818
int v = s->heap[k];
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1823
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1827
if (smaller(tree, v, s->heap[j], s->depth)) break;
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1830
s->heap[k] = s->heap[j]; k = j;
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1835
s->heap[k] = v;
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1870
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1873
n = s->heap[h];
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1914
m = s->heap[--h];
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
1996
s->heap[++(s->heap_len)] = max_code = n;
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
2009
node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
2028
m = s->heap[SMALLEST]; /* m = node of next least frequency */
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
2030
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
2031
s->heap[--(s->heap_max)] = m;
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
2044
s->heap[SMALLEST] = node++;
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
2049
s->heap[--(s->heap_max)] = s->heap[SMALLEST];
usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c
324
int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
134
cyclic_dump_node(cyc_cpu_t *cpu, cyc_index_t *heap, char **c, size_t w,
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
144
me = heap[ndx];
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
174
heap[heap_left]);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
180
heap[heap_right]);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
185
cyclic_dump_node(cpu, heap, c, w, heap_left, l, x, depth + 1);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
188
cyclic_dump_node(cpu, heap, c, w, heap_right, x, r, depth + 1);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
200
cyc_index_t *heap;
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
203
heap = mdb_alloc(hsize, UM_SLEEP | UM_GC);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
205
if (mdb_vread(heap, hsize, (uintptr_t)cpu->cyp_heap) == -1) {
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
220
cyclic_dump_node(cpu, heap, c, width, 0, 1, width - 2, 0);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
242
cyc_index_t root, i, *heap;
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
289
heap = mdb_alloc(hsize, UM_SLEEP | UM_GC);
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
291
if (mdb_vread(heap, hsize, (uintptr_t)cpu.cyp_heap) == -1) {
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
296
root = heap[0];
usr/src/cmd/mdb/common/modules/genunix/cyclic.c
325
if (heap[j] == i)
usr/src/cmd/pack/pack.c
109
} heap [END+2];
usr/src/cmd/pack/pack.c
226
struct heap heapsubi;
usr/src/cmd/pack/pack.c
227
hmove(heap[i], heapsubi);
usr/src/cmd/pack/pack.c
231
if (heap[k].count > heap[k+1].count && k < n)
usr/src/cmd/pack/pack.c
233
if (heapsubi.count < heap[k].count)
usr/src/cmd/pack/pack.c
235
hmove(heap[k], heap[i]);
usr/src/cmd/pack/pack.c
238
hmove(heapsubi, heap[i]);
usr/src/cmd/pack/pack.c
261
heap[++n].count = count[i];
usr/src/cmd/pack/pack.c
262
heap[n].node = i;
usr/src/cmd/pack/pack.c
277
parent[heap[1].node] = ++lastnode;
usr/src/cmd/pack/pack.c
278
inc = heap[1].count;
usr/src/cmd/pack/pack.c
279
hmove(heap[n], heap[1]);
usr/src/cmd/pack/pack.c
282
parent[heap[1].node] = lastnode;
usr/src/cmd/pack/pack.c
283
heap[1].node = lastnode;
usr/src/cmd/pack/pack.c
284
heap[1].count += inc;
usr/src/cmd/sendmail/libsm/cf.c
20
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/clock.c
22
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/config.c
15
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/debug.c
31
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/exc.c
24
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/fclose.c
23
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/findfp.c
25
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/fopen.c
20
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/fpos.c
20
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/heap.c
23
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/makebuf.c
22
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/mbdb.c
27
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/niprop.c
21
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/rpool.c
19
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/sem.c
18
# include <sm/heap.h>
usr/src/cmd/sendmail/libsm/setvbuf.c
21
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/stdio.c
23
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/strdup.c
14
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/stringf.c
15
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/strio.c
24
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-exc.c
14
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-heap.c
14
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-qic.c
16
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-rpool.c
14
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-sem.c
19
# include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-shm.c
20
# include <sm/heap.h>
usr/src/cmd/sendmail/libsm/t-strl.c
16
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/ungetc.c
24
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/util.c
17
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/vasprintf.c
31
#include <sm/heap.h>
usr/src/cmd/sendmail/libsm/vfprintf.c
31
#include <sm/heap.h>
usr/src/common/bzip2/huffman.c
101
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
usr/src/common/bzip2/huffman.c
102
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
usr/src/common/bzip2/huffman.c
108
heap[nHeap] = nNodes;
usr/src/common/bzip2/huffman.c
36
zz = z; tmp = heap[zz]; \
usr/src/common/bzip2/huffman.c
37
while (weight[tmp] < weight[heap[zz >> 1]]) { \
usr/src/common/bzip2/huffman.c
38
heap[zz] = heap[zz >> 1]; \
usr/src/common/bzip2/huffman.c
41
heap[zz] = tmp; \
usr/src/common/bzip2/huffman.c
47
zz = z; tmp = heap[zz]; \
usr/src/common/bzip2/huffman.c
52
weight[heap[yy+1]] < weight[heap[yy]]) \
usr/src/common/bzip2/huffman.c
54
if (weight[tmp] < weight[heap[yy]]) break; \
usr/src/common/bzip2/huffman.c
55
heap[zz] = heap[yy]; \
usr/src/common/bzip2/huffman.c
58
heap[zz] = tmp; \
usr/src/common/bzip2/huffman.c
75
Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ];
usr/src/common/bzip2/huffman.c
87
heap[0] = 0;
usr/src/common/bzip2/huffman.c
94
heap[nHeap] = i;
usr/src/grub/grub-0.97/stage2/cmdline.c
123
enter_cmdline (char *heap, int forever)
usr/src/grub/grub-0.97/stage2/cmdline.c
140
*heap = 0;
usr/src/grub/grub-0.97/stage2/cmdline.c
145
if (get_cmdline (PACKAGE "> ", heap, 2048, 0, 1))
usr/src/grub/grub-0.97/stage2/cmdline.c
149
if (! heap[0])
usr/src/grub/grub-0.97/stage2/cmdline.c
153
builtin = find_command (heap);
usr/src/grub/grub-0.97/stage2/cmdline.c
173
arg = skip_to (1, heap);
usr/src/grub/grub-0.97/stage2/cmdline.c
185
run_script (char *script, char *heap)
usr/src/grub/grub-0.97/stage2/cmdline.c
227
grub_memmove (heap, old_entry, (int) cur_entry - (int) old_entry);
usr/src/grub/grub-0.97/stage2/cmdline.c
228
if (! *heap)
usr/src/grub/grub-0.97/stage2/cmdline.c
244
grub_memmove (heap, "boot", 5);
usr/src/grub/grub-0.97/stage2/cmdline.c
248
builtin = find_command (heap);
usr/src/grub/grub-0.97/stage2/cmdline.c
270
arg = skip_to (1, heap);
usr/src/grub/grub-0.97/stage2/shared.h
949
void enter_cmdline (char *heap, int forever);
usr/src/grub/grub-0.97/stage2/shared.h
950
int run_script (char *script, char *heap);
usr/src/grub/grub-0.97/stage2/stage2.c
238
char *heap, int entryno)
usr/src/grub/grub-0.97/stage2/stage2.c
536
((int) heap) - ((int) cur_entry));
usr/src/grub/grub-0.97/stage2/stage2.c
541
heap += 2;
usr/src/grub/grub-0.97/stage2/stage2.c
552
((int) heap) - ((int) ptr));
usr/src/grub/grub-0.97/stage2/stage2.c
553
heap -= (((int) ptr) - ((int) cur_entry));
usr/src/grub/grub-0.97/stage2/stage2.c
647
new_heap = heap;
usr/src/grub/grub-0.97/stage2/stage2.c
655
new_heap = heap + NEW_HEAPSIZE + 1;
usr/src/grub/grub-0.97/stage2/stage2.c
673
run_menu (heap, NULL, new_num_entries, new_heap, 0);
usr/src/grub/grub-0.97/stage2/stage2.c
679
new_heap = heap + NEW_HEAPSIZE + 1;
usr/src/grub/grub-0.97/stage2/stage2.c
703
(int) heap - ((int) cur_entry + i));
usr/src/grub/grub-0.97/stage2/stage2.c
708
heap += (j - i);
usr/src/grub/grub-0.97/stage2/stage2.c
716
enter_cmdline (heap, 0);
usr/src/grub/grub-0.97/stage2/stage2.c
767
if (run_script (cur_entry, heap))
usr/src/lib/libmlrpc/common/libmlrpc.h
445
#define NDR_MALLOC(XA, SZ) ndr_heap_malloc((XA)->heap, SZ)
usr/src/lib/libmlrpc/common/libmlrpc.h
446
#define NDR_NEW(XA, T) ndr_heap_malloc((XA)->heap, sizeof (T))
usr/src/lib/libmlrpc/common/libmlrpc.h
447
#define NDR_NEWN(XA, T, N) ndr_heap_malloc((XA)->heap, sizeof (T)*(N))
usr/src/lib/libmlrpc/common/libmlrpc.h
448
#define NDR_STRDUP(XA, S) ndr_heap_strdup((XA)->heap, (S))
usr/src/lib/libmlrpc/common/libmlrpc.h
449
#define NDR_MSTRING(XA, S, OUT) ndr_heap_mstring((XA)->heap, (S), (OUT))
usr/src/lib/libmlrpc/common/libmlrpc.h
450
#define NDR_SIDDUP(XA, S) ndr_heap_dupmem((XA)->heap, (S), smb_sid_len(S))
usr/src/lib/libmlrpc/common/libmlrpc.h
463
ndr_heap_t *heap;
usr/src/lib/libmlrpc/common/libmlrpc.h
515
ndr_heap_t *heap;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
291
ndr_heap_destroy(clnt->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
371
ndr_heap_t *heap;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
373
if ((heap = ndr_rpc_get_heap(handle)) == NULL)
usr/src/lib/libmlrpc/common/mlrpc_clh.c
376
return (ndr_heap_malloc(heap, size));
usr/src/lib/libmlrpc/common/mlrpc_clh.c
384
if (clnt->heap == NULL)
usr/src/lib/libmlrpc/common/mlrpc_clh.c
385
clnt->heap = ndr_heap_create();
usr/src/lib/libmlrpc/common/mlrpc_clh.c
387
return (clnt->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
404
ndr_heap_destroy(clnt->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
406
clnt->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
459
ndr_heap_t *heap = clnt->heap;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
462
if (heap == NULL) {
usr/src/lib/libmlrpc/common/mlrpc_clh.c
463
if ((heap = ndr_heap_create()) == NULL)
usr/src/lib/libmlrpc/common/mlrpc_clh.c
466
clnt->heap = heap;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
469
mxa->heap = heap;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
471
rc = nds_initialize(send_nds, 0, NDR_MODE_CALL_SEND, heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
474
NDR_MODE_RETURN_RECV, heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
479
ndr_heap_destroy(mxa->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
480
mxa->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
481
clnt->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
561
assert(clnt->heap == mxa->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
564
mxa->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
578
ndr_heap_destroy(mxa->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
579
mxa->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
580
clnt->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
591
ndr_heap_destroy(clnt->heap);
usr/src/lib/libmlrpc/common/mlrpc_clh.c
592
clnt->heap = NULL;
usr/src/lib/libmlrpc/common/mlrpc_clh.c
97
if ((clnt->heap = ndr_heap_create()) == NULL)
usr/src/lib/libmlrpc/common/ndr.h
285
struct ndr_heap *heap;
usr/src/lib/libmlrpc/common/ndr_heap.c
104
if (heap) {
usr/src/lib/libmlrpc/common/ndr_heap.c
106
if ((p = heap->iovec[i].iov_base) != NULL)
usr/src/lib/libmlrpc/common/ndr_heap.c
110
free(heap);
usr/src/lib/libmlrpc/common/ndr_heap.c
125
ndr_heap_malloc(ndr_heap_t *heap, unsigned size)
usr/src/lib/libmlrpc/common/ndr_heap.c
132
if (heap == NULL || size == 0)
usr/src/lib/libmlrpc/common/ndr_heap.c
135
p = heap->next;
usr/src/lib/libmlrpc/common/ndr_heap.c
137
if (p + size > heap->top) {
usr/src/lib/libmlrpc/common/ndr_heap.c
138
if ((heap->iovcnt == 0) || ((--heap->iovcnt) == 0))
usr/src/lib/libmlrpc/common/ndr_heap.c
146
++heap->iov;
usr/src/lib/libmlrpc/common/ndr_heap.c
147
heap->iov->iov_base = p;
usr/src/lib/libmlrpc/common/ndr_heap.c
148
heap->iov->iov_len = 0;
usr/src/lib/libmlrpc/common/ndr_heap.c
149
heap->top = p + incr_size;
usr/src/lib/libmlrpc/common/ndr_heap.c
152
heap->next = p + size;
usr/src/lib/libmlrpc/common/ndr_heap.c
153
heap->iov->iov_len += size;
usr/src/lib/libmlrpc/common/ndr_heap.c
161
ndr_heap_dupmem(ndr_heap_t *heap, const void *mem, size_t len)
usr/src/lib/libmlrpc/common/ndr_heap.c
168
if ((p = ndr_heap_malloc(heap, len)) != NULL)
usr/src/lib/libmlrpc/common/ndr_heap.c
178
ndr_heap_strdup(ndr_heap_t *heap, const char *s)
usr/src/lib/libmlrpc/common/ndr_heap.c
192
p = ndr_heap_dupmem(heap, s, len+1);
usr/src/lib/libmlrpc/common/ndr_heap.c
201
ndr_heap_mstring(ndr_heap_t *heap, const char *s, ndr_mstring_t *out)
usr/src/lib/libmlrpc/common/ndr_heap.c
219
if ((out->str = ndr_heap_strdup(heap, s)) == NULL)
usr/src/lib/libmlrpc/common/ndr_heap.c
235
ndr_heap_mkvcs(ndr_heap_t *heap, char *s, ndr_vcstr_t *vc)
usr/src/lib/libmlrpc/common/ndr_heap.c
256
vc->vcs = ndr_heap_malloc(heap, mlen);
usr/src/lib/libmlrpc/common/ndr_heap.c
266
ndr_heap_mkvcb(ndr_heap_t *heap, uint8_t *data, uint32_t datalen,
usr/src/lib/libmlrpc/common/ndr_heap.c
281
vcbuf->vcb = ndr_heap_malloc(heap, mlen);
usr/src/lib/libmlrpc/common/ndr_heap.c
295
ndr_heap_used(ndr_heap_t *heap)
usr/src/lib/libmlrpc/common/ndr_heap.c
301
used += heap->iovec[i].iov_len;
usr/src/lib/libmlrpc/common/ndr_heap.c
307
ndr_heap_avail(ndr_heap_t *heap)
usr/src/lib/libmlrpc/common/ndr_heap.c
312
count = (heap->iovcnt == 0) ? 0 : (heap->iovcnt - 1);
usr/src/lib/libmlrpc/common/ndr_heap.c
315
avail += (heap->top - heap->next);
usr/src/lib/libmlrpc/common/ndr_heap.c
70
ndr_heap_t *heap;
usr/src/lib/libmlrpc/common/ndr_heap.c
74
if ((heap = malloc(allocsize)) == NULL)
usr/src/lib/libmlrpc/common/ndr_heap.c
77
base = (char *)heap;
usr/src/lib/libmlrpc/common/ndr_heap.c
78
bzero(heap, sizeof (ndr_heap_t));
usr/src/lib/libmlrpc/common/ndr_heap.c
80
heap->iovcnt = NDR_HEAP_MAXIOV;
usr/src/lib/libmlrpc/common/ndr_heap.c
81
heap->iov = heap->iovec;
usr/src/lib/libmlrpc/common/ndr_heap.c
82
heap->iov->iov_base = base;
usr/src/lib/libmlrpc/common/ndr_heap.c
83
heap->iov->iov_len = sizeof (ndr_heap_t);
usr/src/lib/libmlrpc/common/ndr_heap.c
84
heap->top = base + allocsize;
usr/src/lib/libmlrpc/common/ndr_heap.c
85
heap->next = base + sizeof (ndr_heap_t);
usr/src/lib/libmlrpc/common/ndr_heap.c
87
return (heap);
usr/src/lib/libmlrpc/common/ndr_heap.c
99
ndr_heap_destroy(ndr_heap_t *heap)
usr/src/lib/libmlrpc/common/ndr_ops.c
125
int composite_op, ndr_heap_t *heap)
usr/src/lib/libmlrpc/common/ndr_ops.c
130
assert(heap);
usr/src/lib/libmlrpc/common/ndr_ops.c
134
nds->heap = (struct ndr_heap *)heap;
usr/src/lib/libmlrpc/common/ndr_ops.c
205
return (ndr_heap_malloc((ndr_heap_t *)nds->heap, len));
usr/src/lib/libmlrpc/common/ndr_server.c
102
if ((mxa->heap = ndr_heap_create()) == NULL)
usr/src/lib/libmlrpc/common/ndr_server.c
106
rc = nds_initialize(recv_nds, 0, NDR_MODE_CALL_RECV, mxa->heap);
usr/src/lib/libmlrpc/common/ndr_server.c
111
rc = nds_initialize(send_nds, 0, NDR_MODE_RETURN_SEND, mxa->heap);
usr/src/lib/libmlrpc/common/ndr_server.c
128
ndr_heap_destroy(mxa->heap);
usr/src/lib/libmlrpc/common/ndr_server.c
516
if (mxa->heap == NULL) {
usr/src/lib/libmlrpc/common/ndr_server.c
527
if ((param = ndr_heap_malloc(mxa->heap, p_len)) == NULL)
usr/src/lib/libresolv2/common/isc/heap.c
106
i > 1 && ctx->higher_priority(elt, ctx->heap[p]);
usr/src/lib/libresolv2/common/isc/heap.c
108
ctx->heap[i] = ctx->heap[p];
usr/src/lib/libresolv2/common/isc/heap.c
110
(ctx->index)(ctx->heap[i], i);
usr/src/lib/libresolv2/common/isc/heap.c
112
ctx->heap[i] = elt;
usr/src/lib/libresolv2/common/isc/heap.c
114
(ctx->index)(ctx->heap[i], i);
usr/src/lib/libresolv2/common/isc/heap.c
126
if (j < size && ctx->higher_priority(ctx->heap[j+1],
usr/src/lib/libresolv2/common/isc/heap.c
127
ctx->heap[j]))
usr/src/lib/libresolv2/common/isc/heap.c
129
if (ctx->higher_priority(elt, ctx->heap[j]))
usr/src/lib/libresolv2/common/isc/heap.c
131
ctx->heap[i] = ctx->heap[j];
usr/src/lib/libresolv2/common/isc/heap.c
133
(ctx->index)(ctx->heap[i], i);
usr/src/lib/libresolv2/common/isc/heap.c
136
ctx->heap[i] = elt;
usr/src/lib/libresolv2/common/isc/heap.c
138
(ctx->index)(ctx->heap[i], i);
usr/src/lib/libresolv2/common/isc/heap.c
172
elt = ctx->heap[ctx->heap_size--];
usr/src/lib/libresolv2/common/isc/heap.c
173
less = ctx->higher_priority(elt, ctx->heap[i]);
usr/src/lib/libresolv2/common/isc/heap.c
174
ctx->heap[i] = elt;
usr/src/lib/libresolv2/common/isc/heap.c
176
float_up(ctx, i, ctx->heap[i]);
usr/src/lib/libresolv2/common/isc/heap.c
178
sink_down(ctx, i, ctx->heap[i]);
usr/src/lib/libresolv2/common/isc/heap.c
191
float_up(ctx, i, ctx->heap[i]);
usr/src/lib/libresolv2/common/isc/heap.c
203
sink_down(ctx, i, ctx->heap[i]);
usr/src/lib/libresolv2/common/isc/heap.c
215
return (ctx->heap[i]);
usr/src/lib/libresolv2/common/isc/heap.c
228
(action)(ctx->heap[i], uap);
usr/src/lib/libresolv2/common/isc/heap.c
66
ctx->heap = NULL;
usr/src/lib/libresolv2/common/isc/heap.c
79
if (ctx->heap != NULL)
usr/src/lib/libresolv2/common/isc/heap.c
80
free(ctx->heap);
usr/src/lib/libresolv2/common/isc/heap.c
91
new_heap = (void **)realloc(ctx->heap,
usr/src/lib/libresolv2/common/isc/heap.c
97
ctx->heap = new_heap;
usr/src/lib/libresolv2/include/isc/heap.h
26
void **heap;
usr/src/lib/libumem/common/vmem.c
1702
vmem_t *parent, *heap;
usr/src/lib/libumem/common/vmem.c
1721
heap = vmem_create(heap_name,
usr/src/lib/libumem/common/vmem.c
1726
vmem_heap = heap;
usr/src/lib/libumem/common/vmem.c
1732
heap_alloc, heap_free, heap, 0,
usr/src/lib/libumem/common/vmem.c
1755
return (heap);
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
497
ndr_heap_t *heap;
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
563
heap = ndr_rpc_get_heap(netr_handle);
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
567
netr_setup_identity(heap, user_info, &info1.identity);
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
578
netr_setup_identity(heap, user_info, &info2.identity);
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
579
netr_network_samlogon(heap, netr_info, user_info, &info2);
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
665
netr_network_samlogon(ndr_heap_t *heap, netr_info_t *netr_info,
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
679
ndr_heap_mkvcb(heap, user_info->lg_nt_password.val, len,
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
686
ndr_heap_mkvcb(heap, user_info->lg_lm_password.val, len,
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
838
netr_setup_identity(ndr_heap_t *heap, smb_logon_t *user_info,
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
865
ndr_heap_mkvcs(heap, user_info->lg_domain,
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
868
ndr_heap_mkvcs(heap, user_info->lg_username,
usr/src/lib/smbsrv/libmlsvc/common/netr_logon.c
876
ndr_heap_mkvcs(heap, user_info->lg_workstation,
usr/src/lib/smbsrv/libmlsvc/common/samr_clnt.c
511
ndr_heap_t *heap;
usr/src/lib/smbsrv/libmlsvc/common/samr_clnt.c
527
heap = ndr_rpc_get_heap(domain_handle);
usr/src/lib/smbsrv/libmlsvc/common/samr_clnt.c
528
ndr_heap_mkvcs(heap, username, (ndr_vcstr_t *)&arg.username);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
486
unsigned char *heap = buf;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
487
unsigned char *end_heap = heap + n_buf;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
495
BE_OUT16(heap, npb->name_trn_id);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
496
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
498
BE_OUT16(heap, npb->info);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
499
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
501
BE_OUT16(heap, npb->qdcount);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
502
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
504
BE_OUT16(heap, npb->ancount);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
505
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
507
BE_OUT16(heap, npb->nscount);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
508
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
510
BE_OUT16(heap, npb->arcount);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
511
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
514
if ((heap + 34 + 4) > end_heap)
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
519
(void) strcpy((char *)heap, (char *)comp_name_buf);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
520
heap += strlen((char *)comp_name_buf) + 1;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
522
BE_OUT16(heap, npb->question[i].question_type);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
523
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
525
BE_OUT16(heap, npb->question[i].question_class);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
526
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
546
if ((heap + 34 + 10) > end_heap)
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
551
(void) strcpy((char *)heap, (char *)comp_name_buf);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
552
heap += strlen((char *)comp_name_buf) + 1;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
554
BE_OUT16(heap, nrr[i].rr_type);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
555
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
557
BE_OUT16(heap, nrr[i].rr_class);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
558
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
560
BE_OUT32(heap, nrr[i].ttl);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
561
heap += 4;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
563
BE_OUT16(heap, nrr[i].rdlength);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
564
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
567
if ((heap + tmp) > end_heap)
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
576
BE_OUT16(heap, tmp);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
577
heap += 2;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
580
(void) memcpy(heap,
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
583
heap += 4;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
585
bcopy(nrr[i].rdata, heap, tmp);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
586
heap += tmp;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
591
return (heap - buf);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
670
unsigned char *heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
705
heap = npb->block_data;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
720
npb->question = (struct name_question *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
721
heap += qdcount * sizeof (struct name_question);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
724
npb->question[i].name = (struct name_entry *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
725
heap += sizeof (struct name_entry);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
730
nrr = (struct resource_record *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
734
npb->answer = (struct resource_record *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
735
heap += ancount * sizeof (struct resource_record);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
740
npb->authority = (struct resource_record *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
741
heap += nscount * sizeof (struct resource_record);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
746
npb->additional = (struct resource_record *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
747
heap += arcount * sizeof (struct resource_record);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
757
nrr[i].name = (struct name_entry *)heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
758
heap += sizeof (struct name_entry);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
839
bcopy(scan, heap, n);
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
872
nrr[i].rdata = heap;
usr/src/lib/smbsrv/libsmbns/common/smbns_netbios_name.c
875
heap += n;
usr/src/test/os-tests/tests/secflags/addrs.c
11
void *heap = NULL;
usr/src/test/os-tests/tests/secflags/addrs.c
14
if ((heap = malloc(10)) == NULL)
usr/src/test/os-tests/tests/secflags/addrs.c
22
printf(" heap: 0x%p\n", heap);
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2596
top = s->heap[SMALLEST]; \
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2597
s->heap[SMALLEST] = s->heap[s->heap_len--]; \
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2622
int v = s->heap[k];
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2627
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2631
if (smaller(tree, v, s->heap[j], s->depth)) break;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2634
s->heap[k] = s->heap[j]; k = j;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2639
s->heap[k] = v;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2678
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2681
n = s->heap[h];
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2728
m = s->heap[--h];
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2821
s->heap[++(s->heap_len)] = max_code = n;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2835
node = s->heap[++(s->heap_len)] = (max_code < 2 ?
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2857
m = s->heap[SMALLEST]; /* m = node of next least frequency */
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2860
s->heap[--(s->heap_max)] = n;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2861
s->heap[--(s->heap_max)] = m;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2875
s->heap[SMALLEST] = node++;
usr/src/uts/common/io/ppp/spppcomp/zlib.c
2880
s->heap[--(s->heap_max)] = s->heap[SMALLEST];
usr/src/uts/common/io/ppp/spppcomp/zlib.c
484
int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
usr/src/uts/common/os/callout.c
537
callout_heap_t *heap;
usr/src/uts/common/os/callout.c
548
heap = kmem_alloc(size, KM_NOSLEEP);
usr/src/uts/common/os/callout.c
551
if (heap == NULL) {
usr/src/uts/common/os/callout.c
571
kmem_free(heap, size);
usr/src/uts/common/os/callout.c
575
bcopy(ct->ct_heap, heap, osize);
usr/src/uts/common/os/callout.c
577
ct->ct_heap = heap;
usr/src/uts/common/os/callout.c
593
callout_heap_t *heap, *hcurrent, *hparent;
usr/src/uts/common/os/callout.c
602
heap = ct->ct_heap;
usr/src/uts/common/os/callout.c
607
hparent = &heap[parent];
usr/src/uts/common/os/callout.c
608
hcurrent = &heap[current];
usr/src/uts/common/os/callout.c
674
callout_heap_t *heap, *hleft, *hright, *hcurrent;
usr/src/uts/common/os/callout.c
679
heap = ct->ct_heap;
usr/src/uts/common/os/callout.c
691
hleft = &heap[left];
usr/src/uts/common/os/callout.c
692
hcurrent = &heap[current];
usr/src/uts/common/os/callout.c
703
hright = &heap[right];
usr/src/uts/common/os/callout.c
754
callout_heap_t *heap;
usr/src/uts/common/os/callout.c
768
heap = ct->ct_heap;
usr/src/uts/common/os/callout.c
771
expiration = heap->ch_expiration;
usr/src/uts/common/os/callout.c
773
cl = heap->ch_list;
usr/src/uts/common/os/callout.c
808
heap[0] = heap[ct->ct_heap_num];
usr/src/uts/common/os/callout.c
829
if ((heap[1].ch_expiration < next) ||
usr/src/uts/common/os/callout.c
830
(heap[2].ch_expiration < next))
usr/src/uts/common/os/callout.c
862
callout_heap_t *heap;
usr/src/uts/common/os/callout.c
876
heap = ct->ct_heap;
usr/src/uts/common/os/callout.c
899
cl = heap[i].ch_list;
usr/src/uts/common/os/callout.c
938
heap[i].ch_expiration = expiration;
usr/src/uts/common/os/callout.c
948
heap[ct->ct_heap_num] = heap[i];
usr/src/uts/common/os/callout.c
967
return (heap->ch_expiration);
usr/src/uts/common/os/cyclic.c
1771
cyc_index_t *heap, last;
usr/src/uts/common/os/cyclic.c
1783
heap = cpu->cyp_heap;
usr/src/uts/common/os/cyclic.c
1829
if (heap[i] == ndx)
usr/src/uts/common/os/cyclic.c
1857
root = heap[0];
usr/src/uts/common/os/cyclic.c
1865
heap[i] = (last = heap[nelems]);
usr/src/uts/common/os/cyclic.c
1866
heap[nelems] = ndx;
usr/src/uts/common/os/cyclic.c
1878
if (heap[i] == last) {
usr/src/uts/common/os/cyclic.c
1882
ASSERT(heap[0] == root);
usr/src/uts/common/os/cyclic.c
1891
cyclic = &cpu->cyp_cyclics[heap[0]];
usr/src/uts/common/os/cyclic.c
1970
cyc_index_t *heap;
usr/src/uts/common/os/cyclic.c
1981
heap = cpu->cyp_heap;
usr/src/uts/common/os/cyclic.c
1990
if (heap[i] == ndx)
usr/src/uts/common/os/cyclic.c
2028
cyclic = &cpu->cyp_cyclics[heap[0]];
usr/src/uts/common/os/cyclic.c
745
cyc_index_t *heap;
usr/src/uts/common/os/cyclic.c
752
heap = cpu->cyp_heap;
usr/src/uts/common/os/cyclic.c
757
current = heap[heap_current];
usr/src/uts/common/os/cyclic.c
758
parent = heap[heap_parent];
usr/src/uts/common/os/cyclic.c
770
heap[heap_parent] = current;
usr/src/uts/common/os/cyclic.c
771
heap[heap_current] = parent;
usr/src/uts/common/os/cyclic.c
788
cyc_index_t *heap = cpu->cyp_heap;
usr/src/uts/common/os/cyclic.c
802
left = heap[heap_left];
usr/src/uts/common/os/cyclic.c
803
me = heap[heap_me];
usr/src/uts/common/os/cyclic.c
814
right = heap[heap_right];
usr/src/uts/common/os/cyclic.c
834
heap[heap_right] = me;
usr/src/uts/common/os/cyclic.c
835
heap[heap_me] = right;
usr/src/uts/common/os/cyclic.c
853
heap[heap_left] = me;
usr/src/uts/common/os/cyclic.c
854
heap[heap_me] = left;
usr/src/uts/common/os/cyclic.c
953
cyc_index_t *heap = cpu->cyp_heap;
usr/src/uts/common/os/cyclic.c
971
cyc_index_t ndx = heap[0];
usr/src/uts/common/os/vmem.c
1770
vmem_t *heap;
usr/src/uts/common/os/vmem.c
1775
heap = vmem_create(heap_name,
usr/src/uts/common/os/vmem.c
1782
vmem_alloc, vmem_free, heap, 8 * heap_quantum,
usr/src/uts/common/os/vmem.c
1805
return (heap);