Searched refs:hhead (Results 1 – 2 of 2) sorted by relevance
120 StorageIndex* hhead = W + 7*(n+1); in minimum_degree_ordering() local136 hhead[i] = -1; // hash list i is empty in minimum_degree_ordering()342 next[i] = hhead[h]; /* place i in hash bucket */ in minimum_degree_ordering()343 hhead[h] = i; in minimum_degree_ordering()357 i = hhead[h]; in minimum_degree_ordering()358 hhead[h] = -1; /* hash bucket will be empty */ in minimum_degree_ordering()
246 int* hhead = h->head; in ZopfliFindLongestMatch() local278 pp = hhead[hval]; /* During the whole loop, p == hprev[pp]. */ in ZopfliFindLongestMatch()333 if (hhead != h->head2 && bestlength >= h->same[hpos] && in ZopfliFindLongestMatch()336 hhead = h->head2; in ZopfliFindLongestMatch()