Lines Matching defs:value
62 count_limit is the value that is to be faked as the minimum value
63 and this minimum value is raised until the tree matches the
165 const uint8_t value,
171 if (previous_value != value) {
172 tree[*tree_size] = value;
178 tree[*tree_size] = value;
186 tree[*tree_size] = value;
345 /* We don't want to change value at counts[i],
384 const uint8_t value = depth[i];
387 for (k = i + 1; k < length && depth[k] == value; ++k) {
390 if (reps >= 3 && value == 0) {
394 if (reps >= 4 && value != 0) {
435 const uint8_t value = depth[i];
437 if ((value != 0 && use_rle_for_non_zero) ||
438 (value == 0 && use_rle_for_zero)) {
440 for (k = i + 1; k < new_length && depth[k] == value; ++k) {
444 if (value == 0) {
449 value, reps, tree_size,
451 previous_value = value;