rem: hash_code %= (TABLE_ENTRIES-1);
add: hash_code &= (TABLE_ENTRIES-1);
context: int new_hash( str call_id, str cseq_nr ){	int hash_code = 0;	int i,j, k, third;	int ci_len, cs_len;	char c;	char *ci, *cs;	/* trim EoLs *//*	ci_len = call_id.len;	while (ci_len && ((c=call_id.s[ci_len-1])==0 || c=='\r' || c=='\n'))		ci_len--;	cs_len = cseq_nr.len;	while (cs_len && ((c=cseq_nr.s[cs_len-1])==0 || c=='\r' || c=='\n'))		cs_len--;*/	trim_len( ci_len, ci, call_id );	trim_len( cs_len, cs, cseq_nr );	/* run the cycle from the end ... we are interested in the	   most-right digits ... and just take the %10 value of it	*/	third=(ci_len-1)/3;	for ( i=ci_len-1, j=2*third, k=third;		k>0 ; i--, j--, k-- ) {		hash_code+=crc_16_tab[*(ci+i) /*+7*/ ]+			ccitt_tab[*(ci+k)+63]+				ccitt_tab[*(ci+j)+13];	}	for( i=0 ; i<cs_len ; i++ )		//hash_code+=crc_32_tab[(cseq_nr.s[i]+hash_code)%243];		hash_code+=ccitt_tab[*(cs+i)+123];	hash_code %= (TABLE_ENTRIES-1);   	return hash_code;}