[Polly][Isl] Stop using isl::set::lex_le_set. NFC

[patacca]

Summary

This is part of an effort to reduce the differences between the custom C++ bindings used right now by polly in lib/External/isl/include/isl/isl-noxceptions.h and the official isl C++ interface.

Changes made:

• Stop using isl::set::lex_le_set. The official way to do this is to use isl::map::lex_le_at
• Removed isl::set::lex_le_set from isl-noexceptions.h
• isl-noexceptions.h has been generated by this https://github.com/patacca/isl/commit/266fea1d3dbd31c23d866eb363fcc8e61e50419f

[Meinersbur]

LGTM.

Are you going to do the same for lex_ge_set, lex_gt_set and lex_lt_set?

[patacca]

This is to my knowledge the only usage of lex_*_set.
In ScopBuilder.cpp we are using isl::map::lex_le that is not exported as well but I think I will rewrite it by using isl::map::set_lex_le_at in another revision

polly/lib/Analysis/DependenceInfo.cpp

bool Dependences::isValidSchedule(
 
   isl::set Zero = isl::set::universe(ScheduleSpace);
   for (auto i : seq<isl_size>(0, Zero.tuple_dim()))
     Zero = Zero.fix_si(isl::dim::set, i, 0);
 
   isl::union_set UDeltas = Dependences.deltas();
   isl::set Deltas = singleton(UDeltas, ScheduleSpace);
 
-  isl::map NonPositive = Deltas.lex_le_set(Zero);
+  isl::space Space = Deltas.get_space();
+  isl::map NonPositive = isl::map::universe(Space.map_from_set());
+  NonPositive =
+      NonPositive.lex_le_at(isl::multi_pw_aff::identity_on_domain(Space));
+  NonPositive = NonPositive.intersect_domain(Deltas);
+  NonPositive = NonPositive.intersect_range(Zero);
+
   return NonPositive.is_empty();
 }
 
 // Check if the current scheduling dimension is parallel.
 //
 // We check for parallelism by verifying that the loop does not carry any
 // dependences.
 //

polly/lib/External/isl/include/isl/isl-noexceptions.h

public:
   inline boolean is_equal(const isl::set &set2) const;
   inline boolean is_params() const;
   inline boolean is_singleton() const;
   inline boolean is_strict_subset(const isl::set &set2) const;
   inline boolean is_subset(const isl::set &set2) const;
   inline boolean is_wrapping() const;
   inline isl::map lex_ge_set(isl::set set2) const;
   inline isl::map lex_gt_set(isl::set set2) const;
-  inline isl::map lex_le_set(isl::set set2) const;
   inline isl::map lex_lt_set(isl::set set2) const;
   inline isl::set lexmax() const;
   inline isl::pw_multi_aff lexmax_pw_multi_aff() const;
   inline isl::set lexmin() const;
   inline isl::pw_multi_aff lexmin_pw_multi_aff() const;
   inline isl::set lower_bound(isl::multi_pw_aff lower) const;
   inline isl::set lower_bound(isl::multi_val lower) const;
   inline isl::set lower_bound_si(isl::dim type, unsigned int pos, int value) const;

 }
 
 isl::map set::lex_gt_set(isl::set set2) const
 {
   auto res = isl_set_lex_gt_set(copy(), set2.release());
   return manage(res);
 }
 
-isl::map set::lex_le_set(isl::set set2) const
-{
-  auto res = isl_set_lex_le_set(copy(), set2.release());
-  return manage(res);
-}
-
 isl::map set::lex_lt_set(isl::set set2) const
 {
   auto res = isl_set_lex_lt_set(copy(), set2.release());
   return manage(res);
 }
 
 isl::set set::lexmax() const
 {