a12a8a71bb
The goal is to solve confusion of the "All rights reserved" for licensing
code under an open-source license.
The phrase "All rights reserved" comes from a historical convention that
required this phrase for the copyright protection to apply. This convention
is no longer relevant.
However, even though the phrase has no meaning in establishing the copyright
it has not lost meaning in terms of licensing.
This change makes it so code under the Blender Foundation copyright does
not use "all rights reserved". This is also how the GPL license itself
states how to apply it to the source code:
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software ...
This change does not change copyright notice in cases when the copyright
is dual (BF and an author), or just an author of the code. It also does
mot change copyright which is inherited from NaN Holding BV as it needs
some further investigation about what is the proper way to handle it.
64 lines
1.5 KiB
C
64 lines
1.5 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2008 Blender Foundation */
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
* \brief A (mainly) macro array library.
|
|
*
|
|
* This is an array library, used to manage array (re)allocation.
|
|
*
|
|
* \note This is primarily accessed via macros,
|
|
* functions are used to implement some of the internals.
|
|
*
|
|
* Example usage:
|
|
*
|
|
* \code{.c}
|
|
* 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);
|
|
* \endcode
|
|
*
|
|
* 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
|
|
*/
|
|
|
|
#include <string.h>
|
|
|
|
#include "BLI_array.h"
|
|
|
|
#include "BLI_sys_types.h"
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
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)
|
|
{
|
|
void *arr = *arr_p;
|
|
void *arr_tmp;
|
|
|
|
arr_tmp = MEM_mallocN(sizeof_arr_p * ((num < arr_len) ? (arr_len * 2 + 2) : (arr_len + num)),
|
|
alloc_str);
|
|
|
|
if (arr) {
|
|
memcpy(arr_tmp, arr, sizeof_arr_p * arr_len);
|
|
|
|
if (arr != arr_static) {
|
|
MEM_freeN(arr);
|
|
}
|
|
}
|
|
|
|
*arr_p = arr_tmp;
|
|
}
|