set(BASE_VERSION 0.7.9)
set(LIBMLT_REQUIRED_VERSION 0.5.10)
+#set(CMAKE_C_FLAGS " -std=c99 " ${CMAKE_C_FLAGS} " -std=c99")
+
option(RELEASE_BUILD "Remove compilation date from program version (use for stable releases)" OFF)
set(CMAKE_MODULE_PATH ${CMAKE_SOURCE_DIR}/cmake/modules)
# Search packages used by KDE.
find_package(KDE4 REQUIRED)
+set(CMAKE_C_FLAGS " --std=c99") # To compile kiss_fft
include(KDE4Defaults)
include(MacroLibrary)
include(FindGettext)
add_subdirectory(man)
configure_file(${CMAKE_SOURCE_DIR}/kdenlive-config.h.cmake kdenlive-config.h @ONLY)
+
+
+message("C flags are now: " ${CMAKE_C_FLAGS})
borderopacity="1.0"
inkscape:pageopacity="0"
inkscape:pageshadow="2"
- inkscape:zoom="0.061871844"
- inkscape:cx="7437.5969"
- inkscape:cy="3161.6811"
+ inkscape:zoom="0.49497475"
+ inkscape:cx="7848.5254"
+ inkscape:cy="5017.1078"
inkscape:document-units="px"
inkscape:current-layer="layer3"
showgrid="false"
x="-3421.3643"
id="tspan13226-0-8"
sodipodi:role="line">External programs</tspan></text>
+ <text
+ sodipodi:linespacing="125%"
+ id="text3284"
+ y="-171.68839"
+ x="899.27069"
+ style="font-size:144px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-indent:0;text-align:start;text-decoration:none;line-height:125%;letter-spacing:normal;word-spacing:normal;text-transform:none;direction:ltr;block-progression:tb;writing-mode:lr-tb;text-anchor:start;opacity:0.2017544;color:#000000;fill:#000000;fill-opacity:1;fill-rule:nonzero;stroke:none;stroke-width:1;marker:none;visibility:visible;display:inline;overflow:visible;enable-background:accumulate;font-family:DejaVu Sans;-inkscape-font-specification:DejaVu Sans Bold"
+ xml:space="preserve"><tspan
+ y="-171.68839"
+ x="899.27069"
+ id="tspan3286"
+ sodipodi:role="line">Keyboard Shortcuts</tspan></text>
</g>
<g
inkscape:groupmode="layer"
id="tspan13264-5-65"
x="4651.2607"
y="-163.50342">Color Correction layout</tspan></text>
+ <text
+ sodipodi:linespacing="125%"
+ id="text3288"
+ y="-71.055161"
+ x="2257.0693"
+ style="font-size:24px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-indent:0;text-align:start;text-decoration:none;line-height:125%;letter-spacing:normal;word-spacing:normal;text-transform:none;direction:ltr;block-progression:tb;writing-mode:lr-tb;text-anchor:start;color:#000000;fill:#eeeeee;fill-opacity:1;fill-rule:nonzero;stroke:none;stroke-width:1;marker:none;visibility:visible;display:inline;overflow:visible;enable-background:accumulate;font-family:DejaVu Sans;-inkscape-font-specification:DejaVu Sans"
+ xml:space="preserve"><tspan
+ y="-71.055161"
+ x="2257.0693"
+ id="tspan3290"
+ sodipodi:role="line">Make customizable</tspan></text>
+ <text
+ xml:space="preserve"
+ style="font-size:24px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-indent:0;text-align:start;text-decoration:none;line-height:125%;letter-spacing:normal;word-spacing:normal;text-transform:none;direction:ltr;block-progression:tb;writing-mode:lr-tb;text-anchor:start;color:#000000;fill:#eeeeee;fill-opacity:1;fill-rule:nonzero;stroke:none;stroke-width:1;marker:none;visibility:visible;display:inline;overflow:visible;enable-background:accumulate;font-family:DejaVu Sans;-inkscape-font-specification:DejaVu Sans"
+ x="1620.6732"
+ y="1.675822"
+ id="text3292"
+ sodipodi:linespacing="125%"><tspan
+ sodipodi:role="line"
+ id="tspan3294"
+ x="1620.6732"
+ y="1.675822">Support workflow</tspan></text>
</g>
</svg>
add_subdirectory(widgets)
add_subdirectory(mimetypes)
+add_subdirectory(kiss_fft)
macro_optional_find_package(Nepomuk)
include(FindQImageBlitz)
${CMAKE_SOURCE_DIR}/src/widgets
${CMAKE_SOURCE_DIR}/src/colorcorrection
${CMAKE_SOURCE_DIR}/src/onmonitoritems
+ ${CMAKE_SOURCE_DIR}/src/kiss_fft
+ ${CMAKE_SOURCE_DIR}/src/audioscopes
)
+
if(Nepomuk_FOUND)
include_directories(NEPOMUK_INCLUDES)
set(optional_libs ${NEPOMUK_LIBRARIES})
macro_optional_find_package(OpenGL)
endif(APPLE)
+
link_libraries(
${LIBMLT_LIBRARY}
${LIBMLTPLUS_LIBRARY}
widgets/stopmotion_ui.ui
widgets/monitorscenecontrolwidget_ui.ui
widgets/cornerswidget_ui.ui
+ widgets/audiospectrum_ui.ui
)
set(kdenlive_SRCS
+ ${kdenlive_SRCS}
addclipcommand.cpp
main.cpp
mainwindow.cpp
tracksconfigdialog.cpp
configtrackscommand.cpp
abstractscopewidget.cpp
+ audioscopes/abstractaudioscopewidget.cpp
+ audioscopes/audiospectrum.cpp
rebuildgroupcommand.cpp
histogram.cpp
rgbparade.cpp
onmonitoritems/onmonitorcornersitem.cpp
monitorscenecontrolwidget.cpp
cornerswidget.cpp
+ kiss_fft/_kiss_fft_guts.h
+ kiss_fft/kiss_fft.c
+ kiss_fft/tools/kiss_fftr.c
)
add_subdirectory(${CMAKE_SOURCE_DIR}/src/colorcorrection)
/** The semaphores ensure that the QFutures for the HUD/Scope/Background threads cannot
be assigned a new thread while it is still running. (Could cause deadlocks and other
- nasty things known from parallelism. */
+ nasty things known from parallelism.) */
QSemaphore m_semaphoreHUD;
QSemaphore m_semaphoreScope;
QSemaphore m_semaphoreBackground;
--- /dev/null
+/***************************************************************************
+ * Copyright (C) 2010 by Simon Andreas Eugster (simon.eu@gmail.com) *
+ * This file is part of kdenlive. See www.kdenlive.org. *
+ * *
+ * This program 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; either version 2 of the License, or *
+ * (at your option) any later version. *
+ ***************************************************************************/
+
+#include "qtconcurrentrun.h"
+
+#include "abstractaudioscopewidget.h"
+#include "renderer.h"
+#include "monitor.h"
+
+#include <QDebug>
+#include <QFuture>
+#include <QColor>
+#include <QMenu>
+#include <QMouseEvent>
+#include <QPainter>
+
+const int REALTIME_FPS = 30;
+
+const QColor light(250, 238, 226, 255);
+const QColor dark(40, 40, 39, 255);
+const QColor dark2(25, 25, 23, 255);
+
+const QPen AbstractAudioScopeWidget::penThick(QBrush(QColor(250, 250, 250)), 2, Qt::SolidLine);
+const QPen AbstractAudioScopeWidget::penThin(QBrush(QColor(250, 250, 250)), 1, Qt::SolidLine);
+const QPen AbstractAudioScopeWidget::penLight(QBrush(QColor(200, 200, 250, 150)), 1, Qt::SolidLine);
+const QPen AbstractAudioScopeWidget::penDark(QBrush(QColor(0, 0, 20, 250)), 1, Qt::SolidLine);
+
+AbstractAudioScopeWidget::AbstractAudioScopeWidget(Monitor *projMonitor, Monitor *clipMonitor, bool trackMouse, QWidget *parent) :
+ QWidget(parent),
+ m_projMonitor(projMonitor),
+ m_clipMonitor(clipMonitor),
+ m_mousePos(0, 0),
+ m_mouseWithinWidget(false),
+ offset(5),
+ m_accelFactorHUD(1),
+ m_accelFactorScope(1),
+ m_accelFactorBackground(1),
+ m_semaphoreHUD(1),
+ m_semaphoreScope(1),
+ m_semaphoreBackground(1),
+ initialDimensionUpdateDone(false),
+ m_requestForcedUpdate(false)
+
+{
+ m_scopePalette = QPalette();
+ m_scopePalette.setBrush(QPalette::Window, QBrush(dark2));
+ m_scopePalette.setBrush(QPalette::Base, QBrush(dark));
+ m_scopePalette.setBrush(QPalette::Button, QBrush(dark));
+ m_scopePalette.setBrush(QPalette::Text, QBrush(light));
+ m_scopePalette.setBrush(QPalette::WindowText, QBrush(light));
+ m_scopePalette.setBrush(QPalette::ButtonText, QBrush(light));
+ this->setPalette(m_scopePalette);
+ this->setAutoFillBackground(true);
+
+ m_aAutoRefresh = new QAction(i18n("Auto Refresh"), this);
+ m_aAutoRefresh->setCheckable(true);
+ m_aRealtime = new QAction(i18n("Realtime (with precision loss)"), this);
+ m_aRealtime->setCheckable(true);
+
+ m_menu = new QMenu(this);
+ m_menu->setPalette(m_scopePalette);
+ m_menu->addAction(m_aAutoRefresh);
+ m_menu->addAction(m_aRealtime);
+
+ this->setContextMenuPolicy(Qt::CustomContextMenu);
+
+ m_activeRender = (m_clipMonitor->isActive()) ? m_clipMonitor->render : m_projMonitor->render;
+
+ bool b = true;
+ b &= connect(this, SIGNAL(customContextMenuRequested(QPoint)), this, SLOT(customContextMenuRequested(QPoint)));
+
+ //b &= connect(m_activeRender, SIGNAL(rendererPosition(int)), this, SLOT(slotRenderZoneUpdated()));
+ b &= connect(m_activeRender, SIGNAL(frameUpdated(QImage)), this, SLOT(slotRenderZoneUpdated(QImage)));
+
+ b &= connect(this, SIGNAL(signalHUDRenderingFinished(uint, uint)), this, SLOT(slotHUDRenderingFinished(uint, uint)));
+ b &= connect(this, SIGNAL(signalScopeRenderingFinished(uint, uint)), this, SLOT(slotScopeRenderingFinished(uint, uint)));
+ b &= connect(this, SIGNAL(signalBackgroundRenderingFinished(uint, uint)), this, SLOT(slotBackgroundRenderingFinished(uint, uint)));
+ b &= connect(m_aRealtime, SIGNAL(toggled(bool)), this, SLOT(slotResetRealtimeFactor(bool)));
+ b &= connect(m_aAutoRefresh, SIGNAL(toggled(bool)), this, SLOT(slotAutoRefreshToggled(bool)));
+ Q_ASSERT(b);
+
+ // Enable mouse tracking if desired.
+ // Causes the mouseMoved signal to be emitted when the mouse moves inside the
+ // widget, even when no mouse button is pressed.
+ this->setMouseTracking(trackMouse);
+}
+
+AbstractAudioScopeWidget::~AbstractAudioScopeWidget()
+{
+ writeConfig();
+
+ delete m_menu;
+ delete m_aAutoRefresh;
+ delete m_aRealtime;
+}
+
+void AbstractAudioScopeWidget::init()
+{
+ m_widgetName = widgetName();
+ readConfig();
+}
+
+void AbstractAudioScopeWidget::readConfig()
+{
+ KSharedConfigPtr config = KGlobal::config();
+ KConfigGroup scopeConfig(config, configName());
+ m_aAutoRefresh->setChecked(scopeConfig.readEntry("autoRefresh", true));
+ m_aRealtime->setChecked(scopeConfig.readEntry("realtime", false));
+ scopeConfig.sync();
+}
+
+void AbstractAudioScopeWidget::writeConfig()
+{
+ KSharedConfigPtr config = KGlobal::config();
+ KConfigGroup scopeConfig(config, configName());
+ scopeConfig.writeEntry("autoRefresh", m_aAutoRefresh->isChecked());
+ scopeConfig.writeEntry("realtime", m_aRealtime->isChecked());
+ scopeConfig.sync();
+}
+
+QString AbstractAudioScopeWidget::configName()
+{
+ return "Scope_" + m_widgetName;
+}
+
+void AbstractAudioScopeWidget::prodHUDThread()
+{
+ if (this->visibleRegion().isEmpty()) {
+// qDebug() << "Scope " << m_widgetName << " is not visible. Not calculating HUD.";
+ } else {
+ if (m_semaphoreHUD.tryAcquire(1)) {
+ Q_ASSERT(!m_threadHUD.isRunning());
+
+ m_newHUDFrames.fetchAndStoreRelaxed(0);
+ m_newHUDUpdates.fetchAndStoreRelaxed(0);
+ m_threadHUD = QtConcurrent::run(this, &AbstractAudioScopeWidget::renderHUD, m_accelFactorHUD);
+// qDebug() << "HUD thread started in " << m_widgetName;
+
+ } else {
+// qDebug() << "HUD semaphore locked, not prodding in " << m_widgetName << ". Thread running: " << m_threadHUD.isRunning();
+ }
+ }
+}
+
+void AbstractAudioScopeWidget::prodScopeThread()
+{
+ // Only start a new thread if the scope is actually visible
+ // and not hidden by another widget on the stack and if user want the scope to update.
+ if (this->visibleRegion().isEmpty() || (!m_aAutoRefresh->isChecked() && !m_requestForcedUpdate)) {
+// qDebug() << "Scope " << m_widgetName << " is not visible. Not calculating scope.";
+ } else {
+ // Try to acquire the semaphore. This must only succeed if m_threadScope is not running
+ // anymore. Therefore the semaphore must NOT be released before m_threadScope ends.
+ // If acquiring the semaphore fails, the thread is still running.
+ if (m_semaphoreScope.tryAcquire(1)) {
+ Q_ASSERT(!m_threadScope.isRunning());
+
+ m_newScopeFrames.fetchAndStoreRelaxed(0);
+ m_newScopeUpdates.fetchAndStoreRelaxed(0);
+
+ Q_ASSERT(m_accelFactorScope > 0);
+
+ // See http://doc.qt.nokia.com/latest/qtconcurrentrun.html#run about
+ // running member functions in a thread
+ m_threadScope = QtConcurrent::run(this, &AbstractAudioScopeWidget::renderScope,
+ m_accelFactorScope, m_audioFrame, m_freq, m_nChannels, m_nSamples);
+ m_requestForcedUpdate = false;
+
+// qDebug() << "Scope thread started in " << m_widgetName;
+
+ } else {
+// qDebug() << "Scope semaphore locked, not prodding in " << m_widgetName << ". Thread running: " << m_threadScope.isRunning();
+ }
+ }
+}
+void AbstractAudioScopeWidget::prodBackgroundThread()
+{
+ if (this->visibleRegion().isEmpty()) {
+// qDebug() << "Scope " << m_widgetName << " is not visible. Not calculating background.";
+ } else {
+ if (m_semaphoreBackground.tryAcquire(1)) {
+ Q_ASSERT(!m_threadBackground.isRunning());
+
+ m_newBackgroundFrames.fetchAndStoreRelaxed(0);
+ m_newBackgroundUpdates.fetchAndStoreRelaxed(0);
+ m_threadBackground = QtConcurrent::run(this, &AbstractAudioScopeWidget::renderBackground, m_accelFactorBackground);
+// qDebug() << "Background thread started in " << m_widgetName;
+
+ } else {
+// qDebug() << "Background semaphore locked, not prodding in " << m_widgetName << ". Thread running: " << m_threadBackground.isRunning();
+ }
+ }
+}
+
+void AbstractAudioScopeWidget::forceUpdate(bool doUpdate)
+{
+// qDebug() << "Force update called in " << widgetName() << ". Arg: " << doUpdate;
+ if (!doUpdate) {
+ return;
+ }
+ m_requestForcedUpdate = true;
+ m_newHUDUpdates.fetchAndAddRelaxed(1);
+ m_newScopeUpdates.fetchAndAddRelaxed(1);
+ m_newBackgroundUpdates.fetchAndAddRelaxed(1);
+ prodHUDThread();
+ prodScopeThread();
+ prodBackgroundThread();
+}
+void AbstractAudioScopeWidget::forceUpdateHUD()
+{
+ m_newHUDUpdates.fetchAndAddRelaxed(1);
+ prodHUDThread();
+
+}
+void AbstractAudioScopeWidget::forceUpdateScope()
+{
+ m_newScopeUpdates.fetchAndAddRelaxed(1);
+ m_requestForcedUpdate = true;
+ prodScopeThread();
+
+}
+void AbstractAudioScopeWidget::forceUpdateBackground()
+{
+ m_newBackgroundUpdates.fetchAndAddRelaxed(1);
+ prodBackgroundThread();
+
+}
+
+
+///// Events /////
+
+void AbstractAudioScopeWidget::mouseReleaseEvent(QMouseEvent *event)
+{
+ if (!m_aAutoRefresh->isChecked()) {
+ m_requestForcedUpdate = true;
+ m_activeRender->sendFrameUpdate();
+ }
+ prodHUDThread();
+ prodScopeThread();
+ prodBackgroundThread();
+ QWidget::mouseReleaseEvent(event);
+}
+
+void AbstractAudioScopeWidget::resizeEvent(QResizeEvent *event)
+{
+ // Update the dimension of the available rect for painting
+ m_scopeRect = scopeRect();
+ forceUpdate();
+
+ QWidget::resizeEvent(event);
+}
+
+void AbstractAudioScopeWidget::showEvent(QShowEvent *event)
+{
+ QWidget::showEvent(event);
+ m_scopeRect = scopeRect();
+}
+
+void AbstractAudioScopeWidget::paintEvent(QPaintEvent *)
+{
+ QPainter davinci(this);
+ davinci.drawImage(m_scopeRect.topLeft(), m_imgBackground);
+ davinci.drawImage(m_scopeRect.topLeft(), m_imgScope);
+ davinci.drawImage(m_scopeRect.topLeft(), m_imgHUD);
+}
+
+void AbstractAudioScopeWidget::mouseMoveEvent(QMouseEvent *event)
+{
+ m_mousePos = event->pos();
+ m_mouseWithinWidget = true;
+ emit signalMousePositionChanged();
+}
+void AbstractAudioScopeWidget::leaveEvent(QEvent *)
+{
+ m_mouseWithinWidget = false;
+ emit signalMousePositionChanged();
+}
+
+void AbstractAudioScopeWidget::customContextMenuRequested(const QPoint &pos)
+{
+ m_menu->exec(this->mapToGlobal(pos));
+}
+
+uint AbstractAudioScopeWidget::calculateAccelFactorHUD(uint oldMseconds, uint)
+{
+ return ceil((float)oldMseconds*REALTIME_FPS / 1000);
+}
+uint AbstractAudioScopeWidget::calculateAccelFactorScope(uint oldMseconds, uint)
+{
+ return ceil((float)oldMseconds*REALTIME_FPS / 1000);
+}
+uint AbstractAudioScopeWidget::calculateAccelFactorBackground(uint oldMseconds, uint)
+{
+ return ceil((float)oldMseconds*REALTIME_FPS / 1000);
+}
+
+
+///// Slots /////
+
+void AbstractAudioScopeWidget::slotHUDRenderingFinished(uint mseconds, uint oldFactor)
+{
+// qDebug() << "HUD rendering has finished, waiting for termination in " << m_widgetName;
+ m_threadHUD.waitForFinished();
+ m_imgHUD = m_threadHUD.result();
+
+ m_semaphoreHUD.release(1);
+ this->update();
+
+ int accel;
+ if (m_aRealtime->isChecked()) {
+ accel = calculateAccelFactorHUD(mseconds, oldFactor);
+ if (m_accelFactorHUD < 1) {
+ accel = 1;
+ }
+ m_accelFactorHUD = accel;
+ }
+
+ if ((m_newHUDFrames > 0 && m_aAutoRefresh->isChecked()) || m_newHUDUpdates > 0) {
+// qDebug() << "Trying to start a new HUD thread for " << m_widgetName
+// << ". New frames/updates: " << m_newHUDFrames << "/" << m_newHUDUpdates;
+ prodHUDThread();;
+ }
+}
+
+void AbstractAudioScopeWidget::slotScopeRenderingFinished(uint mseconds, uint oldFactor)
+{
+ // The signal can be received before the thread has really finished. So we
+ // need to wait until it has really finished before starting a new thread.
+// qDebug() << "Scope rendering has finished, waiting for termination in " << m_widgetName;
+ m_threadScope.waitForFinished();
+ m_imgScope = m_threadScope.result();
+
+ // The scope thread has finished. Now we can release the semaphore, allowing a new thread.
+ // See prodScopeThread where the semaphore is acquired again.
+ m_semaphoreScope.release(1);
+ this->update();
+
+ // Calculate the acceleration factor hint to get «realtime» updates.
+ int accel;
+ if (m_aRealtime->isChecked()) {
+ accel = calculateAccelFactorScope(mseconds, oldFactor);
+ if (accel < 1) {
+ // If mseconds happens to be 0.
+ accel = 1;
+ }
+ // Don't directly calculate with m_accelFactorScope as we are dealing with concurrency.
+ // If m_accelFactorScope is set to 0 at the wrong moment, who knows what might happen
+ // then :) Therefore use a local variable.
+ m_accelFactorScope = accel;
+ }
+
+ if ((m_newScopeFrames > 0 && m_aAutoRefresh->isChecked()) || m_newScopeUpdates > 0) {
+// qDebug() << "Trying to start a new scope thread for " << m_widgetName
+// << ". New frames/updates: " << m_newScopeFrames << "/" << m_newScopeUpdates;
+ prodScopeThread();
+ }
+}
+
+void AbstractAudioScopeWidget::slotBackgroundRenderingFinished(uint mseconds, uint oldFactor)
+{
+// qDebug() << "Background rendering has finished, waiting for termination in " << m_widgetName;
+ m_threadBackground.waitForFinished();
+ m_imgBackground = m_threadBackground.result();
+
+ m_semaphoreBackground.release(1);
+ this->update();
+
+ int accel;
+ if (m_aRealtime->isChecked()) {
+ accel = calculateAccelFactorBackground(mseconds, oldFactor);
+ if (m_accelFactorBackground < 1) {
+ accel = 1;
+ }
+ m_accelFactorBackground = accel;
+ }
+
+ if ((m_newBackgroundFrames > 0 && m_aAutoRefresh->isChecked()) || m_newBackgroundUpdates > 0) {
+// qDebug() << "Trying to start a new background thread for " << m_widgetName
+// << ". New frames/updates: " << m_newBackgroundFrames << "/" << m_newBackgroundUpdates;
+ prodBackgroundThread();;
+ }
+}
+
+void AbstractAudioScopeWidget::slotActiveMonitorChanged(bool isClipMonitor)
+{
+// qDebug() << "Active monitor has changed in " << m_widgetName << ". Is the clip monitor active now? " << isClipMonitor;
+
+ bool b = m_activeRender->disconnect(this);
+ Q_ASSERT(b);
+
+ m_activeRender = (isClipMonitor) ? m_clipMonitor->render : m_projMonitor->render;
+
+ //b &= connect(m_activeRender, SIGNAL(rendererPosition(int)), this, SLOT(slotRenderZoneUpdated()));
+ b &= connect(m_activeRender, SIGNAL(frameUpdated(QImage)), this, SLOT(slotRenderZoneUpdated(QImage)));
+ Q_ASSERT(b);
+
+ // Update the scope for the new monitor.
+ prodHUDThread();
+ prodScopeThread();
+ prodBackgroundThread();
+}
+
+void AbstractAudioScopeWidget::slotRenderZoneUpdated()
+{
+ m_newHUDFrames.fetchAndAddRelaxed(1);
+ m_newScopeFrames.fetchAndAddRelaxed(1);
+ m_newBackgroundFrames.fetchAndAddRelaxed(1);
+
+// qDebug() << "Monitor incoming. New frames total HUD/Scope/Background: " << m_newHUDFrames
+// << "/" << m_newScopeFrames << "/" << m_newBackgroundFrames;
+
+ if (this->visibleRegion().isEmpty()) {
+// qDebug() << "Scope of widget " << m_widgetName << " is not at the top, not rendering.";
+ } else {
+ if (m_aAutoRefresh->isChecked()) {
+ prodHUDThread();
+ prodScopeThread();
+ prodBackgroundThread();
+ }
+ }
+}
+
+void AbstractAudioScopeWidget::slotRenderZoneUpdated(QImage frame)
+{
+ m_scopeImage = frame;
+ slotRenderZoneUpdated();
+}
+
+void AbstractAudioScopeWidget::slotReceiveAudio(const QVector<int16_t> sampleData, const int freq, const int num_channels, const int num_samples)
+{
+ qDebug() << "Received audio. Size is " << (int) sampleData.size() << ".";
+ if (sampleData.size() > 0) {
+ qDebug() << sampleData.data()[0];
+ }
+ //TODO
+}
+
+void AbstractAudioScopeWidget::slotResetRealtimeFactor(bool realtimeChecked)
+{
+ if (!realtimeChecked) {
+ m_accelFactorHUD = 1;
+ m_accelFactorScope = 1;
+ m_accelFactorBackground = 1;
+ }
+}
+
+bool AbstractAudioScopeWidget::autoRefreshEnabled()
+{
+ return m_aAutoRefresh->isChecked();
+}
+
+void AbstractAudioScopeWidget::slotAutoRefreshToggled(bool autoRefresh)
+{
+ if (isVisible()) emit requestAutoRefresh(autoRefresh);
+ // TODO only if depends on input
+ if (autoRefresh) {
+ //forceUpdate();
+ m_requestForcedUpdate = true;
+ m_activeRender->sendFrameUpdate();
+ }
+}
--- /dev/null
+/***************************************************************************
+ * Copyright (C) 2010 by Simon Andreas Eugster (simon.eu@gmail.com) *
+ * This file is part of kdenlive. See www.kdenlive.org. *
+ * *
+ * This program 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; either version 2 of the License, or *
+ * (at your option) any later version. *
+ ***************************************************************************/
+
+#ifndef ABSTRACTAUDIOSCOPEWIDGET_H
+#define ABSTRACTAUDIOSCOPEWIDGET_H
+
+
+#include <QtCore>
+#include <QWidget>
+
+class QMenu;
+
+class Monitor;
+class Render;
+
+class AbstractAudioScopeWidget : public QWidget
+{
+ Q_OBJECT
+public:
+ AbstractAudioScopeWidget(Monitor *projMonitor, Monitor *clipMonitor, bool trackMouse = false, QWidget *parent = 0);
+ virtual ~AbstractAudioScopeWidget(); // Must be virtual because of inheritance, to avoid memory leaks
+ QPalette m_scopePalette;
+
+ /** Initializes widget settings (reads configuration).
+ Has to be called in the implementing object. */
+ void init();
+
+ /** Does this scope have auto-refresh enabled */
+ bool autoRefreshEnabled();
+
+ ///// Unimplemented /////
+
+ virtual QString widgetName() const = 0;
+
+ ///// Variables /////
+ static const QPen penThick;
+ static const QPen penThin;
+ static const QPen penLight;
+ static const QPen penDark;
+
+protected:
+ ///// Variables /////
+
+ Monitor *m_projMonitor;
+ Monitor *m_clipMonitor;
+ Render *m_activeRender;
+
+
+ /** The context menu. Feel free to add new entries in your implementation. */
+ QMenu *m_menu;
+
+ /** Enables auto refreshing of the scope.
+ This is when a new frame is shown on the active monitor.
+ Resize events always force a recalculation. */
+ QAction *m_aAutoRefresh;
+
+ /** Realtime rendering. Should be disabled if it is not supported.
+ Use the accelerationFactor variable passed to the render functions as a hint of
+ how many times faster the scope should be calculated. */
+ QAction *m_aRealtime;
+
+ /** The mouse position; Updated when the mouse enters the widget
+ AND mouse tracking has been enabled. */
+ QPoint m_mousePos;
+ /** Knows whether the mouse currently lies within the widget or not.
+ Can e.g. be used for drawing a HUD only when the mouse is in the widget. */
+ bool m_mouseWithinWidget;
+
+ /** Offset from the widget's borders */
+ const uchar offset;
+
+ /** The rect on the widget we're painting in.
+ Can be used by the implementing widget, e.g. in the render methods.
+ Is updated when necessary (size changes). */
+ QRect m_scopeRect;
+
+ /** Images storing the calculated layers. Will be used on repaint events. */
+ QImage m_imgHUD;
+ QImage m_imgScope;
+ QImage m_imgBackground;
+
+ /** The acceleration factors can be accessed also by other renderer tasks,
+ e.g. to display the scope's acceleration factor in the HUD renderer. */
+ int m_accelFactorHUD;
+ int m_accelFactorScope;
+ int m_accelFactorBackground;
+
+ /** Reads the widget's configuration.
+ Can be extended in the implementing subclass (make sure to run readConfig as well). */
+ virtual void readConfig();
+ /** Writes the widget configuration.
+ Implementing widgets have to implement an own method and run it in their destructor. */
+ void writeConfig();
+ /** Identifier for the widget's configuration. */
+ QString configName();
+
+
+ ///// Unimplemented Methods /////
+
+ /** Where on the widget we can paint in.
+ May also update other variables that depend on the widget's size. */
+ virtual QRect scopeRect() = 0;
+
+ /** @brief HUD renderer. Must emit signalHUDRenderingFinished(). @see renderScope */
+ virtual QImage renderHUD(uint accelerationFactor) = 0;
+ /** @brief Scope renderer. Must emit signalScopeRenderingFinished()
+ when calculation has finished, to allow multi-threading.
+ accelerationFactor hints how much faster than usual the calculation should be accomplished, if possible. */
+ virtual QImage renderScope(uint accelerationFactor,
+ const QVector<int16_t> audioFrame, const int freq, const int num_channels, const int num_samples) = 0;
+ /** @brief Background renderer. Must emit signalBackgroundRenderingFinished(). @see renderScope */
+ virtual QImage renderBackground(uint accelerationFactor) = 0;
+
+ /** Must return true if the HUD layer depends on the input monitor.
+ If it does not, then it does not need to be re-calculated when
+ a new frame from the monitor is incoming. */
+ virtual bool isHUDDependingOnInput() const = 0;
+ /** @see isHUDDependingOnInput() */
+ virtual bool isScopeDependingOnInput() const = 0;
+ /** @see isHUDDependingOnInput() */
+ virtual bool isBackgroundDependingOnInput() const = 0;
+
+ ///// Can be reimplemented /////
+ /** Calculates the acceleration factor to be used by the render thread.
+ This method can be refined in the subclass if required. */
+ virtual uint calculateAccelFactorHUD(uint oldMseconds, uint oldFactor);
+ virtual uint calculateAccelFactorScope(uint oldMseconds, uint oldFactor);
+ virtual uint calculateAccelFactorBackground(uint oldMseconds, uint oldFactor);
+
+ ///// Reimplemented /////
+
+ void mouseMoveEvent(QMouseEvent *);
+ void leaveEvent(QEvent *);
+ void mouseReleaseEvent(QMouseEvent *);
+ void paintEvent(QPaintEvent *);
+ void resizeEvent(QResizeEvent *);
+ void showEvent(QShowEvent *); // Called when the widget is activated via the Menu entry
+ // void raise(); // Called only when manually calling the event -> useless
+
+
+protected slots:
+ /** Forces an update of all layers. */
+ void forceUpdate(bool doUpdate = true);
+ void forceUpdateHUD();
+ void forceUpdateScope();
+ void forceUpdateBackground();
+ void slotAutoRefreshToggled(bool);
+
+signals:
+ /** mseconds represent the time taken for the calculation,
+ accelerationFactor is the acceleration factor that has been used. */
+ void signalHUDRenderingFinished(uint mseconds, uint accelerationFactor);
+ void signalScopeRenderingFinished(uint mseconds, uint accelerationFactor);
+ void signalBackgroundRenderingFinished(uint mseconds, uint accelerationFactor);
+
+ /** For the mouse position itself see m_mousePos.
+ To check whether the mouse has leaved the widget, see m_mouseWithinWidget. */
+ void signalMousePositionChanged();
+
+ /** Do we need the renderer to send its frames to us? */
+ void requestAutoRefresh(bool);
+
+private:
+
+ /** Counts the number of frames that have been rendered in the active monitor.
+ The frame number will be reset when the calculation starts for the current frame. */
+ QAtomicInt m_newHUDFrames;
+ QAtomicInt m_newScopeFrames;
+ QAtomicInt m_newBackgroundFrames;
+
+ /** Counts the number of updates that, unlike new frames, force a recalculation
+ of the scope, like for example a resize event. */
+ QAtomicInt m_newHUDUpdates;
+ QAtomicInt m_newScopeUpdates;
+ QAtomicInt m_newBackgroundUpdates;
+
+ /** The semaphores ensure that the QFutures for the HUD/Scope/Background threads cannot
+ be assigned a new thread while it is still running. (Could cause deadlocks and other
+ nasty things known from parallelism.) */
+ QSemaphore m_semaphoreHUD;
+ QSemaphore m_semaphoreScope;
+ QSemaphore m_semaphoreBackground;
+
+ QFuture<QImage> m_threadHUD;
+ QFuture<QImage> m_threadScope;
+ QFuture<QImage> m_threadBackground;
+
+ bool initialDimensionUpdateDone;
+ bool m_requestForcedUpdate;
+
+ QImage m_scopeImage;
+ QVector<int16_t> m_audioFrame; //NEW
+ int m_freq;
+ int m_nChannels;
+ int m_nSamples;
+
+ QString m_widgetName;
+
+ void prodHUDThread();
+ void prodScopeThread();
+ void prodBackgroundThread();
+
+public slots:
+ /** @brief Must be called when the active monitor has shown a new frame.
+ This slot must be connected in the implementing class, it is *not*
+ done in this abstract class. */
+ void slotActiveMonitorChanged(bool isClipMonitor);
+
+private slots:
+ void customContextMenuRequested(const QPoint &pos);
+ /** To be called when a new frame has been received.
+ The scope then decides whether and when it wants to recalculate the scope, depending
+ on whether it is currently visible and whether a calculation thread is already running. */
+ void slotRenderZoneUpdated();
+ void slotRenderZoneUpdated(QImage);//OLD
+ void slotReceiveAudio(const QVector<int16_t> sampleData, const int freq, const int num_channels, const int num_samples); // NEW, TODO comment
+ /** The following slots are called when rendering of a component has finished. They e.g. update
+ the widget and decide whether to immediately restart the calculation thread. */
+ void slotHUDRenderingFinished(uint mseconds, uint accelerationFactor);
+ void slotScopeRenderingFinished(uint mseconds, uint accelerationFactor);
+ void slotBackgroundRenderingFinished(uint mseconds, uint accelerationFactor);
+
+ /** Resets the acceleration factors to 1 when realtime rendering is disabled. */
+ void slotResetRealtimeFactor(bool realtimeChecked);
+
+};
+
+#endif // ABSTRACTAUDIOSCOPEWIDGET_H
--- /dev/null
+#include "audiospectrum.h"
+#include "tools/kiss_fftr.h"
+
+AudioSpectrum::AudioSpectrum(Monitor *projMonitor, Monitor *clipMonitor, QWidget *parent) :
+ AbstractAudioScopeWidget(projMonitor, clipMonitor, true, parent)
+{
+ init();
+}
+
+QString AudioSpectrum::widgetName() const { return QString("audiospectrum"); }
+
+bool AudioSpectrum::isBackgroundDependingOnInput() const { return false; }
+bool AudioSpectrum::isScopeDependingOnInput() const { return false; }
+bool AudioSpectrum::isHUDDependingOnInput() const { return false; }
+
+QImage AudioSpectrum::renderBackground(uint) { return QImage(); }
+QImage AudioSpectrum::renderScope(uint accelerationFactor, const QVector<int16_t> audioFrame, const int freq, const int num_channels, const int num_samples)
+{
+ return QImage();
+}
+QImage AudioSpectrum::renderHUD(uint) { return QImage(); }
+
+QRect AudioSpectrum::scopeRect() {
+ return QRect(0,0,40,40);
+}
+
+void AudioSpectrum::readConfig()
+{
+
+}
--- /dev/null
+#ifndef AUDIOSPECTRUM_H
+#define AUDIOSPECTRUM_H
+
+#include <QtCore>
+
+#include "abstractaudioscopewidget.h"
+#include "ui_audiospectrum_ui.h"
+
+class AudioSpectrum_UI;
+
+class AudioSpectrum : public AbstractAudioScopeWidget {
+ Q_OBJECT
+
+public:
+ AudioSpectrum(Monitor *projMonitor, Monitor *clipMonitor, QWidget *parent = 0);
+
+ // Implemented virtual methods
+ QString widgetName() const;
+
+protected:
+ ///// Implemented methods /////
+ QRect scopeRect();
+ QImage renderHUD(uint accelerationFactor);
+ QImage renderScope(uint accelerationFactor, const QVector<int16_t> audioFrame, const int freq, const int num_channels, const int num_samples);
+ QImage renderBackground(uint accelerationFactor);
+ bool isHUDDependingOnInput() const;
+ bool isScopeDependingOnInput() const;
+ bool isBackgroundDependingOnInput() const;
+ virtual void readConfig();
+
+private:
+ Ui::AudioSpectrum_UI *ui;
+};
+
+#endif // AUDIOSPECTRUM_H
--- /dev/null
+1.2.9 2010-05-27
+ threadsafe ( including OpenMP )
+
+ first edition of kissfft.hh the C++ template fft engine
+
+1.2.8
+ Changed memory.h to string.h -- apparently more standard
+
+ Added openmp extensions. This can have fairly linear speedups for larger FFT sizes.
+
+1.2.7
+ Shrank the real-fft memory footprint. Thanks to Galen Seitz.
+
+1.2.6 (Nov 14, 2006) The "thanks to GenArts" release.
+ Added multi-dimensional real-optimized FFT, see tools/kiss_fftndr
+ Thanks go to GenArts, Inc. for sponsoring the development.
+
+1.2.5 (June 27, 2006) The "release for no good reason" release.
+ Changed some harmless code to make some compilers' warnings go away.
+ Added some more digits to pi -- why not.
+ Added kiss_fft_next_fast_size() function to help people decide how much to pad.
+ Changed multidimensional test from 8 dimensions to only 3 to avoid testing
+ problems with fixed point (sorry Buckaroo Banzai).
+
+1.2.4 (Oct 27, 2005) The "oops, inverse fixed point real fft was borked" release.
+ Fixed scaling bug for inverse fixed point real fft -- also fixed test code that should've been failing.
+ Thanks to Jean-Marc Valin for bug report.
+
+ Use sys/types.h for more portable types than short,int,long => int16_t,int32_t,int64_t
+ If your system does not have these, you may need to define them -- but at least it breaks in a
+ loud and easily fixable way -- unlike silently using the wrong size type.
+
+ Hopefully tools/psdpng.c is fixed -- thanks to Steve Kellog for pointing out the weirdness.
+
+1.2.3 (June 25, 2005) The "you want to use WHAT as a sample" release.
+ Added ability to use 32 bit fixed point samples -- requires a 64 bit intermediate result, a la 'long long'
+
+ Added ability to do 4 FFTs in parallel by using SSE SIMD instructions. This is accomplished by
+ using the __m128 (vector of 4 floats) as kiss_fft_scalar. Define USE_SIMD to use this.
+
+ I know, I know ... this is drifting a bit from the "kiss" principle, but the speed advantages
+ make it worth it for some. Also recent gcc makes it SOO easy to use vectors of 4 floats like a POD type.
+
+1.2.2 (May 6, 2005) The Matthew release
+ Replaced fixed point division with multiply&shift. Thanks to Jean-Marc Valin for
+ discussions regarding. Considerable speedup for fixed-point.
+
+ Corrected overflow protection in real fft routines when using fixed point.
+ Finder's Credit goes to Robert Oschler of robodance for pointing me at the bug.
+ This also led to the CHECK_OVERFLOW_OP macro.
+
+1.2.1 (April 4, 2004)
+ compiles cleanly with just about every -W warning flag under the sun
+
+ reorganized kiss_fft_state so it could be read-only/const. This may be useful for embedded systems
+ that are willing to predeclare twiddle factors, factorization.
+
+ Fixed C_MUL,S_MUL on 16-bit platforms.
+
+ tmpbuf will only be allocated if input & output buffers are same
+ scratchbuf will only be allocated for ffts that are not multiples of 2,3,5
+
+ NOTE: The tmpbuf,scratchbuf changes may require synchronization code for multi-threaded apps.
+
+
+1.2 (Feb 23, 2004)
+ interface change -- cfg object is forward declaration of struct instead of void*
+ This maintains type saftey and lets the compiler warn/error about stupid mistakes.
+ (prompted by suggestion from Erik de Castro Lopo)
+
+ small speed improvements
+
+ added psdpng.c -- sample utility that will create png spectrum "waterfalls" from an input file
+ ( not terribly useful yet)
+
+1.1.1 (Feb 1, 2004 )
+ minor bug fix -- only affects odd rank, in-place, multi-dimensional FFTs
+
+1.1 : (Jan 30,2004)
+ split sample_code/ into test/ and tools/
+
+ Removed 2-D fft and added N-D fft (arbitrary)
+
+ modified fftutil.c to allow multi-d FFTs
+
+ Modified core fft routine to allow an input stride via kiss_fft_stride()
+ (eased support of multi-D ffts)
+
+ Added fast convolution filtering (FIR filtering using overlap-scrap method, with tail scrap)
+
+ Add kfc.[ch]: the KISS FFT Cache. It takes care of allocs for you ( suggested by Oscar Lesta ).
+
+1.0.1 (Dec 15, 2003)
+ fixed bug that occurred when nfft==1. Thanks to Steven Johnson.
+
+1.0 : (Dec 14, 2003)
+ changed kiss_fft function from using a single buffer, to two buffers.
+ If the same buffer pointer is supplied for both in and out, kiss will
+ manage the buffer copies.
+
+ added kiss_fft2d and kiss_fftr as separate source files (declarations in kiss_fft.h )
+
+0.4 :(Nov 4,2003) optimized for radix 2,3,4,5
+
+0.3 :(Oct 28, 2003) woops, version 2 didn't actually factor out any radices other than 2.
+ Thanks to Steven Johnson for finding this one.
+
+0.2 :(Oct 27, 2003) added mixed radix, only radix 2,4 optimized versions
+
+0.1 :(May 19 2003) initial release, radix 2 only
--- /dev/null
+add_subdirectory(tools)
--- /dev/null
+Copyright (c) 2003-2010 Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--- /dev/null
+KFVER=129
+
+doc:
+ @echo "Start by reading the README file. If you want to build and test lots of stuff, do a 'make testall'"
+ @echo "but be aware that 'make testall' has dependencies that the basic kissfft software does not"
+
+testall:
+ # The simd and int32_t types may or may not work on your machine
+ make -C test DATATYPE=simd CFLAGADD="$(CFLAGADD)" test
+ make -C test DATATYPE=int32_t CFLAGADD="$(CFLAGADD)" test
+ make -C test DATATYPE=int16_t CFLAGADD="$(CFLAGADD)" test
+ make -C test DATATYPE=float CFLAGADD="$(CFLAGADD)" test
+ make -C test DATATYPE=double CFLAGADD="$(CFLAGADD)" test
+
+tarball: clean
+ hg archive -r v$(KFVER) -t tgz kiss_fft$(KFVER).tar.gz
+ hg archive -r v$(KFVER) -t zip kiss_fft$(KFVER).zip
+
+clean:
+ cd test && make clean
+ cd tools && make clean
+ rm -f kiss_fft*.tar.gz *~ *.pyc kiss_fft*.zip
+
+asm: kiss_fft.s
+
+kiss_fft.s: kiss_fft.c kiss_fft.h _kiss_fft_guts.h
+ [ -e kiss_fft.s ] && mv kiss_fft.s kiss_fft.s~ || true
+ gcc -S kiss_fft.c -O3 -mtune=native -ffast-math -fomit-frame-pointer -unroll-loops -dA -fverbose-asm
+ gcc -o kiss_fft_short.s -S kiss_fft.c -O3 -mtune=native -ffast-math -fomit-frame-pointer -dA -fverbose-asm -DFIXED_POINT
+ [ -e kiss_fft.s~ ] && diff kiss_fft.s~ kiss_fft.s || true
--- /dev/null
+KISS FFT - A mixed-radix Fast Fourier Transform based up on the principle,
+"Keep It Simple, Stupid."
+
+ There are many great fft libraries already around. Kiss FFT is not trying
+to be better than any of them. It only attempts to be a reasonably efficient,
+moderately useful FFT that can use fixed or floating data types and can be
+incorporated into someone's C program in a few minutes with trivial licensing.
+
+USAGE:
+
+ The basic usage for 1-d complex FFT is:
+
+ #include "kiss_fft.h"
+
+ kiss_fft_cfg cfg = kiss_fft_alloc( nfft ,is_inverse_fft ,0,0 );
+
+ while ...
+
+ ... // put kth sample in cx_in[k].r and cx_in[k].i
+
+ kiss_fft( cfg , cx_in , cx_out );
+
+ ... // transformed. DC is in cx_out[0].r and cx_out[0].i
+
+ free(cfg);
+
+ Note: frequency-domain data is stored from dc up to 2pi.
+ so cx_out[0] is the dc bin of the FFT
+ and cx_out[nfft/2] is the Nyquist bin (if exists)
+
+ Declarations are in "kiss_fft.h", along with a brief description of the
+functions you'll need to use.
+
+Code definitions for 1d complex FFTs are in kiss_fft.c.
+
+You can do other cool stuff with the extras you'll find in tools/
+
+ * multi-dimensional FFTs
+ * real-optimized FFTs (returns the positive half-spectrum: (nfft/2+1) complex frequency bins)
+ * fast convolution FIR filtering (not available for fixed point)
+ * spectrum image creation
+
+The core fft and most tools/ code can be compiled to use float, double
+or Q15 short samples. The default is float.
+
+
+BACKGROUND:
+
+ I started coding this because I couldn't find a fixed point FFT that didn't
+use assembly code. I started with floating point numbers so I could get the
+theory straight before working on fixed point issues. In the end, I had a
+little bit of code that could be recompiled easily to do ffts with short, float
+or double (other types should be easy too).
+
+ Once I got my FFT working, I was curious about the speed compared to
+a well respected and highly optimized fft library. I don't want to criticize
+this great library, so let's call it FFT_BRANDX.
+During this process, I learned:
+
+ 1. FFT_BRANDX has more than 100K lines of code. The core of kiss_fft is about 500 lines (cpx 1-d).
+ 2. It took me an embarrassingly long time to get FFT_BRANDX working.
+ 3. A simple program using FFT_BRANDX is 522KB. A similar program using kiss_fft is 18KB (without optimizing for size).
+ 4. FFT_BRANDX is roughly twice as fast as KISS FFT in default mode.
+
+ It is wonderful that free, highly optimized libraries like FFT_BRANDX exist.
+But such libraries carry a huge burden of complexity necessary to extract every
+last bit of performance.
+
+ Sometimes simpler is better, even if it's not better.
+
+FREQUENTLY ASKED QUESTIONS:
+ Q: Can I use kissfft in a project with a ___ license?
+ A: Yes. See LICENSE below.
+
+ Q: Why don't I get the output I expect?
+ A: The two most common causes of this are
+ 1) scaling : is there a constant multiplier between what you got and what you want?
+ 2) mixed build environment -- all code must be compiled with same preprocessor
+ definitions for FIXED_POINT and kiss_fft_scalar
+
+ Q: Will you write/debug my code for me?
+ A: Probably not unless you pay me. I am happy to answer pointed and topical questions, but
+ I may refer you to a book, a forum, or some other resource.
+
+
+PERFORMANCE:
+ (on Athlon XP 2100+, with gcc 2.96, float data type)
+
+ Kiss performed 10000 1024-pt cpx ffts in .63 s of cpu time.
+ For comparison, it took md5sum twice as long to process the same amount of data.
+
+ Transforming 5 minutes of CD quality audio takes less than a second (nfft=1024).
+
+DO NOT:
+ ... use Kiss if you need the Fastest Fourier Transform in the World
+ ... ask me to add features that will bloat the code
+
+UNDER THE HOOD:
+
+ Kiss FFT uses a time decimation, mixed-radix, out-of-place FFT. If you give it an input buffer
+ and output buffer that are the same, a temporary buffer will be created to hold the data.
+
+ No static data is used. The core routines of kiss_fft are thread-safe (but not all of the tools directory).
+
+ No scaling is done for the floating point version (for speed).
+ Scaling is done both ways for the fixed-point version (for overflow prevention).
+
+ Optimized butterflies are used for factors 2,3,4, and 5.
+
+ The real (i.e. not complex) optimization code only works for even length ffts. It does two half-length
+ FFTs in parallel (packed into real&imag), and then combines them via twiddling. The result is
+ nfft/2+1 complex frequency bins from DC to Nyquist. If you don't know what this means, search the web.
+
+ The fast convolution filtering uses the overlap-scrap method, slightly
+ modified to put the scrap at the tail.
+
+LICENSE:
+ Revised BSD License, see COPYING for verbiage.
+ Basically, "free to use&change, give credit where due, no guarantees"
+ Note this license is compatible with GPL at one end of the spectrum and closed, commercial software at
+ the other end. See http://www.fsf.org/licensing/licenses
+
+ A commercial license is available which removes the requirement for attribution. Contact me for details.
+
+
+TODO:
+ *) Add real optimization for odd length FFTs
+ *) Document/revisit the input/output fft scaling
+ *) Make doc describing the overlap (tail) scrap fast convolution filtering in kiss_fastfir.c
+ *) Test all the ./tools/ code with fixed point (kiss_fastfir.c doesn't work, maybe others)
+
+AUTHOR:
+ Mark Borgerding
+ Mark@Borgerding.net
--- /dev/null
+If you are reading this, it means you think you may be interested in using the SIMD extensions within kissfft.
+
+Beware! Beyond here there be dragons!
+
+This API is not easy to use, is not well documented, and breaks the KISS principle.
+
+
+Still reading? Okay, you may get rewarded for your patience with a considerable speedup
+(2-3x) on intel x86 machines with SSE if you are willing to jump through some hoops.
+
+The basic idea is to use the packed 4 float __m128 data type as a scalar element.
+This means that the format is pretty convoluted. It performs 4 FFTs per fft call on signals A,B,C,D.
+
+For complex data, the data is interlaced as follows:
+rA0,rB0,rC0,rD0, iA0,iB0,iC0,iD0, rA1,rB1,rC1,rD1, iA1,iB1,iC1,iD1 ...
+where "rA0" is the real part of the zeroth sample for signal A
+
+Real-only data is laid out:
+rA0,rB0,rC0,rD0, rA1,rB1,rC1,rD1, ...
+
+Compile with gcc flags something like
+-O3 -mpreferred-stack-boundary=4 -DUSE_SIMD=1 -msse
+
+Be aware of SIMD alignment. This is the most likely cause of segfaults.
+The code within kissfft uses scratch variables on the stack.
+With SIMD, these must have addresses on 16 byte boundaries.
+Search on "SIMD alignment" for more info.
+
+
+
+Robin at Divide Concept was kind enough to share his code for formatting to/from the SIMD kissfft.
+I have not run it -- use it at your own risk.
+
+void SSETools::pack128(float* target, float* source, unsigned long size128)
+{
+ __m128* pDest = (__m128*)target;
+ __m128* pDestEnd = pDest+size128;
+ float* source0=source;
+ float* source1=source0+size128;
+ float* source2=source1+size128;
+ float* source3=source2+size128;
+
+ while(pDest<pDestEnd)
+ {
+ *pDest=_mm_set_ps(*source3,*source2,*source1,*source0);
+ source0++;
+ source1++;
+ source2++;
+ source3++;
+ pDest++;
+ }
+}
+
+void SSETools::unpack128(float* target, float* source, unsigned long size128)
+{
+
+ float* pSrc = source;
+ float* pSrcEnd = pSrc+size128*4;
+ float* target0=target;
+ float* target1=target0+size128;
+ float* target2=target1+size128;
+ float* target3=target2+size128;
+
+ while(pSrc<pSrcEnd)
+ {
+ *target0=pSrc[0];
+ *target1=pSrc[1];
+ *target2=pSrc[2];
+ *target3=pSrc[3];
+ target0++;
+ target1++;
+ target2++;
+ target3++;
+ pSrc+=4;
+ }
+}
--- /dev/null
+Speed:
+ * If you want to use multiple cores, then compile with -openmp or -fopenmp (see your compiler docs).
+ Realize that larger FFTs will reap more benefit than smaller FFTs. This generally uses more CPU time, but
+ less wall time.
+
+ * experiment with compiler flags
+ Special thanks to Oscar Lesta. He suggested some compiler flags
+ for gcc that make a big difference. They shave 10-15% off
+ execution time on some systems. Try some combination of:
+ -march=pentiumpro
+ -ffast-math
+ -fomit-frame-pointer
+
+ * If the input data has no imaginary component, use the kiss_fftr code under tools/.
+ Real ffts are roughly twice as fast as complex.
+
+ * If you can rearrange your code to do 4 FFTs in parallel and you are on a recent Intel or AMD machine,
+ then you might want to experiment with the USE_SIMD code. See README.simd
+
+
+Reducing code size:
+ * remove some of the butterflies. There are currently butterflies optimized for radices
+ 2,3,4,5. It is worth mentioning that you can still use FFT sizes that contain
+ these factors, they just won't be quite as fast. You can decide for yourself
+ whether to keep radix 2 or 4. If you do some work in this area, let me
+ know what you find.
+
+ * For platforms where ROM/code space is more plentiful than RAM,
+ consider creating a hardcoded kiss_fft_state. In other words, decide which
+ FFT size(s) you want and make a structure with the correct factors and twiddles.
+
+ * Frank van der Hulst offered numerous suggestions for smaller code size and correct operation
+ on embedded targets. "I'm happy to help anyone who is trying to implement KISSFFT on a micro"
+
+ Some of these were rolled into the mainline code base:
+ - using long casts to promote intermediate results of short*short multiplication
+ - delaying allocation of buffers that are sometimes unused.
+ In some cases, it may be desirable to limit capability in order to better suit the target:
+ - predefining the twiddle tables for the desired fft size.
--- /dev/null
+/*
+Copyright (c) 2003-2010, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+/* kiss_fft.h
+ defines kiss_fft_scalar as either short or a float type
+ and defines
+ typedef struct { kiss_fft_scalar r; kiss_fft_scalar i; }kiss_fft_cpx; */
+#include "kiss_fft.h"
+#include <limits.h>
+
+#define MAXFACTORS 32
+/* e.g. an fft of length 128 has 4 factors
+ as far as kissfft is concerned
+ 4*4*4*2
+ */
+
+struct kiss_fft_state{
+ int nfft;
+ int inverse;
+ int factors[2*MAXFACTORS];
+ kiss_fft_cpx twiddles[1];
+};
+
+/*
+ Explanation of macros dealing with complex math:
+
+ C_MUL(m,a,b) : m = a*b
+ C_FIXDIV( c , div ) : if a fixed point impl., c /= div. noop otherwise
+ C_SUB( res, a,b) : res = a - b
+ C_SUBFROM( res , a) : res -= a
+ C_ADDTO( res , a) : res += a
+ * */
+#ifdef FIXED_POINT
+#if (FIXED_POINT==32)
+# define FRACBITS 31
+# define SAMPPROD int64_t
+#define SAMP_MAX 2147483647
+#else
+# define FRACBITS 15
+# define SAMPPROD int32_t
+#define SAMP_MAX 32767
+#endif
+
+#define SAMP_MIN -SAMP_MAX
+
+#if defined(CHECK_OVERFLOW)
+# define CHECK_OVERFLOW_OP(a,op,b) \
+ if ( (SAMPPROD)(a) op (SAMPPROD)(b) > SAMP_MAX || (SAMPPROD)(a) op (SAMPPROD)(b) < SAMP_MIN ) { \
+ fprintf(stderr,"WARNING:overflow @ " __FILE__ "(%d): (%d " #op" %d) = %ld\n",__LINE__,(a),(b),(SAMPPROD)(a) op (SAMPPROD)(b) ); }
+#endif
+
+
+# define smul(a,b) ( (SAMPPROD)(a)*(b) )
+# define sround( x ) (kiss_fft_scalar)( ( (x) + (1<<(FRACBITS-1)) ) >> FRACBITS )
+
+# define S_MUL(a,b) sround( smul(a,b) )
+
+# define C_MUL(m,a,b) \
+ do{ (m).r = sround( smul((a).r,(b).r) - smul((a).i,(b).i) ); \
+ (m).i = sround( smul((a).r,(b).i) + smul((a).i,(b).r) ); }while(0)
+
+# define DIVSCALAR(x,k) \
+ (x) = sround( smul( x, SAMP_MAX/k ) )
+
+# define C_FIXDIV(c,div) \
+ do { DIVSCALAR( (c).r , div); \
+ DIVSCALAR( (c).i , div); }while (0)
+
+# define C_MULBYSCALAR( c, s ) \
+ do{ (c).r = sround( smul( (c).r , s ) ) ;\
+ (c).i = sround( smul( (c).i , s ) ) ; }while(0)
+
+#else /* not FIXED_POINT*/
+
+# define S_MUL(a,b) ( (a)*(b) )
+#define C_MUL(m,a,b) \
+ do{ (m).r = (a).r*(b).r - (a).i*(b).i;\
+ (m).i = (a).r*(b).i + (a).i*(b).r; }while(0)
+# define C_FIXDIV(c,div) /* NOOP */
+# define C_MULBYSCALAR( c, s ) \
+ do{ (c).r *= (s);\
+ (c).i *= (s); }while(0)
+#endif
+
+#ifndef CHECK_OVERFLOW_OP
+# define CHECK_OVERFLOW_OP(a,op,b) /* noop */
+#endif
+
+#define C_ADD( res, a,b)\
+ do { \
+ CHECK_OVERFLOW_OP((a).r,+,(b).r)\
+ CHECK_OVERFLOW_OP((a).i,+,(b).i)\
+ (res).r=(a).r+(b).r; (res).i=(a).i+(b).i; \
+ }while(0)
+#define C_SUB( res, a,b)\
+ do { \
+ CHECK_OVERFLOW_OP((a).r,-,(b).r)\
+ CHECK_OVERFLOW_OP((a).i,-,(b).i)\
+ (res).r=(a).r-(b).r; (res).i=(a).i-(b).i; \
+ }while(0)
+#define C_ADDTO( res , a)\
+ do { \
+ CHECK_OVERFLOW_OP((res).r,+,(a).r)\
+ CHECK_OVERFLOW_OP((res).i,+,(a).i)\
+ (res).r += (a).r; (res).i += (a).i;\
+ }while(0)
+
+#define C_SUBFROM( res , a)\
+ do {\
+ CHECK_OVERFLOW_OP((res).r,-,(a).r)\
+ CHECK_OVERFLOW_OP((res).i,-,(a).i)\
+ (res).r -= (a).r; (res).i -= (a).i; \
+ }while(0)
+
+
+#ifdef FIXED_POINT
+# define KISS_FFT_COS(phase) floor(.5+SAMP_MAX * cos (phase))
+# define KISS_FFT_SIN(phase) floor(.5+SAMP_MAX * sin (phase))
+# define HALF_OF(x) ((x)>>1)
+#elif defined(USE_SIMD)
+# define KISS_FFT_COS(phase) _mm_set1_ps( cos(phase) )
+# define KISS_FFT_SIN(phase) _mm_set1_ps( sin(phase) )
+# define HALF_OF(x) ((x)*_mm_set1_ps(.5))
+#else
+# define KISS_FFT_COS(phase) (kiss_fft_scalar) cos(phase)
+# define KISS_FFT_SIN(phase) (kiss_fft_scalar) sin(phase)
+# define HALF_OF(x) ((x)*.5)
+#endif
+
+#define kf_cexp(x,phase) \
+ do{ \
+ (x)->r = KISS_FFT_COS(phase);\
+ (x)->i = KISS_FFT_SIN(phase);\
+ }while(0)
+
+
+/* a debugging function */
+#define pcpx(c)\
+ fprintf(stderr,"%g + %gi\n",(double)((c)->r),(double)((c)->i) )
+
+
+#ifdef KISS_FFT_USE_ALLOCA
+// define this to allow use of alloca instead of malloc for temporary buffers
+// Temporary buffers are used in two case:
+// 1. FFT sizes that have "bad" factors. i.e. not 2,3 and 5
+// 2. "in-place" FFTs. Notice the quotes, since kissfft does not really do an in-place transform.
+#include <alloca.h>
+#define KISS_FFT_TMP_ALLOC(nbytes) alloca(nbytes)
+#define KISS_FFT_TMP_FREE(ptr)
+#else
+#define KISS_FFT_TMP_ALLOC(nbytes) KISS_FFT_MALLOC(nbytes)
+#define KISS_FFT_TMP_FREE(ptr) KISS_FFT_FREE(ptr)
+#endif
--- /dev/null
+/*
+Copyright (c) 2003-2010, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+
+#include "_kiss_fft_guts.h"
+/* The guts header contains all the multiplication and addition macros that are defined for
+ fixed or floating point complex numbers. It also delares the kf_ internal functions.
+ */
+
+static void kf_bfly2(
+ kiss_fft_cpx * Fout,
+ const size_t fstride,
+ const kiss_fft_cfg st,
+ int m
+ )
+{
+ kiss_fft_cpx * Fout2;
+ kiss_fft_cpx * tw1 = st->twiddles;
+ kiss_fft_cpx t;
+ Fout2 = Fout + m;
+ do{
+ C_FIXDIV(*Fout,2); C_FIXDIV(*Fout2,2);
+
+ C_MUL (t, *Fout2 , *tw1);
+ tw1 += fstride;
+ C_SUB( *Fout2 , *Fout , t );
+ C_ADDTO( *Fout , t );
+ ++Fout2;
+ ++Fout;
+ }while (--m);
+}
+
+static void kf_bfly4(
+ kiss_fft_cpx * Fout,
+ const size_t fstride,
+ const kiss_fft_cfg st,
+ const size_t m
+ )
+{
+ kiss_fft_cpx *tw1,*tw2,*tw3;
+ kiss_fft_cpx scratch[6];
+ size_t k=m;
+ const size_t m2=2*m;
+ const size_t m3=3*m;
+
+
+ tw3 = tw2 = tw1 = st->twiddles;
+
+ do {
+ C_FIXDIV(*Fout,4); C_FIXDIV(Fout[m],4); C_FIXDIV(Fout[m2],4); C_FIXDIV(Fout[m3],4);
+
+ C_MUL(scratch[0],Fout[m] , *tw1 );
+ C_MUL(scratch[1],Fout[m2] , *tw2 );
+ C_MUL(scratch[2],Fout[m3] , *tw3 );
+
+ C_SUB( scratch[5] , *Fout, scratch[1] );
+ C_ADDTO(*Fout, scratch[1]);
+ C_ADD( scratch[3] , scratch[0] , scratch[2] );
+ C_SUB( scratch[4] , scratch[0] , scratch[2] );
+ C_SUB( Fout[m2], *Fout, scratch[3] );
+ tw1 += fstride;
+ tw2 += fstride*2;
+ tw3 += fstride*3;
+ C_ADDTO( *Fout , scratch[3] );
+
+ if(st->inverse) {
+ Fout[m].r = scratch[5].r - scratch[4].i;
+ Fout[m].i = scratch[5].i + scratch[4].r;
+ Fout[m3].r = scratch[5].r + scratch[4].i;
+ Fout[m3].i = scratch[5].i - scratch[4].r;
+ }else{
+ Fout[m].r = scratch[5].r + scratch[4].i;
+ Fout[m].i = scratch[5].i - scratch[4].r;
+ Fout[m3].r = scratch[5].r - scratch[4].i;
+ Fout[m3].i = scratch[5].i + scratch[4].r;
+ }
+ ++Fout;
+ }while(--k);
+}
+
+static void kf_bfly3(
+ kiss_fft_cpx * Fout,
+ const size_t fstride,
+ const kiss_fft_cfg st,
+ size_t m
+ )
+{
+ size_t k=m;
+ const size_t m2 = 2*m;
+ kiss_fft_cpx *tw1,*tw2;
+ kiss_fft_cpx scratch[5];
+ kiss_fft_cpx epi3;
+ epi3 = st->twiddles[fstride*m];
+
+ tw1=tw2=st->twiddles;
+
+ do{
+ C_FIXDIV(*Fout,3); C_FIXDIV(Fout[m],3); C_FIXDIV(Fout[m2],3);
+
+ C_MUL(scratch[1],Fout[m] , *tw1);
+ C_MUL(scratch[2],Fout[m2] , *tw2);
+
+ C_ADD(scratch[3],scratch[1],scratch[2]);
+ C_SUB(scratch[0],scratch[1],scratch[2]);
+ tw1 += fstride;
+ tw2 += fstride*2;
+
+ Fout[m].r = Fout->r - HALF_OF(scratch[3].r);
+ Fout[m].i = Fout->i - HALF_OF(scratch[3].i);
+
+ C_MULBYSCALAR( scratch[0] , epi3.i );
+
+ C_ADDTO(*Fout,scratch[3]);
+
+ Fout[m2].r = Fout[m].r + scratch[0].i;
+ Fout[m2].i = Fout[m].i - scratch[0].r;
+
+ Fout[m].r -= scratch[0].i;
+ Fout[m].i += scratch[0].r;
+
+ ++Fout;
+ }while(--k);
+}
+
+static void kf_bfly5(
+ kiss_fft_cpx * Fout,
+ const size_t fstride,
+ const kiss_fft_cfg st,
+ int m
+ )
+{
+ kiss_fft_cpx *Fout0,*Fout1,*Fout2,*Fout3,*Fout4;
+ int u;
+ kiss_fft_cpx scratch[13];
+ kiss_fft_cpx * twiddles = st->twiddles;
+ kiss_fft_cpx *tw;
+ kiss_fft_cpx ya,yb;
+ ya = twiddles[fstride*m];
+ yb = twiddles[fstride*2*m];
+
+ Fout0=Fout;
+ Fout1=Fout0+m;
+ Fout2=Fout0+2*m;
+ Fout3=Fout0+3*m;
+ Fout4=Fout0+4*m;
+
+ tw=st->twiddles;
+ for ( u=0; u<m; ++u ) {
+ C_FIXDIV( *Fout0,5); C_FIXDIV( *Fout1,5); C_FIXDIV( *Fout2,5); C_FIXDIV( *Fout3,5); C_FIXDIV( *Fout4,5);
+ scratch[0] = *Fout0;
+
+ C_MUL(scratch[1] ,*Fout1, tw[u*fstride]);
+ C_MUL(scratch[2] ,*Fout2, tw[2*u*fstride]);
+ C_MUL(scratch[3] ,*Fout3, tw[3*u*fstride]);
+ C_MUL(scratch[4] ,*Fout4, tw[4*u*fstride]);
+
+ C_ADD( scratch[7],scratch[1],scratch[4]);
+ C_SUB( scratch[10],scratch[1],scratch[4]);
+ C_ADD( scratch[8],scratch[2],scratch[3]);
+ C_SUB( scratch[9],scratch[2],scratch[3]);
+
+ Fout0->r += scratch[7].r + scratch[8].r;
+ Fout0->i += scratch[7].i + scratch[8].i;
+
+ scratch[5].r = scratch[0].r + S_MUL(scratch[7].r,ya.r) + S_MUL(scratch[8].r,yb.r);
+ scratch[5].i = scratch[0].i + S_MUL(scratch[7].i,ya.r) + S_MUL(scratch[8].i,yb.r);
+
+ scratch[6].r = S_MUL(scratch[10].i,ya.i) + S_MUL(scratch[9].i,yb.i);
+ scratch[6].i = -S_MUL(scratch[10].r,ya.i) - S_MUL(scratch[9].r,yb.i);
+
+ C_SUB(*Fout1,scratch[5],scratch[6]);
+ C_ADD(*Fout4,scratch[5],scratch[6]);
+
+ scratch[11].r = scratch[0].r + S_MUL(scratch[7].r,yb.r) + S_MUL(scratch[8].r,ya.r);
+ scratch[11].i = scratch[0].i + S_MUL(scratch[7].i,yb.r) + S_MUL(scratch[8].i,ya.r);
+ scratch[12].r = - S_MUL(scratch[10].i,yb.i) + S_MUL(scratch[9].i,ya.i);
+ scratch[12].i = S_MUL(scratch[10].r,yb.i) - S_MUL(scratch[9].r,ya.i);
+
+ C_ADD(*Fout2,scratch[11],scratch[12]);
+ C_SUB(*Fout3,scratch[11],scratch[12]);
+
+ ++Fout0;++Fout1;++Fout2;++Fout3;++Fout4;
+ }
+}
+
+/* perform the butterfly for one stage of a mixed radix FFT */
+static void kf_bfly_generic(
+ kiss_fft_cpx * Fout,
+ const size_t fstride,
+ const kiss_fft_cfg st,
+ int m,
+ int p
+ )
+{
+ int u,k,q1,q;
+ kiss_fft_cpx * twiddles = st->twiddles;
+ kiss_fft_cpx t;
+ int Norig = st->nfft;
+
+ kiss_fft_cpx * scratch = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC(sizeof(kiss_fft_cpx)*p);
+
+ for ( u=0; u<m; ++u ) {
+ k=u;
+ for ( q1=0 ; q1<p ; ++q1 ) {
+ scratch[q1] = Fout[ k ];
+ C_FIXDIV(scratch[q1],p);
+ k += m;
+ }
+
+ k=u;
+ for ( q1=0 ; q1<p ; ++q1 ) {
+ int twidx=0;
+ Fout[ k ] = scratch[0];
+ for (q=1;q<p;++q ) {
+ twidx += fstride * k;
+ if (twidx>=Norig) twidx-=Norig;
+ C_MUL(t,scratch[q] , twiddles[twidx] );
+ C_ADDTO( Fout[ k ] ,t);
+ }
+ k += m;
+ }
+ }
+ KISS_FFT_TMP_FREE(scratch);
+}
+
+static
+void kf_work(
+ kiss_fft_cpx * Fout,
+ const kiss_fft_cpx * f,
+ const size_t fstride,
+ int in_stride,
+ int * factors,
+ const kiss_fft_cfg st
+ )
+{
+ kiss_fft_cpx * Fout_beg=Fout;
+ const int p=*factors++; /* the radix */
+ const int m=*factors++; /* stage's fft length/p */
+ const kiss_fft_cpx * Fout_end = Fout + p*m;
+
+#ifdef _OPENMP
+ // use openmp extensions at the
+ // top-level (not recursive)
+ if (fstride==1 && p<=5)
+ {
+ int k;
+
+ // execute the p different work units in different threads
+# pragma omp parallel for
+ for (k=0;k<p;++k)
+ kf_work( Fout +k*m, f+ fstride*in_stride*k,fstride*p,in_stride,factors,st);
+ // all threads have joined by this point
+
+ switch (p) {
+ case 2: kf_bfly2(Fout,fstride,st,m); break;
+ case 3: kf_bfly3(Fout,fstride,st,m); break;
+ case 4: kf_bfly4(Fout,fstride,st,m); break;
+ case 5: kf_bfly5(Fout,fstride,st,m); break;
+ default: kf_bfly_generic(Fout,fstride,st,m,p); break;
+ }
+ return;
+ }
+#endif
+
+ if (m==1) {
+ do{
+ *Fout = *f;
+ f += fstride*in_stride;
+ }while(++Fout != Fout_end );
+ }else{
+ do{
+ // recursive call:
+ // DFT of size m*p performed by doing
+ // p instances of smaller DFTs of size m,
+ // each one takes a decimated version of the input
+ kf_work( Fout , f, fstride*p, in_stride, factors,st);
+ f += fstride*in_stride;
+ }while( (Fout += m) != Fout_end );
+ }
+
+ Fout=Fout_beg;
+
+ // recombine the p smaller DFTs
+ switch (p) {
+ case 2: kf_bfly2(Fout,fstride,st,m); break;
+ case 3: kf_bfly3(Fout,fstride,st,m); break;
+ case 4: kf_bfly4(Fout,fstride,st,m); break;
+ case 5: kf_bfly5(Fout,fstride,st,m); break;
+ default: kf_bfly_generic(Fout,fstride,st,m,p); break;
+ }
+}
+
+/* facbuf is populated by p1,m1,p2,m2, ...
+ where
+ p[i] * m[i] = m[i-1]
+ m0 = n */
+static
+void kf_factor(int n,int * facbuf)
+{
+ int p=4;
+ double floor_sqrt;
+ floor_sqrt = floor( sqrt((double)n) );
+
+ /*factor out powers of 4, powers of 2, then any remaining primes */
+ do {
+ while (n % p) {
+ switch (p) {
+ case 4: p = 2; break;
+ case 2: p = 3; break;
+ default: p += 2; break;
+ }
+ if (p > floor_sqrt)
+ p = n; /* no more factors, skip to end */
+ }
+ n /= p;
+ *facbuf++ = p;
+ *facbuf++ = n;
+ } while (n > 1);
+}
+
+/*
+ *
+ * User-callable function to allocate all necessary storage space for the fft.
+ *
+ * The return value is a contiguous block of memory, allocated with malloc. As such,
+ * It can be freed with free(), rather than a kiss_fft-specific function.
+ * */
+kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem )
+{
+ kiss_fft_cfg st=NULL;
+ size_t memneeded = sizeof(struct kiss_fft_state)
+ + sizeof(kiss_fft_cpx)*(nfft-1); /* twiddle factors*/
+
+ if ( lenmem==NULL ) {
+ st = ( kiss_fft_cfg)KISS_FFT_MALLOC( memneeded );
+ }else{
+ if (mem != NULL && *lenmem >= memneeded)
+ st = (kiss_fft_cfg)mem;
+ *lenmem = memneeded;
+ }
+ if (st) {
+ int i;
+ st->nfft=nfft;
+ st->inverse = inverse_fft;
+
+ for (i=0;i<nfft;++i) {
+ const double pi=3.141592653589793238462643383279502884197169399375105820974944;
+ double phase = -2*pi*i / nfft;
+ if (st->inverse)
+ phase *= -1;
+ kf_cexp(st->twiddles+i, phase );
+ }
+
+ kf_factor(nfft,st->factors);
+ }
+ return st;
+}
+
+
+void kiss_fft_stride(kiss_fft_cfg st,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int in_stride)
+{
+ if (fin == fout) {
+ //NOTE: this is not really an in-place FFT algorithm.
+ //It just performs an out-of-place FFT into a temp buffer
+ kiss_fft_cpx * tmpbuf = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC( sizeof(kiss_fft_cpx)*st->nfft);
+ kf_work(tmpbuf,fin,1,in_stride, st->factors,st);
+ memcpy(fout,tmpbuf,sizeof(kiss_fft_cpx)*st->nfft);
+ KISS_FFT_TMP_FREE(tmpbuf);
+ }else{
+ kf_work( fout, fin, 1,in_stride, st->factors,st );
+ }
+}
+
+void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout)
+{
+ kiss_fft_stride(cfg,fin,fout,1);
+}
+
+
+void kiss_fft_cleanup(void)
+{
+ // nothing needed any more
+}
+
+int kiss_fft_next_fast_size(int n)
+{
+ while(1) {
+ int m=n;
+ while ( (m%2) == 0 ) m/=2;
+ while ( (m%3) == 0 ) m/=3;
+ while ( (m%5) == 0 ) m/=5;
+ if (m<=1)
+ break; /* n is completely factorable by twos, threes, and fives */
+ n++;
+ }
+ return n;
+}
--- /dev/null
+#ifndef KISS_FFT_H
+#define KISS_FFT_H
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include <string.h>
+#include <malloc.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ ATTENTION!
+ If you would like a :
+ -- a utility that will handle the caching of fft objects
+ -- real-only (no imaginary time component ) FFT
+ -- a multi-dimensional FFT
+ -- a command-line utility to perform ffts
+ -- a command-line utility to perform fast-convolution filtering
+
+ Then see kfc.h kiss_fftr.h kiss_fftnd.h fftutil.c kiss_fastfir.c
+ in the tools/ directory.
+*/
+
+#ifdef USE_SIMD
+# include <xmmintrin.h>
+# define kiss_fft_scalar __m128
+#define KISS_FFT_MALLOC(nbytes) _mm_malloc(nbytes,16)
+#define KISS_FFT_FREE _mm_free
+#else
+#define KISS_FFT_MALLOC malloc
+#define KISS_FFT_FREE free
+#endif
+
+
+#ifdef FIXED_POINT
+#include <sys/types.h>
+# if (FIXED_POINT == 32)
+# define kiss_fft_scalar int32_t
+# else
+# define kiss_fft_scalar int16_t
+# endif
+#else
+# ifndef kiss_fft_scalar
+/* default is float */
+# define kiss_fft_scalar float
+# endif
+#endif
+
+typedef struct {
+ kiss_fft_scalar r;
+ kiss_fft_scalar i;
+}kiss_fft_cpx;
+
+typedef struct kiss_fft_state* kiss_fft_cfg;
+
+/*
+ * kiss_fft_alloc
+ *
+ * Initialize a FFT (or IFFT) algorithm's cfg/state buffer.
+ *
+ * typical usage: kiss_fft_cfg mycfg=kiss_fft_alloc(1024,0,NULL,NULL);
+ *
+ * The return value from fft_alloc is a cfg buffer used internally
+ * by the fft routine or NULL.
+ *
+ * If lenmem is NULL, then kiss_fft_alloc will allocate a cfg buffer using malloc.
+ * The returned value should be free()d when done to avoid memory leaks.
+ *
+ * The state can be placed in a user supplied buffer 'mem':
+ * If lenmem is not NULL and mem is not NULL and *lenmem is large enough,
+ * then the function places the cfg in mem and the size used in *lenmem
+ * and returns mem.
+ *
+ * If lenmem is not NULL and ( mem is NULL or *lenmem is not large enough),
+ * then the function returns NULL and places the minimum cfg
+ * buffer size in *lenmem.
+ * */
+
+kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem);
+
+/*
+ * kiss_fft(cfg,in_out_buf)
+ *
+ * Perform an FFT on a complex input buffer.
+ * for a forward FFT,
+ * fin should be f[0] , f[1] , ... ,f[nfft-1]
+ * fout will be F[0] , F[1] , ... ,F[nfft-1]
+ * Note that each element is complex and can be accessed like
+ f[k].r and f[k].i
+ * */
+void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout);
+
+/*
+ A more generic version of the above function. It reads its input from every Nth sample.
+ * */
+void kiss_fft_stride(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int fin_stride);
+
+/* If kiss_fft_alloc allocated a buffer, it is one contiguous
+ buffer and can be simply free()d when no longer needed*/
+#define kiss_fft_free free
+
+/*
+ Cleans up some memory that gets managed internally. Not necessary to call, but it might clean up
+ your compiler output to call this before you exit.
+*/
+void kiss_fft_cleanup(void);
+
+
+/*
+ * Returns the smallest integer k, such that k>=n and k has only "fast" factors (2,3,5)
+ */
+int kiss_fft_next_fast_size(int n);
+
+/* for real ffts, we need an even size */
+#define kiss_fftr_next_fast_size_real(n) \
+ (kiss_fft_next_fast_size( ((n)+1)>>1)<<1)
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+#ifndef KISSFFT_CLASS_HH
+#include <complex>
+#include <vector>
+
+namespace kissfft_utils {
+
+template <typename T_scalar>
+struct traits
+{
+ typedef T_scalar scalar_type;
+ typedef std::complex<scalar_type> cpx_type;
+ void fill_twiddles( std::complex<T_scalar> * dst ,int nfft,bool inverse)
+ {
+ T_scalar phinc = (inverse?2:-2)* acos( (T_scalar) -1) / nfft;
+ for (int i=0;i<nfft;++i)
+ dst[i] = exp( std::complex<T_scalar>(0,i*phinc) );
+ }
+
+ void prepare(
+ std::vector< std::complex<T_scalar> > & dst,
+ int nfft,bool inverse,
+ std::vector<int> & stageRadix,
+ std::vector<int> & stageRemainder )
+ {
+ _twiddles.resize(nfft);
+ fill_twiddles( &_twiddles[0],nfft,inverse);
+ dst = _twiddles;
+
+ //factorize
+ //start factoring out 4's, then 2's, then 3,5,7,9,...
+ int n= nfft;
+ int p=4;
+ do {
+ while (n % p) {
+ switch (p) {
+ case 4: p = 2; break;
+ case 2: p = 3; break;
+ default: p += 2; break;
+ }
+ if (p*p>n)
+ p=n;// no more factors
+ }
+ n /= p;
+ stageRadix.push_back(p);
+ stageRemainder.push_back(n);
+ }while(n>1);
+ }
+ std::vector<cpx_type> _twiddles;
+
+
+ const cpx_type twiddle(int i) { return _twiddles[i]; }
+};
+
+}
+
+template <typename T_Scalar,
+ typename T_traits=kissfft_utils::traits<T_Scalar>
+ >
+class kissfft
+{
+ public:
+ typedef T_traits traits_type;
+ typedef typename traits_type::scalar_type scalar_type;
+ typedef typename traits_type::cpx_type cpx_type;
+
+ kissfft(int nfft,bool inverse,const traits_type & traits=traits_type() )
+ :_nfft(nfft),_inverse(inverse),_traits(traits)
+ {
+ _traits.prepare(_twiddles, _nfft,_inverse ,_stageRadix, _stageRemainder);
+ }
+
+ void transform(const cpx_type * src , cpx_type * dst)
+ {
+ kf_work(0, dst, src, 1,1);
+ }
+
+ private:
+ void kf_work( int stage,cpx_type * Fout, const cpx_type * f, size_t fstride,size_t in_stride)
+ {
+ int p = _stageRadix[stage];
+ int m = _stageRemainder[stage];
+ cpx_type * Fout_beg = Fout;
+ cpx_type * Fout_end = Fout + p*m;
+
+ if (m==1) {
+ do{
+ *Fout = *f;
+ f += fstride*in_stride;
+ }while(++Fout != Fout_end );
+ }else{
+ do{
+ // recursive call:
+ // DFT of size m*p performed by doing
+ // p instances of smaller DFTs of size m,
+ // each one takes a decimated version of the input
+ kf_work(stage+1, Fout , f, fstride*p,in_stride);
+ f += fstride*in_stride;
+ }while( (Fout += m) != Fout_end );
+ }
+
+ Fout=Fout_beg;
+
+ // recombine the p smaller DFTs
+ switch (p) {
+ case 2: kf_bfly2(Fout,fstride,m); break;
+ case 3: kf_bfly3(Fout,fstride,m); break;
+ case 4: kf_bfly4(Fout,fstride,m); break;
+ case 5: kf_bfly5(Fout,fstride,m); break;
+ default: kf_bfly_generic(Fout,fstride,m,p); break;
+ }
+ }
+
+ // these were #define macros in the original kiss_fft
+ void C_ADD( cpx_type & c,const cpx_type & a,const cpx_type & b) { c=a+b;}
+ void C_MUL( cpx_type & c,const cpx_type & a,const cpx_type & b) { c=a*b;}
+ void C_SUB( cpx_type & c,const cpx_type & a,const cpx_type & b) { c=a-b;}
+ void C_ADDTO( cpx_type & c,const cpx_type & a) { c+=a;}
+ void C_FIXDIV( cpx_type & ,int ) {} // NO-OP for float types
+ scalar_type S_MUL( const scalar_type & a,const scalar_type & b) { return a*b;}
+ scalar_type HALF_OF( const scalar_type & a) { return a*.5;}
+ void C_MULBYSCALAR(cpx_type & c,const scalar_type & a) {c*=a;}
+
+ void kf_bfly2( cpx_type * Fout, const size_t fstride, int m)
+ {
+ for (int k=0;k<m;++k) {
+ cpx_type t = Fout[m+k] * _traits.twiddle(k*fstride);
+ Fout[m+k] = Fout[k] - t;
+ Fout[k] += t;
+ }
+ }
+
+ void kf_bfly4( cpx_type * Fout, const size_t fstride, const size_t m)
+ {
+ cpx_type scratch[7];
+ int negative_if_inverse = _inverse * -2 +1;
+ for (size_t k=0;k<m;++k) {
+ scratch[0] = Fout[k+m] * _traits.twiddle(k*fstride);
+ scratch[1] = Fout[k+2*m] * _traits.twiddle(k*fstride*2);
+ scratch[2] = Fout[k+3*m] * _traits.twiddle(k*fstride*3);
+ scratch[5] = Fout[k] - scratch[1];
+
+ Fout[k] += scratch[1];
+ scratch[3] = scratch[0] + scratch[2];
+ scratch[4] = scratch[0] - scratch[2];
+ scratch[4] = cpx_type( scratch[4].imag()*negative_if_inverse , -scratch[4].real()* negative_if_inverse );
+
+ Fout[k+2*m] = Fout[k] - scratch[3];
+ Fout[k] += scratch[3];
+ Fout[k+m] = scratch[5] + scratch[4];
+ Fout[k+3*m] = scratch[5] - scratch[4];
+ }
+ }
+
+ void kf_bfly3( cpx_type * Fout, const size_t fstride, const size_t m)
+ {
+ size_t k=m;
+ const size_t m2 = 2*m;
+ cpx_type *tw1,*tw2;
+ cpx_type scratch[5];
+ cpx_type epi3;
+ epi3 = _twiddles[fstride*m];
+
+ tw1=tw2=&_twiddles[0];
+
+ do{
+ C_FIXDIV(*Fout,3); C_FIXDIV(Fout[m],3); C_FIXDIV(Fout[m2],3);
+
+ C_MUL(scratch[1],Fout[m] , *tw1);
+ C_MUL(scratch[2],Fout[m2] , *tw2);
+
+ C_ADD(scratch[3],scratch[1],scratch[2]);
+ C_SUB(scratch[0],scratch[1],scratch[2]);
+ tw1 += fstride;
+ tw2 += fstride*2;
+
+ Fout[m] = cpx_type( Fout->real() - HALF_OF(scratch[3].real() ) , Fout->imag() - HALF_OF(scratch[3].imag() ) );
+
+ C_MULBYSCALAR( scratch[0] , epi3.imag() );
+
+ C_ADDTO(*Fout,scratch[3]);
+
+ Fout[m2] = cpx_type( Fout[m].real() + scratch[0].imag() , Fout[m].imag() - scratch[0].real() );
+
+ C_ADDTO( Fout[m] , cpx_type( -scratch[0].imag(),scratch[0].real() ) );
+ ++Fout;
+ }while(--k);
+ }
+
+ void kf_bfly5( cpx_type * Fout, const size_t fstride, const size_t m)
+ {
+ cpx_type *Fout0,*Fout1,*Fout2,*Fout3,*Fout4;
+ size_t u;
+ cpx_type scratch[13];
+ cpx_type * twiddles = &_twiddles[0];
+ cpx_type *tw;
+ cpx_type ya,yb;
+ ya = twiddles[fstride*m];
+ yb = twiddles[fstride*2*m];
+
+ Fout0=Fout;
+ Fout1=Fout0+m;
+ Fout2=Fout0+2*m;
+ Fout3=Fout0+3*m;
+ Fout4=Fout0+4*m;
+
+ tw=twiddles;
+ for ( u=0; u<m; ++u ) {
+ C_FIXDIV( *Fout0,5); C_FIXDIV( *Fout1,5); C_FIXDIV( *Fout2,5); C_FIXDIV( *Fout3,5); C_FIXDIV( *Fout4,5);
+ scratch[0] = *Fout0;
+
+ C_MUL(scratch[1] ,*Fout1, tw[u*fstride]);
+ C_MUL(scratch[2] ,*Fout2, tw[2*u*fstride]);
+ C_MUL(scratch[3] ,*Fout3, tw[3*u*fstride]);
+ C_MUL(scratch[4] ,*Fout4, tw[4*u*fstride]);
+
+ C_ADD( scratch[7],scratch[1],scratch[4]);
+ C_SUB( scratch[10],scratch[1],scratch[4]);
+ C_ADD( scratch[8],scratch[2],scratch[3]);
+ C_SUB( scratch[9],scratch[2],scratch[3]);
+
+ C_ADDTO( *Fout0, scratch[7]);
+ C_ADDTO( *Fout0, scratch[8]);
+
+ scratch[5] = scratch[0] + cpx_type(
+ S_MUL(scratch[7].real(),ya.real() ) + S_MUL(scratch[8].real() ,yb.real() ),
+ S_MUL(scratch[7].imag(),ya.real()) + S_MUL(scratch[8].imag(),yb.real())
+ );
+
+ scratch[6] = cpx_type(
+ S_MUL(scratch[10].imag(),ya.imag()) + S_MUL(scratch[9].imag(),yb.imag()),
+ -S_MUL(scratch[10].real(),ya.imag()) - S_MUL(scratch[9].real(),yb.imag())
+ );
+
+ C_SUB(*Fout1,scratch[5],scratch[6]);
+ C_ADD(*Fout4,scratch[5],scratch[6]);
+
+ scratch[11] = scratch[0] +
+ cpx_type(
+ S_MUL(scratch[7].real(),yb.real()) + S_MUL(scratch[8].real(),ya.real()),
+ S_MUL(scratch[7].imag(),yb.real()) + S_MUL(scratch[8].imag(),ya.real())
+ );
+
+ scratch[12] = cpx_type(
+ -S_MUL(scratch[10].imag(),yb.imag()) + S_MUL(scratch[9].imag(),ya.imag()),
+ S_MUL(scratch[10].real(),yb.imag()) - S_MUL(scratch[9].real(),ya.imag())
+ );
+
+ C_ADD(*Fout2,scratch[11],scratch[12]);
+ C_SUB(*Fout3,scratch[11],scratch[12]);
+
+ ++Fout0;++Fout1;++Fout2;++Fout3;++Fout4;
+ }
+ }
+
+ /* perform the butterfly for one stage of a mixed radix FFT */
+ void kf_bfly_generic(
+ cpx_type * Fout,
+ const size_t fstride,
+ int m,
+ int p
+ )
+ {
+ int u,k,q1,q;
+ cpx_type * twiddles = &_twiddles[0];
+ cpx_type t;
+ int Norig = _nfft;
+ cpx_type scratchbuf[p];
+
+ for ( u=0; u<m; ++u ) {
+ k=u;
+ for ( q1=0 ; q1<p ; ++q1 ) {
+ scratchbuf[q1] = Fout[ k ];
+ C_FIXDIV(scratchbuf[q1],p);
+ k += m;
+ }
+
+ k=u;
+ for ( q1=0 ; q1<p ; ++q1 ) {
+ int twidx=0;
+ Fout[ k ] = scratchbuf[0];
+ for (q=1;q<p;++q ) {
+ twidx += fstride * k;
+ if (twidx>=Norig) twidx-=Norig;
+ C_MUL(t,scratchbuf[q] , twiddles[twidx] );
+ C_ADDTO( Fout[ k ] ,t);
+ }
+ k += m;
+ }
+ }
+ }
+
+ int _nfft;
+ bool _inverse;
+ std::vector<cpx_type> _twiddles;
+ std::vector<int> _stageRadix;
+ std::vector<int> _stageRemainder;
+ traits_type _traits;
+};
+#endif
--- /dev/null
+WARNINGS=-W -Wall -Wstrict-prototypes -Wmissing-prototypes -Waggregate-return \
+ -Wcast-align -Wcast-qual -Wnested-externs -Wshadow -Wbad-function-cast \
+ -Wwrite-strings
+
+ifeq "$(DATATYPE)" ""
+ DATATYPE=float
+endif
+
+ifeq "$(DATATYPE)" "int32_t"
+ TYPEFLAGS=-DFIXED_POINT=32
+endif
+
+ifeq "$(DATATYPE)" "int16_t"
+ TYPEFLAGS=-DFIXED_POINT=16
+endif
+
+ifeq "$(DATATYPE)" "simd"
+ TYPEFLAGS=-DUSE_SIMD=1 -msse
+endif
+
+ifeq "$(TYPEFLAGS)" ""
+ TYPEFLAGS=-Dkiss_fft_scalar=$(DATATYPE)
+endif
+
+ifneq ("$(KISS_FFT_USE_ALLOCA)","")
+ CFLAGS+= -DKISS_FFT_USE_ALLOCA=1
+endif
+CFLAGS+= $(CFLAGADD)
+
+
+FFTUTIL=fft_$(DATATYPE)
+FASTFILT=fastconv_$(DATATYPE)
+FASTFILTREAL=fastconvr_$(DATATYPE)
+PSDPNG=psdpng_$(DATATYPE)
+DUMPHDR=dumphdr_$(DATATYPE)
+
+all: $(FFTUTIL) $(FASTFILT) $(FASTFILTREAL)
+# $(PSDPNG)
+# $(DUMPHDR)
+
+#CFLAGS=-Wall -O3 -pedantic -march=pentiumpro -ffast-math -fomit-frame-pointer $(WARNINGS)
+# If the above flags do not work, try the following
+CFLAGS=-Wall -O3 $(WARNINGS)
+# tip: try -openmp or -fopenmp to use multiple cores
+
+$(FASTFILTREAL): ../kiss_fft.c kiss_fastfir.c kiss_fftr.c
+ $(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -DREAL_FASTFIR -lm $+ -DFAST_FILT_UTIL
+
+$(FASTFILT): ../kiss_fft.c kiss_fastfir.c
+ $(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+ -DFAST_FILT_UTIL
+
+$(FFTUTIL): ../kiss_fft.c fftutil.c kiss_fftnd.c kiss_fftr.c kiss_fftndr.c
+ $(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+
+
+$(PSDPNG): ../kiss_fft.c psdpng.c kiss_fftr.c
+ $(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm -lpng $+
+
+$(DUMPHDR): ../kiss_fft.c dumphdr.c
+ $(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+
+
+clean:
+ rm -f *~ fft fft_* fastconv fastconv_* fastconvr fastconvr_* psdpng psdpng_*
--- /dev/null
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include <stdlib.h>
+#include <math.h>
+#include <stdio.h>
+#include <string.h>
+#include <unistd.h>
+
+#include "kiss_fft.h"
+#include "kiss_fftndr.h"
+
+static
+void fft_file(FILE * fin,FILE * fout,int nfft,int isinverse)
+{
+ kiss_fft_cfg st;
+ kiss_fft_cpx * buf;
+ kiss_fft_cpx * bufout;
+
+ buf = (kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx) * nfft );
+ bufout = (kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx) * nfft );
+ st = kiss_fft_alloc( nfft ,isinverse ,0,0);
+
+ while ( fread( buf , sizeof(kiss_fft_cpx) * nfft ,1, fin ) > 0 ) {
+ kiss_fft( st , buf ,bufout);
+ fwrite( bufout , sizeof(kiss_fft_cpx) , nfft , fout );
+ }
+ free(st);
+ free(buf);
+ free(bufout);
+}
+
+static
+void fft_filend(FILE * fin,FILE * fout,int *dims,int ndims,int isinverse)
+{
+ kiss_fftnd_cfg st;
+ kiss_fft_cpx *buf;
+ int dimprod=1,i;
+ for (i=0;i<ndims;++i)
+ dimprod *= dims[i];
+
+ buf = (kiss_fft_cpx *) malloc (sizeof (kiss_fft_cpx) * dimprod);
+ st = kiss_fftnd_alloc (dims, ndims, isinverse, 0, 0);
+
+ while (fread (buf, sizeof (kiss_fft_cpx) * dimprod, 1, fin) > 0) {
+ kiss_fftnd (st, buf, buf);
+ fwrite (buf, sizeof (kiss_fft_cpx), dimprod, fout);
+ }
+ free (st);
+ free (buf);
+}
+
+
+
+static
+void fft_filend_real(FILE * fin,FILE * fout,int *dims,int ndims,int isinverse)
+{
+ int dimprod=1,i;
+ kiss_fftndr_cfg st;
+ void *ibuf;
+ void *obuf;
+ int insize,outsize; // size in bytes
+
+ for (i=0;i<ndims;++i)
+ dimprod *= dims[i];
+ insize = outsize = dimprod;
+ int rdim = dims[ndims-1];
+
+ if (isinverse)
+ insize = insize*2*(rdim/2+1)/rdim;
+ else
+ outsize = outsize*2*(rdim/2+1)/rdim;
+
+ ibuf = malloc(insize*sizeof(kiss_fft_scalar));
+ obuf = malloc(outsize*sizeof(kiss_fft_scalar));
+
+ st = kiss_fftndr_alloc(dims, ndims, isinverse, 0, 0);
+
+ while ( fread (ibuf, sizeof(kiss_fft_scalar), insize, fin) > 0) {
+ if (isinverse) {
+ kiss_fftndri(st,
+ (kiss_fft_cpx*)ibuf,
+ (kiss_fft_scalar*)obuf);
+ }else{
+ kiss_fftndr(st,
+ (kiss_fft_scalar*)ibuf,
+ (kiss_fft_cpx*)obuf);
+ }
+ fwrite (obuf, sizeof(kiss_fft_scalar), outsize,fout);
+ }
+ free(st);
+ free(ibuf);
+ free(obuf);
+}
+
+static
+void fft_file_real(FILE * fin,FILE * fout,int nfft,int isinverse)
+{
+ kiss_fftr_cfg st;
+ kiss_fft_scalar * rbuf;
+ kiss_fft_cpx * cbuf;
+
+ rbuf = (kiss_fft_scalar*)malloc(sizeof(kiss_fft_scalar) * nfft );
+ cbuf = (kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx) * (nfft/2+1) );
+ st = kiss_fftr_alloc( nfft ,isinverse ,0,0);
+
+ if (isinverse==0) {
+ while ( fread( rbuf , sizeof(kiss_fft_scalar) * nfft ,1, fin ) > 0 ) {
+ kiss_fftr( st , rbuf ,cbuf);
+ fwrite( cbuf , sizeof(kiss_fft_cpx) , (nfft/2 + 1) , fout );
+ }
+ }else{
+ while ( fread( cbuf , sizeof(kiss_fft_cpx) * (nfft/2+1) ,1, fin ) > 0 ) {
+ kiss_fftri( st , cbuf ,rbuf);
+ fwrite( rbuf , sizeof(kiss_fft_scalar) , nfft , fout );
+ }
+ }
+ free(st);
+ free(rbuf);
+ free(cbuf);
+}
+
+static
+int get_dims(char * arg,int * dims)
+{
+ char *p0;
+ int ndims=0;
+
+ do{
+ p0 = strchr(arg,',');
+ if (p0)
+ *p0++ = '\0';
+ dims[ndims++] = atoi(arg);
+// fprintf(stderr,"dims[%d] = %d\n",ndims-1,dims[ndims-1]);
+ arg = p0;
+ }while (p0);
+ return ndims;
+}
+
+int main(int argc,char ** argv)
+{
+ int isinverse=0;
+ int isreal=0;
+ FILE *fin=stdin;
+ FILE *fout=stdout;
+ int ndims=1;
+ int dims[32];
+ dims[0] = 1024; /*default fft size*/
+
+ while (1) {
+ int c=getopt(argc,argv,"n:iR");
+ if (c==-1) break;
+ switch (c) {
+ case 'n':
+ ndims = get_dims(optarg,dims);
+ break;
+ case 'i':isinverse=1;break;
+ case 'R':isreal=1;break;
+ case '?':
+ fprintf(stderr,"usage options:\n"
+ "\t-n d1[,d2,d3...]: fft dimension(s)\n"
+ "\t-i : inverse\n"
+ "\t-R : real input samples, not complex\n");
+ exit (1);
+ default:fprintf(stderr,"bad %c\n",c);break;
+ }
+ }
+
+ if ( optind < argc ) {
+ if (strcmp("-",argv[optind]) !=0)
+ fin = fopen(argv[optind],"rb");
+ ++optind;
+ }
+
+ if ( optind < argc ) {
+ if ( strcmp("-",argv[optind]) !=0 )
+ fout = fopen(argv[optind],"wb");
+ ++optind;
+ }
+
+ if (ndims==1) {
+ if (isreal)
+ fft_file_real(fin,fout,dims[0],isinverse);
+ else
+ fft_file(fin,fout,dims[0],isinverse);
+ }else{
+ if (isreal)
+ fft_filend_real(fin,fout,dims,ndims,isinverse);
+ else
+ fft_filend(fin,fout,dims,ndims,isinverse);
+ }
+
+ if (fout!=stdout) fclose(fout);
+ if (fin!=stdin) fclose(fin);
+
+ return 0;
+}
--- /dev/null
+#include "kfc.h"
+
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+
+typedef struct cached_fft *kfc_cfg;
+
+struct cached_fft
+{
+ int nfft;
+ int inverse;
+ kiss_fft_cfg cfg;
+ kfc_cfg next;
+};
+
+static kfc_cfg cache_root=NULL;
+static int ncached=0;
+
+static kiss_fft_cfg find_cached_fft(int nfft,int inverse)
+{
+ size_t len;
+ kfc_cfg cur=cache_root;
+ kfc_cfg prev=NULL;
+ while ( cur ) {
+ if ( cur->nfft == nfft && inverse == cur->inverse )
+ break;/*found the right node*/
+ prev = cur;
+ cur = prev->next;
+ }
+ if (cur== NULL) {
+ /* no cached node found, need to create a new one*/
+ kiss_fft_alloc(nfft,inverse,0,&len);
+ cur = (kfc_cfg)KISS_FFT_MALLOC((sizeof(struct cached_fft) + len ));
+ if (cur == NULL)
+ return NULL;
+ cur->cfg = (kiss_fft_cfg)(cur+1);
+ kiss_fft_alloc(nfft,inverse,cur->cfg,&len);
+ cur->nfft=nfft;
+ cur->inverse=inverse;
+ cur->next = NULL;
+ if ( prev )
+ prev->next = cur;
+ else
+ cache_root = cur;
+ ++ncached;
+ }
+ return cur->cfg;
+}
+
+void kfc_cleanup(void)
+{
+ kfc_cfg cur=cache_root;
+ kfc_cfg next=NULL;
+ while (cur){
+ next = cur->next;
+ free(cur);
+ cur=next;
+ }
+ ncached=0;
+ cache_root = NULL;
+}
+void kfc_fft(int nfft, const kiss_fft_cpx * fin,kiss_fft_cpx * fout)
+{
+ kiss_fft( find_cached_fft(nfft,0),fin,fout );
+}
+
+void kfc_ifft(int nfft, const kiss_fft_cpx * fin,kiss_fft_cpx * fout)
+{
+ kiss_fft( find_cached_fft(nfft,1),fin,fout );
+}
+
+#ifdef KFC_TEST
+static void check(int nc)
+{
+ if (ncached != nc) {
+ fprintf(stderr,"ncached should be %d,but it is %d\n",nc,ncached);
+ exit(1);
+ }
+}
+
+int main(void)
+{
+ kiss_fft_cpx buf1[1024],buf2[1024];
+ memset(buf1,0,sizeof(buf1));
+ check(0);
+ kfc_fft(512,buf1,buf2);
+ check(1);
+ kfc_fft(512,buf1,buf2);
+ check(1);
+ kfc_ifft(512,buf1,buf2);
+ check(2);
+ kfc_cleanup();
+ check(0);
+ return 0;
+}
+#endif
--- /dev/null
+#ifndef KFC_H
+#define KFC_H
+#include "kiss_fft.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+KFC -- Kiss FFT Cache
+
+Not needing to deal with kiss_fft_alloc and a config
+object may be handy for a lot of programs.
+
+KFC uses the underlying KISS FFT functions, but caches the config object.
+The first time kfc_fft or kfc_ifft for a given FFT size, the cfg
+object is created for it. All subsequent calls use the cached
+configuration object.
+
+NOTE:
+You should probably not use this if your program will be using a lot
+of various sizes of FFTs. There is a linear search through the
+cached objects. If you are only using one or two FFT sizes, this
+will be negligible. Otherwise, you may want to use another method
+of managing the cfg objects.
+
+ There is no automated cleanup of the cached objects. This could lead
+to large memory usage in a program that uses a lot of *DIFFERENT*
+sized FFTs. If you want to force all cached cfg objects to be freed,
+call kfc_cleanup.
+
+ */
+
+/*forward complex FFT */
+void kfc_fft(int nfft, const kiss_fft_cpx * fin,kiss_fft_cpx * fout);
+/*reverse complex FFT */
+void kfc_ifft(int nfft, const kiss_fft_cpx * fin,kiss_fft_cpx * fout);
+
+/*free all cached objects*/
+void kfc_cleanup(void);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include "_kiss_fft_guts.h"
+
+
+/*
+ Some definitions that allow real or complex filtering
+*/
+#ifdef REAL_FASTFIR
+#define MIN_FFT_LEN 2048
+#include "kiss_fftr.h"
+typedef kiss_fft_scalar kffsamp_t;
+typedef kiss_fftr_cfg kfcfg_t;
+#define FFT_ALLOC kiss_fftr_alloc
+#define FFTFWD kiss_fftr
+#define FFTINV kiss_fftri
+#else
+#define MIN_FFT_LEN 1024
+typedef kiss_fft_cpx kffsamp_t;
+typedef kiss_fft_cfg kfcfg_t;
+#define FFT_ALLOC kiss_fft_alloc
+#define FFTFWD kiss_fft
+#define FFTINV kiss_fft
+#endif
+
+typedef struct kiss_fastfir_state *kiss_fastfir_cfg;
+
+
+
+kiss_fastfir_cfg kiss_fastfir_alloc(const kffsamp_t * imp_resp,size_t n_imp_resp,
+ size_t * nfft,void * mem,size_t*lenmem);
+
+/* see do_file_filter for usage */
+size_t kiss_fastfir( kiss_fastfir_cfg cfg, kffsamp_t * inbuf, kffsamp_t * outbuf, size_t n, size_t *offset);
+
+
+
+static int verbose=0;
+
+
+struct kiss_fastfir_state{
+ size_t nfft;
+ size_t ngood;
+ kfcfg_t fftcfg;
+ kfcfg_t ifftcfg;
+ kiss_fft_cpx * fir_freq_resp;
+ kiss_fft_cpx * freqbuf;
+ size_t n_freq_bins;
+ kffsamp_t * tmpbuf;
+};
+
+
+kiss_fastfir_cfg kiss_fastfir_alloc(
+ const kffsamp_t * imp_resp,size_t n_imp_resp,
+ size_t *pnfft, /* if <= 0, an appropriate size will be chosen */
+ void * mem,size_t*lenmem)
+{
+ kiss_fastfir_cfg st = NULL;
+ size_t len_fftcfg,len_ifftcfg;
+ size_t memneeded = sizeof(struct kiss_fastfir_state);
+ char * ptr;
+ size_t i;
+ size_t nfft=0;
+ float scale;
+ int n_freq_bins;
+ if (pnfft)
+ nfft=*pnfft;
+
+ if (nfft<=0) {
+ /* determine fft size as next power of two at least 2x
+ the impulse response length*/
+ i=n_imp_resp-1;
+ nfft=2;
+ do{
+ nfft<<=1;
+ }while (i>>=1);
+#ifdef MIN_FFT_LEN
+ if ( nfft < MIN_FFT_LEN )
+ nfft=MIN_FFT_LEN;
+#endif
+ }
+ if (pnfft)
+ *pnfft = nfft;
+
+#ifdef REAL_FASTFIR
+ n_freq_bins = nfft/2 + 1;
+#else
+ n_freq_bins = nfft;
+#endif
+ /*fftcfg*/
+ FFT_ALLOC (nfft, 0, NULL, &len_fftcfg);
+ memneeded += len_fftcfg;
+ /*ifftcfg*/
+ FFT_ALLOC (nfft, 1, NULL, &len_ifftcfg);
+ memneeded += len_ifftcfg;
+ /* tmpbuf */
+ memneeded += sizeof(kffsamp_t) * nfft;
+ /* fir_freq_resp */
+ memneeded += sizeof(kiss_fft_cpx) * n_freq_bins;
+ /* freqbuf */
+ memneeded += sizeof(kiss_fft_cpx) * n_freq_bins;
+
+ if (lenmem == NULL) {
+ st = (kiss_fastfir_cfg) malloc (memneeded);
+ } else {
+ if (*lenmem >= memneeded)
+ st = (kiss_fastfir_cfg) mem;
+ *lenmem = memneeded;
+ }
+ if (!st)
+ return NULL;
+
+ st->nfft = nfft;
+ st->ngood = nfft - n_imp_resp + 1;
+ st->n_freq_bins = n_freq_bins;
+ ptr=(char*)(st+1);
+
+ st->fftcfg = (kfcfg_t)ptr;
+ ptr += len_fftcfg;
+
+ st->ifftcfg = (kfcfg_t)ptr;
+ ptr += len_ifftcfg;
+
+ st->tmpbuf = (kffsamp_t*)ptr;
+ ptr += sizeof(kffsamp_t) * nfft;
+
+ st->freqbuf = (kiss_fft_cpx*)ptr;
+ ptr += sizeof(kiss_fft_cpx) * n_freq_bins;
+
+ st->fir_freq_resp = (kiss_fft_cpx*)ptr;
+ ptr += sizeof(kiss_fft_cpx) * n_freq_bins;
+
+ FFT_ALLOC (nfft,0,st->fftcfg , &len_fftcfg);
+ FFT_ALLOC (nfft,1,st->ifftcfg , &len_ifftcfg);
+
+ memset(st->tmpbuf,0,sizeof(kffsamp_t)*nfft);
+ /*zero pad in the middle to left-rotate the impulse response
+ This puts the scrap samples at the end of the inverse fft'd buffer */
+ st->tmpbuf[0] = imp_resp[ n_imp_resp - 1 ];
+ for (i=0;i<n_imp_resp - 1; ++i) {
+ st->tmpbuf[ nfft - n_imp_resp + 1 + i ] = imp_resp[ i ];
+ }
+
+ FFTFWD(st->fftcfg,st->tmpbuf,st->fir_freq_resp);
+
+ /* TODO: this won't work for fixed point */
+ scale = 1.0 / st->nfft;
+
+ for ( i=0; i < st->n_freq_bins; ++i ) {
+#ifdef USE_SIMD
+ st->fir_freq_resp[i].r *= _mm_set1_ps(scale);
+ st->fir_freq_resp[i].i *= _mm_set1_ps(scale);
+#else
+ st->fir_freq_resp[i].r *= scale;
+ st->fir_freq_resp[i].i *= scale;
+#endif
+ }
+ return st;
+}
+
+static void fastconv1buf(const kiss_fastfir_cfg st,const kffsamp_t * in,kffsamp_t * out)
+{
+ size_t i;
+ /* multiply the frequency response of the input signal by
+ that of the fir filter*/
+ FFTFWD( st->fftcfg, in , st->freqbuf );
+ for ( i=0; i<st->n_freq_bins; ++i ) {
+ kiss_fft_cpx tmpsamp;
+ C_MUL(tmpsamp,st->freqbuf[i],st->fir_freq_resp[i]);
+ st->freqbuf[i] = tmpsamp;
+ }
+
+ /* perform the inverse fft*/
+ FFTINV(st->ifftcfg,st->freqbuf,out);
+}
+
+/* n : the size of inbuf and outbuf in samples
+ return value: the number of samples completely processed
+ n-retval samples should be copied to the front of the next input buffer */
+static size_t kff_nocopy(
+ kiss_fastfir_cfg st,
+ const kffsamp_t * inbuf,
+ kffsamp_t * outbuf,
+ size_t n)
+{
+ size_t norig=n;
+ while (n >= st->nfft ) {
+ fastconv1buf(st,inbuf,outbuf);
+ inbuf += st->ngood;
+ outbuf += st->ngood;
+ n -= st->ngood;
+ }
+ return norig - n;
+}
+
+static
+size_t kff_flush(kiss_fastfir_cfg st,const kffsamp_t * inbuf,kffsamp_t * outbuf,size_t n)
+{
+ size_t zpad=0,ntmp;
+
+ ntmp = kff_nocopy(st,inbuf,outbuf,n);
+ n -= ntmp;
+ inbuf += ntmp;
+ outbuf += ntmp;
+
+ zpad = st->nfft - n;
+ memset(st->tmpbuf,0,sizeof(kffsamp_t)*st->nfft );
+ memcpy(st->tmpbuf,inbuf,sizeof(kffsamp_t)*n );
+
+ fastconv1buf(st,st->tmpbuf,st->tmpbuf);
+
+ memcpy(outbuf,st->tmpbuf,sizeof(kffsamp_t)*( st->ngood - zpad ));
+ return ntmp + st->ngood - zpad;
+}
+
+size_t kiss_fastfir(
+ kiss_fastfir_cfg vst,
+ kffsamp_t * inbuf,
+ kffsamp_t * outbuf,
+ size_t n_new,
+ size_t *offset)
+{
+ size_t ntot = n_new + *offset;
+ if (n_new==0) {
+ return kff_flush(vst,inbuf,outbuf,ntot);
+ }else{
+ size_t nwritten = kff_nocopy(vst,inbuf,outbuf,ntot);
+ *offset = ntot - nwritten;
+ /*save the unused or underused samples at the front of the input buffer */
+ memcpy( inbuf , inbuf+nwritten , *offset * sizeof(kffsamp_t) );
+ return nwritten;
+ }
+}
+
+#ifdef FAST_FILT_UTIL
+#include <unistd.h>
+#include <sys/types.h>
+#include <sys/mman.h>
+#include <assert.h>
+
+static
+void direct_file_filter(
+ FILE * fin,
+ FILE * fout,
+ const kffsamp_t * imp_resp,
+ size_t n_imp_resp)
+{
+ size_t nlag = n_imp_resp - 1;
+
+ const kffsamp_t *tmph;
+ kffsamp_t *buf, *circbuf;
+ kffsamp_t outval;
+ size_t nread;
+ size_t nbuf;
+ size_t oldestlag = 0;
+ size_t k, tap;
+#ifndef REAL_FASTFIR
+ kffsamp_t tmp;
+#endif
+
+ nbuf = 4096;
+ buf = (kffsamp_t *) malloc ( sizeof (kffsamp_t) * nbuf);
+ circbuf = (kffsamp_t *) malloc (sizeof (kffsamp_t) * nlag);
+ if (!circbuf || !buf) {
+ perror("circbuf allocation");
+ exit(1);
+ }
+
+ if ( fread (circbuf, sizeof (kffsamp_t), nlag, fin) != nlag ) {
+ perror ("insufficient data to overcome transient");
+ exit (1);
+ }
+
+ do {
+ nread = fread (buf, sizeof (kffsamp_t), nbuf, fin);
+ if (nread <= 0)
+ break;
+
+ for (k = 0; k < nread; ++k) {
+ tmph = imp_resp+nlag;
+#ifdef REAL_FASTFIR
+# ifdef USE_SIMD
+ outval = _mm_set1_ps(0);
+#else
+ outval = 0;
+#endif
+ for (tap = oldestlag; tap < nlag; ++tap)
+ outval += circbuf[tap] * *tmph--;
+ for (tap = 0; tap < oldestlag; ++tap)
+ outval += circbuf[tap] * *tmph--;
+ outval += buf[k] * *tmph;
+#else
+# ifdef USE_SIMD
+ outval.r = outval.i = _mm_set1_ps(0);
+#else
+ outval.r = outval.i = 0;
+#endif
+ for (tap = oldestlag; tap < nlag; ++tap){
+ C_MUL(tmp,circbuf[tap],*tmph);
+ --tmph;
+ C_ADDTO(outval,tmp);
+ }
+
+ for (tap = 0; tap < oldestlag; ++tap) {
+ C_MUL(tmp,circbuf[tap],*tmph);
+ --tmph;
+ C_ADDTO(outval,tmp);
+ }
+ C_MUL(tmp,buf[k],*tmph);
+ C_ADDTO(outval,tmp);
+#endif
+
+ circbuf[oldestlag++] = buf[k];
+ buf[k] = outval;
+
+ if (oldestlag == nlag)
+ oldestlag = 0;
+ }
+
+ if (fwrite (buf, sizeof (buf[0]), nread, fout) != nread) {
+ perror ("short write");
+ exit (1);
+ }
+ } while (nread);
+ free (buf);
+ free (circbuf);
+}
+
+static
+void do_file_filter(
+ FILE * fin,
+ FILE * fout,
+ const kffsamp_t * imp_resp,
+ size_t n_imp_resp,
+ size_t nfft )
+{
+ int fdout;
+ size_t n_samps_buf;
+
+ kiss_fastfir_cfg cfg;
+ kffsamp_t *inbuf,*outbuf;
+ int nread,nwrite;
+ size_t idx_inbuf;
+
+ fdout = fileno(fout);
+
+ cfg=kiss_fastfir_alloc(imp_resp,n_imp_resp,&nfft,0,0);
+
+ /* use length to minimize buffer shift*/
+ n_samps_buf = 8*4096/sizeof(kffsamp_t);
+ n_samps_buf = nfft + 4*(nfft-n_imp_resp+1);
+
+ if (verbose) fprintf(stderr,"bufsize=%d\n",sizeof(kffsamp_t)*n_samps_buf );
+
+
+ /*allocate space and initialize pointers */
+ inbuf = (kffsamp_t*)malloc(sizeof(kffsamp_t)*n_samps_buf);
+ outbuf = (kffsamp_t*)malloc(sizeof(kffsamp_t)*n_samps_buf);
+
+ idx_inbuf=0;
+ do{
+ /* start reading at inbuf[idx_inbuf] */
+ nread = fread( inbuf + idx_inbuf, sizeof(kffsamp_t), n_samps_buf - idx_inbuf,fin );
+
+ /* If nread==0, then this is a flush.
+ The total number of samples in input is idx_inbuf + nread . */
+ nwrite = kiss_fastfir(cfg, inbuf, outbuf,nread,&idx_inbuf) * sizeof(kffsamp_t);
+ /* kiss_fastfir moved any unused samples to the front of inbuf and updated idx_inbuf */
+
+ if ( write(fdout, outbuf, nwrite) != nwrite ) {
+ perror("short write");
+ exit(1);
+ }
+ }while ( nread );
+ free(cfg);
+ free(inbuf);
+ free(outbuf);
+}
+
+int main(int argc,char**argv)
+{
+ kffsamp_t * h;
+ int use_direct=0;
+ size_t nh,nfft=0;
+ FILE *fin=stdin;
+ FILE *fout=stdout;
+ FILE *filtfile=NULL;
+ while (1) {
+ int c=getopt(argc,argv,"n:h:i:o:vd");
+ if (c==-1) break;
+ switch (c) {
+ case 'v':
+ verbose=1;
+ break;
+ case 'n':
+ nfft=atoi(optarg);
+ break;
+ case 'i':
+ fin = fopen(optarg,"rb");
+ if (fin==NULL) {
+ perror(optarg);
+ exit(1);
+ }
+ break;
+ case 'o':
+ fout = fopen(optarg,"w+b");
+ if (fout==NULL) {
+ perror(optarg);
+ exit(1);
+ }
+ break;
+ case 'h':
+ filtfile = fopen(optarg,"rb");
+ if (filtfile==NULL) {
+ perror(optarg);
+ exit(1);
+ }
+ break;
+ case 'd':
+ use_direct=1;
+ break;
+ case '?':
+ fprintf(stderr,"usage options:\n"
+ "\t-n nfft: fft size to use\n"
+ "\t-d : use direct FIR filtering, not fast convolution\n"
+ "\t-i filename: input file\n"
+ "\t-o filename: output(filtered) file\n"
+ "\t-n nfft: fft size to use\n"
+ "\t-h filename: impulse response\n");
+ exit (1);
+ default:fprintf(stderr,"bad %c\n",c);break;
+ }
+ }
+ if (filtfile==NULL) {
+ fprintf(stderr,"You must supply the FIR coeffs via -h\n");
+ exit(1);
+ }
+ fseek(filtfile,0,SEEK_END);
+ nh = ftell(filtfile) / sizeof(kffsamp_t);
+ if (verbose) fprintf(stderr,"%d samples in FIR filter\n",nh);
+ h = (kffsamp_t*)malloc(sizeof(kffsamp_t)*nh);
+ fseek(filtfile,0,SEEK_SET);
+ fread(h,sizeof(kffsamp_t),nh,filtfile);
+ fclose(filtfile);
+
+ if (use_direct)
+ direct_file_filter( fin, fout, h,nh);
+ else
+ do_file_filter( fin, fout, h,nh,nfft);
+
+ if (fout!=stdout) fclose(fout);
+ if (fin!=stdin) fclose(fin);
+
+ return 0;
+}
+#endif
--- /dev/null
+
+
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include "kiss_fftnd.h"
+#include "_kiss_fft_guts.h"
+
+struct kiss_fftnd_state{
+ int dimprod; /* dimsum would be mighty tasty right now */
+ int ndims;
+ int *dims;
+ kiss_fft_cfg *states; /* cfg states for each dimension */
+ kiss_fft_cpx * tmpbuf; /*buffer capable of hold the entire input */
+};
+
+kiss_fftnd_cfg kiss_fftnd_alloc(const int *dims,int ndims,int inverse_fft,void*mem,size_t*lenmem)
+{
+ kiss_fftnd_cfg st = NULL;
+ int i;
+ int dimprod=1;
+ size_t memneeded = sizeof(struct kiss_fftnd_state);
+ char * ptr;
+
+ for (i=0;i<ndims;++i) {
+ size_t sublen=0;
+ kiss_fft_alloc (dims[i], inverse_fft, NULL, &sublen);
+ memneeded += sublen; /* st->states[i] */
+ dimprod *= dims[i];
+ }
+ memneeded += sizeof(int) * ndims;/* st->dims */
+ memneeded += sizeof(void*) * ndims;/* st->states */
+ memneeded += sizeof(kiss_fft_cpx) * dimprod; /* st->tmpbuf */
+
+ if (lenmem == NULL) {/* allocate for the caller*/
+ st = (kiss_fftnd_cfg) malloc (memneeded);
+ } else { /* initialize supplied buffer if big enough */
+ if (*lenmem >= memneeded)
+ st = (kiss_fftnd_cfg) mem;
+ *lenmem = memneeded; /*tell caller how big struct is (or would be) */
+ }
+ if (!st)
+ return NULL; /*malloc failed or buffer too small */
+
+ st->dimprod = dimprod;
+ st->ndims = ndims;
+ ptr=(char*)(st+1);
+
+ st->states = (kiss_fft_cfg *)ptr;
+ ptr += sizeof(void*) * ndims;
+
+ st->dims = (int*)ptr;
+ ptr += sizeof(int) * ndims;
+
+ st->tmpbuf = (kiss_fft_cpx*)ptr;
+ ptr += sizeof(kiss_fft_cpx) * dimprod;
+
+ for (i=0;i<ndims;++i) {
+ size_t len;
+ st->dims[i] = dims[i];
+ kiss_fft_alloc (st->dims[i], inverse_fft, NULL, &len);
+ st->states[i] = kiss_fft_alloc (st->dims[i], inverse_fft, ptr,&len);
+ ptr += len;
+ }
+ /*
+Hi there!
+
+If you're looking at this particular code, it probably means you've got a brain-dead bounds checker
+that thinks the above code overwrites the end of the array.
+
+It doesn't.
+
+-- Mark
+
+P.S.
+The below code might give you some warm fuzzies and help convince you.
+ */
+ if ( ptr - (char*)st != (int)memneeded ) {
+ fprintf(stderr,
+ "################################################################################\n"
+ "Internal error! Memory allocation miscalculation\n"
+ "################################################################################\n"
+ );
+ }
+ return st;
+}
+
+/*
+ This works by tackling one dimension at a time.
+
+ In effect,
+ Each stage starts out by reshaping the matrix into a DixSi 2d matrix.
+ A Di-sized fft is taken of each column, transposing the matrix as it goes.
+
+Here's a 3-d example:
+Take a 2x3x4 matrix, laid out in memory as a contiguous buffer
+ [ [ [ a b c d ] [ e f g h ] [ i j k l ] ]
+ [ [ m n o p ] [ q r s t ] [ u v w x ] ] ]
+
+Stage 0 ( D=2): treat the buffer as a 2x12 matrix
+ [ [a b ... k l]
+ [m n ... w x] ]
+
+ FFT each column with size 2.
+ Transpose the matrix at the same time using kiss_fft_stride.
+
+ [ [ a+m a-m ]
+ [ b+n b-n]
+ ...
+ [ k+w k-w ]
+ [ l+x l-x ] ]
+
+ Note fft([x y]) == [x+y x-y]
+
+Stage 1 ( D=3) treats the buffer (the output of stage D=2) as an 3x8 matrix,
+ [ [ a+m a-m b+n b-n c+o c-o d+p d-p ]
+ [ e+q e-q f+r f-r g+s g-s h+t h-t ]
+ [ i+u i-u j+v j-v k+w k-w l+x l-x ] ]
+
+ And perform FFTs (size=3) on each of the columns as above, transposing
+ the matrix as it goes. The output of stage 1 is
+ (Legend: ap = [ a+m e+q i+u ]
+ am = [ a-m e-q i-u ] )
+
+ [ [ sum(ap) fft(ap)[0] fft(ap)[1] ]
+ [ sum(am) fft(am)[0] fft(am)[1] ]
+ [ sum(bp) fft(bp)[0] fft(bp)[1] ]
+ [ sum(bm) fft(bm)[0] fft(bm)[1] ]
+ [ sum(cp) fft(cp)[0] fft(cp)[1] ]
+ [ sum(cm) fft(cm)[0] fft(cm)[1] ]
+ [ sum(dp) fft(dp)[0] fft(dp)[1] ]
+ [ sum(dm) fft(dm)[0] fft(dm)[1] ] ]
+
+Stage 2 ( D=4) treats this buffer as a 4*6 matrix,
+ [ [ sum(ap) fft(ap)[0] fft(ap)[1] sum(am) fft(am)[0] fft(am)[1] ]
+ [ sum(bp) fft(bp)[0] fft(bp)[1] sum(bm) fft(bm)[0] fft(bm)[1] ]
+ [ sum(cp) fft(cp)[0] fft(cp)[1] sum(cm) fft(cm)[0] fft(cm)[1] ]
+ [ sum(dp) fft(dp)[0] fft(dp)[1] sum(dm) fft(dm)[0] fft(dm)[1] ] ]
+
+ Then FFTs each column, transposing as it goes.
+
+ The resulting matrix is the 3d FFT of the 2x3x4 input matrix.
+
+ Note as a sanity check that the first element of the final
+ stage's output (DC term) is
+ sum( [ sum(ap) sum(bp) sum(cp) sum(dp) ] )
+ , i.e. the summation of all 24 input elements.
+
+*/
+void kiss_fftnd(kiss_fftnd_cfg st,const kiss_fft_cpx *fin,kiss_fft_cpx *fout)
+{
+ int i,k;
+ const kiss_fft_cpx * bufin=fin;
+ kiss_fft_cpx * bufout;
+
+ /*arrange it so the last bufout == fout*/
+ if ( st->ndims & 1 ) {
+ bufout = fout;
+ if (fin==fout) {
+ memcpy( st->tmpbuf, fin, sizeof(kiss_fft_cpx) * st->dimprod );
+ bufin = st->tmpbuf;
+ }
+ }else
+ bufout = st->tmpbuf;
+
+ for ( k=0; k < st->ndims; ++k) {
+ int curdim = st->dims[k];
+ int stride = st->dimprod / curdim;
+
+ for ( i=0 ; i<stride ; ++i )
+ kiss_fft_stride( st->states[k], bufin+i , bufout+i*curdim, stride );
+
+ /*toggle back and forth between the two buffers*/
+ if (bufout == st->tmpbuf){
+ bufout = fout;
+ bufin = st->tmpbuf;
+ }else{
+ bufout = st->tmpbuf;
+ bufin = fout;
+ }
+ }
+}
--- /dev/null
+#ifndef KISS_FFTND_H
+#define KISS_FFTND_H
+
+#include "kiss_fft.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef struct kiss_fftnd_state * kiss_fftnd_cfg;
+
+kiss_fftnd_cfg kiss_fftnd_alloc(const int *dims,int ndims,int inverse_fft,void*mem,size_t*lenmem);
+void kiss_fftnd(kiss_fftnd_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout);
+
+#ifdef __cplusplus
+}
+#endif
+#endif
--- /dev/null
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include "kiss_fftndr.h"
+#include "_kiss_fft_guts.h"
+#define MAX(x,y) ( ( (x)<(y) )?(y):(x) )
+
+struct kiss_fftndr_state
+{
+ int dimReal;
+ int dimOther;
+ kiss_fftr_cfg cfg_r;
+ kiss_fftnd_cfg cfg_nd;
+ void * tmpbuf;
+};
+
+static int prod(const int *dims, int ndims)
+{
+ int x=1;
+ while (ndims--)
+ x *= *dims++;
+ return x;
+}
+
+kiss_fftndr_cfg kiss_fftndr_alloc(const int *dims,int ndims,int inverse_fft,void*mem,size_t*lenmem)
+{
+ kiss_fftndr_cfg st = NULL;
+ size_t nr=0 , nd=0,ntmp=0;
+ int dimReal = dims[ndims-1];
+ int dimOther = prod(dims,ndims-1);
+ size_t memneeded;
+
+ (void)kiss_fftr_alloc(dimReal,inverse_fft,NULL,&nr);
+ (void)kiss_fftnd_alloc(dims,ndims-1,inverse_fft,NULL,&nd);
+ ntmp =
+ MAX( 2*dimOther , dimReal+2) * sizeof(kiss_fft_scalar) // freq buffer for one pass
+ + dimOther*(dimReal+2) * sizeof(kiss_fft_scalar); // large enough to hold entire input in case of in-place
+
+ memneeded = sizeof( struct kiss_fftndr_state ) + nr + nd + ntmp;
+
+ if (lenmem==NULL) {
+ st = (kiss_fftndr_cfg) malloc(memneeded);
+ }else{
+ if (*lenmem >= memneeded)
+ st = (kiss_fftndr_cfg)mem;
+ *lenmem = memneeded;
+ }
+ if (st==NULL)
+ return NULL;
+ memset( st , 0 , memneeded);
+
+ st->dimReal = dimReal;
+ st->dimOther = dimOther;
+ st->cfg_r = kiss_fftr_alloc( dimReal,inverse_fft,st+1,&nr);
+ st->cfg_nd = kiss_fftnd_alloc(dims,ndims-1,inverse_fft, ((char*) st->cfg_r)+nr,&nd);
+ st->tmpbuf = (char*)st->cfg_nd + nd;
+
+ return st;
+}
+
+void kiss_fftndr(kiss_fftndr_cfg st,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata)
+{
+ int k1,k2;
+ int dimReal = st->dimReal;
+ int dimOther = st->dimOther;
+ int nrbins = dimReal/2+1;
+
+ kiss_fft_cpx * tmp1 = (kiss_fft_cpx*)st->tmpbuf;
+ kiss_fft_cpx * tmp2 = tmp1 + MAX(nrbins,dimOther);
+
+ // timedata is N0 x N1 x ... x Nk real
+
+ // take a real chunk of data, fft it and place the output at correct intervals
+ for (k1=0;k1<dimOther;++k1) {
+ kiss_fftr( st->cfg_r, timedata + k1*dimReal , tmp1 ); // tmp1 now holds nrbins complex points
+ for (k2=0;k2<nrbins;++k2)
+ tmp2[ k2*dimOther+k1 ] = tmp1[k2];
+ }
+
+ for (k2=0;k2<nrbins;++k2) {
+ kiss_fftnd(st->cfg_nd, tmp2+k2*dimOther, tmp1); // tmp1 now holds dimOther complex points
+ for (k1=0;k1<dimOther;++k1)
+ freqdata[ k1*(nrbins) + k2] = tmp1[k1];
+ }
+}
+
+void kiss_fftndri(kiss_fftndr_cfg st,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata)
+{
+ int k1,k2;
+ int dimReal = st->dimReal;
+ int dimOther = st->dimOther;
+ int nrbins = dimReal/2+1;
+ kiss_fft_cpx * tmp1 = (kiss_fft_cpx*)st->tmpbuf;
+ kiss_fft_cpx * tmp2 = tmp1 + MAX(nrbins,dimOther);
+
+ for (k2=0;k2<nrbins;++k2) {
+ for (k1=0;k1<dimOther;++k1)
+ tmp1[k1] = freqdata[ k1*(nrbins) + k2 ];
+ kiss_fftnd(st->cfg_nd, tmp1, tmp2+k2*dimOther);
+ }
+
+ for (k1=0;k1<dimOther;++k1) {
+ for (k2=0;k2<nrbins;++k2)
+ tmp1[k2] = tmp2[ k2*dimOther+k1 ];
+ kiss_fftri( st->cfg_r,tmp1,timedata + k1*dimReal);
+ }
+}
--- /dev/null
+#ifndef KISS_NDR_H
+#define KISS_NDR_H
+
+#include "kiss_fft.h"
+#include "kiss_fftr.h"
+#include "kiss_fftnd.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef struct kiss_fftndr_state *kiss_fftndr_cfg;
+
+
+kiss_fftndr_cfg kiss_fftndr_alloc(const int *dims,int ndims,int inverse_fft,void*mem,size_t*lenmem);
+/*
+ dims[0] must be even
+
+ If you don't care to allocate space, use mem = lenmem = NULL
+*/
+
+
+void kiss_fftndr(
+ kiss_fftndr_cfg cfg,
+ const kiss_fft_scalar *timedata,
+ kiss_fft_cpx *freqdata);
+/*
+ input timedata has dims[0] X dims[1] X ... X dims[ndims-1] scalar points
+ output freqdata has dims[0] X dims[1] X ... X dims[ndims-1]/2+1 complex points
+*/
+
+void kiss_fftndri(
+ kiss_fftndr_cfg cfg,
+ const kiss_fft_cpx *freqdata,
+ kiss_fft_scalar *timedata);
+/*
+ input and output dimensions are the exact opposite of kiss_fftndr
+*/
+
+
+#define kiss_fftr_free free
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include "kiss_fftr.h"
+#include "_kiss_fft_guts.h"
+
+struct kiss_fftr_state{
+ kiss_fft_cfg substate;
+ kiss_fft_cpx * tmpbuf;
+ kiss_fft_cpx * super_twiddles;
+#ifdef USE_SIMD
+ void * pad;
+#endif
+};
+
+kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem)
+{
+ int i;
+ kiss_fftr_cfg st = NULL;
+ size_t subsize, memneeded;
+
+ if (nfft & 1) {
+ fprintf(stderr,"Real FFT optimization must be even.\n");
+ return NULL;
+ }
+ nfft >>= 1;
+
+ kiss_fft_alloc (nfft, inverse_fft, NULL, &subsize);
+ memneeded = sizeof(struct kiss_fftr_state) + subsize + sizeof(kiss_fft_cpx) * ( nfft * 3 / 2);
+
+ if (lenmem == NULL) {
+ st = (kiss_fftr_cfg) KISS_FFT_MALLOC (memneeded);
+ } else {
+ if (*lenmem >= memneeded)
+ st = (kiss_fftr_cfg) mem;
+ *lenmem = memneeded;
+ }
+ if (!st)
+ return NULL;
+
+ st->substate = (kiss_fft_cfg) (st + 1); /*just beyond kiss_fftr_state struct */
+ st->tmpbuf = (kiss_fft_cpx *) (((char *) st->substate) + subsize);
+ st->super_twiddles = st->tmpbuf + nfft;
+ kiss_fft_alloc(nfft, inverse_fft, st->substate, &subsize);
+
+ for (i = 0; i < nfft/2; ++i) {
+ double phase =
+ -3.14159265358979323846264338327 * ((double) (i+1) / nfft + .5);
+ if (inverse_fft)
+ phase *= -1;
+ kf_cexp (st->super_twiddles+i,phase);
+ }
+ return st;
+}
+
+void kiss_fftr(kiss_fftr_cfg st,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata)
+{
+ /* input buffer timedata is stored row-wise */
+ int k,ncfft;
+ kiss_fft_cpx fpnk,fpk,f1k,f2k,tw,tdc;
+
+ if ( st->substate->inverse) {
+ fprintf(stderr,"kiss fft usage error: improper alloc\n");
+ exit(1);
+ }
+
+ ncfft = st->substate->nfft;
+
+ /*perform the parallel fft of two real signals packed in real,imag*/
+ kiss_fft( st->substate , (const kiss_fft_cpx*)timedata, st->tmpbuf );
+ /* The real part of the DC element of the frequency spectrum in st->tmpbuf
+ * contains the sum of the even-numbered elements of the input time sequence
+ * The imag part is the sum of the odd-numbered elements
+ *
+ * The sum of tdc.r and tdc.i is the sum of the input time sequence.
+ * yielding DC of input time sequence
+ * The difference of tdc.r - tdc.i is the sum of the input (dot product) [1,-1,1,-1...
+ * yielding Nyquist bin of input time sequence
+ */
+
+ tdc.r = st->tmpbuf[0].r;
+ tdc.i = st->tmpbuf[0].i;
+ C_FIXDIV(tdc,2);
+ CHECK_OVERFLOW_OP(tdc.r ,+, tdc.i);
+ CHECK_OVERFLOW_OP(tdc.r ,-, tdc.i);
+ freqdata[0].r = tdc.r + tdc.i;
+ freqdata[ncfft].r = tdc.r - tdc.i;
+#ifdef USE_SIMD
+ freqdata[ncfft].i = freqdata[0].i = _mm_set1_ps(0);
+#else
+ freqdata[ncfft].i = freqdata[0].i = 0;
+#endif
+
+ for ( k=1;k <= ncfft/2 ; ++k ) {
+ fpk = st->tmpbuf[k];
+ fpnk.r = st->tmpbuf[ncfft-k].r;
+ fpnk.i = - st->tmpbuf[ncfft-k].i;
+ C_FIXDIV(fpk,2);
+ C_FIXDIV(fpnk,2);
+
+ C_ADD( f1k, fpk , fpnk );
+ C_SUB( f2k, fpk , fpnk );
+ C_MUL( tw , f2k , st->super_twiddles[k-1]);
+
+ freqdata[k].r = HALF_OF(f1k.r + tw.r);
+ freqdata[k].i = HALF_OF(f1k.i + tw.i);
+ freqdata[ncfft-k].r = HALF_OF(f1k.r - tw.r);
+ freqdata[ncfft-k].i = HALF_OF(tw.i - f1k.i);
+ }
+}
+
+void kiss_fftri(kiss_fftr_cfg st,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata)
+{
+ /* input buffer timedata is stored row-wise */
+ int k, ncfft;
+
+ if (st->substate->inverse == 0) {
+ fprintf (stderr, "kiss fft usage error: improper alloc\n");
+ exit (1);
+ }
+
+ ncfft = st->substate->nfft;
+
+ st->tmpbuf[0].r = freqdata[0].r + freqdata[ncfft].r;
+ st->tmpbuf[0].i = freqdata[0].r - freqdata[ncfft].r;
+ C_FIXDIV(st->tmpbuf[0],2);
+
+ for (k = 1; k <= ncfft / 2; ++k) {
+ kiss_fft_cpx fk, fnkc, fek, fok, tmp;
+ fk = freqdata[k];
+ fnkc.r = freqdata[ncfft - k].r;
+ fnkc.i = -freqdata[ncfft - k].i;
+ C_FIXDIV( fk , 2 );
+ C_FIXDIV( fnkc , 2 );
+
+ C_ADD (fek, fk, fnkc);
+ C_SUB (tmp, fk, fnkc);
+ C_MUL (fok, tmp, st->super_twiddles[k-1]);
+ C_ADD (st->tmpbuf[k], fek, fok);
+ C_SUB (st->tmpbuf[ncfft - k], fek, fok);
+#ifdef USE_SIMD
+ st->tmpbuf[ncfft - k].i *= _mm_set1_ps(-1.0);
+#else
+ st->tmpbuf[ncfft - k].i *= -1;
+#endif
+ }
+ kiss_fft (st->substate, st->tmpbuf, (kiss_fft_cpx *) timedata);
+}
--- /dev/null
+#ifndef KISS_FTR_H
+#define KISS_FTR_H
+
+#include "kiss_fft.h"
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+/*
+
+ Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
+
+
+
+ */
+
+typedef struct kiss_fftr_state *kiss_fftr_cfg;
+
+
+kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
+/*
+ nfft must be even
+
+ If you don't care to allocate space, use mem = lenmem = NULL
+*/
+
+
+void kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
+/*
+ input timedata has nfft scalar points
+ output freqdata has nfft/2+1 complex points
+*/
+
+void kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
+/*
+ input freqdata has nfft/2+1 complex points
+ output timedata has nfft scalar points
+*/
+
+#define kiss_fftr_free free
+
+#ifdef __cplusplus
+}
+#endif
+#endif
--- /dev/null
+/*
+Copyright (c) 2003-2004, Mark Borgerding
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include <stdlib.h>
+#include <math.h>
+#include <stdio.h>
+#include <string.h>
+#include <unistd.h>
+#include <png.h>
+
+#include "kiss_fft.h"
+#include "kiss_fftr.h"
+
+int nfft=1024;
+FILE * fin=NULL;
+FILE * fout=NULL;
+
+int navg=20;
+int remove_dc=0;
+int nrows=0;
+float * vals=NULL;
+int stereo=0;
+
+static
+void config(int argc,char** argv)
+{
+ while (1) {
+ int c = getopt (argc, argv, "n:r:as");
+ if (c == -1)
+ break;
+ switch (c) {
+ case 'n': nfft=(int)atoi(optarg);break;
+ case 'r': navg=(int)atoi(optarg);break;
+ case 'a': remove_dc=1;break;
+ case 's': stereo=1;break;
+ case '?':
+ fprintf (stderr, "usage options:\n"
+ "\t-n d: fft dimension(s) [1024]\n"
+ "\t-r d: number of rows to average [20]\n"
+ "\t-a : remove average from each fft buffer\n"
+ "\t-s : input is stereo, channels will be combined before fft\n"
+ "16 bit machine format real input is assumed\n"
+ );
+ default:
+ fprintf (stderr, "bad %c\n", c);
+ exit (1);
+ break;
+ }
+ }
+ if ( optind < argc ) {
+ if (strcmp("-",argv[optind]) !=0)
+ fin = fopen(argv[optind],"rb");
+ ++optind;
+ }
+
+ if ( optind < argc ) {
+ if ( strcmp("-",argv[optind]) !=0 )
+ fout = fopen(argv[optind],"wb");
+ ++optind;
+ }
+ if (fin==NULL)
+ fin=stdin;
+ if (fout==NULL)
+ fout=stdout;
+}
+
+#define CHECKNULL(p) if ( (p)==NULL ) do { fprintf(stderr,"CHECKNULL failed @ %s(%d): %s\n",__FILE__,__LINE__,#p );exit(1);} while(0)
+
+typedef struct
+{
+ png_byte r;
+ png_byte g;
+ png_byte b;
+} rgb_t;
+
+static
+void val2rgb(float x,rgb_t *p)
+{
+ const double pi = 3.14159265358979;
+ p->g = (int)(255*sin(x*pi));
+ p->r = (int)(255*abs(sin(x*pi*3/2)));
+ p->b = (int)(255*abs(sin(x*pi*5/2)));
+ //fprintf(stderr,"%.2f : %d,%d,%d\n",x,(int)p->r,(int)p->g,(int)p->b);
+}
+
+static
+void cpx2pixels(rgb_t * res,const float * fbuf,size_t n)
+{
+ size_t i;
+ float minval,maxval,valrange;
+ minval=maxval=fbuf[0];
+
+ for (i = 0; i < n; ++i) {
+ if (fbuf[i] > maxval) maxval = fbuf[i];
+ if (fbuf[i] < minval) minval = fbuf[i];
+ }
+
+ fprintf(stderr,"min ==%f,max=%f\n",minval,maxval);
+ valrange = maxval-minval;
+ if (valrange == 0) {
+ fprintf(stderr,"min == max == %f\n",minval);
+ exit (1);
+ }
+
+ for (i = 0; i < n; ++i)
+ val2rgb( (fbuf[i] - minval)/valrange , res+i );
+}
+
+static
+void transform_signal(void)
+{
+ short *inbuf;
+ kiss_fftr_cfg cfg=NULL;
+ kiss_fft_scalar *tbuf;
+ kiss_fft_cpx *fbuf;
+ float *mag2buf;
+ int i;
+ int n;
+ int avgctr=0;
+
+ int nfreqs=nfft/2+1;
+
+ CHECKNULL( cfg=kiss_fftr_alloc(nfft,0,0,0) );
+ CHECKNULL( inbuf=(short*)malloc(sizeof(short)*2*nfft ) );
+ CHECKNULL( tbuf=(kiss_fft_scalar*)malloc(sizeof(kiss_fft_scalar)*nfft ) );
+ CHECKNULL( fbuf=(kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx)*nfreqs ) );
+ CHECKNULL( mag2buf=(float*)malloc(sizeof(float)*nfreqs ) );
+
+ memset(mag2buf,0,sizeof(mag2buf)*nfreqs);
+
+ while (1) {
+ if (stereo) {
+ n = fread(inbuf,sizeof(short)*2,nfft,fin);
+ if (n != nfft )
+ break;
+ for (i=0;i<nfft;++i)
+ tbuf[i] = inbuf[2*i] + inbuf[2*i+1];
+ }else{
+ n = fread(inbuf,sizeof(short),nfft,fin);
+ if (n != nfft )
+ break;
+ for (i=0;i<nfft;++i)
+ tbuf[i] = inbuf[i];
+ }
+
+ if (remove_dc) {
+ float avg = 0;
+ for (i=0;i<nfft;++i) avg += tbuf[i];
+ avg /= nfft;
+ for (i=0;i<nfft;++i) tbuf[i] -= (kiss_fft_scalar)avg;
+ }
+
+ /* do FFT */
+ kiss_fftr(cfg,tbuf,fbuf);
+
+ for (i=0;i<nfreqs;++i)
+ mag2buf[i] += fbuf[i].r * fbuf[i].r + fbuf[i].i * fbuf[i].i;
+
+ if (++avgctr == navg) {
+ avgctr=0;
+ ++nrows;
+ vals = (float*)realloc(vals,sizeof(float)*nrows*nfreqs);
+ float eps = 1;
+ for (i=0;i<nfreqs;++i)
+ vals[(nrows - 1) * nfreqs + i] = 10 * log10 ( mag2buf[i] / navg + eps );
+ memset(mag2buf,0,sizeof(mag2buf[0])*nfreqs);
+ }
+ }
+
+ free(cfg);
+ free(inbuf);
+ free(tbuf);
+ free(fbuf);
+ free(mag2buf);
+}
+
+static
+void make_png(void)
+{
+ png_bytepp row_pointers=NULL;
+ rgb_t * row_data=NULL;
+ int i;
+ int nfreqs = nfft/2+1;
+
+ png_structp png_ptr=NULL;
+ png_infop info_ptr=NULL;
+
+ CHECKNULL( png_ptr = png_create_write_struct (PNG_LIBPNG_VER_STRING,0,0,0) );
+ CHECKNULL( info_ptr = png_create_info_struct(png_ptr) );
+
+
+ png_init_io(png_ptr, fout );
+ png_set_IHDR(png_ptr, info_ptr ,nfreqs,nrows,8,PNG_COLOR_TYPE_RGB,PNG_INTERLACE_NONE,PNG_COMPRESSION_TYPE_DEFAULT,PNG_FILTER_TYPE_DEFAULT );
+
+
+ row_data = (rgb_t*)malloc(sizeof(rgb_t) * nrows * nfreqs) ;
+ cpx2pixels(row_data, vals, nfreqs*nrows );
+
+ row_pointers = realloc(row_pointers, nrows*sizeof(png_bytep));
+ for (i=0;i<nrows;++i) {
+ row_pointers[i] = (png_bytep)(row_data + i*nfreqs);
+ }
+ png_set_rows(png_ptr, info_ptr, row_pointers);
+
+
+ fprintf(stderr,"creating %dx%d png\n",nfreqs,nrows);
+ fprintf(stderr,"bitdepth %d \n",png_get_bit_depth(png_ptr,info_ptr ) );
+
+ png_write_png(png_ptr, info_ptr, PNG_TRANSFORM_IDENTITY , NULL);
+
+}
+
+int main(int argc,char ** argv)
+{
+ config(argc,argv);
+
+ transform_signal();
+
+ make_png();
+
+ if (fout!=stdout) fclose(fout);
+ if (fin!=stdin) fclose(fin);
+ return 0;
+}
#include "waveform.h"
#include "rgbparade.h"
#include "histogram.h"
+#include "audiospectrum.h"
#include <KApplication>
#include <KAction>
//connect(m_histogramDock, SIGNAL(visibilityChanged(bool)), this, SLOT(slotUpdateScopeFrameRequest()));
//connect(m_histogram, SIGNAL(requestAutoRefresh(bool)), this, SLOT(slotUpdateScopeFrameRequest()));
+ m_audioSpectrum = new AudioSpectrum(m_projectMonitor, m_clipMonitor);
+ m_audioSpectrumDock = new QDockWidget(i18n("AudioSpectrum"), this);
+ m_audioSpectrumDock->setObjectName(m_audioSpectrum->widgetName());
+ m_audioSpectrumDock->setWidget(m_audioSpectrum);
+ addDockWidget(Qt::TopDockWidgetArea, m_audioSpectrumDock);
+ if (m_projectMonitor) {
+ connect(m_projectMonitor->render, SIGNAL(audioSamplesSignal(QVector<int16_t>,int,int,int)),
+ m_audioSpectrum, SLOT(slotReceiveAudio(QVector<int16_t>,int,int,int)));
+ }
+ if (m_clipMonitor) {
+ connect(m_clipMonitor->render, SIGNAL(audioSamplesSignal(QVector<int16_t>,int,int,int)),
+ m_audioSpectrum, SLOT(slotReceiveAudio(QVector<int16_t>,int,int,int)));
+ }
+
m_undoViewDock = new QDockWidget(i18n("Undo History"), this);
m_undoViewDock->setObjectName("undo_history");
m_undoView = new QUndoView();
class RGBParade;
class KActionCollection;
class AudioSignal;
+class AudioSpectrum;
class MainWindow : public KXmlGuiWindow
{
QDockWidget *m_audiosignalDock;
AudioSignal *m_audiosignal;
+ QDockWidget *m_audioSpectrumDock;
+ AudioSpectrum *m_audioSpectrum;
+
QDockWidget *m_undoViewDock;
QUndoView *m_undoView;
QUndoGroup *m_commandStack;
--- /dev/null
+# Empty cmake file to satisfy CMake
\ No newline at end of file
#include <cstdlib>
#include <cstdarg>
+#include <QDebug>
+
static void kdenlive_callback(void* /*ptr*/, int level, const char* fmt, va_list vl)
{
int num_channels = 0;
int samples = 0;
int16_t* data = (int16_t*)frame.get_audio(audio_format, freq, num_channels, samples);
+
+ QVector<int16_t> sampleVector(samples);
+ memcpy(sampleVector.data(), data, samples*sizeof(int16_t));
+ qDebug() << samples << " samples. Freq=" << freq << ", channels=" << num_channels;
+ qDebug() << sizeof(char) << " (c) " << sizeof(int16_t) << " (int16_t)";
+ qDebug() << sampleVector.at(0);
+
if (!data)
return;
int num_samples = samples > 200 ? 200 : samples;
+
+
QByteArray channels;
for (int i = 0; i < num_channels; i++) {
long val = 0;
channels.append(val / num_samples);
}
-
- if (samples > 0)
+ qDebug() << channels.size() << ": size.";
+ if (samples > 0) {
emit showAudioSignal(channels);
- else
+ emit audioSamplesSignal(sampleVector, freq, num_channels, samples);
+ } else {
emit showAudioSignal(QByteArray());
+ }
}
/*
#include "gentime.h"
#include "definitions.h"
+#include "mlt/framework/mlt_types.h"
#include <kurl.h>
void showAudioSignal(const QByteArray);
/** @brief The renderer refreshed the current frame, but no seeking was done. */
void frameUpdated(QImage);
+ void audioSamplesSignal(const QVector<int16_t> data, const int freq, const int num_channels, const int num_samples);
public slots:
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<ui version="4.0">
+ <class>AudioSpectrum_UI</class>
+ <widget class="QWidget" name="AudioSpectrum_UI">
+ <property name="geometry">
+ <rect>
+ <x>0</x>
+ <y>0</y>
+ <width>400</width>
+ <height>300</height>
+ </rect>
+ </property>
+ <property name="windowTitle">
+ <string>Form</string>
+ </property>
+ </widget>
+ <resources/>
+ <connections/>
+</ui>
projects / kdenlive / commitdiff
