Merge pull request #5 from jvdp1/add_checks1

Add checks on `work` and `iwork`

Author: wclodius2

src/stdlib_sorting_ord_sort.fypp

@@ -111,12 +111,15 @@ contains
         integer(int_size) :: array_size
         integer :: stat
 
+        array_size = size( array, kind=int_size )
         if ( present(work) ) then
+            if ( size( work, kind=int_size) < array_size/2 ) then
+                error stop "${k1}$_${sname}$_ord_sort: work array is too small."
+            endif
 ! Use the work array as scratch memory
             call merge_sort( array, work )
         else
 ! Allocate a buffer to use as scratch memory.
-            array_size = size( array, kind=int_size )
             allocate( buf(0:array_size/2-1), stat=stat )
             if ( stat /= 0 ) error stop "${k1}$_${sname}$_ord_sort: Allocation of buffer failed."
             call merge_sort( array, buf )

src/stdlib_sorting_sort_index.fypp

@@ -107,7 +107,13 @@ contains
 
 ! If necessary allocate buffers to serve as scratch memory.
         if ( present(work) ) then
+            if ( size(work, kind=int_size) < array_size/2 ) then
+                error stop "work array is too small."
+            end if
             if ( present(iwork) ) then
+                if ( size(iwork, kind=int_size) < array_size/2 ) then
+                    error stop "iwork array is too small."
+                endif
                 call merge_sort( array, index, work, iwork )
             else
                 allocate( ibuf(0:array_size/2-1), stat=stat )
@@ -118,6 +124,9 @@ contains
             allocate( buf(0:array_size/2-1), stat=stat )
             if ( stat /= 0 ) error stop "Allocation of array buffer failed."
             if ( present(iwork) ) then
+                if ( size(iwork, kind=int_size) < array_size/2 ) then
+                    error stop "iwork array is too small."
+                endif
                 call merge_sort( array, index, buf, iwork )
             else
                 allocate( ibuf(0:array_size/2-1), stat=stat )