Searched refs:buffers (Results 1 - 8 of 8) sorted by relevance

/fuchsia/zircon/kernel/object/
H A Dbuffer_chain_tests.cpp24 ASSERT_FALSE(bc->buffers()->is_empty(), "");
25 ASSERT_EQ(bc->buffers()->size_slow(), 1u, "");
30 ASSERT_FALSE(bc->buffers()->is_empty(), "");
31 ASSERT_EQ(bc->buffers()->size_slow(), 1u, "");
37 ASSERT_FALSE(bc->buffers()->is_empty(), "");
38 ASSERT_EQ(bc->buffers()->size_slow(), 1u, "");
44 ASSERT_FALSE(bc->buffers()->is_empty(), "");
45 ASSERT_EQ(bc->buffers()->size_slow(), 2u, "");
51 ASSERT_FALSE(bc->buffers()->is_empty(), "");
52 ASSERT_EQ(bc->buffers()
[all...]
H A Dmessage_packet.cpp18 // To reduce heap fragmentation, MessagePackets are stored in a lists of fixed size buffers
19 // (BufferChains) rather than a contiguous blocks of memory. These lists and buffers are allocated
54 // MessagePackets lives *inside* a list of buffers. The first buffer holds the MessagePacket
60 DEBUG_ASSERT(!chain->buffers()->is_empty());
62 char* const data = chain->buffers()->front().data();
/fuchsia/zircon/kernel/object/include/object/
H A Dbuffer_chain.h22 // BufferChain is a list of fixed-size buffers allocated from the PMM.
84 // Creates a BufferChain with enough buffers to store |size| bytes.
110 // We now have a list of buffers and a list of pages. Construct a chain inside the first
111 // buffer and give the buffers and pages to the chain.
118 // Frees |chain| and its buffers.
120 // Remove the buffers and vm_page_t's from the chain *before* destorying it.
121 BufferChain::BufferList buffers(fbl::move(*chain->buffers()));
127 while (!buffers.is_empty()) {
128 BufferChain::Buffer* buf = buffers
[all...]
H A Dmessage_packet.h62 void* payload_start = buffer_chain_->buffers()->front().data() + payload_offset_;
68 void* payload_start = buffer_chain_->buffers()->front().data() + payload_offset_;
/fuchsia/zircon/system/utest/fs/
H A Dtest-persist.cpp112 fbl::unique_ptr<uint8_t[]> buffers[fbl::count_of(files)]; local
117 buffers[i].reset(new (&ac) uint8_t[BufferSize]);
121 buffers[i][j] = (uint8_t) rand_r(&seed);
125 ASSERT_EQ(write(fd, &buffers[i][0], BufferSize), BufferSize);
146 ASSERT_EQ(rbuf[j], buffers[i][j]);
/fuchsia/zircon/system/ulib/fzl/
H A Dvmo-pool.cpp24 fbl::Array<ListableBuffer> buffers(new (&ac) ListableBuffer[num_vmos], num_vmos);
28 buffers_ = fbl::move(buffers);
58 if (free_buffers_.is_empty()) { // No available buffers!
/fuchsia/zircon/system/dev/misc/cpu-trace/
H A Dintel-pm.c136 // # of entries in |buffers|.
147 io_buffer_t* buffers; member in struct:ipm_per_trace_state
164 // maximum space, in bytes, for trace buffers (per cpu)
216 // Note: This may be called with partially allocated buffers.
217 assert(per_trace->buffers);
220 io_buffer_release(&per_trace->buffers[i]);
221 free(per_trace->buffers);
222 per_trace->buffers = NULL;
347 per_trace->buffers = calloc(num_cpus, sizeof(per_trace->buffers[
[all...]
/fuchsia/zircon/system/uapp/gfxlatency/
H A Dmain.cpp932 fbl::Array<buffer_t> buffers(buffer_storage,
934 for (auto& buffer : buffers) {
1004 TRACE_ASYNC_BEGIN("app", "Buffer Scheduled", (uintptr_t)&buffers[0],
1005 "image", buffers[0].image_id);
1011 if ((status = set_layer_image(layer_id, buffers[0].image_id, INVALID_ID)) !=
1041 // Present initial buffers.
1193 auto& buffer = buffers[buffer_frame % buffers.size()];
1200 buffers[(buffer_frame - 1) % buffers
[all...]

Completed in 93 milliseconds