for the number of divisions of two monomials; these are all guaranteed to work, i.e., m1/m2 only when exponentVector(m1) >= exponentVector(m2) */
| 34 | these are all guaranteed to work, i.e., m1/m2 only |
| 35 | when exponentVector(m1) >= exponentVector(m2) */ |
| 36 | void printCounters (char* prefix, bool resetToZero) |
| 37 | { |
| 38 | printf("%s [p+p(div) | p*p(div) | m*m(div, -save) | m/m ]", prefix); |
| 39 | printf(" = [%ld(%ld) | %ld(%ld) | %ld(%d, -%ld) | %ld]\n", |
| 40 | addsPoly, addsPolyForDiv, multsPoly, multsPolyForDiv, |
| 41 | multsMon, multsMonForDiv, savedMultsMFD, divsMon); |
| 42 | if (resetToZero) |
| 43 | { |
| 44 | multsMon = 0; addsPoly = 0; multsPoly = 0; divsMon = 0; |
| 45 | savedMultsMFD = 0; multsMonForDiv = 0; addsPolyForDiv = 0; |
| 46 | multsPolyForDiv = 0; |
| 47 | } |
| 48 | } |
| 49 | #endif |
| 50 | /* COUNT_AND_PRINT_OPERATIONS */ |
| 51 |
no outgoing calls
no test coverage detected