Lines Matching refs:header
41 header contains the size of the previous and the next block. These sizes
124 struct block_header header;
143 free_block->header.size = 0;
168 struct block_header *header;
186 header = AS_BLOCK_HEADER(free_block, chunk_size);
187 header->prev_size = chunk_size;
188 AS_BLOCK_HEADER(header, size)->prev_size = size;
192 header = (struct block_header*)free_block;
196 header->size = size;
198 return MEM_START(header);
204 header = (struct block_header*)alloc_chunk(chunk_size);
205 PTR_FAIL_IF(!header);
210 header->prev_size = 0;
214 header->size = size;
217 free_block = AS_FREE_BLOCK(header, size);
218 free_block->header.prev_size = size;
225 header->size = chunk_size;
226 next_header = AS_BLOCK_HEADER(header, chunk_size);
231 return MEM_START(header);
236 struct block_header *header;
240 header = AS_BLOCK_HEADER(ptr, -(sljit_w)sizeof(struct block_header));
241 allocated_size -= header->size;
245 /* If header->prev_size == 0, free_block will equal to header.
246 In this case, free_block->header.size will be > 0. */
247 free_block = AS_FREE_BLOCK(header, -(sljit_w)header->prev_size);
248 if (SLJIT_UNLIKELY(!free_block->header.size)) {
249 free_block->size += header->size;
250 header = AS_BLOCK_HEADER(free_block, free_block->size);
251 header->prev_size = free_block->size;
254 free_block = (struct free_block*)header;
255 sljit_insert_free_block(free_block, header->size);
258 header = AS_BLOCK_HEADER(free_block, free_block->size);
259 if (SLJIT_UNLIKELY(!header->size)) {
260 free_block->size += ((struct free_block*)header)->size;
261 sljit_remove_free_block((struct free_block*)header);
262 header = AS_BLOCK_HEADER(free_block, free_block->size);
263 header->prev_size = free_block->size;
267 if (SLJIT_UNLIKELY(!free_block->header.prev_size && header->size == 1)) {