Function report |
Source Code:lib\decompress_bunzip2.c |
Create Date:2022-07-28 06:16:44 |
| Last Modify:2020-03-15 22:49:38 | Copyright©Brick |
| home page | Tree |
| Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:Return the next nnn bits of input. All reads from the compressed inputare done through this function. All reads are big endian
Proto:static unsigned int __attribute__((__section__(".init.text"))) __attribute__((__cold__))get_bits(struct bunzip_data *bd, char bits_wanted)
Type:unsigned int
Parameter:
| Type | Parameter | Name |
|---|---|---|
| struct bunzip_data * | bd | |
| char | bits_wanted |
| 118 | bits = 0 |
| 123 | When inbufBitCount < bits_wanted cycle |
| 126 | If , outbufPos == inbufCount Then |
| 127 | If -zero if we have IO error Then Return 0 |
| 130 | If inbufCount <= 0 Then |
| 132 | Return 0 |
| 134 | , outbufPos = 0 |
| 137 | If inbufBitCount >= 24 Then |
| 138 | bits = inbufBits & (1 << inbufBitCount) - 1 |
| 139 | bits_wanted -= inbufBitCount |
| 140 | bits <<= bits_wanted |
| 141 | inbufBitCount = 0 |
| 144 | inbufBits = inbufBits << 8 | ,*outbuf[, outbufPos++] |
| 145 | inbufBitCount += 8 |
| 148 | inbufBitCount -= bits_wanted |
| 149 | bits |= inbufBits >> inbufBitCount & (1 << bits_wanted) - 1 |
| 151 | Return bits |
| Name | Describe |
|---|---|
| get_next_block | Unpacks the next block and sets up for the inverse burrows-wheeler step. |
| start_bunzip | Allocate the structure, read file header. If in_fd ==-1, inbuf must containa complete bunzip file (len bytes long). If in_fd!=-1, inbuf and len areignored, and data is read from file handle into temporary buffer. |
| Source code conversion tool public plug-in interface | X |
|---|---|
| Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |