lv_arc_t::value - syntax, references, description

References

Code

Location

Referrer

int32_t value; /**< Current value of the arc */

lv_arc_private.h:36

int32_t val = arc->value;

lv_arc.c:215

lv_arc_set_mode()

arc->value = -1; /** Force set_value handling*/

lv_arc.c:218

lv_arc_set_mode()

if(arc->value == value) return;

lv_arc.c:244

lv_arc_set_value()

if(arc->value == new_value) return;

lv_arc.c:250

lv_arc_set_value()

arc->value = new_value;

lv_arc.c:251

lv_arc_set_value()

if(arc->value < min) {

arc->value = min;

if(arc->value > max) {

arc->value = max;

return ((lv_arc_t *) obj)->value;

lv_arc.c:323

lv_arc_get_value()

arc->value = VALUE_UNSET;

lv_arc.c:426

lv_arc_constructor()

int32_t old_value = arc->value;

lv_arc.c:582

lv_arc_event()

int32_t old_value = arc->value;

lv_arc.c:618

lv_arc_event()

if(old_value != arc->value) {

lv_arc.c:626

lv_arc_event()

int32_t old_value = arc->value;

lv_arc.c:634

lv_arc_event()

if(old_value != arc->value) {

lv_arc.c:636

lv_arc_event()

if(arc->value == VALUE_UNSET) return;

lv_arc.c:884

value_update()

if(arc->value < range_midpoint) {

lv_arc.c:896

value_update()

angle = lv_map(arc->value, arc->min_value, range_midpoint, (int32_t)arc->bg_angle_start, (int32_t)bg_midpoint);

lv_arc.c:897

value_update()

angle = lv_map(arc->value, range_midpoint, arc->max_value, (int32_t)bg_midpoint, (int32_t)bg_end);

lv_arc.c:902

value_update()

angle = lv_map(arc->value, arc->min_value, arc->max_value, (int32_t)bg_end, (int32_t)arc->bg_angle_start);

lv_arc.c:908

value_update()

angle = lv_map(arc->value, arc->min_value, arc->max_value, (int32_t)arc->bg_angle_start, (int32_t)bg_end);

lv_arc.c:912

value_update()

Call Tree

All items filtered out

Data Use

lv_arc_t::value is written by 4 functions and is read by 6 functions:

lv_arc_t::value

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

lv_arc_t::value field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle