heap 12 core/memmgmt.c extern void *suba_init(void *heap, unsigned size, unsigned mincell, char *name); heap 13 core/memmgmt.c extern void *suba_alloc(void *heap, unsigned size, unsigned zero); heap 14 core/memmgmt.c extern int suba_free(void *heap, void *p); heap 20 core/memmgmt.c void *heap; heap 28 core/memmgmt.c h->heap = 0; heap 70 core/memmgmt.c h->heap = suba_init(h->start,h->size,8,name); heap 78 core/memmgmt.c if (h && h->heap) heap 79 core/memmgmt.c return suba_alloc(h->heap,size,0); heap 85 core/memmgmt.c if (h && h->heap && (p >= h->start) && (p < h->end)) heap 87 core/memmgmt.c suba_free(h->heap,p); heap 96 core/memmgmt.c if (h && h->heap) heap 103 core/memmgmt.c suba_getmeminfo(h->heap, heap 482 tools/ghidra_scripts/datatypes/fw_functions.h __stdcall void *heap_alloc(void *heap, unsigned size); // used by malloc and other heaps heap 483 tools/ghidra_scripts/datatypes/fw_functions.h __stdcall void heap_free(void *heap, void *p); heap 203 tools/packfi2/deflate.h int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ heap 436 tools/packfi2/trees.c top = s->heap[SMALLEST]; \ heap 437 tools/packfi2/trees.c s->heap[SMALLEST] = s->heap[s->heap_len--]; \ heap 460 tools/packfi2/trees.c int v = s->heap[k]; heap 465 tools/packfi2/trees.c smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { heap 469 tools/packfi2/trees.c if (smaller(tree, v, s->heap[j], s->depth)) break; heap 472 tools/packfi2/trees.c s->heap[k] = s->heap[j]; k = j; heap 477 tools/packfi2/trees.c s->heap[k] = v; heap 512 tools/packfi2/trees.c tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ heap 515 tools/packfi2/trees.c n = s->heap[h]; heap 556 tools/packfi2/trees.c m = s->heap[--h]; heap 638 tools/packfi2/trees.c s->heap[++(s->heap_len)] = max_code = n; heap 651 tools/packfi2/trees.c node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); heap 670 tools/packfi2/trees.c m = s->heap[SMALLEST]; /* m = node of next least frequency */ heap 672 tools/packfi2/trees.c s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ heap 673 tools/packfi2/trees.c s->heap[--(s->heap_max)] = m; heap 687 tools/packfi2/trees.c s->heap[SMALLEST] = node++; heap 692 tools/packfi2/trees.c s->heap[--(s->heap_max)] = s->heap[SMALLEST];