Searched refs:m_allocations (Results 1 – 6 of 6) sorted by relevance
38 while ((iter = m_allocations.begin()) != m_allocations.end()) in ~IRMemoryMap()42 m_allocations.erase(iter); in ~IRMemoryMap()109 return m_allocations.end(); in FindAllocation()111 AllocationMap::iterator iter = m_allocations.lower_bound (addr); in FindAllocation()113 if (iter == m_allocations.end() || in FindAllocation()116 if (iter == m_allocations.begin()) in FindAllocation()117 return m_allocations.end(); in FindAllocation()124 return m_allocations.end(); in FindAllocation()133 AllocationMap::iterator iter = m_allocations.lower_bound (addr); in IntersectsAllocation()135 if (iter == m_allocations.end() || in IntersectsAllocation()[all …]
44 for (size_t i = 0; i < m_allocations.size(); ++i) in ~VertexPacketAllocator()45 delete [] m_allocations[i]; in ~VertexPacketAllocator()46 m_allocations.clear(); in ~VertexPacketAllocator()67 m_allocations.push_back(ptr); // throws bad_alloc in allocArray()
110 std::vector<deInt8*> m_allocations; member in rr::VertexPacketAllocator
127 allocation_collection m_allocations; variable
916 m_allocations.insert (std::make_pair(addr, size)); in AllocateMemory()935 allocation_collection::iterator pos, end = m_allocations.end(); in DeallocateMemory()936 for (pos = m_allocations.begin(); pos != end; pos++) in DeallocateMemory()940 m_allocations.erase(pos); in DeallocateMemory()
116 AllocationMap m_allocations; variable