Searched refs:chunk (Results 1 - 25 of 41) sorted by last modified time

12

/haiku/src/add-ons/media/plugins/ffmpeg/
H A DAVCodecDecoder.cpp398 TRACE("[a] decoding first audio frame chunk failed\n");
1030 /*! \brief Decodes next chunk of audio frames.
1036 FFMPEG decides how much audio frames belong to a chunk. Because of that
1052 \returns B_OK on successfully decoding one audio frame chunk.
1084 // Assume that next audio chunk can be decoded so keep decoding.
1107 2. fTempPacket was updated to exclude the data chunk that was consumed
1222 This relationship will only hold true, when each data chunk that is
1292 TRACE("[v] frame %" B_PRId64 " decoding error: error code: %d, chunk size: %ld\n",
1370 /*! \brief Loads the next chunk into fChunkBuffer and assigns it (including
1374 1. meaning: Next chunk i
1464 _CopyChunkToChunkBufferAndAddPadding(const void* chunk, size_t chunkSize) argument
[all...]
H A DAVCodecDecoder.h96 status_t _CopyChunkToChunkBufferAndAddPadding(const void* chunk,
/haiku/src/add-ons/kernel/drivers/network/wlan/idualwifi7260/dev/pci/
H A Dif_iwm.c4110 const uint8_t *chunk, uint32_t byte_cnt)
4115 /* Copy firmware chunk into pre-allocated DMA-safe memory. */
4116 memcpy(dma->vaddr, chunk, byte_cnt);
4162 printf("%s: fw chunk addr 0x%x len %d failed to load\n",
4195 printf("%s: could not load firmware chunk %u of %u\n",
4248 printf("%s: could not load firmware chunk %d "
4262 printf("%s: could not load firmware chunk %d "
11473 /* firmware chunk loaded */
11539 /* firmware chunk loaded */
4109 iwm_firmware_load_chunk(struct iwm_softc *sc, uint32_t dst_addr, const uint8_t *chunk, uint32_t byte_cnt) argument
/haiku/src/apps/haikudepot/textview/
H A DTextDocument.cpp450 BString chunk; local
451 text.CopyCharsInto(chunk, chunkStart, chunkEnd - chunkStart);
452 TextSpan span(chunk, characterStyle);
/haiku/src/system/libroot/posix/malloc_hoard2/
H A Darch-specific.cpp127 free_chunk *chunk = (free_chunk *)sFreeChunks, *smaller = NULL; local
128 for (; chunk != NULL; chunk = chunk->next) {
129 if (chunk->size < newChunk->size)
130 smaller = chunk;
163 // find chunk in free list
164 free_chunk *chunk = sFreeChunks, *last = NULL; local
165 for (; chunk != NULL; chunk
304 free_chunk *chunk = (free_chunk *)sFreeChunks, *last = NULL, *smaller = NULL; local
[all...]
/haiku/src/tests/system/kernel/
H A Dmmap_cut_tests.cpp35 uint8 chunk[128]; local
36 memcpy(chunk, &ptr1[3 * B_PAGE_SIZE], sizeof(chunk));
43 int status = memcmp(&ptr1[3 * B_PAGE_SIZE], chunk, sizeof(chunk));
/haiku/src/system/kernel/device_manager/
H A DIORequest.cpp882 while (IORequestChunk* chunk = fChildren.RemoveHead())
883 delete chunk;
/haiku/src/system/kernel/slab/
H A DMemoryManager.cpp255 out.Print("slab memory manager alloc meta chunk: %#" B_PRIxADDR,
276 out.Print("slab memory manager free meta chunk: %#" B_PRIxADDR,
287 AllocateChunk(size_t chunkSize, MetaChunk* metaChunk, Chunk* chunk) argument
292 fChunk(chunk - metaChunk->chunks)
299 out.Print("slab memory manager alloc chunk: size: %" B_PRIuSIZE
300 " -> meta chunk: %#" B_PRIxADDR ", chunk: %" B_PRIu32, fChunkSize,
314 Chunk* chunk)
320 fChunk(chunk - metaChunk->chunks)
328 ", count %" B_PRIu32 " -> meta chunk
313 AllocateChunks(size_t chunkSize, uint32 chunkCount, MetaChunk* metaChunk, Chunk* chunk) argument
342 FreeChunk(MetaChunk* metaChunk, Chunk* chunk) argument
538 Chunk* chunk; local
584 Chunk* chunk = &metaChunk->chunks[chunkIndex]; local
657 Chunk* chunk; local
734 Chunk* chunk = &metaChunk->chunks[chunkIndex]; local
884 Chunk* chunk = metaChunk->chunks + k; local
932 Chunk* chunk = &metaChunk->chunks[chunkIndex]; local
1076 Chunk* chunk = *chunkPointer; local
1166 _FreeChunk(Area* area, MetaChunk* metaChunk, Chunk* chunk, addr_t chunkAddress, bool alreadyUnmapped, uint32 flags) argument
1626 _IsChunkInFreeList(const MetaChunk* metaChunk, const Chunk* chunk) argument
1775 Chunk* chunk = metaChunk->chunks + k; local
1848 Chunk* chunk = metaChunk->chunks + i; local
[all...]
/haiku/src/kits/network/libnetservices/
H A DHttpRequest.cpp621 BStackOrHeapArray<char, 4096> chunk(kHttpBufferSize);
622 bytesRead = fSocket->Read(chunk, kHttpBufferSize);
641 fInputBuffer.AppendData(chunk, bytesRead);
725 // chunk in buffer before handling it
756 // Format of a chunk header:
757 // <chunk size in hex>[; optional data]
774 // A chunk of 0 bytes indicates the end of the chunked transfer
H A DGopherRequest.cpp276 BStackOrHeapArray<char, 4096> chunk(kGopherBufferSize);
279 bytesRead = fSocket->Read(chunk, kGopherBufferSize);
287 fInputBuffer.AppendData(chunk, bytesRead);
H A DFileRequest.cpp87 char chunk[4096]; local
89 chunkSize = file.Read(chunk, sizeof(chunk));
92 error = fOutput->WriteExactly(chunk, chunkSize, &written);
/haiku/src/add-ons/kernel/generic/locked_pool/
H A Dlocked_pool.c26 - if a new chunk of blocks is allocated;
60 size_t header_size; // effective size of chunk header
76 // header of memory chunk
108 chunk_header *chunk; local
119 (void **)&chunk, B_ANY_KERNEL_ADDRESS, chunkSize,
127 chunk->area = area;
128 chunk->num_blocks = numBlocks;
131 // very important: we first create a freelist within the chunk,
137 lastBlock = (char *)chunk + pool->header_size +
164 delete_area(chunk
247 chunk_header *chunk, *next; local
[all...]
/haiku/src/add-ons/kernel/file_systems/udf/
H A DRecognition.cpp117 MemoryChunk chunk(blockSize);
118 if (chunk.InitCheck() != B_OK) {
121 return chunk.InitCheck();
131 ssize_t bytesRead = read_pos(device, address, chunk.Data(), blockSize);
134 = (volume_structure_descriptor_header *)(chunk.Data());
189 MemoryChunk chunk(blockSize);
192 status_t anchorErr = chunk.InitCheck();
194 ssize_t bytesRead = read_pos(device, address, chunk.Data(), blockSize);
203 anchor = reinterpret_cast<anchor_volume_descriptor*>(chunk.Data());
346 MemoryChunk chunk(blockSiz
[all...]
/haiku/src/tests/kits/midi/synth_file_reader/
H A DSynthFileReader.cpp168 for (uint32 chunk = 0; chunk < chunks; chunk ++) {
/haiku/src/add-ons/kernel/drivers/network/ether/syskonnect/dev/sk/
H A Dif_sk.c1439 u_int32_t chunk, val; local
1441 chunk = sc->sk_ramsize / 2;
1444 val += (chunk / sizeof(u_int64_t));
1447 val += (chunk / sizeof(u_int64_t));
1450 u_int32_t chunk, val; local
1452 chunk = sc->sk_ramsize / 4;
1453 val = (sc->sk_rboff + (chunk * 2 * sc_if->sk_port)) /
1456 val += (chunk / sizeof(u_int64_t));
1459 val += (chunk / sizeof(u_int64_t));
/haiku/src/bin/fwcontrol/
H A Dfwcrom.c412 crom_add_quad(struct crom_chunk *chunk, uint32_t entry) argument
416 index = chunk->data.crc_len;
418 printf("too large chunk %d\n", index);
421 chunk->data.buf[index] = entry;
422 chunk->data.crc_len++;
427 crom_add_entry(struct crom_chunk *chunk, int key, int val) argument
437 return (crom_add_quad(chunk, foo.i));
464 struct crom_chunk *chunk, const char *buf)
481 tl = (struct csrtext *) &chunk->data;
491 return (crom_add_chunk(src, parent, chunk, CROM_TEXTLEA
463 crom_add_simple_text(struct crom_src *src, struct crom_chunk *parent, struct crom_chunk *chunk, const char *buf) argument
509 struct crom_chunk *chunk, *parent; local
[all...]
/haiku/src/system/boot/loader/
H A Dheap.cpp33 big chunk, the only entry in the free link list (which is a single
35 When memory is allocated, the smallest free chunk that contains
40 free chunk available. When a chunk is freed, it will be joint
42 To ease list handling, the list anchor itself is a free chunk with
118 FreeChunkKey(const FreeChunk* chunk) argument
120 fSize(chunk->Size()),
121 fChunk(chunk)
125 int Compare(const FreeChunk* chunk) const
127 size_t chunkSize = chunk
320 FreeChunk* chunk = (FreeChunk*)((addr_t)AllocatedAddress() + splitSize); local
335 IsTouching(FreeChunk* chunk) argument
351 Join(FreeChunk* chunk) argument
415 FreeChunk* chunk = (FreeChunk*)base; local
435 FreeChunk* chunk = sFreeChunkTree.FindMin(); local
472 FreeChunk* chunk = sFreeChunkTree.FindClosest(FreeChunkKey(size), true, local
583 FreeChunk* chunk = sFreeChunkTree.FindMin(); local
596 FreeChunk* chunk = sFreeChunkTree.FindMin(); local
[all...]
/haiku/src/system/runtime_loader/
H A Dheap.cpp27 big chunk, the only entry in the free link list (which is a single
29 When memory is allocated, the smallest free chunk that contains
34 free chunk available. When a chunk is freed, it will be joint
36 To ease list handling, the list anchor itself is a free chunk with
112 FreeChunkKey(const FreeChunk* chunk) argument
114 fSize(chunk->Size()),
115 fChunk(chunk)
119 int Compare(const FreeChunk* chunk) const
121 size_t chunkSize = chunk
202 FreeChunk* chunk = (FreeChunk*)((addr_t)AllocatedAddress() + splitSize); local
217 IsTouching(FreeChunk* chunk) argument
233 Join(FreeChunk* chunk) argument
314 FreeChunk* chunk = sFreeChunkTree.FindMin(); local
345 FreeChunk* chunk = sFreeChunkTree.FindClosest(key, true, true); local
431 FreeChunk* chunk = sFreeChunkTree.FindMin(); local
[all...]
/haiku/src/kits/network/libnetapi/
H A DNetEndpoint.cpp528 BNetBuffer chunk(length);
529 ssize_t bytesReceived = Receive(chunk.Data(), length, flags);
531 buffer.AppendData(chunk.Data(), bytesReceived);
564 BNetBuffer chunk(length);
565 ssize_t bytesReceived = ReceiveFrom(chunk.Data(), length, address, flags);
567 buffer.AppendData(chunk.Data(), bytesReceived);
/haiku/src/kits/media/
H A DMediaExtractor.cpp25 // should be 0, to disable the chunk cache set it to 1
157 // and chunk caches
317 // Retrieve next chunk - read it directly, if the cache is drained
318 chunk_buffer* chunk = info.chunkCache->NextChunk(fReader, info.cookie);
320 if (chunk == NULL)
323 info.lastChunk = chunk;
325 *_chunkBuffer = chunk->buffer;
326 *_chunkSize = chunk->size;
327 *mediaHeader = chunk->header;
329 return chunk
[all...]
/haiku/src/servers/app/
H A DClientMemoryAllocator.cpp56 struct chunk* chunk = fChunks.RemoveHead(); local
57 if (chunk == NULL)
60 delete_area(chunk->area);
61 free(chunk);
88 // another chunk, or resize an existing chunk
95 // We need to split the chunk into two parts: the one to keep
114 usedBlock->chunk = best->chunk;
178 struct chunk* chunk = freeBlock->chunk; local
238 struct chunk* chunk; local
[all...]
H A DClientMemoryAllocator.h19 struct chunk;
22 struct chunk : DoublyLinkedListLinkImpl<struct chunk> { struct in inherits:DoublyLinkedListLinkImpl
29 struct chunk* chunk; member in struct:block
35 typedef DoublyLinkedList<chunk> chunk_list;
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DVolume.cpp163 btrfs_chunk* chunk = (btrfs_chunk*)(key + 1); local
164 fChunk = new(std::nothrow) Chunk(chunk, key->Offset());
378 // (extent tree, chunk tree, fs tree, etc.)
484 btrfs_chunk* chunk; local
487 (void**)&chunk);
491 Chunk _chunk(chunk, search_key.Offset());
492 free(chunk);
H A DChunk.h19 Chunk(btrfs_chunk* chunk,
/haiku/src/add-ons/kernel/bus_managers/firewire/
H A Dfwohci.cpp1588 struct fw_bulkxfer *first, *chunk, *prev; local
1612 while ((chunk = STAILQ_FIRST(&it->stvalid)) != NULL) {
1615 // fwdma_sync_multiseg(it->buf, chunk->poffset, it->bnpacket,
1617 fwohci_txbufdb(sc, dmach, chunk);
1627 (chunk->start))->bus_addr | dbch->ndesc;
1634 STAILQ_INSERT_TAIL(&it->stdma, chunk, link);
1635 prev = chunk;
1709 struct fw_bulkxfer *first, *prev, *chunk; local
1733 device_printf(fc->dev, "IR DMA no free chunk\n");
1742 while ((chunk
2175 struct fw_bulkxfer *chunk; local
2222 struct fw_bulkxfer *chunk; local
[all...]

Completed in 264 milliseconds

12