| 150 | |
| 151 | |
| 152 | bool loop_par( |
| 153 | int * vul_list, |
| 154 | DdTableResults * table_list, |
| 155 | ParResults * par_list, |
| 156 | const int number, |
| 157 | const int stepsize) |
| 158 | { |
| 159 | // This is so fast that there is no batch or multi-threaded |
| 160 | // version. We run it many times just to get meaningful times. |
| 161 | |
| 162 | ParResults presp; |
| 163 | |
| 164 | for (int i = 0; i < number; i++) |
| 165 | { |
| 166 | for (int j = 0; j < stepsize; j++) |
| 167 | { |
| 168 | int ret; |
| 169 | if ((ret = Par(&table_list[i], &presp, vul_list[i])) |
| 170 | != RETURN_NO_FAULT) |
| 171 | { |
| 172 | cout << "loop_par: i " << i << ", j " << j << ": " << |
| 173 | "return " << ret << "\n"; |
| 174 | exit(0); |
| 175 | } |
| 176 | } |
| 177 | |
| 178 | if (compare_PAR(presp, par_list[i])) |
| 179 | continue; |
| 180 | |
| 181 | cout << "loop_par i " << i << ": Difference\n\n"; |
| 182 | print_PAR(presp); |
| 183 | cout << "\n"; |
| 184 | print_PAR(par_list[i]); |
| 185 | cout << "\n"; |
| 186 | } |
| 187 | |
| 188 | return true; |
| 189 | } |
| 190 | |
| 191 | |
| 192 | bool loop_dealerpar( |
no test coverage detected