函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\zlib_deflate\deftree.c Create Date:2022-07-27 07:56:02
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：pqdownheap

函数原型：static void pqdownheap(deflate_state *s, ct_data *tree, int k)

返回类型：void

参数：

类型参数名称
deflate_state *s
ct_data *tree
intk
377  v等于umber of codes at each bit length for an optimal tree [k]
378  j等于k左移1位
379  当j小于等于heap_len循环
381  如果j小于heap_len且Compares to subtrees, using the tree depth as tie breaker when* the subtrees have equal frequency. This minimizes the worst case length.(tree, umber of codes at each bit length for an optimal tree [j + 1], umber of codes at each bit length for an optimal tree [j], The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.* The same heap array is used to build all trees.)则
383  j自加
386  如果Compares to subtrees, using the tree depth as tie breaker when* the subtrees have equal frequency. This minimizes the worst case length.(tree, v, umber of codes at each bit length for an optimal tree [j], The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.* The same heap array is used to build all trees.)则退出
389  umber of codes at each bit length for an optimal tree [k]等于umber of codes at each bit length for an optimal tree [j]
389  k等于j
392  j左移等于1位
394  umber of codes at each bit length for an optimal tree [k]等于v
调用者
名称描述
build_tree