/haiku/docs/develop/kits/storage/resources/ |
H A D | ResourcesFormat.tex | 46 In either case the format of the chunk of data that frames the resources
|
/haiku/headers/os/support/ |
H A D | Url.h | 108 static BString _DoUrlEncodeChunk(const BString& chunk, 110 static BString _DoUrlDecodeChunk(const BString& chunk,
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Chunk.cpp | 23 Chunk::Chunk(btrfs_chunk* chunk, fsblock_t offset) argument 30 + chunk->StripeCount() * sizeof(btrfs_stripe)); 36 memcpy(fChunk, chunk, sizeof(btrfs_chunk) 37 + chunk->StripeCount() * sizeof(btrfs_stripe)); 39 TRACE("chunk[0] length %" B_PRIu64 " owner %" B_PRIu64 " stripe_length %" 41 "sector_size %" B_PRIu32 "\n", chunk->Length(), chunk->Owner(), 42 chunk->StripeLength(), chunk->Type(), chunk [all...] |
H A D | Chunk.h | 19 Chunk(btrfs_chunk* chunk,
|
H A D | Volume.cpp | 163 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);
|
/haiku/src/add-ons/kernel/file_systems/udf/ |
H A D | Volume.cpp | 253 MemoryChunk chunk(logicalVolumeDescriptor.file_set_address().length()); 255 status = chunk.InitCheck(); 266 = read_pos(device, address, chunk.Data(), blockSize); 277 reinterpret_cast<file_set_descriptor*>(chunk.Data());
|
H A D | Recognition.cpp | 117 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/apps/cortex/Persistence/Wrappers/ |
H A D | FlatMessageIO.cpp | 129 ssize_t chunk = 0; local 132 chunk = strlen(pos); 134 chunk = nextBreak - pos; 137 context.writeString(pos, chunk); 140 pos += chunk;
|
/haiku/src/build/libshared/ |
H A D | NaturalCompare.cpp | 39 FetchNaturalChunk(natural_chunk& chunk, const char* source) argument 41 if (chunk.type == natural_chunk::ASCII) { 42 // string chunk 48 strlcpy(chunk.buffer, source, pos + 1); 49 chunk.length = pos; 60 // Number chunk (stop at next white space) 66 strlcpy(chunk.buffer, source, pos + 1); 67 chunk.length = pos; 117 // Different chunk types, just compare the remaining strings 144 // The chunks were equal, proceed with the next chunk [all...] |
/haiku/src/kits/media/ |
H A D | ChunkCache.cpp | 20 BLocker("media chunk cache"), 23 rtm_create_pool(&fRealTimePool, maxBytes, "media chunk cache"); 77 chunk_buffer* chunk = NULL; local 85 chunk = fChunkCache.front(); 91 return chunk; 95 /* Moves the specified chunk to the unused list. 96 This means the chunk data can be overwritten again. 99 ChunkCache::RecycleChunk(chunk_buffer* chunk) argument 103 rtm_free(chunk->buffer); 104 chunk 117 chunk_buffer* chunk = NULL; local [all...] |
H A D | ChunkCache.h | 46 void RecycleChunk(chunk_buffer* chunk);
|
H A D | RealtimeAlloc.cpp | 91 in this chunk. 108 FreeChunk* chunk local 110 chunk->fSize = fSize - splitSize - FreeChunk::NextOffset(); 111 chunk->fNext = fNext; 115 return chunk; 119 /*! Checks if the specified chunk touches this chunk, so 123 FreeChunk::IsTouching(FreeChunk* chunk) argument 125 return chunk 126 && (((uint8*)this + fSize == (uint8*)chunk) 139 Join(FreeChunk* chunk) argument 160 FreeChunk* chunk = pool->free_anchor.fNext; local 179 FreeChunk* chunk = pool->free_anchor.fNext; local 225 FreeChunk* chunk = free_anchor.Next(); local 306 FreeChunk* chunk = (FreeChunk*)pool->heap_base; local 359 FreeChunk* chunk = pool->free_anchor.Next(); local [all...] |
/haiku/src/kits/support/ |
H A D | Url.cpp | 1304 BUrl::_DoUrlEncodeChunk(const BString& chunk, bool strict, bool directory) argument 1308 for (int32 i = 0; i < chunk.Length(); i++) { 1309 if (_IsUnreserved(chunk[i]) 1310 || (directory && (chunk[i] == '/' || chunk[i] == '\\'))) { 1311 result << chunk[i]; local 1313 if (chunk[i] == ' ' && !strict) { 1318 snprintf(hexString, 5, "%X", chunk[i]); 1330 BUrl::_DoUrlDecodeChunk(const BString& chunk, bool strict) argument 1334 for (int32 i = 0; i < chunk 1354 result << chunk[i]; local [all...] |
/haiku/src/libs/compat/freebsd_network/ |
H A D | fbsd_uipc_mbuf.c | 640 int chunk = min(nsize - n->m_len, m->m_len - moff); local 642 bcopy(m->m_data + moff, n->m_data + n->m_len, chunk); 643 moff += chunk; 644 n->m_len += chunk; 645 remain -= chunk;
|
/haiku/src/servers/launch/ |
H A D | BaseJob.cpp | 237 const char* chunk = buffer; local 239 const char* separator = strchr(chunk, '\n'); 241 line.Append(chunk, bytesRead); 244 line.Append(chunk, separator - chunk); 245 chunk = separator + 1;
|
/haiku/src/system/kernel/slab/ |
H A D | MemoryManager.h | 159 Chunk* chunk, addr_t chunkAddress, 189 const Chunk* chunk); 191 const Chunk* chunk); 193 const Chunk* chunk); 284 MemoryManager::_ChunkAddress(const MetaChunk* metaChunk, const Chunk* chunk) argument 287 + (chunk - metaChunk->chunks) * metaChunk->chunkSize; 292 MemoryManager::_IsChunkFree(const MetaChunk* metaChunk, const Chunk* chunk) argument 294 return chunk->next == NULL 295 || (chunk->next >= metaChunk->chunks 296 && chunk [all...] |
/haiku/src/system/libroot/posix/glibc/extensions/ |
H A D | obstack.c | 148 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default). 169 register struct _obstack_chunk *chunk; /* points to new chunk */ local 201 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size); 202 if (!chunk) 204 h->next_free = h->object_base = chunk->contents; 205 h->chunk_limit = chunk->limit 206 = (char *) chunk + h->chunk_size; 207 chunk 228 register struct _obstack_chunk *chunk; /* points to new chunk */ local [all...] |
H A D | obstack.h | 64 The way we do this is to take a large chunk, allocating memory from 65 low addresses. When you want to build a symbol in the chunk you just 66 add chars above the current "high water mark" in the chunk. When you 69 Mostly the chars will not burst over the highest address of the chunk, 70 because you would typically expect a chunk to be (say) 100 times as 80 When the chars burst over a chunk boundary, we allocate a larger 81 chunk, and then copy the partly formed object from the end of the old 82 chunk to the beginning of the new larger chunk. We then carry on 91 We carve out one object at a time from the current chunk 167 struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ member in struct:obstack [all...] |
/haiku/src/add-ons/kernel/bus_managers/firewire/ |
H A D | fwohci.cpp | 1588 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...] |
/haiku/src/add-ons/kernel/drivers/network/ether/syskonnect/dev/sk/ |
H A D | if_sk.c | 1439 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/add-ons/kernel/drivers/network/wlan/idualwifi7260/dev/pci/ |
H A D | if_iwm.c | 4110 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/add-ons/kernel/generic/locked_pool/ |
H A D | locked_pool.c | 26 - 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/media/plugins/ffmpeg/ |
H A D | AVCodecDecoder.cpp | 398 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 D | AVCodecDecoder.h | 96 status_t _CopyChunkToChunkBufferAndAddPadding(const void* chunk,
|
/haiku/src/apps/haikudepot/textview/ |
H A D | TextDocument.cpp | 450 BString chunk; local 451 text.CopyCharsInto(chunk, chunkStart, chunkEnd - chunkStart); 452 TextSpan span(chunk, characterStyle);
|