Home
last modified time | relevance | path

Searched refs:heap_ (Results 1 – 6 of 6) sorted by relevance

/external/libchrome/mojo/core/ports/
Dmessage_queue.cc33 for (const auto& message : heap_) in ~MessageQueue()
41 return !heap_.empty() && heap_[0]->sequence_num() == next_sequence_num_; in HasNextMessage()
46 if (!HasNextMessage() || (filter && !filter->Match(*heap_[0]))) { in GetNextMessage()
51 std::pop_heap(heap_.begin(), heap_.end()); in GetNextMessage()
52 *message = std::move(heap_.back()); in GetNextMessage()
54 heap_.pop_back(); in GetNextMessage()
64 heap_.emplace_back(std::move(message)); in AcceptMessage()
65 std::push_heap(heap_.begin(), heap_.end()); in AcceptMessage()
70 *has_next_message = (heap_[0]->sequence_num() == next_sequence_num_); in AcceptMessage()
76 *messages = std::move(heap_); in TakeAllMessages()
Dmessage_queue.h67 size_t queued_message_count() const { return heap_.size(); } in COMPONENT_EXPORT()
74 std::vector<std::unique_ptr<UserMessageEvent>> heap_; in COMPONENT_EXPORT()
/external/pigweed/pw_allocator/public/pw_allocator/
Dfreelist_heap.h65 : freelist_(defaultBuckets), heap_(region, freelist_) {} in FreeListHeapBuffer()
67 void* Allocate(size_t size) { return heap_.Allocate(size); } in Allocate()
68 void Free(void* ptr) { heap_.Free(ptr); } in Free()
69 void* Realloc(void* ptr, size_t size) { return heap_.Realloc(ptr, size); } in Realloc()
70 void* Calloc(size_t num, size_t size) { return heap_.Calloc(num, size); } in Calloc()
73 return heap_.heap_stats_; in heap_stats()
76 void LogHeapStats() { heap_.LogHeapStats(); } in LogHeapStats()
80 FreeListHeap heap_; variable
/external/tensorflow/tensorflow/compiler/xla/service/
Dheap_simulator_test.cc1051 InheritedGlobalDecreasingSizeBestFitHeap heap_; member in xla::__anon72fb25430111::GlobalDecreasingSizeBestFitHeapTest
1316 EXPECT_EQ(pair(5, 10), heap_.FindChunkCandidate(buffer_a_, 5, 6, 10, 5)); in TEST_F()
1317 heap_.CommitChunk(); // offset: 5, size: 5, start: 6, end: 10 in TEST_F()
1319 EXPECT_EQ(pair(0, 10), heap_.FindChunkCandidate(buffer_b_, 10, 3, 5)); in TEST_F()
1320 heap_.CommitChunk(); // offset: 0, size: 10, start: 3, end: 5 in TEST_F()
1321 EXPECT_EQ(pair(10, 15), heap_.FindChunkCandidate(buffer_c_, 5, 2, 8)); in TEST_F()
1322 heap_.CommitChunk(); // offset: 10, size: 5, start: 2, end: 8 in TEST_F()
1323 EXPECT_EQ(pair(0, 15), heap_.FindChunkCandidate(buffer_d_, 5, 0, 2, 10)); in TEST_F()
1324 heap_.CommitChunk(); // offset: 0, size: 5, start: 0, end: 2 in TEST_F()
1326 EXPECT_EQ(pair(10, 20), heap_.FindChunkCandidate(buffer_e_, 10, 11, 13, 10)); in TEST_F()
[all …]
/external/jemalloc_new/test/unit/
Dph.c40 ph_gen(static, heap_, heap_t, node_t, link, node_cmp_magic);
/external/tensorflow/tensorflow/core/tpu/graph_rewrite/
Ddistributed_tpu_rewrite_pass.cc213 allocator_type get_allocator() const { return rep_.heap_.get_allocator(); } in get_allocator()
227 heap_(alloc) {} in Rep()
228 heap_type heap_; // NOLINT member
235 const heap_type& heap() const { return rep_.heap_; } in heap()
236 heap_type& heap() { return rep_.heap_; } in heap()
442 heap_.Push(&index_nodes_[i]); in TensorDevicePlacer()
451 heap_.Adjust(node); in ReportDeviceAssigned()
457 DeviceNode* node = heap_.top(); in RetrieveAssignment()
460 heap_.Adjust(node); in RetrieveAssignment()
486 IntrusiveHeap<DeviceNode, typename DeviceNode::Compare> heap_; member in tensorflow::__anonf0ad67bd0111::TensorDevicePlacer