函数逻辑报告 |
Source Code:lib\xz\xz_dec_lzma2.c |
Create Date:2022-07-27 08:06:33 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:Decode a bittree starting from the most significant bit.
函数原型:static __always_inline uint32_t rc_bittree(struct rc_dec *rc, uint16_t *probs, uint32_t limit)
返回类型:uint32_t
参数:
类型 | 参数 | 名称 |
---|---|---|
struct rc_dec * | rc | |
uint16_t * | probs | |
uint32_t | limit |
522 | symbol等于1 |
524 | 循环 |
527 | 否则symbol左移等于1位 |
531 | 返回:symbol |
名称 | 描述 |
---|---|
lzma_literal | Decode a literal (one 8-bit byte) |
lzma_len | Decode the length of the match into s->lzma.len. |
lzma_match | Decode a match. The distance will be stored in s->lzma.rep0. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |