- 21 May, 2024 40 commits
-
-
hsum authored
The function now utilizes simpler variable names and logic to determine if a given NR P7 request falls within the timing window. The logic for determining if a request is within the timing window is as follows: - The function calculates the absolute difference between the current and received SFN slots, taking into account the possibility of wraparound. - If the absolute difference is greater than half of the maximum SFN slot value, it subtracts this difference from the maximum SFN slot value to get the actual difference. - The function then checks if this difference is less than or equal to the specified timing window. If it is, the request is considered to be within the window. Additionally, the commit updates the function signature to return a boolean value for better readability and consistency. Changes made: - Simplified variable names for readability - Improved logic for handling wraparound scenarios - Updated function signature to return a boolean value
-
hsum authored
This commit refactors the DL TTI request handling in the PNF P7 module and enhances code clarity. Changes made: - Updated the definition of `dl_tti_req` in the `nfapi_pnf_interface.h` header file to directly store the `nfapi_nr_dl_tti_request_t` structure instead of a pointer. - Refactored DL TTI request processing in the `pnf_handle_dl_tti_request` function in `pnf_p7.c` to simplify the code structure and improve readability. - Introduced a static function, `cp_nr_dl_tti_req`, to copy DL TTI request structures, improving code modularity and reducing duplication. - Updated DL TTI request handling to utilize the refactored logic. - Removed unnecessary deallocation of DL TTI request in error handling path to prevent double deallocation.
-
hsum authored
This commit refactors the UL TTI request handling in the PNF P7 module and improves the clarity of function logic. Changes made: - Refactored UL TTI request handling to simplify code structure and improve readability. - Introduced a static function, `cp_nr_ul_tti_req`, to copy UL TTI request structures, improving code modularity and reducing duplication. - Updated UL TTI request processing to utilize the refactored logic. - Removed unnecessary deallocation of UL TTI request in error handling path to prevent double deallocation. Additionally, the commit enhances comments and debug traces for better understanding of the code flow and debugging.
-
chenyi authored
- Process ul_dci whenever the number of ul_dci PDUs in the buffer > 0. - Replace dynamic allocation on the heap with stack allocation. - New function, **`cp_nr_ul_dci_req`**, to copy the **`ul_dci_req`**.
-
Robert Schmidt authored
-
Robert Schmidt authored
-
chenyi authored
-
Robert Schmidt authored
We are required to store multiple PUCCH (e.g., for multiple UEs). However, nr_fill_pucch() automatically freed the previously active PUCCH structure. Of course(!) this does not make sense. However, the problem is that init_nr_transport() allocated only one PUCCH structure. Also this does not make sense to me. The problem was that slot_ahead was 0, which logically cannot happen in this function (because slot_ahead is illogical, we must give the radio some time). The reason is that it uses if_inst->sl_ahead, which, prior to this commit, was not set. The init_nr_transport() function is called normally from main() through init_eNB_afterRU(). In this case, we initialize if_inst->sl_ahead to what is set in main(). In the PNF case, however, we call init_nr_transport() from the PNF thread, when receiving the start request. In the main(), we wait for this to happen, before setting if_inst->sl_ahead. Hence, initializing this variable (which we should safely be able to do) before solves the problem.
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
Co-authored-by: hsum <ming-hong.hsu@eurecom.fr>
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-
Robert Schmidt authored
-