2022-02-11 09:07:11 +11:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
|
* Copyright 2001-2002 NaN Holding BV. All rights reserved. */
|
2018-11-07 16:06:36 +01:00
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup bke
|
2018-11-07 16:06:36 +01:00
|
|
|
*
|
2019-02-12 01:21:09 +11:00
|
|
|
* Contains management of #Main database itself.
|
2018-11-07 16:06:36 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
|
|
|
|
|
|
#include "BLI_blenlib.h"
|
|
|
|
|
#include "BLI_ghash.h"
|
|
|
|
|
#include "BLI_mempool.h"
|
|
|
|
|
#include "BLI_threads.h"
|
|
|
|
|
|
|
|
|
|
#include "DNA_ID.h"
|
|
|
|
|
|
|
|
|
|
#include "BKE_global.h"
|
2021-09-17 16:22:29 +02:00
|
|
|
#include "BKE_idtype.h"
|
2020-02-10 12:58:59 +01:00
|
|
|
#include "BKE_lib_id.h"
|
|
|
|
|
#include "BKE_lib_query.h"
|
2018-11-07 16:06:36 +01:00
|
|
|
#include "BKE_main.h"
|
2021-06-30 15:19:35 +02:00
|
|
|
#include "BKE_main_idmap.h"
|
2018-11-07 16:06:36 +01:00
|
|
|
|
|
|
|
|
#include "IMB_imbuf.h"
|
|
|
|
|
#include "IMB_imbuf_types.h"
|
|
|
|
|
|
|
|
|
|
Main *BKE_main_new(void)
|
|
|
|
|
{
|
|
|
|
|
Main *bmain = MEM_callocN(sizeof(Main), "new main");
|
|
|
|
|
bmain->lock = MEM_mallocN(sizeof(SpinLock), "main lock");
|
|
|
|
|
BLI_spin_init((SpinLock *)bmain->lock);
|
|
|
|
|
return bmain;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_free(Main *mainvar)
|
|
|
|
|
{
|
|
|
|
|
/* also call when reading a file, erase all, etc */
|
2021-03-04 18:39:07 +01:00
|
|
|
ListBase *lbarray[INDEX_ID_MAX];
|
2018-11-07 16:06:36 +01:00
|
|
|
int a;
|
|
|
|
|
|
2019-04-27 12:07:07 +10:00
|
|
|
/* Since we are removing whole main, no need to bother 'properly'
|
|
|
|
|
* (and slowly) removing each ID from it. */
|
2019-01-16 11:39:30 +01:00
|
|
|
const int free_flag = (LIB_ID_FREE_NO_MAIN | LIB_ID_FREE_NO_UI_USER |
|
|
|
|
|
LIB_ID_FREE_NO_USER_REFCOUNT | LIB_ID_FREE_NO_DEG_TAG);
|
2019-01-14 16:15:15 +01:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
MEM_SAFE_FREE(mainvar->blen_thumb);
|
|
|
|
|
|
|
|
|
|
a = set_listbasepointers(mainvar, lbarray);
|
|
|
|
|
while (a--) {
|
|
|
|
|
ListBase *lb = lbarray[a];
|
2019-01-14 16:15:15 +01:00
|
|
|
ID *id, *id_next;
|
2018-11-07 16:06:36 +01:00
|
|
|
|
2019-01-14 16:15:15 +01:00
|
|
|
for (id = lb->first; id != NULL; id = id_next) {
|
|
|
|
|
id_next = id->next;
|
2018-11-07 16:06:36 +01:00
|
|
|
#if 1
|
2019-01-14 16:15:15 +01:00
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
2018-11-07 16:06:36 +01:00
|
|
|
#else
|
|
|
|
|
/* errors freeing ID's can be hard to track down,
|
|
|
|
|
* enable this so valgrind will give the line number in its error log */
|
|
|
|
|
switch (a) {
|
2019-01-14 16:15:15 +01:00
|
|
|
case 0:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
2019-04-17 06:17:24 +02:00
|
|
|
break;
|
|
|
|
|
case 1:
|
2019-01-14 16:15:15 +01:00
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
2019-04-17 06:17:24 +02:00
|
|
|
case 2:
|
2019-01-14 16:15:15 +01:00
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 3:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 4:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 5:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 6:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 7:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 8:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 9:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 10:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 11:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 12:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 13:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 14:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 15:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 16:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 17:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 18:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 19:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 20:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 21:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 22:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 23:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 24:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 25:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 26:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 27:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 28:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 29:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 30:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 31:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
|
|
|
|
case 32:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
|
|
|
|
break;
|
2019-04-17 06:17:24 +02:00
|
|
|
case 33:
|
2019-01-14 16:15:15 +01:00
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
2019-04-17 06:17:24 +02:00
|
|
|
break;
|
2019-01-14 16:15:15 +01:00
|
|
|
case 34:
|
|
|
|
|
BKE_id_free_ex(mainvar, id, free_flag, false);
|
2019-04-17 06:17:24 +02:00
|
|
|
break;
|
2018-11-07 16:06:36 +01:00
|
|
|
default:
|
2021-03-24 12:38:08 +11:00
|
|
|
BLI_assert_unreachable();
|
2018-11-07 16:06:36 +01:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
}
|
2019-01-14 16:15:15 +01:00
|
|
|
BLI_listbase_clear(lb);
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (mainvar->relations) {
|
|
|
|
|
BKE_main_relations_free(mainvar);
|
|
|
|
|
}
|
|
|
|
|
|
2021-06-30 15:19:35 +02:00
|
|
|
if (mainvar->id_map) {
|
|
|
|
|
BKE_main_idmap_destroy(mainvar->id_map);
|
|
|
|
|
}
|
|
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
BLI_spin_end((SpinLock *)mainvar->lock);
|
|
|
|
|
MEM_freeN(mainvar->lock);
|
|
|
|
|
MEM_freeN(mainvar);
|
|
|
|
|
}
|
|
|
|
|
|
2021-10-06 16:41:08 +02:00
|
|
|
bool BKE_main_is_empty(struct Main *bmain)
|
|
|
|
|
{
|
|
|
|
|
ID *id_iter;
|
|
|
|
|
FOREACH_MAIN_ID_BEGIN (bmain, id_iter) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
FOREACH_MAIN_ID_END;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
void BKE_main_lock(struct Main *bmain)
|
|
|
|
|
{
|
|
|
|
|
BLI_spin_lock((SpinLock *)bmain->lock);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_unlock(struct Main *bmain)
|
|
|
|
|
{
|
|
|
|
|
BLI_spin_unlock((SpinLock *)bmain->lock);
|
|
|
|
|
}
|
|
|
|
|
|
2020-02-13 12:56:10 +01:00
|
|
|
static int main_relations_create_idlink_cb(LibraryIDLinkCallbackData *cb_data)
|
2018-11-07 16:06:36 +01:00
|
|
|
{
|
2021-01-20 15:50:56 +01:00
|
|
|
MainIDRelations *bmain_relations = cb_data->user_data;
|
2020-02-13 12:56:10 +01:00
|
|
|
ID *id_self = cb_data->id_self;
|
|
|
|
|
ID **id_pointer = cb_data->id_pointer;
|
|
|
|
|
const int cb_flag = cb_data->cb_flag;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
if (*id_pointer) {
|
2021-01-21 14:52:40 +01:00
|
|
|
MainIDRelationsEntry **entry_p;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2021-01-21 14:52:40 +01:00
|
|
|
/* Add `id_pointer` as child of `id_self`. */
|
|
|
|
|
{
|
|
|
|
|
if (!BLI_ghash_ensure_p(
|
|
|
|
|
bmain_relations->relations_from_pointers, id_self, (void ***)&entry_p)) {
|
|
|
|
|
*entry_p = MEM_callocN(sizeof(**entry_p), __func__);
|
|
|
|
|
(*entry_p)->session_uuid = id_self->session_uuid;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
BLI_assert((*entry_p)->session_uuid == id_self->session_uuid);
|
|
|
|
|
}
|
|
|
|
|
MainIDRelationsEntryItem *to_id_entry = BLI_mempool_alloc(bmain_relations->entry_items_pool);
|
|
|
|
|
to_id_entry->next = (*entry_p)->to_ids;
|
|
|
|
|
to_id_entry->id_pointer.to = id_pointer;
|
|
|
|
|
to_id_entry->session_uuid = (*id_pointer != NULL) ? (*id_pointer)->session_uuid :
|
|
|
|
|
MAIN_ID_SESSION_UUID_UNSET;
|
|
|
|
|
to_id_entry->usage_flag = cb_flag;
|
|
|
|
|
(*entry_p)->to_ids = to_id_entry;
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2021-01-21 14:52:40 +01:00
|
|
|
/* Add `id_self` as parent of `id_pointer`. */
|
|
|
|
|
if (*id_pointer != NULL) {
|
|
|
|
|
if (!BLI_ghash_ensure_p(
|
|
|
|
|
bmain_relations->relations_from_pointers, *id_pointer, (void ***)&entry_p)) {
|
|
|
|
|
*entry_p = MEM_callocN(sizeof(**entry_p), __func__);
|
|
|
|
|
(*entry_p)->session_uuid = (*id_pointer)->session_uuid;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
BLI_assert((*entry_p)->session_uuid == (*id_pointer)->session_uuid);
|
|
|
|
|
}
|
|
|
|
|
MainIDRelationsEntryItem *from_id_entry = BLI_mempool_alloc(
|
|
|
|
|
bmain_relations->entry_items_pool);
|
|
|
|
|
from_id_entry->next = (*entry_p)->from_ids;
|
|
|
|
|
from_id_entry->id_pointer.from = id_self;
|
|
|
|
|
from_id_entry->session_uuid = id_self->session_uuid;
|
|
|
|
|
from_id_entry->usage_flag = cb_flag;
|
|
|
|
|
(*entry_p)->from_ids = from_id_entry;
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
return IDWALK_RET_NOP;
|
|
|
|
|
}
|
|
|
|
|
|
2020-02-18 11:21:34 +01:00
|
|
|
void BKE_main_relations_create(Main *bmain, const short flag)
|
2018-11-07 16:06:36 +01:00
|
|
|
{
|
|
|
|
|
if (bmain->relations != NULL) {
|
|
|
|
|
BKE_main_relations_free(bmain);
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
bmain->relations = MEM_mallocN(sizeof(*bmain->relations), __func__);
|
2021-01-21 14:52:40 +01:00
|
|
|
bmain->relations->relations_from_pointers = BLI_ghash_new(
|
2018-11-07 16:06:36 +01:00
|
|
|
BLI_ghashutil_ptrhash, BLI_ghashutil_ptrcmp, __func__);
|
2021-01-21 14:52:40 +01:00
|
|
|
bmain->relations->entry_items_pool = BLI_mempool_create(
|
|
|
|
|
sizeof(MainIDRelationsEntryItem), 128, 128, BLI_MEMPOOL_NOP);
|
|
|
|
|
|
|
|
|
|
bmain->relations->flag = flag;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-02-14 16:24:49 +01:00
|
|
|
ID *id;
|
2019-04-21 04:40:16 +10:00
|
|
|
FOREACH_MAIN_ID_BEGIN (bmain, id) {
|
2020-02-18 11:21:34 +01:00
|
|
|
const int idwalk_flag = IDWALK_READONLY |
|
|
|
|
|
((flag & MAINIDRELATIONS_INCLUDE_UI) != 0 ? IDWALK_INCLUDE_UI : 0);
|
2021-01-22 17:35:47 +01:00
|
|
|
|
|
|
|
|
/* Ensure all IDs do have an entry, even if they are not connected to any other. */
|
|
|
|
|
MainIDRelationsEntry **entry_p;
|
|
|
|
|
if (!BLI_ghash_ensure_p(bmain->relations->relations_from_pointers, id, (void ***)&entry_p)) {
|
|
|
|
|
*entry_p = MEM_callocN(sizeof(**entry_p), __func__);
|
|
|
|
|
(*entry_p)->session_uuid = id->session_uuid;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
BLI_assert((*entry_p)->session_uuid == id->session_uuid);
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-14 16:24:49 +01:00
|
|
|
BKE_library_foreach_ID_link(
|
2020-02-18 11:21:34 +01:00
|
|
|
NULL, id, main_relations_create_idlink_cb, bmain->relations, idwalk_flag);
|
2019-02-14 16:24:49 +01:00
|
|
|
}
|
|
|
|
|
FOREACH_MAIN_ID_END;
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_relations_free(Main *bmain)
|
|
|
|
|
{
|
2021-01-21 14:52:40 +01:00
|
|
|
if (bmain->relations != NULL) {
|
|
|
|
|
if (bmain->relations->relations_from_pointers != NULL) {
|
|
|
|
|
BLI_ghash_free(bmain->relations->relations_from_pointers, NULL, MEM_freeN);
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
2021-01-21 14:52:40 +01:00
|
|
|
BLI_mempool_destroy(bmain->relations->entry_items_pool);
|
2018-11-07 16:06:36 +01:00
|
|
|
MEM_freeN(bmain->relations);
|
|
|
|
|
bmain->relations = NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2021-02-02 17:26:30 +01:00
|
|
|
void BKE_main_relations_tag_set(struct Main *bmain,
|
2021-10-19 18:33:42 +11:00
|
|
|
const eMainIDRelationsEntryTags tag,
|
2021-02-02 17:26:30 +01:00
|
|
|
const bool value)
|
|
|
|
|
{
|
|
|
|
|
if (bmain->relations == NULL) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
2021-02-09 21:38:57 +01:00
|
|
|
|
|
|
|
|
GHashIterator *gh_iter;
|
|
|
|
|
for (gh_iter = BLI_ghashIterator_new(bmain->relations->relations_from_pointers);
|
2021-02-02 17:26:30 +01:00
|
|
|
!BLI_ghashIterator_done(gh_iter);
|
|
|
|
|
BLI_ghashIterator_step(gh_iter)) {
|
|
|
|
|
MainIDRelationsEntry *entry = BLI_ghashIterator_getValue(gh_iter);
|
|
|
|
|
if (value) {
|
|
|
|
|
entry->tags |= tag;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
entry->tags &= ~tag;
|
|
|
|
|
}
|
|
|
|
|
}
|
2021-02-09 21:38:57 +01:00
|
|
|
BLI_ghashIterator_free(gh_iter);
|
2021-02-02 17:26:30 +01:00
|
|
|
}
|
|
|
|
|
|
2019-02-08 18:44:37 +01:00
|
|
|
GSet *BKE_main_gset_create(Main *bmain, GSet *gset)
|
|
|
|
|
{
|
|
|
|
|
if (gset == NULL) {
|
|
|
|
|
gset = BLI_gset_new(BLI_ghashutil_ptrhash, BLI_ghashutil_ptrcmp, __func__);
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-02-14 16:24:49 +01:00
|
|
|
ID *id;
|
2019-04-21 04:40:16 +10:00
|
|
|
FOREACH_MAIN_ID_BEGIN (bmain, id) {
|
2019-02-14 16:24:49 +01:00
|
|
|
BLI_gset_add(gset, id);
|
2019-02-07 17:16:15 +01:00
|
|
|
}
|
2019-02-14 16:24:49 +01:00
|
|
|
FOREACH_MAIN_ID_END;
|
|
|
|
|
return gset;
|
2019-02-07 17:16:15 +01:00
|
|
|
}
|
|
|
|
|
|
2021-09-17 16:22:29 +02:00
|
|
|
/* Utils for ID's library weak reference API. */
|
|
|
|
|
typedef struct LibWeakRefKey {
|
|
|
|
|
char filepath[FILE_MAX];
|
|
|
|
|
char id_name[MAX_ID_NAME];
|
|
|
|
|
} LibWeakRefKey;
|
|
|
|
|
|
|
|
|
|
static LibWeakRefKey *lib_weak_key_create(LibWeakRefKey *key,
|
|
|
|
|
const char *lib_path,
|
|
|
|
|
const char *id_name)
|
|
|
|
|
{
|
|
|
|
|
if (key == NULL) {
|
|
|
|
|
key = MEM_mallocN(sizeof(*key), __func__);
|
|
|
|
|
}
|
|
|
|
|
BLI_strncpy(key->filepath, lib_path, sizeof(key->filepath));
|
|
|
|
|
BLI_strncpy(key->id_name, id_name, sizeof(key->id_name));
|
|
|
|
|
return key;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static uint lib_weak_key_hash(const void *ptr)
|
|
|
|
|
{
|
|
|
|
|
const LibWeakRefKey *string_pair = ptr;
|
|
|
|
|
uint hash = BLI_ghashutil_strhash_p_murmur(string_pair->filepath);
|
|
|
|
|
return hash ^ BLI_ghashutil_strhash_p_murmur(string_pair->id_name);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static bool lib_weak_key_cmp(const void *a, const void *b)
|
|
|
|
|
{
|
|
|
|
|
const LibWeakRefKey *string_pair_a = a;
|
|
|
|
|
const LibWeakRefKey *string_pair_b = b;
|
|
|
|
|
|
|
|
|
|
return !(STREQ(string_pair_a->filepath, string_pair_b->filepath) &&
|
|
|
|
|
STREQ(string_pair_a->id_name, string_pair_b->id_name));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
GHash *BKE_main_library_weak_reference_create(Main *bmain)
|
|
|
|
|
{
|
|
|
|
|
GHash *library_weak_reference_mapping = BLI_ghash_new(
|
|
|
|
|
lib_weak_key_hash, lib_weak_key_cmp, __func__);
|
|
|
|
|
|
|
|
|
|
ListBase *lb;
|
|
|
|
|
FOREACH_MAIN_LISTBASE_BEGIN (bmain, lb) {
|
|
|
|
|
ID *id_iter = lb->first;
|
|
|
|
|
if (id_iter == NULL) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
if (!BKE_idtype_idcode_append_is_reusable(GS(id_iter->name))) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
BLI_assert(BKE_idtype_idcode_is_linkable(GS(id_iter->name)));
|
|
|
|
|
|
|
|
|
|
FOREACH_MAIN_LISTBASE_ID_BEGIN (lb, id_iter) {
|
|
|
|
|
if (id_iter->library_weak_reference == NULL) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
LibWeakRefKey *key = lib_weak_key_create(NULL,
|
|
|
|
|
id_iter->library_weak_reference->library_filepath,
|
|
|
|
|
id_iter->library_weak_reference->library_id_name);
|
|
|
|
|
BLI_ghash_insert(library_weak_reference_mapping, key, id_iter);
|
|
|
|
|
}
|
|
|
|
|
FOREACH_MAIN_LISTBASE_ID_END;
|
|
|
|
|
}
|
|
|
|
|
FOREACH_MAIN_LISTBASE_END;
|
|
|
|
|
|
|
|
|
|
return library_weak_reference_mapping;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_library_weak_reference_destroy(GHash *library_weak_reference_mapping)
|
|
|
|
|
{
|
|
|
|
|
BLI_ghash_free(library_weak_reference_mapping, MEM_freeN, NULL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ID *BKE_main_library_weak_reference_search_item(GHash *library_weak_reference_mapping,
|
|
|
|
|
const char *library_filepath,
|
|
|
|
|
const char *library_id_name)
|
|
|
|
|
{
|
|
|
|
|
LibWeakRefKey key;
|
|
|
|
|
lib_weak_key_create(&key, library_filepath, library_id_name);
|
|
|
|
|
return (ID *)BLI_ghash_lookup(library_weak_reference_mapping, &key);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_library_weak_reference_add_item(GHash *library_weak_reference_mapping,
|
|
|
|
|
const char *library_filepath,
|
|
|
|
|
const char *library_id_name,
|
|
|
|
|
ID *new_id)
|
|
|
|
|
{
|
|
|
|
|
BLI_assert(GS(library_id_name) == GS(new_id->name));
|
|
|
|
|
BLI_assert(new_id->library_weak_reference == NULL);
|
|
|
|
|
BLI_assert(BKE_idtype_idcode_append_is_reusable(GS(new_id->name)));
|
|
|
|
|
|
|
|
|
|
new_id->library_weak_reference = MEM_mallocN(sizeof(*(new_id->library_weak_reference)),
|
|
|
|
|
__func__);
|
|
|
|
|
|
|
|
|
|
LibWeakRefKey *key = lib_weak_key_create(NULL, library_filepath, library_id_name);
|
|
|
|
|
void **id_p;
|
|
|
|
|
const bool already_exist_in_mapping = BLI_ghash_ensure_p(
|
|
|
|
|
library_weak_reference_mapping, key, &id_p);
|
|
|
|
|
BLI_assert(!already_exist_in_mapping);
|
2021-09-23 12:30:07 +02:00
|
|
|
UNUSED_VARS_NDEBUG(already_exist_in_mapping);
|
2021-09-17 16:22:29 +02:00
|
|
|
|
|
|
|
|
BLI_strncpy(new_id->library_weak_reference->library_filepath,
|
|
|
|
|
library_filepath,
|
|
|
|
|
sizeof(new_id->library_weak_reference->library_filepath));
|
|
|
|
|
BLI_strncpy(new_id->library_weak_reference->library_id_name,
|
|
|
|
|
library_id_name,
|
|
|
|
|
sizeof(new_id->library_weak_reference->library_id_name));
|
|
|
|
|
*id_p = new_id;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_library_weak_reference_update_item(GHash *library_weak_reference_mapping,
|
|
|
|
|
const char *library_filepath,
|
|
|
|
|
const char *library_id_name,
|
|
|
|
|
ID *old_id,
|
|
|
|
|
ID *new_id)
|
|
|
|
|
{
|
|
|
|
|
BLI_assert(GS(library_id_name) == GS(old_id->name));
|
|
|
|
|
BLI_assert(GS(library_id_name) == GS(new_id->name));
|
|
|
|
|
BLI_assert(old_id->library_weak_reference != NULL);
|
|
|
|
|
BLI_assert(new_id->library_weak_reference == NULL);
|
|
|
|
|
BLI_assert(STREQ(old_id->library_weak_reference->library_filepath, library_filepath));
|
|
|
|
|
BLI_assert(STREQ(old_id->library_weak_reference->library_id_name, library_id_name));
|
|
|
|
|
|
|
|
|
|
LibWeakRefKey key;
|
|
|
|
|
lib_weak_key_create(&key, library_filepath, library_id_name);
|
|
|
|
|
void **id_p = BLI_ghash_lookup_p(library_weak_reference_mapping, &key);
|
|
|
|
|
BLI_assert(id_p != NULL && *id_p == old_id);
|
|
|
|
|
|
|
|
|
|
new_id->library_weak_reference = old_id->library_weak_reference;
|
|
|
|
|
old_id->library_weak_reference = NULL;
|
|
|
|
|
*id_p = new_id;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_library_weak_reference_remove_item(GHash *library_weak_reference_mapping,
|
|
|
|
|
const char *library_filepath,
|
|
|
|
|
const char *library_id_name,
|
|
|
|
|
ID *old_id)
|
|
|
|
|
{
|
|
|
|
|
BLI_assert(GS(library_id_name) == GS(old_id->name));
|
|
|
|
|
BLI_assert(old_id->library_weak_reference != NULL);
|
|
|
|
|
|
|
|
|
|
LibWeakRefKey key;
|
|
|
|
|
lib_weak_key_create(&key, library_filepath, library_id_name);
|
|
|
|
|
|
|
|
|
|
BLI_assert(BLI_ghash_lookup(library_weak_reference_mapping, &key) == old_id);
|
|
|
|
|
BLI_ghash_remove(library_weak_reference_mapping, &key, MEM_freeN, NULL);
|
|
|
|
|
|
|
|
|
|
MEM_SAFE_FREE(old_id->library_weak_reference);
|
|
|
|
|
}
|
|
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
BlendThumbnail *BKE_main_thumbnail_from_imbuf(Main *bmain, ImBuf *img)
|
|
|
|
|
{
|
|
|
|
|
BlendThumbnail *data = NULL;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
if (bmain) {
|
|
|
|
|
MEM_SAFE_FREE(bmain->blen_thumb);
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
if (img) {
|
|
|
|
|
const size_t sz = BLEN_THUMB_MEMSIZE(img->x, img->y);
|
|
|
|
|
data = MEM_mallocN(sz, __func__);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
IMB_rect_from_float(img); /* Just in case... */
|
|
|
|
|
data->width = img->x;
|
|
|
|
|
data->height = img->y;
|
|
|
|
|
memcpy(data->rect, img->rect, sz - sizeof(*data));
|
|
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
if (bmain) {
|
|
|
|
|
bmain->blen_thumb = data;
|
|
|
|
|
}
|
|
|
|
|
return data;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ImBuf *BKE_main_thumbnail_to_imbuf(Main *bmain, BlendThumbnail *data)
|
|
|
|
|
{
|
|
|
|
|
ImBuf *img = NULL;
|
|
|
|
|
|
|
|
|
|
if (!data && bmain) {
|
|
|
|
|
data = bmain->blen_thumb;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (data) {
|
2021-09-06 20:04:25 +10:00
|
|
|
img = IMB_allocFromBuffer(
|
|
|
|
|
(const uint *)data->rect, NULL, (uint)data->width, (uint)data->height, 4);
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return img;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BKE_main_thumbnail_create(struct Main *bmain)
|
|
|
|
|
{
|
|
|
|
|
MEM_SAFE_FREE(bmain->blen_thumb);
|
|
|
|
|
|
|
|
|
|
bmain->blen_thumb = MEM_callocN(BLEN_THUMB_MEMSIZE(BLEN_THUMB_SIZE, BLEN_THUMB_SIZE), __func__);
|
|
|
|
|
bmain->blen_thumb->width = BLEN_THUMB_SIZE;
|
|
|
|
|
bmain->blen_thumb->height = BLEN_THUMB_SIZE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const char *BKE_main_blendfile_path(const Main *bmain)
|
|
|
|
|
{
|
2021-12-13 16:22:19 +11:00
|
|
|
return bmain->filepath;
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const char *BKE_main_blendfile_path_from_global(void)
|
|
|
|
|
{
|
|
|
|
|
return BKE_main_blendfile_path(G_MAIN);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ListBase *which_libbase(Main *bmain, short type)
|
|
|
|
|
{
|
|
|
|
|
switch ((ID_Type)type) {
|
|
|
|
|
case ID_SCE:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->scenes);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_LI:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->libraries);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_OB:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->objects);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_ME:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->meshes);
|
2022-02-18 09:50:29 -06:00
|
|
|
case ID_CU_LEGACY:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->curves);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_MB:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->metaballs);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_MA:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->materials);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_TE:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->textures);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_IM:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->images);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_LT:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->lattices);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_LA:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->lights);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_CA:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->cameras);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_IP:
|
|
|
|
|
return &(bmain->ipo);
|
|
|
|
|
case ID_KE:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->shapekeys);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_WO:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->worlds);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_SCR:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->screens);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_VF:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->fonts);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_TXT:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->texts);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_SPK:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->speakers);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_LP:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->lightprobes);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_SO:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->sounds);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_GR:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->collections);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_AR:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->armatures);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_AC:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->actions);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_NT:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->nodetrees);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_BR:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->brushes);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_PA:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->particles);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_WM:
|
|
|
|
|
return &(bmain->wm);
|
|
|
|
|
case ID_GD:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->gpencils);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_MC:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->movieclips);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_MSK:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->masks);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_LS:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->linestyles);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_PAL:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->palettes);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_PC:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->paintcurves);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_CF:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->cachefiles);
|
2018-11-07 16:06:36 +01:00
|
|
|
case ID_WS:
|
2019-03-08 09:29:17 +11:00
|
|
|
return &(bmain->workspaces);
|
Curves: Rename "Hair" types, variables, and functions to "Curves"
Based on discussions from T95355 and T94193, the plan is to use
the name "Curves" to describe the data-block container for multiple
curves. Eventually this will replace the existing "Curve" data-block.
However, it will be a while before the curve data-block can be replaced
so in order to distinguish the two curve types in the UI, "Hair Curves"
will be used, but eventually changed back to "Curves".
This patch renames "hair-related" files, functions, types, and variable
names to this convention. A deep rename is preferred to keep code
consistent and to avoid any "hair" terminology from leaking, since the
new data-block is meant for all curve types, not just hair use cases.
The downside of this naming is that the difference between "Curve"
and "Curves" has become important. That was considered during
design discussons and deemed acceptable, especially given the
non-permanent nature of the somewhat common conflict.
Some points of interest:
- All DNA compatibility is lost, just like rBf59767ff9729.
- I renamed `ID_HA` to `ID_CV` so there is no complete mismatch.
- `hair_curves` is used where necessary to distinguish from the
existing "curves" plural.
- I didn't rename any of the cycles/rendering code function names,
since that is also used by the old hair particle system.
Differential Revision: https://developer.blender.org/D14007
2022-02-07 11:55:54 -06:00
|
|
|
case ID_CV:
|
|
|
|
|
return &(bmain->hair_curves);
|
2020-03-17 14:41:48 +01:00
|
|
|
case ID_PT:
|
|
|
|
|
return &(bmain->pointclouds);
|
|
|
|
|
case ID_VO:
|
|
|
|
|
return &(bmain->volumes);
|
2020-04-20 10:37:38 +02:00
|
|
|
case ID_SIM:
|
|
|
|
|
return &(bmain->simulations);
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2021-06-10 01:55:41 +10:00
|
|
|
int set_listbasepointers(Main *bmain, ListBase *lb[/*INDEX_ID_MAX*/])
|
2018-11-07 16:06:36 +01:00
|
|
|
{
|
2019-08-14 23:29:46 +10:00
|
|
|
/* Libraries may be accessed from pretty much any other ID. */
|
|
|
|
|
lb[INDEX_ID_LI] = &(bmain->libraries);
|
|
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
lb[INDEX_ID_IP] = &(bmain->ipo);
|
2019-08-14 23:29:46 +10:00
|
|
|
|
|
|
|
|
/* Moved here to avoid problems when freeing with animato (aligorith). */
|
|
|
|
|
lb[INDEX_ID_AC] = &(bmain->actions);
|
|
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_KE] = &(bmain->shapekeys);
|
2019-08-14 23:29:46 +10:00
|
|
|
|
|
|
|
|
/* Referenced by gpencil, so needs to be before that to avoid crashes. */
|
|
|
|
|
lb[INDEX_ID_PAL] = &(bmain->palettes);
|
|
|
|
|
|
|
|
|
|
/* Referenced by nodes, objects, view, scene etc, before to free after. */
|
|
|
|
|
lb[INDEX_ID_GD] = &(bmain->gpencils);
|
|
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_NT] = &(bmain->nodetrees);
|
|
|
|
|
lb[INDEX_ID_IM] = &(bmain->images);
|
|
|
|
|
lb[INDEX_ID_TE] = &(bmain->textures);
|
|
|
|
|
lb[INDEX_ID_MA] = &(bmain->materials);
|
|
|
|
|
lb[INDEX_ID_VF] = &(bmain->fonts);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
/* Important!: When adding a new object type,
|
2019-08-14 23:29:46 +10:00
|
|
|
* the specific data should be inserted here. */
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_AR] = &(bmain->armatures);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_CF] = &(bmain->cachefiles);
|
|
|
|
|
lb[INDEX_ID_ME] = &(bmain->meshes);
|
2022-02-18 09:50:29 -06:00
|
|
|
lb[INDEX_ID_CU_LEGACY] = &(bmain->curves);
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_MB] = &(bmain->metaballs);
|
Curves: Rename "Hair" types, variables, and functions to "Curves"
Based on discussions from T95355 and T94193, the plan is to use
the name "Curves" to describe the data-block container for multiple
curves. Eventually this will replace the existing "Curve" data-block.
However, it will be a while before the curve data-block can be replaced
so in order to distinguish the two curve types in the UI, "Hair Curves"
will be used, but eventually changed back to "Curves".
This patch renames "hair-related" files, functions, types, and variable
names to this convention. A deep rename is preferred to keep code
consistent and to avoid any "hair" terminology from leaking, since the
new data-block is meant for all curve types, not just hair use cases.
The downside of this naming is that the difference between "Curve"
and "Curves" has become important. That was considered during
design discussons and deemed acceptable, especially given the
non-permanent nature of the somewhat common conflict.
Some points of interest:
- All DNA compatibility is lost, just like rBf59767ff9729.
- I renamed `ID_HA` to `ID_CV` so there is no complete mismatch.
- `hair_curves` is used where necessary to distinguish from the
existing "curves" plural.
- I didn't rename any of the cycles/rendering code function names,
since that is also used by the old hair particle system.
Differential Revision: https://developer.blender.org/D14007
2022-02-07 11:55:54 -06:00
|
|
|
lb[INDEX_ID_CV] = &(bmain->hair_curves);
|
2020-03-17 14:41:48 +01:00
|
|
|
lb[INDEX_ID_PT] = &(bmain->pointclouds);
|
|
|
|
|
lb[INDEX_ID_VO] = &(bmain->volumes);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_LT] = &(bmain->lattices);
|
|
|
|
|
lb[INDEX_ID_LA] = &(bmain->lights);
|
|
|
|
|
lb[INDEX_ID_CA] = &(bmain->cameras);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_TXT] = &(bmain->texts);
|
|
|
|
|
lb[INDEX_ID_SO] = &(bmain->sounds);
|
|
|
|
|
lb[INDEX_ID_GR] = &(bmain->collections);
|
|
|
|
|
lb[INDEX_ID_PAL] = &(bmain->palettes);
|
|
|
|
|
lb[INDEX_ID_PC] = &(bmain->paintcurves);
|
|
|
|
|
lb[INDEX_ID_BR] = &(bmain->brushes);
|
|
|
|
|
lb[INDEX_ID_PA] = &(bmain->particles);
|
|
|
|
|
lb[INDEX_ID_SPK] = &(bmain->speakers);
|
|
|
|
|
lb[INDEX_ID_LP] = &(bmain->lightprobes);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_WO] = &(bmain->worlds);
|
|
|
|
|
lb[INDEX_ID_MC] = &(bmain->movieclips);
|
|
|
|
|
lb[INDEX_ID_SCR] = &(bmain->screens);
|
|
|
|
|
lb[INDEX_ID_OB] = &(bmain->objects);
|
|
|
|
|
lb[INDEX_ID_LS] = &(bmain->linestyles); /* referenced by scenes */
|
|
|
|
|
lb[INDEX_ID_SCE] = &(bmain->scenes);
|
|
|
|
|
lb[INDEX_ID_WS] = &(bmain->workspaces); /* before wm, so it's freed after it! */
|
2018-11-07 16:06:36 +01:00
|
|
|
lb[INDEX_ID_WM] = &(bmain->wm);
|
2019-03-08 09:29:17 +11:00
|
|
|
lb[INDEX_ID_MSK] = &(bmain->masks);
|
2020-04-20 10:37:38 +02:00
|
|
|
lb[INDEX_ID_SIM] = &(bmain->simulations);
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2018-11-07 16:06:36 +01:00
|
|
|
lb[INDEX_ID_NULL] = NULL;
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2021-03-04 18:39:07 +01:00
|
|
|
return (INDEX_ID_MAX - 1);
|
2018-11-07 16:06:36 +01:00
|
|
|
}
|