mirror of https://github.com/ecmwf/eccodes.git
ECC-1207: cppcheck
This commit is contained in:
parent
e4edb7b81d
commit
1f1903ec7b
|
@ -416,13 +416,8 @@ static double laplam(bif_trunc_t* bt, const double val[])
|
|||
free(itab2);
|
||||
return 0.;
|
||||
}
|
||||
Assert(lmax>0);
|
||||
|
||||
if (lmax < 0) {
|
||||
free(itab1);
|
||||
free(itab2);
|
||||
Assert(!"data_g2bifourier_packing::laplam: lmax must be >= 0");
|
||||
return 0;
|
||||
}
|
||||
/*
|
||||
* Now, itab2 contains all possible values of i*i+j*j, and itab1 contains
|
||||
* the rank of all i*i+j*j
|
||||
|
|
Loading…
Reference in New Issue