brickworks/include/bw_buf.h

142 lines
4.0 KiB
C
Raw Normal View History

/*
* Brickworks
*
* Copyright (C) 2023 Orastron Srl unipersonale
*
* Brickworks is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3 of the License.
*
* Brickworks is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Brickworks. If not, see <http://www.gnu.org/licenses/>.
*
* File author: Stefano D'Angelo
*/
/*!
* module_type {{{ utility }}}
2023-05-12 06:03:45 +00:00
* version {{{ 0.5.0 }}}
2023-05-29 11:51:57 +00:00
* requires {{{ bw_common bw_config }}}
* description {{{
* Common operations on buffers.
* }}}
* changelog {{{
* <ul>
2023-05-12 06:03:45 +00:00
* <li>Version <strong>0.5.0</strong>:
* <ul>
* <li>Added <code>bw_buf_neg()</code>.</li>
* </ul>
* </li>
2023-03-01 06:36:28 +00:00
* <li>Version <strong>0.4.0</strong>:
* <ul>
2023-04-19 23:46:41 +00:00
* <li>Added <code>bw_buf_fill()</code> and
* <code>bw_buf_add()</code>.</li>
2023-03-01 06:36:28 +00:00
* </ul>
* </li>
* <li>Version <strong>0.3.0</strong>:
* <ul>
* <li>First release.</li>
* </ul>
* </li>
* </ul>
* }}}
*/
#ifndef _BW_BUF_H
#define _BW_BUF_H
#include <bw_common.h>
#ifdef __cplusplus
extern "C" {
#endif
/*! api {{{
* #### bw_buf_fill()
* ```>>> */
static inline void bw_buf_fill(float *dest, float k, int n_elems);
/*! <<<```
* Sets the first `n_elems` in `dest` to `k`.
*
2023-05-12 06:03:45 +00:00
* #### bw_buf_neg()
* ```>>> */
static inline void bw_buf_neg(float *dest, const float *src, int n_elems);
/*! <<<```
* Inverts the sign of the first `n_elems` in `src` and stores the results in
* the first `n_elems` of `dest`.
*
2023-03-01 06:36:28 +00:00
* #### bw_buf_add()
* ```>>> */
static inline void bw_buf_add(float *dest, const float *src, float k, int n_elems);
/*! <<<```
* Adds `k` to the first `n_elems` in `src` and stores the results in the
* first `n_elems` of `dest`.
*
* #### bw_buf_scale()
* ```>>> */
static inline void bw_buf_scale(float *dest, const float *src, float k, int n_elems);
/*! <<<```
* Multiplies the first `n_elems` in `src` by `k` and stores the results in
* the first `n_elems` of `dest`.
*
* #### bw_buf_mix()
* ```>>> */
static inline void bw_buf_mix(float *dest, const float *src1, const float *src2, int n_elems);
/*! <<<```
* Adds the first `n_elems` of `src1` and `src2` and stores the results in
* the first `n_elems` of `dest`.
*
* #### bw_buf_mul()
* ```>>> */
static inline void bw_buf_mul(float *dest, const float *src1, const float *src2, int n_elems);
/*! <<<```
* Multiplies the first `n_elems` of `src1` and `src2` and stores the results
* in the first `n_elems` of `dest`.
* }}} */
/*** Implementation ***/
/* WARNING: This part of the file is not part of the public API. Its content may
* change at any time in future versions. Please, do not use it directly. */
static inline void bw_buf_fill(float *dest, float k, int n_elems) {
for (int i = 0; i < n_elems; i++)
dest[i] = k;
}
2023-05-12 06:03:45 +00:00
static inline void bw_buf_neg(float *dest, const float *src, int n_elems) {
for (int i = 0; i < n_elems; i++)
dest[i] = -src[i];
}
2023-03-01 06:36:28 +00:00
static inline void bw_buf_add(float *dest, const float *src, float k, int n_elems) {
for (int i = 0; i < n_elems; i++)
dest[i] = k + src[i];
}
static inline void bw_buf_scale(float *dest, const float *src, float k, int n_elems) {
for (int i = 0; i < n_elems; i++)
dest[i] = k * src[i];
}
static inline void bw_buf_mix(float *dest, const float *src1, const float *src2, int n_elems) {
for (int i = 0; i < n_elems; i++)
dest[i] = src1[i] + src2[i];
}
static inline void bw_buf_mul(float *dest, const float *src1, const float *src2, int n_elems) {
for (int i = 0; i < n_elems; i++)
dest[i] = src1[i] * src2[i];
}
#ifdef __cplusplus
}
#endif
#endif