[pstl] Declare main() as returning int, not int32_t

llvm-svn: 366490

pstl/test/pstl/header_inclusion_order_algorithm_0.pass.cpp

@@ -14,7 +14,7 @@
 #include <execution>
 #include <algorithm>
 
-int32_t
+int
 main()
 {
     return 0;

pstl/test/pstl/header_inclusion_order_algorithm_1.pass.cpp

@@ -14,7 +14,7 @@
 #include <algorithm>
 #include <execution>
 
-int32_t
+int
 main()
 {
     return 0;

pstl/test/pstl/header_inclusion_order_memory_0.pass.cpp

@@ -14,7 +14,7 @@
 #include <execution>
 #include <memory>
 
-int32_t
+int
 main()
 {
     return 0;

pstl/test/pstl/header_inclusion_order_memory_1.pass.cpp

@@ -14,7 +14,7 @@
 #include <memory>
 #include <execution>
 
-int32_t
+int
 main()
 {
     return 0;

pstl/test/pstl/header_inclusion_order_numeric_0.pass.cpp

@@ -14,7 +14,7 @@
 #include <execution>
 #include <numeric>
 
-int32_t
+int
 main()
 {
     return 0;

pstl/test/pstl/header_inclusion_order_numeric_1.pass.cpp

@@ -14,7 +14,7 @@
 #include <numeric>
 #include <execution>
 
-int32_t
+int
 main()
 {
     return 0;

pstl/test/std/algorithms/alg.merge/inplace_merge.pass.cpp

@@ -134,7 +134,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test_by_type<float64_t>([](int32_t i) { return -2 * i; }, [](int32_t i) { return -(2 * i + 1); },

pstl/test/std/algorithms/alg.merge/merge.pass.cpp

@@ -96,7 +96,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test_merge_by_type<int32_t>([](size_t v) { return (v % 2 == 0 ? v : -v) * 3; }, [](size_t v) { return v * 2; });

pstl/test/std/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp

@@ -123,7 +123,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<float64_t>(-666.0, [](const float64_t& x) { return x * x <= 1024; },

pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp

@@ -84,7 +84,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<float64_t>([](const float64_t x) { return x < 0; });

pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/partition.pass.cpp

@@ -161,7 +161,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 #if !_PSTL_ICC_16_17_TEST_REDUCTION_RELEASE_BROKEN

pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/partition_copy.pass.cpp

@@ -97,7 +97,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>([](const int32_t value) { return value % 2; });

pstl/test/std/algorithms/alg.modifying.operations/alg.reverse/reverse.pass.cpp

@@ -89,7 +89,7 @@ struct wrapper
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>();

pstl/test/std/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp

@@ -117,7 +117,7 @@ test()
     }
 }
 
-int32_t
+int
 main()
 {
     // clang-3.8 fails to correctly auto vectorize the loop in some cases of different types of container's elements,

pstl/test/std/algorithms/alg.modifying.operations/copy_move.pass.cpp

@@ -185,7 +185,7 @@ test(T trash, Convert convert)
     }
 }
 
-int32_t
+int
 main()
 {
     test<int32_t>(-666, [](size_t j) { return int32_t(j); });

pstl/test/std/algorithms/alg.modifying.operations/fill.pass.cpp

@@ -82,7 +82,7 @@ test_fill_by_type(std::size_t n)
     invoke_on_all_policies(test_fill_n(), in.begin(), n, value);
 }
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.modifying.operations/generate.pass.cpp

@@ -91,7 +91,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.modifying.operations/remove.pass.cpp

@@ -130,7 +130,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 #if !_PSTL_ICC_18_TEST_EARLY_EXIT_MONOTONIC_RELEASE_BROKEN

pstl/test/std/algorithms/alg.modifying.operations/remove_copy.pass.cpp

@@ -76,7 +76,7 @@ test(T trash, const T& value, Convert convert, bool check_weakness = true)
     }
 }
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.modifying.operations/replace.pass.cpp

@@ -145,7 +145,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t, float32_t>(__pstl::__internal::__equal_value<int32_t>(666));

pstl/test/std/algorithms/alg.modifying.operations/replace_copy.pass.cpp

@@ -83,7 +83,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.modifying.operations/rotate.pass.cpp

@@ -162,7 +162,7 @@ test()
     }
 }
 
-int32_t
+int
 main()
 {
     test<int32_t>();

pstl/test/std/algorithms/alg.modifying.operations/rotate_copy.pass.cpp

@@ -133,7 +133,7 @@ test()
     }
 }
 
