Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
O
OpenXG-RAN
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
canghaiwuhen
OpenXG-RAN
Commits
8c7d9413
Commit
8c7d9413
authored
Jun 24, 2020
by
Robert Schmidt
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Bugfix RR DL: a retx UE might not be allocated again
parent
864fa84b
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
33 additions
and
35 deletions
+33
-35
openair2/LAYER2/MAC/pre_processor.c
openair2/LAYER2/MAC/pre_processor.c
+33
-35
No files found.
openair2/LAYER2/MAC/pre_processor.c
View file @
8c7d9413
...
@@ -83,15 +83,22 @@ int round_robin_dl(module_id_t Mod_id,
...
@@ -83,15 +83,22 @@ int round_robin_dl(module_id_t Mod_id,
const
int
N_RBG
=
to_rbg
(
RC
.
mac
[
Mod_id
]
->
common_channels
[
CC_id
].
mib
->
message
.
dl_Bandwidth
);
const
int
N_RBG
=
to_rbg
(
RC
.
mac
[
Mod_id
]
->
common_channels
[
CC_id
].
mib
->
message
.
dl_Bandwidth
);
const
int
RBGsize
=
get_min_rb_unit
(
Mod_id
,
CC_id
);
const
int
RBGsize
=
get_min_rb_unit
(
Mod_id
,
CC_id
);
const
int
RBGlastsize
=
get_rbg_size_last
(
Mod_id
,
CC_id
);
const
int
RBGlastsize
=
get_rbg_size_last
(
Mod_id
,
CC_id
);
int
num_ue_req
=
0
;
UE_info_t
*
UE_info
=
&
RC
.
mac
[
Mod_id
]
->
UE_info
;
UE_info_t
*
UE_info
=
&
RC
.
mac
[
Mod_id
]
->
UE_info
;
int
rbg
=
0
;
int
rbg
=
0
;
for
(;
!
rbgalloc_mask
[
rbg
];
rbg
++
)
for
(;
!
rbgalloc_mask
[
rbg
];
rbg
++
)
;
/* fast-forward to first allowed RBG */
;
/* fast-forward to first allowed RBG */
// Calculate the amount of RBs every UE wants to send.
/* just start with the UE after the one we had last time. If it does not
for
(
int
UE_id
=
UE_list
->
head
;
UE_id
>=
0
;
UE_id
=
UE_list
->
next
[
UE_id
])
{
* exist, this will start at the head */
int
g_start_ue_dl
=
data
;
g_start_ue_dl
=
next_ue_list_looped
(
UE_list
,
g_start_ue_dl
);
int
UE_id
=
g_start_ue_dl
;
UE_list_t
UE_sched
;
int
*
cur_UE
=
&
UE_sched
.
head
;
// Allocate retransmissions, and mark UEs with new transmissions
do
{
// check whether there are HARQ retransmissions
// check whether there are HARQ retransmissions
const
COMMON_channels_t
*
cc
=
&
RC
.
mac
[
Mod_id
]
->
common_channels
[
CC_id
];
const
COMMON_channels_t
*
cc
=
&
RC
.
mac
[
Mod_id
]
->
common_channels
[
CC_id
];
const
uint8_t
harq_pid
=
frame_subframe2_dl_harq_pid
(
cc
->
tdd_Config
,
frame
,
subframe
);
const
uint8_t
harq_pid
=
frame_subframe2_dl_harq_pid
(
cc
->
tdd_Config
,
frame
,
subframe
);
...
@@ -100,14 +107,14 @@ int round_robin_dl(module_id_t Mod_id,
...
@@ -100,14 +107,14 @@ int round_robin_dl(module_id_t Mod_id,
if
(
round
!=
8
)
{
// retransmission: allocate
if
(
round
!=
8
)
{
// retransmission: allocate
const
int
nb_rb
=
UE_info
->
UE_template
[
CC_id
][
UE_id
].
nb_rb
[
harq_pid
];
const
int
nb_rb
=
UE_info
->
UE_template
[
CC_id
][
UE_id
].
nb_rb
[
harq_pid
];
if
(
nb_rb
==
0
)
if
(
nb_rb
==
0
)
contin
ue
;
goto
skip_
ue
;
int
nb_rbg
=
(
nb_rb
+
(
nb_rb
%
RBGsize
))
/
RBGsize
;
int
nb_rbg
=
(
nb_rb
+
(
nb_rb
%
RBGsize
))
/
RBGsize
;
// needs more RBGs than we can allocate
// needs more RBGs than we can allocate
if
(
nb_rbg
>
n_rbg_sched
)
{
if
(
nb_rbg
>
n_rbg_sched
)
{
LOG_D
(
MAC
,
LOG_D
(
MAC
,
"retransmission of UE %d needs more RBGs (%d) than we have (%d)
\n
"
,
"retransmission of UE %d needs more RBGs (%d) than we have (%d)
\n
"
,
UE_id
,
nb_rbg
,
n_rbg_sched
);
UE_id
,
nb_rbg
,
n_rbg_sched
);
contin
ue
;
goto
skip_
ue
;
}
}
// ensure that the number of RBs can be contained by the RBGs (!), i.e.
// ensure that the number of RBs can be contained by the RBGs (!), i.e.
// if we allocate the last RBG this one should have the full RBGsize
// if we allocate the last RBG this one should have the full RBGsize
...
@@ -116,12 +123,12 @@ int round_robin_dl(module_id_t Mod_id,
...
@@ -116,12 +123,12 @@ int round_robin_dl(module_id_t Mod_id,
LOG_D
(
MAC
,
LOG_D
(
MAC
,
"retransmission of UE %d needs %d RBs, but the last RBG %d is too small (%d, normal %d)
\n
"
,
"retransmission of UE %d needs %d RBs, but the last RBG %d is too small (%d, normal %d)
\n
"
,
UE_id
,
nb_rb
,
N_RBG
-
1
,
RBGlastsize
,
RBGsize
);
UE_id
,
nb_rb
,
N_RBG
-
1
,
RBGlastsize
,
RBGsize
);
contin
ue
;
goto
skip_
ue
;
}
}
const
uint8_t
cqi
=
ue_ctrl
->
dl_cqi
[
CC_id
];
const
uint8_t
cqi
=
ue_ctrl
->
dl_cqi
[
CC_id
];
const
int
idx
=
CCE_try_allocate_dlsch
(
Mod_id
,
CC_id
,
subframe
,
UE_id
,
cqi
);
const
int
idx
=
CCE_try_allocate_dlsch
(
Mod_id
,
CC_id
,
subframe
,
UE_id
,
cqi
);
if
(
idx
<
0
)
if
(
idx
<
0
)
contin
ue
;
// cannot allocate CCE
goto
skip_
ue
;
// cannot allocate CCE
ue_ctrl
->
pre_dci_dl_pdu_idx
=
idx
;
ue_ctrl
->
pre_dci_dl_pdu_idx
=
idx
;
// retransmissions: directly allocate
// retransmissions: directly allocate
n_rbg_sched
-=
nb_rbg
;
n_rbg_sched
-=
nb_rbg
;
...
@@ -148,35 +155,32 @@ int round_robin_dl(module_id_t Mod_id,
...
@@ -148,35 +155,32 @@ int round_robin_dl(module_id_t Mod_id,
return
n_rbg_sched
;
return
n_rbg_sched
;
for
(;
!
rbgalloc_mask
[
rbg
];
rbg
++
)
/* fast-forward */
;
for
(;
!
rbgalloc_mask
[
rbg
];
rbg
++
)
/* fast-forward */
;
}
else
{
}
else
{
if
(
UE_info
->
UE_template
[
CC_id
][
UE_id
].
dl_buffer_total
>
0
)
if
(
UE_info
->
UE_template
[
CC_id
][
UE_id
].
dl_buffer_total
>
0
)
{
num_ue_req
++
;
*
cur_UE
=
UE_id
;
cur_UE
=
&
UE_sched
.
next
[
UE_id
];
}
}
}
}
if
(
num_ue_req
==
0
)
skip_ue:
return
n_rbg_sched
;
// no UE has a transmission
UE_id
=
next_ue_list_looped
(
UE_list
,
UE_id
);
}
while
(
UE_id
!=
g_start_ue_dl
);
*
cur_UE
=
-
1
;
// mark end
// after allocating retransmissions: build list of UE to allocate.
if
(
UE_sched
.
head
<
0
)
// if start_UE does not exist anymore (detach etc), start at first UE
return
n_rbg_sched
;
// no UE has a transmission
if
(
g_start_ue_dl
==
-
1
)
g_start_ue_dl
=
UE_list
->
head
;
int
UE_id
=
g_start_ue_dl
;
UE_list_t
UE_sched
;
int
*
cur_UE
=
&
UE_sched
.
head
;
int
num_ue_sched
=
0
;
// after allocating retransmissions: pre-allocate CCE, compute number of
max_num_ue
=
min
(
min
(
max_num_ue
,
num_ue_req
),
n_rbg_sched
);
// requested RBGs
max_num_ue
=
min
(
max_num_ue
,
n_rbg_sched
);
int
rb_required
[
MAX_MOBILES_PER_ENB
];
// how much UEs request
int
rb_required
[
MAX_MOBILES_PER_ENB
];
// how much UEs request
while
(
num_ue_sched
<
max_num_ue
)
{
cur_UE
=
&
UE_sched
.
head
;
while
(
UE_info
->
UE_template
[
CC_id
][
UE_id
].
dl_buffer_total
<=
0
)
while
(
*
cur_UE
>=
0
&&
max_num_ue
>
0
)
{
UE_id
=
next_ue_list_looped
(
UE_list
,
UE_id
);
const
int
UE_id
=
*
cur_UE
;
cur_UE
=
&
UE_sched
.
next
[
UE_id
];
// go to next
const
uint8_t
cqi
=
UE_info
->
UE_sched_ctrl
[
UE_id
].
dl_cqi
[
CC_id
];
const
uint8_t
cqi
=
UE_info
->
UE_sched_ctrl
[
UE_id
].
dl_cqi
[
CC_id
];
const
int
idx
=
CCE_try_allocate_dlsch
(
Mod_id
,
CC_id
,
subframe
,
UE_id
,
cqi
);
const
int
idx
=
CCE_try_allocate_dlsch
(
Mod_id
,
CC_id
,
subframe
,
UE_id
,
cqi
);
if
(
idx
<
0
)
{
if
(
idx
<
0
)
{
LOG_D
(
MAC
,
"cannot allocate CCE for UE %d, skipping
\n
"
,
UE_id
);
LOG_D
(
MAC
,
"cannot allocate CCE for UE %d, skipping
\n
"
,
UE_id
);
num_ue_req
--
;
max_num_ue
=
min
(
min
(
max_num_ue
,
num_ue_req
),
n_rbg_sched
);
UE_id
=
next_ue_list_looped
(
UE_list
,
UE_id
);
// next candidate
continue
;
continue
;
}
}
UE_info
->
UE_sched_ctrl
[
UE_id
].
pre_dci_dl_pdu_idx
=
idx
;
UE_info
->
UE_sched_ctrl
[
UE_id
].
pre_dci_dl_pdu_idx
=
idx
;
...
@@ -184,12 +188,9 @@ int round_robin_dl(module_id_t Mod_id,
...
@@ -184,12 +188,9 @@ int round_robin_dl(module_id_t Mod_id,
UE_info
->
eNB_UE_stats
[
CC_id
][
UE_id
].
dlsch_mcs1
=
mcs
;
UE_info
->
eNB_UE_stats
[
CC_id
][
UE_id
].
dlsch_mcs1
=
mcs
;
const
uint32_t
B
=
UE_info
->
UE_template
[
CC_id
][
UE_id
].
dl_buffer_total
;
const
uint32_t
B
=
UE_info
->
UE_template
[
CC_id
][
UE_id
].
dl_buffer_total
;
rb_required
[
UE_id
]
=
find_nb_rb_DL
(
mcs
,
B
,
n_rbg_sched
*
RBGsize
,
RBGsize
);
rb_required
[
UE_id
]
=
find_nb_rb_DL
(
mcs
,
B
,
n_rbg_sched
*
RBGsize
,
RBGsize
);
*
cur_UE
=
UE_id
;
max_num_ue
--
;
cur_UE
=
&
UE_sched
.
next
[
UE_id
];
num_ue_sched
++
;
UE_id
=
next_ue_list_looped
(
UE_list
,
UE_id
);
// next candidate
}
}
*
cur_UE
=
-
1
;
*
cur_UE
=
-
1
;
// not all UEs might be allocated, mark end
/* for one UE after the next: allocate resources */
/* for one UE after the next: allocate resources */
cur_UE
=
&
UE_sched
.
head
;
cur_UE
=
&
UE_sched
.
head
;
...
@@ -214,9 +215,6 @@ int round_robin_dl(module_id_t Mod_id,
...
@@ -214,9 +215,6 @@ int round_robin_dl(module_id_t Mod_id,
for
(
rbg
++
;
!
rbgalloc_mask
[
rbg
];
rbg
++
)
/* fast-forward */
;
for
(
rbg
++
;
!
rbgalloc_mask
[
rbg
];
rbg
++
)
/* fast-forward */
;
}
}
/* just start with the next UE next time */
g_start_ue_dl
=
next_ue_list_looped
(
UE_list
,
g_start_ue_dl
);
return
n_rbg_sched
;
return
n_rbg_sched
;
}
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment