Lines Matching defs:frq
8377 // Compute Huffman codes (based on frq input) and store them in frq:
8390 long long *frq, // io: input frequencies [HUF_ENCSIZE], output table
8391 int *im, // o: min frq index
8392 int *iM) // o: max frq index
8395 // This function assumes that when it is called, array frq
8397 // that are to be Huffman-encoded. (frq[i] contains the number
8403 // to non-zero entries in frq:
8405 // frq[im] != 0, and frq[i] == 0 for all i < im
8406 // frq[iM] != 0, and frq[i] == 0 for all i > iM
8409 // entries in frq.
8420 while (!frq[*im]) (*im)++;
8427 if (frq[i]) {
8428 fHeap[nf] = &frq[i];
8435 // Add a pseudo-symbol, with a frequency count of 1, to frq;
8441 frq[*iM] = 1;
8442 fHeap[nf] = &frq[*iM];
8480 // Find the indices, mm and m, of the two smallest non-zero frq
8481 // values in fHeap, add the smallest frq to the second-smallest
8482 // frq, and remove the smallest frq value from fHeap.
8485 int mm = fHeap[0] - frq;
8489 int m = fHeap[0] - frq;
8492 frq[m] += frq[mm];
8545 // code table from scode into frq.
8549 memcpy(frq, scode.data(), sizeof(long long) * HUF_ENCSIZE);