30 typedef struct Node Node;  typedef
35 struct Node {  struct
37   Node* tail;  /* Previous node(s) of this chain, or 0 if none. */  argument
46   Node* nodes;  /* The pool. */  argument
47   Node* next;  /* Pointer to a possibly free node in the pool. */
54 static void InitNode(size_t weight, int count, Node* tail, Node* node) {  in InitNode()
67 static Node* GetFreeNode(Node* (*lists)[2], int maxbits, NodePool* pool) {  in GetFreeNode()
77           Node* node;  in GetFreeNode()
105 static void BoundaryPM(Node* (*lists)[2], int maxbits,  in BoundaryPM()
106     Node* leaves, int numsymbols, NodePool* pool, int index, char final) {  in BoundaryPM()
107   Node* newchain;  in BoundaryPM()
108   Node* oldchain;  in BoundaryPM()
146     NodePool* pool, const Node* leaves, int maxbits, Node* (*lists)[2]) {  in InitLists()
148   Node* node0 = GetFreeNode(0, maxbits, pool);  in InitLists()
149   Node* node1 = GetFreeNode(0, maxbits, pool);  in InitLists()
163 static void ExtractBitLengths(Node* chain, Node* leaves, unsigned* bitlengths) {  in ExtractBitLengths()
164   Node* node;  in ExtractBitLengths()
177   return ((const Node*)a)->weight - ((const Node*)b)->weight;  in LeafComparator()
189   Node* (*lists)[2];  in ZopfliLengthLimitedCodeLengths()
192   Node* leaves = (Node*)malloc(n * sizeof(*leaves));  in ZopfliLengthLimitedCodeLengths()
224   qsort(leaves, numsymbols, sizeof(Node), LeafComparator);  in ZopfliLengthLimitedCodeLengths()
228   pool.nodes = (Node*)malloc(pool.size * sizeof(*pool.nodes));  in ZopfliLengthLimitedCodeLengths()
234   lists = (Node* (*)[2])malloc(maxbits * sizeof(*lists));  in ZopfliLengthLimitedCodeLengths()