提交 b762450e 编写于 作者: R Randy Dunlap 提交者: Linus Torvalds

[PATCH] zlib inflate: fix function definitions

Fix function definitions to be ANSI-compliant:
lib/zlib_inflate/inffast.c:68:1: warning: non-ANSI definition of function 'inflate_fast'
lib/zlib_inflate/inftrees.c:33:1: warning: non-ANSI definition of function 'zlib_inflate_table'
Signed-off-by: NRandy Dunlap <rdunlap@xenotime.net>
Signed-off-by: NAndrew Morton <akpm@osdl.org>
Signed-off-by: NLinus Torvalds <torvalds@osdl.org>
上级 7f32a25f
...@@ -63,10 +63,10 @@ ...@@ -63,10 +63,10 @@
bytes, which is the maximum length that can be coded. inflate_fast() bytes, which is the maximum length that can be coded. inflate_fast()
requires strm->avail_out >= 258 for each loop to avoid checking for requires strm->avail_out >= 258 for each loop to avoid checking for
output space. output space.
- @start: inflate()'s starting value for strm->avail_out
*/ */
void inflate_fast(strm, start) void inflate_fast(z_streamp strm, unsigned start)
z_streamp strm;
unsigned start; /* inflate()'s starting value for strm->avail_out */
{ {
struct inflate_state *state; struct inflate_state *state;
unsigned char *in; /* local strm->next_in */ unsigned char *in; /* local strm->next_in */
......
...@@ -20,13 +20,8 @@ ...@@ -20,13 +20,8 @@
table index bits. It will differ if the request is greater than the table index bits. It will differ if the request is greater than the
longest code or if it is less than the shortest code. longest code or if it is less than the shortest code.
*/ */
int zlib_inflate_table(type, lens, codes, table, bits, work) int zlib_inflate_table(codetype type, unsigned short *lens, unsigned codes,
codetype type; code **table, unsigned *bits, unsigned short *work)
unsigned short *lens;
unsigned codes;
code **table;
unsigned *bits;
unsigned short *work;
{ {
unsigned len; /* a code's length in bits */ unsigned len; /* a code's length in bits */
unsigned sym; /* index of code symbols */ unsigned sym; /* index of code symbols */
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册