225       sections[i]->eqClass[next] = eqClassBase + mid;  in segregate()
361     if (x->eqClass[current] == 0)  in variableEq()
363     if (x->eqClass[current] != y->eqClass[current])  in variableEq()
381   uint32_t eqClass = sections[begin]->eqClass[current];  in findBoundary()  local
383     if (eqClass != sections[i]->eqClass[current])  in findBoundary()
443   uint32_t hash = isec->eqClass[cnt % 2];  in combineRelocHashes()
448         hash += relSec->eqClass[cnt % 2];  in combineRelocHashes()
451   isec->eqClass[(cnt + 1) % 2] = hash | (1U << 31);  in combineRelocHashes()
479         [&](InputSection &s) { s.eqClass[0] = s.eqClass[1] = ++uniqueId; });  in run()
484     if (s && s->eqClass[0] == 0) {  in run()
490         s->eqClass[0] = s->eqClass[1] = ++uniqueId;  in run()
497     s->eqClass[0] = xxHash64(s->content()) | (1U << 31);  in run()
516     return a->eqClass[0] < b->eqClass[0];  in run()