443 	size_t offs, roffs, size, ndx;  local
562 		ndx = hashval % hash->dtah_size;
564 		for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) {
701 		if (hash->dtah_hash[ndx] != NULL)
702 			hash->dtah_hash[ndx]->dtahe_prev = h;
704 		h->dtahe_next = hash->dtah_hash[ndx];
705 		hash->dtah_hash[ndx] = h;
807 		int ndx = i + keypos;  local
809 		if (ndx >= nrecs)
810 			ndx = ndx - nrecs + 1;
812 		lrec = &lagg->dtagd_rec[ndx];
813 		rrec = &ragg->dtagd_rec[ndx];
1217 			size_t ndx = h->dtahe_hashval % hash->dtah_size;  local
1219 			assert(hash->dtah_hash[ndx] == h);
1220 			hash->dtah_hash[ndx] = h->dtahe_next;
1728 		int ndx = i + sortpos;  local
1730 		if (ndx >= naggvars)
1731 			ndx -= naggvars;
1733 		aggvar = aggvars[ndx];
1761 			    naggvars] == aggvars[ndx]);
1777 		int ndx;  local
1779 		if ((id = dt_aggregate_aggvarid(h)) > max || !(ndx = map[id]))
1782 		if (zaggdata[ndx - 1].dtahe_size == 0) {
1783 			zaggdata[ndx - 1].dtahe_size = h->dtahe_size;
1784 			zaggdata[ndx - 1].dtahe_data = h->dtahe_data;
2085 			int ndx = j - sortpos;  local
2087 			if (ndx < 0)
2088 				ndx += naggvars;
2090 			assert(bundle[i][ndx] != NULL);
2091 			data[j + 1] = &bundle[i][ndx]->dtahe_data;