| 
									
										
										
										
											2013-01-19 07:35:55 +00: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, | 
					
						
							| 
									
										
										
										
											2013-09-12 03:02:50 +00:00
										 |  |  |  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * | 
					
						
							|  |  |  |  * The Original Code is Copyright (C) 2008 Blender Foundation. | 
					
						
							|  |  |  |  * All rights reserved. | 
					
						
							|  |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2019-02-18 08:08:12 +11:00
										 |  |  | /** \file
 | 
					
						
							|  |  |  |  * \ingroup bli | 
					
						
							|  |  |  |  * \brief A (mainly) macro array library. | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * | 
					
						
							| 
									
										
										
										
											2015-08-05 00:21:50 +10:00
										 |  |  |  * This is an array library, used to manage array (re)allocation. | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * | 
					
						
							| 
									
										
										
										
											2015-08-05 00:21:50 +10:00
										 |  |  |  * \note This is primarily accessed via macros, | 
					
						
							|  |  |  |  * functions are used to implement some of the internals. | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * | 
					
						
							| 
									
										
										
										
											2015-08-05 00:21:50 +10:00
										 |  |  |  * Example usage: | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * | 
					
						
							| 
									
										
										
										
											2015-02-14 07:28:15 +11:00
										 |  |  |  * \code{.c} | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * int *arr = NULL; | 
					
						
							|  |  |  |  * BLI_array_declare(arr); | 
					
						
							|  |  |  |  * int i; | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * for (i = 0; i < 10; i++) { | 
					
						
							|  |  |  |  *     BLI_array_grow_one(arr); | 
					
						
							|  |  |  |  *     arr[i] = something; | 
					
						
							|  |  |  |  * } | 
					
						
							|  |  |  |  * BLI_array_free(arr); | 
					
						
							| 
									
										
										
										
											2015-02-14 07:28:15 +11:00
										 |  |  |  * \endcode | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  * | 
					
						
							| 
									
										
										
										
											2015-08-05 00:21:50 +10:00
										 |  |  |  * Arrays are over allocated, so each reallocation the array size is doubled. | 
					
						
							|  |  |  |  * In situations where contiguous array access isn't needed, | 
					
						
							|  |  |  |  * other solutions for allocation are available. | 
					
						
							|  |  |  |  * Consider using on of: BLI_memarena.c, BLI_mempool.c, BLi_stack.c | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #include <string.h>
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #include "BLI_array.h"
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2013-08-13 23:43:44 +00:00
										 |  |  | #include "BLI_sys_types.h"
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | #include "MEM_guardedalloc.h"
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /**
 | 
					
						
							|  |  |  |  * This function is only to be called via macros. | 
					
						
							|  |  |  |  * | 
					
						
							| 
									
										
										
										
											2018-03-15 01:42:44 +11:00
										 |  |  |  * \note The caller must adjust \a arr_len | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  |  */ | 
					
						
							| 
									
										
										
										
											2019-04-17 06:17:24 +02:00
										 |  |  | void _bli_array_grow_func(void **arr_p, | 
					
						
							|  |  |  |                           const void *arr_static, | 
					
						
							|  |  |  |                           const int sizeof_arr_p, | 
					
						
							|  |  |  |                           const int arr_len, | 
					
						
							|  |  |  |                           const int num, | 
					
						
							|  |  |  |                           const char *alloc_str) | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | { | 
					
						
							| 
									
										
										
										
											2019-04-17 06:17:24 +02:00
										 |  |  |   void *arr = *arr_p; | 
					
						
							|  |  |  |   void *arr_tmp; | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2019-04-17 06:17:24 +02:00
										 |  |  |   arr_tmp = MEM_mallocN(sizeof_arr_p * ((num < arr_len) ? (arr_len * 2 + 2) : (arr_len + num)), | 
					
						
							|  |  |  |                         alloc_str); | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2019-04-17 06:17:24 +02:00
										 |  |  |   if (arr) { | 
					
						
							|  |  |  |     memcpy(arr_tmp, arr, sizeof_arr_p * arr_len); | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2019-04-17 06:17:24 +02:00
										 |  |  |     if (arr != arr_static) { | 
					
						
							|  |  |  |       MEM_freeN(arr); | 
					
						
							|  |  |  |     } | 
					
						
							|  |  |  |   } | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2019-04-17 06:17:24 +02:00
										 |  |  |   *arr_p = arr_tmp; | 
					
						
							| 
									
										
										
										
											2013-01-19 07:35:55 +00:00
										 |  |  | } |