Lines Matching defs:node
79 * Find the lowest probability node in a Huffman table, and mark it as
81 * @return the node index of the lowest unused node, or -1 if all nodes
113 * num_huff_nodes[prev] - contains the index to the root node of the tree.
114 * That is: huff_nodes[prev][num_huff_nodes[prev]] is the root node.
117 hnode *node, *hnodes;
126 node = &hnodes[num_hnodes]; /* next free node */
129 node->children[0] = huff_smallest_node(hnodes, num_hnodes);
130 if(node->children[0] == -1)
131 break; /* reached the root node */
133 node->children[1] = huff_smallest_node(hnodes, num_hnodes);
134 if(node->children[1] == -1)
135 break; /* reached the root node */
137 /* combine nodes probability for new node */
138 node->count = hnodes[node->children[0]].count +
139 hnodes[node->children[1]].count;