Searched refs:chunk (Results 1 - 25 of 68) sorted by relevance

123

/haiku-fatelf/src/system/boot/loader/
H A Dheap.cpp29 big chunk, the only entry in the free link list (which is a single
31 When memory is allocated, the smallest free chunk that contains
36 free chunk available. When a chunk is freed, it will be joint
38 To ease list handling, the list anchor itself is a free chunk with
88 in this chunk.
105 FreeChunk* chunk local
107 chunk->fSize = fSize - splitSize - FreeChunk::NextOffset();
108 chunk->fNext = fNext;
112 return chunk;
120 IsTouching(FreeChunk* chunk) argument
136 Join(FreeChunk* chunk) argument
157 FreeChunk* chunk = sFreeAnchor.fNext; local
176 FreeChunk* chunk = sFreeAnchor.fNext; local
232 FreeChunk* chunk = (FreeChunk*)base; local
261 FreeChunk* chunk = sFreeAnchor.Next(); local
295 FreeChunk* chunk = sFreeAnchor.Next(); local
387 FreeChunk* chunk = sFreeAnchor.Next(); local
401 FreeChunk* chunk = sFreeAnchor.Next(); local
[all...]
/haiku-fatelf/src/kits/media/
H A DChunkCache.cpp20 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 DRealtimeAlloc.cpp91 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-fatelf/src/system/runtime_loader/
H A Dheap.cpp23 * big chunk, the only entry in the free link list (which is a single
25 * When memory is allocated, the smallest free chunk that contains
30 * free chunk available. When a chunk is freed, it will be joint
32 * To ease list handling, the list anchor itself is a free chunk with
58 * in this chunk.
75 free_chunk *chunk = (free_chunk *)((uint8 *)this + sizeof(size_t) + splitSize); local
76 chunk->size = size - splitSize - sizeof(size_t);
77 chunk->next = next;
81 return chunk;
90 IsTouching(free_chunk *chunk) argument
107 Join(free_chunk *chunk) argument
128 free_chunk *chunk = sFreeAnchor.next; local
149 free_chunk *chunk = sFreeAnchor.next, *last = &sFreeAnchor; local
191 free_chunk *chunk = (free_chunk *)base; local
228 free_chunk *chunk = sFreeAnchor.next, *last = &sFreeAnchor; local
284 free_chunk *chunk = sFreeAnchor.next, *last = &sFreeAnchor; local
333 free_chunk *chunk = sFreeAnchor.next, *last = &sFreeAnchor; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/btrfs/
H A DChunk.cpp25 Chunk::Chunk(struct btrfs_chunk* chunk, fsblock_t offset) argument
32 + chunk->StripeCount() * sizeof(struct btrfs_stripe));
35 memcpy(fChunk, chunk, sizeof(struct btrfs_chunk)
36 + chunk->StripeCount() * sizeof(struct btrfs_stripe));
38 TRACE("chunk[0] length %llu owner %llu stripe_length %llu type %llu "
39 "stripe_count %u sub_stripes %u sector_size %lu\n", chunk->Length(),
40 chunk->Owner(), chunk->StripeLength(), chunk->Type(),
41 chunk
[all...]
H A DChunk.h17 Chunk(struct btrfs_chunk* chunk,
/haiku-fatelf/src/system/libroot/posix/malloc/
H A Darch-specific.cpp138 free_chunk *chunk = (free_chunk *)sFreeChunks, *smaller = NULL; local
139 for (; chunk != NULL; chunk = chunk->next) {
140 if (chunk->size < newChunk->size)
141 smaller = chunk;
169 // find chunk in free list
170 free_chunk *chunk = sFreeChunks, *last = NULL; local
171 for (; chunk != NULL; chunk
310 free_chunk *chunk = (free_chunk *)sFreeChunks, *last = NULL, *smaller = NULL; local
[all...]
/haiku-fatelf/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);
84 // another chunk, or resize an existing chunk
91 // We need to split the chunk into two parts: the one to keep
110 usedBlock->chunk = best->chunk;
174 struct chunk* chunk = freeBlock->chunk; local
222 struct chunk* chunk; local
[all...]
H A DClientMemoryAllocator.h18 struct chunk;
21 struct chunk : DoublyLinkedListLinkImpl<struct chunk> { struct in inherits:DoublyLinkedListLinkImpl
28 struct chunk* chunk; member in struct:block
34 typedef DoublyLinkedList<chunk> chunk_list;
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dobjalloc.c58 /* This structure appears at the start of each chunk. */
62 /* Next chunk. */
64 /* If this chunk contains large objects, this is the value of
65 current_ptr when this chunk was allocated. If this chunk
76 /* We ask for this much memory each time we create a chunk which is to
91 struct objalloc_chunk *chunk; local
104 chunk = (struct objalloc_chunk *) ret->chunks;
105 chunk->next = NULL;
106 chunk
138 struct objalloc_chunk *chunk; local
154 struct objalloc_chunk *chunk; local
[all...]
H A Dobstack.c142 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
164 register struct _obstack_chunk *chunk; /* points to new chunk */
196 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
197 if (!chunk)
199 h->next_free = h->object_base = chunk->contents;
200 h->chunk_limit = chunk->limit
201 = (char *) chunk + h->chunk_size;
202 chunk
163 register struct _obstack_chunk *chunk; /* points to new chunk */ local
222 register struct _obstack_chunk *chunk; /* points to new chunk */ local
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dobstack.c135 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
149 register struct _obstack_chunk *chunk; /* points to new chunk */
176 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
177 if (!chunk)
179 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
181 h->chunk_limit = chunk->limit
182 = (char *) chunk
148 register struct _obstack_chunk *chunk; /* points to new chunk */ local
195 register struct _obstack_chunk *chunk; /* points to new chunk */ local
[all...]
H A Dobstack.h62 The way we do this is to take a large chunk, allocating memory from
63 low addresses. When you want to build a symbol in the chunk you just
64 add chars above the current "high water mark" in the chunk. When you
67 Mostly the chars will not burst over the highest address of the chunk,
68 because you would typically expect a chunk to be (say) 100 times as
78 When the chars burst over a chunk boundary, we allocate a larger
79 chunk, and then copy the partly formed object from the end of the old
80 chunk to the beginning of the new larger chunk. We then carry on
89 We carve out one object at a time from the current chunk
152 struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ member in struct:obstack
[all...]
/haiku-fatelf/src/kits/shared/
H A DNaturalCompare.cpp38 FetchNaturalChunk(natural_chunk& chunk, const char* source) argument
40 if (chunk.type == natural_chunk::ASCII) {
41 // string chunk
47 strlcpy(chunk.buffer, source, pos + 1);
48 chunk.length = pos;
59 // Number chunk (stop at next white space)
65 strlcpy(chunk.buffer, source, pos + 1);
66 chunk.length = pos;
116 // Different chunk types, just compare the remaining strings
143 // The chunks were equal, proceed with the next chunk
[all...]
/haiku-fatelf/src/system/libroot/posix/glibc/extensions/
H A Dobstack.c148 /* 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...]
/haiku-fatelf/src/apps/cortex/Persistence/Wrappers/
H A DFlatMessageIO.cpp129 ssize_t chunk = 0; local
132 chunk = strlen(pos);
134 chunk = nextBreak - pos;
137 context.writeString(pos, chunk);
140 pos += chunk;
/haiku-fatelf/src/libs/ncurses/ncurses/base/
H A Dvsscanf.c213 ChunkType chunk, ctest;
224 * information to decide where to start scanning the next chunk.
230 /* find a chunk */
232 chunk = cUnknown;
262 chunk = cRange;
271 chunk = ctest;
276 chunk = cError;
287 if (chunk == cUnknown
288 || chunk == cError) {
295 if (chunk !
[all...]
/haiku-fatelf/src/system/kernel/slab/
H A DMemoryManager.h159 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...]
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
729 Chunk* chunk = &metaChunk->chunks[chunkIndex]; local
879 Chunk* chunk = metaChunk->chunks + k; local
927 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-fatelf/src/add-ons/media/plugins/aiff_reader/
H A Daiff_reader.cpp110 chunk_struct chunk; local
111 if (sizeof(chunk) != Source()->ReadAt(pos, &chunk, sizeof(chunk))) {
112 TRACE("aiffReader::Sniff: chunk header reading failed\n");
115 pos += sizeof(chunk);
116 if (UINT32(chunk.chunk_size) == 0) {
117 TRACE("aiffReader::Sniff: Error: chunk of size 0 found\n");
120 switch (UINT32(chunk.chunk_id)) {
125 uint32 size = UINT32(chunk
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/udf/
H A DRecognition.cpp116 MemoryChunk chunk(blockSize);
117 if (chunk.InitCheck() != B_OK) {
130 ssize_t bytesRead = read_pos(device, address, chunk.Data(), blockSize);
133 = (volume_structure_descriptor_header *)(chunk.Data());
188 MemoryChunk chunk(blockSize);
191 status_t anchorErr = chunk.InitCheck();
193 ssize_t bytesRead = read_pos(device, address, chunk.Data(), blockSize);
201 anchor = reinterpret_cast<anchor_volume_descriptor*>(chunk.Data());
261 MemoryChunk chunk(blockSize);
266 status_t loopError = chunk
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/
H A DRecognition.cpp112 MemoryChunk chunk(blockSize);
113 status_t error = chunk.InitCheck();
123 ssize_t bytesRead = read_pos(device, address, chunk.Data(), blockSize);
127 reinterpret_cast<volume_structure_descriptor_header*>(chunk.Data());
190 MemoryChunk chunk(blockSize);
193 status_t anchorErr = chunk.InitCheck();
195 ssize_t bytesRead = read_pos(device, address, chunk.Data(), blockSize);
203 anchor = reinterpret_cast<anchor_volume_descriptor*>(chunk.Data());
263 MemoryChunk chunk(blockSize);
268 status_t loopError = chunk
[all...]
/haiku-fatelf/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-fatelf/src/tools/docbook/libxml2/
H A DDOCBparser.c101 * @chunk: an char array
102 * @size: the size in byte of the chunk
103 * @terminate: last chunk indicator
111 const char *chunk ATTRIBUTE_UNUSED,
123 return (xmlParseChunk(ctxt, chunk, size, terminate));
130 * @chunk: a pointer to an array of chars
145 const char *chunk ATTRIBUTE_UNUSED,
158 return(xmlCreatePushParserCtxt(sax, user_data, chunk, size, filename));
/haiku-fatelf/src/bin/fwcontrol/
H A Dfwcrom.c411 crom_add_quad(struct crom_chunk *chunk, uint32_t entry) argument
415 index = chunk->data.crc_len;
417 printf("too large chunk %d\n", index);
420 chunk->data.buf[index] = entry;
421 chunk->data.crc_len++;
426 crom_add_entry(struct crom_chunk *chunk, int key, int val) argument
436 return (crom_add_quad(chunk, foo.i));
463 struct crom_chunk *chunk, const char *buf)
480 tl = (struct csrtext *) &chunk->data;
490 return (crom_add_chunk(src, parent, chunk, CROM_TEXTLEA
462 crom_add_simple_text(struct crom_src *src, struct crom_chunk *parent, struct crom_chunk *chunk, const char *buf) argument
508 struct crom_chunk *chunk, *parent; local
[all...]

Completed in 251 milliseconds

123