Lines Matching defs:node
190 ush dad; /* father node in Huffman tree */
1785 /* Index within the heap array of least frequent node in the Huffman tree */
1808 * Restore the heap property by moving down the tree starting at node k,
1809 * exchanging a node with the smallest of its two sons if necessary, stopping
1816 int k; /* node to move down */
1879 if (n > max_code) continue; /* not a leaf node */
1986 int node; /* new node being created */
2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2010 tree[node].Freq = 1;
2011 s->depth[node] = 0;
2012 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2013 /* node is 0 or 1 so it does not have extra bits */
2025 node = elems; /* next internal node of the tree */
2027 pqremove(s, tree, n); /* n = node of least frequency */
2028 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2033 /* Create a new node father of n and m */
2034 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2035 s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
2036 tree[n].Dad = tree[m].Dad = (ush)node;
2040 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2043 /* and insert the new node in the heap */
2044 s->heap[SMALLEST] = node++;