Searched refs:heap (Results 1 - 21 of 21) sorted by relevance

/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/char/drm/
H A Dradeon_mem.c83 static struct mem_block *alloc_block(struct mem_block *heap, int size, argument
89 list_for_each(p, heap) {
98 static struct mem_block *find_block(struct mem_block *heap, int start) argument
102 list_for_each(p, heap)
114 * 'heap' to stop it being subsumed.
133 /* Initialize. How to check for an uninitialized heap?
135 static int init_heap(struct mem_block **heap, int start, int size) argument
142 *heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFS);
143 if (!*heap) {
161 radeon_mem_release(DRMFILE filp, struct mem_block *heap) argument
189 radeon_mem_takedown(struct mem_block **heap) argument
225 struct mem_block *block, **heap; local
263 struct mem_block *block, **heap; local
293 struct mem_block **heap; local
[all...]
H A Di915_mem.c133 static struct mem_block *alloc_block(struct mem_block *heap, int size, argument
139 for (p = heap->next; p != heap; p = p->next) {
148 static struct mem_block *find_block(struct mem_block *heap, int start) argument
152 for (p = heap->next; p != heap; p = p->next)
164 * 'heap' to stop it being subsumed.
183 /* Initialize. How to check for an uninitialized heap?
185 static int init_heap(struct mem_block **heap, int start, int size) argument
192 *heap
211 i915_mem_release(drm_device_t * dev, DRMFILE filp, struct mem_block *heap) argument
241 i915_mem_takedown(struct mem_block **heap) argument
275 struct mem_block *block, **heap; local
315 struct mem_block *block, **heap; local
346 struct mem_block **heap; local
374 struct mem_block **heap; local
[all...]
H A Di915_drv.h47 * 1.4: Fix cmdbuffer path, add heap destroy
73 DRMFILE filp; /* 0: free, -1: heap, other: real files */
150 extern void i915_mem_takedown(struct mem_block **heap);
152 DRMFILE filp, struct mem_block *heap);
H A Dradeon_drv.h190 DRMFILE filp; /* 0: free, -1: heap, other: real files */
349 extern void radeon_mem_takedown(struct mem_block **heap);
350 extern void radeon_mem_release(DRMFILE filp, struct mem_block *heap);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/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...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/openssl/crypto/ec/
H A Decp_smpl.c1543 BIGNUM **heap = NULL; local
1574 heap = OPENSSL_malloc(pow2 * sizeof heap[0]);
1575 if (heap == NULL) goto err;
1579 * heap[1]
1580 * heap[2] heap[3]
1581 * heap[4] heap[5] heap[
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/openssl-0.9.8e/crypto/ec/
H A Decp_smpl.c1542 BIGNUM **heap = NULL; local
1573 heap = OPENSSL_malloc(pow2 * sizeof heap[0]);
1574 if (heap == NULL) goto err;
1578 * heap[1]
1579 * heap[2] heap[3]
1580 * heap[4] heap[5] heap[
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/zlib-1.2.3/
H A Dtrees.c92 * need for the L_CODES extra codes used during heap construction. However
427 /* Index within the heap array of least frequent node in the Huffman tree */
431 * Remove the smallest element from the heap and recreate the heap with
432 * one less element. Updates heap and heap_len.
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
450 * Restore the heap property by moving down the tree starting at node k,
452 * when the heap propert
[all...]
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.
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/zlib-1.2.3/
H A Dtrees.c92 * need for the L_CODES extra codes used during heap construction. However
427 /* Index within the heap array of least frequent node in the Huffman tree */
431 * Remove the smallest element from the heap and recreate the heap with
432 * one less element. Updates heap and heap_len.
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
450 * Restore the heap property by moving down the tree starting at node k,
452 * when the heap propert
[all...]
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.
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/lib/zlib_deflate/
H A Ddeftree.c89 * need for the L_CODES extra codes used during heap construction. However
343 /* Index within the heap array of least frequent node in the Huffman tree */
347 * Remove the smallest element from the heap and recreate the heap with
348 * one less element. Updates heap and heap_len.
352 top = s->heap[SMALLEST]; \
353 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
366 * Restore the heap property by moving down the tree starting at node k,
368 * when the heap propert
[all...]
H A Ddefutil.h28 /* maximum heap size */
179 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:deflate_state
180 int heap_len; /* number of elements in the heap */
182 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
183 * The same heap array is used to build all trees.
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/router/busybox-1.x/archival/
H A Dgzip.c30 * 0000047a b heap
857 /* maximum heap size */
871 ush heap[HEAP_SIZE]; /* heap used to build the Huffman trees */ member in struct:globals2
872 int heap_len; /* number of elements in the heap */
875 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
876 * The same heap arra
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/m32r/boot/compressed/
H A Dmisc.c196 unsigned int zimage_len, unsigned long heap)
200 free_mem_ptr = heap;
195 decompress_kernel(int mmu_on, unsigned char *zimage_data, unsigned int zimage_len, unsigned long heap) argument
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/shared/
H A Dbzip2_inflate.c1714 zz = z; tmp = heap[zz]; \
1715 while (weight[tmp] < weight[heap[zz >> 1]]) { \
1716 heap[zz] = heap[zz >> 1]; \
1719 heap[zz] = tmp; \
1725 zz = z; tmp = heap[zz]; \
1730 weight[heap[yy+1]] < weight[heap[yy]]) \
1732 if (weight[tmp] < weight[heap[yy]]) break; \
1733 heap[z
1752 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/x86_64/boot/compressed/
H A Dmisc.c338 asmlinkage void decompress_kernel(void *rmode, unsigned long heap, argument
355 free_mem_ptr = heap; /* Heap */
356 free_mem_end_ptr = heap + HEAP_SIZE;
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/lib/
H A Dprio_tree.c19 * A clever mix of heap and radix trees forms a radix priority search tree (PST)
54 unsigned long *radix, unsigned long *heap)
61 *heap = HEAP_INDEX(vma);
65 *heap = node->last;
52 get_index(const struct prio_tree_root *root, const struct prio_tree_node *node, unsigned long *radix, unsigned long *heap) argument
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/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...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/common/
H A Dzlib.c297 /* maximum heap size */
449 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:deflate_state
450 int heap_len; /* number of elements in the heap */
452 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
453 * The same heap array is used to build all trees.
1919 * need for the L_CODES extra codes used during heap constructio
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/samba-3.0.13/source/
H A Dconfigure854 --enable-dmalloc Enable heap debugging default=no
[all...]

Completed in 232 milliseconds