-
Notifications
You must be signed in to change notification settings - Fork 106
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
update firmware for tx control signals output on pmod
added dsp flow example
- Loading branch information
David Michaeli
committed
Mar 16, 2024
1 parent
21a9733
commit 1b34c56
Showing
20 changed files
with
25,756 additions
and
25,693 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,15 @@ | ||
| cmake_minimum_required(VERSION 3.2) | ||
| project(test_app) | ||
|
|
||
| # Find the package using pkg-config | ||
| find_package(PkgConfig REQUIRED) | ||
| pkg_check_modules(CARIBOULITE REQUIRED cariboulite) | ||
|
|
||
| # Add the executable | ||
| add_executable(test_app main.cpp) | ||
|
|
||
| # Include directories from the cariboulite package | ||
| target_include_directories(test_app PRIVATE ${CARIBOULITE_INCLUDE_DIRS}) | ||
|
|
||
| # Link against the cariboulite library | ||
| target_link_libraries(test_app PRIVATE ${CARIBOULITE_LIBRARIES} -lcariboulite) |
165 changes: 165 additions & 0 deletions
165
examples/cpp_api/async_sample_process/circular_buffer.hpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,165 @@ | ||
| #ifndef __CIRC_BUFFER_H__ | ||
| #define __CIRC_BUFFER_H__ | ||
|
|
||
| #include <string.h> | ||
| #include <thread> | ||
| #include <mutex> | ||
| #include <condition_variable> | ||
| #include <chrono> | ||
| #include <atomic> | ||
|
|
||
| #define IS_POWER_OF_2(x) (!((x) == 0) && !((x) & ((x) - 1))) | ||
| #define MIN(x,y) ((x)>(y)?(y):(x)) | ||
|
|
||
|
|
||
| template <class T> | ||
| class circular_buffer { | ||
| public: | ||
| circular_buffer(size_t size, bool override_write = true, bool block_read = true) | ||
| { | ||
| max_size_ = size; | ||
| if (!IS_POWER_OF_2(max_size_)) | ||
| { | ||
| max_size_ = next_power_of_2(max_size_); | ||
| } | ||
| buf_ = new T[max_size_]; | ||
| override_write_ = override_write; | ||
| block_read_ = block_read; | ||
| } | ||
|
|
||
| ~circular_buffer() | ||
| { | ||
| std::unique_lock<std::mutex> lock(mutex_); | ||
| delete []buf_; | ||
| } | ||
|
|
||
| size_t put(const T *data, size_t length) | ||
| { | ||
| std::lock_guard<std::mutex> lock(mutex_); | ||
|
|
||
| if ((max_size_ - size()) < length && override_write_) | ||
| { | ||
| // pop the amount of data the is needed | ||
| tail_ += length - (max_size_ - size()); | ||
| } | ||
|
|
||
| size_t len = MIN(length, max_size_ - head_ + tail_); | ||
| auto l = MIN(len, max_size_ - (head_ & (max_size_ - 1))); | ||
|
|
||
| memcpy(buf_ + (head_ & (max_size_ - 1)), data, l * sizeof(T)); | ||
| memcpy(buf_, data + l, (len - l) * sizeof(T)); | ||
|
|
||
| head_ += len; | ||
|
|
||
| if (block_read_) | ||
| { | ||
| cond_var_.notify_one(); | ||
| } | ||
|
|
||
| return len; | ||
| } | ||
|
|
||
| size_t get(T *data, size_t length, int timeout_us = 100000) | ||
| { | ||
| std::unique_lock<std::mutex> lock(mutex_); | ||
|
|
||
| if (block_read_) | ||
| { | ||
| cond_var_.wait_for(lock, std::chrono::microseconds(timeout_us), [&]() | ||
| { | ||
| // Acquire the lock only if | ||
| // we got enough items | ||
| return size() >= length; | ||
| }); | ||
|
|
||
| if (size() < length) | ||
| { | ||
| return 0; | ||
| } | ||
| } | ||
|
|
||
| size_t len = MIN(length, head_ - tail_); | ||
| auto l = MIN(len, max_size_ - (tail_ & (max_size_ - 1))); | ||
|
|
||
| if (data != NULL) | ||
| { | ||
| memcpy(data, buf_ + (tail_ & (max_size_ - 1)), l * sizeof(T)); | ||
| memcpy(data + l, buf_, (len - l) * sizeof(T)); | ||
| } | ||
| tail_ += len; | ||
| return len; | ||
| } | ||
|
|
||
| void put(T item) | ||
| { | ||
| put(&item, 1); | ||
| } | ||
|
|
||
| T get() | ||
| { | ||
| T item; | ||
| get(&item, 1); | ||
| return item; | ||
| } | ||
|
|
||
| void reset() | ||
| { | ||
| std::unique_lock<std::mutex> lock(mutex_); | ||
| head_ = tail_ = 0; | ||
| } | ||
|
|
||
| inline bool empty() | ||
| { | ||
| return head_ == tail_; | ||
| } | ||
|
|
||
| inline bool full() | ||
| { | ||
| return size() == capacity(); | ||
| } | ||
|
|
||
| inline size_t capacity() const | ||
| { | ||
| return max_size_; | ||
| } | ||
|
|
||
| size_t size() | ||
| { | ||
| return (head_ - tail_); | ||
| } | ||
|
|
||
| void print_buffer() | ||
| { | ||
| std::unique_lock<std::mutex> lock(mutex_); | ||
| size_t t = tail_; | ||
| int i = 0; | ||
| while (t < head_) | ||
| { | ||
| printf("%d => %d\n", i++, (int)buf_[t++&(max_size_-1)]); | ||
| } | ||
| } | ||
|
|
||
| private: | ||
| uint32_t next_power_of_2 (uint32_t x) | ||
| { | ||
| uint32_t power = 1; | ||
| while(power < x) | ||
| { | ||
| power <<= 1; | ||
| } | ||
| return power; | ||
| } | ||
|
|
||
| private: | ||
| std::mutex mutex_; | ||
| std::condition_variable cond_var_; | ||
|
|
||
| T* buf_; | ||
| size_t head_ = 0; | ||
| size_t tail_ = 0; | ||
| size_t max_size_; | ||
| bool override_write_; | ||
| bool block_read_; | ||
| }; | ||
|
|
||
| #endif |
Oops, something went wrong.