Searched refs:allocations_ (Results 1 – 8 of 8) sorted by relevance
34 HeapProfile() : allocations_(1024) {} in HeapProfile()39 for (uptr i = 0; i < allocations_.size(); i++) { in Insert()40 if (allocations_[i].id == id) { in Insert()41 allocations_[i].total_size += size; in Insert()42 allocations_[i].count++; in Insert()46 allocations_.push_back({id, size, 1}); in Insert()50 InternalSort(&allocations_, allocations_.size(), in Print()58 for (uptr i = 0; i < allocations_.size(); i++) { in Print()59 auto &a = allocations_[i]; in Print()72 InternalMmapVector<AllocationSite> allocations_; member in __asan::HeapProfile
20 index_ = register_.allocations_.Next(index_ + 1); in operator ++()78 : allocations_(allocation_capacity), in AllocationRegister()99 auto index_and_flag = allocations_.Insert(address, info); in Insert()102 auto& old_info = allocations_.Get(index_and_flag.first).second; in Insert()109 auto index = allocations_.Find(address); in Remove()114 const AllocationInfo& info = allocations_.Get(index).second; in Remove()116 allocations_.Remove(index); in Remove()121 auto index = allocations_.Find(address); in Get()133 return ConstIterator(*this, allocations_.Next(0)); in begin()144 + allocations_.EstimateUsedMemory() in EstimateTraceMemoryOverhead()[all …]
347 AllocationMap allocations_; variable
111 node->allocations_[size]++; in SampleObject()122 DCHECK(node->allocations_[sample->size] > 0); in OnWeakCallback()123 node->allocations_[sample->size]--; in OnWeakCallback()124 if (node->allocations_[sample->size] == 0) { in OnWeakCallback()125 node->allocations_.erase(sample->size); in OnWeakCallback()126 while (node->allocations_.empty() && node->children_.empty() && in OnWeakCallback()221 allocations.reserve(node->allocations_.size()); in TranslateAllocationNode()238 for (auto alloc : node->allocations_) { in TranslateAllocationNode()
109 std::map<size_t, unsigned int> allocations_; variable
127 for (AllocationMap::iterator it = allocations_.begin(); in ~TurnServer()128 it != allocations_.end(); ++it) { in ~TurnServer()431 AllocationMap::const_iterator it = allocations_.find(*conn); in FindAllocation()432 return (it != allocations_.end()) ? it->second : NULL; in FindAllocation()448 allocations_[*conn] = allocation; in CreateAllocation()513 AllocationMap::iterator it = allocations_.find(*(allocation->conn())); in OnAllocationDestroyed()514 if (it != allocations_.end()) in OnAllocationDestroyed()515 allocations_.erase(it); in OnAllocationDestroyed()
175 const AllocationMap& allocations() const { return allocations_; } in allocations()271 AllocationMap allocations_; variable
518 vector<void*> allocations_; // All other memory allocated in the pool. member in google::protobuf::DescriptorPool::Tables529 allocations_before_checkpoint(tables->allocations_.size()), in CheckPoint()656 for (int i = 0; i < allocations_.size(); i++) { in ~Tables()657 operator delete(allocations_[i]); in ~Tables()753 i < allocations_.size(); in RollbackToLastCheckpoint()755 operator delete(allocations_[i]); in RollbackToLastCheckpoint()761 allocations_.resize(checkpoint.allocations_before_checkpoint); in RollbackToLastCheckpoint()1018 allocations_.push_back(result); in AllocateBytes()