UINT IR_EXPR_TAB::compute_hash_key_for_tree(IR * ir) { UINT hval = 0; m_iter.clean(); for (IR const* x = iterInitC(ir, m_iter); x != NULL; x = iterNextC(m_iter)) { hval += compute_hash_key(x); } return hval; }
unsigned int partial_tuple_hash(oidtype x) { // Standard hash function struct ptcell *dx = dr(x, ptcell); int k; oidtype elt; if (dx->remCnt < dx->size) for (k = 0; k < dx->size; k++) { elt = a_getelem(dx->tuple, k, FALSE); if (elt != nil) return compute_hash_key(elt); } return 1; }