Lines Matching refs:node
451 /* Index within the heap array of least frequent node in the Huffman tree */
474 * Restore the heap property by moving down the tree starting at node k,
475 * exchanging a node with the smallest of its two sons if necessary, stopping
482 int k; /* node to move down */
545 if (n > max_code) continue; /* not a leaf node */
652 int node; /* new node being created */
675 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
676 tree[node].Freq = 1;
677 s->depth[node] = 0;
678 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
679 /* node is 0 or 1 so it does not have extra bits */
691 node = elems; /* next internal node of the tree */
693 pqremove(s, tree, n); /* n = node of least frequency */
694 m = s->heap[SMALLEST]; /* m = node of next least frequency */
699 /* Create a new node father of n and m */
700 tree[node].Freq = tree[n].Freq + tree[m].Freq;
701 s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
703 tree[n].Dad = tree[m].Dad = (ush)node;
707 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
710 /* and insert the new node in the heap */
711 s->heap[SMALLEST] = node++;