[78] | 1 | #ifdef SYSTEMC |
---|
| 2 | /* |
---|
| 3 | * $Id: Update_Prediction_Table_transition.cpp 97 2008-12-19 15:34:00Z rosiere $ |
---|
| 4 | * |
---|
| 5 | * [ Description ] |
---|
| 6 | * |
---|
| 7 | */ |
---|
| 8 | |
---|
| 9 | #include "Behavioural/Core/Multi_Front_end/Front_end/Prediction_unit/Update_Prediction_Table/include/Update_Prediction_Table.h" |
---|
| 10 | |
---|
| 11 | namespace morpheo { |
---|
| 12 | namespace behavioural { |
---|
| 13 | namespace core { |
---|
| 14 | namespace multi_front_end { |
---|
| 15 | namespace front_end { |
---|
| 16 | namespace prediction_unit { |
---|
| 17 | namespace update_prediction_table { |
---|
| 18 | |
---|
| 19 | #undef FUNCTION |
---|
| 20 | #define FUNCTION "Update_Prediction_Table::transition" |
---|
| 21 | void Update_Prediction_Table::transition (void) |
---|
| 22 | { |
---|
[88] | 23 | log_begin(Update_Prediction_Table,FUNCTION); |
---|
| 24 | log_function(Update_Prediction_Table,FUNCTION,_name.c_str()); |
---|
[78] | 25 | |
---|
[81] | 26 | if (PORT_READ(in_NRESET) == 0) |
---|
| 27 | { |
---|
[88] | 28 | // Initialisation |
---|
| 29 | |
---|
| 30 | reg_UPDATE_PRIORITY = 0; |
---|
| 31 | |
---|
| 32 | // All pointer is set at 0 |
---|
[81] | 33 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 34 | { |
---|
[88] | 35 | for (uint32_t j=0; j<_param->_size_ufpt_queue[i]; ++j) |
---|
| 36 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._state = UPDATE_FETCH_PREDICTION_STATE_EMPTY; |
---|
| 37 | reg_UFPT_BOTTOM [i] = 0; |
---|
| 38 | reg_UFPT_TOP [i] = 0; |
---|
| 39 | reg_UFPT_UPDATE [i] = 0; |
---|
| 40 | reg_UFPT_NB_NEED_UPDATE [i] = 0; |
---|
| 41 | |
---|
| 42 | for (uint32_t j=0; j<_param->_size_upt_queue[i]; ++j) |
---|
| 43 | reg_UPDATE_PREDICTION_TABLE [i][j]._state = UPDATE_PREDICTION_STATE_EMPTY; |
---|
| 44 | reg_UPT_BOTTOM [i] = 0; |
---|
| 45 | reg_UPT_TOP [i] = 0; |
---|
[95] | 46 | reg_UPT_TOP_EVENT [i] = 0; |
---|
[88] | 47 | reg_UPT_UPDATE [i] = 0; |
---|
| 48 | |
---|
| 49 | reg_IS_ACCURATE [i] = true; |
---|
[94] | 50 | |
---|
[88] | 51 | reg_EVENT_STATE [i] = EVENT_STATE_OK; |
---|
| 52 | } |
---|
[81] | 53 | } |
---|
| 54 | else |
---|
| 55 | { |
---|
[94] | 56 | bool flush_UFPT [_param->_nb_context]; |
---|
| 57 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 58 | flush_UFPT [i] = false; |
---|
| 59 | |
---|
[81] | 60 | // =================================================================== |
---|
[88] | 61 | // =====[ GARBAGE COLLECTOR ]========================================= |
---|
| 62 | // =================================================================== |
---|
| 63 | |
---|
| 64 | // Each cycle, if the most lastest branch have update all prediction struction (state = end), free this slot |
---|
| 65 | // * Update state -> new status is "empty" |
---|
| 66 | // * Update pointer (bottom and accurate) |
---|
| 67 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * GARBAGE COLLECTOR"); |
---|
| 68 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 69 | { |
---|
| 70 | // UPDATE_FETCH_PREDICTION_TABLE |
---|
| 71 | { |
---|
| 72 | uint32_t bottom = reg_UFPT_BOTTOM [i]; |
---|
| 73 | |
---|
| 74 | // Test if state is end |
---|
| 75 | if (reg_UPDATE_FETCH_PREDICTION_TABLE [i][bottom]._state == UPDATE_FETCH_PREDICTION_STATE_END) |
---|
| 76 | { |
---|
| 77 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UFPT [%d][%d]",i,bottom); |
---|
| 78 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UFPT [%d][%d].state = UPDATE_FETCH_PREDICTION_STATE_EMPTY",i,bottom); |
---|
| 79 | |
---|
| 80 | // Free slot |
---|
| 81 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][bottom]._state = UPDATE_FETCH_PREDICTION_STATE_EMPTY; |
---|
| 82 | // Update pointer |
---|
| 83 | reg_UFPT_BOTTOM [i] = (bottom+1)%_param->_size_ufpt_queue[i]; |
---|
| 84 | } |
---|
| 85 | } |
---|
| 86 | |
---|
| 87 | // UPDATE_PREDICTION_TABLE |
---|
| 88 | { |
---|
| 89 | uint32_t bottom = reg_UPT_BOTTOM [i]; |
---|
[95] | 90 | bool end_ok = (reg_UPDATE_PREDICTION_TABLE [i][bottom]._state == UPDATE_PREDICTION_STATE_END_OK); |
---|
| 91 | bool end_ko = (reg_UPDATE_PREDICTION_TABLE [i][bottom]._state == UPDATE_PREDICTION_STATE_END_KO); |
---|
| 92 | |
---|
[88] | 93 | // Test if state is end |
---|
[95] | 94 | if (end_ok or end_ko) |
---|
[88] | 95 | { |
---|
| 96 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d]",i,bottom); |
---|
| 97 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d]._state = UPDATE_PREDICTION_STATE_EMPTY",i,bottom); |
---|
| 98 | |
---|
| 99 | // Free slot |
---|
| 100 | reg_UPDATE_PREDICTION_TABLE [i][bottom]._state = UPDATE_PREDICTION_STATE_EMPTY; |
---|
[95] | 101 | |
---|
[88] | 102 | // Update pointer |
---|
| 103 | reg_UPT_BOTTOM [i] = (bottom+1)%_param->_size_upt_queue[i]; |
---|
[95] | 104 | // if (bottom = reg_UPT_UPDATE [i]) |
---|
| 105 | // reg_UPT_UPDATE [i] = reg_UPT_BOTTOM [i]; |
---|
| 106 | if (end_ko) // free |
---|
| 107 | { |
---|
| 108 | reg_UPT_TOP [i] = reg_UPT_TOP_EVENT [i]; |
---|
| 109 | reg_UPT_UPDATE [i] = reg_UPT_TOP_EVENT [i]; |
---|
| 110 | } |
---|
[88] | 111 | } |
---|
| 112 | } |
---|
| 113 | } |
---|
| 114 | |
---|
| 115 | // =================================================================== |
---|
[81] | 116 | // =====[ PREDICT ]=================================================== |
---|
| 117 | // =================================================================== |
---|
[88] | 118 | |
---|
| 119 | // An ifetch_unit compute next cycle and have an branch : predict_val is set |
---|
| 120 | // * Alloc new entry -> new status is "wait decod" |
---|
| 121 | // * Save input (to restore in miss or error) |
---|
| 122 | // * Update pointer |
---|
| 123 | |
---|
[81] | 124 | for (uint32_t i=0; i<_param->_nb_inst_predict; i++) |
---|
| 125 | if (PORT_READ(in_PREDICT_VAL[i]) and internal_PREDICT_ACK [i]) |
---|
| 126 | { |
---|
| 127 | Tcontext_t context = (_param->_have_port_context_id)?PORT_READ(in_PREDICT_CONTEXT_ID [i]):0; |
---|
[88] | 128 | uint32_t top = internal_PREDICT_UPDATE_PREDICTION_ID [i]; |
---|
[81] | 129 | |
---|
[88] | 130 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * PREDICT[%d] - Accepted",i); |
---|
| 131 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * context : %d",context); |
---|
| 132 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * top : %d",top); |
---|
[81] | 133 | |
---|
[88] | 134 | #ifdef DEBUG_TEST |
---|
| 135 | if (reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._state != UPDATE_FETCH_PREDICTION_STATE_EMPTY) |
---|
| 136 | throw ERRORMORPHEO(FUNCTION,_("Predict : invalid state.")); |
---|
| 137 | #endif |
---|
[81] | 138 | |
---|
[88] | 139 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UFPT [%d][%d].state <- UPDATE_FETCH_PREDICTION_STATE_WAIT_DECOD (predict)",context,top); |
---|
| 140 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._state = UPDATE_FETCH_PREDICTION_STATE_WAIT_DECOD; |
---|
| 141 | |
---|
| 142 | Tbranch_condition_t condition = PORT_READ(in_PREDICT_BTB_CONDITION [i]); |
---|
| 143 | |
---|
| 144 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._condition = condition; |
---|
| 145 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._address_src = PORT_READ(in_PREDICT_BTB_ADDRESS_SRC [i]); |
---|
| 146 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._address_dest = PORT_READ(in_PREDICT_BTB_ADDRESS_DEST [i]); |
---|
| 147 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._last_take = PORT_READ(in_PREDICT_BTB_LAST_TAKE [i]); |
---|
| 148 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._is_accurate = PORT_READ(in_PREDICT_BTB_IS_ACCURATE [i]); |
---|
| 149 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._history = (_param->_have_port_history)?PORT_READ(in_PREDICT_DIR_HISTORY [i]):0; |
---|
| 150 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._address_ras = PORT_READ(in_PREDICT_RAS_ADDRESS [i]); |
---|
| 151 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][top]._index_ras = PORT_READ(in_PREDICT_RAS_INDEX [i]); |
---|
| 152 | |
---|
| 153 | reg_UFPT_TOP [context] = (top+1)%_param->_size_ufpt_queue [context]; |
---|
| 154 | // reg_UFPT_UPDATE [context] = reg_UFPT_TOP [context]; |
---|
| 155 | if (need_update(condition)) |
---|
| 156 | reg_UFPT_NB_NEED_UPDATE [context] ++; |
---|
[81] | 157 | } |
---|
| 158 | |
---|
| 159 | // =================================================================== |
---|
| 160 | // =====[ DECOD ]===================================================== |
---|
| 161 | // =================================================================== |
---|
[88] | 162 | |
---|
| 163 | |
---|
| 164 | // An decod is detected by decod stage |
---|
| 165 | // 1) Hit prediction : The instruction bundle have a branch predicted in ifetch stage and it is this branch |
---|
| 166 | // * Update state, wait_decod -> wait_end |
---|
| 167 | // * Pop ufpt -> push upt |
---|
| 168 | // * Update accurate register : if the predict stage have tagged this branch as not accurate, stop decod |
---|
| 169 | // 2) Miss : The instruction bundle have a branch but it is not predicted |
---|
| 170 | // * Flush ufpt |
---|
| 171 | // * decod information is write in upt |
---|
| 172 | |
---|
[81] | 173 | for (uint32_t i=0; i<_param->_nb_inst_decod; i++) |
---|
| 174 | if (PORT_READ(in_DECOD_VAL[i]) and internal_DECOD_ACK [i]) |
---|
| 175 | { |
---|
[88] | 176 | Tcontext_t context = (_param->_have_port_context_id)?PORT_READ(in_DECOD_CONTEXT_ID [i]):0; |
---|
| 177 | Tcontrol_t miss_ifetch = PORT_READ(in_DECOD_MISS_IFETCH [i]); |
---|
| 178 | Tcontrol_t miss_decod = PORT_READ(in_DECOD_MISS_DECOD [i]); |
---|
| 179 | uint32_t upt_ptr_write = internal_DECOD_UPT_PTR_WRITE [i]; |
---|
| 180 | Tbranch_condition_t condition ; |
---|
| 181 | Tcontrol_t is_accurate; |
---|
[94] | 182 | Taddress_t address_src = PORT_READ(in_DECOD_BTB_ADDRESS_SRC [i]); |
---|
| 183 | Taddress_t address_dest = PORT_READ(in_DECOD_BTB_ADDRESS_DEST [i]); |
---|
| 184 | Tcontrol_t last_take = PORT_READ(in_DECOD_BTB_LAST_TAKE [i]); |
---|
[81] | 185 | |
---|
[88] | 186 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * DECOD[%d] - Accepted",i); |
---|
| 187 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * context : %d",context); |
---|
| 188 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * miss_ifetch : %d",miss_ifetch); |
---|
| 189 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * miss_decod : %d",miss_decod); |
---|
| 190 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * upt_ptr_write : %d",upt_ptr_write); |
---|
[81] | 191 | |
---|
[88] | 192 | if (miss_ifetch or miss_decod) |
---|
[81] | 193 | { |
---|
[88] | 194 | // Have a miss !!! |
---|
[94] | 195 | #ifdef DEBUG_TEST |
---|
| 196 | if (reg_EVENT_STATE [context] != EVENT_STATE_OK) |
---|
| 197 | throw ERRORMORPHEO(FUNCTION,_("Decod : invalid event state.")); |
---|
| 198 | #endif |
---|
| 199 | |
---|
[88] | 200 | if (reg_UFPT_NB_NEED_UPDATE [context] == 0) |
---|
| 201 | { |
---|
[94] | 202 | // Change state |
---|
| 203 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT [%d] <- EVENT_STATE_UPDATE_CONTEXT (decod - miss - no flush ufpt)",context); |
---|
| 204 | reg_EVENT_STATE [context] = EVENT_STATE_UPDATE_CONTEXT; |
---|
[88] | 205 | } |
---|
| 206 | else |
---|
| 207 | { |
---|
[94] | 208 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT [%d] <- EVENT_STATE_FLUSH_UFPT (decod - miss - flush ufpt)",context); |
---|
[88] | 209 | reg_EVENT_STATE [context] = EVENT_STATE_FLUSH_UFPT; |
---|
| 210 | } |
---|
[81] | 211 | |
---|
[94] | 212 | // Flush UPFT |
---|
| 213 | flush_UFPT [context] = true; |
---|
| 214 | |
---|
| 215 | reg_EVENT_ADDRESS_SRC [context] = address_src; // delay_slot is compute in Context_State |
---|
| 216 | reg_EVENT_ADDRESS_DEST_VAL[context] = last_take; |
---|
| 217 | reg_EVENT_ADDRESS_DEST [context] = address_dest; |
---|
| 218 | |
---|
[88] | 219 | // Push upt (from decod interface) |
---|
| 220 | condition = PORT_READ(in_DECOD_BTB_CONDITION [i]); |
---|
| 221 | is_accurate = PORT_READ(in_DECOD_IS_ACCURATE [i]); |
---|
| 222 | |
---|
| 223 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._condition = condition; |
---|
[94] | 224 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._address_src = address_src ; |
---|
| 225 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._address_dest = address_dest; |
---|
| 226 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._last_take = last_take ; |
---|
[88] | 227 | // reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._good_take; |
---|
| 228 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._is_accurate = is_accurate; |
---|
| 229 | // reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._history = ; // static prediction |
---|
| 230 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._address_ras = PORT_READ(in_DECOD_RAS_ADDRESS [i]); |
---|
| 231 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._index_ras = PORT_READ(in_DECOD_RAS_INDEX [i]); |
---|
| 232 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._ifetch_prediction = false; // static prediction |
---|
[81] | 233 | } |
---|
| 234 | else |
---|
| 235 | { |
---|
| 236 | // Normal case : branch is previous predicated, change state of branch |
---|
[88] | 237 | uint32_t ufpt_ptr_read = (_param->_have_port_depth)?PORT_READ(in_DECOD_UPDATE_PREDICTION_ID [i]):0; |
---|
[81] | 238 | |
---|
[88] | 239 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * ufpt_ptr_read : %d",ufpt_ptr_read); |
---|
| 240 | |
---|
| 241 | #ifdef DEBUG_TEST |
---|
| 242 | if (reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._state != UPDATE_FETCH_PREDICTION_STATE_WAIT_DECOD) |
---|
| 243 | throw ERRORMORPHEO(FUNCTION,_("Decod : invalid ufpt state.")); |
---|
| 244 | #endif |
---|
| 245 | // Change state |
---|
| 246 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UFPT [%d][%d].state <- UPDATE_FETCH_PREDICTION_STATE_END (decod - hit)",context,ufpt_ptr_read); |
---|
| 247 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._state = UPDATE_FETCH_PREDICTION_STATE_END; |
---|
| 248 | |
---|
| 249 | // Push upt (from Pop ufpt) |
---|
| 250 | condition = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._condition; |
---|
| 251 | is_accurate = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._is_accurate; |
---|
| 252 | |
---|
| 253 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._condition = condition; |
---|
| 254 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._address_src = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._address_src ; |
---|
| 255 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._address_dest = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._address_dest; |
---|
| 256 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._last_take = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._last_take ; |
---|
| 257 | // reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._good_take; |
---|
| 258 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._is_accurate = is_accurate; |
---|
| 259 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._history = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._history ; |
---|
| 260 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._address_ras = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._address_ras ; |
---|
| 261 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._index_ras = reg_UPDATE_FETCH_PREDICTION_TABLE [context][ufpt_ptr_read]._index_ras ; |
---|
| 262 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._ifetch_prediction = true; // prediction from ifetch |
---|
| 263 | |
---|
| 264 | // Update pointer |
---|
| 265 | if (need_update(condition)) |
---|
| 266 | { |
---|
| 267 | reg_UFPT_NB_NEED_UPDATE [context] --; |
---|
| 268 | } |
---|
[81] | 269 | } |
---|
[88] | 270 | |
---|
| 271 | // All case !!! |
---|
| 272 | |
---|
| 273 | #ifdef DEBUG_TEST |
---|
| 274 | if (reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._state != UPDATE_PREDICTION_STATE_EMPTY) |
---|
| 275 | throw ERRORMORPHEO(FUNCTION,_("Decod : invalid upt state.")); |
---|
| 276 | #endif |
---|
| 277 | |
---|
| 278 | // Change state |
---|
| 279 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d].state <- UPDATE_PREDICTION_STATE_WAIT_END (decod - hit)",context,upt_ptr_write); |
---|
| 280 | reg_UPDATE_PREDICTION_TABLE [context][upt_ptr_write]._state = UPDATE_PREDICTION_STATE_WAIT_END; |
---|
| 281 | |
---|
| 282 | // Write new accurate |
---|
| 283 | #ifdef DEBUG_TEST |
---|
| 284 | if (not reg_IS_ACCURATE [context] and not is_accurate) |
---|
| 285 | throw ERRORMORPHEO(FUNCTION,_("Decod : invalid accurate flag.")); |
---|
| 286 | #endif |
---|
| 287 | reg_IS_ACCURATE [context] = is_accurate; |
---|
| 288 | |
---|
| 289 | // Update pointer |
---|
| 290 | reg_UPT_TOP [context] = (upt_ptr_write+1)%_param->_size_upt_queue [context]; |
---|
| 291 | // reg_UPT_UPDATE [context] = reg_UPT_TOP [context]; |
---|
[81] | 292 | } |
---|
| 293 | |
---|
| 294 | // =================================================================== |
---|
| 295 | // =====[ BRANCH_COMPLETE ]=========================================== |
---|
| 296 | // =================================================================== |
---|
[88] | 297 | |
---|
| 298 | // The branch is complete |
---|
| 299 | // * Hit prediction : |
---|
| 300 | // * update status |
---|
| 301 | // * Miss prediction : |
---|
[81] | 302 | for (uint32_t i=0; i<_param->_nb_inst_branch_complete; i++) |
---|
| 303 | if (PORT_READ(in_BRANCH_COMPLETE_VAL[i]) and internal_BRANCH_COMPLETE_ACK [i]) |
---|
| 304 | { |
---|
| 305 | Tcontext_t context = (_param->_have_port_context_id)?PORT_READ(in_BRANCH_COMPLETE_CONTEXT_ID [i]):0; |
---|
[88] | 306 | Tdepth_t depth = (_param->_have_port_depth )?PORT_READ(in_BRANCH_COMPLETE_DEPTH [i]):0; |
---|
[94] | 307 | Tcontrol_t miss = internal_BRANCH_COMPLETE_MISS_PREDICTION [i]; |
---|
| 308 | Tcontrol_t good_take = internal_BRANCH_COMPLETE_TAKE [i]; |
---|
| 309 | Taddress_t good_addr = internal_BRANCH_COMPLETE_ADDRESS_DEST [i]; |
---|
[81] | 310 | |
---|
[88] | 311 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * BRANCH_COMPLETE[%d] - Accepted",i); |
---|
[95] | 312 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * context : %d",context); |
---|
| 313 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * depth : %d",depth); |
---|
| 314 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * miss : %d",miss); |
---|
[81] | 315 | |
---|
[94] | 316 | if (miss) |
---|
[81] | 317 | { |
---|
[94] | 318 | // Have a miss !!! |
---|
| 319 | // Flush UPFT |
---|
| 320 | flush_UFPT [context] = true; |
---|
| 321 | |
---|
| 322 | // Flush UPT |
---|
| 323 | uint32_t top = reg_UPT_TOP [context]; |
---|
| 324 | uint32_t new_update = ((top==0)?_param->_size_upt_queue[context]:top)-1; |
---|
[95] | 325 | |
---|
| 326 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * top : %d",top); |
---|
| 327 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * new_update : %d",new_update); |
---|
| 328 | |
---|
[94] | 329 | for (uint32_t j=(depth+1)%_param->_size_upt_queue[context]; |
---|
| 330 | j!=top; |
---|
| 331 | j=(j+1)%_param->_size_upt_queue[context]) |
---|
| 332 | reg_UPDATE_PREDICTION_TABLE [context][j]._state = UPDATE_PREDICTION_STATE_EVENT; |
---|
| 333 | |
---|
| 334 | |
---|
[95] | 335 | // reg_UPT_BOTTOM [context]; |
---|
| 336 | reg_UPT_TOP [context] = depth; |
---|
| 337 | reg_UPT_TOP_EVENT [context] = top; |
---|
[81] | 338 | |
---|
[94] | 339 | #ifdef DEBUG_TEST |
---|
| 340 | if (reg_UPDATE_PREDICTION_TABLE [context][depth]._state != UPDATE_PREDICTION_STATE_WAIT_END) |
---|
| 341 | throw ERRORMORPHEO(FUNCTION,_("Branch complete : invalid upt state.")); |
---|
| 342 | #endif |
---|
| 343 | |
---|
| 344 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d].state <- UPDATE_PREDICTION_STATE_KO (branch_complete, ifetch hit)",context,depth); |
---|
| 345 | reg_UPDATE_PREDICTION_TABLE [context][depth]._state = UPDATE_PREDICTION_STATE_KO; |
---|
| 346 | |
---|
[95] | 347 | Taddress_t address_src = reg_UPDATE_PREDICTION_TABLE [context][depth]._address_src; |
---|
| 348 | event_state_t event_state = reg_EVENT_STATE [context]; |
---|
| 349 | bool previous_update_ras = (event_state == EVENT_STATE_FLUSH_UPT); |
---|
| 350 | bool update_ras = (new_update != depth); |
---|
[88] | 351 | |
---|
[95] | 352 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * update_ras : %d",update_ras); |
---|
[81] | 353 | |
---|
[94] | 354 | if (reg_UFPT_NB_NEED_UPDATE [context] > 0) |
---|
| 355 | { |
---|
| 356 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT [%d] <- EVENT_STATE_FLUSH_UFPT_AND_UPT (branch_complete - miss)",context); |
---|
| 357 | reg_EVENT_STATE [context] = EVENT_STATE_FLUSH_UFPT_AND_UPT; |
---|
| 358 | } |
---|
| 359 | else |
---|
| 360 | { |
---|
[95] | 361 | if (not previous_update_ras) |
---|
| 362 | { |
---|
| 363 | // have ras prediction ? |
---|
| 364 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT [%d] <- EVENT_STATE_FLUSH_UPT (branch_complete - miss)",context); |
---|
| 365 | |
---|
| 366 | reg_EVENT_STATE [context] = EVENT_STATE_FLUSH_UPT; |
---|
| 367 | |
---|
| 368 | } |
---|
[94] | 369 | } |
---|
[81] | 370 | |
---|
[95] | 371 | if (not previous_update_ras) |
---|
| 372 | { |
---|
| 373 | reg_UPT_UPDATE [context] = new_update; |
---|
| 374 | } |
---|
| 375 | // else no update |
---|
| 376 | |
---|
[94] | 377 | reg_EVENT_ADDRESS_SRC [context] = address_src; // delay_slot is compute in Context_State |
---|
| 378 | reg_EVENT_ADDRESS_DEST_VAL[context] = good_take; |
---|
| 379 | reg_EVENT_ADDRESS_DEST [context] = good_addr; |
---|
[81] | 380 | } |
---|
| 381 | else |
---|
| 382 | { |
---|
[88] | 383 | // Hit case |
---|
| 384 | |
---|
[81] | 385 | #ifdef DEBUG_TEST |
---|
[88] | 386 | if (reg_UPDATE_PREDICTION_TABLE [context][depth]._state != UPDATE_PREDICTION_STATE_WAIT_END) |
---|
| 387 | throw ERRORMORPHEO(FUNCTION,_("Branch complete : invalid upt state.")); |
---|
[81] | 388 | #endif |
---|
[88] | 389 | |
---|
| 390 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d].state <- UPDATE_PREDICTION_STATE_OK (branch_complete, ifetch hit)",context,depth); |
---|
| 391 | reg_UPDATE_PREDICTION_TABLE [context][depth]._state = UPDATE_PREDICTION_STATE_OK; |
---|
[81] | 392 | } |
---|
| 393 | |
---|
[88] | 394 | // In all case : update good_take |
---|
[94] | 395 | reg_UPDATE_PREDICTION_TABLE [context][depth]._good_take = good_take; |
---|
[88] | 396 | } |
---|
[81] | 397 | |
---|
| 398 | // =================================================================== |
---|
| 399 | // =====[ UPDATE ]==================================================== |
---|
| 400 | // =================================================================== |
---|
[95] | 401 | { |
---|
| 402 | bool can_continue [_param->_nb_context]; |
---|
| 403 | for (uint32_t i=0; i<_param->_nb_context; ++i) |
---|
| 404 | can_continue [i] = true; |
---|
[81] | 405 | |
---|
[95] | 406 | for (uint32_t i=0; i<_param->_nb_inst_update; i++) |
---|
| 407 | { |
---|
| 408 | Tcontext_t context = internal_UPDATE_CONTEXT_ID [i]; |
---|
| 409 | |
---|
| 410 | if ((internal_UPDATE_VAL[i] and PORT_READ(in_UPDATE_ACK [i])) or |
---|
| 411 | (internal_UPDATE_VAL_WITHOUT_ACK [i] and can_continue [context])) |
---|
[88] | 412 | { |
---|
[95] | 413 | Tdepth_t depth = internal_UPDATE_DEPTH [i]; |
---|
| 414 | |
---|
| 415 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPDATE[%d] - Accepted",i); |
---|
| 416 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * context : %d",context); |
---|
| 417 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * depth : %d",depth); |
---|
| 418 | |
---|
| 419 | if (internal_UPDATE_FROM_UFPT [i]) |
---|
[94] | 420 | { |
---|
[95] | 421 | // if free a slot, also all queue is updated |
---|
| 422 | // Last slot ? |
---|
| 423 | if (reg_UFPT_UPDATE [context] == reg_UFPT_BOTTOM [context]) |
---|
| 424 | switch (reg_EVENT_STATE [context]) |
---|
| 425 | { |
---|
| 426 | case EVENT_STATE_FLUSH_UFPT : reg_EVENT_STATE [context] = EVENT_STATE_UPDATE_CONTEXT; break; |
---|
| 427 | // impossible to have an update on ufpt and reg_upt_update>reg_upt_top |
---|
| 428 | case EVENT_STATE_FLUSH_UFPT_AND_UPT : reg_EVENT_STATE [context] = EVENT_STATE_FLUSH_UPT ; break; |
---|
| 429 | default : break; |
---|
| 430 | } |
---|
| 431 | |
---|
| 432 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * Update Fetch Prediction Table"); |
---|
| 433 | |
---|
| 434 | // Change state |
---|
[88] | 435 | #ifdef DEBUG_TEST |
---|
[95] | 436 | if (reg_UPDATE_FETCH_PREDICTION_TABLE [context][depth]._state != UPDATE_FETCH_PREDICTION_STATE_EVENT) |
---|
| 437 | throw ERRORMORPHEO(FUNCTION,_("Update : invalid ufpt state.")); |
---|
[88] | 438 | #endif |
---|
[95] | 439 | |
---|
| 440 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UFPT [%d][%d].state <- UPDATE_FETCH_PREDICTION_STATE_END (update)",context,depth); |
---|
| 441 | |
---|
| 442 | reg_UPDATE_FETCH_PREDICTION_TABLE [context][depth]._state = UPDATE_FETCH_PREDICTION_STATE_END; |
---|
| 443 | |
---|
| 444 | |
---|
| 445 | // Update pointer |
---|
| 446 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_UPDATE (before) : %d",reg_UFPT_UPDATE [context]); |
---|
| 447 | reg_UFPT_UPDATE [context] = ((depth==0)?_param->_size_ufpt_queue[context]:depth)-1; |
---|
| 448 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_UPDATE (after ) : %d",reg_UFPT_UPDATE [context]); |
---|
| 449 | // Free a register that need update ? |
---|
| 450 | if (need_update(reg_UPDATE_FETCH_PREDICTION_TABLE [context][depth]._condition)) |
---|
| 451 | reg_UFPT_NB_NEED_UPDATE [context] --; |
---|
[94] | 452 | } |
---|
| 453 | else |
---|
| 454 | { |
---|
[95] | 455 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * Update Prediction Table"); |
---|
| 456 | |
---|
| 457 | // Change state |
---|
| 458 | #ifdef DEBUG_TEST |
---|
| 459 | if (internal_UPDATE_RAS [i]) |
---|
| 460 | { |
---|
| 461 | if ((reg_UPDATE_PREDICTION_TABLE [context][depth]._state != UPDATE_PREDICTION_STATE_EVENT) and |
---|
| 462 | (reg_UPDATE_PREDICTION_TABLE [context][depth]._state != UPDATE_PREDICTION_STATE_KO )) |
---|
| 463 | throw ERRORMORPHEO(FUNCTION,_("Update : invalid upt state.")); |
---|
| 464 | } |
---|
| 465 | else |
---|
| 466 | { |
---|
| 467 | if (reg_UPDATE_PREDICTION_TABLE [context][depth]._state != UPDATE_PREDICTION_STATE_OK ) |
---|
| 468 | throw ERRORMORPHEO(FUNCTION,_("Update : invalid upt state.")); |
---|
| 469 | } |
---|
[88] | 470 | #endif |
---|
| 471 | |
---|
[95] | 472 | // bool have_event = ((reg_UPDATE_PREDICTION_TABLE [context][depth]._state == UPDATE_PREDICTION_STATE_KO) or |
---|
| 473 | // (reg_UPDATE_PREDICTION_TABLE [context][depth]._state == UPDATE_PREDICTION_STATE_EVENT)); |
---|
[97] | 474 | #ifdef STATISTICS |
---|
| 475 | Tbranch_condition_t condition = reg_UPDATE_PREDICTION_TABLE [context][depth]._condition; |
---|
| 476 | bool ok = (reg_UPDATE_PREDICTION_TABLE [context][depth]._state == UPDATE_PREDICTION_STATE_OK); |
---|
| 477 | #endif |
---|
[95] | 478 | bool ko = (reg_UPDATE_PREDICTION_TABLE [context][depth]._state == UPDATE_PREDICTION_STATE_KO); |
---|
[88] | 479 | |
---|
[95] | 480 | // Have an update, test the state to transiste to the good state |
---|
| 481 | if (ko) |
---|
| 482 | { |
---|
| 483 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d].state <- UPDATE_PREDICTION_STATE_END_KO (update)",context,depth); |
---|
| 484 | |
---|
| 485 | reg_UPDATE_PREDICTION_TABLE [context][depth]._state = UPDATE_PREDICTION_STATE_END_KO; |
---|
[97] | 486 | |
---|
| 487 | #ifdef STATISTICS |
---|
| 488 | if (usage_is_set(_usage,USE_STATISTICS)) |
---|
| 489 | (*_stat_nb_branch_miss [context][condition])++; |
---|
| 490 | #endif |
---|
[95] | 491 | } |
---|
| 492 | else |
---|
| 493 | { |
---|
| 494 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * UPT [%d][%d].state <- UPDATE_PREDICTION_STATE_END_OK (update)",context,depth); |
---|
| 495 | |
---|
| 496 | reg_UPDATE_PREDICTION_TABLE [context][depth]._state = UPDATE_PREDICTION_STATE_END_OK; |
---|
[97] | 497 | |
---|
| 498 | |
---|
| 499 | #ifdef STATISTICS |
---|
| 500 | if (usage_is_set(_usage,USE_STATISTICS)) |
---|
| 501 | { |
---|
| 502 | if (ok) |
---|
| 503 | (*_stat_nb_branch_hit [context][condition]) ++; |
---|
| 504 | else |
---|
| 505 | (*_stat_nb_branch_unused [context]) ++; |
---|
| 506 | } |
---|
| 507 | #endif |
---|
[95] | 508 | } |
---|
| 509 | |
---|
| 510 | // Update pointer |
---|
| 511 | // * if update RAS : update pointer is decreaste until it equal at top pointer |
---|
| 512 | if (internal_UPDATE_RAS [i]) |
---|
| 513 | { |
---|
| 514 | // if end_event, restart too bottom, else decrease pointer |
---|
| 515 | bool end_event = (reg_UPT_UPDATE [context] == reg_UPT_TOP [context]); |
---|
| 516 | |
---|
| 517 | reg_UPT_UPDATE [context] = (end_event)?reg_UPT_BOTTOM[context]:(((depth==0)?_param->_size_upt_queue[context]:depth)-1); |
---|
| 518 | if (end_event) |
---|
| 519 | { |
---|
| 520 | reg_UPT_UPDATE [context] = reg_UPT_BOTTOM[context]; |
---|
| 521 | reg_EVENT_STATE [context] = EVENT_STATE_UPDATE_CONTEXT; |
---|
| 522 | } |
---|
| 523 | else |
---|
| 524 | { |
---|
| 525 | reg_UPT_UPDATE [context] = (((depth==0)?_param->_size_upt_queue[context]:depth)-1); |
---|
| 526 | } |
---|
| 527 | } |
---|
| 528 | else |
---|
| 529 | { |
---|
| 530 | // increase pointer |
---|
| 531 | reg_UPT_UPDATE [context] = (depth+1)%_param->_size_upt_queue[context]; |
---|
| 532 | } |
---|
| 533 | |
---|
| 534 | // Free the branch with no accurate ? |
---|
| 535 | if (reg_UPDATE_PREDICTION_TABLE [context][depth]._is_accurate == false) |
---|
| 536 | reg_IS_ACCURATE [context] = true; |
---|
[94] | 537 | } |
---|
[88] | 538 | } |
---|
[95] | 539 | else |
---|
| 540 | can_continue [context] = false; |
---|
| 541 | } |
---|
[81] | 542 | |
---|
[95] | 543 | // Round robin |
---|
| 544 | reg_UPDATE_PRIORITY = (reg_UPDATE_PRIORITY+1)%_param->_nb_context; |
---|
| 545 | } |
---|
[81] | 546 | |
---|
[94] | 547 | // =================================================================== |
---|
| 548 | // =====[ BRANCH_EVENT ]============================================== |
---|
| 549 | // =================================================================== |
---|
| 550 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 551 | if (internal_BRANCH_EVENT_VAL [i] and PORT_READ(in_BRANCH_EVENT_ACK [i])) |
---|
| 552 | { |
---|
[95] | 553 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * BRANCH_EVENT [%d] - Accepted",i); |
---|
[82] | 554 | |
---|
[94] | 555 | #ifdef DEBUG_TEST |
---|
| 556 | if (reg_EVENT_STATE [i] != EVENT_STATE_UPDATE_CONTEXT) |
---|
| 557 | throw ERRORMORPHEO(FUNCTION,_("Decod : invalid event state.")); |
---|
| 558 | #endif |
---|
[88] | 559 | |
---|
[94] | 560 | // Change state |
---|
[95] | 561 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT [%d] <- EVENT_STATE_WAIT_END_EVENT (branch_event)",i); |
---|
[94] | 562 | |
---|
[95] | 563 | reg_EVENT_STATE [i] = EVENT_STATE_WAIT_END_EVENT; |
---|
[94] | 564 | } |
---|
| 565 | |
---|
| 566 | // =================================================================== |
---|
[95] | 567 | // =====[ EVENT ]===================================================== |
---|
| 568 | // =================================================================== |
---|
| 569 | for (uint32_t i=0; i<_param->_nb_context; ++i) |
---|
[97] | 570 | if (PORT_READ(in_EVENT_VAL [i]) and internal_EVENT_ACK [i]) |
---|
| 571 | { |
---|
| 572 | //---------------------------------------------------------------- |
---|
| 573 | // Cases |
---|
| 574 | //---------------------------------------------------------------- |
---|
| 575 | // * EVENT_TYPE_NONE - nothing |
---|
| 576 | // * EVENT_TYPE_MISS_SPECULATION - Change state, reset pointer |
---|
| 577 | // * EVENT_TYPE_EXCEPTION - Flush upft and upt, Change state, reset pointer |
---|
| 578 | // * EVENT_TYPE_BRANCH_NO_ACCURATE - nothing : manage in decod and update |
---|
| 579 | // * EVENT_TYPE_SPR_ACCESS - nothing |
---|
| 580 | // * EVENT_TYPE_MSYNC - nothing |
---|
| 581 | // * EVENT_TYPE_PSYNC - nothing |
---|
| 582 | // * EVENT_TYPE_CSYNC - nothing |
---|
| 583 | |
---|
| 584 | Tevent_type_t event_type = PORT_READ(in_EVENT_TYPE [i]); |
---|
| 585 | // Tdepth_t depth = PORT_READ(in_EVENT_DEPTH [i]); |
---|
[95] | 586 | |
---|
[97] | 587 | // Test if end of miss |
---|
| 588 | if (event_type == EVENT_TYPE_MISS_SPECULATION) |
---|
| 589 | { |
---|
| 590 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT"); |
---|
| 591 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * type : EVENT_TYPE_MISS_SPECULATION"); |
---|
| 592 | |
---|
[95] | 593 | #ifdef DEBUG_TEST |
---|
[97] | 594 | if (reg_EVENT_STATE [i] != EVENT_STATE_WAIT_END_EVENT) |
---|
| 595 | throw ERRORMORPHEO(FUNCTION,_("Event : invalid event state.")); |
---|
[95] | 596 | #endif |
---|
[97] | 597 | |
---|
| 598 | // Change state |
---|
| 599 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * EVENT [%d] <- EVENT_STATE_OK (event)",i); |
---|
| 600 | |
---|
| 601 | reg_EVENT_STATE [i] = EVENT_STATE_OK; |
---|
| 602 | } |
---|
| 603 | } |
---|
[95] | 604 | |
---|
| 605 | // =================================================================== |
---|
[94] | 606 | // =====[ FLUSH ]===================================================== |
---|
| 607 | // =================================================================== |
---|
| 608 | |
---|
| 609 | for (uint32_t i=0; i<_param->_nb_context; ++i) |
---|
| 610 | { |
---|
| 611 | if (flush_UFPT [i]) |
---|
| 612 | { |
---|
| 613 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * Flush Update Fetch Prediction Table"); |
---|
| 614 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * context : %d",i); |
---|
| 615 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_NB_NEED_UPDATE : %d",reg_UFPT_NB_NEED_UPDATE [i]); |
---|
| 616 | |
---|
| 617 | // It's to accelerate miss speculation |
---|
| 618 | if (reg_UFPT_NB_NEED_UPDATE [i] == 0) |
---|
| 619 | { |
---|
| 620 | |
---|
| 621 | // No entry need prediction, flush all entry -> Reset |
---|
| 622 | for (uint32_t j=0; j<_param->_size_ufpt_queue[i]; ++j) |
---|
| 623 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._state = UPDATE_FETCH_PREDICTION_STATE_EMPTY; |
---|
| 624 | reg_UFPT_BOTTOM [i] = 0; |
---|
| 625 | reg_UFPT_TOP [i] = 0; |
---|
| 626 | // reg_UFPT_UPDATE [i]; |
---|
| 627 | } |
---|
| 628 | else |
---|
| 629 | { |
---|
| 630 | for (uint32_t j=0; j<_param->_size_ufpt_queue[i]; ++j) |
---|
| 631 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._state = UPDATE_FETCH_PREDICTION_STATE_EVENT; |
---|
[88] | 632 | |
---|
[94] | 633 | // TOP is next write slot : last slot is TOP-1 |
---|
| 634 | uint32_t top = reg_UFPT_TOP [i]; |
---|
| 635 | reg_UFPT_UPDATE [i] = ((top==0)?_param->_size_ufpt_queue[i]:top)-1; |
---|
| 636 | |
---|
| 637 | // reg_UFPT_BOTTOM [i]; |
---|
| 638 | // reg_UFPT_TOP [i]; |
---|
| 639 | } |
---|
[81] | 640 | |
---|
[94] | 641 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_UPDATE (after ) : %d",reg_UFPT_UPDATE [i]); |
---|
| 642 | |
---|
| 643 | } |
---|
| 644 | } |
---|
| 645 | |
---|
[97] | 646 | #ifdef STATISTICS |
---|
| 647 | if (usage_is_set(_usage,USE_STATISTICS)) |
---|
| 648 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 649 | { |
---|
| 650 | for (uint32_t j=0; j<_param->_size_ufpt_queue[i]; j++) |
---|
| 651 | if (reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._state != UPDATE_FETCH_PREDICTION_STATE_EMPTY) |
---|
| 652 | (*_stat_ufpt_queue_nb_elt [i]) ++; |
---|
| 653 | for (uint32_t j=0; j<_param->_size_upt_queue[i]; j++) |
---|
| 654 | if (reg_UPDATE_PREDICTION_TABLE [i][j]._state != UPDATE_PREDICTION_STATE_EMPTY) |
---|
| 655 | (*_stat_upt_queue_nb_elt [i]) ++; |
---|
| 656 | } |
---|
| 657 | #endif |
---|
| 658 | |
---|
[94] | 659 | // =================================================================== |
---|
| 660 | // =====[ PRINT ]===================================================== |
---|
| 661 | // =================================================================== |
---|
| 662 | |
---|
[82] | 663 | #if (DEBUG >= DEBUG_TRACE) |
---|
[88] | 664 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * Dump Update_Prediction_Table"); |
---|
| 665 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UPDATE_PRIORITY : %d",reg_UPDATE_PRIORITY); |
---|
[81] | 666 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 667 | { |
---|
[88] | 668 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_IS_ACCURATE : %d",reg_IS_ACCURATE [i]); |
---|
| 669 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_EVENT_STATE : %s" ,toString(reg_EVENT_STATE [i]).c_str()); |
---|
| 670 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_EVENT_ADDRESS_SRC : %.8x",reg_EVENT_ADDRESS_SRC [i]); |
---|
[94] | 671 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_EVENT_ADDRESS_DEST_VAL: %d" ,reg_EVENT_ADDRESS_DEST_VAL[i]); |
---|
[88] | 672 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_EVENT_ADDRESS_DEST : %.8x",reg_EVENT_ADDRESS_DEST [i]); |
---|
| 673 | |
---|
| 674 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * Update_Fetch_Prediction_Table [%d]",i); |
---|
| 675 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_BOTTOM : %d",reg_UFPT_BOTTOM [i]); |
---|
| 676 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_TOP : %d",reg_UFPT_TOP [i]); |
---|
[94] | 677 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_UPDATE : %d",reg_UFPT_UPDATE [i]); |
---|
[88] | 678 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UFPT_NB_NEED_UPDATE : %d",reg_UFPT_NB_NEED_UPDATE [i]); |
---|
| 679 | for (uint32_t j=0; j<_param->_size_ufpt_queue[i]; j++) |
---|
| 680 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," [%d] %.4d, %.8x %.8x, %.1d %.1d, %.8d %.8x %.4d - %s", |
---|
| 681 | j, |
---|
| 682 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._condition, |
---|
| 683 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._address_src, |
---|
| 684 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._address_dest, |
---|
| 685 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._last_take, |
---|
| 686 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._is_accurate, |
---|
| 687 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._history, |
---|
| 688 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._address_ras, |
---|
| 689 | reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._index_ras, |
---|
| 690 | toString(reg_UPDATE_FETCH_PREDICTION_TABLE [i][j]._state).c_str() |
---|
| 691 | ); |
---|
| 692 | |
---|
| 693 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * Update_Prediction_Table [%d]",i); |
---|
| 694 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UPT_BOTTOM : %d",reg_UPT_BOTTOM [i]); |
---|
| 695 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UPT_TOP : %d",reg_UPT_TOP [i]); |
---|
[95] | 696 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UPT_TOP_EVENT : %d",reg_UPT_TOP_EVENT [i]); |
---|
[88] | 697 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," * reg_UPT_UPDATE : %d",reg_UPT_UPDATE [i]); |
---|
| 698 | for (uint32_t j=0; j<_param->_size_upt_queue[i]; j++) |
---|
| 699 | log_printf(TRACE,Update_Prediction_Table,FUNCTION," [%d] %.4d, %.8x %.8x, %.1d %.1d %.1d, %.8d %.8x %.4d - %s", |
---|
| 700 | j, |
---|
| 701 | reg_UPDATE_PREDICTION_TABLE [i][j]._condition, |
---|
| 702 | reg_UPDATE_PREDICTION_TABLE [i][j]._address_src, |
---|
| 703 | reg_UPDATE_PREDICTION_TABLE [i][j]._address_dest, |
---|
| 704 | reg_UPDATE_PREDICTION_TABLE [i][j]._last_take, |
---|
| 705 | reg_UPDATE_PREDICTION_TABLE [i][j]._good_take, |
---|
| 706 | reg_UPDATE_PREDICTION_TABLE [i][j]._is_accurate, |
---|
| 707 | reg_UPDATE_PREDICTION_TABLE [i][j]._history, |
---|
| 708 | reg_UPDATE_PREDICTION_TABLE [i][j]._address_ras, |
---|
| 709 | reg_UPDATE_PREDICTION_TABLE [i][j]._index_ras, |
---|
| 710 | toString(reg_UPDATE_PREDICTION_TABLE [i][j]._state).c_str() |
---|
| 711 | ); |
---|
[81] | 712 | } |
---|
[82] | 713 | #endif |
---|
[88] | 714 | } |
---|
[81] | 715 | |
---|
| 716 | |
---|
[78] | 717 | #if defined(STATISTICS) or defined(VHDL_TESTBENCH) |
---|
| 718 | end_cycle (); |
---|
| 719 | #endif |
---|
[88] | 720 | |
---|
| 721 | log_end(Update_Prediction_Table,FUNCTION); |
---|
[78] | 722 | }; |
---|
| 723 | |
---|
| 724 | }; // end namespace update_prediction_table |
---|
| 725 | }; // end namespace prediction_unit |
---|
| 726 | }; // end namespace front_end |
---|
| 727 | }; // end namespace multi_front_end |
---|
| 728 | }; // end namespace core |
---|
| 729 | |
---|
| 730 | }; // end namespace behavioural |
---|
| 731 | }; // end namespace morpheo |
---|
| 732 | #endif |
---|