Lines Matching defs:node
335 ush dad; /* father node in Huffman tree */
2588 /* Index within the heap array of least frequent node in the Huffman tree */
2613 * Restore the heap property by moving down the tree starting at node k,
2614 * exchanging a node with the smallest of its two sons if necessary, stopping
2622 int k; /* node to move down */
2689 if (n > max_code) continue; /* not a leaf node */
2812 int node; /* new node being created */
2837 node = s->heap[++(s->heap_len)] = (max_code < 2 ?
2839 tree[node].Freq = 1;
2840 s->depth[node] = 0;
2841 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2842 /* node is 0 or 1 so it does not have extra bits */
2856 node = elems; /* next internal node of the tree */
2858 pqremove(s, tree, n); /* n = node of least frequency */
2859 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2865 /* Create a new node father of n and m */
2866 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2867 s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
2868 tree[n].Dad = tree[m].Dad = (ush)node;
2872 node, tree[node].Freq, n, tree[n].Freq, m,
2876 /* and insert the new node in the heap */
2877 s->heap[SMALLEST] = node++;