Home
last modified time | relevance | path

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

12

/titanic_44/usr/src/lib/smbsrv/libmlrpc/common/
H A Dndr_heap.c69 ndr_heap_t *heap; in ndr_heap_create() local
73 if ((heap = malloc(allocsize)) == NULL) in ndr_heap_create()
76 base = (char *)heap; in ndr_heap_create()
77 bzero(heap, sizeof (ndr_heap_t)); in ndr_heap_create()
79 heap->iovcnt = NDR_HEAP_MAXIOV; in ndr_heap_create()
80 heap->iov = heap->iovec; in ndr_heap_create()
81 heap->iov->iov_base = base; in ndr_heap_create()
82 heap->iov->iov_len = sizeof (ndr_heap_t); in ndr_heap_create()
83 heap->top = base + allocsize; in ndr_heap_create()
84 heap->next = base + sizeof (ndr_heap_t); in ndr_heap_create()
[all …]
H A Dlibmlrpc.h414 #define NDR_MALLOC(XA, SZ) ndr_heap_malloc((XA)->heap, SZ)
415 #define NDR_NEW(XA, T) ndr_heap_malloc((XA)->heap, sizeof (T))
416 #define NDR_NEWN(XA, T, N) ndr_heap_malloc((XA)->heap, sizeof (T)*(N))
417 #define NDR_STRDUP(XA, S) ndr_heap_strdup((XA)->heap, (S))
418 #define NDR_MSTRING(XA, S, OUT) ndr_heap_mstring((XA)->heap, (S), (OUT))
419 #define NDR_SIDDUP(XA, S) ndr_heap_siddup((XA)->heap, (S))
430 ndr_heap_t *heap; member
457 ndr_heap_t *heap; member
H A Dndr_ops.c126 int composite_op, ndr_heap_t *heap) in nds_initialize() argument
131 assert(heap); in nds_initialize()
135 nds->heap = (struct ndr_heap *)heap; in nds_initialize()
204 return (ndr_heap_malloc((ndr_heap_t *)nds->heap, len)); in ndo_malloc()
H A Dndr_server.c103 if ((mxa->heap = ndr_heap_create()) == NULL) in ndr_pipe_process()
107 rc = nds_initialize(recv_nds, 0, NDR_MODE_CALL_RECV, mxa->heap); in ndr_pipe_process()
112 rc = nds_initialize(send_nds, 0, NDR_MODE_RETURN_SEND, mxa->heap); in ndr_pipe_process()
129 ndr_heap_destroy(mxa->heap); in ndr_pipe_process()
553 if (mxa->heap == NULL) { in ndr_generic_call_stub()
564 if ((param = ndr_heap_malloc(mxa->heap, p_len)) == NULL) in ndr_generic_call_stub()
/titanic_44/usr/src/uts/intel/io/drm/
H A Di915_mem.c142 static struct mem_block *alloc_block(struct mem_block *heap, int size, in alloc_block() argument
148 for (p = heap->next; p != heap; p = p->next) { in alloc_block()
157 static struct mem_block *find_block(struct mem_block *heap, int start) in find_block() argument
161 for (p = heap->next; p != heap; p = p->next) in find_block()
168 struct mem_block *find_block_by_proc(struct mem_block *heap, drm_file_t *fpriv) in find_block_by_proc() argument
172 for (p = heap->next; p != heap; p = p->next) in find_block_by_proc()
205 static int init_heap(struct mem_block **heap, int start, int size) in init_heap() argument
212 *heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFLISTS); in init_heap()
213 if (!*heap) { in init_heap()
221 blocks->next = blocks->prev = *heap; in init_heap()
[all …]
H A Dradeon_mem.c93 alloc_block(struct mem_block *heap, int size, int align2, drm_file_t *filp) in alloc_block() argument
98 for (p = heap->next; p != heap; p = p->next) { in alloc_block()
108 find_block(struct mem_block *heap, int start) in find_block() argument
112 for (p = heap->next; p != heap; p = p->next) in find_block()
149 init_heap(struct mem_block **heap, int start, int size) in init_heap() argument
156 *heap = drm_alloc(sizeof (**heap), DRM_MEM_BUFS); in init_heap()
157 if (!*heap) { in init_heap()
165 blocks->next = blocks->prev = *heap; in init_heap()
167 (void) memset(*heap, 0, sizeof (**heap)); in init_heap()
168 (*heap)->filp = (drm_file_t *)-1; in init_heap()
[all …]
/titanic_44/usr/src/lib/libresolv2/common/isc/
H A Dheap.c70 ctx->heap = NULL; in heap_new()
83 if (ctx->heap != NULL) in heap_free()
84 free(ctx->heap); in heap_free()
95 new_heap = (void **)realloc(ctx->heap, in heap_resize()
101 ctx->heap = new_heap; in heap_resize()
110 i > 1 && ctx->higher_priority(elt, ctx->heap[p]); in float_up()
112 ctx->heap[i] = ctx->heap[p]; in float_up()
114 (ctx->index)(ctx->heap[i], i); in float_up()
116 ctx->heap[i] = elt; in float_up()
118 (ctx->index)(ctx->heap[i], i); in float_up()
[all …]
/titanic_44/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]; \
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 …]
/titanic_44/usr/src/lib/smbsrv/libmlsvc/common/
H A Dmlsvc_client.c155 if ((clnt->heap = ndr_heap_create()) == NULL) in ndr_rpc_bind()
181 ndr_heap_destroy(clnt->heap); in ndr_rpc_bind()
211 ndr_heap_destroy(clnt->heap); in ndr_rpc_unbind()
308 ndr_heap_t *heap; in ndr_rpc_malloc() local
310 if ((heap = ndr_rpc_get_heap(handle)) == NULL) in ndr_rpc_malloc()
313 return (ndr_heap_malloc(heap, size)); in ndr_rpc_malloc()
321 if (clnt->heap == NULL) in ndr_rpc_get_heap()
322 clnt->heap = ndr_heap_create(); in ndr_rpc_get_heap()
324 return (clnt->heap); in ndr_rpc_get_heap()
341 ndr_heap_destroy(clnt->heap); in ndr_rpc_release()
[all …]
H A Dnetr_logon.c303 ndr_heap_t *heap; in netr_server_samlogon() local
341 heap = ndr_rpc_get_heap(netr_handle); in netr_server_samlogon()
345 netr_setup_identity(heap, user_info, &info1.identity); in netr_server_samlogon()
356 netr_setup_identity(heap, user_info, &info2.identity); in netr_server_samlogon()
357 netr_network_samlogon(heap, netr_info, user_info, &info2); in netr_server_samlogon()
436 netr_network_samlogon(ndr_heap_t *heap, netr_info_t *netr_info, in netr_network_samlogon() argument
450 ndr_heap_mkvcb(heap, user_info->lg_nt_password.val, len, in netr_network_samlogon()
457 ndr_heap_mkvcb(heap, user_info->lg_lm_password.val, len, in netr_network_samlogon()
590 netr_setup_identity(ndr_heap_t *heap, smb_logon_t *user_info, in netr_setup_identity() argument
610 ndr_heap_mkvcs(heap, user_info->lg_domain, in netr_setup_identity()
[all …]
/titanic_44/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
227 grub_memmove (heap, old_entry, (int) cur_entry - (int) old_entry); in run_script()
228 if (! *heap) in run_script()
244 grub_memmove (heap, "boot", 5); 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()
553 heap -= (((int) ptr) - ((int) cur_entry)); in run_menu()
647 new_heap = heap; in run_menu()
655 new_heap = heap + NEW_HEAPSIZE + 1; in run_menu()
673 run_menu (heap, NULL, new_num_entries, new_heap, 0); in run_menu()
679 new_heap = heap + NEW_HEAPSIZE + 1; in run_menu()
703 (int) heap - ((int) cur_entry + i)); in run_menu()
[all …]
/titanic_44/usr/src/cmd/pack/
H A Dpack.c108 struct heap { struct
111 } heap [END+2]; variable
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()
235 if (heapsubi.count < heap[k].count) in heapify()
237 hmove(heap[k], heap[i]); in heapify()
240 hmove(heapsubi, heap[i]); in heapify()
263 heap[++n].count = count[i]; in packfile()
264 heap[n].node = i; in packfile()
[all …]
/titanic_44/usr/src/lib/smbsrv/libsmbns/common/
H A Dsmbns_netbios_name.c484 unsigned char *heap = buf; in smb_name_buf_from_packet() local
485 unsigned char *end_heap = heap + n_buf; in smb_name_buf_from_packet()
494 dnptrs[0] = heap; in smb_name_buf_from_packet()
497 BE_OUT16(heap, npb->name_trn_id); in smb_name_buf_from_packet()
498 heap += 2; in smb_name_buf_from_packet()
500 BE_OUT16(heap, npb->info); in smb_name_buf_from_packet()
501 heap += 2; in smb_name_buf_from_packet()
503 BE_OUT16(heap, npb->qdcount); in smb_name_buf_from_packet()
504 heap += 2; in smb_name_buf_from_packet()
506 BE_OUT16(heap, npb->ancount); in smb_name_buf_from_packet()
[all …]
/titanic_44/usr/src/uts/common/os/
H A Dcallout.c536 callout_heap_t *heap; in callout_heap_expand() local
547 heap = kmem_alloc(size, KM_NOSLEEP); in callout_heap_expand()
550 if (heap == NULL) { in callout_heap_expand()
570 kmem_free(heap, size); in callout_heap_expand()
574 bcopy(ct->ct_heap, heap, osize); in callout_heap_expand()
576 ct->ct_heap = heap; in callout_heap_expand()
592 callout_heap_t *heap, *hcurrent, *hparent; in callout_upheap() local
601 heap = ct->ct_heap; in callout_upheap()
606 hparent = &heap[parent]; in callout_upheap()
607 hcurrent = &heap[current]; in callout_upheap()
[all …]
H A Dcyclic.c737 cyc_index_t *heap; in cyclic_upheap() local
744 heap = cpu->cyp_heap; in cyclic_upheap()
749 current = heap[heap_current]; in cyclic_upheap()
750 parent = heap[heap_parent]; in cyclic_upheap()
762 heap[heap_parent] = current; in cyclic_upheap()
763 heap[heap_current] = parent; in cyclic_upheap()
780 cyc_index_t *heap = cpu->cyp_heap; in cyclic_downheap() local
794 left = heap[heap_left]; in cyclic_downheap()
795 me = heap[heap_me]; in cyclic_downheap()
806 right = heap[heap_right]; in cyclic_downheap()
[all …]
/titanic_44/usr/src/cmd/mdb/common/modules/genunix/
H A Dcyclic.c132 cyclic_dump_node(cyc_cpu_t *cpu, cyc_index_t *heap, char **c, size_t w, in cyclic_dump_node() argument
142 me = heap[ndx]; in cyclic_dump_node()
172 heap[heap_left]); in cyclic_dump_node()
178 heap[heap_right]); in cyclic_dump_node()
183 cyclic_dump_node(cpu, heap, c, w, heap_left, l, x, depth + 1); in cyclic_dump_node()
186 cyclic_dump_node(cpu, heap, c, w, heap_right, x, r, depth + 1); in cyclic_dump_node()
198 cyc_index_t *heap; in cyclic_pretty_dump() local
201 heap = mdb_alloc(hsize, UM_SLEEP | UM_GC); in cyclic_pretty_dump()
203 if (mdb_vread(heap, hsize, (uintptr_t)cpu->cyp_heap) == -1) { in cyclic_pretty_dump()
218 cyclic_dump_node(cpu, heap, c, width, 0, 1, width - 2, 0); in cyclic_pretty_dump()
[all …]
/titanic_44/usr/src/uts/common/zmod/
H A Dtrees.c436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
460 int v = s->heap[k];
465 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
469 if (smaller(tree, v, s->heap[j], s->depth)) break;
472 s->heap[k] = s->heap[j]; k = j;
477 s->heap[k] = v;
512 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
515 n = s->heap[h];
556 m = s->heap[--h];
[all …]
/titanic_44/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.
/titanic_44/usr/src/lib/libast/common/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]))
/titanic_44/usr/src/cmd/sendmail/libsm/
H A DMakefile42 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 \
/titanic_44/usr/src/lib/libresolv2/include/isc/
H A Dheap.h26 void **heap; member
/titanic_44/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
1794 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)) {
1827 if (smaller(tree, v, s->heap[j], s->depth)) break;
1830 s->heap[k] = s->heap[j]; k = j;
1835 s->heap[k] = v;
1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
1873 n = s->heap[h];
[all …]
/titanic_44/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c486 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
2598 top = s->heap[SMALLEST]; \
2599 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2624 int v = s->heap[k];
2629 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
2633 if (smaller(tree, v, s->heap[j], s->depth)) break;
2636 s->heap[k] = s->heap[j]; k = j;
2641 s->heap[k] = v;
2680 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2683 n = s->heap[h];
[all …]

12