Lines Matching refs:node
431 /* Index within the heap array of least frequent node in the Huffman tree */
454 * Restore the heap property by moving down the tree starting at node k,
455 * exchanging a node with the smallest of its two sons if necessary, stopping
462 int k; /* node to move down */
525 if (n > max_code) continue; /* not a leaf node */
632 int node; /* new node being created */
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
656 tree[node].Freq = 1;
657 s->depth[node] = 0;
658 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
659 /* node is 0 or 1 so it does not have extra bits */
671 node = elems; /* next internal node of the tree */
673 pqremove(s, tree, n); /* n = node of least frequency */
674 m = s->heap[SMALLEST]; /* m = node of next least frequency */
679 /* Create a new node father of n and m */
680 tree[node].Freq = tree[n].Freq + tree[m].Freq;
681 s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
683 tree[n].Dad = tree[m].Dad = (ush)node;
687 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
690 /* and insert the new node in the heap */
691 s->heap[SMALLEST] = node++;