summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndres Freund2016-03-08 21:33:24 +0000
committerAndres Freund2016-03-08 21:42:58 +0000
commitc5f1fbbfb51d852f0e9a1143dae9faa5186c1b2d (patch)
treeb1ed275e755cccfb33a3e681f7e03ac34c3657a8
parent5a39c7395d2dcf44f62256ec05b66341149f222f (diff)
plperl: Correctly handle empty arrays in plperl_ref_from_pg_array.
plperl_ref_from_pg_array() didn't consider the case that postgrs arrays can have 0 dimensions (when they're empty) and accessed the first dimension without a check. Fix that by special casing the empty array case. Author: Alex Hunsaker Reported-By: Andres Freund / valgrind / buildfarm animal skink Discussion: [email protected] Backpatch: 9.1-
-rw-r--r--src/pl/plperl/plperl.c29
1 files changed, 20 insertions, 9 deletions
diff --git a/src/pl/plperl/plperl.c b/src/pl/plperl/plperl.c
index 2c4b420b52e..1ebcd9fd50b 100644
--- a/src/pl/plperl/plperl.c
+++ b/src/pl/plperl/plperl.c
@@ -1423,17 +1423,25 @@ plperl_ref_from_pg_array(Datum arg, Oid typid)
info->ndims = ARR_NDIM(ar);
dims = ARR_DIMS(ar);
- deconstruct_array(ar, elementtype, typlen, typbyval,
- typalign, &info->elements, &info->nulls,
- &nitems);
+ /* No dimensions? Return an empty array */
+ if (info->ndims == 0)
+ {
+ av = newRV_noinc((SV *) newAV());
+ }
+ else
+ {
+ deconstruct_array(ar, elementtype, typlen, typbyval,
+ typalign, &info->elements, &info->nulls,
+ &nitems);
- /* Get total number of elements in each dimension */
- info->nelems = palloc(sizeof(int) * info->ndims);
- info->nelems[0] = nitems;
- for (i = 1; i < info->ndims; i++)
- info->nelems[i] = info->nelems[i - 1] / dims[i - 1];
+ /* Get total number of elements in each dimension */
+ info->nelems = palloc(sizeof(int) * info->ndims);
+ info->nelems[0] = nitems;
+ for (i = 1; i < info->ndims; i++)
+ info->nelems[i] = info->nelems[i - 1] / dims[i - 1];
- av = split_array(info, 0, nitems, 0);
+ av = split_array(info, 0, nitems, 0);
+ }
hv = newHV();
(void) hv_store(hv, "array", 5, av, 0);
@@ -1452,6 +1460,9 @@ split_array(plperl_array_info *info, int first, int last, int nest)
int i;
AV *result;
+ /* we should only be called when we have something to split */
+ Assert(info->ndims > 0);
+
/* since this function recurses, it could be driven to stack overflow */
check_stack_depth();