[78] | 1 | #ifdef SYSTEMC |
---|
| 2 | /* |
---|
| 3 | * $Id: Return_Address_Stack_transition.cpp 81 2008-04-15 18:40:01Z rosiere $ |
---|
| 4 | * |
---|
| 5 | * [ Description ] |
---|
| 6 | * |
---|
| 7 | */ |
---|
| 8 | |
---|
| 9 | #include "Behavioural/Core/Multi_Front_end/Front_end/Prediction_unit/Return_Address_Stack/include/Return_Address_Stack.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 return_address_stack { |
---|
| 18 | |
---|
| 19 | |
---|
| 20 | #undef FUNCTION |
---|
| 21 | #define FUNCTION "Return_Address_Stack::transition" |
---|
| 22 | void Return_Address_Stack::transition (void) |
---|
| 23 | { |
---|
| 24 | log_printf(FUNC,Return_Address_Stack,FUNCTION,"Begin"); |
---|
| 25 | |
---|
[81] | 26 | if (PORT_READ(in_NRESET)==0) |
---|
[78] | 27 | { |
---|
| 28 | for (uint32_t i=0; i<_param->_nb_context; i++) |
---|
| 29 | { |
---|
| 30 | reg_TOP [i] = 0; |
---|
| 31 | reg_BOTTOM [i] = 0; |
---|
[81] | 32 | reg_NB_ELT [i] = 0; |
---|
[78] | 33 | |
---|
| 34 | reg_PREDICT_TOP [i] = 0; |
---|
| 35 | reg_PREDICT_BOTTOM [i] = 0; |
---|
[81] | 36 | reg_PREDICT_NB_ELT [i] = 0; |
---|
[78] | 37 | |
---|
| 38 | for (uint32_t j=0; j<_param->_size_queue [i]; j++) |
---|
[81] | 39 | { |
---|
| 40 | reg_stack[i][j]._val = false; |
---|
| 41 | reg_stack[i][j]._predict = false; |
---|
| 42 | reg_stack[i][j]._miss = false; |
---|
| 43 | } |
---|
[78] | 44 | } |
---|
| 45 | } |
---|
| 46 | else |
---|
| 47 | { |
---|
| 48 | // =================================================================== |
---|
| 49 | // =====[ PREDICT ]=================================================== |
---|
| 50 | // =================================================================== |
---|
| 51 | for (uint32_t i=0; i<_param->_nb_inst_predict; i++) |
---|
| 52 | if (PORT_READ(in_PREDICT_VAL [i]) and internal_PREDICT_ACK [i]) |
---|
| 53 | { |
---|
[81] | 54 | log_printf(TRACE,Return_Address_Stack,FUNCTION,"PREDICT[%d] : Transaction",i); |
---|
| 55 | Tcontext_t context = (_param->_have_port_context_id)?PORT_READ(in_PREDICT_CONTEXT_ID [i]):0; |
---|
| 56 | Tcontrol_t push = PORT_READ(in_PREDICT_PUSH [i]); |
---|
| 57 | Tptr_t top_old = reg_PREDICT_TOP [context]; |
---|
| 58 | Tptr_t top_new = top_old; |
---|
| 59 | Tptr_t bottom_old = reg_PREDICT_BOTTOM [context]; |
---|
[78] | 60 | |
---|
[81] | 61 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * context : %d",context); |
---|
| 62 | |
---|
| 63 | // Hit : push or (val and not miss and not empty) |
---|
| 64 | // Miss : ifetch is stall, no update |
---|
[78] | 65 | if (internal_PREDICT_HIT [i]) |
---|
| 66 | { |
---|
[81] | 67 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * before"); |
---|
| 68 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_predict_top : %d",reg_PREDICT_TOP [context]); |
---|
| 69 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_predict_bottom : %d",reg_PREDICT_BOTTOM [context]); |
---|
| 70 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_predict_nb_elt : %d",reg_PREDICT_NB_ELT [context]); |
---|
| 71 | |
---|
[78] | 72 | if (push) |
---|
| 73 | { |
---|
[81] | 74 | // push : increase the top (circular) |
---|
[78] | 75 | top_new = (top_old+1)%_param->_size_queue[context]; |
---|
| 76 | |
---|
| 77 | reg_stack [context][top_new]._val = true; // New addr |
---|
[81] | 78 | reg_stack [context][top_new]._predict = true; // Is speculative (erase a old addr (or not)) |
---|
[78] | 79 | //reg_stack [context][top_new]._miss = ; |
---|
| 80 | reg_stack [context][top_new]._address = PORT_READ(in_PREDICT_ADDRESS_PUSH [i]); |
---|
| 81 | |
---|
| 82 | // the stack is full, erase the most old stack |
---|
[81] | 83 | |
---|
| 84 | // Test if full |
---|
| 85 | if (reg_PREDICT_NB_ELT[context]==_param->_size_queue[context]) |
---|
| 86 | reg_PREDICT_BOTTOM [context] = (bottom_old+1)%_param->_size_queue[context]; |
---|
| 87 | // A new data is write : the stack is not empty |
---|
| 88 | if (reg_PREDICT_NB_ELT[context]< _param->_size_queue[context]) |
---|
| 89 | reg_PREDICT_NB_ELT[context]++; |
---|
[78] | 90 | } |
---|
| 91 | else |
---|
| 92 | { |
---|
| 93 | // pop |
---|
[81] | 94 | // top_new = (top_old==0)?(_param->_size_queue[context]-1):(top_old-1); |
---|
[78] | 95 | |
---|
| 96 | //reg_stack [context][top_new]._val = ; |
---|
| 97 | //reg_stack [context][top_new]._predict = ; |
---|
| 98 | //reg_stack [context][top_new]._miss = ; |
---|
| 99 | //reg_stack [context][top_new]._address = ; |
---|
| 100 | |
---|
| 101 | // the stack is empty |
---|
[81] | 102 | if (reg_PREDICT_NB_ELT[context]>0) |
---|
| 103 | { |
---|
| 104 | top_new = (top_old==0)?(_param->_size_queue[context]-1):(top_old-1); |
---|
| 105 | reg_PREDICT_NB_ELT[context] --; |
---|
| 106 | } |
---|
[78] | 107 | } |
---|
| 108 | |
---|
[81] | 109 | reg_PREDICT_TOP [context] = top_new; |
---|
| 110 | |
---|
| 111 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * after"); |
---|
| 112 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_predict_top : %d",reg_PREDICT_TOP [context]); |
---|
| 113 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_predict_bottom : %d",reg_PREDICT_BOTTOM [context]); |
---|
| 114 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_predict_nb_elt : %d",reg_PREDICT_NB_ELT [context]); |
---|
[78] | 115 | } |
---|
| 116 | } |
---|
| 117 | |
---|
[81] | 118 | // =================================================================== |
---|
| 119 | // =====[ DECOD ]===================================================== |
---|
| 120 | // =================================================================== |
---|
| 121 | for (uint32_t i=0; i<_param->_nb_inst_decod; i++) |
---|
| 122 | if (PORT_READ(in_DECOD_VAL [i]) and internal_DECOD_ACK [i]) |
---|
| 123 | { |
---|
| 124 | log_printf(TRACE,Return_Address_Stack,FUNCTION,"DECOD[%d] : Transaction",i); |
---|
| 125 | Tcontext_t context = (_param->_have_port_context_id)?PORT_READ(in_DECOD_CONTEXT_ID [i]):0; |
---|
| 126 | Tcontrol_t push = PORT_READ(in_DECOD_PUSH [i]); |
---|
| 127 | Tptr_t top_old = reg_TOP [context]; |
---|
| 128 | Tptr_t top_new = top_old; |
---|
| 129 | Tptr_t bottom_old = reg_BOTTOM [context]; |
---|
| 130 | //Tcontrol_t hit = internal_DECOD_HIT [i]; |
---|
| 131 | Tcontrol_t miss = PORT_READ(in_DECOD_MISS_PREDICTION [i]); |
---|
[78] | 132 | |
---|
[81] | 133 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * context : %d",context); |
---|
[78] | 134 | |
---|
[81] | 135 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * before"); |
---|
| 136 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_top : %d",reg_TOP [context]); |
---|
| 137 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_bottom : %d",reg_BOTTOM [context]); |
---|
| 138 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_nb_elt : %d",reg_NB_ELT [context]); |
---|
[78] | 139 | |
---|
[81] | 140 | if (push) |
---|
| 141 | { |
---|
| 142 | // push : increase the top (circular) |
---|
| 143 | top_new = (top_old+1)%_param->_size_queue[context]; |
---|
| 144 | |
---|
| 145 | reg_stack [context][top_new]._val = true; // New address |
---|
| 146 | reg_stack [context][top_new]._predict = false; // No speculative |
---|
| 147 | reg_stack [context][top_new]._miss = false; |
---|
| 148 | reg_stack [context][top_new]._address = PORT_READ(in_DECOD_ADDRESS_PUSH [i]); |
---|
| 149 | |
---|
| 150 | // Test if full : if true, then icrease the bottom (erase the most old stack) |
---|
| 151 | if (reg_NB_ELT[context]==_param->_size_queue[context]) |
---|
| 152 | reg_BOTTOM [context] = (bottom_old+1)%_param->_size_queue[context]; |
---|
| 153 | // A new data is write : the stack is not empty |
---|
| 154 | if (reg_NB_ELT[context]< _param->_size_queue[context]) |
---|
| 155 | reg_NB_ELT[context]++; |
---|
| 156 | } |
---|
| 157 | else |
---|
| 158 | { |
---|
| 159 | // pop |
---|
[78] | 160 | // top_new = (top_old==0)?(_param->_size_queue[context]-1):(top_old-1); |
---|
| 161 | |
---|
[81] | 162 | //reg_stack [context][top_new]._val = ; |
---|
| 163 | //reg_stack [context][top_new]._predict = ; |
---|
| 164 | //reg_stack [context][top_new]._miss = ; |
---|
| 165 | //reg_stack [context][top_new]._address = ; |
---|
| 166 | |
---|
| 167 | // the stack is empty |
---|
| 168 | if (reg_NB_ELT[context]>0) |
---|
| 169 | { |
---|
| 170 | top_new = (top_old==0)?(_param->_size_queue[context]-1):(top_old-1); |
---|
| 171 | reg_NB_ELT[context] --; |
---|
| 172 | } |
---|
| 173 | } |
---|
| 174 | |
---|
| 175 | reg_TOP [context] = top_new; |
---|
| 176 | |
---|
| 177 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * after"); |
---|
| 178 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_top : %d",reg_TOP [context]); |
---|
| 179 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_bottom : %d",reg_BOTTOM [context]); |
---|
| 180 | log_printf(TRACE,Return_Address_Stack,FUNCTION," * reg_nb_elt : %d",reg_NB_ELT [context]); |
---|
[78] | 181 | |
---|
[81] | 182 | // have previous miss of ifetch ? |
---|
| 183 | // 2 miss : |
---|
| 184 | // 1) miss predict : is very limited (local at context), can be update very quickly |
---|
| 185 | // 2) miss decod : result is in commit stage ... |
---|
| 186 | if (miss) |
---|
| 187 | { |
---|
| 188 | reg_PREDICT_BOTTOM [context] = reg_BOTTOM [context]; |
---|
| 189 | reg_PREDICT_TOP [context] = reg_TOP [context]; |
---|
| 190 | reg_PREDICT_NB_ELT [context] = reg_NB_ELT [context]; |
---|
| 191 | |
---|
| 192 | // Scan full assoc !!! |
---|
| 193 | for (uint32_t j=0; j<_param->_size_queue [i]; j++) |
---|
| 194 | // Test if this slot is tagged with "predict" : if true, tagged as miss |
---|
| 195 | if (reg_stack [context][j]._predict) |
---|
| 196 | { |
---|
| 197 | reg_stack [context][j]._predict = false; |
---|
| 198 | reg_stack [context][j]._miss = true; |
---|
| 199 | } |
---|
| 200 | } |
---|
| 201 | } |
---|
[78] | 202 | |
---|
| 203 | // =================================================================== |
---|
| 204 | // =====[ UPDATE ]=================================================== |
---|
| 205 | // =================================================================== |
---|
| 206 | for (uint32_t i=0; i<_param->_nb_inst_update; i++) |
---|
| 207 | if (PORT_READ(in_UPDATE_VAL [i]) and internal_UPDATE_ACK [i]) |
---|
| 208 | { |
---|
[81] | 209 | ERRORMORPHEO(FUNCTION,"Fonction à implémenter !!!!!!!!!!!!"); |
---|
[78] | 210 | |
---|
[81] | 211 | |
---|
| 212 | // Tcontrol_t miss = PORT_READ(in_UPDATE_MISS_PREDICTION [i]); |
---|
| 213 | // // |
---|
| 214 | // if (miss) |
---|
| 215 | // { |
---|
| 216 | // Tcontrol_t context = (_param->_have_port_context_id)?PORT_READ(in_UPDATE_CONTEXT_ID [i]):0; |
---|
| 217 | // Tcontrol_t ifetch = PORT_READ(in_UPDATE_PREDICTION_IFETCH [i]); |
---|
| 218 | // Tcontrol_t push = PORT_READ(in_UPDATE_PUSH [i]); |
---|
| 219 | // Tptr_t index = PORT_READ(in_UPDATE_INDEX [i]); |
---|
| 220 | // Taddress_t address = PORT_READ(in_UPDATE_ADDRESS [i]); |
---|
| 221 | |
---|
| 222 | // if (push) |
---|
| 223 | // { |
---|
| 224 | // // // push |
---|
| 225 | // // top_new = (top_old+1)%_param->_size_queue[context]; |
---|
[78] | 226 | |
---|
[81] | 227 | // // reg_stack [context][index]._val = true; |
---|
| 228 | // // reg_stack [context][index]._predict = false; |
---|
| 229 | // // reg_stack [context][index]._miss = false; |
---|
| 230 | // // reg_stack [context][index]._address = PORT_READ(in_UPDATE_ADDRESS [i]); |
---|
[78] | 231 | |
---|
[81] | 232 | // } |
---|
| 233 | // else |
---|
| 234 | // { |
---|
| 235 | // // //reg_stack [context][top_new]._val = ; |
---|
| 236 | // // //reg_stack [context][top_new]._predict = ; |
---|
| 237 | // // //reg_stack [context][top_new]._miss = ; |
---|
| 238 | // // //reg_stack [context][top_new]._address = ; |
---|
| 239 | // } |
---|
[78] | 240 | |
---|
[81] | 241 | // // // // Mouais bof ....... |
---|
| 242 | // // // reg_PREDICT_TOP [context] = index; |
---|
| 243 | // } |
---|
[78] | 244 | } |
---|
| 245 | } |
---|
| 246 | |
---|
| 247 | #if defined(STATISTICS) or defined(VHDL_TESTBENCH) |
---|
| 248 | end_cycle (); |
---|
| 249 | #endif |
---|
| 250 | |
---|
| 251 | log_printf(FUNC,Return_Address_Stack,FUNCTION,"End"); |
---|
| 252 | }; |
---|
| 253 | |
---|
| 254 | }; // end namespace return_address_stack |
---|
| 255 | }; // end namespace prediction_unit |
---|
| 256 | }; // end namespace front_end |
---|
| 257 | }; // end namespace multi_front_end |
---|
| 258 | }; // end namespace core |
---|
| 259 | |
---|
| 260 | }; // end namespace behavioural |
---|
| 261 | }; // end namespace morpheo |
---|
| 262 | #endif |
---|