43         if ((lv_array_size(&(P)->points) + (N)) > lv_array_capacity(&(P)->points)) { \
44             lv_array_resize(&(P)->points, ((P)->points.capacity << 1)); \
100     lv_fpoint_t * pt = lv_array_front(&path->points);  in lv_matrix_transform_path()
101     uint32_t size = lv_array_size(&path->points);  in lv_matrix_transform_path()
115     lv_array_init(&path->points, 8, sizeof(lv_fpoint_t));  in lv_vector_path_create()
123     lv_array_copy(&target_path->points, &path->points);  in lv_vector_path_copy()
129     lv_array_clear(&path->points);  in lv_vector_path_clear()
135     lv_array_deinit(&path->points);  in lv_vector_path_delete()
145     lv_array_push_back(&path->points, p);  in lv_vector_path_move_to()
159     lv_array_push_back(&path->points, p);  in lv_vector_path_line_to()
173     lv_array_push_back(&path->points, p1);  in lv_vector_path_quad_to()
174     lv_array_push_back(&path->points, p2);  in lv_vector_path_quad_to()
189     lv_array_push_back(&path->points, p1);  in lv_vector_path_cubic_to()
190     lv_array_push_back(&path->points, p2);  in lv_vector_path_cubic_to()
191     lv_array_push_back(&path->points, p3);  in lv_vector_path_cubic_to()
212     uint32_t len = lv_array_size(&path->points);  in lv_vector_path_get_bounding()
218     lv_fpoint_t * p = lv_array_front(&path->points);  in lv_vector_path_get_bounding()
457     uint32_t point_size = lv_array_size(&path->points);  in lv_vector_path_append_path()
458     uint32_t npoint_size = lv_array_size(&subpath->points);  in lv_vector_path_append_path()
463     lv_array_concat(&path->points, &subpath->points);  in lv_vector_path_append_path()
464     path->points.size = point_size + npoint_size;  in lv_vector_path_append_path()