Compare commits
14 Commits
4b9beb518f
...
master
| Author | SHA1 | Date | |
|---|---|---|---|
|
0835fe1183
|
|||
|
d54fe997e5
|
|||
|
d2ca7e745e
|
|||
|
bbdab305aa
|
|||
|
3f2546edd1
|
|||
|
6846c853c0
|
|||
|
793df68ba1
|
|||
|
f52de19de5
|
|||
|
c0ffdbcfdc
|
|||
|
292416f1cd
|
|||
|
1e98372e08
|
|||
|
1ac0afa08d
|
|||
|
63921c3ac5
|
|||
|
81b63f5e67
|
41
.github/workflows/build.yml
vendored
41
.github/workflows/build.yml
vendored
@@ -6,6 +6,11 @@ on:
|
||||
pull_request:
|
||||
branches: [main, master]
|
||||
|
||||
permissions:
|
||||
contents: read
|
||||
pages: write
|
||||
id-token: write
|
||||
|
||||
jobs:
|
||||
linux:
|
||||
name: Linux (static)
|
||||
@@ -39,9 +44,16 @@ jobs:
|
||||
steps:
|
||||
- uses: actions/checkout@v4
|
||||
|
||||
- name: Cache vcpkg packages
|
||||
uses: actions/cache@v4
|
||||
with:
|
||||
path: ${{ env.VCPKG_INSTALLATION_ROOT }}/installed
|
||||
key: vcpkg-x64-windows-${{ hashFiles('.github/workflows/build.yml') }}
|
||||
restore-keys: vcpkg-x64-windows-
|
||||
|
||||
- name: Install vcpkg dependencies
|
||||
run: |
|
||||
vcpkg install sdl2 fftw3 libsndfile --triplet x64-windows
|
||||
vcpkg install sdl2 fftw3 "libsndfile[core]" --triplet x64-windows
|
||||
|
||||
- name: Configure
|
||||
run: >
|
||||
@@ -88,3 +100,30 @@ jobs:
|
||||
build_wasm/web/baudmine.html
|
||||
build_wasm/web/baudmine.js
|
||||
build_wasm/web/baudmine.wasm
|
||||
|
||||
- name: Prepare Pages
|
||||
if: github.event_name == 'push'
|
||||
run: |
|
||||
mkdir -p _site
|
||||
cp build_wasm/web/baudmine.html _site/index.html
|
||||
cp build_wasm/web/baudmine.js _site/
|
||||
cp build_wasm/web/baudmine.wasm _site/
|
||||
|
||||
- name: Upload Pages artifact
|
||||
if: github.event_name == 'push'
|
||||
uses: actions/upload-pages-artifact@v3
|
||||
with:
|
||||
path: _site
|
||||
|
||||
deploy:
|
||||
name: Deploy to GitHub Pages
|
||||
needs: wasm
|
||||
if: github.event_name == 'push'
|
||||
runs-on: ubuntu-24.04
|
||||
environment:
|
||||
name: github-pages
|
||||
url: ${{ steps.deployment.outputs.page_url }}
|
||||
steps:
|
||||
- name: Deploy
|
||||
id: deployment
|
||||
uses: actions/deploy-pages@v4
|
||||
|
||||
@@ -180,32 +180,53 @@ if(EMSCRIPTEN)
|
||||
else()
|
||||
# ── Native Build ─────────────────────────────────────────────────────────
|
||||
|
||||
set(CMAKE_CXX_FLAGS_RELEASE "-O3 -march=native -DNDEBUG")
|
||||
set(CMAKE_CXX_FLAGS_DEBUG "-g -O0 -fsanitize=address,undefined")
|
||||
option(NATIVE_BUILD "Optimize for the host CPU (-march=native)" OFF)
|
||||
|
||||
if(MSVC)
|
||||
set(CMAKE_CXX_FLAGS_RELEASE "/O2 /DNDEBUG /arch:AVX2")
|
||||
set(CMAKE_CXX_FLAGS_DEBUG "/Zi /Od")
|
||||
else()
|
||||
if(NATIVE_BUILD)
|
||||
set(CMAKE_CXX_FLAGS_RELEASE "-O3 -march=native -DNDEBUG")
|
||||
else()
|
||||
set(CMAKE_CXX_FLAGS_RELEASE "-O3 -march=x86-64-v3 -DNDEBUG")
|
||||
endif()
|
||||
set(CMAKE_CXX_FLAGS_DEBUG "-g -O0 -fsanitize=address,undefined")
|
||||
endif()
|
||||
|
||||
find_package(PkgConfig REQUIRED)
|
||||
find_package(OpenGL REQUIRED)
|
||||
|
||||
pkg_check_modules(SDL2 REQUIRED IMPORTED_TARGET sdl2)
|
||||
pkg_check_modules(FFTW3F REQUIRED IMPORTED_TARGET fftw3f)
|
||||
pkg_check_modules(SNDFILE REQUIRED IMPORTED_TARGET sndfile)
|
||||
if(MSVC)
|
||||
find_package(SDL2 CONFIG REQUIRED)
|
||||
find_package(FFTW3f CONFIG REQUIRED)
|
||||
find_package(SndFile CONFIG REQUIRED)
|
||||
|
||||
target_link_libraries(imgui PUBLIC PkgConfig::SDL2 OpenGL::GL)
|
||||
target_link_libraries(imgui PUBLIC SDL2::SDL2 OpenGL::GL)
|
||||
|
||||
add_executable(baudmine ${SOURCES})
|
||||
target_include_directories(baudmine PRIVATE src)
|
||||
target_link_libraries(baudmine PRIVATE
|
||||
imgui
|
||||
PkgConfig::SDL2
|
||||
PkgConfig::FFTW3F
|
||||
PkgConfig::SNDFILE
|
||||
OpenGL::GL
|
||||
pthread
|
||||
)
|
||||
add_executable(baudmine ${SOURCES})
|
||||
target_include_directories(baudmine PRIVATE src)
|
||||
target_link_libraries(baudmine PRIVATE
|
||||
imgui SDL2::SDL2 SDL2::SDL2main
|
||||
FFTW3::fftw3f SndFile::sndfile OpenGL::GL
|
||||
)
|
||||
else()
|
||||
find_package(PkgConfig REQUIRED)
|
||||
pkg_check_modules(SDL2 REQUIRED IMPORTED_TARGET sdl2)
|
||||
pkg_check_modules(FFTW3F REQUIRED IMPORTED_TARGET fftw3f)
|
||||
pkg_check_modules(SNDFILE REQUIRED IMPORTED_TARGET sndfile)
|
||||
|
||||
# Link math library and dl on Unix (dl needed by miniaudio for backend loading)
|
||||
if(UNIX)
|
||||
target_link_libraries(baudmine PRIVATE m dl)
|
||||
target_link_libraries(imgui PUBLIC PkgConfig::SDL2 OpenGL::GL)
|
||||
|
||||
add_executable(baudmine ${SOURCES})
|
||||
target_include_directories(baudmine PRIVATE src)
|
||||
target_link_libraries(baudmine PRIVATE
|
||||
imgui PkgConfig::SDL2 PkgConfig::FFTW3F
|
||||
PkgConfig::SNDFILE OpenGL::GL pthread
|
||||
)
|
||||
|
||||
if(UNIX)
|
||||
target_link_libraries(baudmine PRIVATE m dl)
|
||||
endif()
|
||||
endif()
|
||||
|
||||
endif()
|
||||
|
||||
674
LICENSE
Normal file
674
LICENSE
Normal file
@@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
69
README.md
Normal file
69
README.md
Normal file
@@ -0,0 +1,69 @@
|
||||
# Baudmine Spectrum Analyzer
|
||||
|
||||
Real-time audio spectrum analyzer and waterfall display built with C++17, ImGui, SDL2, and OpenGL. Runs natively on Linux and Windows, and in the browser via WebAssembly.
|
||||
|
||||
Beware, this thing is **entirely LLM-generated**! I've barely looked at the code! Anthropic had a promo for Claude, so I utilized it to make this clone of [**baudline**](https://www.baudline.com/what_is_baudline.html), which is a very powerful (and proprietary) tool, but sadly it's been seemingly abandoned for years, not that it would need anything. My hope was to put together something similar, using a more modern stack. It is not (yet) a fully-featured replacement, but it's good enough for me.
|
||||
|
||||
## Web preview
|
||||
|
||||
You can find the Web version here, delivered in 870 kB: https://ericek111.github.io/baudmine/
|
||||
|
||||
(If you allow access to "all microphones", you can switch between the input devices in the File menu.)
|
||||
|
||||
## Features
|
||||
|
||||
### Signal Processing
|
||||
- FFT sizes from 256 to 65,536 points with configurable overlap of bins for precise speed control of the waterfall.
|
||||
- Window functions: Hann, Hamming, Blackman, Blackman-Harris, Kaiser (configurable beta), Flat Top, Rectangular
|
||||
|
||||
### Input Sources
|
||||
- Live audio from system input devices
|
||||
- Multi-device mode: use up to 8 devices simultaneously, each mapped to a channel
|
||||
- File playback: WAV, Float32/Int16/Uint8 I/Q formats
|
||||
|
||||
### Visualization
|
||||
- Spectrum plot
|
||||
- Scrolling waterfall display that can be zoomed and panned
|
||||
- Linear and logarithmic frequency scales
|
||||
- Additive color blending for multi-channel display
|
||||
- Peak hold with adjustable decay rate
|
||||
|
||||
### Analysis
|
||||
- Dual cursors with frequency and magnitude readout
|
||||
- Automatic snap-to-peak
|
||||
- Peak detection with configurable threshold, separation, and frequency range (it shows the center frequency of the peak-detected FFT bin)
|
||||
- Peak trace on the waterfall
|
||||
- Delta measurements between cursors
|
||||
|
||||
### Math Channels
|
||||
- Unary: Negate, Absolute, Square, Cube, Square Root, Log
|
||||
- Binary: Add, Subtract, Multiply, Phase, Cross-correlation
|
||||
- Custom colors per math channel
|
||||
|
||||
### Interface
|
||||
- DPI-aware UI with auto-detection and manual scaling (100-300%)
|
||||
- Touch gesture support in the waterfall (pan and pinch-to-zoom)
|
||||
- The most important settings persist across sessions
|
||||
|
||||
## Building
|
||||
|
||||
### Linux
|
||||
|
||||
```bash
|
||||
# Install dependencies (Debian/Ubuntu)
|
||||
sudo apt install build-essential cmake pkg-config libsdl2-dev libfftw3-dev libsndfile1-dev libgl-dev
|
||||
|
||||
cmake -B build -DCMAKE_BUILD_TYPE=Release -DNATIVE_BUILD=ON
|
||||
cmake --build build -j$(nproc)
|
||||
```
|
||||
|
||||
### Windows (MSVC + vcpkg)
|
||||
|
||||
```powershell
|
||||
vcpkg install sdl2 fftw3 "libsndfile[core]" --triplet x64-windows
|
||||
|
||||
cmake -B build -DCMAKE_BUILD_TYPE=Release -DNATIVE_BUILD=ON `
|
||||
-DCMAKE_TOOLCHAIN_FILE="$env:VCPKG_INSTALLATION_ROOT/scripts/buildsystems/vcpkg.cmake" `
|
||||
-DVCPKG_TARGET_TRIPLET=x64-windows
|
||||
cmake --build build --config Release
|
||||
```
|
||||
@@ -2,6 +2,7 @@
|
||||
#include "audio/FileSource.h"
|
||||
|
||||
#include <algorithm>
|
||||
#include <chrono>
|
||||
#include <cmath>
|
||||
#include <cstdio>
|
||||
#include <cstring>
|
||||
@@ -146,6 +147,8 @@ void AudioEngine::clearHistory() {
|
||||
analyzer_.clearHistory();
|
||||
for (auto& ed : extraDevices_)
|
||||
ed->analyzer.clearHistory();
|
||||
for (auto& mw : mathWaterfalls_)
|
||||
mw.clear();
|
||||
}
|
||||
|
||||
int AudioEngine::processAudio() {
|
||||
@@ -157,19 +160,38 @@ int AudioEngine::processAudio() {
|
||||
if (hopFrames < 1) hopFrames = 1;
|
||||
audioBuf_.resize(hopFrames * channels);
|
||||
|
||||
constexpr int kMaxSpectraPerFrame = 8;
|
||||
// Drain all available audio so the scroll rate is independent of the
|
||||
// display refresh rate (vsync). Real-time sources self-limit via their
|
||||
// ring buffer; file sources are capped to wall-clock time so playback
|
||||
// runs at 1× speed regardless of frame rate.
|
||||
|
||||
// For file sources, compute how many samples correspond to elapsed time.
|
||||
size_t fileSampleCap = SIZE_MAX; // unlimited for real-time
|
||||
if (!audioSource_->isRealTime()) {
|
||||
using Clock = std::chrono::steady_clock;
|
||||
static Clock::time_point lastFileTime = Clock::now();
|
||||
auto now = Clock::now();
|
||||
double elapsed = std::chrono::duration<double>(now - lastFileTime).count();
|
||||
lastFileTime = now;
|
||||
// Clamp elapsed to avoid huge bursts after pauses or stalls.
|
||||
if (elapsed > 0.1) elapsed = 0.1;
|
||||
fileSampleCap = static_cast<size_t>(elapsed * settings_.sampleRate) + 1;
|
||||
}
|
||||
|
||||
// Process primary source.
|
||||
int spectraThisFrame = 0;
|
||||
while (spectraThisFrame < kMaxSpectraPerFrame) {
|
||||
size_t samplesRead = 0;
|
||||
for (;;) {
|
||||
if (samplesRead >= fileSampleCap) break;
|
||||
size_t framesRead = audioSource_->read(audioBuf_.data(), hopFrames);
|
||||
if (framesRead == 0) break;
|
||||
samplesRead += framesRead;
|
||||
analyzer_.pushSamples(audioBuf_.data(), framesRead);
|
||||
if (analyzer_.hasNewSpectrum())
|
||||
++spectraThisFrame;
|
||||
}
|
||||
|
||||
// Process extra devices independently.
|
||||
// Process extra devices independently (always real-time).
|
||||
for (auto& ed : extraDevices_) {
|
||||
int edCh = ed->source->channels();
|
||||
const auto& edSettings = ed->analyzer.settings();
|
||||
@@ -177,16 +199,17 @@ int AudioEngine::processAudio() {
|
||||
if (edHop < 1) edHop = 1;
|
||||
ed->audioBuf.resize(edHop * edCh);
|
||||
|
||||
int edSpectra = 0;
|
||||
while (edSpectra < kMaxSpectraPerFrame) {
|
||||
for (;;) {
|
||||
size_t framesRead = ed->source->read(ed->audioBuf.data(), edHop);
|
||||
if (framesRead == 0) break;
|
||||
ed->analyzer.pushSamples(ed->audioBuf.data(), framesRead);
|
||||
if (ed->analyzer.hasNewSpectrum())
|
||||
++edSpectra;
|
||||
}
|
||||
}
|
||||
|
||||
// Track overruns: spectra lost because they exceeded the history capacity.
|
||||
if (spectraThisFrame > kWaterfallHistory)
|
||||
overrunCount_ += spectraThisFrame - kWaterfallHistory;
|
||||
|
||||
return spectraThisFrame;
|
||||
}
|
||||
|
||||
@@ -226,6 +249,18 @@ const std::vector<float>& AudioEngine::getSpectrum(int globalCh) const {
|
||||
return analyzer_.channelSpectrum(0);
|
||||
}
|
||||
|
||||
const std::deque<std::vector<float>>& AudioEngine::getWaterfallHistory(int globalCh) const {
|
||||
int n = analyzer_.numSpectra();
|
||||
if (globalCh < n) return analyzer_.waterfallHistory(globalCh);
|
||||
globalCh -= n;
|
||||
for (auto& ed : extraDevices_) {
|
||||
int en = ed->analyzer.numSpectra();
|
||||
if (globalCh < en) return ed->analyzer.waterfallHistory(globalCh);
|
||||
globalCh -= en;
|
||||
}
|
||||
return analyzer_.waterfallHistory(0);
|
||||
}
|
||||
|
||||
const std::vector<std::complex<float>>& AudioEngine::getComplex(int globalCh) const {
|
||||
int n = analyzer_.numSpectra();
|
||||
if (globalCh < n) return analyzer_.channelComplex(globalCh);
|
||||
@@ -265,10 +300,17 @@ const char* AudioEngine::getDeviceName(int globalCh) const {
|
||||
|
||||
// ── Math channels ────────────────────────────────────────────────────────────
|
||||
|
||||
const std::deque<std::vector<float>>& AudioEngine::mathWaterfallHistory(int mi) const {
|
||||
static const std::deque<std::vector<float>> empty;
|
||||
if (mi < 0 || mi >= static_cast<int>(mathWaterfalls_.size())) return empty;
|
||||
return mathWaterfalls_[mi];
|
||||
}
|
||||
|
||||
void AudioEngine::computeMathChannels() {
|
||||
int nPhys = totalNumSpectra();
|
||||
int specSz = analyzer_.spectrumSize();
|
||||
mathSpectra_.resize(mathChannels_.size());
|
||||
mathWaterfalls_.resize(mathChannels_.size());
|
||||
|
||||
for (size_t mi = 0; mi < mathChannels_.size(); ++mi) {
|
||||
const auto& mc = mathChannels_[mi];
|
||||
@@ -339,6 +381,11 @@ void AudioEngine::computeMathChannels() {
|
||||
}
|
||||
out[i] = val;
|
||||
}
|
||||
|
||||
// Push to math waterfall history.
|
||||
mathWaterfalls_[mi].push_back(out);
|
||||
if (mathWaterfalls_[mi].size() > kWaterfallHistory)
|
||||
mathWaterfalls_[mi].pop_front();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -6,6 +6,7 @@
|
||||
#include "dsp/SpectrumAnalyzer.h"
|
||||
|
||||
#include <complex>
|
||||
#include <deque>
|
||||
#include <memory>
|
||||
#include <string>
|
||||
#include <vector>
|
||||
@@ -42,6 +43,7 @@ public:
|
||||
// ── Unified channel view across all analyzers ──
|
||||
int totalNumSpectra() const;
|
||||
const std::vector<float>& getSpectrum(int globalCh) const;
|
||||
const std::deque<std::vector<float>>& getWaterfallHistory(int globalCh) const;
|
||||
const std::vector<std::complex<float>>& getComplex(int globalCh) const;
|
||||
const char* getDeviceName(int globalCh) const;
|
||||
int spectrumSize() const { return analyzer_.spectrumSize(); }
|
||||
@@ -51,8 +53,15 @@ public:
|
||||
std::vector<MathChannel>& mathChannels() { return mathChannels_; }
|
||||
const std::vector<MathChannel>& mathChannels() const { return mathChannels_; }
|
||||
const std::vector<std::vector<float>>& mathSpectra() const { return mathSpectra_; }
|
||||
const std::deque<std::vector<float>>& mathWaterfallHistory(int mi) const;
|
||||
void computeMathChannels();
|
||||
|
||||
// ── Overrun tracking ──
|
||||
// Counts spectra lost because more were produced in a single frame
|
||||
// than the waterfall history deque can hold.
|
||||
int overrunCount() const { return overrunCount_; }
|
||||
void resetOverrunCount() { overrunCount_ = 0; }
|
||||
|
||||
// ── Device selection state (for config persistence) ──
|
||||
int deviceIdx() const { return deviceIdx_; }
|
||||
void setDeviceIdx(int i) { deviceIdx_ = i; }
|
||||
@@ -79,8 +88,12 @@ private:
|
||||
AnalyzerSettings settings_;
|
||||
|
||||
// Math
|
||||
std::vector<MathChannel> mathChannels_;
|
||||
std::vector<std::vector<float>> mathSpectra_;
|
||||
std::vector<MathChannel> mathChannels_;
|
||||
std::vector<std::vector<float>> mathSpectra_;
|
||||
std::vector<std::deque<std::vector<float>>> mathWaterfalls_;
|
||||
|
||||
// Overrun
|
||||
int overrunCount_ = 0;
|
||||
|
||||
// Device state
|
||||
std::vector<MiniAudioSource::DeviceInfo> devices_;
|
||||
|
||||
@@ -2,6 +2,9 @@
|
||||
#include <cstdlib>
|
||||
#include <fstream>
|
||||
#include <sstream>
|
||||
#ifndef __EMSCRIPTEN__
|
||||
#include <filesystem>
|
||||
#endif
|
||||
|
||||
#ifdef __EMSCRIPTEN__
|
||||
#include <emscripten.h>
|
||||
@@ -22,7 +25,6 @@ EM_JS(void, js_saveSettings, (const char* data), {
|
||||
});
|
||||
|
||||
#else
|
||||
#include <sys/stat.h>
|
||||
#endif
|
||||
|
||||
namespace baudmine {
|
||||
@@ -30,16 +32,20 @@ namespace baudmine {
|
||||
std::string Config::defaultPath() {
|
||||
#ifdef __EMSCRIPTEN__
|
||||
return "";
|
||||
#elif defined(_WIN32)
|
||||
const char* appdata = std::getenv("APPDATA");
|
||||
auto base = std::filesystem::path(appdata ? appdata : ".");
|
||||
return (base / "baudmine" / "settings.ini").string();
|
||||
#else
|
||||
const char* xdg = std::getenv("XDG_CONFIG_HOME");
|
||||
std::string base;
|
||||
std::filesystem::path base;
|
||||
if (xdg && xdg[0]) {
|
||||
base = xdg;
|
||||
} else {
|
||||
const char* home = std::getenv("HOME");
|
||||
base = home ? std::string(home) + "/.config" : ".";
|
||||
base = home ? std::filesystem::path(home) / ".config" : std::filesystem::path(".");
|
||||
}
|
||||
return base + "/baudmine/settings.ini";
|
||||
return (base / "baudmine" / "settings.ini").string();
|
||||
#endif
|
||||
}
|
||||
|
||||
@@ -77,19 +83,9 @@ bool Config::load(const std::string& path) {
|
||||
|
||||
#ifndef __EMSCRIPTEN__
|
||||
static void ensureDir(const std::string& path) {
|
||||
// Create parent directories.
|
||||
auto lastSlash = path.rfind('/');
|
||||
if (lastSlash == std::string::npos) return;
|
||||
std::string dir = path.substr(0, lastSlash);
|
||||
// Simple recursive mkdir.
|
||||
for (size_t i = 1; i < dir.size(); ++i) {
|
||||
if (dir[i] == '/') {
|
||||
dir[i] = '\0';
|
||||
mkdir(dir.c_str(), 0755);
|
||||
dir[i] = '/';
|
||||
}
|
||||
}
|
||||
mkdir(dir.c_str(), 0755);
|
||||
std::filesystem::path p(path);
|
||||
if (p.has_parent_path())
|
||||
std::filesystem::create_directories(p.parent_path());
|
||||
}
|
||||
#endif
|
||||
|
||||
|
||||
@@ -15,7 +15,7 @@ namespace baudmine {
|
||||
constexpr int kMinFFTSize = 256;
|
||||
constexpr int kMaxFFTSize = 65536;
|
||||
constexpr int kDefaultFFTSize = 4096;
|
||||
constexpr int kWaterfallHistory = 2048;
|
||||
constexpr int kWaterfallHistory = 512;
|
||||
constexpr int kDefaultWindowWidth = 1400;
|
||||
constexpr int kDefaultWindowHeight = 900;
|
||||
|
||||
|
||||
@@ -105,7 +105,7 @@ void SpectrumAnalyzer::processBlock() {
|
||||
for (float& v : channelSpectra_[ch])
|
||||
v += windowCorrection_;
|
||||
channelWaterfalls_[ch].push_back(channelSpectra_[ch]);
|
||||
if (channelWaterfalls_[ch].size() > kWaterfallHistory)
|
||||
if (channelWaterfalls_[ch].size() > static_cast<size_t>(kWaterfallHistory))
|
||||
channelWaterfalls_[ch].pop_front();
|
||||
}
|
||||
newSpectrumReady_ = true;
|
||||
|
||||
@@ -30,6 +30,11 @@ EM_JS(void, js_clearCanvasInlineSize, (), {
|
||||
if (c) { c.style.width = ''; c.style.height = ''; }
|
||||
});
|
||||
|
||||
#elif defined(_WIN32)
|
||||
#define WIN32_LEAN_AND_MEAN
|
||||
#define NOMINMAX
|
||||
#include <windows.h>
|
||||
#include <GL/gl.h>
|
||||
#else
|
||||
#include <GL/gl.h>
|
||||
#endif
|
||||
@@ -231,12 +236,14 @@ bool Application::init(int argc, char** argv) {
|
||||
}
|
||||
|
||||
void Application::shutdown() {
|
||||
if (!window_) return; // already shut down
|
||||
audio_.closeAll();
|
||||
ImGui_ImplOpenGL3_Shutdown();
|
||||
ImGui_ImplSDL2_Shutdown();
|
||||
ImGui::DestroyContext();
|
||||
if (glContext_) { SDL_GL_DeleteContext(glContext_); glContext_ = nullptr; }
|
||||
if (window_) { SDL_DestroyWindow(window_); window_ = nullptr; }
|
||||
SDL_DestroyWindow(window_);
|
||||
window_ = nullptr;
|
||||
SDL_Quit();
|
||||
}
|
||||
|
||||
@@ -307,30 +314,65 @@ void Application::processAudio() {
|
||||
const auto& mathChannels = audio_.mathChannels();
|
||||
const auto& mathSpectra = audio_.mathSpectra();
|
||||
|
||||
if (ui_.waterfallMultiCh && nSpec > 1) {
|
||||
std::vector<std::vector<float>> wfSpectra;
|
||||
std::vector<WaterfallChannelInfo> wfInfo;
|
||||
|
||||
for (int ch = 0; ch < nSpec; ++ch) {
|
||||
const auto& c = ui_.channelColors[ch % kMaxChannels];
|
||||
wfSpectra.push_back(audio_.getSpectrum(ch));
|
||||
wfInfo.push_back({c.x, c.y, c.z,
|
||||
ui_.channelEnabled[ch % kMaxChannels]});
|
||||
}
|
||||
for (size_t mi = 0; mi < mathChannels.size(); ++mi) {
|
||||
if (mathChannels[mi].enabled && mathChannels[mi].waterfall &&
|
||||
mi < mathSpectra.size()) {
|
||||
const auto& c = mathChannels[mi].color;
|
||||
wfSpectra.push_back(mathSpectra[mi]);
|
||||
wfInfo.push_back({c[0], c[1], c[2], true});
|
||||
}
|
||||
}
|
||||
waterfall_.pushLineMulti(wfSpectra, wfInfo, ui_.minDB, ui_.maxDB);
|
||||
} else {
|
||||
int wfCh = std::clamp(ui_.waterfallChannel, 0, nSpec - 1);
|
||||
waterfall_.pushLine(audio_.getSpectrum(wfCh), ui_.minDB, ui_.maxDB);
|
||||
}
|
||||
// Push ALL new spectra to the waterfall so that the scroll rate
|
||||
// is determined by the audio sample rate, not the display refresh.
|
||||
int curCh = std::clamp(ui_.waterfallChannel, 0, nSpec - 1);
|
||||
const auto& traceHist = audio_.getWaterfallHistory(curCh);
|
||||
int traceHistSz = static_cast<int>(traceHist.size());
|
||||
|
||||
if (ui_.waterfallMultiCh && nSpec > 1) {
|
||||
// For multi-channel: replay the last spectraThisFrame entries
|
||||
// from channel 0's history to get per-step data. Other
|
||||
// channels have the same count of new entries.
|
||||
const auto& hist0 = audio_.getWaterfallHistory(0);
|
||||
int histSz = static_cast<int>(hist0.size());
|
||||
int start = std::max(0, histSz - spectraThisFrame);
|
||||
|
||||
for (int si = start; si < histSz; ++si) {
|
||||
std::vector<std::vector<float>> wfSpectra;
|
||||
std::vector<WaterfallChannelInfo> wfInfo;
|
||||
|
||||
for (int ch = 0; ch < nSpec; ++ch) {
|
||||
const auto& c = ui_.channelColors[ch % kMaxChannels];
|
||||
const auto& hist = audio_.getWaterfallHistory(ch);
|
||||
int idx = std::max(0, static_cast<int>(hist.size()) - (histSz - si));
|
||||
wfSpectra.push_back(hist[idx]);
|
||||
wfInfo.push_back({c.x, c.y, c.z,
|
||||
ui_.channelEnabled[ch % kMaxChannels]});
|
||||
}
|
||||
// Math channels: use their own waterfall history.
|
||||
for (size_t mi = 0; mi < mathChannels.size(); ++mi) {
|
||||
if (mathChannels[mi].enabled && mathChannels[mi].waterfall &&
|
||||
mi < mathSpectra.size()) {
|
||||
const auto& c = mathChannels[mi].color;
|
||||
const auto& mHist = audio_.mathWaterfallHistory(static_cast<int>(mi));
|
||||
int mHistSz = static_cast<int>(mHist.size());
|
||||
int mIdx = std::max(0, mHistSz - (histSz - si));
|
||||
if (mIdx < mHistSz) {
|
||||
wfSpectra.push_back(mHist[mIdx]);
|
||||
} else {
|
||||
wfSpectra.push_back(mathSpectra[mi]);
|
||||
}
|
||||
wfInfo.push_back({c[0], c[1], c[2], true});
|
||||
}
|
||||
}
|
||||
waterfall_.pushLineMulti(wfSpectra, wfInfo, ui_.minDB, ui_.maxDB);
|
||||
|
||||
// Push peak trace entry synchronized with each waterfall line.
|
||||
int tIdx = std::max(0, traceHistSz - (histSz - si));
|
||||
measurements_.pushPeakTrace(traceHist[tIdx],
|
||||
settings.sampleRate, settings.isIQ, settings.fftSize);
|
||||
}
|
||||
} else {
|
||||
const auto& hist = audio_.getWaterfallHistory(curCh);
|
||||
int histSz = static_cast<int>(hist.size());
|
||||
int start = std::max(0, histSz - spectraThisFrame);
|
||||
for (int si = start; si < histSz; ++si) {
|
||||
waterfall_.pushLine(hist[si], ui_.minDB, ui_.maxDB);
|
||||
measurements_.pushPeakTrace(hist[si],
|
||||
settings.sampleRate, settings.isIQ, settings.fftSize);
|
||||
}
|
||||
}
|
||||
cursors_.update(audio_.getSpectrum(curCh),
|
||||
settings.sampleRate, settings.isIQ, settings.fftSize);
|
||||
measurements_.update(audio_.getSpectrum(curCh),
|
||||
@@ -470,6 +512,9 @@ void Application::render() {
|
||||
ImGui::MenuItem("Additive Blend", nullptr, &specDisplay_.additiveBlend);
|
||||
if (ImGui::IsItemHovered())
|
||||
ImGui::SetTooltip("Mix multi-channel spectrum colors additively");
|
||||
ImGui::MenuItem("Rulers", nullptr, &displayPanel_.showRuler);
|
||||
if (ImGui::IsItemHovered())
|
||||
ImGui::SetTooltip("Show timescale ruler on waterfall");
|
||||
ImGui::Separator();
|
||||
if (ImGui::MenuItem("VSync", nullptr, &vsync_)) {
|
||||
SDL_GL_SetSwapInterval(vsync_ ? 1 : 0);
|
||||
@@ -674,8 +719,10 @@ void Application::loadConfig() {
|
||||
specDisplay_.peakHoldDecay = config_.getFloat("peak_hold_decay", specDisplay_.peakHoldDecay);
|
||||
specDisplay_.additiveBlend = config_.getBool("additive_blend", specDisplay_.additiveBlend);
|
||||
cursors_.snapToPeaks = config_.getBool("snap_to_peaks", cursors_.snapToPeaks);
|
||||
displayPanel_.showRuler = config_.getBool("show_ruler", displayPanel_.showRuler);
|
||||
measurements_.traceMinFreq = config_.getFloat("trace_min_freq", measurements_.traceMinFreq);
|
||||
measurements_.traceMaxFreq = config_.getFloat("trace_max_freq", measurements_.traceMaxFreq);
|
||||
ui_.specMinPixPerBin = config_.getInt("spec_min_pix_per_bin", ui_.specMinPixPerBin);
|
||||
|
||||
// Clamp
|
||||
controlPanel_.fftSizeIdx = std::clamp(controlPanel_.fftSizeIdx, 0, ControlPanel::kNumFFTSizes - 1);
|
||||
@@ -738,8 +785,10 @@ void Application::saveConfig() const {
|
||||
cfg.setFloat("peak_hold_decay", specDisplay_.peakHoldDecay);
|
||||
cfg.setBool("additive_blend", specDisplay_.additiveBlend);
|
||||
cfg.setBool("snap_to_peaks", cursors_.snapToPeaks);
|
||||
cfg.setBool("show_ruler", displayPanel_.showRuler);
|
||||
cfg.setFloat("trace_min_freq", measurements_.traceMinFreq);
|
||||
cfg.setFloat("trace_max_freq", measurements_.traceMaxFreq);
|
||||
cfg.setInt("spec_min_pix_per_bin", ui_.specMinPixPerBin);
|
||||
|
||||
int devIdx = audio_.deviceIdx();
|
||||
if (devIdx >= 0 && devIdx < static_cast<int>(devices.size()))
|
||||
|
||||
@@ -95,6 +95,23 @@ void ControlPanel::render(AudioEngine& audio, UIState& ui,
|
||||
ImGui::GetWindowDrawList()->AddText({tx, ty}, IM_COL32(255, 255, 255, 220), overlayText);
|
||||
if (ImGui::IsItemHovered()) ImGui::SetTooltip("Overlap");
|
||||
}
|
||||
|
||||
// Overrun indicator
|
||||
{
|
||||
int overruns = audio.overrunCount();
|
||||
float now = static_cast<float>(ImGui::GetTime());
|
||||
if (overruns > lastOverrunCount_) {
|
||||
lastOverrunCount_ = overruns;
|
||||
lastOverrunTime_ = now;
|
||||
}
|
||||
if (overruns > 0 && (now - lastOverrunTime_) < 3.0f) {
|
||||
ImGui::TextColored({1.0f, 0.4f, 0.4f, 1.0f},
|
||||
"Input overrun: %d FFTs", overruns);
|
||||
} else if (overruns > 0) {
|
||||
audio.resetOverrunCount();
|
||||
lastOverrunCount_ = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// ── Display ──
|
||||
@@ -178,6 +195,15 @@ void ControlPanel::render(AudioEngine& audio, UIState& ui,
|
||||
}
|
||||
if (ImGui::IsItemHovered()) ImGui::SetTooltip("Reset to 2x zoom");
|
||||
}
|
||||
|
||||
{
|
||||
ImGui::AlignTextToFramePadding();
|
||||
ImGui::Text("Decim:");
|
||||
ImGui::SameLine();
|
||||
ImGui::SetNextItemWidth(ImGui::GetContentRegionAvail().x);
|
||||
ImGui::SliderInt("##decimation", &ui.specMinPixPerBin, 1, 8, "%d px/bin");
|
||||
if (ImGui::IsItemHovered()) ImGui::SetTooltip("Spectrum frequency decimation (peak-detect)");
|
||||
}
|
||||
}
|
||||
|
||||
// ── Channels ──
|
||||
|
||||
@@ -45,6 +45,10 @@ private:
|
||||
bool needsSave_ = false;
|
||||
bool needsUpdate_ = false;
|
||||
|
||||
// Overrun display
|
||||
int lastOverrunCount_ = 0;
|
||||
float lastOverrunTime_ = 0.0f; // ImGui time of last overrun
|
||||
|
||||
void flagSave() { needsSave_ = true; }
|
||||
void flagUpdate() { needsUpdate_ = true; }
|
||||
};
|
||||
|
||||
@@ -5,11 +5,27 @@
|
||||
#include <algorithm>
|
||||
#include <cmath>
|
||||
#include <cstdio>
|
||||
#include <cstring>
|
||||
|
||||
namespace baudmine {
|
||||
|
||||
namespace {
|
||||
|
||||
// Ruler styling constants (shared by time and dB rulers).
|
||||
constexpr ImU32 kRulerBg = IM_COL32(20, 20, 30, 220);
|
||||
constexpr ImU32 kRulerTickCol = IM_COL32(200, 200, 220, 230);
|
||||
constexpr ImU32 kRulerLabelCol = IM_COL32(220, 220, 240, 240);
|
||||
constexpr ImU32 kRulerUnitCol = IM_COL32(180, 180, 200, 220);
|
||||
|
||||
// Pick the smallest "nice" value from a sorted table that is >= target.
|
||||
// Returns the last element if none qualifies.
|
||||
template<typename T, size_t N>
|
||||
T pickNiceStep(const T (&table)[N], T target) {
|
||||
for (const T& v : table)
|
||||
if (v >= target) return v;
|
||||
return table[N - 1];
|
||||
}
|
||||
|
||||
// Zoom the view range centered on a screen-fraction cursor position.
|
||||
void zoomView(float& viewLo, float& viewHi, float cursorScreenFrac, float wheelDir) {
|
||||
float viewFrac = viewLo + cursorScreenFrac * (viewHi - viewLo);
|
||||
@@ -44,11 +60,11 @@ void DisplayPanel::renderSpectrum(AudioEngine& audio, UIState& ui,
|
||||
Measurements& measurements) {
|
||||
const auto& settings = audio.settings();
|
||||
|
||||
float availW = ImGui::GetContentRegionAvail().x;
|
||||
float availW = ImGui::GetContentRegionAvail().x - rulerWidth_;
|
||||
float specH = ImGui::GetContentRegionAvail().y;
|
||||
|
||||
ImVec2 pos = ImGui::GetCursorScreenPos();
|
||||
specPosX = pos.x;
|
||||
specPosX = pos.x + rulerWidth_;
|
||||
specPosY = pos.y;
|
||||
specSizeX = availW;
|
||||
specSizeY = specH;
|
||||
@@ -83,10 +99,11 @@ void DisplayPanel::renderSpectrum(AudioEngine& audio, UIState& ui,
|
||||
}
|
||||
|
||||
specDisplay.updatePeakHold(allSpectraScratch_);
|
||||
specDisplay.dbLabelOffsetX = rulerWidth_;
|
||||
specDisplay.draw(allSpectraScratch_, stylesScratch_, ui.minDB, ui.maxDB,
|
||||
settings.sampleRate, settings.isIQ, ui.freqScale,
|
||||
specPosX, specPosY, specSizeX, specSizeY,
|
||||
ui.viewLo, ui.viewHi);
|
||||
ui.viewLo, ui.viewHi, ui.specMinPixPerBin);
|
||||
|
||||
cursors.draw(specDisplay, specPosX, specPosY, specSizeX, specSizeY,
|
||||
settings.sampleRate, settings.isIQ, ui.freqScale, ui.minDB, ui.maxDB,
|
||||
@@ -96,10 +113,45 @@ void DisplayPanel::renderSpectrum(AudioEngine& audio, UIState& ui,
|
||||
settings.sampleRate, settings.isIQ, ui.freqScale, ui.minDB, ui.maxDB,
|
||||
ui.viewLo, ui.viewHi);
|
||||
|
||||
// ── dB ruler ──
|
||||
if (showRuler && rulerWidth_ > 0.0f) {
|
||||
ImDrawList* dl = ImGui::GetWindowDrawList();
|
||||
float rulerX = pos.x;
|
||||
|
||||
dl->AddRectFilled({rulerX, specPosY},
|
||||
{rulerX + rulerWidth_, specPosY + specH}, kRulerBg);
|
||||
dl->AddLine({rulerX + rulerWidth_ - 1, specPosY},
|
||||
{rulerX + rulerWidth_ - 1, specPosY + specH},
|
||||
kRulerTickCol, 1.0f);
|
||||
|
||||
constexpr float kTargetDbSpacing = 30.0f;
|
||||
float dbRange = ui.maxDB - ui.minDB;
|
||||
static const float kNiceDbSteps[] = {1.0f, 2.0f, 5.0f, 10.0f, 20.0f, 50.0f, 100.0f};
|
||||
float dbStep = pickNiceStep(kNiceDbSteps, dbRange * (kTargetDbSpacing / specH));
|
||||
|
||||
float charH = ImGui::CalcTextSize("0").y;
|
||||
float bottomCutoff = specPosY + specH - charH * 2 - 4.0f;
|
||||
for (float db = std::ceil(ui.minDB / dbStep) * dbStep; db <= ui.maxDB + 0.01f; db += dbStep) {
|
||||
float y = specPosY + specH * (1.0f - (db - ui.minDB) / dbRange);
|
||||
if (y > bottomCutoff) continue;
|
||||
|
||||
dl->AddLine({rulerX, y},
|
||||
{rulerX + rulerWidth_ - 1, y}, kRulerTickCol, 2.0f);
|
||||
|
||||
char numBuf[16];
|
||||
std::snprintf(numBuf, sizeof(numBuf), "%.0f", db);
|
||||
dl->AddText({rulerX - 3.0f, y + 2.0f}, kRulerLabelCol, numBuf);
|
||||
}
|
||||
|
||||
ImVec2 unitSz = ImGui::CalcTextSize("dB");
|
||||
dl->AddText({rulerX + 2.0f, specPosY + specH - unitSz.y - 2.0f},
|
||||
kRulerUnitCol, "dB");
|
||||
}
|
||||
|
||||
handleSpectrumInput(audio, ui, specDisplay, cursors,
|
||||
specPosX, specPosY, specSizeX, specSizeY);
|
||||
|
||||
ImGui::Dummy({availW, specH});
|
||||
ImGui::Dummy({availW + rulerWidth_, specH});
|
||||
}
|
||||
|
||||
void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
@@ -108,11 +160,16 @@ void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
ColorMap& colorMap) {
|
||||
const auto& settings = audio.settings();
|
||||
|
||||
float availW = ImGui::GetContentRegionAvail().x;
|
||||
float fullW = ImGui::GetContentRegionAvail().x;
|
||||
constexpr float kSplitterH = 6.0f;
|
||||
float parentH = ImGui::GetContentRegionAvail().y;
|
||||
float availH = (parentH - kSplitterH) * (1.0f - spectrumFrac);
|
||||
|
||||
// Compute ruler width (used by both waterfall and spectrum rendering).
|
||||
float labelW = ImGui::CalcTextSize("-000").x;
|
||||
rulerWidth_ = showRuler ? labelW : 0.0f;
|
||||
float availW = fullW - rulerWidth_;
|
||||
|
||||
int neededH = std::max(1024, static_cast<int>(availH) + 1);
|
||||
int binCount = std::max(1, audio.spectrumSize());
|
||||
if (binCount != waterfall.width() || waterfall.height() < neededH) {
|
||||
@@ -121,7 +178,8 @@ void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
}
|
||||
|
||||
if (waterfall.textureID()) {
|
||||
ImVec2 pos = ImGui::GetCursorScreenPos();
|
||||
ImVec2 basePos = ImGui::GetCursorScreenPos();
|
||||
ImVec2 pos = {basePos.x + rulerWidth_, basePos.y};
|
||||
ImDrawList* dl = ImGui::GetWindowDrawList();
|
||||
auto texID = static_cast<ImTextureID>(waterfall.textureID());
|
||||
|
||||
@@ -213,10 +271,86 @@ void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
|
||||
wfPosX = pos.x; wfPosY = pos.y; wfSizeX = availW; wfSizeY = availH;
|
||||
|
||||
int hopSamples = std::max(1, static_cast<int>(settings.fftSize * (1.0f - settings.overlap)));
|
||||
double secondsPerLine = static_cast<double>(hopSamples) / settings.sampleRate;
|
||||
|
||||
measurements.drawWaterfall(specDisplay, wfPosX, wfPosY, wfSizeX, wfSizeY,
|
||||
settings.sampleRate, settings.isIQ, ui.freqScale,
|
||||
ui.viewLo, ui.viewHi, screenRows, audio.spectrumSize());
|
||||
|
||||
// ── Timescale ruler ──
|
||||
if (showRuler && rulerWidth_ > 0.0f) {
|
||||
double totalTime = screenRows * secondsPerLine;
|
||||
|
||||
float rulerX = basePos.x;
|
||||
float rulerY = basePos.y;
|
||||
|
||||
dl->AddRectFilled({rulerX, rulerY},
|
||||
{rulerX + rulerWidth_, rulerY + availH}, kRulerBg);
|
||||
dl->AddLine({rulerX + rulerWidth_ - 1, rulerY},
|
||||
{rulerX + rulerWidth_ - 1, rulerY + availH},
|
||||
kRulerTickCol, 1.0f);
|
||||
|
||||
// Pick a nice major tick interval targeting ~80px spacing.
|
||||
constexpr float kTargetTickSpacing = 80.0f;
|
||||
static const double kNiceIntervals[] = {
|
||||
0.001, 0.002, 0.005, 0.01, 0.02, 0.05,
|
||||
0.1, 0.2, 0.5, 1.0, 2.0, 5.0, 10.0, 20.0, 30.0, 60.0, 120.0, 300.0
|
||||
};
|
||||
double majorInterval = pickNiceStep(kNiceIntervals,
|
||||
totalTime * (kTargetTickSpacing / availH));
|
||||
double minorInterval = majorInterval / 4.0;
|
||||
bool useMs = (majorInterval < 1.0);
|
||||
float charH = ImGui::CalcTextSize("0").y;
|
||||
|
||||
// Minor ticks
|
||||
float minorTickLen = rulerWidth_ / 3.0f;
|
||||
for (int idx = 1;; ++idx) {
|
||||
double t = minorInterval * idx;
|
||||
if (t >= totalTime) break;
|
||||
if (idx % 4 == 0) continue;
|
||||
|
||||
float y = rulerY + availH - static_cast<float>(t / totalTime) * availH;
|
||||
if (y < rulerY) break;
|
||||
|
||||
float tickLen = (idx % 2 == 0) ? minorTickLen * 1.5f : minorTickLen;
|
||||
dl->AddLine({rulerX + rulerWidth_ - 1 - tickLen, y},
|
||||
{rulerX + rulerWidth_ - 1, y}, kRulerTickCol, 1.5f);
|
||||
}
|
||||
|
||||
// Major ticks with vertically stacked digit labels
|
||||
for (int idx = 1;; ++idx) {
|
||||
double t = majorInterval * idx;
|
||||
if (t >= totalTime) break;
|
||||
|
||||
float y = rulerY + availH - static_cast<float>(t / totalTime) * availH;
|
||||
if (y < rulerY) break;
|
||||
|
||||
dl->AddLine({rulerX, y},
|
||||
{rulerX + rulerWidth_ - 1, y}, kRulerTickCol, 2.0f);
|
||||
|
||||
char numBuf[16];
|
||||
int ival = static_cast<int>((useMs ? t * 1000.0 : t) + 0.5);
|
||||
std::snprintf(numBuf, sizeof(numBuf), "%d", ival);
|
||||
|
||||
int nDigits = static_cast<int>(std::strlen(numBuf));
|
||||
float digitX = rulerX + 2.0f;
|
||||
float digitY = y + 3.0f;
|
||||
for (int d = 0; d < nDigits; ++d) {
|
||||
if (digitY + charH > rulerY + availH - charH) break;
|
||||
char ch[2] = {numBuf[d], '\0'};
|
||||
dl->AddText({digitX, digitY}, kRulerLabelCol, ch);
|
||||
digitY += charH;
|
||||
}
|
||||
}
|
||||
|
||||
// Unit label at the very bottom
|
||||
const char* unit = useMs ? "ms" : "s";
|
||||
ImVec2 unitSz = ImGui::CalcTextSize(unit);
|
||||
dl->AddText({rulerX + 2.0f, rulerY + availH - unitSz.y - 2.0f},
|
||||
kRulerUnitCol, unit);
|
||||
}
|
||||
|
||||
// ── Mouse interaction: zoom, pan & hover on waterfall ──
|
||||
ImGuiIO& io = ImGui::GetIO();
|
||||
float mx = io.MousePos.x;
|
||||
@@ -237,9 +371,6 @@ void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
bin = std::clamp(bin, 0, bins - 1);
|
||||
|
||||
float yFrac = 1.0f - (my - pos.y) / availH;
|
||||
int hopSamples = static_cast<int>(settings.fftSize * (1.0f - settings.overlap));
|
||||
if (hopSamples < 1) hopSamples = 1;
|
||||
double secondsPerLine = static_cast<double>(hopSamples) / settings.sampleRate;
|
||||
hoverWfTimeOff = static_cast<float>(yFrac * screenRows * secondsPerLine);
|
||||
|
||||
int curCh = std::clamp(ui.waterfallChannel, 0, audio.totalNumSpectra() - 1);
|
||||
@@ -247,9 +378,7 @@ void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
if (!spec.empty()) {
|
||||
cursors.hover = {true, freq, spec[bin], bin};
|
||||
}
|
||||
}
|
||||
|
||||
if (inWaterfall) {
|
||||
if (io.MouseWheel != 0)
|
||||
zoomView(ui.viewLo, ui.viewHi, (mx - pos.x) / availW, io.MouseWheel);
|
||||
|
||||
@@ -263,7 +392,7 @@ void DisplayPanel::renderWaterfall(AudioEngine& audio, UIState& ui,
|
||||
}
|
||||
}
|
||||
|
||||
ImGui::Dummy({availW, availH});
|
||||
ImGui::Dummy({fullW, availH});
|
||||
}
|
||||
|
||||
void DisplayPanel::renderHoverOverlay(const AudioEngine& audio, const UIState& ui,
|
||||
|
||||
@@ -41,6 +41,8 @@ public:
|
||||
|
||||
float spectrumFrac = 0.35f;
|
||||
bool draggingSplit = false;
|
||||
bool showRuler = false;
|
||||
float rulerWidth_ = 0.0f; // current ruler width in pixels (0 when hidden)
|
||||
|
||||
private:
|
||||
void handleSpectrumInput(AudioEngine& audio, UIState& ui,
|
||||
|
||||
@@ -61,6 +61,38 @@ void Measurements::findPeaks(const std::vector<float>& spectrumDB, int maxN,
|
||||
}
|
||||
}
|
||||
|
||||
void Measurements::pushPeakTrace(const std::vector<float>& spectrumDB,
|
||||
double sampleRate, bool isIQ, int fftSize) {
|
||||
if (spectrumDB.empty()) return;
|
||||
|
||||
constexpr int kMaxHistory = 4096;
|
||||
if (static_cast<int>(peakHistBins_.size()) < kMaxHistory)
|
||||
peakHistBins_.resize(kMaxHistory, -1);
|
||||
|
||||
auto it = std::max_element(spectrumDB.begin(), spectrumDB.end());
|
||||
int traceBin = static_cast<int>(std::distance(spectrumDB.begin(), it));
|
||||
|
||||
// Optionally restrict to a frequency range.
|
||||
int bins = static_cast<int>(spectrumDB.size());
|
||||
if (traceMinFreq > 0.0f || traceMaxFreq > 0.0f) {
|
||||
double fMin = isIQ ? -sampleRate / 2.0 : 0.0;
|
||||
double fMax = isIQ ? sampleRate / 2.0 : sampleRate / 2.0;
|
||||
int loB = 0, hiB = bins - 1;
|
||||
if (traceMinFreq > 0.0f)
|
||||
loB = std::max(0, static_cast<int>((traceMinFreq - fMin) / (fMax - fMin) * bins));
|
||||
if (traceMaxFreq > 0.0f)
|
||||
hiB = std::min(bins - 1, static_cast<int>((traceMaxFreq - fMin) / (fMax - fMin) * bins));
|
||||
if (loB <= hiB) {
|
||||
auto rangeIt = std::max_element(spectrumDB.begin() + loB, spectrumDB.begin() + hiB + 1);
|
||||
traceBin = static_cast<int>(std::distance(spectrumDB.begin(), rangeIt));
|
||||
}
|
||||
}
|
||||
|
||||
peakHistIdx_ = (peakHistIdx_ + 1) % kMaxHistory;
|
||||
peakHistBins_[peakHistIdx_] = traceBin;
|
||||
if (peakHistLen_ < kMaxHistory) ++peakHistLen_;
|
||||
}
|
||||
|
||||
void Measurements::update(const std::vector<float>& spectrumDB,
|
||||
double sampleRate, bool isIQ, int fftSize) {
|
||||
lastSampleRate_ = sampleRate;
|
||||
@@ -71,32 +103,6 @@ void Measurements::update(const std::vector<float>& spectrumDB,
|
||||
globalPeak_.bin = bin;
|
||||
globalPeak_.dB = *it;
|
||||
globalPeak_.freq = binToFreq(bin, sampleRate, isIQ, fftSize);
|
||||
|
||||
// Push into peak history circular buffer (with optional freq range filter)
|
||||
constexpr int kMaxHistory = 4096;
|
||||
if (static_cast<int>(peakHistBins_.size()) < kMaxHistory)
|
||||
peakHistBins_.resize(kMaxHistory, -1);
|
||||
|
||||
// Find peak within the trace frequency range
|
||||
int traceBin = bin;
|
||||
int bins = static_cast<int>(spectrumDB.size());
|
||||
if (traceMinFreq > 0.0f || traceMaxFreq > 0.0f) {
|
||||
double fMin = isIQ ? -sampleRate / 2.0 : 0.0;
|
||||
double fMax = isIQ ? sampleRate / 2.0 : sampleRate / 2.0;
|
||||
int loB = 0, hiB = bins - 1;
|
||||
if (traceMinFreq > 0.0f)
|
||||
loB = std::max(0, static_cast<int>((traceMinFreq - fMin) / (fMax - fMin) * bins));
|
||||
if (traceMaxFreq > 0.0f)
|
||||
hiB = std::min(bins - 1, static_cast<int>((traceMaxFreq - fMin) / (fMax - fMin) * bins));
|
||||
if (loB <= hiB) {
|
||||
auto rangeIt = std::max_element(spectrumDB.begin() + loB, spectrumDB.begin() + hiB + 1);
|
||||
traceBin = static_cast<int>(std::distance(spectrumDB.begin(), rangeIt));
|
||||
}
|
||||
}
|
||||
|
||||
peakHistIdx_ = (peakHistIdx_ + 1) % kMaxHistory;
|
||||
peakHistBins_[peakHistIdx_] = traceBin;
|
||||
if (peakHistLen_ < kMaxHistory) ++peakHistLen_;
|
||||
}
|
||||
|
||||
if (!enabled) { peaks_.clear(); return; }
|
||||
|
||||
@@ -18,6 +18,10 @@ public:
|
||||
void update(const std::vector<float>& spectrumDB,
|
||||
double sampleRate, bool isIQ, int fftSize);
|
||||
|
||||
// Push a single peak trace entry for this spectrum (call once per waterfall line).
|
||||
void pushPeakTrace(const std::vector<float>& spectrumDB,
|
||||
double sampleRate, bool isIQ, int fftSize);
|
||||
|
||||
// Draw markers on the spectrum display area.
|
||||
void draw(const SpectrumDisplay& specDisplay,
|
||||
float posX, float posY, float sizeX, float sizeY,
|
||||
|
||||
@@ -4,6 +4,11 @@
|
||||
|
||||
#ifdef __EMSCRIPTEN__
|
||||
#include <GLES2/gl2.h>
|
||||
#elif defined(_WIN32)
|
||||
#define WIN32_LEAN_AND_MEAN
|
||||
#define NOMINMAX
|
||||
#include <windows.h>
|
||||
#include <GL/gl.h>
|
||||
#else
|
||||
#include <GL/gl.h>
|
||||
#endif
|
||||
@@ -55,9 +60,11 @@ static void buildPolyline(const std::vector<float>& spectrumDB,
|
||||
bool isIQ, FreqScale freqScale,
|
||||
float posX, float posY, float sizeX, float sizeY,
|
||||
float viewLo, float viewHi,
|
||||
std::vector<ImVec2>& outPoints) {
|
||||
std::vector<ImVec2>& outPoints,
|
||||
int minPixPerBin = 1) {
|
||||
int bins = static_cast<int>(spectrumDB.size());
|
||||
int displayPts = std::min(bins, static_cast<int>(sizeX));
|
||||
int maxPts = std::max(1, static_cast<int>(sizeX) / std::max(1, minPixPerBin));
|
||||
int displayPts = std::min(bins, maxPts);
|
||||
if (displayPts < 2) displayPts = 2;
|
||||
|
||||
outPoints.resize(displayPts);
|
||||
@@ -103,7 +110,8 @@ void SpectrumDisplay::draw(const std::vector<std::vector<float>>& spectra,
|
||||
FreqScale freqScale,
|
||||
float posX, float posY,
|
||||
float sizeX, float sizeY,
|
||||
float viewLo, float viewHi) const {
|
||||
float viewLo, float viewHi,
|
||||
int minPixPerBin) const {
|
||||
if (spectra.empty() || spectra[0].empty() || sizeX <= 0 || sizeY <= 0) return;
|
||||
|
||||
ImDrawList* dl = ImGui::GetWindowDrawList();
|
||||
@@ -141,7 +149,7 @@ void SpectrumDisplay::draw(const std::vector<std::vector<float>>& spectra,
|
||||
dl->AddLine({posX, y}, {posX + sizeX, y}, gridCol);
|
||||
char label[16];
|
||||
std::snprintf(label, sizeof(label), "%.0f", db);
|
||||
dl->AddText({posX + 2, y - ImGui::GetTextLineHeight()}, textCol, label);
|
||||
dl->AddText({posX + 2 - dbLabelOffsetX, y - ImGui::GetTextLineHeight()}, textCol, label);
|
||||
}
|
||||
|
||||
// ── Vertical (frequency) grid — adapt count to available width ──
|
||||
@@ -173,7 +181,7 @@ void SpectrumDisplay::draw(const std::vector<std::vector<float>>& spectra,
|
||||
if (spectra[ch].empty()) continue;
|
||||
buildPolyline(spectra[ch], minDB, maxDB,
|
||||
isIQ, freqScale, posX, posY, sizeX, sizeY,
|
||||
viewLo, viewHi, allPoints[ch]);
|
||||
viewLo, viewHi, allPoints[ch], minPixPerBin);
|
||||
}
|
||||
|
||||
// Draw spectra: all fills first, then all lines on top.
|
||||
@@ -232,7 +240,7 @@ void SpectrumDisplay::draw(const std::vector<std::vector<float>>& spectra,
|
||||
ImU32 col = (st.lineColor & 0x00FFFFFF) | 0x90000000;
|
||||
buildPolyline(peakHold_[ch], minDB, maxDB,
|
||||
isIQ, freqScale, posX, posY, sizeX, sizeY,
|
||||
viewLo, viewHi, phPoints);
|
||||
viewLo, viewHi, phPoints, minPixPerBin);
|
||||
if (phPoints.size() >= 2)
|
||||
dl->AddPolyline(phPoints.data(), static_cast<int>(phPoints.size()),
|
||||
col, ImDrawFlags_None, 1.0f);
|
||||
|
||||
@@ -22,7 +22,8 @@ public:
|
||||
double sampleRate, bool isIQ,
|
||||
FreqScale freqScale,
|
||||
float posX, float posY, float sizeX, float sizeY,
|
||||
float viewLo = 0.0f, float viewHi = 1.0f) const;
|
||||
float viewLo = 0.0f, float viewHi = 1.0f,
|
||||
int minPixPerBin = 1) const;
|
||||
|
||||
// Convenience: single-channel draw (backward compat).
|
||||
void draw(const std::vector<float>& spectrumDB,
|
||||
@@ -49,6 +50,7 @@ public:
|
||||
bool additiveBlend = true; // additive color mixing for multi-channel
|
||||
bool peakHoldEnable = false;
|
||||
float peakHoldDecay = 20.0f; // dB/second decay rate
|
||||
float dbLabelOffsetX = 0.0f; // shift dB labels left (into ruler area)
|
||||
|
||||
private:
|
||||
// One peak-hold trace per channel.
|
||||
|
||||
@@ -17,6 +17,7 @@ struct UIState {
|
||||
|
||||
int waterfallChannel = 0;
|
||||
bool waterfallMultiCh = true;
|
||||
int specMinPixPerBin = 1; // min screen pixels per spectrum bin (1 = no decimation)
|
||||
std::array<bool, kMaxChannels> channelEnabled = {true,true,true,true,true,true,true,true};
|
||||
// Complementary pairs: colors at indices 0+1, 2+3, 4+5, 6+7 sum to white.
|
||||
std::array<ImVec4, kMaxChannels> channelColors = {{
|
||||
|
||||
@@ -2,7 +2,15 @@
|
||||
|
||||
#include "core/Types.h"
|
||||
#include "ui/ColorMap.h"
|
||||
#ifdef _WIN32
|
||||
#define WIN32_LEAN_AND_MEAN
|
||||
#define NOMINMAX
|
||||
#include <windows.h>
|
||||
#endif
|
||||
#include <GL/gl.h>
|
||||
#ifndef GL_CLAMP_TO_EDGE // for Windows
|
||||
#define GL_CLAMP_TO_EDGE 0x812F
|
||||
#endif
|
||||
#include <vector>
|
||||
#include <deque>
|
||||
|
||||
|
||||
Reference in New Issue
Block a user