311 lines
7.6 KiB
C++
311 lines
7.6 KiB
C++
|
|
#include <string.h>
|
|
|
|
#include "srslte/srslte.h"
|
|
#include "mac/scheduler_metric.h"
|
|
|
|
#define Error(fmt, ...) log_h->error_line(__FILE__, __LINE__, fmt, ##__VA_ARGS__)
|
|
#define Warning(fmt, ...) log_h->warning_line(__FILE__, __LINE__, fmt, ##__VA_ARGS__)
|
|
#define Info(fmt, ...) log_h->info_line(__FILE__, __LINE__, fmt, ##__VA_ARGS__)
|
|
#define Debug(fmt, ...) log_h->debug_line(__FILE__, __LINE__, fmt, ##__VA_ARGS__)
|
|
|
|
namespace srsenb {
|
|
|
|
|
|
|
|
/*****************************************************************
|
|
*
|
|
* Downlink Metric
|
|
*
|
|
*****************************************************************/
|
|
|
|
uint32_t dl_metric_rr::calc_rbg_mask(bool mask[MAX_RBG])
|
|
{
|
|
// Build RBG bitmask
|
|
uint32_t rbg_bitmask = 0;
|
|
for (uint32_t n=0;n<total_rb;n++) {
|
|
if (mask[n]) {
|
|
rbg_bitmask |= (1<<(total_rb-1-n));
|
|
}
|
|
}
|
|
return rbg_bitmask;
|
|
}
|
|
|
|
uint32_t dl_metric_rr::count_rbg(uint32_t mask) {
|
|
uint32_t count = 0;
|
|
while(mask > 0) {
|
|
if ((mask & 1) == 1) {
|
|
count++;
|
|
}
|
|
mask >>= 1;
|
|
}
|
|
return count;
|
|
}
|
|
|
|
uint32_t dl_metric_rr::get_required_rbg(sched_ue *user, uint32_t tti)
|
|
{
|
|
dl_harq_proc *h = user->get_pending_dl_harq(tti);
|
|
if (h) {
|
|
return count_rbg(h->get_rbgmask());
|
|
}
|
|
uint32_t pending_data = user->get_pending_dl_new_data(current_tti);
|
|
return user->get_required_prb_dl(pending_data, nof_ctrl_symbols);
|
|
}
|
|
|
|
void dl_metric_rr::new_tti(std::map<uint16_t,sched_ue> &ue_db, uint32_t start_rb, uint32_t nof_rb, uint32_t nof_ctrl_symbols_, uint32_t tti)
|
|
{
|
|
|
|
total_rb = start_rb+nof_rb;
|
|
for (uint32_t i=0;i<total_rb;i++) {
|
|
if (i<start_rb) {
|
|
used_rb[i] = true;
|
|
} else {
|
|
used_rb[i] = false;
|
|
}
|
|
}
|
|
available_rb = nof_rb;
|
|
used_rb_mask = calc_rbg_mask(used_rb);
|
|
current_tti = tti;
|
|
nof_ctrl_symbols = nof_ctrl_symbols_;
|
|
|
|
nof_users_with_data = 0;
|
|
for(std::map<uint16_t, sched_ue>::iterator iter=ue_db.begin(); iter!=ue_db.end(); ++iter) {
|
|
sched_ue *user = (sched_ue*) &iter->second;
|
|
if (user->get_pending_dl_new_data(current_tti) || user->get_pending_dl_harq(current_tti)) {
|
|
user->ue_idx = nof_users_with_data;
|
|
nof_users_with_data++;
|
|
}
|
|
}
|
|
}
|
|
|
|
bool dl_metric_rr::new_allocation(uint32_t nof_rbg, uint32_t *rbgmask) {
|
|
bool mask_bit[MAX_RBG];
|
|
bzero(mask_bit, sizeof(bool)*MAX_RBG);
|
|
|
|
for (uint32_t i=0;i<total_rb && nof_rbg > 0;i++) {
|
|
if (used_rb[i]) {
|
|
mask_bit[i] = false;
|
|
} else {
|
|
mask_bit[i] = true;
|
|
nof_rbg--;
|
|
}
|
|
}
|
|
if (rbgmask) {
|
|
*rbgmask = calc_rbg_mask(mask_bit);
|
|
}
|
|
return (nof_rbg == 0);
|
|
}
|
|
|
|
void dl_metric_rr::update_allocation(uint32_t new_mask) {
|
|
used_rb_mask |= new_mask;
|
|
for (uint32_t n=0;n<total_rb;n++) {
|
|
if (used_rb_mask & (1<<(total_rb-1-n))) {
|
|
used_rb[n] = true;
|
|
} else {
|
|
used_rb[n] = false;
|
|
}
|
|
}
|
|
}
|
|
|
|
bool dl_metric_rr::allocation_is_valid(uint32_t mask)
|
|
{
|
|
return (mask & used_rb_mask);
|
|
}
|
|
|
|
dl_harq_proc* dl_metric_rr::get_user_allocation(sched_ue *user)
|
|
{
|
|
uint32_t pending_data = user->get_pending_dl_new_data(current_tti);
|
|
dl_harq_proc *h = user->get_pending_dl_harq(current_tti);
|
|
|
|
// Time-domain RR scheduling
|
|
if (pending_data || h) {
|
|
if (nof_users_with_data) {
|
|
if (nof_users_with_data == 2) {
|
|
}
|
|
if ((current_tti%nof_users_with_data) != user->ue_idx) {
|
|
return NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Schedule retx if we have space
|
|
if (h) {
|
|
uint32_t retx_mask = h->get_rbgmask();
|
|
// If can schedule the same mask, do it
|
|
if (!allocation_is_valid(retx_mask)) {
|
|
update_allocation(retx_mask);
|
|
return h;
|
|
}
|
|
// If not, try to find another mask in the current tti
|
|
uint32_t nof_rbg = count_rbg(retx_mask);
|
|
if (nof_rbg < available_rb) {
|
|
if (new_allocation(nof_rbg, &retx_mask)) {
|
|
update_allocation(retx_mask);
|
|
h->set_rbgmask(retx_mask);
|
|
return h;
|
|
}
|
|
}
|
|
}
|
|
// If could not schedule the reTx, or there wasn't any pending retx, find an empty PID
|
|
h = user->get_empty_dl_harq();
|
|
if (h) {
|
|
// Allocate resources based on pending data
|
|
if (pending_data) {
|
|
uint32_t pending_rb = user->get_required_prb_dl(pending_data, nof_ctrl_symbols);
|
|
uint32_t newtx_mask = 0;
|
|
new_allocation(pending_rb, &newtx_mask);
|
|
if (newtx_mask) {
|
|
update_allocation(newtx_mask);
|
|
h->set_rbgmask(newtx_mask);
|
|
return h;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************
|
|
*
|
|
* Uplink Metric
|
|
*
|
|
*****************************************************************/
|
|
|
|
void ul_metric_rr::new_tti(std::map<uint16_t,sched_ue> &ue_db, uint32_t nof_rb_, uint32_t tti)
|
|
{
|
|
current_tti = tti;
|
|
nof_rb = nof_rb_;
|
|
available_rb = nof_rb_;
|
|
bzero(used_rb, nof_rb*sizeof(bool));
|
|
|
|
nof_users_with_data = 0;
|
|
for(std::map<uint16_t, sched_ue>::iterator iter=ue_db.begin(); iter!=ue_db.end(); ++iter) {
|
|
sched_ue *user = (sched_ue*) &iter->second;
|
|
if (user->get_pending_ul_new_data(current_tti) || !user->get_ul_harq(current_tti)->is_empty()) {
|
|
user->ue_idx = nof_users_with_data;
|
|
nof_users_with_data++;
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
bool ul_metric_rr::allocation_is_valid(ul_harq_proc::ul_alloc_t alloc)
|
|
{
|
|
if (alloc.RB_start+alloc.L > nof_rb) {
|
|
return false;
|
|
}
|
|
for (uint32_t n=alloc.RB_start;n<alloc.RB_start+alloc.L;n++) {
|
|
if (used_rb[n]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool ul_metric_rr::new_allocation(uint32_t L, ul_harq_proc::ul_alloc_t* alloc)
|
|
{
|
|
|
|
bzero(alloc, sizeof(ul_harq_proc::ul_alloc_t));
|
|
for (uint32_t n=0;n<nof_rb && alloc->L < L;n++) {
|
|
if (!used_rb[n] && alloc->L == 0) {
|
|
alloc->RB_start = n;
|
|
}
|
|
if (!used_rb[n]) {
|
|
alloc->L++;
|
|
} else if (alloc->L > 0) {
|
|
// avoid edges
|
|
if (n < 3) {
|
|
alloc->RB_start = 0;
|
|
alloc->L = 0;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (!alloc->L) {
|
|
return 0;
|
|
}
|
|
|
|
// Make sure L is allowed by SC-FDMA modulation
|
|
while (!srslte_dft_precoding_valid_prb(alloc->L)) {
|
|
alloc->L--;
|
|
}
|
|
return alloc->L == L;
|
|
}
|
|
|
|
void ul_metric_rr::update_allocation(ul_harq_proc::ul_alloc_t alloc)
|
|
{
|
|
if (alloc.L > available_rb) {
|
|
return;
|
|
}
|
|
if (alloc.RB_start + alloc.L > nof_rb) {
|
|
return;
|
|
}
|
|
for (uint32_t n=alloc.RB_start;n<alloc.RB_start+alloc.L;n++) {
|
|
used_rb[n] = true;
|
|
}
|
|
available_rb -= alloc.L;
|
|
}
|
|
|
|
ul_harq_proc* ul_metric_rr::get_user_allocation(sched_ue *user)
|
|
{
|
|
// Time-domain RR scheduling
|
|
uint32_t pending_data = user->get_pending_ul_new_data(current_tti);
|
|
ul_harq_proc *h = user->get_ul_harq(current_tti);
|
|
|
|
if (pending_data || !h->is_empty()) {
|
|
if (nof_users_with_data) {
|
|
if ((current_tti%nof_users_with_data) != user->ue_idx) {
|
|
return NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Schedule retx if we have space
|
|
|
|
if (!h->is_empty()) {
|
|
|
|
ul_harq_proc::ul_alloc_t alloc = h->get_alloc();
|
|
|
|
// If can schedule the same mask, do it
|
|
if (allocation_is_valid(alloc)) {
|
|
update_allocation(alloc);
|
|
h->same_alloc();
|
|
return h;
|
|
}
|
|
|
|
// If not, try to find another mask in the current tti
|
|
if (new_allocation(alloc.L, &alloc)) {
|
|
update_allocation(alloc);
|
|
h->set_alloc(alloc);
|
|
return h;
|
|
}
|
|
}
|
|
// If could not schedule the reTx, or there wasn't any pending retx, find an empty PID
|
|
if (h->is_empty()) {
|
|
// Allocate resources based on pending data
|
|
if (pending_data) {
|
|
uint32_t pending_rb = user->get_required_prb_ul(pending_data);
|
|
ul_harq_proc::ul_alloc_t alloc;
|
|
new_allocation(pending_rb, &alloc);
|
|
if (alloc.L) {
|
|
update_allocation(alloc);
|
|
h->set_alloc(alloc);
|
|
return h;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
|
|
|
|
}
|