Lines Matching refs:node
454 /* Index within the heap array of least frequent node in the Huffman tree */
477 * Restore the heap property by moving down the tree starting at node k,
478 * exchanging a node with the smallest of its two sons if necessary, stopping
485 int k; /* node to move down */
548 if (n > max_code) continue; /* not a leaf node */
655 int node; /* new node being created */
678 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
679 tree[node].Freq = 1;
680 s->depth[node] = 0;
681 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
682 /* node is 0 or 1 so it does not have extra bits */
694 node = elems; /* next internal node of the tree */
696 pqremove(s, tree, n); /* n = node of least frequency */
697 m = s->heap[SMALLEST]; /* m = node of next least frequency */
702 /* Create a new node father of n and m */
703 tree[node].Freq = tree[n].Freq + tree[m].Freq;
704 s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
706 tree[n].Dad = tree[m].Dad = (ush)node;
710 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
713 /* and insert the new node in the heap */
714 s->heap[SMALLEST] = node++;