src/memory/memory.c
void update_memory_queues() {
  // here!!! mix the requests
  if(ROUND_ROBIN_TO_L1 && l1_in_buf_count > 0) {
    mem_insert_req_round_robin();
  }

  if(!ALL_FIFO_QUEUES && (cycle_l1q_insert_count > 0)) {
    qsort(mem->l1_queue.base, mem->l1_queue.entry_count,
          sizeof(Mem_Queue_Entry), mem_compare_priority);
    cycle_l1q_insert_count = 0;
  }

  if(!ALL_FIFO_QUEUES && (cycle_mlcq_insert_count > 0)) {
    qsort(mem->mlc_queue.base, mem->mlc_queue.entry_count,
          sizeof(Mem_Queue_Entry), mem_compare_priority);
    cycle_mlcq_insert_count = 0;
  }

  if(!ALL_FIFO_QUEUES && (cycle_busoutq_insert_count > 0)) {
    qsort(mem->bus_out_queue.base, mem->bus_out_queue.entry_count,
          sizeof(Mem_Queue_Entry), mem_compare_priority);
    cycle_busoutq_insert_count = 0;
  }
}
/**
 * @brief Not sure what this func is doing
 *
 */
@brief Not sure what this func is doing
@brief Not sure what this func is doing
void update_memory_queues() {
  if(ROUND_ROBIN_TO_L1 && l1_in_buf_count > 0) {
    mem_insert_req_round_robin();
  }
  if(!ALL_FIFO_QUEUES && (cycle_l1q_insert_count > 0)) {
    qsort(mem->l1_queue.base, mem->l1_queue.entry_count,
          sizeof(Mem_Queue_Entry), mem_compare_priority);
    cycle_l1q_insert_count = 0;
  }
  if(!ALL_FIFO_QUEUES && (cycle_mlcq_insert_count > 0)) {
    qsort(mem->mlc_queue.base, mem->mlc_queue.entry_count,
          sizeof(Mem_Queue_Entry), mem_compare_priority);
    cycle_mlcq_insert_count = 0;
  }
  if(!ALL_FIFO_QUEUES && (cycle_busoutq_insert_count > 0)) {
    qsort(mem->bus_out_queue.base, mem->bus_out_queue.entry_count,
          sizeof(Mem_Queue_Entry), mem_compare_priority);
    cycle_busoutq_insert_count = 0;
  }
}
void update_memory_queues ( ) { if ( ROUND_ROBIN_TO_L1 && l1_in_buf_count > 0 ) { mem_insert_req_round_robin ( ) ; } if ( ! ALL_FIFO_QUEUES && ( cycle_l1q_insert_count > 0 ) ) { qsort ( mem -> l1_queue . base , mem -> l1_queue . entry_count , sizeof ( Mem_Queue_Entry ) , mem_compare_priority ) ; cycle_l1q_insert_count = 0 ; } if ( ! ALL_FIFO_QUEUES && ( cycle_mlcq_insert_count > 0 ) ) { qsort ( mem -> mlc_queue . base , mem -> mlc_queue . entry_count , sizeof ( Mem_Queue_Entry ) , mem_compare_priority ) ; cycle_mlcq_insert_count = 0 ; } if ( ! ALL_FIFO_QUEUES && ( cycle_busoutq_insert_count > 0 ) ) { qsort ( mem -> bus_out_queue . base , mem -> bus_out_queue . entry_count , sizeof ( Mem_Queue_Entry ) , mem_compare_priority ) ; cycle_busoutq_insert_count = 0 ; } }
@brief Not sure what this func is doing
@brief Not sure what this func is doing
// here!!! mix the requests