dsp.h

Go to the documentation of this file.

// SPDX-FileCopyrightText: © 2020-2022, 2024 Alexandros Theodotou <alex@zrythm.org>
// SPDX-License-Identifier: LicenseRef-ZrythmLicense

 
#pragma once
 
#include <algorithm>
 
#include "utils/math_utils.h"
 
#include "juce_wrapper.h"
 
namespace zrythm::utils::float_ranges
{

[[using gnu: nonnull, hot]] static inline void
fill (float * buf, float val, size_t size, bool optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::fill (buf, val, size);
    }
  else
    {
      std::fill_n (buf, size, val);
    }
}

[[using gnu: nonnull, hot]] static inline void
clip (float * buf, float minf, float maxf, size_t size, bool optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::clip (buf, buf, minf, maxf, size);
    }
  else
    {
      std::transform (buf, buf + size, buf, [minf, maxf] (float x) {
        return std::clamp (x, minf, maxf);
      });
    }
}

[[using gnu: nonnull, hot]] static inline void
copy (float * dest, const float * src, size_t size, bool optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::copy (dest, src, size);
    }
  else
    {
      std::copy_n (src, size, dest);
    }
}

[[using gnu: nonnull, hot]] static inline void
mul_k2 (float * dest, float k, size_t size, bool optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::multiply (dest, k, size);
    }
  else
    {
      std::transform (dest, dest + size, dest, [k] (float x) { return x * k; });
    }
}

[[nodiscard]] [[using gnu: nonnull]] static inline float
abs_max (const float * buf, size_t size, bool optimized = true)
{
  if (optimized)
    {
      auto min_and_max = juce::FloatVectorOperations::findMinAndMax (buf, size);
      return std::max (
        std::abs (min_and_max.getStart ()), std::abs (min_and_max.getEnd ()));
    }
 
  return std::abs (*std::max_element (buf, buf + size, [] (float a, float b) {
    return std::abs (a) < std::abs (b);
  }));
}

[[using gnu: nonnull, hot]] static inline bool
abs_max_with_existing_peak (
  const float * buf,
  float *       cur_peak,
  size_t        size,
  bool          optimized = true)
{
  float new_peak = *cur_peak;
 
  if (optimized)
    {
      new_peak = abs_max (buf, size);
    }
  else
    {
      for (size_t i = 0; i < size; i++)
        {
          float val = fabsf (buf[i]);
          new_peak = std::max (val, new_peak);
        }
    }
 
  bool changed = !utils::math::floats_equal (new_peak, *cur_peak);
  *cur_peak = new_peak;
 
  return changed;
}

[[gnu::nonnull]] static inline float
min (const float * buf, size_t size, bool optimized = true)
{
  if (optimized)
    {
      return juce::FloatVectorOperations::findMinimum (buf, size);
    }
 
  return *std::min_element (buf, buf + size, [] (float a, float b) {
    return a < b;
  });
}

[[gnu::nonnull]] static inline float
max (const float * buf, size_t size, bool optimized = true)
{
  if (optimized)
    {
      return juce::FloatVectorOperations::findMaximum (buf, size);
    }
 
  return *std::max_element (buf, buf + size, [] (float a, float b) {
    return a < b;
  });
}

[[using gnu: nonnull, hot]] static inline void
add2 (float * dest, const float * src, size_t count, bool optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::add (dest, src, count);
    }
  else
    {
      std::transform (dest, dest + count, src, dest, std::plus<> ());
    }
}

[[using gnu: nonnull, hot]] static inline void
product (
  float *       dest,
  const float * src,
  float         k,
  size_t        size,
  bool          optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::copyWithMultiply (dest, src, k, size);
    }
  else
    {
      std::transform (dest, dest + size, src, dest, [k] (float x, float y) {
        return y * k;
      });
    }
}

[[using gnu: nonnull, hot]] static inline void
mix_product (
  float *       dest,
  const float * src,
  float         k,
  size_t        size,
  bool          optimized = true)
{
  if (optimized)
    {
      juce::FloatVectorOperations::addWithMultiply (dest, src, k, size);
    }
  else
    {
      std::transform (dest, dest + size, src, dest, [k] (float x, float y) {
        return x + y * k;
      });
    }
}

[[using gnu: nonnull, hot]] static inline void
reverse (float * dest, const float * src, size_t size)
{
  std::reverse_copy (src, src + size, dest);
}

[[using gnu: nonnull, hot]] static inline void
normalize (float * dest, const float * src, size_t size, bool optimize = true)
{
  copy (dest, src, size, optimize);
  const float abs_peak = abs_max (dest, size, optimize);
  mul_k2 (dest, 1.f / abs_peak, size, optimize);
}

[[gnu::nonnull]] void
linear_fade_in_from (
  float * dest,
  int32_t start_offset,
  int32_t total_frames_to_fade,
  size_t  size,
  float   fade_from_multiplier);

[[gnu::nonnull]] void
linear_fade_out_to (
  float * dest,
  int32_t start_offset,
  int32_t total_frames_to_fade,
  size_t  size,
  float   fade_to_multiplier);

[[gnu::nonnull]] void
make_mono (
  float * l,
  float * r,
  size_t  size,
  bool    equal_power,
  bool    optimize = true);
 
}; // zrythm::dsp::float_ranges