[SYCL][E2E] Use fine-grained includes in Graph/* tests (#13846)

Author: aelovikov-intel

sycl/test-e2e/Graph/Inputs/host_task.cpp

@@ -2,6 +2,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task2.cpp

@@ -2,6 +2,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task2_multiple_roots.cpp

@@ -3,6 +3,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task_last.cpp

@@ -2,6 +2,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task_multiple_deps.cpp

@@ -3,6 +3,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task_multiple_roots.cpp

@@ -3,6 +3,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task_single.cpp

@@ -2,6 +2,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/host_task_successive.cpp

@@ -2,6 +2,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+
 int main() {
   queue Queue{};
 

sycl/test-e2e/Graph/Inputs/interop-level-zero-get-native-mem.cpp

@@ -9,6 +9,8 @@
 // SYCL
 #include <sycl/ext/oneapi/backend/level_zero.hpp>
 
+#include <sycl/detail/host_task_impl.hpp>
+
 bool is_discrete(const device &Device) {
   auto ZeDevice = get_native<backend::ext_oneapi_level_zero>(Device);
   ze_device_properties_t ZeDeviceProps;

sycl/test-e2e/Graph/Inputs/spec_constants_handler_api.cpp

@@ -6,6 +6,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/specialization_id.hpp>
+
 constexpr sycl::specialization_id<int> IntId;
 constexpr sycl::specialization_id<int> IntId2(2);
 constexpr sycl::specialization_id<float> FloatId(3.14);

sycl/test-e2e/Graph/Inputs/spec_constants_kernel_bundle_api.cpp

@@ -6,6 +6,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/specialization_id.hpp>
+
 constexpr sycl::specialization_id<int> IntId(2);
 constexpr sycl::specialization_id<float> FloatId(3.14f);
 

sycl/test-e2e/Graph/Profiling/event_profiling_info.cpp

@@ -13,6 +13,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 #define GRAPH_TESTS_VERBOSE_PRINT 0
 
 #if GRAPH_TESTS_VERBOSE_PRINT

sycl/test-e2e/Graph/RecordReplay/barrier_multi_queue.cpp

@@ -8,6 +8,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   queue Queue1{{sycl::property::queue::in_order()}};
   queue Queue2{Queue1.get_context(),

sycl/test-e2e/Graph/RecordReplay/dotp_in_order.cpp

@@ -10,6 +10,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   property_list Properties{property::queue::in_order{}};
   queue Queue{Properties};

sycl/test-e2e/Graph/RecordReplay/dotp_in_order_pause.cpp

@@ -10,6 +10,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 void foo(sycl::queue Queue, size_t N, int *X, int *Y, int *Z) {
 
   auto Graph = Queue.ext_oneapi_get_graph();

sycl/test-e2e/Graph/RecordReplay/dotp_in_order_with_empty_nodes.cpp

@@ -12,6 +12,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   property_list Properties{property::queue::in_order{}};
   queue Queue{Properties};

sycl/test-e2e/Graph/RecordReplay/dotp_multiple_queues.cpp

@@ -10,6 +10,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   property_list Properties{property::queue::in_order{}};
   queue QueueA{Properties};

sycl/test-e2e/Graph/RecordReplay/host_task_in_order.cpp

@@ -12,6 +12,9 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   queue Queue{property::queue::in_order{}};
 

sycl/test-e2e/Graph/RecordReplay/in_order_queue_with_host_managed_dependencies.cpp

@@ -8,6 +8,9 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   using T = int;
 

sycl/test-e2e/Graph/RecordReplay/in_order_queue_with_host_managed_dependencies_memcpy.cpp

@@ -8,6 +8,9 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   using T = int;
 

sycl/test-e2e/Graph/RecordReplay/in_order_queue_with_host_managed_dependencies_memset.cpp

@@ -8,6 +8,9 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/detail/host_task_impl.hpp>
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   using T = int;
 

sycl/test-e2e/Graph/RecordReplay/sub_graph_in_order.cpp

@@ -10,6 +10,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   property_list Properties{property::queue::in_order{}};
   queue Queue{Properties};

sycl/test-e2e/Graph/RecordReplay/usm_copy_in_order.cpp

@@ -13,6 +13,8 @@
 
 #include "../graph_common.hpp"
 
+#include <sycl/properties/all_properties.hpp>
+
 int main() {
   property_list Properties{property::queue::in_order{}};
   queue Queue{Properties};

sycl/test-e2e/Graph/graph_common.hpp

@@ -1,4 +1,5 @@
-#include <sycl/sycl.hpp>
+#include <sycl/detail/core.hpp>
+#include <sycl/usm.hpp>
 
 #include <sycl/ext/oneapi/experimental/graph.hpp>