benchmark/fourier/parallel/pi/xeonphi/openmp/fourier-parallel-pi-xeonphi-openmp.c
void butterfly_left(data_t* out, data_t* in, uint32_t size, uint32_t N){
  uint32_t bit;
      
  // For each bit in the segment
  for(bit = 0; bit < size/2; bit++){
    out[bit] =                              //  set the current (output) bit to
      add(                                  //   the sum of
        in[bit],                            //    the current (input) bit, and
        in[bit+size/2]);                    //    the (size/2)-next one.
  }

  return;
}
// This function computes the left half of an n-point butterfly. Note it only
// writes to the _first_ half of the output.
//
//   out,in:                 output and input arrays
//   size:                   size of the butterfly
//   N:                      input size of the broader FFT
//
This function computes the left half of an n-point butterfly. Note it only
writes to the _first_ half of the output.

out,in:                 output and input arrays
size:                   size of the butterfly
N:                      input size of the broader FFT
This function computes the left half of an n - point butterfly . Note it only writes to the _first_ half of the output . out in : output and input arrays size : size of the butterfly N : input size of the broader FFT
void butterfly_left(data_t* out, data_t* in, uint32_t size, uint32_t N){
  uint32_t bit;
  for(bit = 0; bit < size/2; bit++){
    out[bit] =                              
      add(                                  
        in[bit],                            
        in[bit+size/2]);                    
  }
  return;
}
void butterfly_left ( data_t * out , data_t * in , uint32_t size , uint32_t N ) { uint32_t bit ; for ( bit = 0 ; bit < size / 2 ; bit ++ ) { out [ bit ] = add ( in [ bit ] , in [ bit + size / 2 ] ) ; } return ; }
This function computes the left half of an n-point butterfly.
This function computes the left half of an n - point butterfly .
// For each bit in the segment //  set the current (output) bit to //   the sum of //    the current (input) bit, and //    the (size/2)-next one.