0N/A/*
2362N/A * Copyright (c) 2004, Oracle and/or its affiliates. All rights reserved.
0N/A *
0N/A * Redistribution and use in source and binary forms, with or without
0N/A * modification, are permitted provided that the following conditions
0N/A * are met:
0N/A *
0N/A * - Redistributions of source code must retain the above copyright
0N/A * notice, this list of conditions and the following disclaimer.
0N/A *
0N/A * - Redistributions in binary form must reproduce the above copyright
0N/A * notice, this list of conditions and the following disclaimer in the
0N/A * documentation and/or other materials provided with the distribution.
0N/A *
2362N/A * - Neither the name of Oracle nor the names of its
0N/A * contributors may be used to endorse or promote products derived
0N/A * from this software without specific prior written permission.
0N/A *
0N/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
0N/A * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
0N/A * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
0N/A * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
0N/A * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
0N/A * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
0N/A * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
0N/A * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
0N/A * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
0N/A * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
0N/A * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
0N/A */
0N/A
4378N/A/*
4378N/A * This source code is provided to illustrate the usage of a given feature
4378N/A * or technique and has been deliberately simplified. Additional steps
4378N/A * required for a production-quality application, such as security checks,
4378N/A * input validation and proper error handling, might not be present in
4378N/A * this sample code.
4378N/A */
4378N/A
4378N/A
0N/A/* Allocations from large blocks, no individual free's */
0N/A
0N/A#include "hprof.h"
0N/A
0N/A/*
0N/A * This file contains some allocation code that allows you
0N/A * to have space allocated via larger blocks of space.
0N/A * The only free allowed is of all the blocks and all the elements.
0N/A * Elements can be of different alignments and fixed or variable sized.
0N/A * The space allocated never moves.
0N/A *
0N/A */
0N/A
0N/A/* Get the real size allocated based on alignment and bytes needed */
0N/Astatic int
0N/Areal_size(int alignment, int nbytes)
0N/A{
0N/A if ( alignment > 1 ) {
0N/A int wasted;
0N/A
0N/A wasted = alignment - ( nbytes % alignment );
0N/A if ( wasted != alignment ) {
0N/A nbytes += wasted;
0N/A }
0N/A }
0N/A return nbytes;
0N/A}
0N/A
0N/A/* Add a new current_block to the Blocks* chain, adjust size if nbytes big. */
0N/Astatic void
0N/Aadd_block(Blocks *blocks, int nbytes)
0N/A{
0N/A int header_size;
0N/A int block_size;
0N/A BlockHeader *block_header;
0N/A
0N/A HPROF_ASSERT(blocks!=NULL);
0N/A HPROF_ASSERT(nbytes>0);
0N/A
0N/A header_size = real_size(blocks->alignment, sizeof(BlockHeader));
0N/A block_size = blocks->elem_size*blocks->population;
0N/A if ( nbytes > block_size ) {
0N/A block_size = real_size(blocks->alignment, nbytes);
0N/A }
0N/A block_header = (BlockHeader*)HPROF_MALLOC(block_size+header_size);
0N/A block_header->next = NULL;
0N/A block_header->bytes_left = block_size;
0N/A block_header->next_pos = header_size;
0N/A
0N/A /* Link in new block */
0N/A if ( blocks->current_block != NULL ) {
0N/A blocks->current_block->next = block_header;
0N/A }
0N/A blocks->current_block = block_header;
0N/A if ( blocks->first_block == NULL ) {
0N/A blocks->first_block = block_header;
0N/A }
0N/A}
0N/A
0N/A/* Initialize a new Blocks */
0N/ABlocks *
0N/Ablocks_init(int alignment, int elem_size, int population)
0N/A{
0N/A Blocks *blocks;
0N/A
0N/A HPROF_ASSERT(alignment>0);
0N/A HPROF_ASSERT(elem_size>0);
0N/A HPROF_ASSERT(population>0);
0N/A
0N/A blocks = (Blocks*)HPROF_MALLOC(sizeof(Blocks));
0N/A blocks->alignment = alignment;
0N/A blocks->elem_size = elem_size;
0N/A blocks->population = population;
0N/A blocks->first_block = NULL;
0N/A blocks->current_block = NULL;
0N/A return blocks;
0N/A}
0N/A
0N/A/* Allocate bytes from a Blocks area. */
0N/Avoid *
0N/Ablocks_alloc(Blocks *blocks, int nbytes)
0N/A{
0N/A BlockHeader *block;
0N/A int pos;
0N/A void *ptr;
0N/A
0N/A HPROF_ASSERT(blocks!=NULL);
0N/A HPROF_ASSERT(nbytes>=0);
0N/A if ( nbytes == 0 ) {
0N/A return NULL;
0N/A }
0N/A
0N/A block = blocks->current_block;
0N/A nbytes = real_size(blocks->alignment, nbytes);
0N/A if ( block == NULL || block->bytes_left < nbytes ) {
0N/A add_block(blocks, nbytes);
0N/A block = blocks->current_block;
0N/A }
0N/A pos = block->next_pos;
0N/A ptr = (void*)(((char*)block)+pos);
0N/A block->next_pos += nbytes;
0N/A block->bytes_left -= nbytes;
0N/A return ptr;
0N/A}
0N/A
0N/A/* Terminate the Blocks */
0N/Avoid
0N/Ablocks_term(Blocks *blocks)
0N/A{
0N/A BlockHeader *block;
0N/A
0N/A HPROF_ASSERT(blocks!=NULL);
0N/A
0N/A block = blocks->first_block;
0N/A while ( block != NULL ) {
0N/A BlockHeader *next_block;
0N/A
0N/A next_block = block->next;
0N/A HPROF_FREE(block);
0N/A block = next_block;
0N/A }
0N/A HPROF_FREE(blocks);
0N/A}