Lines Matching refs:node
289 /* Index within the heap array of least frequent node in the Huffman tree */
312 * Restore the heap property by moving down the tree starting at node k,
313 * exchanging a node with the smallest of its two sons if necessary, stopping
320 int k /* node to move down */
385 if (n > max_code) continue; /* not a leaf node */
494 int node; /* new node being created */
517 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
518 tree[node].Freq = 1;
519 s->depth[node] = 0;
520 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
521 /* node is 0 or 1 so it does not have extra bits */
533 node = elems; /* next internal node of the tree */
535 pqremove(s, tree, n); /* n = node of least frequency */
536 m = s->heap[SMALLEST]; /* m = node of next least frequency */
541 /* Create a new node father of n and m */
542 tree[node].Freq = tree[n].Freq + tree[m].Freq;
543 s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1);
544 tree[n].Dad = tree[m].Dad = (ush)node;
548 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
551 /* and insert the new node in the heap */
552 s->heap[SMALLEST] = node++;