|
|
|
/*
|
|
|
|
* Copyright 2013-2020 Software Radio Systems Limited
|
|
|
|
*
|
|
|
|
* This file is part of srsLTE.
|
|
|
|
*
|
|
|
|
* srsLTE is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Affero General Public License as
|
|
|
|
* published by the Free Software Foundation, either version 3 of
|
|
|
|
* the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* srsLTE 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 Affero General Public License for more details.
|
|
|
|
*
|
|
|
|
* A copy of the GNU Affero General Public License can be found in
|
|
|
|
* the LICENSE file in the top-level directory of this distribution
|
|
|
|
* and at http://www.gnu.org/licenses/.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "sched_ue_ded_test_suite.h"
|
|
|
|
#include "lib/include/srslte/mac/pdu.h"
|
|
|
|
#include "srslte/common/test_common.h"
|
|
|
|
|
|
|
|
namespace srsenb {
|
|
|
|
|
|
|
|
using phich_t = sched_interface::ul_sched_phich_t;
|
|
|
|
using pusch_t = sched_interface::ul_sched_data_t;
|
|
|
|
using pdsch_t = sched_interface::dl_sched_data_t;
|
|
|
|
|
|
|
|
const sched_interface::ue_cfg_t::cc_cfg_t* sim_ue_ctxt_t::get_cc_cfg(uint32_t enb_cc_idx) const
|
|
|
|
{
|
|
|
|
// TODO: verify SCELL Act was received
|
|
|
|
auto it =
|
|
|
|
std::find_if(ue_cfg.supported_cc_list.begin(),
|
|
|
|
ue_cfg.supported_cc_list.end(),
|
|
|
|
[enb_cc_idx](const sched_interface::ue_cfg_t::cc_cfg_t& cc) { return cc.enb_cc_idx == enb_cc_idx; });
|
|
|
|
return (it == ue_cfg.supported_cc_list.end()) ? nullptr : &(*it);
|
|
|
|
}
|
|
|
|
|
|
|
|
int sim_ue_ctxt_t::enb_to_ue_cc_idx(uint32_t enb_cc_idx) const
|
|
|
|
{
|
|
|
|
auto it =
|
|
|
|
std::find_if(ue_cfg.supported_cc_list.begin(),
|
|
|
|
ue_cfg.supported_cc_list.end(),
|
|
|
|
[enb_cc_idx](const sched_interface::ue_cfg_t::cc_cfg_t& cc) { return cc.enb_cc_idx == enb_cc_idx; });
|
|
|
|
return it == ue_cfg.supported_cc_list.end() ? -1 : std::distance(ue_cfg.supported_cc_list.begin(), it);
|
|
|
|
}
|
|
|
|
|
|
|
|
const pusch_t* find_pusch_grant(uint16_t rnti, const sched_interface::ul_sched_res_t& ul_cc_res)
|
|
|
|
{
|
|
|
|
const pusch_t* ptr = std::find_if(&ul_cc_res.pusch[0],
|
|
|
|
&ul_cc_res.pusch[ul_cc_res.nof_dci_elems],
|
|
|
|
[rnti](const pusch_t& pusch) { return pusch.dci.rnti == rnti; });
|
|
|
|
return ptr == &ul_cc_res.pusch[ul_cc_res.nof_dci_elems] ? nullptr : ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
const pdsch_t* find_pdsch_grant(uint16_t rnti, const sched_interface::dl_sched_res_t& dl_cc_res)
|
|
|
|
{
|
|
|
|
const pdsch_t* ptr = std::find_if(&dl_cc_res.data[0],
|
|
|
|
&dl_cc_res.data[dl_cc_res.nof_data_elems],
|
|
|
|
[rnti](const pdsch_t& pdsch) { return pdsch.dci.rnti == rnti; });
|
|
|
|
return ptr == &dl_cc_res.data[dl_cc_res.nof_data_elems] ? nullptr : ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
int test_pdsch_grant(const sim_ue_ctxt_t& ue_ctxt,
|
|
|
|
srslte::tti_point tti_rx,
|
|
|
|
uint32_t enb_cc_idx,
|
|
|
|
const sched_interface::dl_sched_data_t& pdsch)
|
|
|
|
{
|
|
|
|
auto* cc_cfg = ue_ctxt.get_cc_cfg(enb_cc_idx);
|
|
|
|
|
|
|
|
// TEST: Check if CC is configured and active
|
|
|
|
CONDERROR(cc_cfg == nullptr or not cc_cfg->active, "PDSCH allocation for disabled or unavailable cc\n");
|
|
|
|
CONDERROR(pdsch.dci.ue_cc_idx != std::distance(&ue_ctxt.ue_cfg.supported_cc_list.front(), cc_cfg),
|
|
|
|
"Inconsistent enb_cc_idx -> ue_cc_idx mapping\n");
|
|
|
|
|
|
|
|
// TEST: DCI is consistent with current UE DL harq state
|
|
|
|
auto& h = ue_ctxt.cc_list[pdsch.dci.ue_cc_idx].dl_harqs[pdsch.dci.pid];
|
|
|
|
uint32_t nof_retx = sched_utils::get_nof_retx(pdsch.dci.tb[0].rv); // 0..3
|
|
|
|
if (h.nof_txs == 0 or h.ndi != pdsch.dci.tb[0].ndi) {
|
|
|
|
// It is newtx
|
|
|
|
CONDERROR(nof_retx != 0, "Invalid rv index for new tx\n");
|
|
|
|
CONDERROR(h.active, "DL newtx for already active DL harq pid=%d\n", h.pid);
|
|
|
|
} else {
|
|
|
|
// it is retx
|
|
|
|
CONDERROR(sched_utils::get_rvidx(h.nof_retxs + 1) != (uint32_t)pdsch.dci.tb[0].rv, "Invalid rv index for retx\n");
|
|
|
|
CONDERROR(not h.active, "retx for inactive dl harq pid=%d\n", h.pid);
|
|
|
|
CONDERROR(to_tx_dl_ack(h.last_tti_rx) > tti_rx, "harq pid=%d reused too soon\n", h.pid);
|
|
|
|
CONDERROR(h.nof_retxs + 1 > ue_ctxt.ue_cfg.maxharq_tx,
|
|
|
|
"The number of retx=%d exceeded its max=%d\n",
|
|
|
|
h.nof_retxs + 1,
|
|
|
|
ue_ctxt.ue_cfg.maxharq_tx);
|
|
|
|
CONDERROR(h.dci_loc.L != pdsch.dci.location.L, "Harq DCI aggregation level changed.\n");
|
|
|
|
CONDERROR(h.tbs != pdsch.tbs[0], "TBS changed during HARQ retx\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
return SRSLTE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
int test_dl_sched_result(const sim_enb_ctxt_t& enb_ctxt, const sf_output_res_t& sf_out)
|
|
|
|
{
|
|
|
|
for (uint32_t cc = 0; cc < enb_ctxt.cell_params->size(); ++cc) {
|
|
|
|
for (uint32_t i = 0; i < sf_out.dl_cc_result[cc].nof_data_elems; ++i) {
|
|
|
|
const sched_interface::dl_sched_data_t& data = sf_out.dl_cc_result[cc].data[i];
|
|
|
|
CONDERROR(
|
|
|
|
enb_ctxt.ue_db.count(data.dci.rnti) == 0, "Allocated DL grant for non-existent rnti=0x%x\n", data.dci.rnti);
|
|
|
|
TESTASSERT(test_pdsch_grant(*enb_ctxt.ue_db.at(data.dci.rnti), sf_out.tti_rx, cc, data) == SRSLTE_SUCCESS);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return SRSLTE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
int test_ul_sched_result(const sim_enb_ctxt_t& enb_ctxt, const sf_output_res_t& sf_out)
|
|
|
|
{
|
|
|
|
uint32_t pid = to_tx_ul(sf_out.tti_rx).to_uint() % (FDD_HARQ_DELAY_UL_MS + FDD_HARQ_DELAY_DL_MS);
|
|
|
|
|
|
|
|
for (size_t cc = 0; cc < enb_ctxt.cell_params->size(); ++cc) {
|
|
|
|
const auto* phich_begin = &sf_out.ul_cc_result[cc].phich[0];
|
|
|
|
const auto* phich_end = &sf_out.ul_cc_result[cc].phich[sf_out.ul_cc_result[cc].nof_phich_elems];
|
|
|
|
const auto* pusch_begin = &sf_out.ul_cc_result[cc].pusch[0];
|
|
|
|
const auto* pusch_end = &sf_out.ul_cc_result[cc].pusch[sf_out.ul_cc_result[cc].nof_dci_elems];
|
|
|
|
|
|
|
|
// TEST: rnti must exist for all PHICH
|
|
|
|
CONDERROR(std::any_of(phich_begin,
|
|
|
|
phich_end,
|
|
|
|
[&enb_ctxt](const phich_t& phich) { return enb_ctxt.ue_db.count(phich.rnti) == 0; }),
|
|
|
|
"Scheduled PHICH does not have associated rnti\n");
|
|
|
|
|
|
|
|
// TEST: rnti must exist for all PUSCH
|
|
|
|
CONDERROR(std::any_of(pusch_begin,
|
|
|
|
pusch_end,
|
|
|
|
[&enb_ctxt](const pusch_t& pusch) { return enb_ctxt.ue_db.count(pusch.dci.rnti) == 0; }),
|
|
|
|
"Scheduled PUSCH does not have associated rnti.");
|
|
|
|
|
|
|
|
for (const auto& ue_pair : enb_ctxt.ue_db) {
|
|
|
|
const auto& ue = *ue_pair.second;
|
|
|
|
uint16_t rnti = ue.rnti;
|
|
|
|
int ue_cc_idx = ue.enb_to_ue_cc_idx(cc);
|
|
|
|
|
|
|
|
const phich_t* phich_ptr =
|
|
|
|
std::find_if(phich_begin, phich_end, [rnti](const phich_t& phich) { return phich.rnti == rnti; });
|
|
|
|
phich_ptr = phich_ptr == phich_end ? nullptr : phich_ptr;
|
|
|
|
const pusch_t* pusch_ptr = find_pusch_grant(rnti, sf_out.ul_cc_result[cc]);
|
|
|
|
|
|
|
|
// TEST: Check that idle CCs do not receive PUSCH grants or PHICH
|
|
|
|
if (ue_cc_idx < 0 or not ue.ue_cfg.supported_cc_list[ue_cc_idx].active) {
|
|
|
|
CONDERROR(phich_ptr != nullptr, "PHICH cannot be allocated in idle cells\n");
|
|
|
|
CONDERROR(pusch_ptr != nullptr, "PUSCH cannot be allocated in idle cells\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
const auto& h = ue.cc_list[ue_cc_idx].ul_harqs[pid];
|
|
|
|
bool phich_ack = phich_ptr != nullptr and phich_ptr->phich == phich_t::ACK;
|
|
|
|
bool is_msg3 = h.first_tti_rx == ue.msg3_tti_rx and h.nof_txs == h.nof_retxs + 1;
|
|
|
|
bool last_retx = h.nof_retxs + 1 >= (is_msg3 ? sf_out.cc_params[0].cfg.maxharq_msg3tx : ue.ue_cfg.maxharq_tx);
|
|
|
|
bool h_inactive = (not h.active) or (phich_ack or last_retx);
|
|
|
|
|
|
|
|
// TEST: Already active UL HARQs have to receive PHICH
|
|
|
|
CONDERROR(
|
|
|
|
h.active and phich_ptr == nullptr, "PHICH not received for rnti=0x%x active UL HARQ pid=%d\n", rnti, pid);
|
|
|
|
CONDERROR(not h.active and phich_ptr != nullptr,
|
|
|
|
"PHICH for rnti=0x%x corresponds to inactive UL HARQ pid=%d\n",
|
|
|
|
rnti,
|
|
|
|
pid);
|
|
|
|
|
|
|
|
// TEST: absent PUSCH grants for active DL HARQs must be either ACKs, last retx, or interrupted HARQs
|
|
|
|
if ((phich_ptr != nullptr) and (pusch_ptr == nullptr)) {
|
|
|
|
CONDERROR(not h_inactive, "PHICH NACK received for rnti=0x%x but no PUSCH retx reallocated\n", rnti);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pusch_ptr != nullptr) {
|
|
|
|
CONDERROR(pusch_ptr->dci.ue_cc_idx != (uint32_t)ue_cc_idx, "Inconsistent enb_cc_idx -> ue_cc_idx mapping\n");
|
|
|
|
|
|
|
|
// TEST: DCI is consistent with current UE UL harq state
|
|
|
|
uint32_t nof_retx = sched_utils::get_nof_retx(pusch_ptr->dci.tb.rv); // 0..3
|
|
|
|
|
|
|
|
if (h.nof_txs == 0 or h.ndi != pusch_ptr->dci.tb.ndi) {
|
|
|
|
// newtx
|
|
|
|
CONDERROR(nof_retx != 0, "Invalid rv index for new tx\n");
|
|
|
|
CONDERROR(pusch_ptr->current_tx_nb != 0, "UL HARQ retxs need to have been previously transmitted\n");
|
|
|
|
CONDERROR(not h_inactive, "New tx for already active UL HARQ\n");
|
|
|
|
} else {
|
|
|
|
CONDERROR(pusch_ptr->current_tx_nb == 0, "UL retx has to have nof tx > 0\n");
|
|
|
|
if (not h.active) {
|
|
|
|
// the HARQ is being resumed
|
|
|
|
CONDERROR(not pusch_ptr->needs_pdcch, "Resumed UL HARQs need to be signalled in PDCCH\n");
|
|
|
|
}
|
|
|
|
if (pusch_ptr->needs_pdcch) {
|
|
|
|
// adaptive retx
|
|
|
|
CONDERROR(h.tbs != pusch_ptr->tbs, "TBS changed during HARQ retx\n");
|
|
|
|
CONDERROR(sched_utils::get_rvidx(h.nof_retxs + 1) != (uint32_t)pusch_ptr->dci.tb.rv,
|
|
|
|
"Invalid rv index for retx\n");
|
|
|
|
} else {
|
|
|
|
// non-adaptive retx
|
|
|
|
CONDERROR(pusch_ptr->dci.type2_alloc.riv != h.riv, "Non-adaptive retx must keep the same riv\n");
|
|
|
|
}
|
|
|
|
CONDERROR(to_tx_ul(h.last_tti_rx) > sf_out.tti_rx, "UL harq pid=%d was reused too soon\n", h.pid);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return SRSLTE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
int test_ra(const sim_enb_ctxt_t& enb_ctxt, const sf_output_res_t& sf_out)
|
|
|
|
{
|
|
|
|
for (uint32_t cc = 0; cc < enb_ctxt.cell_params->size(); ++cc) {
|
|
|
|
const auto& dl_cc_res = sf_out.dl_cc_result[cc];
|
|
|
|
const auto& ul_cc_res = sf_out.ul_cc_result[cc];
|
|
|
|
for (const auto& ue_pair : enb_ctxt.ue_db) {
|
|
|
|
const auto& ue = *ue_pair.second;
|
|
|
|
uint16_t rnti = ue.rnti;
|
|
|
|
uint32_t ue_cc_idx = ue.enb_to_ue_cc_idx(cc);
|
|
|
|
|
|
|
|
if (ue_cc_idx != 0) {
|
|
|
|
// only check for RAR/Msg3/Msg4 presence for a UE's PCell
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// TEST: RAR allocation
|
|
|
|
uint32_t rar_win_size = (*enb_ctxt.cell_params)[cc].prach_rar_window;
|
|
|
|
srslte::tti_interval rar_window{ue.prach_tti_rx + 3, ue.prach_tti_rx + 3 + rar_win_size};
|
|
|
|
srslte::tti_point tti_tx_dl = to_tx_dl(sf_out.tti_rx);
|
|
|
|
|
|
|
|
if (not rar_window.contains(tti_tx_dl)) {
|
|
|
|
CONDERROR(not ue.rar_tti_rx.is_valid() and tti_tx_dl > rar_window.stop(),
|
|
|
|
"rnti=0x%x RAR not scheduled within the RAR Window\n",
|
|
|
|
rnti);
|
|
|
|
for (uint32_t i = 0; i < sf_out.dl_cc_result[cc].nof_rar_elems; ++i) {
|
|
|
|
CONDERROR(sf_out.dl_cc_result[cc].rar[i].dci.rnti == rnti,
|
|
|
|
"No RAR allocations allowed outside of user RAR window\n");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Inside RAR window
|
|
|
|
uint32_t nof_rars = ue.rar_tti_rx.is_valid() ? 1 : 0;
|
|
|
|
for (uint32_t i = 0; i < dl_cc_res.nof_rar_elems; ++i) {
|
|
|
|
for (uint32_t j = 0; j < dl_cc_res.rar[i].nof_grants; ++j) {
|
|
|
|
const auto& data = dl_cc_res.rar[i].msg3_grant[j].data;
|
|
|
|
if (data.prach_tti == (uint32_t)ue.prach_tti_rx.to_uint() and data.preamble_idx == ue.preamble_idx) {
|
|
|
|
CONDERROR(rnti != data.temp_crnti, "RAR grant C-RNTI does not match the expected.\n");
|
|
|
|
nof_rars++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
CONDERROR(nof_rars > 1, "There was more than one RAR for the same user\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
// TEST: Msg3 was allocated
|
|
|
|
if (ue.rar_tti_rx.is_valid() and not ue.msg3_tti_rx.is_valid()) {
|
|
|
|
// RAR scheduled, Msg3 not yet scheduled
|
|
|
|
srslte::tti_point expected_msg3_tti_rx = ue.rar_tti_rx + MSG3_DELAY_MS;
|
|
|
|
CONDERROR(expected_msg3_tti_rx < sf_out.tti_rx, "No UL msg3 alloc was made\n");
|
|
|
|
|
|
|
|
if (expected_msg3_tti_rx == sf_out.tti_rx) {
|
|
|
|
// Msg3 should exist
|
|
|
|
uint32_t msg3_count = 0;
|
|
|
|
for (uint32_t i = 0; i < ul_cc_res.nof_dci_elems; ++i) {
|
|
|
|
if (ul_cc_res.pusch[i].dci.rnti == rnti) {
|
|
|
|
msg3_count++;
|
|
|
|
CONDERROR(ul_cc_res.pusch[i].needs_pdcch, "Msg3 allocations do not require PDCCH\n");
|
|
|
|
CONDERROR(ue.msg3_riv != ul_cc_res.pusch[i].dci.type2_alloc.riv,
|
|
|
|
"The Msg3 was not allocated in the expected PRBs.\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
CONDERROR(msg3_count == 0, "Msg3 was not transmitted.\n");
|
|
|
|
CONDERROR(msg3_count > 1, "Only one Msg3 allower per user.\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TEST: Check Msg4
|
|
|
|
if (ue.msg3_tti_rx.is_valid() and not ue.msg4_tti_rx.is_valid()) {
|
|
|
|
// Msg3 scheduled, but Msg4 not yet scheduled
|
|
|
|
uint32_t msg4_count = 0;
|
|
|
|
for (uint32_t i = 0; i < dl_cc_res.nof_data_elems; ++i) {
|
|
|
|
if (dl_cc_res.data[i].dci.rnti == rnti) {
|
|
|
|
CONDERROR(to_tx_dl(sf_out.tti_rx) < to_tx_ul(ue.msg3_tti_rx),
|
|
|
|
"Msg4 cannot be scheduled without Msg3 being tx\n");
|
|
|
|
for (uint32_t j = 0; j < dl_cc_res.data[i].nof_pdu_elems[0]; ++j) {
|
|
|
|
if (dl_cc_res.data[i].pdu[0][j].lcid == (uint32_t)srslte::dl_sch_lcid::CON_RES_ID) {
|
|
|
|
// ConRes found
|
|
|
|
CONDERROR(dl_cc_res.data[i].dci.format != SRSLTE_DCI_FORMAT1, "ConRes must be format1\n");
|
|
|
|
msg4_count++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
CONDERROR(msg4_count == 0, "No ConRes CE was scheduled in Msg4\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
CONDERROR(msg4_count > 1, "Duplicate ConRes CE for the same rnti\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (not ue.msg4_tti_rx.is_valid()) {
|
|
|
|
// TEST: No UL allocs except for Msg3 before Msg4
|
|
|
|
for (uint32_t i = 0; i < ul_cc_res.nof_dci_elems; ++i) {
|
|
|
|
if (ul_cc_res.pusch[i].dci.rnti == rnti) {
|
|
|
|
CONDERROR(not ue.rar_tti_rx.is_valid(), "No UL allocs before RAR allowed\n");
|
|
|
|
srslte::tti_point expected_msg3_tti = ue.rar_tti_rx + MSG3_DELAY_MS;
|
|
|
|
CONDERROR(expected_msg3_tti > sf_out.tti_rx, "No UL allocs before Msg3 is scheduled\n");
|
|
|
|
if (expected_msg3_tti < sf_out.tti_rx) {
|
|
|
|
bool msg3_retx =
|
|
|
|
((ue.msg3_tti_rx - expected_msg3_tti) % (FDD_HARQ_DELAY_UL_MS + FDD_HARQ_DELAY_DL_MS)) == 0;
|
|
|
|
CONDERROR(not msg3_retx, "No UL txs allowed except for Msg3 before user received Msg4\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TEST: No DL allocs before Msg3
|
|
|
|
if (not ue.msg3_tti_rx.is_valid()) {
|
|
|
|
for (uint32_t i = 0; i < dl_cc_res.nof_data_elems; ++i) {
|
|
|
|
CONDERROR(dl_cc_res.data[i].dci.rnti == rnti, "No DL data allocs allowed before Msg3 is scheduled\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TEST: Ensure there are no spurious RARs that do not belong to any user
|
|
|
|
for (uint32_t i = 0; i < dl_cc_res.nof_rar_elems; ++i) {
|
|
|
|
for (uint32_t j = 0; j < dl_cc_res.rar[i].nof_grants; ++j) {
|
|
|
|
uint32_t prach_tti = dl_cc_res.rar[i].msg3_grant[j].data.prach_tti;
|
|
|
|
uint32_t preamble_idx = dl_cc_res.rar[i].msg3_grant[j].data.preamble_idx;
|
|
|
|
auto it = std::find_if(
|
|
|
|
enb_ctxt.ue_db.begin(), enb_ctxt.ue_db.end(), [&](const std::pair<uint16_t, const sim_ue_ctxt_t*>& u) {
|
|
|
|
const auto& ctxt = *u.second;
|
|
|
|
return ctxt.preamble_idx == preamble_idx and ((uint32_t)ctxt.prach_tti_rx.to_uint() == prach_tti);
|
|
|
|
});
|
|
|
|
CONDERROR(it == enb_ctxt.ue_db.end(), "There was a RAR allocation with no associated user");
|
|
|
|
CONDERROR(it->second->ue_cfg.supported_cc_list[0].enb_cc_idx != cc, "The allocated RAR is in the wrong cc\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return SRSLTE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool is_in_measgap(srslte::tti_point tti, uint32_t period, uint32_t offset)
|
|
|
|
{
|
|
|
|
uint32_t T = period / 10;
|
|
|
|
return (tti.sfn() % T == offset / 10) and (tti.sf_idx() == offset % 10);
|
|
|
|
}
|
|
|
|
|
|
|
|
int test_meas_gaps(const sim_enb_ctxt_t& enb_ctxt, const sf_output_res_t& sf_out)
|
|
|
|
{
|
|
|
|
for (uint32_t cc = 0; cc < enb_ctxt.cell_params->size(); ++cc) {
|
|
|
|
const auto& dl_cc_res = sf_out.dl_cc_result[cc];
|
|
|
|
const auto& ul_cc_res = sf_out.ul_cc_result[cc];
|
|
|
|
for (const auto& ue_pair : enb_ctxt.ue_db) {
|
|
|
|
const auto& ue = *ue_pair.second;
|
|
|
|
uint16_t rnti = ue.rnti;
|
|
|
|
uint32_t ue_cc_idx = ue.enb_to_ue_cc_idx(cc);
|
|
|
|
srslte::tti_point tti_tx_ul = to_tx_ul(sf_out.tti_rx), tti_tx_dl = to_tx_dl(sf_out.tti_rx),
|
|
|
|
tti_tx_dl_ack = to_tx_dl_ack(sf_out.tti_rx), tti_tx_phich = to_tx_ul_ack(sf_out.tti_rx);
|
|
|
|
|
|
|
|
if (ue_cc_idx != 0 or ue.ue_cfg.measgap_period == 0) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (is_in_measgap(tti_tx_ul, ue.ue_cfg.measgap_period, ue.ue_cfg.measgap_offset) or
|
|
|
|
is_in_measgap(tti_tx_phich, ue.ue_cfg.measgap_period, ue.ue_cfg.measgap_offset)) {
|
|
|
|
const pusch_t* pusch_ptr = find_pusch_grant(rnti, ul_cc_res);
|
|
|
|
CONDERROR(pusch_ptr != nullptr, "PUSCH grants and PHICH cannot fall in UE measGap\n");
|
|
|
|
}
|
|
|
|
if (is_in_measgap(tti_tx_dl, ue.ue_cfg.measgap_period, ue.ue_cfg.measgap_offset) or
|
|
|
|
is_in_measgap(tti_tx_dl_ack, ue.ue_cfg.measgap_period, ue.ue_cfg.measgap_offset)) {
|
|
|
|
const pdsch_t* pdsch_ptr = find_pdsch_grant(rnti, dl_cc_res);
|
|
|
|
CONDERROR(pdsch_ptr != nullptr, "PDSCH grants and respective ACKs cannot fall in UE measGap\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return SRSLTE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
int test_all_ues(const sim_enb_ctxt_t& enb_ctxt, const sf_output_res_t& sf_out)
|
|
|
|
{
|
|
|
|
TESTASSERT(test_dl_sched_result(enb_ctxt, sf_out) == SRSLTE_SUCCESS);
|
|
|
|
|
|
|
|
TESTASSERT(test_ul_sched_result(enb_ctxt, sf_out) == SRSLTE_SUCCESS);
|
|
|
|
|
|
|
|
TESTASSERT(test_ra(enb_ctxt, sf_out) == SRSLTE_SUCCESS);
|
|
|
|
|
|
|
|
TESTASSERT(test_meas_gaps(enb_ctxt, sf_out) == SRSLTE_SUCCESS);
|
|
|
|
|
|
|
|
return SRSLTE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace srsenb
|