91 | 250M | } llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, llvm::LiveInterval*, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >* llvm::Recycler<char, 192ul, 64ul>::Allocate<llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, llvm::LiveInterval*, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 19.5k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 19.5k | static_assert(alignof(SubClass) <= Align, | 86 | 19.5k | "Recycler allocation alignment is less than object align!"); | 87 | 19.5k | static_assert(sizeof(SubClass) <= Size, | 88 | 19.5k | "Recycler allocation size is less than object size!"); | 89 | 3.60k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 15.9k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 19.5k | } |
llvm::MCSymbolSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MCSymbolSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 49 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 49 | static_assert(alignof(SubClass) <= Align, | 86 | 49 | "Recycler allocation alignment is less than object align!"); | 87 | 49 | static_assert(sizeof(SubClass) <= Size, | 88 | 49 | "Recycler allocation size is less than object size!"); | 89 | 45 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 4 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 49 | } |
llvm::GlobalAddressSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::GlobalAddressSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 6.00M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 6.00M | static_assert(alignof(SubClass) <= Align, | 86 | 6.00M | "Recycler allocation alignment is less than object align!"); | 87 | 6.00M | static_assert(sizeof(SubClass) <= Size, | 88 | 6.00M | "Recycler allocation size is less than object size!"); | 89 | 5.92M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 79.8k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 6.00M | } |
llvm::ScopedHashTableVal<llvm::PointerUnion<llvm::Value const*, llvm::PseudoSourceValue const*>, std::__1::pair<unsigned int, unsigned int> >* llvm::Recycler<llvm::ScopedHashTableVal<llvm::PointerUnion<llvm::Value const*, llvm::PseudoSourceValue const*>, std::__1::pair<unsigned int, unsigned int> >, 32ul, 8ul>::Allocate<llvm::ScopedHashTableVal<llvm::PointerUnion<llvm::Value const*, llvm::PseudoSourceValue const*>, std::__1::pair<unsigned int, unsigned int> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 1.04k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 1.04k | static_assert(alignof(SubClass) <= Align, | 86 | 1.04k | "Recycler allocation alignment is less than object align!"); | 87 | 1.04k | static_assert(sizeof(SubClass) <= Size, | 88 | 1.04k | "Recycler allocation size is less than object size!"); | 89 | 771 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 275 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 1.04k | } |
llvm::TruncSStoreSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::TruncSStoreSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 19 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 19 | static_assert(alignof(SubClass) <= Align, | 86 | 19 | "Recycler allocation alignment is less than object align!"); | 87 | 19 | static_assert(sizeof(SubClass) <= Size, | 88 | 19 | "Recycler allocation size is less than object size!"); | 89 | 19 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 0 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 19 | } |
llvm::TruncUSStoreSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::TruncUSStoreSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 29 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 29 | static_assert(alignof(SubClass) <= Align, | 86 | 29 | "Recycler allocation alignment is less than object align!"); | 87 | 29 | static_assert(sizeof(SubClass) <= Size, | 88 | 29 | "Recycler allocation size is less than object size!"); | 89 | 29 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 0 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 29 | } |
llvm::MaskedTruncSStoreSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MaskedTruncSStoreSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 19 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 19 | static_assert(alignof(SubClass) <= Align, | 86 | 19 | "Recycler allocation alignment is less than object align!"); | 87 | 19 | static_assert(sizeof(SubClass) <= Size, | 88 | 19 | "Recycler allocation size is less than object size!"); | 89 | 19 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 0 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 19 | } |
llvm::MaskedTruncUSStoreSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MaskedTruncUSStoreSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 19 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 19 | static_assert(alignof(SubClass) <= Align, | 86 | 19 | "Recycler allocation alignment is less than object align!"); | 87 | 19 | static_assert(sizeof(SubClass) <= Size, | 88 | 19 | "Recycler allocation size is less than object size!"); | 89 | 19 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 0 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 19 | } |
llvm::X86MaskedGatherSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::X86MaskedGatherSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 9 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 9 | static_assert(alignof(SubClass) <= Align, | 86 | 9 | "Recycler allocation alignment is less than object align!"); | 87 | 9 | static_assert(sizeof(SubClass) <= Size, | 88 | 9 | "Recycler allocation size is less than object size!"); | 89 | 9 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 0 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 9 | } |
llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, unsigned int, 9u, llvm::IntervalMapInfo<llvm::SlotIndex> >* llvm::Recycler<char, 192ul, 64ul>::Allocate<llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, unsigned int, 9u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 46.3k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 46.3k | static_assert(alignof(SubClass) <= Align, | 86 | 46.3k | "Recycler allocation alignment is less than object align!"); | 87 | 46.3k | static_assert(sizeof(SubClass) <= Size, | 88 | 46.3k | "Recycler allocation size is less than object size!"); | 89 | 17.7k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 28.5k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 46.3k | } |
llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, unsigned int, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >* llvm::Recycler<char, 192ul, 64ul>::Allocate<llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, unsigned int, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 178 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 178 | static_assert(alignof(SubClass) <= Align, | 86 | 178 | "Recycler allocation alignment is less than object align!"); | 87 | 178 | static_assert(sizeof(SubClass) <= Size, | 88 | 178 | "Recycler allocation size is less than object size!"); | 89 | 100 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 78 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 178 | } |
llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, llvm::LiveInterval*, 8u, llvm::IntervalMapInfo<llvm::SlotIndex> >* llvm::Recycler<char, 192ul, 64ul>::Allocate<llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, llvm::LiveInterval*, 8u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 1.24M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 1.24M | static_assert(alignof(SubClass) <= Align, | 86 | 1.24M | "Recycler allocation alignment is less than object align!"); | 87 | 1.24M | static_assert(sizeof(SubClass) <= Size, | 88 | 1.24M | "Recycler allocation size is less than object size!"); | 89 | 685k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 562k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 1.24M | } |
llvm::MachineSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MachineSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 1.18M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 1.18M | static_assert(alignof(SubClass) <= Align, | 86 | 1.18M | "Recycler allocation alignment is less than object align!"); | 87 | 1.18M | static_assert(sizeof(SubClass) <= Size, | 88 | 1.18M | "Recycler allocation size is less than object size!"); | 89 | 1.15M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 27.5k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 1.18M | } |
llvm::ScopedHashTableVal<llvm::MachineInstr*, unsigned int>* llvm::Recycler<llvm::ScopedHashTableVal<llvm::MachineInstr*, unsigned int>, 32ul, 8ul>::Allocate<llvm::ScopedHashTableVal<llvm::MachineInstr*, unsigned int>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 7.87M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 7.87M | static_assert(alignof(SubClass) <= Align, | 86 | 7.87M | "Recycler allocation alignment is less than object align!"); | 87 | 7.87M | static_assert(sizeof(SubClass) <= Size, | 88 | 7.87M | "Recycler allocation size is less than object size!"); | 89 | 6.64M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 1.23M | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 7.87M | } |
llvm::MachineInstr* llvm::Recycler<llvm::MachineInstr, 64ul, 8ul>::Allocate<llvm::MachineInstr, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 91.2M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 91.2M | static_assert(alignof(SubClass) <= Align, | 86 | 91.2M | "Recycler allocation alignment is less than object align!"); | 87 | 91.2M | static_assert(sizeof(SubClass) <= Size, | 88 | 91.2M | "Recycler allocation size is less than object size!"); | 89 | 36.6M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 54.6M | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 91.2M | } |
llvm::MachineBasicBlock* llvm::Recycler<llvm::MachineBasicBlock, 176ul, 8ul>::Allocate<llvm::MachineBasicBlock, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 5.99M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 5.99M | static_assert(alignof(SubClass) <= Align, | 86 | 5.99M | "Recycler allocation alignment is less than object align!"); | 87 | 5.99M | static_assert(sizeof(SubClass) <= Size, | 88 | 5.99M | "Recycler allocation size is less than object size!"); | 89 | 85.8k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 5.90M | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 5.99M | } |
EarlyCSE.cpp:llvm::ScopedHashTableVal<(anonymous namespace)::SimpleValue, llvm::Value*>* llvm::Recycler<llvm::ScopedHashTableVal<(anonymous namespace)::SimpleValue, llvm::Value*>, 32ul, 8ul>::Allocate<llvm::ScopedHashTableVal<(anonymous namespace)::SimpleValue, llvm::Value*>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 21.3M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 21.3M | static_assert(alignof(SubClass) <= Align, | 86 | 21.3M | "Recycler allocation alignment is less than object align!"); | 87 | 21.3M | static_assert(sizeof(SubClass) <= Size, | 88 | 21.3M | "Recycler allocation size is less than object size!"); | 89 | 7.33M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 14.0M | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 21.3M | } |
EarlyCSE.cpp:llvm::ScopedHashTableVal<llvm::Value*, (anonymous namespace)::EarlyCSE::LoadValue>* llvm::Recycler<llvm::ScopedHashTableVal<llvm::Value*, (anonymous namespace)::EarlyCSE::LoadValue>, 48ul, 8ul>::Allocate<llvm::ScopedHashTableVal<llvm::Value*, (anonymous namespace)::EarlyCSE::LoadValue>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 7.22M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 7.22M | static_assert(alignof(SubClass) <= Align, | 86 | 7.22M | "Recycler allocation alignment is less than object align!"); | 87 | 7.22M | static_assert(sizeof(SubClass) <= Size, | 88 | 7.22M | "Recycler allocation size is less than object size!"); | 89 | 2.54M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 4.67M | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 7.22M | } |
llvm::ConstantSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::ConstantSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 21.9M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 21.9M | static_assert(alignof(SubClass) <= Align, | 86 | 21.9M | "Recycler allocation alignment is less than object align!"); | 87 | 21.9M | static_assert(sizeof(SubClass) <= Size, | 88 | 21.9M | "Recycler allocation size is less than object size!"); | 89 | 21.5M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 381k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 21.9M | } |
llvm::ConstantFPSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::ConstantFPSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 158k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 158k | static_assert(alignof(SubClass) <= Align, | 86 | 158k | "Recycler allocation alignment is less than object align!"); | 87 | 158k | static_assert(sizeof(SubClass) <= Size, | 88 | 158k | "Recycler allocation size is less than object size!"); | 89 | 142k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 16.3k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 158k | } |
llvm::MaskedScatterSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MaskedScatterSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 178 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 178 | static_assert(alignof(SubClass) <= Align, | 86 | 178 | "Recycler allocation alignment is less than object align!"); | 87 | 178 | static_assert(sizeof(SubClass) <= Size, | 88 | 178 | "Recycler allocation size is less than object size!"); | 89 | 175 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 3 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 178 | } |
llvm::FrameIndexSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::FrameIndexSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 1.00M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 1.00M | static_assert(alignof(SubClass) <= Align, | 86 | 1.00M | "Recycler allocation alignment is less than object align!"); | 87 | 1.00M | static_assert(sizeof(SubClass) <= Size, | 88 | 1.00M | "Recycler allocation size is less than object size!"); | 89 | 969k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 33.3k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 1.00M | } |
llvm::JumpTableSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::JumpTableSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 14.8k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 14.8k | static_assert(alignof(SubClass) <= Align, | 86 | 14.8k | "Recycler allocation alignment is less than object align!"); | 87 | 14.8k | static_assert(sizeof(SubClass) <= Size, | 88 | 14.8k | "Recycler allocation size is less than object size!"); | 89 | 14.8k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 1 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 14.8k | } |
llvm::ConstantPoolSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::ConstantPoolSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 285k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 285k | static_assert(alignof(SubClass) <= Align, | 86 | 285k | "Recycler allocation alignment is less than object align!"); | 87 | 285k | static_assert(sizeof(SubClass) <= Size, | 88 | 285k | "Recycler allocation size is less than object size!"); | 89 | 281k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 3.36k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 285k | } |
Unexecuted instantiation: llvm::TargetIndexSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::TargetIndexSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) llvm::BasicBlockSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::BasicBlockSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 3.91M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 3.91M | static_assert(alignof(SubClass) <= Align, | 86 | 3.91M | "Recycler allocation alignment is less than object align!"); | 87 | 3.91M | static_assert(sizeof(SubClass) <= Size, | 88 | 3.91M | "Recycler allocation size is less than object size!"); | 89 | 3.82M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 92.0k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 3.91M | } |
llvm::VTSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::VTSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 876k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 876k | static_assert(alignof(SubClass) <= Align, | 86 | 876k | "Recycler allocation alignment is less than object align!"); | 87 | 876k | static_assert(sizeof(SubClass) <= Size, | 88 | 876k | "Recycler allocation size is less than object size!"); | 89 | 869k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 7.40k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 876k | } |
llvm::ExternalSymbolSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::ExternalSymbolSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 67.6k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 67.6k | static_assert(alignof(SubClass) <= Align, | 86 | 67.6k | "Recycler allocation alignment is less than object align!"); | 87 | 67.6k | static_assert(sizeof(SubClass) <= Size, | 88 | 67.6k | "Recycler allocation size is less than object size!"); | 89 | 63.3k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 4.35k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 67.6k | } |
llvm::MaskedGatherSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MaskedGatherSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 290 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 290 | static_assert(alignof(SubClass) <= Align, | 86 | 290 | "Recycler allocation alignment is less than object align!"); | 87 | 290 | static_assert(sizeof(SubClass) <= Size, | 88 | 290 | "Recycler allocation size is less than object size!"); | 89 | 275 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 15 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 290 | } |
llvm::CondCodeSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::CondCodeSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 2.91M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 2.91M | static_assert(alignof(SubClass) <= Align, | 86 | 2.91M | "Recycler allocation alignment is less than object align!"); | 87 | 2.91M | static_assert(sizeof(SubClass) <= Size, | 88 | 2.91M | "Recycler allocation size is less than object size!"); | 89 | 2.85M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 56.6k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 2.91M | } |
llvm::ShuffleVectorSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::ShuffleVectorSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 70.7k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 70.7k | static_assert(alignof(SubClass) <= Align, | 86 | 70.7k | "Recycler allocation alignment is less than object align!"); | 87 | 70.7k | static_assert(sizeof(SubClass) <= Size, | 88 | 70.7k | "Recycler allocation size is less than object size!"); | 89 | 66.6k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 4.13k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 70.7k | } |
llvm::RegisterSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::RegisterSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 14.1M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 14.1M | static_assert(alignof(SubClass) <= Align, | 86 | 14.1M | "Recycler allocation alignment is less than object align!"); | 87 | 14.1M | static_assert(sizeof(SubClass) <= Size, | 88 | 14.1M | "Recycler allocation size is less than object size!"); | 89 | 13.8M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 254k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 14.1M | } |
llvm::RegisterMaskSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::RegisterMaskSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 1.09M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 1.09M | static_assert(alignof(SubClass) <= Align, | 86 | 1.09M | "Recycler allocation alignment is less than object align!"); | 87 | 1.09M | static_assert(sizeof(SubClass) <= Size, | 88 | 1.09M | "Recycler allocation size is less than object size!"); | 89 | 1.08M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 14.3k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 1.09M | } |
llvm::LabelSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::LabelSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 37.0k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 37.0k | static_assert(alignof(SubClass) <= Align, | 86 | 37.0k | "Recycler allocation alignment is less than object align!"); | 87 | 37.0k | static_assert(sizeof(SubClass) <= Size, | 88 | 37.0k | "Recycler allocation size is less than object size!"); | 89 | 36.1k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 895 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 37.0k | } |
llvm::BlockAddressSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::BlockAddressSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 244 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 244 | static_assert(alignof(SubClass) <= Align, | 86 | 244 | "Recycler allocation alignment is less than object align!"); | 87 | 244 | static_assert(sizeof(SubClass) <= Size, | 88 | 244 | "Recycler allocation size is less than object size!"); | 89 | 174 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 70 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 244 | } |
llvm::SrcValueSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::SrcValueSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 849 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 849 | static_assert(alignof(SubClass) <= Align, | 86 | 849 | "Recycler allocation alignment is less than object align!"); | 87 | 849 | static_assert(sizeof(SubClass) <= Size, | 88 | 849 | "Recycler allocation size is less than object size!"); | 89 | 712 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 137 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 849 | } |
llvm::MDNodeSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MDNodeSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 11.8k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 11.8k | static_assert(alignof(SubClass) <= Align, | 86 | 11.8k | "Recycler allocation alignment is less than object align!"); | 87 | 11.8k | static_assert(sizeof(SubClass) <= Size, | 88 | 11.8k | "Recycler allocation size is less than object size!"); | 89 | 7.33k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 4.52k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 11.8k | } |
llvm::AddrSpaceCastSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::AddrSpaceCastSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 199 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 199 | static_assert(alignof(SubClass) <= Align, | 86 | 199 | "Recycler allocation alignment is less than object align!"); | 87 | 199 | static_assert(sizeof(SubClass) <= Size, | 88 | 199 | "Recycler allocation size is less than object size!"); | 89 | 160 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 39 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 199 | } |
llvm::SDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::SDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 54.9M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 54.9M | static_assert(alignof(SubClass) <= Align, | 86 | 54.9M | "Recycler allocation alignment is less than object align!"); | 87 | 54.9M | static_assert(sizeof(SubClass) <= Size, | 88 | 54.9M | "Recycler allocation size is less than object size!"); | 89 | 52.7M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 2.20M | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 54.9M | } |
llvm::AtomicSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::AtomicSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 26.5k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 26.5k | static_assert(alignof(SubClass) <= Align, | 86 | 26.5k | "Recycler allocation alignment is less than object align!"); | 87 | 26.5k | static_assert(sizeof(SubClass) <= Size, | 88 | 26.5k | "Recycler allocation size is less than object size!"); | 89 | 25.8k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 720 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 26.5k | } |
llvm::MemIntrinsicSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MemIntrinsicSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 134k | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 134k | static_assert(alignof(SubClass) <= Align, | 86 | 134k | "Recycler allocation alignment is less than object align!"); | 87 | 134k | static_assert(sizeof(SubClass) <= Size, | 88 | 134k | "Recycler allocation size is less than object size!"); | 89 | 109k | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 25.3k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 134k | } |
llvm::LoadSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::LoadSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 3.33M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 3.33M | static_assert(alignof(SubClass) <= Align, | 86 | 3.33M | "Recycler allocation alignment is less than object align!"); | 87 | 3.33M | static_assert(sizeof(SubClass) <= Size, | 88 | 3.33M | "Recycler allocation size is less than object size!"); | 89 | 3.20M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 125k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 3.33M | } |
llvm::StoreSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::StoreSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 3.51M | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 3.51M | static_assert(alignof(SubClass) <= Align, | 86 | 3.51M | "Recycler allocation alignment is less than object align!"); | 87 | 3.51M | static_assert(sizeof(SubClass) <= Size, | 88 | 3.51M | "Recycler allocation size is less than object size!"); | 89 | 3.32M | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 188k | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 3.51M | } |
llvm::MaskedLoadSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MaskedLoadSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 316 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 316 | static_assert(alignof(SubClass) <= Align, | 86 | 316 | "Recycler allocation alignment is less than object align!"); | 87 | 316 | static_assert(sizeof(SubClass) <= Size, | 88 | 316 | "Recycler allocation size is less than object size!"); | 89 | 277 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 39 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 316 | } |
llvm::MaskedStoreSDNode* llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Allocate<llvm::MaskedStoreSDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 84 | 199 | SubClass *Allocate(AllocatorType &Allocator) { | 85 | 199 | static_assert(alignof(SubClass) <= Align, | 86 | 199 | "Recycler allocation alignment is less than object align!"); | 87 | 199 | static_assert(sizeof(SubClass) <= Size, | 88 | 199 | "Recycler allocation size is less than object size!"); | 89 | 194 | return FreeList ? reinterpret_cast<SubClass *>(pop_val()) | 90 | 5 | : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); | 91 | 199 | } |
|
101 | 211M | } EarlyCSE.cpp:void llvm::Recycler<llvm::ScopedHashTableVal<(anonymous namespace)::SimpleValue, llvm::Value*>, 32ul, 8ul>::Deallocate<llvm::ScopedHashTableVal<(anonymous namespace)::SimpleValue, llvm::Value*>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::ScopedHashTableVal<(anonymous namespace)::SimpleValue, llvm::Value*>*) Line | Count | Source | 99 | 21.3M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 21.3M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 21.3M | } |
void llvm::Recycler<llvm::SDNode, 104ul, 8ul>::Deallocate<llvm::SDNode, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::SDNode*) Line | Count | Source | 99 | 115M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 115M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 115M | } |
void llvm::Recycler<llvm::ScopedHashTableVal<llvm::PointerUnion<llvm::Value const*, llvm::PseudoSourceValue const*>, std::__1::pair<unsigned int, unsigned int> >, 32ul, 8ul>::Deallocate<llvm::ScopedHashTableVal<llvm::PointerUnion<llvm::Value const*, llvm::PseudoSourceValue const*>, std::__1::pair<unsigned int, unsigned int> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::ScopedHashTableVal<llvm::PointerUnion<llvm::Value const*, llvm::PseudoSourceValue const*>, std::__1::pair<unsigned int, unsigned int> >*) Line | Count | Source | 99 | 1.04k | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 1.04k | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 1.04k | } |
void llvm::Recycler<llvm::MachineBasicBlock, 176ul, 8ul>::Deallocate<llvm::MachineBasicBlock, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::MachineBasicBlock*) Line | Count | Source | 99 | 5.99M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 5.99M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 5.99M | } |
void llvm::Recycler<llvm::MachineInstr, 64ul, 8ul>::Deallocate<llvm::MachineInstr, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::MachineInstr*) Line | Count | Source | 99 | 51.9M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 51.9M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 51.9M | } |
void llvm::Recycler<llvm::ScopedHashTableVal<llvm::MachineInstr*, unsigned int>, 32ul, 8ul>::Deallocate<llvm::ScopedHashTableVal<llvm::MachineInstr*, unsigned int>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::ScopedHashTableVal<llvm::MachineInstr*, unsigned int>*) Line | Count | Source | 99 | 7.87M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 7.87M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 7.87M | } |
void llvm::Recycler<char, 192ul, 64ul>::Deallocate<llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, unsigned int, 9u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, unsigned int, 9u, llvm::IntervalMapInfo<llvm::SlotIndex> >*) Line | Count | Source | 99 | 46.3k | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 46.3k | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 46.3k | } |
void llvm::Recycler<char, 192ul, 64ul>::Deallocate<llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, unsigned int, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, unsigned int, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >*) Line | Count | Source | 99 | 178 | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 178 | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 178 | } |
void llvm::Recycler<char, 192ul, 64ul>::Deallocate<llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, llvm::LiveInterval*, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::IntervalMapImpl::BranchNode<llvm::SlotIndex, llvm::LiveInterval*, 12u, llvm::IntervalMapInfo<llvm::SlotIndex> >*) Line | Count | Source | 99 | 19.5k | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 19.5k | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 19.5k | } |
EarlyCSE.cpp:void llvm::Recycler<llvm::ScopedHashTableVal<llvm::Value*, (anonymous namespace)::EarlyCSE::LoadValue>, 48ul, 8ul>::Deallocate<llvm::ScopedHashTableVal<llvm::Value*, (anonymous namespace)::EarlyCSE::LoadValue>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::ScopedHashTableVal<llvm::Value*, (anonymous namespace)::EarlyCSE::LoadValue>*) Line | Count | Source | 99 | 7.22M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 7.22M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 7.22M | } |
void llvm::Recycler<char, 192ul, 64ul>::Deallocate<llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, llvm::LiveInterval*, 8u, llvm::IntervalMapInfo<llvm::SlotIndex> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::IntervalMapImpl::LeafNode<llvm::SlotIndex, llvm::LiveInterval*, 8u, llvm::IntervalMapInfo<llvm::SlotIndex> >*) Line | Count | Source | 99 | 1.24M | void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) { | 100 | 1.24M | push(reinterpret_cast<FreeNode *>(Element)); | 101 | 1.24M | } |
|