Home
last modified time | relevance | path

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

12

/illumos-gate/usr/src/lib/libmlrpc/common/
H A Dndr_heap.c70 ndr_heap_t *heap; in ndr_heap_create() local
77 base = (char *)heap; in ndr_heap_create()
81 heap->iov = heap->iovec; in ndr_heap_create()
87 return (heap); in ndr_heap_create()
104 if (heap) { in ndr_heap_destroy()
110 free(heap); in ndr_heap_destroy()
135 p = heap->next; in ndr_heap_malloc()
138 if ((heap->iovcnt == 0) || ((--heap->iovcnt) == 0)) in ndr_heap_malloc()
146 ++heap->iov; in ndr_heap_malloc()
312 count = (heap->iovcnt == 0) ? 0 : (heap->iovcnt - 1); in ndr_heap_avail()
[all …]
H A Dmlrpc_clh.c371 ndr_heap_t *heap; in ndr_rpc_malloc() local
406 clnt->heap = NULL; in ndr_rpc_release()
459 ndr_heap_t *heap = clnt->heap; in ndr_xa_init() local
462 if (heap == NULL) { in ndr_xa_init()
466 clnt->heap = heap; in ndr_xa_init()
469 mxa->heap = heap; in ndr_xa_init()
480 mxa->heap = NULL; in ndr_xa_init()
481 clnt->heap = NULL; in ndr_xa_init()
561 assert(clnt->heap == mxa->heap); in ndr_xa_preserve()
564 mxa->heap = NULL; in ndr_xa_preserve()
[all …]
H A Dlibmlrpc.h444 #define NDR_MALLOC(XA, SZ) ndr_heap_malloc((XA)->heap, SZ)
445 #define NDR_NEW(XA, T) ndr_heap_malloc((XA)->heap, sizeof (T))
446 #define NDR_NEWN(XA, T, N) ndr_heap_malloc((XA)->heap, sizeof (T)*(N))
447 #define NDR_STRDUP(XA, S) ndr_heap_strdup((XA)->heap, (S))
448 #define NDR_MSTRING(XA, S, OUT) ndr_heap_mstring((XA)->heap, (S), (OUT))
449 #define NDR_SIDDUP(XA, S) ndr_heap_dupmem((XA)->heap, (S), smb_sid_len(S))
462 ndr_heap_t *heap; member
512 ndr_heap_t *heap; member
H A Dndr_ops.c125 int composite_op, ndr_heap_t *heap) in nds_initialize() argument
130 assert(heap); in nds_initialize()
134 nds->heap = (struct ndr_heap *)heap; in nds_initialize()
205 return (ndr_heap_malloc((ndr_heap_t *)nds->heap, len)); in ndo_malloc()
H A Dndr_server.c102 if ((mxa->heap = ndr_heap_create()) == NULL) in ndr_pipe_process()
106 rc = nds_initialize(recv_nds, 0, NDR_MODE_CALL_RECV, mxa->heap); in ndr_pipe_process()
111 rc = nds_initialize(send_nds, 0, NDR_MODE_RETURN_SEND, mxa->heap); in ndr_pipe_process()
128 ndr_heap_destroy(mxa->heap); in ndr_pipe_process()
516 if (mxa->heap == NULL) { in ndr_generic_call_stub()
527 if ((param = ndr_heap_malloc(mxa->heap, p_len)) == NULL) in ndr_generic_call_stub()
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dheap.c66 ctx->heap = NULL; in heap_new()
79 if (ctx->heap != NULL) in heap_free()
80 free(ctx->heap); in heap_free()
97 ctx->heap = new_heap; in heap_resize()
108 ctx->heap[i] = ctx->heap[p]; in float_up()
112 ctx->heap[i] = elt; in float_up()
127 ctx->heap[j])) in sink_down()
131 ctx->heap[i] = ctx->heap[j]; in sink_down()
136 ctx->heap[i] = elt; in sink_down()
174 ctx->heap[i] = elt; in heap_delete()
[all …]
/illumos-gate/usr/src/common/bzip2/
H A Dhuffman.c36 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 …]
/illumos-gate/usr/src/grub/grub-0.97/stage2/
H A Dcmdline.c123 enter_cmdline (char *heap, int forever) in enter_cmdline() argument
140 *heap = 0; in enter_cmdline()
145 if (get_cmdline (PACKAGE "> ", heap, 2048, 0, 1)) in enter_cmdline()
149 if (! heap[0]) in enter_cmdline()
153 builtin = find_command (heap); in enter_cmdline()
173 arg = skip_to (1, heap); in enter_cmdline()
185 run_script (char *script, char *heap) in run_script() argument
228 if (! *heap) in run_script()
244 grub_memmove (heap, "boot", 5); in run_script()
248 builtin = find_command (heap); in run_script()
[all …]
H A Dstage2.c238 char *heap, int entryno) in run_menu() argument
536 ((int) heap) - ((int) cur_entry)); in run_menu()
541 heap += 2; in run_menu()
552 ((int) heap) - ((int) ptr)); in run_menu()
647 new_heap = heap; in run_menu()
655 new_heap = heap + NEW_HEAPSIZE + 1; in run_menu()
679 new_heap = heap + NEW_HEAPSIZE + 1; in run_menu()
703 (int) heap - ((int) cur_entry + i)); in run_menu()
708 heap += (j - i); in run_menu()
716 enter_cmdline (heap, 0); in run_menu()
[all …]
/illumos-gate/usr/src/cmd/pack/
H A Dpack.c108 struct heap { struct
111 } heap [END+2]; argument
228 struct heap heapsubi; in heapify()
229 hmove(heap[i], heapsubi); in heapify()
233 if (heap[k].count > heap[k+1].count && k < n) in heapify()
237 hmove(heap[k], heap[i]); in heapify()
240 hmove(heapsubi, heap[i]); in heapify()
264 heap[n].node = i; in packfile()
280 inc = heap[1].count; in packfile()
281 hmove(heap[n], heap[1]); in packfile()
[all …]
/illumos-gate/usr/src/lib/smbsrv/libsmbns/common/
H A Dsmbns_netbios_name.c496 heap += 2; in smb_name_buf_from_packet()
499 heap += 2; in smb_name_buf_from_packet()
502 heap += 2; in smb_name_buf_from_packet()
505 heap += 2; in smb_name_buf_from_packet()
508 heap += 2; in smb_name_buf_from_packet()
511 heap += 2; in smb_name_buf_from_packet()
523 heap += 2; in smb_name_buf_from_packet()
526 heap += 2; in smb_name_buf_from_packet()
555 heap += 2; in smb_name_buf_from_packet()
558 heap += 2; in smb_name_buf_from_packet()
[all …]
/illumos-gate/usr/src/boot/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()
89 heap = 0x0000000100000000; in efi_main()
91 EFI_SIZE_TO_PAGES(heapsize), &heap); in efi_main()
95 setheap((void *)(uintptr_t)heap, (void *)(uintptr_t)(heap + heapsize)); in efi_main()
/illumos-gate/usr/src/uts/common/os/
H A Dcallout.c537 callout_heap_t *heap; in callout_heap_expand() local
551 if (heap == NULL) { in callout_heap_expand()
577 ct->ct_heap = heap; in callout_heap_expand()
602 heap = ct->ct_heap; in callout_upheap()
679 heap = ct->ct_heap; in callout_downheap()
691 hleft = &heap[left]; in callout_downheap()
768 heap = ct->ct_heap; in callout_heap_delete()
773 cl = heap->ch_list; in callout_heap_delete()
808 heap[0] = heap[ct->ct_heap_num]; in callout_heap_delete()
876 heap = ct->ct_heap; in callout_heap_process()
[all …]
H A Dcyclic.c745 cyc_index_t *heap; in cyclic_upheap() local
752 heap = cpu->cyp_heap; in cyclic_upheap()
803 me = heap[heap_me]; in cyclic_downheap()
1783 heap = cpu->cyp_heap; in cyclic_remove_xcall()
1829 if (heap[i] == ndx) in cyclic_remove_xcall()
1857 root = heap[0]; in cyclic_remove_xcall()
1865 heap[i] = (last = heap[nelems]); in cyclic_remove_xcall()
1866 heap[nelems] = ndx; in cyclic_remove_xcall()
1970 cyc_index_t *heap; in cyclic_reprogram_cyclic() local
1981 heap = cpu->cyp_heap; in cyclic_reprogram_cyclic()
[all …]
/illumos-gate/usr/src/test/os-tests/tests/secflags/
H A Daddrs.c11 void *heap = NULL; in main() local
14 if ((heap = malloc(10)) == NULL) in main()
22 printf(" heap: 0x%p\n", heap); in main()
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dcyclic.c140 me = heap[ndx]; in cyclic_dump_node()
170 heap[heap_left]); in cyclic_dump_node()
176 heap[heap_right]); in cyclic_dump_node()
196 cyc_index_t *heap; in cyclic_pretty_dump() local
199 heap = mdb_alloc(hsize, UM_SLEEP | UM_GC); in cyclic_pretty_dump()
216 cyclic_dump_node(cpu, heap, c, width, 0, 1, width - 2, 0); in cyclic_pretty_dump()
251 cyc_index_t root, i, *heap; in cycinfo() local
299 heap = mdb_alloc(hsize, UM_SLEEP | UM_GC); in cycinfo()
301 if (mdb_vread(heap, hsize, (uintptr_t)cpu.cyp_heap) == -1) { in cycinfo()
306 root = heap[0]; in cycinfo()
[all …]
/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
456 int v = s->heap[k];
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
468 s->heap[k] = s->heap[j]; k = j;
473 s->heap[k] = v;
511 n = s->heap[h];
552 m = s->heap[--h];
669 s->heap[--(s->heap_max)] = m;
683 s->heap[SMALLEST] = node++;
[all …]
/illumos-gate/usr/src/lib/smbsrv/libmlsvc/common/
H A Dnetr_logon.c496 ndr_heap_t *heap; in netr_server_samlogon() local
562 heap = ndr_rpc_get_heap(netr_handle); in netr_server_samlogon()
566 netr_setup_identity(heap, user_info, &info1.identity); in netr_server_samlogon()
577 netr_setup_identity(heap, user_info, &info2.identity); in netr_server_samlogon()
578 netr_network_samlogon(heap, netr_info, user_info, &info2); in netr_server_samlogon()
678 ndr_heap_mkvcb(heap, user_info->lg_nt_password.val, len, in netr_network_samlogon()
685 ndr_heap_mkvcb(heap, user_info->lg_lm_password.val, len, in netr_network_samlogon()
826 netr_setup_identity(ndr_heap_t *heap, smb_logon_t *user_info, in netr_setup_identity() argument
853 ndr_heap_mkvcs(heap, user_info->lg_domain, in netr_setup_identity()
856 ndr_heap_mkvcs(heap, user_info->lg_username, in netr_setup_identity()
[all …]
/illumos-gate/usr/src/common/mapfiles/common/
H A Dmap.noexdata28 # As the data segment is extended by sbrk(2) to enlarge the heap, a
29 # non-executable data segment also results in a non-exutable heap.
40 # non-executable heap. See /usr/lib/ld/map.noexbss.
H A Dmap.noexbss29 # As the bss segment is extended by sbrk(2) to enlarge the heap, a
30 # non-executable bss segment also results in a non-exutable heap.
/illumos-gate/usr/src/boot/i386/loader/
H A Dhelp.i38611 heap
13 Requests debugging output from the heap manager. For debugging use
/illumos-gate/usr/src/contrib/ast/src/lib/libast/features/
H A Dvmalloc64 static HT heap[1024 * 4];
65 static HT* hp = &heap[1];
67 #define MALLOC(n) if(user)return&heap[0];op=hp;hp+=(n+sizeof(HT)-1)/sizeof(HT);return(void*)op;
68 #define INTERCEPTED(p) (((char*)(p))==((char*)&heap[0]))
/illumos-gate/usr/src/cmd/sendmail/libsm/
H A DMakefile38 fwalk.o fwrite.o get.o heap.o ldap.o makebuf.o match.o mbdb.o \
47 TESTS= t-event t-exc t-rpool t-string t-smstdio t-match t-strio t-heap \
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dheap.h26 void **heap; member
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1794 top = s->heap[SMALLEST]; \
1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
1818 int v = s->heap[k];
1823 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
1830 s->heap[k] = s->heap[j]; k = j;
1835 s->heap[k] = v;
1873 n = s->heap[h];
1914 m = s->heap[--h];
2031 s->heap[--(s->heap_max)] = m;
2044 s->heap[SMALLEST] = node++;
[all …]

12