145  * The leaves of the trie are embedded in the trie, and so the same
157  *          between 0 and 254 inclusive, which leaves 255 available as
424 	int nodes, singletons, leaves;  in tree_walk()  local
426 	nodes = singletons = leaves = 0;  in tree_walk()
432 		leaves = 1;  in tree_walk()
456 						leaves += 1;  in tree_walk()
470 						leaves += 1;  in tree_walk()
485 	printf("nodes %d leaves %d singletons %d\n",  in tree_walk()
486 	       nodes, leaves, singletons);  in tree_walk()
528  * fully populated and end in identical leaves. A nextbyte tagged
643  * identical choices and end in identical leaves.  The keymask and
646  * branch of a node, and the two leaves comare identical, the node in
812  * Mark the nodes in the tree that lead to leaves that must be
1042  * Compute the size of nodes and leaves. We start by assuming that
1197 	int leaves;  in emit()  local
1202 	leaves = 0;  in emit()
1214 		leaves++;  in emit()
1280 					leaves++;  in emit()
1297 					leaves++;  in emit()
1313 		printf("Emitted %d (%d) leaves",  in emit()
1314 			leaves, bytes);  in emit()