-int32_t
+int
 main()
 {
     test<int32_t, int8_t>();

pstl/test/std/algorithms/alg.modifying.operations/swap_ranges.pass.cpp

@@ -120,7 +120,7 @@ test()
     }
 }
 
-int32_t
+int
 main()
 {
     test<wrapper<uint16_t>>();

pstl/test/std/algorithms/alg.modifying.operations/transform_binary.pass.cpp

@@ -103,7 +103,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     //const operator()

pstl/test/std/algorithms/alg.modifying.operations/transform_unary.pass.cpp

@@ -75,7 +75,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t, int32_t>();

pstl/test/std/algorithms/alg.modifying.operations/unique.pass.cpp

@@ -136,7 +136,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 #if !_PSTL_ICC_16_17_18_TEST_UNIQUE_MASK_RELEASE_BROKEN

pstl/test/std/algorithms/alg.modifying.operations/unique_copy_equal.pass.cpp

@@ -115,7 +115,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<Number>(Number(42, OddTag()), std::equal_to<Number>(),

pstl/test/std/algorithms/alg.nonmodifying/adjacent_find.pass.cpp

@@ -100,7 +100,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.nonmodifying/all_of.pass.cpp

@@ -100,7 +100,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>(8 * sizeof(int32_t));

pstl/test/std/algorithms/alg.nonmodifying/any_of.pass.cpp

@@ -86,7 +86,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>(8 * sizeof(int32_t));

pstl/test/std/algorithms/alg.nonmodifying/count.pass.cpp

@@ -90,7 +90,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>(42, IsEqual<int32_t>(50, OddTag()), [](int32_t j) { return j; });

pstl/test/std/algorithms/alg.nonmodifying/equal.pass.cpp

@@ -149,7 +149,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.nonmodifying/find.pass.cpp

@@ -80,7 +80,7 @@ class Weird
     Weird(int32_t val, OddTag) : value(val, OddTag()) {}
 };
 
-int32_t
+int
 main()
 {
     // Note that the "hit" and "miss" functions here avoid overflow issues.

pstl/test/std/algorithms/alg.nonmodifying/find_end.pass.cpp

@@ -106,7 +106,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>(8 * sizeof(int32_t));

pstl/test/std/algorithms/alg.nonmodifying/find_first_of.pass.cpp

@@ -98,7 +98,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>(std::equal_to<int32_t>());

pstl/test/std/algorithms/alg.nonmodifying/find_if.pass.cpp

@@ -89,7 +89,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 #if !_PSTL_ICC_17_TEST_MAC_RELEASE_32_BROKEN

pstl/test/std/algorithms/alg.nonmodifying/for_each.pass.cpp

@@ -88,7 +88,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>();

pstl/test/std/algorithms/alg.nonmodifying/mismatch.pass.cpp

@@ -117,7 +117,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.nonmodifying/none_of.pass.cpp

@@ -84,7 +84,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>(8 * sizeof(int32_t));

pstl/test/std/algorithms/alg.nonmodifying/nth_element.pass.cpp

@@ -156,7 +156,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test_by_type<int32_t>([](int32_t i) { return 10 * i; }, [](int32_t i) { return i + 1; }, std::less<int32_t>());

pstl/test/std/algorithms/alg.nonmodifying/search_n.pass.cpp

@@ -92,7 +92,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<int32_t>();

pstl/test/std/algorithms/alg.sorting/alg.heap.operations/is_heap.pass.cpp

@@ -132,7 +132,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test_is_heap_by_type<float32_t>(std::greater<float32_t>());

pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare.pass.cpp

@@ -156,7 +156,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test<uint16_t, float64_t>(std::less<float64_t>());

pstl/test/std/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp

@@ -174,7 +174,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     using TestUtils::float64_t;

pstl/test/std/algorithms/alg.sorting/alg.set.operations/includes.pass.cpp

@@ -94,7 +94,7 @@ test_includes(Compare compare)
     }
 }
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.sorting/alg.set.operations/set.pass.cpp

