reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

Declarations

tools/polly/lib/External/isl/include/isl/isl-noexceptions.h
  215 class union_set;

References

include/llvm/ADT/ArrayRef.h
   43     using iterator = const T *;
   44     using const_iterator = const T *;
   50     const T *Data = nullptr;
   66     /*implicit*/ ArrayRef(const T &OneElt)
   70     /*implicit*/ ArrayRef(const T *data, size_t length)
   74     ArrayRef(const T *begin, const T *end)
   74     ArrayRef(const T *begin, const T *end)
   81     /*implicit*/ ArrayRef(const SmallVectorTemplateCommon<T, U> &Vec)
   87     /*implicit*/ ArrayRef(const std::vector<T, A> &Vec)
   92     /*implicit*/ constexpr ArrayRef(const std::array<T, N> &Arr)
   97     /*implicit*/ constexpr ArrayRef(const T (&Arr)[N]) : Data(Arr), Length(N) {}
  100     /*implicit*/ ArrayRef(const std::initializer_list<T> &Vec)
  145     const T *data() const { return Data; }
  151     const T &front() const {
  157     const T &back() const {
  163     template <typename Allocator> ArrayRef<T> copy(Allocator &A) {
  178     ArrayRef<T> slice(size_t N, size_t M) const {
  184     ArrayRef<T> slice(size_t N) const { return slice(N, size() - N); }
  187     ArrayRef<T> drop_front(size_t N = 1) const {
  193     ArrayRef<T> drop_back(size_t N = 1) const {
  200     template <class PredicateT> ArrayRef<T> drop_while(PredicateT Pred) const {
  206     template <class PredicateT> ArrayRef<T> drop_until(PredicateT Pred) const {
  211     ArrayRef<T> take_front(size_t N = 1) const {
  218     ArrayRef<T> take_back(size_t N = 1) const {
  226     template <class PredicateT> ArrayRef<T> take_while(PredicateT Pred) const {
  232     template <class PredicateT> ArrayRef<T> take_until(PredicateT Pred) const {
  239     const T &operator[](size_t Index) const {
  249     typename std::enable_if<std::is_same<U, T>::value, ArrayRef<T>>::type &
  257     typename std::enable_if<std::is_same<U, T>::value, ArrayRef<T>>::type &
  263     std::vector<T> vec() const {
  270     operator std::vector<T>() const {
include/llvm/ADT/SmallVector.h
   75   AlignedCharArrayUnion<T> FirstEl;
  114   using value_type = T;
  115   using iterator = T *;
  116   using const_iterator = const T *;
  121   using reference = T &;
  122   using const_reference = const T &;
  123   using pointer = T *;
  124   using const_pointer = const T *;
  179 class SmallVectorTemplateBase : public SmallVectorTemplateCommon<T> {
  183   static void destroy_range(T *S, T *E) {
  183   static void destroy_range(T *S, T *E) {
  211   void push_back(const T &Elt) {
  218   void push_back(T &&Elt) {
  221     ::new ((void*) this->end()) T(::std::move(Elt));
  240   T *NewElts = static_cast<T*>(llvm::safe_malloc(NewCapacity*sizeof(T)));
  240   T *NewElts = static_cast<T*>(llvm::safe_malloc(NewCapacity*sizeof(T)));
  315 class SmallVectorImpl : public SmallVectorTemplateBase<T> {
  316   using SuperClass = SmallVectorTemplateBase<T>;
  357   void resize(size_type N, const T &NV) {
  374   LLVM_NODISCARD T pop_back_val() {
  397   void append(size_type NumInputs, const T &Elt) {
  405   void append(std::initializer_list<T> IL) {
  412   void assign(size_type NumElts, const T &Elt) {
  429   void assign(std::initializer_list<T> IL) {
  467   iterator insert(iterator I, T &&Elt) {
  497   iterator insert(iterator I, const T &Elt) {
  526   iterator insert(iterator I, size_type NumToInsert, const T &Elt) {
  637   void insert(iterator I, std::initializer_list<T> IL) {
  820   AlignedCharArrayUnion<T> InlineElts[N];
  837 class SmallVector : public SmallVectorImpl<T>, SmallVectorStorage<T, N> {
  837 class SmallVector : public SmallVectorImpl<T>, SmallVectorStorage<T, N> {
  846   explicit SmallVector(size_t Size, const T &Value = T())
  865   SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) {
  884   SmallVector(SmallVectorImpl<T> &&RHS) : SmallVectorImpl<T>(N) {
include/llvm/Support/AlignOf.h
   30   T t;
   39 template <typename T> union SizerImpl<T> { char arr[sizeof(T)]; };
   50       llvm::detail::SizerImpl<T, Ts...>)];
include/llvm/Support/type_traits.h
   91     T t;
  122     static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{});
  122     static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{});
  122     static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{});
  130     static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{});
  130     static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{});
  130     static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{});
  145       std::is_copy_constructible<detail::trivial_helper<T>>::value;
  147       !std::is_copy_constructible<T>::value;
  151       std::is_move_constructible<detail::trivial_helper<T>>::value;
  153       !std::is_move_constructible<T>::value;
  157       is_copy_assignable<detail::trivial_helper<T>>::value;
  159       !is_copy_assignable<T>::value;
  163       is_move_assignable<detail::trivial_helper<T>>::value;
  165       !is_move_assignable<T>::value;
  169       std::is_destructible<detail::trivial_helper<T>>::value;
tools/polly/include/polly/DeLICM.h
   35 bool isConflicting(isl::union_set ExistingOccupied,
   36                    isl::union_set ExistingUnused, isl::union_map ExistingKnown,
   38                    isl::union_set ProposedOccupied,
   39                    isl::union_set ProposedUnused, isl::union_map ProposedKnown,
tools/polly/include/polly/ScopInfo.h
 2623   isl::union_set getDomains() const;
 2671   bool restrictDomains(isl::union_set Domain);
tools/polly/include/polly/Support/ISLTools.h
  154 isl::set singleton(isl::union_set USet, isl::space ExpectedSpace);
  186 isl::union_map makeIdentityMap(const isl::union_set &USet, bool RestrictDomain);
  210 isl::union_set shiftDim(isl::union_set USet, int Pos, int Amount);
  210 isl::union_set shiftDim(isl::union_set USet, int Pos, int Amount);
  240 void simplify(isl::union_set &USet);
  415 isl::union_set convertZoneToTimepoints(isl::union_set Zone, bool InclStart,
  415 isl::union_set convertZoneToTimepoints(isl::union_set Zone, bool InclStart,
  444 isl::union_map liftDomains(isl::union_map UMap, isl::union_set Factor);
  464 isl::map intersectRange(isl::map Map, isl::union_set Range);
  539 void dumpPw(const isl::union_set &USet);
  585 void dumpExpanded(const isl::union_set &USet);
tools/polly/include/polly/ZoneAlgo.h
  113   isl::union_set CompatibleElts;
  183   void collectIncompatibleElts(ScopStmt *Stmt, isl::union_set &IncompatibleElts,
  184                                isl::union_set &AllElts);
  207   isl::union_set makeEmptyUnionSet() const;
  234   isl::union_map getScatterFor(isl::union_set Domain) const;
  416 isl::union_map makeUnknownForDomain(isl::union_set Domain);
tools/polly/lib/Analysis/DependenceInfo.cpp
  191 static void fixSetToZero(isl::set Zero, isl::union_set *User) {
  256   isl::union_set Zero =
  673   isl::union_set UDeltas = Dependences.deltas();
tools/polly/lib/Analysis/ScopBuilder.cpp
 1152 static isl::multi_union_pw_aff mapToDimension(isl::union_set USet, int N) {
 1262     isl::union_set UDomain{Stmt->getDomain()};
 1287       isl::union_set Domain = Schedule.get_domain();
 2351   isl::union_set Accessed = scop->getAccesses().range();
 3298   isl::union_set Domains = scop->getDomains();
 3305   isl::union_set Locations = Accesses.range();
tools/polly/lib/Analysis/ScopInfo.cpp
  256   isl::union_set WriteSet = S.getWrites().range();
  601   isl::union_set UDomain;
 2266 isl::union_set Scop::getDomains() const {
 2346 bool Scop::restrictDomains(isl::union_set Domain) {
 2349     isl::union_set StmtDomain = isl::union_set(Stmt.getDomain());
 2350     isl::union_set NewStmtDomain = StmtDomain.intersect(Domain);
tools/polly/lib/CodeGen/IslNodeBuilder.cpp
  296 addReferencesFromStmtUnionSet(isl::union_set USet,
  322   isl::union_set Schedule =
tools/polly/lib/External/isl/include/isl/isl-noexceptions.h
 1755   inline union_set domain() const;
 1774   inline multi_union_pw_aff gist(union_set context) const;
 1777   inline multi_union_pw_aff intersect_domain(union_set uset) const;
 1784   static inline multi_union_pw_aff multi_aff_on_domain(union_set domain, multi_aff ma);
 1785   static inline multi_union_pw_aff multi_val_on_domain(union_set domain, multi_val mv);
 1789   static inline multi_union_pw_aff pw_multi_aff_on_domain(union_set domain, pw_multi_aff pma);
 1808   inline union_set zero_union_set() const;
 2471   static inline schedule from_domain(union_set domain);
 2472   inline union_set get_domain() const;
 2479   inline schedule intersect_domain(union_set domain) const;
 2521   inline union_set get_domain() const;
 2524   static inline schedule_constraints on_domain(union_set domain);
 2564   inline schedule_node band_set_ast_build_options(union_set options) const;
 2568   inline union_set domain_get_domain() const;
 2572   inline union_set filter_get_filter() const;
 2575   static inline schedule_node from_domain(union_set domain);
 2580   inline union_set get_domain() const;
 2592   inline union_set get_universe_domain() const;
 2602   inline schedule_node insert_filter(union_set filter) const;
 2613   inline schedule_node order_after(union_set filter) const;
 2614   inline schedule_node order_before(union_set filter) const;
 2641   inline explicit set(union_set uset);
 3076   inline union_set deltas() const;
 3080   inline union_set domain() const;
 3097   static inline union_map from_domain(union_set uset);
 3098   static inline union_map from_domain_and_range(union_set domain, union_set range);
 3098   static inline union_map from_domain_and_range(union_set domain, union_set range);
 3099   static inline union_map from_range(union_set uset);
 3106   inline union_map gist_domain(union_set uset) const;
 3108   inline union_map gist_range(union_set uset) const;
 3110   inline union_map intersect_domain(union_set uset) const;
 3112   inline union_map intersect_range(union_set uset) const;
 3147   inline union_set range() const;
 3160   inline union_map subtract_domain(union_set dom) const;
 3161   inline union_map subtract_range(union_set dom) const;
 3165   inline union_set wrap() const;
 3229   inline explicit union_pw_aff(union_set domain, val v);
 3245   static inline union_pw_aff aff_on_domain(union_set domain, aff aff);
 3249   inline union_set domain() const;
 3258   inline union_pw_aff gist(union_set context) const;
 3260   inline union_pw_aff intersect_domain(union_set uset) const;
 3268   static inline union_pw_aff param_on_domain_id(union_set domain, id id);
 3271   static inline union_pw_aff pw_aff_on_domain(union_set domain, pw_aff pa);
 3276   inline union_pw_aff subtract_domain(union_set uset) const;
 3278   inline union_set zero_union_set() const;
 3342   inline explicit union_pw_multi_aff(union_set uset);
 3364   inline union_set domain() const;
 3371   static inline union_pw_multi_aff from_union_set(union_set uset);
 3375   inline union_pw_multi_aff gist(union_set context) const;
 3377   inline union_pw_multi_aff intersect_domain(union_set uset) const;
 3380   static inline union_pw_multi_aff multi_val_on_domain(union_set domain, multi_val mv);
 3390   inline union_pw_multi_aff subtract_domain(union_set uset) const;
 3470   inline union_set domain() const;
 3479   inline union_pw_qpolynomial gist(union_set context) const;
 3481   inline union_pw_qpolynomial intersect_domain(union_set uset) const;
 3492   inline union_pw_qpolynomial subtract_domain(union_set uset) const;
 3498 inline union_set manage(__isl_take isl_union_set *ptr);
 3499 inline union_set manage_copy(__isl_keep isl_union_set *ptr);
 3502   friend inline union_set manage(__isl_take isl_union_set *ptr);
 3503   friend inline union_set manage_copy(__isl_keep isl_union_set *ptr);
 3511   inline /* implicit */ union_set(const union_set &obj);
 3517   inline union_set &operator=(union_set obj);
 3517   inline union_set &operator=(union_set obj);
 3529   inline union_set add_set(set set) const;
 3530   inline union_set affine_hull() const;
 3531   inline union_set align_params(space model) const;
 3532   inline union_set apply(union_map umap) const;
 3533   inline union_set coalesce() const;
 3534   inline union_set coefficients() const;
 3537   inline union_set detect_equalities() const;
 3539   static inline union_set empty(space space);
 3547   inline union_set gist(union_set context) const;
 3547   inline union_set gist(union_set context) const;
 3548   inline union_set gist_params(set set) const;
 3551   inline union_set intersect(union_set uset2) const;
 3551   inline union_set intersect(union_set uset2) const;
 3552   inline union_set intersect_params(set set) const;
 3553   inline boolean is_disjoint(const union_set &uset2) const;
 3555   inline boolean is_equal(const union_set &uset2) const;
 3557   inline boolean is_strict_subset(const union_set &uset2) const;
 3558   inline boolean is_subset(const union_set &uset2) const;
 3559   inline union_map lex_ge_union_set(union_set uset2) const;
 3560   inline union_map lex_gt_union_set(union_set uset2) const;
 3561   inline union_map lex_le_union_set(union_set uset2) const;
 3562   inline union_map lex_lt_union_set(union_set uset2) const;
 3563   inline union_set lexmax() const;
 3564   inline union_set lexmin() const;
 3568   inline union_set polyhedral_hull() const;
 3569   inline union_set preimage(multi_aff ma) const;
 3570   inline union_set preimage(pw_multi_aff pma) const;
 3571   inline union_set preimage(union_pw_multi_aff upma) const;
 3572   inline union_set product(union_set uset2) const;
 3572   inline union_set product(union_set uset2) const;
 3573   inline union_set project_out(isl::dim type, unsigned int first, unsigned int n) const;
 3574   inline union_set remove_divs() const;
 3575   inline union_set remove_redundancies() const;
 3576   inline union_set reset_user() const;
 3579   inline union_set simple_hull() const;
 3580   inline union_set solutions() const;
 3581   inline union_set subtract(union_set uset2) const;
 3581   inline union_set subtract(union_set uset2) const;
 3582   inline union_set unite(union_set uset2) const;
 3582   inline union_set unite(union_set uset2) const;
 3583   inline union_set universe() const;
 3615   inline union_set_list add(union_set el) const;
 3619   inline stat foreach(const std::function<stat(union_set)> &fn) const;
 3620   static inline union_set_list from_union_set(union_set el);
 3621   inline union_set get_at(int index) const;
 3622   inline union_set get_union_set(int index) const;
 3623   inline union_set_list insert(unsigned int pos, union_set el) const;
 3626   inline union_set_list set_union_set(int index, union_set el) const;
 3629   inline union_set unite() const;
10571 union_set multi_union_pw_aff::domain() const
10686 multi_union_pw_aff multi_union_pw_aff::gist(union_set context) const
10704 multi_union_pw_aff multi_union_pw_aff::intersect_domain(union_set uset) const
10746 multi_union_pw_aff multi_union_pw_aff::multi_aff_on_domain(union_set domain, multi_aff ma)
10752 multi_union_pw_aff multi_union_pw_aff::multi_val_on_domain(union_set domain, multi_val mv)
10776 multi_union_pw_aff multi_union_pw_aff::pw_multi_aff_on_domain(union_set domain, pw_multi_aff pma)
10890 union_set multi_union_pw_aff::zero_union_set() const
13757 schedule schedule::from_domain(union_set domain)
13763 union_set schedule::get_domain() const
13805 schedule schedule::intersect_domain(union_set domain) const
13951 union_set schedule_constraints::get_domain() const
13969 schedule_constraints schedule_constraints::on_domain(union_set domain)
14104 schedule_node schedule_node::band_set_ast_build_options(union_set options) const
14128 union_set schedule_node::domain_get_domain() const
14152 union_set schedule_node::filter_get_filter() const
14178 schedule_node schedule_node::from_domain(union_set domain)
14208 union_set schedule_node::get_domain() const
14280 union_set schedule_node::get_universe_domain() const
14340 schedule_node schedule_node::insert_filter(union_set filter) const
14406 schedule_node schedule_node::order_after(union_set filter) const
14412 schedule_node schedule_node::order_before(union_set filter) const
14487 set::set(union_set uset)
16466 union_set union_map::deltas() const
16490 union_set union_map::domain() const
16600 union_map union_map::from_domain(union_set uset)
16606 union_map union_map::from_domain_and_range(union_set domain, union_set range)
16606 union_map union_map::from_domain_and_range(union_set domain, union_set range)
16612 union_map union_map::from_range(union_set uset)
16654 union_map union_map::gist_domain(union_set uset) const
16666 union_map union_map::gist_range(union_set uset) const
16678 union_map union_map::intersect_domain(union_set uset) const
16690 union_map union_map::intersect_range(union_set uset) const
16900 union_set union_map::range() const
16978 union_map union_map::subtract_domain(union_set dom) const
16984 union_map union_map::subtract_range(union_set dom) const
17008 union_set union_map::wrap() const
17207 union_pw_aff::union_pw_aff(union_set domain, val v)
17280 union_pw_aff union_pw_aff::aff_on_domain(union_set domain, aff aff)
17304 union_set union_pw_aff::domain() const
17366 union_pw_aff union_pw_aff::gist(union_set context) const
17378 union_pw_aff union_pw_aff::intersect_domain(union_set uset) const
17426 union_pw_aff union_pw_aff::param_on_domain_id(union_set domain, id id)
17444 union_pw_aff union_pw_aff::pw_aff_on_domain(union_set domain, pw_aff pa)
17474 union_pw_aff union_pw_aff::subtract_domain(union_set uset) const
17486 union_set union_pw_aff::zero_union_set() const
17684 union_pw_multi_aff::union_pw_multi_aff(union_set uset)
17790 union_set union_pw_multi_aff::domain() const
17840 union_pw_multi_aff union_pw_multi_aff::from_union_set(union_set uset)
17864 union_pw_multi_aff union_pw_multi_aff::gist(union_set context) const
17876 union_pw_multi_aff union_pw_multi_aff::intersect_domain(union_set uset) const
17894 union_pw_multi_aff union_pw_multi_aff::multi_val_on_domain(union_set domain, multi_val mv)
17954 union_pw_multi_aff union_pw_multi_aff::subtract_domain(union_set uset) const
18230 union_set union_pw_qpolynomial::domain() const
18292 union_pw_qpolynomial union_pw_qpolynomial::gist(union_set context) const
18304 union_pw_qpolynomial union_pw_qpolynomial::intersect_domain(union_set uset) const
18370 union_pw_qpolynomial union_pw_qpolynomial::subtract_domain(union_set uset) const
18389 union_set manage(__isl_take isl_union_set *ptr) {
18392 union_set manage_copy(__isl_keep isl_union_set *ptr) {
18400 union_set::union_set(const union_set &obj)
18433 union_set &union_set::operator=(union_set obj) {
18433 union_set &union_set::operator=(union_set obj) {
18483 union_set union_set::add_set(set set) const
18489 union_set union_set::affine_hull() const
18495 union_set union_set::align_params(space model) const
18501 union_set union_set::apply(union_map umap) const
18507 union_set union_set::coalesce() const
18513 union_set union_set::coefficients() const
18531 union_set union_set::detect_equalities() const
18543 union_set union_set::empty(space space)
18607 union_set union_set::gist(union_set context) const
18607 union_set union_set::gist(union_set context) const
18613 union_set union_set::gist_params(set set) const
18631 union_set union_set::intersect(union_set uset2) const
18631 union_set union_set::intersect(union_set uset2) const
18637 union_set union_set::intersect_params(set set) const
18643 boolean union_set::is_disjoint(const union_set &uset2) const
18655 boolean union_set::is_equal(const union_set &uset2) const
18667 boolean union_set::is_strict_subset(const union_set &uset2) const
18673 boolean union_set::is_subset(const union_set &uset2) const
18679 union_map union_set::lex_ge_union_set(union_set uset2) const
18685 union_map union_set::lex_gt_union_set(union_set uset2) const
18691 union_map union_set::lex_le_union_set(union_set uset2) const
18697 union_map union_set::lex_lt_union_set(union_set uset2) const
18703 union_set union_set::lexmax() const
18709 union_set union_set::lexmin() const
18733 union_set union_set::polyhedral_hull() const
18739 union_set union_set::preimage(multi_aff ma) const
18745 union_set union_set::preimage(pw_multi_aff pma) const
18751 union_set union_set::preimage(union_pw_multi_aff upma) const
18757 union_set union_set::product(union_set uset2) const
18757 union_set union_set::product(union_set uset2) const
18763 union_set union_set::project_out(isl::dim type, unsigned int first, unsigned int n) const
18769 union_set union_set::remove_divs() const
18775 union_set union_set::remove_redundancies() const
18781 union_set union_set::reset_user() const
18799 union_set union_set::simple_hull() const
18805 union_set union_set::solutions() const
18811 union_set union_set::subtract(union_set uset2) const
18811 union_set union_set::subtract(union_set uset2) const
18817 union_set union_set::unite(union_set uset2) const
18817 union_set union_set::unite(union_set uset2) const
18823 union_set union_set::universe() const
18907 union_set_list union_set_list::add(union_set el) const
18931 stat union_set_list::foreach(const std::function<stat(union_set)> &fn) const
18934     const std::function<stat(union_set)> *func;
18945 union_set_list union_set_list::from_union_set(union_set el)
18951 union_set union_set_list::get_at(int index) const
18957 union_set union_set_list::get_union_set(int index) const
18963 union_set_list union_set_list::insert(unsigned int pos, union_set el) const
18981 union_set_list union_set_list::set_union_set(int index, union_set el) const
18999 union_set union_set_list::unite() const
tools/polly/lib/Support/ISLTools.cpp
  147 isl::set polly::singleton(isl::union_set USet, isl::space ExpectedSpace) {
  175 isl::union_map polly::makeIdentityMap(const isl::union_set &USet,
  216 isl::union_set polly::shiftDim(isl::union_set USet, int Pos, int Amount) {
  216 isl::union_set polly::shiftDim(isl::union_set USet, int Pos, int Amount) {
  217   isl::union_set Result = isl::union_set::empty(USet.get_space());
  217   isl::union_set Result = isl::union_set::empty(USet.get_space());
  271 void polly::simplify(isl::union_set &USet) {
  386 isl::union_set polly::convertZoneToTimepoints(isl::union_set Zone,
  386 isl::union_set polly::convertZoneToTimepoints(isl::union_set Zone,
  391   auto ShiftedZone = shiftDim(Zone, -1, -1);
  479 isl::union_map polly::liftDomains(isl::union_map UMap, isl::union_set Factor) {
  496   isl::union_set DomainDomain = UMap.domain().unwrap().domain();
  505 isl::map polly::intersectRange(isl::map Map, isl::union_set Range) {
  704 static void printSortedPolyhedra(isl::union_set USet, llvm::raw_ostream &OS,
  798 static isl::union_set expand(const isl::union_set &USet) {
  798 static isl::union_set expand(const isl::union_set &USet) {
  799   isl::union_set Expanded = isl::union_set::empty(USet.get_space());
  799   isl::union_set Expanded = isl::union_set::empty(USet.get_space());
  815 LLVM_DUMP_METHOD void polly::dumpPw(const isl::union_set &USet) {
  847 LLVM_DUMP_METHOD void polly::dumpExpanded(const isl::union_set &USet) {
tools/polly/lib/Transform/DeLICM.cpp
   97                                               isl::union_set Writes,
  142 isl::union_map expandMapping(isl::union_map Relevant, isl::union_set Universe) {
  144   isl::union_set RelevantDomain = Relevant.domain();
  201   isl::union_set Occupied;
  207   isl::union_set Unused;
  253     auto Universe = Occupied.unite(Unused);
  266   Knowledge(isl::union_set Occupied, isl::union_set Unused,
  266   Knowledge(isl::union_set Occupied, isl::union_set Unused,
  339       auto ExistingUniverse = Existing.Occupied.unite(Existing.Unused);
  340       auto ProposedUniverse = Proposed.Occupied.unite(Proposed.Unused);
  377     auto Matches = MatchingVals.domain();
  384         auto Conflicting = Proposed.Occupied.subtract(Matches);
  421     auto ProposedFixedDefs =
  428     auto ExistingConflictingWritesDomain = ExistingConflictingWrites.domain();
  432     auto CommonWrittenValDomain = CommonWrittenVal.domain();
  454     auto ExistingAvailableDefs =
  459     auto ProposedWrittenDomain = Proposed.Written.domain();
  461     auto IdenticalOrUnused =
  465         auto Conflicting = ProposedWrittenDomain.subtract(IdenticalOrUnused);
  484     auto ExistingWrittenDomain = Existing.Written.domain();
  485     auto BothWritten =
  489     auto CommonWritten =
  494         auto Conflicting = BothWritten.subtract(CommonWritten);
  618     auto Reads = makeEmptyUnionSet();
  876     auto UniverseWritesDom = isl::union_set::empty(ParamSpace);
  876     auto UniverseWritesDom = isl::union_set::empty(ParamSpace);
  885     auto ExpandedWritesDom = WritesTarget.domain();
  936     auto Occupied = LifetimeTranslator.range();
 1125   isl::union_set computeLifetime() const {
 1130     auto Result = ArrayUnused.wrap();
 1190     isl::union_set EltUnused;
 1309         isl::union_set TouchedElts = AccRel.range();
 1427     isl::union_set ExistingOccupied, isl::union_set ExistingUnused,
 1427     isl::union_set ExistingOccupied, isl::union_set ExistingUnused,
 1429     isl::union_set ProposedOccupied, isl::union_set ProposedUnused,
 1429     isl::union_set ProposedOccupied, isl::union_set ProposedUnused,
tools/polly/lib/Transform/DeadCodeElimination.cpp
   72   isl::union_set getLiveOut(Scop &S);
   89 isl::union_set DeadCodeElim::getLiveOut(Scop &S) {
   99   isl::union_set Live = LastWriteIterations.range();
  120   isl::union_set Live = getLiveOut(S);
  128   isl::union_set OriginalDomain = S.getDomains();
  133     isl::union_set Extra = Live.apply(Dep);
tools/polly/lib/Transform/FlattenAlgo.cpp
  187   auto AllDomains = Schedule.domain();
tools/polly/lib/Transform/FlattenSchedule.cpp
   64     auto Domains = S.getDomains();
tools/polly/lib/Transform/ForwardOpTree.cpp
  195     isl::union_set Domain = ValInst.domain();
tools/polly/lib/Transform/MaximalStaticExpansion.cpp
  181     auto StmtDomain = isl::union_set(Read->getStatement()->getDomain());
  186     auto WriteDomain = isl::union_set::empty(S.getParamSpace());
  186     auto WriteDomain = isl::union_set::empty(S.getParamSpace());
  264         auto ReadDomain = isl::union_set(ReadDomainSet);
  277         auto DepsDomain = MapDependences.domain();
  324     auto Domain = isl::union_set(DomainSet);
tools/polly/lib/Transform/ScheduleOptimizer.cpp
  304 static isl::union_set getIsolateOptions(isl::set IsolateDomain,
  327 isl::union_set getDimOptions(isl::ctx Ctx, const char *Option) {
  340 static isl::union_set getUnrollIsolatedSetOptions(isl::ctx Ctx) {
  390   auto AtomicOption = getDimOptions(IsolateDomain.get_ctx(), "atomic");
  391   isl::union_set IsolateOption = getIsolateOptions(IsolateDomain, 1);
  393   isl::union_set Options = IsolateOption.unite(AtomicOption);
 1208   isl::union_set IsolateOption =
 1211   auto Options = IsolateOption.unite(getDimOptions(Ctx, "unroll"));
 1259   auto Domain = Node.get_universe_domain();
 1511   isl::union_set Domain = S.getDomains();
tools/polly/lib/Transform/ScheduleTreeTransform.cpp
  262     isl::union_set FilterDomain = Filter.filter_get_filter();
  285     : public ScheduleTreeRewriter<ExtensionNodeRewriter, const isl::union_set &,
  288                                       const isl::union_set &, isl::union_map &>;
  301                               const isl::union_set &Domain,
  316                          const isl::union_set &Domain,
  332                           const isl::union_set &Domain,
  340                           const isl::union_set &Domain,
  390                             const isl::union_set &Domain,
  392     isl::union_set FilterDomain = Filter.filter_get_filter();
  393     isl::union_set NewDomain = Domain.intersect(FilterDomain);
  400                                const isl::union_set &Domain,
  403     isl::union_set NewDomain = Domain.unite(ExtDomain.range());
  422   llvm::SmallVector<isl::union_set, 8> ASTBuildOptions;
  443   llvm::ArrayRef<isl::union_set> ASTBuildOptions;
  445   ApplyASTBuildOptions(llvm::ArrayRef<isl::union_set> ASTBuildOptions)
tools/polly/lib/Transform/ZoneAlgo.cpp
  189                                                       isl::union_set Writes,
  228 isl::union_map polly::makeUnknownForDomain(isl::union_set Domain) {
  264   auto Domains = S->getDomains();
  322                                             isl::union_set &IncompatibleElts,
  323                                             isl::union_set &AllElts) {
  583 isl::union_set ZoneAlgorithm::makeEmptyUnionSet() const {
  584   return isl::union_set::empty(ParamSpace);
  597   isl::union_set AllElts = makeEmptyUnionSet();
  598   isl::union_set IncompatibleElts = makeEmptyUnionSet();
  618 isl::union_map ZoneAlgorithm::getScatterFor(isl::union_set Domain) const {
  624   auto UDomain = isl::union_set(Domain);
 1105   isl::union_set AllAccessedElts = AllReads.range().unite(AllWrites.range());
 1115   isl::union_set NonReachDef =
tools/polly/unittests/DeLICM/DeLICMTest.cpp
   25 isl::union_set unionSpace(const isl::union_set &USet) {
   25 isl::union_set unionSpace(const isl::union_set &USet) {
   26   auto Result = isl::union_set::empty(USet.get_space());
   26   auto Result = isl::union_set::empty(USet.get_space());
   35 void completeLifetime(isl::union_set Universe, isl::union_map OccupiedAndKnown,
   36                       isl::union_set &Occupied, isl::union_map &Known,
   37                       isl::union_set &Undef) {
   81 isl::union_set parseSetOrNull(isl_ctx *Ctx, const char *Str) {
   95     isl::union_set ExistingUnused, isl::union_map ExistingWritten,
   96     isl::union_map ProposedOccupiedAndKnown, isl::union_set ProposedUnused,
   99   auto Universe = isl::union_set::empty(isl::space::params_alloc(Ctx, 0));
   99   auto Universe = isl::union_set::empty(isl::space::params_alloc(Ctx, 0));
  126   isl::union_set ExistingOccupied;
  131   isl::union_set ProposedOccupied;
  166   auto ExistingUnused = parseSetOrNull(Ctx.get(), Existing.UndefStr);
  171   auto ProposedUnused = parseSetOrNull(Ctx.get(), Proposed.UndefStr);
  185   auto ExistingOccupied = parseSetOrNull(Ctx.get(), Existing.OccupiedStr);
  186   auto ExistingUnused = parseSetOrNull(Ctx.get(), Existing.UndefStr);
  187   auto ExistingWritten = parseSetOrNull(Ctx.get(), Existing.WrittenStr);
  189   auto ProposedOccupied = parseSetOrNull(Ctx.get(), Proposed.OccupiedStr);
  190   auto ProposedUnused = parseSetOrNull(Ctx.get(), Proposed.UndefStr);
  191   auto ProposedWritten = parseSetOrNull(Ctx.get(), Proposed.WrittenStr);
tools/polly/unittests/Isl/IslTest.cpp
   66 static bool operator==(const isl::union_set &LHS, const isl::union_set &RHS) {
   66 static bool operator==(const isl::union_set &LHS, const isl::union_set &RHS) {
  401   isl::union_set TestUSet = TestSet;
usr/include/c++/7.4.0/bits/alloc_traits.h
  387       using allocator_type = allocator<_Tp>;
  389       using value_type = _Tp;
  392       using pointer = _Tp*;
  395       using const_pointer = const _Tp*;
usr/include/c++/7.4.0/bits/allocator.h
  108     class allocator: public __allocator_base<_Tp>
  113       typedef _Tp*       pointer;
  114       typedef const _Tp* const_pointer;
  115       typedef _Tp&       reference;
  116       typedef const _Tp& const_reference;
  117       typedef _Tp        value_type;
  137 	allocator(const allocator<_Tp1>&) throw() { }
usr/include/c++/7.4.0/bits/move.h
   46     inline _GLIBCXX_CONSTEXPR _Tp*
   47     __addressof(_Tp& __r) _GLIBCXX_NOEXCEPT
   72     constexpr _Tp&&
   73     forward(typename std::remove_reference<_Tp>::type& __t) noexcept
   83     constexpr _Tp&&
   84     forward(typename std::remove_reference<_Tp>::type&& __t) noexcept
   98     move(_Tp&& __t) noexcept
usr/include/c++/7.4.0/bits/std_function.h
   62     : std::unary_function<_T1, _Res> { };
  390     : public _Maybe_unary_or_binary_function<_Res, _ArgTypes...>,
  595       _Res operator()(_ArgTypes... __args) const;
  628       using _Invoker_type = _Res (*)(const _Any_data&, _ArgTypes&&...);
  706       return _M_invoker(_M_functor, std::forward<_ArgTypes>(__args)...);
usr/include/c++/7.4.0/bits/stl_construct.h
   74     _Construct(_T1* __p, _Args&&... __args)
   74     _Construct(_T1* __p, _Args&&... __args)
   75     { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); }
   75     { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); }
   97     _Destroy(_Tp* __pointer)
usr/include/c++/7.4.0/bits/stl_function.h
  108       typedef _Arg 	argument_type;   
usr/include/c++/7.4.0/bits/stl_iterator_base_types.h
  181       typedef _Tp                         value_type;
  183       typedef _Tp*                        pointer;
  184       typedef _Tp&                        reference;
usr/include/c++/7.4.0/bits/stl_vector.h
   77 	rebind<_Tp>::other _Tp_alloc_type;
  216     class vector : protected _Vector_base<_Tp, _Alloc>
  227       typedef _Vector_base<_Tp, _Alloc>			_Base;
  232       typedef _Tp					value_type;
  919       _Tp*
  923       const _Tp*
usr/include/c++/7.4.0/ext/alloc_traits.h
  117       { typedef typename _Base_type::template rebind_alloc<_Tp> other; };
usr/include/c++/7.4.0/ext/new_allocator.h
   63       typedef _Tp*       pointer;
   64       typedef const _Tp* const_pointer;
   65       typedef _Tp&       reference;
   66       typedef const _Tp& const_reference;
   67       typedef _Tp        value_type;
usr/include/c++/7.4.0/initializer_list
   50       typedef _E 		value_type;
   51       typedef const _E& 	reference;
   52       typedef const _E& 	const_reference;
   54       typedef const _E* 	iterator;
   55       typedef const _E* 	const_iterator;
usr/include/c++/7.4.0/type_traits
  215     : public __is_void_helper<typename remove_cv<_Tp>::type>::type
  326     : public __is_integral_helper<typename remove_cv<_Tp>::type>::type
  354     : public __is_floating_point_helper<typename remove_cv<_Tp>::type>::type
  381     : public __is_pointer_helper<typename remove_cv<_Tp>::type>::type
  567     : public __is_null_pointer_helper<typename remove_cv<_Tp>::type>::type
  581     : public __or_<is_lvalue_reference<_Tp>,
  582                    is_rvalue_reference<_Tp>>::type
  588     : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type
  588     : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type
  601     : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
  601     : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
  602                           is_void<_Tp>>>::type
  611     : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>,
  611     : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>,
  611     : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>,
  612                    is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type
  612                    is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type
  631     : public __is_member_pointer_helper<typename remove_cv<_Tp>::type>::type
  638     : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
  638     : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
  777     : public __and_<is_array<_Tp>, __not_<extent<_Tp>>>
  777     : public __and_<is_array<_Tp>, __not_<extent<_Tp>>>
  798       typedef decltype(__test<_Tp>(0)) type;
  811                remove_all_extents<_Tp>::type>::type
  825     : public __is_destructible_safe<_Tp>::type
  984       typedef decltype(__test<_Tp, _Arg>(0)) type;
  989     : public __and_<is_destructible<_Tp>,
  990                     __is_direct_constructible_impl<_Tp, _Arg>>
 1072 			 __is_direct_constructible_ref_cast<_Tp, _Arg>,
 1073 			 __is_direct_constructible_new_safe<_Tp, _Arg>
 1079     : public __is_direct_constructible_new<_Tp, _Arg>::type
 1119     : public __is_direct_constructible<_Tp, _Arg>
 1130     : public __is_constructible_impl<_Tp, _Args...>::type
 1142     : public is_constructible<_Tp, const _Tp&>
 1142     : public is_constructible<_Tp, const _Tp&>
 1148     : public __is_copy_constructible_impl<_Tp>
 1160     : public is_constructible<_Tp, _Tp&&>
 1160     : public is_constructible<_Tp, _Tp&&>
 1166     : public __is_move_constructible_impl<_Tp>
 1554     { typedef _Tp     type; };
 1563     { typedef _Tp     type; };
 1574       remove_const<typename remove_volatile<_Tp>::type>::type     type;
 1629     { typedef _Tp   type; };
 1633     { typedef _Tp   type; };
 1659     { typedef _Tp&&   type; };
 1955     { typedef _Tp     type; };
utils/unittest/googletest/include/gtest/gtest-printers.h
  140   static void PrintValue(const T& value, ::std::ostream* os) {
  205     ::std::basic_ostream<Char, CharTraits>& os, const T& x) {
  206   TypeWithoutFormatter<T,
  207       (internal::IsAProtocolMessage<T>::value ? kProtobuf :
  208        internal::ImplicitlyConvertible<const T&, internal::BiggestInt>::value ?
  223 void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) {
  276   static ::std::string Format(const ToPrint& value) {
  351     const T1& value, const T2& /* other_operand */) {
  351     const T1& value, const T2& /* other_operand */) {
  352   return FormatForComparison<T1, T2>::Format(value);
  352   return FormatForComparison<T1, T2>::Format(value);
  366 void UniversalPrint(const T& value, ::std::ostream* os);
  373                     const C& container, ::std::ostream* os) {
  439                     const T& value, ::std::ostream* os) {
  455 void PrintTo(const T& value, ::std::ostream* os) {
  478   DefaultPrintTo(IsContainerTest<T>(0), is_pointer<T>(), value, os);
  699   static void Print(const T& value, ::std::ostream* os) {
  784   static void Print(const T& value, ::std::ostream* os) {
  856   typedef T T1;
  983   internal::UniversalTersePrinter<T>::Print(value, &ss);
utils/unittest/googletest/include/gtest/gtest.h
 1377                                    const T1& lhs, const T2& rhs) {
 1377                                    const T1& lhs, const T2& rhs) {
 1389                             const T1& lhs,
 1390                             const T2& rhs) {
 1419                                  const T1& lhs,
 1420                                  const T2& rhs) {
utils/unittest/googletest/include/gtest/internal/custom/raw-ostream.h
   29   static const T& printable(const T& V) { return V; }
   29   static const T& printable(const T& V) { return V; }
   35 auto printable(const T &V) -> decltype(StreamSwitch<T>::printable(V)) {
   35 auto printable(const T &V) -> decltype(StreamSwitch<T>::printable(V)) {
   37   return StreamSwitch<T>::printable(V);
utils/unittest/googletest/include/gtest/internal/gtest-internal.h
   94 ::std::string PrintToString(const T& value);