// PR tree-optimization/22444
|
// PR tree-optimization/22444
|
// When creating SFT's, we shouldn't add the original variable
|
// When creating SFT's, we shouldn't add the original variable
|
// to the addressable vars list, because this may cause false aliasing
|
// to the addressable vars list, because this may cause false aliasing
|
// with the subvars leading to the subvars not being renamed when they should
|
// with the subvars leading to the subvars not being renamed when they should
|
// { dg-do compile }
|
// { dg-do compile }
|
// { dg-options "-O2" }
|
// { dg-options "-O2" }
|
__extension__ typedef __PTRDIFF_TYPE__ ptrdiff_t;
|
__extension__ typedef __PTRDIFF_TYPE__ ptrdiff_t;
|
__extension__ typedef __SIZE_TYPE__ size_t;
|
__extension__ typedef __SIZE_TYPE__ size_t;
|
namespace std
|
namespace std
|
{
|
{
|
template struct pair
|
template struct pair
|
{
|
{
|
_T1 first;
|
_T1 first;
|
_T2 second;
|
_T2 second;
|
pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) { }
|
pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) { }
|
};
|
};
|
}
|
}
|
namespace __gnu_internal
|
namespace __gnu_internal
|
{
|
{
|
typedef char __one;
|
typedef char __one;
|
template __one __test_type(int _Tp::*);
|
template __one __test_type(int _Tp::*);
|
}
|
}
|
namespace std
|
namespace std
|
{
|
{
|
template struct ___is_pod
|
template struct ___is_pod
|
{
|
{
|
enum { __value = (sizeof(__gnu_internal::__test_type<_Tp>(0))!= sizeof(__gnu_internal::__one)) };
|
enum { __value = (sizeof(__gnu_internal::__test_type<_Tp>(0))!= sizeof(__gnu_internal::__one)) };
|
};
|
};
|
template struct iterator
|
template struct iterator
|
{ };
|
{ };
|
template struct iterator_traits
|
template struct iterator_traits
|
{
|
{
|
typedef typename _Iterator::difference_type difference_type;
|
typedef typename _Iterator::difference_type difference_type;
|
};
|
};
|
template class reverse_iterator : public iterator::iterator_category, typename iterator_traits<_Iterator>::value_type, typename iterator_traits<_Iterator>::difference_type, typename iterator_traits<_Iterator>::pointer, typename iterator_traits<_Iterator>::reference>
|
template class reverse_iterator : public iterator::iterator_category, typename iterator_traits<_Iterator>::value_type, typename iterator_traits<_Iterator>::difference_type, typename iterator_traits<_Iterator>::pointer, typename iterator_traits<_Iterator>::reference>
|
{
|
{
|
typedef _Iterator iterator_type;
|
typedef _Iterator iterator_type;
|
typedef typename iterator_traits<_Iterator>::difference_type difference_type;
|
typedef typename iterator_traits<_Iterator>::difference_type difference_type;
|
typedef typename iterator_traits<_Iterator>::reference reference;
|
typedef typename iterator_traits<_Iterator>::reference reference;
|
reverse_iterator operator+(difference_type __n) const {}
|
reverse_iterator operator+(difference_type __n) const {}
|
reverse_iterator& operator+=(difference_type __n) { }
|
reverse_iterator& operator+=(difference_type __n) { }
|
reference operator[](difference_type __n) const { }
|
reference operator[](difference_type __n) const { }
|
};
|
};
|
}
|
}
|
namespace __gnu_cxx
|
namespace __gnu_cxx
|
{
|
{
|
template class __pool;
|
template class __pool;
|
template class _PoolTp, bool _Thread> struct __common_pool_policy;
|
template class _PoolTp, bool _Thread> struct __common_pool_policy;
|
template class __mt_alloc_base
|
template class __mt_alloc_base
|
{
|
{
|
typedef ptrdiff_t difference_type;
|
typedef ptrdiff_t difference_type;
|
typedef _Tp* pointer;
|
typedef _Tp* pointer;
|
};
|
};
|
template > class __mt_alloc : public __mt_alloc_base<_Tp>
|
template > class __mt_alloc : public __mt_alloc_base<_Tp>
|
{
|
{
|
typedef size_t size_type;
|
typedef size_t size_type;
|
};
|
};
|
}
|
}
|
namespace std
|
namespace std
|
{
|
{
|
template struct allocator:public __gnu_cxx::__mt_alloc<_Tp>
|
template struct allocator:public __gnu_cxx::__mt_alloc<_Tp>
|
{
|
{
|
template struct rebind
|
template struct rebind
|
{
|
{
|
typedef allocator<_Tp1> other;
|
typedef allocator<_Tp1> other;
|
};
|
};
|
};
|
};
|
template struct unary_function { };
|
template struct unary_function { };
|
template struct binary_function
|
template struct binary_function
|
{
|
{
|
typedef _Arg2 second_argument_type;
|
typedef _Arg2 second_argument_type;
|
};
|
};
|
template struct less : public binary_function<_Tp, _Tp, bool>
|
template struct less : public binary_function<_Tp, _Tp, bool>
|
{
|
{
|
bool operator()(const _Tp& __x, const _Tp& __y) const { }
|
bool operator()(const _Tp& __x, const _Tp& __y) const { }
|
};
|
};
|
template struct _Identity : public unary_function<_Tp,_Tp> { };
|
template struct _Identity : public unary_function<_Tp,_Tp> { };
|
struct _Rb_tree_node_base
|
struct _Rb_tree_node_base
|
{
|
{
|
typedef _Rb_tree_node_base* _Base_ptr;
|
typedef _Rb_tree_node_base* _Base_ptr;
|
typedef const _Rb_tree_node_base* _Const_Base_ptr;
|
typedef const _Rb_tree_node_base* _Const_Base_ptr;
|
_Base_ptr _M_right;
|
_Base_ptr _M_right;
|
static _Base_ptr _S_minimum(_Base_ptr __x) { }
|
static _Base_ptr _S_minimum(_Base_ptr __x) { }
|
static _Base_ptr _S_maximum(_Base_ptr __x) { }
|
static _Base_ptr _S_maximum(_Base_ptr __x) { }
|
};
|
};
|
template struct _Rb_tree_node { };
|
template struct _Rb_tree_node { };
|
template struct _Rb_tree_iterator
|
template struct _Rb_tree_iterator
|
{
|
{
|
typedef _Tp* pointer;
|
typedef _Tp* pointer;
|
typedef _Rb_tree_iterator<_Tp> _Self;
|
typedef _Rb_tree_iterator<_Tp> _Self;
|
typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
|
typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
|
pointer operator->() const { }
|
pointer operator->() const { }
|
_Self operator++(int) { }
|
_Self operator++(int) { }
|
_Base_ptr _M_node;
|
_Base_ptr _M_node;
|
};
|
};
|
template struct _Rb_tree_const_iterator
|
template struct _Rb_tree_const_iterator
|
{
|
{
|
typedef const _Tp* pointer;
|
typedef const _Tp* pointer;
|
typedef _Rb_tree_iterator<_Tp> iterator;
|
typedef _Rb_tree_iterator<_Tp> iterator;
|
typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
|
typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
|
_Rb_tree_const_iterator(const iterator& __it) : _M_node(__it._M_node) { }
|
_Rb_tree_const_iterator(const iterator& __it) : _M_node(__it._M_node) { }
|
_Base_ptr _M_node;
|
_Base_ptr _M_node;
|
};
|
};
|
template > struct _Rb_tree
|
template > struct _Rb_tree
|
{
|
{
|
typedef typename _Alloc::template rebind >::other _Node_allocator;
|
typedef typename _Alloc::template rebind >::other _Node_allocator;
|
typedef _Rb_tree_node_base* _Base_ptr;
|
typedef _Rb_tree_node_base* _Base_ptr;
|
typedef const _Rb_tree_node_base* _Const_Base_ptr;
|
typedef const _Rb_tree_node_base* _Const_Base_ptr;
|
typedef std::_Rb_tree_node<_Val> _Rb_tree_node;
|
typedef std::_Rb_tree_node<_Val> _Rb_tree_node;
|
typedef _Key key_type;
|
typedef _Key key_type;
|
typedef _Val value_type;
|
typedef _Val value_type;
|
typedef value_type* pointer;
|
typedef value_type* pointer;
|
typedef _Rb_tree_node* _Link_type;
|
typedef _Rb_tree_node* _Link_type;
|
template::__value> struct _Rb_tree_impl
|
template::__value> struct _Rb_tree_impl
|
: _Node_allocator
|
: _Node_allocator
|
{
|
{
|
_Rb_tree_node_base _M_header;
|
_Rb_tree_node_base _M_header;
|
};
|
};
|
_Rb_tree_impl<_Compare> _M_impl;
|
_Rb_tree_impl<_Compare> _M_impl;
|
typedef _Rb_tree_iterator iterator;
|
typedef _Rb_tree_iterator iterator;
|
typedef _Rb_tree_const_iterator const_iterator;
|
typedef _Rb_tree_const_iterator const_iterator;
|
typedef std::reverse_iterator reverse_iterator;
|
typedef std::reverse_iterator reverse_iterator;
|
pair insert_unique(const value_type& __x);
|
pair insert_unique(const value_type& __x);
|
};
|
};
|
template class set
|
template class set
|
{
|
{
|
typedef _Key key_type;
|
typedef _Key key_type;
|
typedef _Key value_type;
|
typedef _Key value_type;
|
typedef _Compare key_compare;
|
typedef _Compare key_compare;
|
typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;
|
typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;
|
typedef _Rb_tree<_Key, value_type, _Identity, key_compare, _Key_alloc_type> _Rep_type;
|
typedef _Rb_tree<_Key, value_type, _Identity, key_compare, _Key_alloc_type> _Rep_type;
|
_Rep_type _M_t;
|
_Rep_type _M_t;
|
typedef typename _Rep_type::const_iterator iterator;
|
typedef typename _Rep_type::const_iterator iterator;
|
std::pair insert(const value_type& __x)
|
std::pair insert(const value_type& __x)
|
{
|
{
|
std::pair __p = _M_t.insert_unique(__x);
|
std::pair __p = _M_t.insert_unique(__x);
|
return std::pair(__p.first, __p.second);
|
return std::pair(__p.first, __p.second);
|
}
|
}
|
};
|
};
|
}
|
}
|
template class std::set, std::allocator >;
|
template class std::set, std::allocator >;
|
|
|