@@ -147,7 +147,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.sorting/is_sorted.pass.cpp

@@ -84,7 +84,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
 

pstl/test/std/algorithms/alg.sorting/partial_sort.pass.cpp

@@ -131,7 +131,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     count_val = 0;

pstl/test/std/algorithms/alg.sorting/partial_sort_copy.pass.cpp

@@ -178,7 +178,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     test_partial_sort_copy<Num<float32_t>>([](Num<float32_t> x, Num<float32_t> y) { return x < y; });

pstl/test/std/algorithms/alg.sorting/sort.pass.cpp

@@ -224,7 +224,7 @@ struct test_non_const
     }
 };
 
-int32_t
+int
 main()
 {
     std::srand(42);

pstl/test/std/numerics/numeric.ops/adjacent_difference.pass.cpp

@@ -156,7 +156,7 @@ test(Pred pred)
     }
 }
 
-int32_t
+int
 main()
 {
     test<uint8_t, uint32_t>([](uint32_t a, uint32_t b) { return a - b; });

pstl/test/std/numerics/numeric.ops/reduce.pass.cpp

@@ -97,7 +97,7 @@ test_short_forms()
     }
 }
 
-int32_t
+int
 main()
 {
     // Test for popular types

pstl/test/std/numerics/numeric.ops/scan.pass.cpp

@@ -180,7 +180,7 @@ test_matrix(Out init, BinaryOp binary_op, Out trash)
     }
 }
 
-int32_t
+int
 main()
 {
     for (int32_t mode = 0; mode < 2; ++mode)

pstl/test/std/numerics/numeric.ops/transform_reduce.pass.cpp

@@ -116,7 +116,7 @@ test_by_type(T init, BinaryOperation1 opB1, BinaryOperation2 opB2, UnaryOp opU,
     }
 }
 
-int32_t
+int
 main()
 {
     test_by_type<int32_t>(42, std::plus<int32_t>(), std::multiplies<int32_t>(), std::negate<int32_t>(),

pstl/test/std/numerics/numeric.ops/transform_scan.pass.cpp

@@ -160,7 +160,7 @@ test_matrix(UnaryOp unary_op, Out init, BinaryOp binary_op, Out trash)
     }
 }
 
-int32_t
+int
 main()
 {
     for (int32_t mode = 0; mode < 2; ++mode)

pstl/test/std/utilities/memory/specialized.algorithms/uninitialized_construct.pass.cpp

@@ -104,7 +104,7 @@ test_uninit_construct_by_type()
     }
 }
 
-int32_t
+int
 main()
 {
 

pstl/test/std/utilities/memory/specialized.algorithms/uninitialized_copy_move.pass.cpp

@@ -124,7 +124,7 @@ test_uninitialized_copy_move_by_type()
     }
 }
 
-int32_t
+int
 main()
 {
 

pstl/test/std/utilities/memory/specialized.algorithms/uninitialized_fill_destroy.pass.cpp

@@ -77,7 +77,7 @@ test_uninitialized_fill_destroy_by_type()
     }
 }
 
-int32_t
+int
 main()
 {
     // for trivial types