Lines Matching defs:cnt
64 int cnt = 0;
118 chunks[i]->eqClass[(cnt + 1) % 2] = mid;
135 classes.push_back(c.eqClass[cnt % 2]);
160 d1->getChunk()->eqClass[cnt % 2] == d2->getChunk()->eqClass[cnt % 2];
185 return d1->getChunk()->eqClass[cnt % 2] == d2->getChunk()->eqClass[cnt % 2];
196 if (chunks[begin]->eqClass[cnt % 2] != chunks[i]->eqClass[cnt % 2])
216 ++cnt;
237 ++cnt;
271 for (unsigned cnt = 0; cnt != 2; ++cnt) {
273 uint32_t hash = sc->eqClass[cnt % 2];
276 hash += sym->getChunk()->eqClass[cnt % 2];
278 sc->eqClass[(cnt + 1) % 2] = hash | (1U << 31);
298 log("ICF needed " + Twine(cnt) + " iterations");