Searched refs:n (Results 1 – 6 of 6) sorted by relevance
114 int kiss_fft_next_fast_size(int n);117 #define kiss_fftr_next_fast_size_real(n) \ argument118 (kiss_fft_next_fast_size( ((n)+1)>>1)<<1)
317 void kf_factor(int n,int * facbuf) in kf_factor() argument321 floor_sqrt = floor( sqrt((double)n) ); in kf_factor()325 while (n % p) { in kf_factor()332 p = n; /* no more factors, skip to end */ in kf_factor()334 n /= p; in kf_factor()336 *facbuf++ = n; in kf_factor()337 } while (n > 1); in kf_factor()404 int kiss_fft_next_fast_size(int n) in kiss_fft_next_fast_size() argument407 int m=n; in kiss_fft_next_fast_size()413 n++; in kiss_fft_next_fast_size()[all …]
31 int n= nfft; in prepare() local34 while (n % p) { in prepare()40 if (p*p>n) in prepare()41 p=n;// no more factors in prepare()43 n /= p; in prepare()45 stageRemainder.push_back(n); in prepare()46 }while(n>1); in prepare()
89 …des the next expected packets, effectively acknowledging all packets up to (n-1). The 1-byte ack a…
225 # "sideeffect=@par Side Effects:\n"228 # "Side Effects:". You can put \n's in the value part of an alias to insert
