mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-06-30 16:28:30 +00:00
Fix warnings
This change fixes Cosmopolitan so it has fewer opinions about compiler warnings. The whole repository had to be cleaned up to be buildable in -Werror -Wall mode. This lets us benefit from things like strict const checking. Some actual bugs might have been caught too.
This commit is contained in:
parent
e2b3c3618e
commit
0d748ad58e
571 changed files with 1306 additions and 1888 deletions
|
@ -55,10 +55,10 @@ void *cDecimate2xUint8x8(unsigned long n, unsigned char A[n],
|
|||
K[4], K[5], K[4], K[5], K[4], K[5], K[4], K[5]};
|
||||
signed char kMadd4[16] = {K[6], K[7], K[6], K[7], K[6], K[7], K[6], K[7],
|
||||
K[6], K[7], K[6], K[7], K[6], K[7], K[6], K[7]};
|
||||
unsigned char in1[16], in2[16], in3[16], in4[32];
|
||||
unsigned char bv0[16], bv1[16], bv2[16], bv3[16];
|
||||
unsigned char in1[16], in2[16], in3[16];
|
||||
short wv0[8], wv1[8], wv2[8], wv3[8];
|
||||
unsigned long i, j, v, w, o;
|
||||
unsigned long i, j, w;
|
||||
if (n >= STRIDE) {
|
||||
i = 0;
|
||||
w = (n + RATIO / 2) / RATIO;
|
||||
|
|
|
@ -82,7 +82,6 @@ static bool IsNormalized(int n, double A[n]) {
|
|||
}
|
||||
|
||||
void FreeSamplingSolution(struct SamplingSolution *ss) {
|
||||
long i;
|
||||
if (ss) {
|
||||
free(ss->indices);
|
||||
free(ss->weights);
|
||||
|
@ -93,7 +92,7 @@ void FreeSamplingSolution(struct SamplingSolution *ss) {
|
|||
struct SamplingSolution *ComputeSamplingSolution(long dn, long sn, double dar,
|
||||
double off, double par) {
|
||||
double *fweights;
|
||||
double sum, hw, w, x, f;
|
||||
double sum, hw, x, f;
|
||||
short *weights, *indices;
|
||||
struct SamplingSolution *res;
|
||||
long j, i, k, n, min, max, s, N[6];
|
||||
|
@ -151,8 +150,8 @@ static void GyaradosImpl(long dyw, long dxw, int dst[dyw][dxw], long syw,
|
|||
const short fyi[dyn][yfn], const short fyw[dyn][yfn],
|
||||
const short fxi[dxn][xfn], const short fxw[dxn][xfn],
|
||||
bool sharpen) {
|
||||
long i, j;
|
||||
int eax, dy, dx, sy, sx;
|
||||
long i;
|
||||
int eax, dy, dx, sx;
|
||||
for (sx = 0; sx < sxn; ++sx) {
|
||||
for (dy = 0; dy < dyn; ++dy) {
|
||||
for (eax = i = 0; i < yfn; ++i) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue