griefith/test2
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity
Files
c04088fed1b8faea6b2928bb5e09ab367076950c
test2/source/blender/makesdna/intern/dna_genfile.c
Sybren A. Stüvel c04088fed1 Cleanup: Clang-Tidy else-after-return fixes 
This addresses warnings from Clang-Tidy's `readability-else-after-return`
rule. This should be the final commit of the series of commits that
addresses this particular rule.

No functional changes.
2020-08-07 13:38:07 +02:00

1773 lines
50 KiB
C
Raw Blame History

/*
* 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) 2001-2002 by NaN Holding BV.
* All rights reserved.
* DNA handling
*/
/** \file
* \ingroup DNA
*
* Lowest-level functions for decoding the parts of a saved .blend
* file, including interpretation of its SDNA block and conversion of
* contents of other parts according to the differences between that
* SDNA and the SDNA of the current (running) version of Blender.
*/
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "MEM_guardedalloc.h" // for MEM_freeN MEM_mallocN MEM_callocN
#include "BLI_endian_switch.h"
#include "BLI_memarena.h"
#include "BLI_string.h"
#include "BLI_utildefines.h"
#include "BLI_ghash.h"
#include "DNA_genfile.h"
#include "DNA_sdna_types.h" // for SDNA ;-)
/**
* \section dna_genfile Overview
*
* - please note: no builtin security to detect input of double structs
* - if you want a struct not to be in DNA file: add two hash marks above it `(#<enter>#<enter>)`.
*
* Structure DNA data is added to each blender file and to each executable, this to detect
* in .blend files new variables in structs, changed array sizes, etc. It's also used for
* converting endian and pointer size (32-64 bits)
* As an extra, Python uses a call to detect run-time the contents of a blender struct.
*
* Create a structDNA: only needed when one of the input include (.h) files change.
* File Syntax:
* \code{.unparsed}
* SDNA (4 bytes) (magic number)
* NAME (4 bytes)
* <nr> (4 bytes) amount of names (int)
* <string>
* <string>
* ...
* ...
* TYPE (4 bytes)
* <nr> amount of types (int)
* <string>
* <string>
* ...
* ...
* TLEN (4 bytes)
* <len> (short) the lengths of types
* <len>
* ...
* ...
* STRC (4 bytes)
* <nr> amount of structs (int)
* <typenr><nr_of_elems> <typenr><namenr> <typenr><namenr> ...
* \endcode
*
* **Remember to read/write integer and short aligned!**
*
* While writing a file, the names of a struct is indicated with a type number,
* to be found with: ``type = DNA_struct_find_nr(SDNA *, const char *)``
* The value of ``type`` corresponds with the index within the structs array
*
* For the moment: the complete DNA file is included in a .blend file. For
* the future we can think of smarter methods, like only included the used
* structs. Only needed to keep a file short though...
*
* ALLOWED AND TESTED CHANGES IN STRUCTS:
* - Type change (a char to float will be divided by 255).
* - Location within a struct (everything can be randomly mixed up).
* - Struct within struct (within struct etc), this is recursive.
* - Adding new elements, will be default initialized zero.
* - Removing elements.
* - Change of array sizes.
* - Change of a pointer type: when the name doesn't change the contents is copied.
*
* NOT YET:
* - array (``vec[3]``) to float struct (``vec3f``).
*
* DONE:
* - Endian compatibility.
* - Pointer conversion (32-64 bits).
*
* IMPORTANT:
* - Do not use #defines in structs for array lengths, this cannot be read by the dna functions.
* - Do not use uint, but unsigned int instead, ushort and ulong are allowed.
* - Only use a long in Blender if you want this to be the size of a pointer. so it is
* 32 bits or 64 bits, dependent at the cpu architecture.
* - Chars are always unsigned
* - Alignment of variables has to be done in such a way, that any system does
* not create 'padding' (gaps) in structures. So make sure that:
* - short: 2 aligned.
* - int: 4 aligned.
* - float: 4 aligned.
* - double: 8 aligned.
* - long: 8 aligned.
* - int64: 8 aligned.
* - struct: 8 aligned.
* - the sdna functions have several error prints builtin,
* always check blender running from a console.
*/
#ifdef __BIG_ENDIAN__
/* Big Endian */
# define MAKE_ID(a, b, c, d) ((int)(a) << 24 | (int)(b) << 16 | (c) << 8 | (d))
#else
/* Little Endian */
# define MAKE_ID(a, b, c, d) ((int)(d) << 24 | (int)(c) << 16 | (b) << 8 | (a))
#endif
/* ************************* DIV ********************** */
void DNA_sdna_free(SDNA *sdna)
{
if (sdna->data_alloc) {
MEM_freeN((void *)sdna->data);
}
MEM_freeN((void *)sdna->names);
MEM_freeN((void *)sdna->names_array_len);
MEM_freeN((void *)sdna->types);
MEM_freeN(sdna->structs);
#ifdef WITH_DNA_GHASH
if (sdna->structs_map) {
BLI_ghash_free(sdna->structs_map, NULL, NULL);
}
#endif
if (sdna->mem_arena) {
BLI_memarena_free(sdna->mem_arena);
}
MEM_SAFE_FREE(sdna->alias.names);
MEM_SAFE_FREE(sdna->alias.types);
#ifdef WITH_DNA_GHASH
if (sdna->alias.structs_map) {
BLI_ghash_free(sdna->alias.structs_map, NULL, NULL);
}
#endif
MEM_freeN(sdna);
}
/**
* Return true if the name indicates a pointer of some kind.
*/
static bool ispointer(const char *name)
{
/* check if pointer or function pointer */
return (name[0] == '*' || (name[0] == '(' && name[1] == '*'));
}
/**
* Returns the size of struct fields of the specified type and name.
*
* \param type: Index into sdna->types/types_size
* \param name: Index into sdna->names,
* needed to extract possible pointer/array information.
*/
int DNA_elem_size_nr(const SDNA *sdna, short type, short name)
{
int len;
const char *cp = sdna->names[name];
len = 0;
/* is it a pointer or function pointer? */
if (ispointer(cp)) {
/* has the name an extra length? (array) */
len = sdna->pointer_size * sdna->names_array_len[name];
}
else if (sdna->types_size[type]) {
/* has the name an extra length? (array) */
len = (int)sdna->types_size[type] * sdna->names_array_len[name];
}
return len;
}
#if 0
static void printstruct(SDNA *sdna, short strnr)
{
/* is for debug */
int b, nr;
short *sp;
sp = sdna->structs[strnr];
printf("struct %s\n", sdna->types[sp[0]]);
nr = sp[1];
sp += 2;
for (b = 0; b < nr; b++, sp += 2) {
printf(" %s %s\n", sdna->types[sp[0]], sdna->names[sp[1]]);
}
}
#endif
/**
* Returns the index of the struct info for the struct with the specified name.
*/
static int dna_struct_find_nr_ex_impl(
/* From SDNA struct. */
const char **types,
const int UNUSED(types_len),
short **const structs,
const int structs_len,
#ifdef WITH_DNA_GHASH
GHash *structs_map,
#endif
/* Regular args. */
const char *str,
unsigned int *index_last)
{
if (*index_last < structs_len) {
const short *sp = structs[*index_last];
if (STREQ(types[sp[0]], str)) {
return *index_last;
}
}
#ifdef WITH_DNA_GHASH
{
void **index_p = BLI_ghash_lookup_p(structs_map, str);
if (index_p) {
const int index = POINTER_AS_INT(*index_p);
*index_last = index;
return index;
}
}
#else
{
for (int index = 0; index < structs_len; index++) {
const short *sp = structs[index];
if (STREQ(types[sp[0]], str)) {
*index_last = index;
return index;
}
}
}
#endif
return -1;
}
/**
* Returns the index of the struct info for the struct with the specified name.
*/
int DNA_struct_find_nr_ex(const SDNA *sdna, const char *str, unsigned int *index_last)
{
return dna_struct_find_nr_ex_impl(
/* Expand SDNA. */
sdna->types,
sdna->types_len,
sdna->structs,
sdna->structs_len,
#ifdef WITH_DNA_GHASH
sdna->structs_map,
#endif
/* Regular args. */
str,
index_last);
}
/** \note requires #DNA_sdna_alias_data_ensure_structs_map to be called. */
int DNA_struct_alias_find_nr_ex(const SDNA *sdna, const char *str, unsigned int *index_last)
{
#ifdef WITH_DNA_GHASH
BLI_assert(sdna->alias.structs_map != NULL);
#endif
return dna_struct_find_nr_ex_impl(
/* Expand SDNA. */
sdna->alias.types,
sdna->types_len,
sdna->structs,
sdna->structs_len,
#ifdef WITH_DNA_GHASH
sdna->alias.structs_map,
#endif
/* Regular args. */
str,
index_last);
}
int DNA_struct_find_nr(const SDNA *sdna, const char *str)
{
unsigned int index_last_dummy = UINT_MAX;
return DNA_struct_find_nr_ex(sdna, str, &index_last_dummy);
}
/** \note requires #DNA_sdna_alias_data_ensure_structs_map to be called. */
int DNA_struct_alias_find_nr(const SDNA *sdna, const char *str)
{
unsigned int index_last_dummy = UINT_MAX;
return DNA_struct_alias_find_nr_ex(sdna, str, &index_last_dummy);
}
/* ************************* END DIV ********************** */
/* ************************* READ DNA ********************** */
BLI_INLINE const char *pad_up_4(const char *ptr)
{
return (const char *)((((uintptr_t)ptr) + 3) & ~3);
}
/**
* In sdna->data the data, now we convert that to something understandable
*/
static bool init_structDNA(SDNA *sdna, bool do_endian_swap, const char **r_error_message)
{
int *data, gravity_fix = -1;
short *sp;
data = (int *)sdna->data;
/* Clear pointers in case of error. */
sdna->names = NULL;
sdna->types = NULL;
sdna->structs = NULL;
#ifdef WITH_DNA_GHASH
sdna->structs_map = NULL;
#endif
sdna->mem_arena = NULL;
/* Lazy initialize. */
memset(&sdna->alias, 0, sizeof(sdna->alias));
/* Struct DNA ('SDNA') */
if (*data != MAKE_ID('S', 'D', 'N', 'A')) {
*r_error_message = "SDNA error in SDNA file";
return false;
}
const char *cp;
data++;
/* Names array ('NAME') */
if (*data == MAKE_ID('N', 'A', 'M', 'E')) {
data++;
sdna->names_len = *data;
if (do_endian_swap) {
BLI_endian_switch_int32(&sdna->names_len);
}
sdna->names_len_alloc = sdna->names_len;
data++;
sdna->names = MEM_callocN(sizeof(void *) * sdna->names_len, "sdnanames");
}
else {
*r_error_message = "NAME error in SDNA file";
return false;
}
cp = (char *)data;
for (int nr = 0; nr < sdna->names_len; nr++) {
sdna->names[nr] = cp;
/* "float gravity [3]" was parsed wrong giving both "gravity" and
* "[3]" members. we rename "[3]", and later set the type of
* "gravity" to "void" so the offsets work out correct */
if (*cp == '[' && strcmp(cp, "[3]") == 0) {
if (nr && strcmp(sdna->names[nr - 1], "Cvi") == 0) {
sdna->names[nr] = "gravity[3]";
gravity_fix = nr;
}
}
while (*cp) {
cp++;
}
cp++;
}
cp = pad_up_4(cp);
/* Type names array ('TYPE') */
data = (int *)cp;
if (*data == MAKE_ID('T', 'Y', 'P', 'E')) {
data++;
sdna->types_len = *data;
if (do_endian_swap) {
BLI_endian_switch_int32(&sdna->types_len);
}
data++;
sdna->types = MEM_callocN(sizeof(void *) * sdna->types_len, "sdnatypes");
}
else {
*r_error_message = "TYPE error in SDNA file";
return false;
}
cp = (char *)data;
for (int nr = 0; nr < sdna->types_len; nr++) {
/* WARNING! See: DNA_struct_rename_legacy_hack_static_from_alias docs. */
sdna->types[nr] = DNA_struct_rename_legacy_hack_static_from_alias(cp);
while (*cp) {
cp++;
}
cp++;
}
cp = pad_up_4(cp);
/* Type lengths array ('TLEN') */
data = (int *)cp;
if (*data == MAKE_ID('T', 'L', 'E', 'N')) {
data++;
sp = (short *)data;
sdna->types_size = sp;
if (do_endian_swap) {
BLI_endian_switch_int16_array(sp, sdna->types_len);
}
sp += sdna->types_len;
}
else {
*r_error_message = "TLEN error in SDNA file";
return false;
}
/* prevent BUS error */
if (sdna->types_len & 1) {
sp++;
}
/* Struct array ('STRC') */
data = (int *)sp;
if (*data == MAKE_ID('S', 'T', 'R', 'C')) {
data++;
sdna->structs_len = *data;
if (do_endian_swap) {
BLI_endian_switch_int32(&sdna->structs_len);
}
data++;
sdna->structs = MEM_callocN(sizeof(void *) * sdna->structs_len, "sdnastrcs");
}
else {
*r_error_message = "STRC error in SDNA file";
return false;
}
sp = (short *)data;
for (int nr = 0; nr < sdna->structs_len; nr++) {
sdna->structs[nr] = sp;
if (do_endian_swap) {
short a;
BLI_endian_switch_int16(&sp[0]);
BLI_endian_switch_int16(&sp[1]);
a = sp[1];
sp += 2;
while (a--) {
BLI_endian_switch_int16(&sp[0]);
BLI_endian_switch_int16(&sp[1]);
sp += 2;
}
}
else {
sp += 2 * sp[1] + 2;
}
}
{
/* second part of gravity problem, setting "gravity" type to void */
if (gravity_fix > -1) {
for (int nr = 0; nr < sdna->structs_len; nr++) {
sp = sdna->structs[nr];
if (strcmp(sdna->types[sp[0]], "ClothSimSettings") == 0) {
sp[10] = SDNA_TYPE_VOID;
}
}
}
}
#ifdef WITH_DNA_GHASH
{
/* create a ghash lookup to speed up */
sdna->structs_map = BLI_ghash_str_new_ex("init_structDNA gh", sdna->structs_len);
for (intptr_t nr = 0; nr < sdna->structs_len; nr++) {
sp = sdna->structs[nr];
BLI_ghash_insert(sdna->structs_map, (void *)sdna->types[sp[0]], POINTER_FROM_INT(nr));
}
}
#endif
/* Calculate 'sdna->pointer_size' */
{
const int nr = DNA_struct_find_nr(sdna, "ListBase");
/* should never happen, only with corrupt file for example */
if (UNLIKELY(nr == -1)) {
*r_error_message = "ListBase struct error! Not found.";
return false;
}
/* finally pointer_size: use struct ListBase to test it, never change the size of it! */
sp = sdna->structs[nr];
/* weird; i have no memory of that... I think I used sizeof(void *) before... (ton) */
sdna->pointer_size = sdna->types_size[sp[0]] / 2;
if (sp[1] != 2 || (sdna->pointer_size != 4 && sdna->pointer_size != 8)) {
*r_error_message = "ListBase struct error! Needs it to calculate pointerize.";
/* well, at least sizeof(ListBase) is error proof! (ton) */
return false;
}
}
/* Cache name size. */
{
short *names_array_len = MEM_mallocN(sizeof(*names_array_len) * sdna->names_len, __func__);
for (int i = 0; i < sdna->names_len; i++) {
names_array_len[i] = DNA_elem_array_size(sdna->names[i]);
}
sdna->names_array_len = names_array_len;
}
return true;
}
/**
* Constructs and returns a decoded SDNA structure from the given encoded SDNA data block.
*/
SDNA *DNA_sdna_from_data(const void *data,
const int data_len,
bool do_endian_swap,
bool data_alloc,
const char **r_error_message)
{
SDNA *sdna = MEM_mallocN(sizeof(*sdna), "sdna");
const char *error_message = NULL;
sdna->data_len = data_len;
if (data_alloc) {
char *data_copy = MEM_mallocN(data_len, "sdna_data");
memcpy(data_copy, data, data_len);
sdna->data = data_copy;
}
else {
sdna->data = data;
}
sdna->data_alloc = data_alloc;
if (init_structDNA(sdna, do_endian_swap, &error_message)) {
return sdna;
}
if (r_error_message == NULL) {
fprintf(stderr, "Error decoding blend file SDNA: %s\n", error_message);
}
else {
*r_error_message = error_message;
}
DNA_sdna_free(sdna);
return NULL;
}
/**
* Using a global is acceptable here,
* the data is read-only and only changes between Blender versions.
*
* So it is safe to create once and reuse.
*/
static SDNA *g_sdna = NULL;
void DNA_sdna_current_init(void)
{
g_sdna = DNA_sdna_from_data(DNAstr, DNAlen, false, false, NULL);
}
const struct SDNA *DNA_sdna_current_get(void)
{
BLI_assert(g_sdna != NULL);
return g_sdna;
}
void DNA_sdna_current_free(void)
{
DNA_sdna_free(g_sdna);
g_sdna = NULL;
}
/* ******************** END READ DNA ********************** */
/* ******************* HANDLE DNA ***************** */
/**
* Used by #DNA_struct_get_compareflags (below) to recursively mark all structs
* containing a field of type structnr as changed between old and current SDNAs.
*/
static void recurs_test_compflags(const SDNA *sdna, char *compflags, int structnr)
{
int a, b, typenr, elems;
const short *sp;
const char *cp;
/* check all structs, test if it's inside another struct */
sp = sdna->structs[structnr];
typenr = sp[0];
for (a = 0; a < sdna->structs_len; a++) {
if ((a != structnr) && (compflags[a] == SDNA_CMP_EQUAL)) {
sp = sdna->structs[a];
elems = sp[1];
sp += 2;
for (b = 0; b < elems; b++, sp += 2) {
if (sp[0] == typenr) {
cp = sdna->names[sp[1]];
if (!ispointer(cp)) {
compflags[a] = SDNA_CMP_NOT_EQUAL;
recurs_test_compflags(sdna, compflags, a);
}
}
}
}
}
}
/**
* Constructs and returns an array of byte flags with one element for each struct in oldsdna,
* indicating how it compares to newsdna:
*/
const char *DNA_struct_get_compareflags(const SDNA *oldsdna, const SDNA *newsdna)
{
int a, b;
const short *sp_old, *sp_new;
const char *str1, *str2;
char *compflags;
if (oldsdna->structs_len == 0) {
printf("error: file without SDNA\n");
return NULL;
}
compflags = MEM_callocN(oldsdna->structs_len, "compflags");
/* we check all structs in 'oldsdna' and compare them with
* the structs in 'newsdna'
*/
unsigned int newsdna_index_last = 0;
for (a = 0; a < oldsdna->structs_len; a++) {
sp_old = oldsdna->structs[a];
/* search for type in cur */
int sp_new_index = DNA_struct_find_nr_ex(
newsdna, oldsdna->types[sp_old[0]], &newsdna_index_last);
/* The next indices will almost always match */
newsdna_index_last++;
if (sp_new_index != -1) {
sp_new = newsdna->structs[sp_new_index];
/* initial assumption */
compflags[a] = SDNA_CMP_NOT_EQUAL;
/* compare length and amount of elems */
if (sp_new[1] == sp_old[1]) {
if (newsdna->types_size[sp_new[0]] == oldsdna->types_size[sp_old[0]]) {
/* same length, same amount of elems, now per type and name */
b = sp_old[1];
sp_old += 2;
sp_new += 2;
while (b > 0) {
str1 = newsdna->types[sp_new[0]];
str2 = oldsdna->types[sp_old[0]];
if (strcmp(str1, str2) != 0) {
break;
}
str1 = newsdna->names[sp_new[1]];
str2 = oldsdna->names[sp_old[1]];
if (strcmp(str1, str2) != 0) {
break;
}
/* same type and same name, now pointersize */
if (ispointer(str1)) {
if (oldsdna->pointer_size != newsdna->pointer_size) {
break;
}
}
b--;
sp_old += 2;
sp_new += 2;
}
if (b == 0) {
/* no differences found */
compflags[a] = SDNA_CMP_EQUAL;
}
}
}
}
}
/* first struct in util.h is struct Link, this is skipped in compflags (als # 0).
* was a bug, and this way dirty patched! Solve this later....
*/
compflags[0] = SDNA_CMP_EQUAL;
/* Because structs can be inside structs, we recursively
* set flags when a struct is altered
*/
for (a = 0; a < oldsdna->structs_len; a++) {
if (compflags[a] == SDNA_CMP_NOT_EQUAL) {
recurs_test_compflags(oldsdna, compflags, a);
}
}
#if 0
for (a = 0; a < oldsdna->structs_len; a++) {
if (compflags[a] == SDNA_CMP_NOT_EQUAL) {
spold = oldsdna->structs[a];
printf("changed: %s\n", oldsdna->types[spold[0]]);
}
}
#endif
return compflags;
}
/**
* Converts the name of a primitive type to its enumeration code.
*/
static eSDNA_Type sdna_type_nr(const char *dna_type)
{
if (STR_ELEM(dna_type, "char", "const char")) {
return SDNA_TYPE_CHAR;
}
if (STR_ELEM(dna_type, "uchar", "unsigned char")) {
return SDNA_TYPE_UCHAR;
}
if (STR_ELEM(dna_type, "short")) {
return SDNA_TYPE_SHORT;
}
if (STR_ELEM(dna_type, "ushort", "unsigned short")) {
return SDNA_TYPE_USHORT;
}
if (STR_ELEM(dna_type, "int")) {
return SDNA_TYPE_INT;
}
if (STR_ELEM(dna_type, "float")) {
return SDNA_TYPE_FLOAT;
}
if (STR_ELEM(dna_type, "double")) {
return SDNA_TYPE_DOUBLE;
}
if (STR_ELEM(dna_type, "int64_t")) {
return SDNA_TYPE_INT64;
}
if (STR_ELEM(dna_type, "uint64_t")) {
return SDNA_TYPE_UINT64;
}
/* invalid! */
return -1;
}
/**
* Converts a value of one primitive type to another.
* Note there is no optimization for the case where otype and ctype are the same:
* assumption is that caller will handle this case.
*
* \param ctype: Name of type to convert to
* \param otype: Name of type to convert from
* \param name_array_len: Result of #DNA_elem_array_size for this element.
* \param curdata: Where to put converted data
* \param olddata: Data of type otype to convert
*/
static void cast_elem(
const char *ctype, const char *otype, int name_array_len, char *curdata, const char *olddata)
{
double val = 0.0;
int curlen = 1, oldlen = 1;
eSDNA_Type ctypenr, otypenr;
if ((otypenr = sdna_type_nr(otype)) == -1 || (ctypenr = sdna_type_nr(ctype)) == -1) {
return;
}
/* define lengths */
oldlen = DNA_elem_type_size(otypenr);
curlen = DNA_elem_type_size(ctypenr);
while (name_array_len > 0) {
switch (otypenr) {
case SDNA_TYPE_CHAR:
val = *olddata;
break;
case SDNA_TYPE_UCHAR:
val = *((unsigned char *)olddata);
break;
case SDNA_TYPE_SHORT:
val = *((short *)olddata);
break;
case SDNA_TYPE_USHORT:
val = *((unsigned short *)olddata);
break;
case SDNA_TYPE_INT:
val = *((int *)olddata);
break;
case SDNA_TYPE_FLOAT:
val = *((float *)olddata);
break;
case SDNA_TYPE_DOUBLE:
val = *((double *)olddata);
break;
case SDNA_TYPE_INT64:
val = *((int64_t *)olddata);
break;
case SDNA_TYPE_UINT64:
val = *((uint64_t *)olddata);
break;
}
switch (ctypenr) {
case SDNA_TYPE_CHAR:
*curdata = val;
break;
case SDNA_TYPE_UCHAR:
*((unsigned char *)curdata) = val;
break;
case SDNA_TYPE_SHORT:
*((short *)curdata) = val;
break;
case SDNA_TYPE_USHORT:
*((unsigned short *)curdata) = val;
break;
case SDNA_TYPE_INT:
*((int *)curdata) = val;
break;
case SDNA_TYPE_FLOAT:
if (otypenr < 2) {
val /= 255;
}
*((float *)curdata) = val;
break;
case SDNA_TYPE_DOUBLE:
if (otypenr < 2) {
val /= 255;
}
*((double *)curdata) = val;
break;
case SDNA_TYPE_INT64:
*((int64_t *)curdata) = val;
break;
case SDNA_TYPE_UINT64:
*((uint64_t *)curdata) = val;
break;
}
olddata += oldlen;
curdata += curlen;
name_array_len--;
}
}
/**
* Converts pointer values between different sizes. These are only used
* as lookup keys to identify data blocks in the saved .blend file, not
* as actual in-memory pointers.
*
* \param curlen: Pointer length to convert to
* \param oldlen: Length of pointers in olddata
* \param name_array_len: Result of #DNA_elem_array_size for this element.
* \param curdata: Where to put converted data
* \param olddata: Data to convert
*/
static void cast_pointer(
int curlen, int oldlen, int name_array_len, char *curdata, const char *olddata)
{
int64_t lval;
while (name_array_len > 0) {
if (curlen == oldlen) {
memcpy(curdata, olddata, curlen);
}
else if (curlen == 4 && oldlen == 8) {
lval = *((int64_t *)olddata);
/* WARNING: 32-bit Blender trying to load file saved by 64-bit Blender,
* pointers may lose uniqueness on truncation! (Hopefully this wont
* happen unless/until we ever get to multi-gigabyte .blend files...) */
*((int *)curdata) = lval >> 3;
}
else if (curlen == 8 && oldlen == 4) {
*((int64_t *)curdata) = *((int *)olddata);
}
else {
/* for debug */
printf("errpr: illegal pointersize!\n");
}
olddata += oldlen;
curdata += curlen;
name_array_len--;
}
}
/**
* Equality test on name and oname excluding any array-size suffix.
*/
static int elem_strcmp(const char *name, const char *oname)
{
int a = 0;
while (1) {
if (name[a] != oname[a]) {
return 1;
}
if (name[a] == '[' || oname[a] == '[') {
break;
}
if (name[a] == 0 || oname[a] == 0) {
break;
}
a++;
}
return 0;
}
/**
* Returns whether the specified field exists according to the struct format
* pointed to by old.
*
* \param type: Current field type name.
* \param name: Current field name.
* \param old: Pointer to struct information in sdna.
* \return true when existing, false otherwise..
*/
static bool elem_exists_impl(
/* Expand SDNA. */
const char **types,
const char **names,
/* Regular args. */
const char *type,
const char *name,
const short *old)
{
int a, elemcount;
const char *otype, *oname;
/* in old is the old struct */
elemcount = old[1];
old += 2;
for (a = 0; a < elemcount; a++, old += 2) {
otype = types[old[0]];
oname = names[old[1]];
if (elem_strcmp(name, oname) == 0) { /* name equal */
return strcmp(type, otype) == 0; /* type equal */
}
}
return false;
}
/**
* \param sdna: Old SDNA.
*/
static bool elem_exists(const SDNA *sdna, const char *type, const char *name, const short *old)
{
return elem_exists_impl(
/* Expand SDNA. */
sdna->types,
sdna->names,
/* Regular args. */
type,
name,
old);
}
static bool elem_exists_alias(const SDNA *sdna,
const char *type,
const char *name,
const short *old)
{
return elem_exists_impl(
/* Expand SDNA. */
sdna->alias.types,
sdna->alias.names,
/* Regular args. */
type,
name,
old);
}
/**
* Returns the address of the data for the specified field within olddata
* according to the struct format pointed to by old, or NULL if no such
* field can be found.
*
* Passing olddata=NULL doesn't work reliably for existence checks; it will
* return NULL both when the field is found at offset 0 and when it is not
* found at all. For field existence checks, use #elem_exists() instead.
*
* \param sdna: Old SDNA
* \param type: Current field type name
* \param name: Current field name
* \param old: Pointer to struct information in sdna
* \param olddata: Struct data
* \param sppo: Optional place to return pointer to field info in sdna
* \return Data address.
*/
static const char *find_elem(const SDNA *sdna,
const char *type,
const char *name,
const short *old,
const char *olddata,
const short **sppo)
{
int a, elemcount, len;
const char *otype, *oname;
/* without arraypart, so names can differ: return old namenr and type */
/* in old is the old struct */
elemcount = old[1];
old += 2;
for (a = 0; a < elemcount; a++, old += 2) {
otype = sdna->types[old[0]];
oname = sdna->names[old[1]];
len = DNA_elem_size_nr(sdna, old[0], old[1]);
if (elem_strcmp(name, oname) == 0) { /* name equal */
if (strcmp(type, otype) == 0) { /* type equal */
if (sppo) {
*sppo = old;
}
return olddata;
}
return NULL;
}
olddata += len;
}
return NULL;
}
/**
* Converts the contents of a single field of a struct, of a non-struct type,
* from \a oldsdna to \a newsdna format.
*
* \param newsdna: SDNA of current Blender
* \param oldsdna: SDNA of Blender that saved file
* \param type: current field type name
* \param new_name_nr: current field name number.
* \param curdata: put field data converted to newsdna here
* \param old: pointer to struct info in oldsdna
* \param olddata: struct contents laid out according to oldsdna
*/
static void reconstruct_elem(const SDNA *newsdna,
const SDNA *oldsdna,
const char *type,
const int new_name_nr,
char *curdata,
const short *old,
const char *olddata)
{
/* rules: test for NAME:
* - name equal:
* - cast type
* - name partially equal (array differs)
* - type equal: memcpy
* - type cast (per element).
* (nzc 2-4-2001 I want the 'unsigned' bit to be parsed as well. Where
* can I force this?)
*/
int a, elemcount, len, countpos, mul;
const char *otype, *oname, *cp;
/* is 'name' an array? */
const char *name = newsdna->names[new_name_nr];
cp = name;
countpos = 0;
while (*cp && *cp != '[') {
cp++;
countpos++;
}
if (*cp != '[') {
countpos = 0;
}
/* in old is the old struct */
elemcount = old[1];
old += 2;
for (a = 0; a < elemcount; a++, old += 2) {
const int old_name_nr = old[1];
otype = oldsdna->types[old[0]];
oname = oldsdna->names[old[1]];
len = DNA_elem_size_nr(oldsdna, old[0], old[1]);
if (strcmp(name, oname) == 0) { /* name equal */
if (ispointer(name)) { /* pointer of functionpointer afhandelen */
cast_pointer(newsdna->pointer_size,
oldsdna->pointer_size,
newsdna->names_array_len[new_name_nr],
curdata,
olddata);
}
else if (strcmp(type, otype) == 0) { /* type equal */
memcpy(curdata, olddata, len);
}
else {
cast_elem(type, otype, newsdna->names_array_len[new_name_nr], curdata, olddata);
}
return;
}
if (countpos != 0) { /* name is an array */
if (oname[countpos] == '[' && strncmp(name, oname, countpos) == 0) { /* basis equal */
const int new_name_array_len = newsdna->names_array_len[new_name_nr];
const int old_name_array_len = oldsdna->names_array_len[old_name_nr];
const int min_name_array_len = MIN2(new_name_array_len, old_name_array_len);
if (ispointer(name)) { /* handle pointer or functionpointer */
cast_pointer(
newsdna->pointer_size, oldsdna->pointer_size, min_name_array_len, curdata, olddata);
}
else if (strcmp(type, otype) == 0) { /* type equal */
/* size of single old array element */
mul = len / old_name_array_len;
/* smaller of sizes of old and new arrays */
mul *= min_name_array_len;
memcpy(curdata, olddata, mul);
if (old_name_array_len > new_name_array_len && strcmp(type, "char") == 0) {
/* string had to be truncated, ensure it's still null-terminated */
curdata[mul - 1] = '\0';
}
}
else {
cast_elem(type, otype, min_name_array_len, curdata, olddata);
}
return;
}
}
olddata += len;
}
}
/**
* Converts the contents of an entire struct from oldsdna to newsdna format.
*
* \param newsdna: SDNA of current Blender
* \param oldsdna: SDNA of Blender that saved file
* \param compflags:
*
* Result from DNA_struct_get_compareflags to avoid needless conversions.
* \param oldSDNAnr: Index of old struct definition in oldsdna
* \param data: Struct contents laid out according to oldsdna
* \param curSDNAnr: Index of current struct definition in newsdna
* \param cur: Where to put converted struct contents
*/
static void reconstruct_struct(const SDNA *newsdna,
const SDNA *oldsdna,
const char *compflags,
int oldSDNAnr,
const char *data,
int curSDNAnr,
char *cur)
{
/* Recursive!
* Per element from cur_struct, read data from old_struct.
* If element is a struct, call recursive.
*/
int a, elemcount, elen, eleno, mul, mulo, firststructtypenr;
const short *spo, *spc, *sppo;
const char *type;
const char *cpo;
char *cpc;
const char *name;
unsigned int oldsdna_index_last = UINT_MAX;
unsigned int cursdna_index_last = UINT_MAX;
if (oldSDNAnr == -1) {
return;
}
if (curSDNAnr == -1) {
return;
}
if (compflags[oldSDNAnr] == SDNA_CMP_EQUAL) {
/* if recursive: test for equal */
spo = oldsdna->structs[oldSDNAnr];
elen = oldsdna->types_size[spo[0]];
memcpy(cur, data, elen);
return;
}
firststructtypenr = *(newsdna->structs[0]);
spo = oldsdna->structs[oldSDNAnr];
spc = newsdna->structs[curSDNAnr];
elemcount = spc[1];
spc += 2;
cpc = cur;
for (a = 0; a < elemcount; a++, spc += 2) { /* convert each field */
type = newsdna->types[spc[0]];
name = newsdna->names[spc[1]];
elen = DNA_elem_size_nr(newsdna, spc[0], spc[1]);
/* Skip pad bytes which must start with '_pad', see makesdna.c 'is_name_legal'.
* for exact rules. Note that if we fail to skip a pad byte it's harmless,
* this just avoids unnecessary reconstruction. */
if (name[0] == '_' || (name[0] == '*' && name[1] == '_')) {
cpc += elen;
}
else if (spc[0] >= firststructtypenr && !ispointer(name)) {
/* struct field type */
/* where does the old struct data start (and is there an old one?) */
cpo = (char *)find_elem(oldsdna, type, name, spo, data, &sppo);
if (cpo) {
oldSDNAnr = DNA_struct_find_nr_ex(oldsdna, type, &oldsdna_index_last);
curSDNAnr = DNA_struct_find_nr_ex(newsdna, type, &cursdna_index_last);
/* array! */
mul = newsdna->names_array_len[spc[1]];
mulo = oldsdna->names_array_len[sppo[1]];
eleno = DNA_elem_size_nr(oldsdna, sppo[0], sppo[1]);
elen /= mul;
eleno /= mulo;
while (mul--) {
reconstruct_struct(newsdna, oldsdna, compflags, oldSDNAnr, cpo, curSDNAnr, cpc);
cpo += eleno;
cpc += elen;
/* new struct array larger than old */
mulo--;
if (mulo <= 0) {
break;
}
}
}
else {
cpc += elen; /* skip field no longer present */
}
}
else {
/* non-struct field type */
reconstruct_elem(newsdna, oldsdna, type, spc[1], cpc, spo, data);
cpc += elen;
}
}
}
/**
* Does endian swapping on the fields of a struct value.
*
* \param oldsdna: SDNA of Blender that saved file
* \param oldSDNAnr: Index of struct info within oldsdna
* \param data: Struct data
*/
void DNA_struct_switch_endian(const SDNA *oldsdna, int oldSDNAnr, char *data)
{
/* Recursive!
* If element is a struct, call recursive.
*/
int a, mul, elemcount, elen, elena, firststructtypenr;
const short *spo, *spc;
char *cur;
const char *type, *name;
unsigned int oldsdna_index_last = UINT_MAX;
if (oldSDNAnr == -1) {
return;
}
firststructtypenr = *(oldsdna->structs[0]);
spo = spc = oldsdna->structs[oldSDNAnr];
elemcount = spo[1];
spc += 2;
cur = data;
for (a = 0; a < elemcount; a++, spc += 2) {
type = oldsdna->types[spc[0]];
name = oldsdna->names[spc[1]];
const int old_name_array_len = oldsdna->names_array_len[spc[1]];
/* DNA_elem_size_nr = including arraysize */
elen = DNA_elem_size_nr(oldsdna, spc[0], spc[1]);
/* test: is type a struct? */
if (spc[0] >= firststructtypenr && !ispointer(name)) {
/* struct field type */
/* where does the old data start (is there one?) */
char *cpo = (char *)find_elem(oldsdna, type, name, spo, data, NULL);
if (cpo) {
oldSDNAnr = DNA_struct_find_nr_ex(oldsdna, type, &oldsdna_index_last);
mul = old_name_array_len;
elena = elen / mul;
while (mul--) {
DNA_struct_switch_endian(oldsdna, oldSDNAnr, cpo);
cpo += elena;
}
}
}
else {
/* non-struct field type */
if (ispointer(name)) {
if (oldsdna->pointer_size == 8) {
BLI_endian_switch_int64_array((int64_t *)cur, old_name_array_len);
}
}
else {
if (ELEM(spc[0], SDNA_TYPE_SHORT, SDNA_TYPE_USHORT)) {
/* exception: variable called blocktype: derived from ID_ */
bool skip = false;
if (name[0] == 'b' && name[1] == 'l') {
if (strcmp(name, "blocktype") == 0) {
skip = true;
}
}
if (skip == false) {
BLI_endian_switch_int16_array((int16_t *)cur, old_name_array_len);
}
}
else if (ELEM(spc[0], SDNA_TYPE_INT, SDNA_TYPE_FLOAT)) {
/* note, intentionally ignore long/ulong here these could be 4 or 8 bits,
* but turns out we only used for runtime vars and
* only once for a struct type that's no longer used. */
BLI_endian_switch_int32_array((int32_t *)cur, old_name_array_len);
}
else if (ELEM(spc[0], SDNA_TYPE_INT64, SDNA_TYPE_UINT64, SDNA_TYPE_DOUBLE)) {
BLI_endian_switch_int64_array((int64_t *)cur, old_name_array_len);
}
}
}
cur += elen;
}
}
/**
* \param newsdna: SDNA of current Blender
* \param oldsdna: SDNA of Blender that saved file
* \param compflags:
*
* Result from DNA_struct_get_compareflags to avoid needless conversions
* \param oldSDNAnr: Index of struct info within oldsdna
* \param blocks: The number of array elements
* \param data: Array of struct data
* \return An allocated reconstructed struct
*/
void *DNA_struct_reconstruct(const SDNA *newsdna,
const SDNA *oldsdna,
const char *compflags,
int oldSDNAnr,
int blocks,
const void *data)
{
int a, curSDNAnr, curlen = 0, oldlen;
const short *spo, *spc;
char *cur, *cpc;
const char *cpo;
const char *type;
/* oldSDNAnr == structnr, we're looking for the corresponding 'cur' number */
spo = oldsdna->structs[oldSDNAnr];
type = oldsdna->types[spo[0]];
oldlen = oldsdna->types_size[spo[0]];
curSDNAnr = DNA_struct_find_nr(newsdna, type);
/* init data and alloc */
if (curSDNAnr != -1) {
spc = newsdna->structs[curSDNAnr];
curlen = newsdna->types_size[spc[0]];
}
if (curlen == 0) {
return NULL;
}
cur = MEM_callocN(blocks * curlen, "reconstruct");
cpc = cur;
cpo = data;
for (a = 0; a < blocks; a++) {
reconstruct_struct(newsdna, oldsdna, compflags, oldSDNAnr, cpo, curSDNAnr, cpc);
cpc += curlen;
cpo += oldlen;
}
return cur;
}
/**
* Returns the offset of the field with the specified name and type within the specified
* struct type in sdna.
*/
int DNA_elem_offset(SDNA *sdna, const char *stype, const char *vartype, const char *name)
{
const int SDNAnr = DNA_struct_find_nr(sdna, stype);
const short *const spo = sdna->structs[SDNAnr];
const char *const cp = find_elem(sdna, vartype, name, spo, NULL, NULL);
BLI_assert(SDNAnr != -1);
return (int)((intptr_t)cp);
}
bool DNA_struct_find(const SDNA *sdna, const char *stype)
{
return DNA_struct_find_nr(sdna, stype) != -1;
}
bool DNA_struct_elem_find(const SDNA *sdna,
const char *stype,
const char *vartype,
const char *name)
{
const int SDNAnr = DNA_struct_find_nr(sdna, stype);
if (SDNAnr != -1) {
const short *const spo = sdna->structs[SDNAnr];
const bool found = elem_exists(sdna, vartype, name, spo);
if (found) {
return true;
}
}
return false;
}
/** \note requires #DNA_sdna_alias_data_ensure_structs_map to be called. */
bool DNA_struct_alias_elem_find(const SDNA *sdna,
const char *stype,
const char *vartype,
const char *name)
{
const int SDNAnr = DNA_struct_alias_find_nr(sdna, stype);
if (SDNAnr != -1) {
const short *const spo = sdna->structs[SDNAnr];
const bool found = elem_exists_alias(sdna, vartype, name, spo);
if (found) {
return true;
}
}
return false;
}
/**
* Returns the size in bytes of a primitive type.
*/
int DNA_elem_type_size(const eSDNA_Type elem_nr)
{
/* should contain all enum types */
switch (elem_nr) {
case SDNA_TYPE_CHAR:
case SDNA_TYPE_UCHAR:
return 1;
case SDNA_TYPE_SHORT:
case SDNA_TYPE_USHORT:
return 2;
case SDNA_TYPE_INT:
case SDNA_TYPE_FLOAT:
return 4;
case SDNA_TYPE_DOUBLE:
case SDNA_TYPE_INT64:
case SDNA_TYPE_UINT64:
return 8;
}
/* weak */
return 8;
}
/* -------------------------------------------------------------------- */
/** \name Version Patch DNA
* \{ */
static bool DNA_sdna_patch_struct_nr(SDNA *sdna,
const int struct_name_old_nr,
const char *struct_name_new)
{
BLI_assert(DNA_struct_find_nr(DNA_sdna_current_get(), struct_name_new) != -1);
const short *sp = sdna->structs[struct_name_old_nr];
#ifdef WITH_DNA_GHASH
BLI_ghash_remove(sdna->structs_map, (void *)sdna->types[sp[0]], NULL, NULL);
BLI_ghash_insert(
sdna->structs_map, (void *)struct_name_new, POINTER_FROM_INT(struct_name_old_nr));
#endif
sdna->types[sp[0]] = struct_name_new;
return true;
}
/**
* Rename a struct
*/
bool DNA_sdna_patch_struct(SDNA *sdna, const char *struct_name_old, const char *struct_name_new)
{
const int struct_name_old_nr = DNA_struct_find_nr(sdna, struct_name_old);
if (struct_name_old_nr != -1) {
return DNA_sdna_patch_struct_nr(sdna, struct_name_old_nr, struct_name_new);
}
return false;
}
/* Make public if called often with same struct (avoid duplicate look-ups). */
static bool DNA_sdna_patch_struct_member_nr(SDNA *sdna,
const int struct_name_nr,
const char *elem_old,
const char *elem_new)
{
/* These names aren't handled here (it's not used).
* Ensure they are never used or we get out of sync arrays. */
BLI_assert(sdna->alias.names == NULL);
const int elem_old_len = strlen(elem_old);
const int elem_new_len = strlen(elem_new);
BLI_assert(elem_new != NULL);
short *sp = sdna->structs[struct_name_nr];
for (int elem_index = sp[1]; elem_index > 0; elem_index--, sp += 2) {
const char *elem_old_full = sdna->names[sp[1]];
/* Start & end offsets in 'elem_old_full'. */
uint elem_old_full_offset_start;
if (DNA_elem_id_match(elem_old, elem_old_len, elem_old_full, &elem_old_full_offset_start)) {
if (sdna->mem_arena == NULL) {
sdna->mem_arena = BLI_memarena_new(BLI_MEMARENA_STD_BUFSIZE, __func__);
}
const char *elem_new_full = DNA_elem_id_rename(sdna->mem_arena,
elem_old,
elem_old_len,
elem_new,
elem_new_len,
elem_old_full,
strlen(elem_old_full),
elem_old_full_offset_start);
if (sdna->names_len == sdna->names_len_alloc) {
sdna->names_len_alloc += 64;
sdna->names = MEM_recallocN((void *)sdna->names,
sizeof(*sdna->names) * sdna->names_len_alloc);
sdna->names_array_len = MEM_recallocN(
(void *)sdna->names_array_len, sizeof(*sdna->names_array_len) * sdna->names_len_alloc);
}
const short name_nr_prev = sp[1];
sp[1] = sdna->names_len++;
sdna->names[sp[1]] = elem_new_full;
sdna->names_array_len[sp[1]] = sdna->names_array_len[name_nr_prev];
return true;
}
}
return false;
}
/**
* Replace \a elem_old with \a elem_new for struct \a struct_name
* handles search & replace, maintaining surrounding non-identifier characters
* such as pointer & array size.
*/
bool DNA_sdna_patch_struct_member(SDNA *sdna,
const char *struct_name,
const char *elem_old,
const char *elem_new)
{
const int struct_name_nr = DNA_struct_find_nr(sdna, struct_name);
if (struct_name_nr != -1) {
return DNA_sdna_patch_struct_member_nr(sdna, struct_name_nr, elem_old, elem_new);
}
return false;
}
/** \} */
/* -------------------------------------------------------------------- */
/** \name Versioning (Forward Compatible)
*
* Versioning that allows new names.
* \{ */
/**
* Names are shared between structs which causes problems renaming.
* Make sure every struct member gets it's own name so renaming only ever impacts a single struct.
*
* The resulting SDNA is never written to disk.
*/
static void sdna_expand_names(SDNA *sdna)
{
int names_expand_len = 0;
for (int struct_nr = 0; struct_nr < sdna->structs_len; struct_nr++) {
const short *sp = sdna->structs[struct_nr];
names_expand_len += sp[1];
}
const char **names_expand = MEM_mallocN(sizeof(*names_expand) * names_expand_len, __func__);
short *names_array_len_expand = MEM_mallocN(sizeof(*names_array_len_expand) * names_expand_len,
__func__);
int names_expand_index = 0;
for (int struct_nr = 0; struct_nr < sdna->structs_len; struct_nr++) {
/* We can't edit this memory 'sdna->structs' points to (readonly datatoc file). */
const short *sp = sdna->structs[struct_nr];
short *sp_expand = BLI_memarena_alloc(sdna->mem_arena, sizeof(short[2]) * (1 + sp[1]));
memcpy(sp_expand, sp, sizeof(short[2]) * (1 + sp[1]));
sdna->structs[struct_nr] = sp_expand;
const int names_len = sp[1];
sp += 2;
sp_expand += 2;
for (int i = 0; i < names_len; i++, sp += 2, sp_expand += 2) {
names_expand[names_expand_index] = sdna->names[sp[1]];
names_array_len_expand[names_expand_index] = sdna->names_array_len[sp[1]];
BLI_assert(names_expand_index < SHRT_MAX);
sp_expand[1] = names_expand_index;
names_expand_index++;
}
}
MEM_freeN((void *)sdna->names);
sdna->names = names_expand;
MEM_freeN((void *)sdna->names_array_len);
sdna->names_array_len = names_array_len_expand;
sdna->names_len = names_expand_len;
}
static const char *dna_sdna_alias_from_static_elem_full(SDNA *sdna,
GHash *elem_map_alias_from_static,
const char *struct_name_static,
const char *elem_static_full)
{
const int elem_static_full_len = strlen(elem_static_full);
char *elem_static = alloca(elem_static_full_len + 1);
const int elem_static_len = DNA_elem_id_strip_copy(elem_static, elem_static_full);
const char *str_pair[2] = {struct_name_static, elem_static};
const char *elem_alias = BLI_ghash_lookup(elem_map_alias_from_static, str_pair);
if (elem_alias) {
return DNA_elem_id_rename(sdna->mem_arena,
elem_static,
elem_static_len,
elem_alias,
strlen(elem_alias),
elem_static_full,
elem_static_full_len,
DNA_elem_id_offset_start(elem_static_full));
}
return NULL;
}
void DNA_sdna_alias_data_ensure(SDNA *sdna)
{
/* We may want this to be optional later. */
const bool use_legacy_hack = true;
if (sdna->mem_arena == NULL) {
sdna->mem_arena = BLI_memarena_new(BLI_MEMARENA_STD_BUFSIZE, __func__);
}
GHash *struct_map_alias_from_static;
GHash *elem_map_alias_from_static;
DNA_alias_maps(
DNA_RENAME_ALIAS_FROM_STATIC, &struct_map_alias_from_static, &elem_map_alias_from_static);
if (sdna->alias.types == NULL) {
sdna->alias.types = MEM_mallocN(sizeof(*sdna->alias.types) * sdna->types_len, __func__);
for (int type_nr = 0; type_nr < sdna->types_len; type_nr++) {
const char *struct_name_static = sdna->types[type_nr];
if (use_legacy_hack) {
struct_name_static = DNA_struct_rename_legacy_hack_alias_from_static(struct_name_static);
}
sdna->alias.types[type_nr] = BLI_ghash_lookup_default(
struct_map_alias_from_static, struct_name_static, (void *)struct_name_static);
}
}
if (sdna->alias.names == NULL) {
sdna_expand_names(sdna);
sdna->alias.names = MEM_mallocN(sizeof(*sdna->alias.names) * sdna->names_len, __func__);
for (int struct_nr = 0; struct_nr < sdna->structs_len; struct_nr++) {
const short *sp = sdna->structs[struct_nr];
const char *struct_name_static = sdna->types[sp[0]];
if (use_legacy_hack) {
struct_name_static = DNA_struct_rename_legacy_hack_alias_from_static(struct_name_static);
}
const int dna_struct_names_len = sp[1];
sp += 2;
for (int a = 0; a < dna_struct_names_len; a++, sp += 2) {
const char *elem_alias_full = dna_sdna_alias_from_static_elem_full(
sdna, elem_map_alias_from_static, struct_name_static, sdna->names[sp[1]]);
if (elem_alias_full != NULL) {
sdna->alias.names[sp[1]] = elem_alias_full;
}
else {
sdna->alias.names[sp[1]] = sdna->names[sp[1]];
}
}
}
}
BLI_ghash_free(struct_map_alias_from_static, NULL, NULL);
BLI_ghash_free(elem_map_alias_from_static, MEM_freeN, NULL);
}
/**
* Separated from #DNA_sdna_alias_data_ensure because it's not needed
* unless we want to lookup aliased struct names (#DNA_struct_alias_find_nr and friends).
*/
void DNA_sdna_alias_data_ensure_structs_map(SDNA *sdna)
{
DNA_sdna_alias_data_ensure(sdna);
#ifdef WITH_DNA_GHASH
/* create a ghash lookup to speed up */
struct GHash *structs_map = BLI_ghash_str_new_ex(__func__, sdna->structs_len);
for (intptr_t nr = 0; nr < sdna->structs_len; nr++) {
const short *sp = sdna->structs[nr];
BLI_ghash_insert(structs_map, (void *)sdna->alias.types[sp[0]], POINTER_FROM_INT(nr));
}
sdna->alias.structs_map = structs_map;
#else
UNUSED_VARS(sdna);
#endif
}
/** \} */
Reference in New Issue View Git Blame Copy Permalink