[oneDPL][test] Optimize merge_sort algorithm for largest data sizes (#1977)

Author: SergeyKopienko

include/oneapi/dpl/pstl/hetero/dpcpp/parallel_backend_sycl.h

@@ -2212,6 +2212,9 @@ struct __parallel_partial_sort_submitter<__internal::__optional_kernel_name<_Glo
     }
 };
 
+template <typename... _Name>
+class __sort_global_kernel;
+
 template <typename _ExecutionPolicy, typename _Range, typename _Merge, typename _Compare>
 auto
 __parallel_partial_sort_impl(oneapi::dpl::__internal::__device_backend_tag, _ExecutionPolicy&& __exec, _Range&& __rng,

include/oneapi/dpl/pstl/hetero/dpcpp/parallel_backend_sycl_merge.h

@@ -164,10 +164,13 @@ __serial_merge(const _Rng1& __rng1, const _Rng2& __rng2, _Rng3& __rng3, const _I
     _Index __rng1_idx = __start1;
     _Index __rng2_idx = __start2;
 
+    bool __rng1_idx_less_n1 = false;
+    bool __rng2_idx_less_n2 = false;
+
     for (_Index __rng3_idx = __start3; __rng3_idx < __rng3_idx_end; ++__rng3_idx)
     {
-        const bool __rng1_idx_less_n1 = __rng1_idx < __rng1_idx_end;
-        const bool __rng2_idx_less_n2 = __rng2_idx < __rng2_idx_end;
+        __rng1_idx_less_n1 = __rng1_idx < __rng1_idx_end;
+        __rng2_idx_less_n2 = __rng2_idx < __rng2_idx_end;
 
         // One of __rng1_idx_less_n1 and __rng2_idx_less_n2 should be true here
         // because 1) we should fill output data with elements from one of the input ranges