Lines Matching refs:lists
63 lists: If given, used to mark in-use nodes during garbage collection.
64 maxbits: Size of lists.
67 static Node* GetFreeNode(Node* (*lists)[2], int maxbits, NodePool* pool) {
75 if (lists) {
78 for (node = lists[i / 2][i % 2]; node; node = node->tail) {
96 lists: The lists of chains.
97 maxbits: Number of lists.
105 static void BoundaryPM(Node* (*lists)[2], int maxbits,
109 int lastcount = lists[index][1]->count; /* Count of last chain of list. */
113 newchain = GetFreeNode(lists, maxbits, pool);
114 oldchain = lists[index][1];
118 lists[index][0] = oldchain;
119 lists[index][1] = newchain;
125 size_t sum = lists[index - 1][0]->weight + lists[index - 1][1]->weight;
131 InitNode(sum, lastcount, lists[index - 1][1], newchain);
134 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0);
135 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0);
146 NodePool* pool, const Node* leaves, int maxbits, Node* (*lists)[2]) {
153 lists[i][0] = node0;
154 lists[i][1] = node1;
187 /* Array of lists of chains. Each list requires only two lookahead chains at
189 Node* (*lists)[2];
234 lists = (Node* (*)[2])malloc(maxbits * sizeof(*lists));
235 InitLists(&pool, leaves, maxbits, lists);
242 BoundaryPM(lists, maxbits, leaves, numsymbols, &pool, maxbits - 1, final);
245 ExtractBitLengths(lists[maxbits - 1][1], leaves, bitlengths);
247 free(lists);
