#ifdef SYSTEMC
/*
 * $Id: Decod_queue_function_one_fifo_genMealy_decod_out.cpp 115 2009-04-20 21:29:17Z rosiere $
 *
 * [ Description ]
 * 
 */

#include "Behavioural/Core/Multi_Front_end/Front_end/Decod_unit/Decod_queue/include/Decod_queue.h"

namespace morpheo                    {
namespace behavioural {
namespace core {
namespace multi_front_end {
namespace front_end {
namespace decod_unit {
namespace decod_queue {


#undef  FUNCTION
#define FUNCTION "Decod_queue::function_one_fifo_genMealy_decod_out"
  void Decod_queue::function_one_fifo_genMealy_decod_out (void)
  {
    log_begin(Decod_queue,FUNCTION);
    log_function(Decod_queue,FUNCTION,_name.c_str());

    Tcontrol_t val [_param->_nb_inst_decod];
    for (uint32_t i=0; i<_param->_nb_inst_decod; i++)
      {
	val                    [i] = 0;
	internal_DECOD_OUT_VAL [i] = 0;
	internal_DECOD_OUT_ACK [i] = 0;
      }

    if (not reg_QUEUE->empty())
      for (uint32_t i=0; i<_param->_nb_inst_decod; i++)
        {
          uint32_t index = reg_LAST_SLOT + i;

          // Stop
          if (index >= _param->_nb_inst_decod)
            break;

          if (reg_QUEUE->front()->_val [index])
            {
              log_printf(TRACE,Decod_queue,FUNCTION,_("  * Queue is not empty, slot [%d] is valid."),i);
              
              Tcontext_t context         = reg_QUEUE->front()->_context_id    [index];
              Tdepth_t   depth           = reg_QUEUE->front()->_depth         [index];
              Tdepth_t   depth_min       = (_param->_have_port_depth)?PORT_READ(in_DEPTH_MIN [context]):0;
              Tdepth_t   depth_max       = (_param->_have_port_depth)?PORT_READ(in_DEPTH_MAX [context]):0;
              Tcontrol_t depth_full      = PORT_READ(in_DEPTH_FULL[context]);

              // is a valid instruction ?
              // If DEPTH_CURRENT :
              // equal at     DEPTH_MIN            -> not speculative
              // not include ]DEPTH_MIN:DEPTH_MAX] -> previous branch miss
              //     include ]DEPTH_MIN:DEPTH_MAX] -> speculative
              
              // All case
              // ....... min ...X... max ....... OK
              // ....... min ....... max ...X... KO
              // ...X... min ....... max ....... KO
              // ....... max ....... min ...X... OK
              // ...X... max ....... min ....... OK
              // ....... max ...X... min ....... KO
              
	      Tcontrol_t is_valid = true;
//               Tcontrol_t   is_valid      = ((depth == depth_min) or
//                                             depth_full or
//                                             ((depth_min <= depth_max)?
//                                              ((depth >= depth_min) and (depth <=depth_max)):
//                                              ((depth >= depth_min) or  (depth <=depth_max))));
              //Tcontrol_t is_valid        = ((depth == depth_min) or 
              //                              ((depth_min < depth_max)?
              //                               (depth<=depth_max):
              //                               ((depth > depth_min) or (depth <= depth_max))));
              //Tcontrol_t is_valid        = depth <= depth_max;

              log_printf(TRACE,Decod_queue,FUNCTION,"    * is_valid : %d",is_valid);
              log_printf(TRACE,Decod_queue,FUNCTION,"      * context      : %d",context);
              log_printf(TRACE,Decod_queue,FUNCTION,"      * depth        : %d",depth);
              log_printf(TRACE,Decod_queue,FUNCTION,"      * depth_min    : %d",depth_min);
              log_printf(TRACE,Decod_queue,FUNCTION,"      * depth_max    : %d",depth_max);
              log_printf(TRACE,Decod_queue,FUNCTION,"      * depth_full   : %d",depth_full);
#ifdef DEBUG
              log_printf(TRACE,Decod_queue,FUNCTION,"      * address      : 0x%x (0x%x)",reg_QUEUE->front()->_address     [index],reg_QUEUE->front()->_address     [index]<<2);
#endif
              log_printf(TRACE,Decod_queue,FUNCTION,"      * address_next : 0x%x (0x%x)",reg_QUEUE->front()->_address_next[index],reg_QUEUE->front()->_address_next[index]<<2);
              internal_DECOD_OUT_VAL [index] = 1; // in all case, val is set (entry is not empty, and instruction is valid)
              if (is_valid)
                {
                  val                    [i]     = 1;
                  internal_DECOD_OUT_ACK [index] = PORT_READ(in_DECOD_OUT_ACK [i]);
                }
              else
                {
                  // Consume the instruction (to erase)
                  internal_DECOD_OUT_ACK [index] = 1;
                }
            }
      }

    for (uint32_t i=0; i<_param->_nb_inst_decod; i++)
      {
        log_printf(TRACE,Decod_queue,FUNCTION,"  * DECOD_OUT_VAL : %d",val [i]);
        
        PORT_WRITE(out_DECOD_OUT_VAL [i],val [i]);
      }

    log_end(Decod_queue,FUNCTION);
  };

}; // end namespace decod_queue
}; // end namespace decod_unit
}; // end namespace front_end
}; // end namespace multi_front_end
}; // end namespace core

}; // end namespace behavioural
}; // end namespace morpheo              
#endif
