mirror/RetroArch
1
0
Fork 0
mirror of https://github.com/libretro/RetroArch synced 2025-04-03 10:21:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

Silence warnings on tvOS

Browse Source
This commit is contained in:
twinaphex 2021-08-12 17:35:37 +02:00
parent d4c62a177a
commit cd69803427
1 changed files with 22 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
deps/libz/trees.c vendored
View File

@ -456,7 +456,11 @@ static void scan_tree (deflate_state *s, ct_data *tree, int max_code)
int max_count = 7; /* max repeat count */ int max_count = 7; /* max repeat count */
int min_count = 4; /* min repeat count */ int min_count = 4; /* min repeat count */
if (nextlen == 0) max_count = 138, min_count = 3; if (nextlen == 0)
{
max_count = 138;
min_count = 3;
}
tree[max_code+1].Len = (ush)0xffff; /* guard */ tree[max_code+1].Len = (ush)0xffff; /* guard */
for (n = 0; n <= max_code; n++) { for (n = 0; n <= max_code; n++) {
@ -475,11 +479,14 @@ static void scan_tree (deflate_state *s, ct_data *tree, int max_code)
} }
count = 0; prevlen = curlen; count = 0; prevlen = curlen;
if (nextlen == 0) { if (nextlen == 0) {
max_count = 138, min_count = 3; max_count = 138;
min_count = 3;
} else if (curlen == nextlen) { } else if (curlen == nextlen) {
max_count = 6, min_count = 3; max_count = 6;
min_count = 3;
} else { } else {
max_count = 7, min_count = 4; max_count = 7;
min_count = 4;
} }
} }
} }
@ -499,7 +506,11 @@ static void send_tree (deflate_state *s, ct_data *tree, int max_code)
int min_count = 4; /* min repeat count */ int min_count = 4; /* min repeat count */
/* tree[max_code+1].Len = -1; */ /* guard already set */ /* tree[max_code+1].Len = -1; */ /* guard already set */
if (nextlen == 0) max_count = 138, min_count = 3; if (nextlen == 0)
{
max_count = 138;
min_count = 3;
}
for (n = 0; n <= max_code; n++) { for (n = 0; n <= max_code; n++) {
curlen = nextlen; nextlen = tree[n+1].Len; curlen = nextlen; nextlen = tree[n+1].Len;
@ -523,11 +534,14 @@ static void send_tree (deflate_state *s, ct_data *tree, int max_code)
} }
count = 0; prevlen = curlen; count = 0; prevlen = curlen;
if (nextlen == 0) { if (nextlen == 0) {
max_count = 138, min_count = 3; max_count = 138;
min_count = 3;
} else if (curlen == nextlen) { } else if (curlen == nextlen) {
max_count = 6, min_count = 3; max_count = 6;
min_count = 3;
} else { } else {
max_count = 7, min_count = 4; max_count = 7;
min_count = 4;
} }
} }
} }