| /src/external/zlib/pigz/dist/zopfli/ |
| katajainen.c | 33 Nodes forming chains. Also used to represent leaves.
38 int count; /* Leaf symbol index, or number of leaves before this chain. */
98 leaves: The leaves, one per symbol.
99 numsymbols: Number of leaves.
106 Node* leaves, int numsymbols, NodePool* pool, int index, char final) {
123 InitNode(leaves[lastcount].weight, lastcount + 1, 0, newchain);
126 if (lastcount < numsymbols && sum > leaves[lastcount].weight) {
128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail,
134 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0)
192 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); local
[all...] |
| /src/external/mpl/bind/dist/lib/dns/include/dns/ |
| qp.h | 311 size_t leaves; /*%< values in the trie */ member in struct:dns_qp_memusage
|
| /src/external/cddl/osnet/dist/cmd/ztest/ |
| ztest.c | 2500 uint64_t leaves; local
2506 leaves = MAX(zs->zs_mirrors + zs->zs_splits, 1) * ztest_opts.zo_raidz;
2510 ztest_shared->zs_vdev_next_leaf = find_vdev_hole(spa) * leaves;
2752 uint64_t leaves; local
2765 leaves = MAX(zs->zs_mirrors, 1) * ztest_opts.zo_raidz;
2782 leaf = ztest_random(leaves);
2840 top * leaves + leaf);
4789 uint64_t leaves; local
4805 leaves = MAX(zs->zs_mirrors, 1) * ztest_opts.zo_raidz;
4809 ASSERT(leaves >= 1)
[all...] |
