|
|
@ -129,7 +129,7 @@ uint32_t bsr_proc::get_buffer_state()
|
|
|
|
return buffer;
|
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Checks if data is available for a a channel with higher priority than others
|
|
|
|
// Checks if data is available for a channel with higher priority than others
|
|
|
|
bool bsr_proc::check_highest_channel()
|
|
|
|
bool bsr_proc::check_highest_channel()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
for (int i = 0; i < NOF_LCG; i++) {
|
|
|
|
for (int i = 0; i < NOF_LCG; i++) {
|
|
|
@ -170,7 +170,7 @@ bool bsr_proc::check_new_data()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
for (int i = 0; i < NOF_LCG; i++) {
|
|
|
|
for (int i = 0; i < NOF_LCG; i++) {
|
|
|
|
// If there was no data available in any LCID belonging to this LCG
|
|
|
|
// If there was no data available in any LCID belonging to this LCG
|
|
|
|
if (!get_buffer_state_lcg(i)) {
|
|
|
|
if (get_buffer_state_lcg(i) == 0) {
|
|
|
|
for (std::map<uint32_t, lcid_t>::iterator iter = lcgs[i].begin(); iter != lcgs[i].end(); ++iter) {
|
|
|
|
for (std::map<uint32_t, lcid_t>::iterator iter = lcgs[i].begin(); iter != lcgs[i].end(); ++iter) {
|
|
|
|
if (iter->second.new_buffer > 0) {
|
|
|
|
if (iter->second.new_buffer > 0) {
|
|
|
|
Debug("BSR: New data available for lcid=%d\n", iter->first);
|
|
|
|
Debug("BSR: New data available for lcid=%d\n", iter->first);
|
|
|
|