Clang tidy warning: Call to 'calloc' has an allocation size of 0 bytes
@@ -415,6 +415,7 @@ static double laplam(bif_trunc_t* bt, const double val[])
* Now, itab2 contains all possible values of i*i+j*j, and itab1 contains
* the rank of all i*i+j*j
*/
+ if (lmax <= 0) { Assert(!"data_g2bifourier_packing::laplam: lmax must be > 0"); return 0; }
znorm = (double*)calloc(lmax, sizeof(double));
zw = (double*)malloc(sizeof(double) * lmax);
