Searched refs:heap (Results 1 - 8 of 8) sorted by relevance
/u-boot/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[z 116 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local [all...] |
/u-boot/fs/ubifs/ |
H A D | lprops.c | 27 * get_heap_comp_val - get the LEB properties value for heap comparisons. 44 * move_up_lpt_heap - move a new heap entry up as far as possible. 46 * @heap: LEB category heap 50 * New entries to a heap are added at the bottom and then moved up until the 55 static void move_up_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, argument 62 return; /* Already top of the heap */ 64 /* Compare to parent and, if greater, move up the heap */ 68 val2 = get_heap_comp_val(heap->arr[ppos], cat); 72 heap 92 adjust_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, struct ubifs_lprops *lprops, int hpos, int cat) argument 174 struct ubifs_lpt_heap *heap = &c->lpt_heap[cat - 1]; local 222 struct ubifs_lpt_heap *heap; local 253 struct ubifs_lpt_heap *heap; local 449 struct ubifs_lpt_heap *heap; local 764 struct ubifs_lpt_heap *heap; local 935 struct ubifs_lpt_heap *heap = &c->lpt_heap[cat - 1]; local 957 dbg_check_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat, int add_pos) argument 1078 struct ubifs_lpt_heap *heap = &c->lpt_heap[cat - 1]; local [all...] |
H A D | lpt_commit.c | 809 struct ubifs_lpt_heap *heap; local 838 heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1]; 839 for (i = 0; i < heap->cnt; i++) { 840 c->lsave[cnt++] = heap->arr[i]->lnum; 844 heap = &c->lpt_heap[LPROPS_DIRTY - 1]; 845 for (i = 0; i < heap->cnt; i++) { 846 c->lsave[cnt++] = heap->arr[i]->lnum; 850 heap = &c->lpt_heap[LPROPS_FREE - 1]; 851 for (i = 0; i < heap->cnt; i++) { 852 c->lsave[cnt++] = heap 2015 struct ubifs_lpt_heap *heap; local [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 | 2115 struct ubifs_lpt_heap *heap; local 2177 heap = &c->lpt_heap[cat - 1]; 2178 if (lprops->hpos < heap->cnt && 2179 heap->arr[lprops->hpos] == lprops) 2194 ubifs_err(c, "LEB %d cat %d not found in cat heap/list",
|
H A D | debug.c | 917 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat) argument 922 pr_err("(pid %d) start dumping heap cat %d (%d elements)\n", 923 current->pid, cat, heap->cnt); 924 for (i = 0; i < heap->cnt; i++) { 925 struct ubifs_lprops *lprops = heap->arr[i]; 931 pr_err("(pid %d) finish dumping heap\n", current->pid);
|
/u-boot/lib/zlib/ |
H A D | trees.c | 94 * need for the L_CODES extra codes used during heap construction. However 432 /* Index within the heap array of least frequent node in the Huffman tree */ 436 * Remove the smallest element from the heap and recreate the heap with 437 * one less element. Updates heap and heap_len. 441 top = s->heap[SMALLEST]; \ 442 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 455 * Restore the heap property by moving down the tree starting at node k, 457 * when the heap propert [all...] |
H A D | deflate.h | 46 /* 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.
|
Completed in 86 milliseconds