reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
491 struct TreeEntry;
638 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) 641 TreeEntry *UserTE = nullptr; 1146 int getEntryCost(TreeEntry *E); 1161 Value *vectorizeTree(TreeEntry *E); 1177 void setInsertPointAfterBundle(TreeEntry *E); 1194 using VecTreeTy = SmallVector<std::unique_ptr<TreeEntry>, 8>; 1385 TreeEntry *newTreeEntry(ArrayRef<Value *> VL, Optional<ScheduleData *> Bundle, 1391 VectorizableTree.push_back(std::make_unique<TreeEntry>(VectorizableTree)); 1392 TreeEntry *Last = VectorizableTree.back().get(); 1427 TreeEntry::VecTreeTy VectorizableTree; 1439 TreeEntry *getTreeEntry(Value *V) { 1446 const TreeEntry *getTreeEntry(Value *V) const { 1454 SmallDenseMap<Value*, TreeEntry *> ScalarToTreeEntry; 1664 TreeEntry *TE = nullptr; 1764 if (TreeEntry *TE = BundleMember->TE) { 1981 using TreeEntry = BoUpSLP::TreeEntry; 1986 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy; 2042 using TreeEntry = BoUpSLP::TreeEntry; 2115 TreeEntry *Entry = TEPtr.get(); 2146 if (TreeEntry *UseEntry = getTreeEntry(U)) { 2218 if (TreeEntry *E = getTreeEntry(S.OpValue)) { 2334 TreeEntry *TE = 2455 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, 2463 TreeEntry *TE = 2503 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2537 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2585 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2652 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2677 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2749 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2773 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, 2907 int BoUpSLP::getEntryCost(TreeEntry *E) { 3430 TreeEntry &TE = *VectorizableTree[I].get(); 3554 void BoUpSLP::setInsertPointAfterBundle(TreeEntry *E) { 3626 if (TreeEntry *E = getTreeEntry(VL[i])) { 3653 if (TreeEntry *E = getTreeEntry(S.OpValue)) { 3722 Value *BoUpSLP::vectorizeTree(TreeEntry *E) { 4285 TreeEntry *E = getTreeEntry(Scalar); 4357 TreeEntry *Entry = TEPtr.get();usr/include/c++/7.4.0/bits/unique_ptr.h
68 default_delete(const default_delete<_Up>&) noexcept { } 72 operator()(_Tp* __ptr) const 74 static_assert(!is_void<_Tp>::value, 76 static_assert(sizeof(_Tp)>0, 122 using type = _Up*; 137 using pointer = typename _Ptr<_Tp, _Dp>::type; 161 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type; 163 __uniq_ptr_impl<_Tp, _Dp> _M_t; 166 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer; 167 using element_type = _Tp; 252 unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept 297 __safe_conversion_up<_Up, _Ep>, 301 operator=(unique_ptr<_Up, _Ep>&& __u) noexcept 811 { typedef unique_ptr<_Tp> __single_object; }; 823 inline typename _MakeUniq<_Tp>::__single_object 825 { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }usr/include/c++/7.4.0/type_traits
215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type 581 : public __or_<is_lvalue_reference<_Tp>, 582 is_rvalue_reference<_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 638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type 638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type 1554 { typedef _Tp type; }; 1563 { typedef _Tp type; }; 1574 remove_const<typename remove_volatile<_Tp>::type>::type type; 1645 { typedef _Tp& type; }; 1650 : public __add_lvalue_reference_helper<_Tp>