Lines Matching refs:levels

26 	unsigned int		*levels;
82 if (pb->levels)
83 duty_cycle = pb->levels[brightness];
201 * Once we have 4096 levels there's little point going much higher...
208 data->levels = devm_kcalloc(dev, data->max_brightness,
209 sizeof(*data->levels), GFP_KERNEL);
210 if (!data->levels)
220 data->levels[i] = (unsigned int)retval;
255 * Determine the number of brightness levels, if this property is not
256 * set a default table of brightness levels will be used.
258 prop = of_find_property(node, "brightness-levels", &length);
264 /* read brightness levels from DT property */
266 data->levels = devm_kcalloc(dev, num_levels,
267 sizeof(*data->levels), GFP_KERNEL);
268 if (!data->levels)
271 ret = of_property_read_u32_array(node, "brightness-levels",
272 data->levels,
286 * interpolation between each of the values of brightness levels
294 * brightness-levels table, otherwise we can't interpolate
310 * Recalculate the number of brightness levels, now
312 * steps between two levels.
315 dev_dbg(dev, "new number of brightness levels: %d\n",
319 * Create a new table of brightness levels with all the
334 y1 = data->levels[i];
335 y2 = data->levels[i + 1];
348 * brightness levels table and replace for the
351 devm_kfree(dev, data->levels);
352 data->levels = table;
386 unsigned int min_val = data->levels[0];
387 unsigned int max_val = data->levels[nlevels - 1];
399 unsigned int delta = abs(linear_value - data->levels[i]);
542 if (data->levels) {
543 pb->levels = data->levels;
546 * For the DT case, only when brightness levels is defined
547 * data->levels is filled. For the non-DT case, data->levels
551 if (data->levels[i] > pb->scale)
552 pb->scale = data->levels[i];
560 * If no brightness levels are provided and max_brightness is
562 * max_brightness is set to 0 when brightness levels is not
579 if (data->levels[i] > pb->scale)
580 pb->scale = data->levels[i];
582 pb->levels = data->levels;