Searched defs:heap (Results 1 - 25 of 26) sorted by relevance

12

/illumos-gate/usr/src/test/os-tests/tests/secflags/
H A Daddrs.c11 void *heap = NULL; local
14 if ((heap = malloc(10)) == NULL)
22 printf(" heap: 0x%p\n", heap);
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dheap.h26 void **heap; member in struct:heap_context
/illumos-gate/usr/src/grub/grub-0.97/stage2/
H A Dcmdline.c123 enter_cmdline (char *heap, int forever) argument
140 *heap = 0;
145 if (get_cmdline (PACKAGE "> ", heap, 2048, 0, 1))
149 if (! heap[0])
153 builtin = find_command (heap);
173 arg = skip_to (1, heap);
185 run_script (char *script, char *heap) argument
227 grub_memmove (heap, old_entry, (int) cur_entry - (int) old_entry);
228 if (! *heap)
244 grub_memmove (heap, "boo
[all...]
H A Dstage2.c238 char *heap, int entryno)
536 ((int) heap) - ((int) cur_entry));
541 heap += 2;
552 ((int) heap) - ((int) ptr));
553 heap -= (((int) ptr) - ((int) cur_entry));
647 new_heap = heap;
655 new_heap = heap + NEW_HEAPSIZE + 1;
673 run_menu (heap, NULL, new_num_entries, new_heap, 0);
679 new_heap = heap + NEW_HEAPSIZE + 1;
703 (int) heap
237 run_menu(char *menu_entries, char *config_entries, int num_entries, char *heap, int entryno) argument
[all...]
/illumos-gate/usr/src/uts/intel/io/drm/
H A Dradeon_mem.c93 alloc_block(struct mem_block *heap, int size, int align2, drm_file_t *filp) argument
98 for (p = heap->next; p != heap; p = p->next) {
108 find_block(struct mem_block *heap, int start) argument
112 for (p = heap->next; p != heap; p = p->next)
126 * 'heap' to stop it being subsumed.
146 * Initialize. How to check for an uninitialized heap?
149 init_heap(struct mem_block **heap, int start, int size) argument
156 *heap
177 radeon_mem_release(drm_file_t *filp, struct mem_block *heap) argument
208 radeon_mem_takedown(struct mem_block **heap) argument
247 struct mem_block *block, **heap; local
303 struct mem_block *block, **heap; local
334 struct mem_block **heap; local
[all...]
H A Di915_mem.c142 static struct mem_block *alloc_block(struct mem_block *heap, int size, argument
148 for (p = heap->next; p != heap; p = p->next) {
157 static struct mem_block *find_block(struct mem_block *heap, int start) argument
161 for (p = heap->next; p != heap; p = p->next)
168 struct mem_block *find_block_by_proc(struct mem_block *heap, drm_file_t *fpriv) argument
172 for (p = heap->next; p != heap; p = p->next)
184 * 'heap' t
205 init_heap(struct mem_block **heap, int start, int size) argument
231 i915_mem_release(drm_device_t * dev, drm_file_t *fpriv, struct mem_block *heap) argument
261 i915_mem_takedown(struct mem_block **heap) argument
296 struct mem_block *block, **heap; local
345 struct mem_block *block, **heap; local
376 struct mem_block **heap; local
403 struct mem_block **heap; local
[all...]
/illumos-gate/usr/src/boot/sys/boot/efi/libefi/
H A Dlibefi.c40 static EFI_PHYSICAL_ADDRESS heap; variable
78 BS->FreePages(heap, EFI_SIZE_TO_PAGES(heapsize));
107 heap = 0x0000000100000000;
109 EFI_SIZE_TO_PAGES(heapsize), &heap);
113 setheap((void *)(uintptr_t)heap, (void *)(uintptr_t)(heap + heapsize));
/illumos-gate/usr/src/lib/smbsrv/libmlrpc/common/
H A Dndr_heap.c27 * NDR heap management. The heap is used for temporary storage by
29 * support the different requirements of the various RPCs, the heap
34 * that we actually need a lot heap space.
37 * allocated, it remains allocated until the heap is destroyed. This
38 * shouldn't be an issue because the heap is being filled with data to
40 * the point that the entire heap is no longer required.
54 * Allocate a heap structure and the first heap block. For many RPC
56 * in this instance of the heap
69 ndr_heap_t *heap; local
98 ndr_heap_destroy(ndr_heap_t *heap) argument
124 ndr_heap_malloc(ndr_heap_t *heap, unsigned size) argument
160 ndr_heap_strdup(ndr_heap_t *heap, const char *s) argument
184 ndr_heap_mstring(ndr_heap_t *heap, const char *s, ndr_mstring_t *out) argument
208 ndr_heap_mkvcs(ndr_heap_t *heap, char *s, ndr_vcstr_t *vc) argument
228 ndr_heap_mkvcb(ndr_heap_t *heap, uint8_t *data, uint32_t datalen, ndr_vcbuf_t *vcbuf) argument
256 ndr_heap_siddup(ndr_heap_t *heap, smb_sid_t *sid) argument
274 ndr_heap_used(ndr_heap_t *heap) argument
286 ndr_heap_avail(ndr_heap_t *heap) argument
[all...]
H A Dndr_ops.c121 * 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 Dlibmlrpc.h94 * A heap is a single, monolithic chunk of memory that NDR RPC manages
96 * heap is disposed of as a single item. The transaction, which
98 * keeping for the heap.
326 * A number of heap areas are used during marshalling and unmarshalling.
334 * The heap management data definition looks a bit like this:
336 * heap -> +---------------+ +------------+
354 * of the first heap block.
414 #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, sizeo
430 ndr_heap_t *heap; member in struct:ndr_xa
457 ndr_heap_t *heap; member in struct:ndr_client
[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]; \
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[z
75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/illumos-gate/usr/src/lib/smbsrv/libmlsvc/common/
H A Dmlsvc_client.c186 if ((clnt->heap = ndr_heap_create()) == NULL) {
226 ndr_heap_destroy(clnt->heap);
241 * If the heap has been preserved we need to go through an xa release.
242 * The heap is preserved during an RPC call because that's where data
245 * Otherwise we destroy the heap directly.
256 ndr_heap_destroy(clnt->heap);
270 * ndr_rpc_release to release the heap. Otherwise, we release the
271 * heap here.
353 ndr_heap_t *heap; local
355 if ((heap
469 ndr_heap_t *heap = clnt->heap; local
[all...]
H A Dnetr_logon.c384 ndr_heap_t *heap; local
422 heap = ndr_rpc_get_heap(netr_handle);
426 netr_setup_identity(heap, user_info, &info1.identity);
437 netr_setup_identity(heap, user_info, &info2.identity);
438 netr_network_samlogon(heap, netr_info, user_info, &info2);
517 netr_network_samlogon(ndr_heap_t *heap, netr_info_t *netr_info, argument
531 ndr_heap_mkvcb(heap, user_info->lg_nt_password.val, len,
538 ndr_heap_mkvcb(heap, user_info->lg_lm_password.val, len,
671 netr_setup_identity(ndr_heap_t *heap, smb_logon_t *user_info, argument
698 ndr_heap_mkvcs(heap, user_inf
[all...]
H A Dsamr_clnt.c511 ndr_heap_t *heap; local
527 heap = ndr_rpc_get_heap(domain_handle);
528 ndr_heap_mkvcs(heap, username, (ndr_vcstr_t *)&arg.username);
/illumos-gate/usr/src/cmd/pack/
H A Dpack.c106 /* the heap */
108 struct heap { struct
111 } heap [END+2]; variable in typeref:struct:heap
222 /* makes a heap out of heap[i],...,heap[n] */
228 struct heap heapsubi;
229 hmove(heap[i], heapsubi);
233 if (heap[k].count > heap[
[all...]
/illumos-gate/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, argument
142 me = heap[ndx];
172 heap[heap_left]);
178 heap[heap_right]);
183 cyclic_dump_node(cpu, heap, c, w, heap_left, l, x, depth + 1);
186 cyclic_dump_node(cpu, heap, c, w, heap_right, x, r, depth + 1);
198 cyc_index_t *heap; local
201 heap = mdb_alloc(hsize, UM_SLEEP | UM_GC);
203 if (mdb_vread(heap, hsize, (uintptr_t)cpu->cyp_heap) == -1) {
204 mdb_warn("couldn't read heap a
253 cyc_index_t root, i, *heap; local
[all...]
/illumos-gate/usr/src/uts/common/zmod/
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.
/illumos-gate/usr/src/boot/lib/libz/
H A Ddeflate.h46 /* maximum heap size */
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
207 int heap_len; /* number of elements in the heap */
209 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
210 * The same heap array is used to build all trees.
/illumos-gate/usr/src/lib/libumem/common/
H A Dvmem.c77 * allow a two-level "heap" arena:
84 * | "heap" |
95 * The new vmem_init() allows you to specify a "parent" of the heap, along
104 * extending the heap while vmem_populate()ing it.
1697 vmem_t *parent, *heap; local
1716 heap = vmem_create(heap_name,
1721 vmem_heap = heap;
1727 heap_alloc, heap_free, heap, 0,
1750 return (heap);
/illumos-gate/usr/src/uts/common/os/
H A Dcallout.c46 static int callout_chunk; /* callout heap chunk size */
142 * the heap. However, we do not want to look at 1-nanosecond
228 * Macro to swap two heap items.
511 * Initialize a callout table's heap, if necessary. Preallocate some free
529 * Reallocate the heap. Return 0 if the heap is still full at the end of it.
530 * Return 1 otherwise. Note that the heap only expands, it never contracts.
536 callout_heap_t *heap; local
547 heap = kmem_alloc(size, KM_NOSLEEP);
550 if (heap
592 callout_heap_t *heap, *hcurrent, *hparent; local
673 callout_heap_t *heap, *hleft, *hright, *hcurrent; local
753 callout_heap_t *heap; local
861 callout_heap_t *heap; local
[all...]
H A Dcyclic.c150 * 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...]
H A Dvmem.c51 * pieces, or *arenas*: text, data, heap, stack, and so on. Within these
52 * arenas we often subdivide further; for example, we use heap addresses
53 * not only for the kernel heap (kmem_alloc() space), but also for DVMA,
75 * contiguous ranges of integers. For example, the kernel heap consists
100 * of heap_arena (the kernel heap) that provides caching for the most
102 * it *imports* more from the heap; we say that heap_arena is the
1759 vmem_t *heap; local
1764 heap = vmem_create(heap_name,
1771 vmem_alloc, vmem_free, heap, 8 * heap_quantum,
1794 return (heap);
[all...]
/illumos-gate/usr/src/lib/smbsrv/libsmbns/common/
H A Dsmbns_netbios_name.c466 * The "buf" is used as a heap.
484 unsigned char *heap = buf; local
485 unsigned char *end_heap = heap + n_buf;
494 dnptrs[0] = heap;
497 BE_OUT16(heap, npb->name_trn_id);
498 heap += 2;
500 BE_OUT16(heap, npb->info);
501 heap += 2;
503 BE_OUT16(heap, npb->qdcount);
504 heap
672 unsigned char *heap; local
[all...]
/illumos-gate/usr/src/uts/common/smbsrv/
H A Dndr.h256 struct ndr_heap *heap; member in struct:ndr_stream
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c171 /* 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...]

Completed in 113 milliseconds

12