Searched refs:heap (Results 1 – 12 of 12) sorted by relevance
| /rk3399_rockchip-uboot/lib/bzip2/ |
| H A D | bzlib_huffman.c | 77 zz = z; tmp = heap[zz]; \ 78 while (weight[tmp] < weight[heap[zz >> 1]]) { \ 79 heap[zz] = heap[zz >> 1]; \ 82 heap[zz] = tmp; \ 88 zz = z; tmp = heap[zz]; \ 93 weight[heap[yy+1]] < weight[heap[yy]]) \ 95 if (weight[tmp] < weight[heap[yy]]) break; \ 96 heap[zz] = heap[yy]; \ 99 heap[zz] = tmp; \ 116 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local [all …]
|
| /rk3399_rockchip-uboot/fs/ubifs/ |
| H A D | lprops.c | 54 static void move_up_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, in move_up_lpt_heap() argument 67 val2 = get_heap_comp_val(heap->arr[ppos], cat); in move_up_lpt_heap() 71 heap->arr[ppos]->hpos = hpos; in move_up_lpt_heap() 72 heap->arr[hpos] = heap->arr[ppos]; in move_up_lpt_heap() 73 heap->arr[ppos] = lprops; in move_up_lpt_heap() 91 static void adjust_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, in adjust_lpt_heap() argument 101 val2 = get_heap_comp_val(heap->arr[ppos], cat); in adjust_lpt_heap() 105 heap->arr[ppos]->hpos = hpos; in adjust_lpt_heap() 106 heap->arr[hpos] = heap->arr[ppos]; in adjust_lpt_heap() 107 heap->arr[ppos] = lprops; in adjust_lpt_heap() [all …]
|
| H A D | lpt_commit.c | 806 struct ubifs_lpt_heap *heap; in populate_lsave() local 835 heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1]; in populate_lsave() 836 for (i = 0; i < heap->cnt; i++) { in populate_lsave() 837 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave() 841 heap = &c->lpt_heap[LPROPS_DIRTY - 1]; in populate_lsave() 842 for (i = 0; i < heap->cnt; i++) { in populate_lsave() 843 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave() 847 heap = &c->lpt_heap[LPROPS_FREE - 1]; in populate_lsave() 848 for (i = 0; i < heap->cnt; i++) { in populate_lsave() 849 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave() [all …]
|
| H A D | debug.h | 312 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, 338 void dbg_check_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat,
|
| H A D | lpt.c | 2114 struct ubifs_lpt_heap *heap; in dbg_chk_pnode() local 2176 heap = &c->lpt_heap[cat - 1]; in dbg_chk_pnode() 2177 if (lprops->hpos < heap->cnt && in dbg_chk_pnode() 2178 heap->arr[lprops->hpos] == lprops) in dbg_chk_pnode()
|
| H A D | debug.c | 897 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat) in ubifs_dump_heap() argument 902 current->pid, cat, heap->cnt); in ubifs_dump_heap() 903 for (i = 0; i < heap->cnt; i++) { in ubifs_dump_heap() 904 struct ubifs_lprops *lprops = heap->arr[i]; in ubifs_dump_heap()
|
| /rk3399_rockchip-uboot/lib/zlib/ |
| H A D | trees.c | 440 top = s->heap[SMALLEST]; \ 441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 464 int v = s->heap[k]; 469 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 473 if (smaller(tree, v, s->heap[j], s->depth)) break; 476 s->heap[k] = s->heap[j]; k = j; 481 s->heap[k] = v; 516 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ 519 n = s->heap[h]; 560 m = s->heap[--h]; [all …]
|
| H A D | deflate.h | 203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
|
| /rk3399_rockchip-uboot/arch/arm/mach-omap2/am33xx/ |
| H A D | Kconfig | 256 heap, globals etc. When the ROM is copying the boot
|
| /rk3399_rockchip-uboot/common/spl/ |
| H A D | Kconfig | 84 this will make the SPL binary smaller at the cost of more heap 93 this will make the TPL binary smaller at the cost of more heap 115 hex "Size of malloc_simple heap after switching to DRAM SPL stack" 120 to give board_init_r() a larger heap then the initial heap in
|
| /rk3399_rockchip-uboot/arch/arm/dts/ |
| H A D | imx7ulp.dtsi | 596 fsl,heap-id = <0>;
|
| /rk3399_rockchip-uboot/common/ |
| H A D | dlmalloc.src | 771 can reclaim and reallocate normal heap memory. Using a
|