archive/blender-archive
Archived
1
1
Fork 0
Code Pull Requests Packages Activity
This repository has been archived on 2023-10-09. You can view files and clone it, but cannot push or open issues or pull requests.
Files
dda0de4a3d09e8aed93718491f7dfb9366e8efd5
blender-archive/source/blender/blenlib/BLI_memblock.h

61 lines
1.8 KiB
C++
Raw Normal View History

BLI_memblock: New memory allocator This is really close to BLI_mempool but uses an array to keep track of the chunks of memory. There is no tagging necessary to clear the whole structure so reuse is fast. Naturally supports iteration but does not support freeing.
2019-05-07 17:52:57 +02:00
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* The Original Code is Copyright (C) 2008 Blender Foundation.
* All rights reserved.
*/
#ifndef __BLI_MEMBLOCK_H__
#define __BLI_MEMBLOCK_H__
/** \file
* \ingroup bli
*/
#ifdef __cplusplus
extern "C" {
#endif
#include "BLI_compiler_attrs.h"
struct BLI_memblock;
typedef struct BLI_memblock BLI_memblock;
BLI_memblock: Add more options - Use int instead of uint for safety and less conversions. - Add free callback - Add cleared alloc option
2019-05-13 15:57:03 +02:00
typedef void (*MemblockValFreeFP)(void *val);
BLI_memblock: New memory allocator This is really close to BLI_mempool but uses an array to keep track of the chunks of memory. There is no tagging necessary to clear the whole structure so reuse is fast. Naturally supports iteration but does not support freeing.
2019-05-07 17:52:57 +02:00
BLI_memblock: Refactor for faster iteration and allocation Remove the clear allocation flag as it has little impact since there should be very few allocation per redraw. Make BLI_memblock_alloc and BLI_memblock_iterstep much more cache efficient removing them almost entirely from performance profiles.
2019-05-21 00:54:03 +02:00
BLI_memblock *BLI_memblock_create(uint elem_size) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
BLI_memblock: New memory allocator This is really close to BLI_mempool but uses an array to keep track of the chunks of memory. There is no tagging necessary to clear the whole structure so reuse is fast. Naturally supports iteration but does not support freeing.
2019-05-07 17:52:57 +02:00
void *BLI_memblock_alloc(BLI_memblock *mblk) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1);
BLI_memblock: Add more options - Use int instead of uint for safety and less conversions. - Add free callback - Add cleared alloc option
2019-05-13 15:57:03 +02:00
void BLI_memblock_clear(BLI_memblock *mblk, MemblockValFreeFP valfreefp) ATTR_NONNULL(1);
void BLI_memblock_destroy(BLI_memblock *mblk, MemblockValFreeFP free_callback) ATTR_NONNULL(1);
BLI_memblock: New memory allocator This is really close to BLI_mempool but uses an array to keep track of the chunks of memory. There is no tagging necessary to clear the whole structure so reuse is fast. Naturally supports iteration but does not support freeing.
2019-05-07 17:52:57 +02:00
typedef struct BLI_memblock_iter {
BLI_memblock: Refactor for faster iteration and allocation Remove the clear allocation flag as it has little impact since there should be very few allocation per redraw. Make BLI_memblock_alloc and BLI_memblock_iterstep much more cache efficient removing them almost entirely from performance profiles.
2019-05-21 00:54:03 +02:00
void **chunk_list;
int cur_index;
int end_index;
int chunk_max_ofs;
int chunk_idx;
int elem_size;
int elem_ofs;
BLI_memblock: New memory allocator This is really close to BLI_mempool but uses an array to keep track of the chunks of memory. There is no tagging necessary to clear the whole structure so reuse is fast. Naturally supports iteration but does not support freeing.
2019-05-07 17:52:57 +02:00
} BLI_memblock_iter;
void BLI_memblock_iternew(BLI_memblock *pool, BLI_memblock_iter *iter) ATTR_NONNULL();
void *BLI_memblock_iterstep(BLI_memblock_iter *iter) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL();
#ifdef __cplusplus
}
#endif
#endif /* __BLI_MEMBLOCK_H__ */
Copy Permalink