/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/sh/boot/compressed/ |
H A D | misc.c | 47 #define HEAP_SIZE 0x400000 macro 49 #define HEAP_SIZE 0x10000 macro 127 free_mem_end_ptr = free_mem_ptr + HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/s390/boot/compressed/ |
H A D | misc.c | 36 #define HEAP_SIZE 0x400000 macro 38 #define HEAP_SIZE 0x10000 macro 139 free_mem_end_ptr = free_mem_ptr + HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | defutil.h | 27 #define HEAP_SIZE (2*L_CODES+1) macro 168 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
H A D | deftree.c | 432 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 467 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 554 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/h8300/boot/compressed/ |
H A D | misc.c | 87 #define HEAP_SIZE 0x10000 macro 175 free_mem_end_ptr = free_mem_ptr + HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/xtensa/boot/boot-redboot/ |
H A D | bootstrap.S | 28 #define HEAP_SIZE (131072*4) define 234 .long _heap + HEAP_SIZE 237 .comm _heap, HEAP_SIZE
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/alpha/boot/ |
H A D | misc.c | 98 #define HEAP_SIZE 0x3000 macro
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
H A D | deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) macro 195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
H A D | trees.c | 512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/ |
H A D | deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) macro 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
H A D | trees.c | 514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 549 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/mn10300/boot/compressed/ |
H A D | misc.c | 150 #define HEAP_SIZE 0x3000 macro 152 static uch *high_buffer_start /* = (uch *)(((ulg)&end) + HEAP_SIZE)*/; 329 high_buffer_start = (uch *)(((ulg) &end) + HEAP_SIZE);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) macro 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
H A D | trees.c | 514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 549 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/ |
H A D | deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) macro 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
H A D | trees.c | 514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 549 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
H A D | deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) macro 195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
H A D | trees.c | 512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/powerpc/boot/ |
H A D | prpmc2800.c | 510 #define HEAP_SIZE (16*MB) macro 542 if ((unsigned)simple_alloc_init(heap_start, HEAP_SIZE, 2*KB, 16)
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | trees.c | 235 #define HEAP_SIZE (2*L_CODES+1) macro 238 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 662 for (h = heap_max+1; h < HEAP_SIZE; h++) { 697 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 779 heap_len = 0, heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/ |
H A D | gzip.c | 856 #define HEAP_SIZE (2*L_CODES + 1) macro 871 ush heap[HEAP_SIZE]; /* heap used to build the Huffman trees */ 879 ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 1085 for (h = G2.heap_max + 1; h < HEAP_SIZE; h++) { 1129 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 1230 G2.heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 170 #define HEAP_SIZE (2*L_CODES+1) macro 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 1872 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 1907 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/ |
H A D | zlib.c | 170 #define HEAP_SIZE (2*L_CODES+1) macro 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 1872 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 1907 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 296 #define HEAP_SIZE (2*L_CODES+1) macro 438 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 2270 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 2305 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 2390 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/ |
H A D | zlib.c | 296 #define HEAP_SIZE (2*L_CODES+1) macro 438 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 2270 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 2305 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 2390 s->heap_len = 0, s->heap_max = HEAP_SIZE;
|