| 1 | // REQUIRES: x86-registered-target |
| 2 | // RUN: %clang_cc1 -triple x86_64-apple-darwin -std=c++11 -S %s -o %t-64.s |
| 3 | // RUN: FileCheck -check-prefix CHECK-LP64 --input-file=%t-64.s %s |
| 4 | // RUN: %clang_cc1 -triple i386-apple-darwin -std=c++11 -S %s -o %t-32.s |
| 5 | // RUN: FileCheck -check-prefix CHECK-LP32 --input-file=%t-32.s %s |
| 6 | |
| 7 | // PR4826 |
| 8 | struct A { |
| 9 | A() { |
| 10 | } |
| 11 | }; |
| 12 | |
| 13 | template<typename T> |
| 14 | struct B { |
| 15 | B(T) {} |
| 16 | |
| 17 | A nodes; |
| 18 | }; |
| 19 | |
| 20 | |
| 21 | // PR4853 |
| 22 | template <typename T> class List { |
| 23 | public: |
| 24 | List(){ } // List<BinomialNode<int>*>::List() remains undefined. |
| 25 | ~List() {} |
| 26 | }; |
| 27 | |
| 28 | template <typename T> class Node { |
| 29 | int i; |
| 30 | public: |
| 31 | Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined. |
| 32 | ~Node() {} |
| 33 | }; |
| 34 | |
| 35 | |
| 36 | template<typename T> class BinomialNode : Node<BinomialNode<T>*> { |
| 37 | public: |
| 38 | BinomialNode(T value) {} |
| 39 | List<BinomialNode<T>*> nodes; |
| 40 | }; |
| 41 | |
| 42 | int main() { |
| 43 | B<int> *n = new B<int>(4); |
| 44 | BinomialNode<int> *node = new BinomialNode<int>(1); |
| 45 | delete node; |
| 46 | } |
| 47 | |
| 48 | // CHECK-LP64: __ZN4ListIP12BinomialNodeIiEED1Ev: |
| 49 | // CHECK-LP64: __ZN4NodeIP12BinomialNodeIiEEC2Ev: |
| 50 | // CHECK-LP64: __ZN4ListIP12BinomialNodeIiEEC1Ev: |
| 51 | |
| 52 | // CHECK-LP32: __ZN4ListIP12BinomialNodeIiEED1Ev: |
| 53 | // CHECK-LP32: __ZN4NodeIP12BinomialNodeIiEEC2Ev: |
| 54 | // CHECK-LP32: __ZN4ListIP12BinomialNodeIiEEC1Ev: |
| 55 | |