X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2Fsvgtiny_gradient.c;h=c36df3207675aed084a8357706ef06efdf55d0bb;hb=988e0d0819c7e6b068b1c1741a50b547f8414cf7;hp=6842a0b2c2261fdec388ddb00f5ffd9e361e7871;hpb=c1790b31d40b6809dfc1f9a6ab49289a372280dd;p=libsvgtiny.git

diff --git a/src/svgtiny_gradient.c b/src/svgtiny_gradient.c
index 6842a0b..c36df32 100644
--- a/src/svgtiny_gradient.c
+++ b/src/svgtiny_gradient.c
@@ -410,8 +410,7 @@ svgtiny_code svgtiny_add_path_linear_gradient(float *p, unsigned int n,
 	/* r, r0, r1 are distance along gradient vector */
 	gradient_norm_squared = gradient_dx * gradient_dx +
 	                              gradient_dy * gradient_dy;
-	pts = svgtiny_list_create(
-			sizeof (struct grad_point));
+	pts = svgtiny_list_create(sizeof (struct grad_point));
 	if (!pts)
 		return svgtiny_OUT_OF_MEMORY;
 	for (j = 0; j != n; ) {
@@ -540,6 +539,13 @@ svgtiny_code svgtiny_add_path_linear_gradient(float *p, unsigned int n,
 			svgtiny_list_size(pts), min_pt, min_r);
 	#endif
 
+        /* There must be at least a single point for the gradient */
+        if (svgtiny_list_size(pts) == 0) {
+            svgtiny_list_free(pts);
+
+            return svgtiny_OK;
+        }
+        
 	/* render triangles */
 	stop_count = state->linear_gradient_stop_count;
 	assert(2 <= stop_count);
@@ -658,7 +664,7 @@ svgtiny_code svgtiny_add_path_linear_gradient(float *p, unsigned int n,
 
 	/* render triangle vertices with r values for debugging */
 	#ifdef GRADIENT_DEBUG
-	for (unsigned int i = 0; i != pts->size; i++) {
+	for (unsigned int i = 0; i != svgtiny_list_size(pts); i++) {
 		struct grad_point *point = svgtiny_list_get(pts, i);
 		struct svgtiny_shape *shape = svgtiny_add_shape(state);
 		if (!shape)