mirror of
https://github.com/mborgerding/kissfft.git
synced 2025-07-19 05:24:29 -04:00
Added mucho comments.
This commit is contained in:
@ -32,12 +32,12 @@ static const void * find_cached_fft(int nfft,int inverse)
|
||||
cached_fft * prev=NULL;
|
||||
while ( cur ) {
|
||||
if ( cur->nfft == nfft && inverse == cur->inverse )
|
||||
break;//found the right node
|
||||
break;/*found the right node*/
|
||||
prev = cur;
|
||||
cur = (cached_fft*)prev->next;
|
||||
}
|
||||
if (cur== NULL) {
|
||||
// no cached node found, need to create a new one
|
||||
/* no cached node found, need to create a new one*/
|
||||
kiss_fft_alloc(nfft,inverse,0,&len);
|
||||
cur = (cached_fft*)malloc(sizeof(cached_fft) + len );
|
||||
if (cur == NULL)
|
||||
|
Reference in New Issue
Block a user