109 callback_data.
cb_flag = cb_flag;
110 const int callback_return =
data->callback(&callback_data);
117 "Iteration over ID usages should not be interrupted by the callback in "
118 "non-readonly cases");
122 if (
data->ids_handled->add(old_id)) {
148 data->cb_flag = cb_flag;
151 data->cb_flag |= cb_flag;
153 return cb_flag_backup;
159 FunctionRef<LibraryIDLinkCallback> callback,
162 LibraryForeachIDData *inherit_data);
198 if (
data->ids_handled->add(
id)) {
214 if (
data->ids_handled !=
nullptr) {
215 MEM_delete(
data->ids_handled);
250 data.ids_handled = MEM_new<Set<ID *>>(__func__);
253 data.ids_handled->add(
id);
256 data.ids_handled =
nullptr;
260 data.callback = callback;
261 data.user_data = user_data;
263#define CALLBACK_INVOKE_ID(check_id, cb_flag) \
265 CHECK_TYPE_ANY((check_id), ID *, void *); \
266 BKE_lib_query_foreachid_process(&data, (ID **)&(check_id), (cb_flag)); \
267 if (BKE_lib_query_foreachid_iter_stop(&data)) { \
268 library_foreach_ID_data_cleanup(&data); \
274#define CALLBACK_INVOKE(check_id_super, cb_flag) \
276 CHECK_TYPE(&((check_id_super)->id), ID *); \
277 BKE_lib_query_foreachid_process(&data, (ID **)&(check_id_super), (cb_flag)); \
278 if (BKE_lib_query_foreachid_iter_stop(&data)) { \
279 library_foreach_ID_data_cleanup(&data); \
292 data.owner_id = owner_id ? owner_id :
id;
307 data.owner_id = owner_id;
319 if (inherit_data ==
nullptr) {
331 bool use_bmain_relations = bmain !=
nullptr && bmain->
relations !=
nullptr &&
338 use_bmain_relations =
false;
341 if (use_bmain_relations &&
345 use_bmain_relations =
false;
347 if (use_bmain_relations) {
355 to_id_entry = to_id_entry->
next)
363 ID *to_id_tmp = to_id_entry->id_pointer.to;
371 BLI_assert(to_id_tmp == to_id_entry->id_pointer.to);
390 if (
id->override_library !=
nullptr) {
407 BKE_lib_query_idpropertiesForeachIDLink_callback(prop, &data);
415 BKE_lib_query_idpropertiesForeachIDLink_callback(prop, &data);
445#undef CALLBACK_INVOKE_ID
446#undef CALLBACK_INVOKE
483 data.owner_id = owner_id;
484 data.self_id = self_id;
485 data.ids_handled =
nullptr;
488 data.callback = callback;
489 data.user_data = user_data;
491 subdata_foreach_id(&
data);
495 const bool include_ui,
507 if (include_ui && owner_id->id_type() ==
ID_SCR) {
528 if (!owner_id_type) {
543 return (can_be_used & filter_id_type_used) != 0;
571 if (*id_p == iter->
id) {
574 "%s uses %s (refcounted: %d, userone: %d, used_one: %d, used_one_active: %d, "
575 "indirect_usage: %d)\n",
578 (cb_flag & IDWALK_USER) ? 1 : 0,
579 (cb_flag & IDWALK_USER_ONE) ? 1 : 0,
582 (cb_flag & IDWALK_INDIRECT_USAGE) ? 1 : 0);
608 static_cast<void *
>(&iter),
618 int i = lb_array.size();
619 ID *
id =
static_cast<ID *
>(idv);
620 bool is_defined =
false;
624 while (i-- && !is_defined) {
625 ID *id_curr = lb_array[i]->first();
631 for (; id_curr && !is_defined; id_curr =
static_cast<ID *
>(id_curr->
next)) {
659 bool *r_is_used_local,
660 bool *r_is_used_linked)
664 int i = lb_array.size();
665 ID *
id =
static_cast<ID *
>(idv);
666 bool is_defined =
false;
670 while (i-- && !is_defined) {
671 ID *id_curr = lb_array[i]->first();
677 for (; id_curr && !is_defined; id_curr =
static_cast<ID *
>(id_curr->
next)) {
749 std::array<int, INDEX_ID_MAX> &
num_total,
750 std::array<int, INDEX_ID_MAX> &
num_local,
777 if (status ==
Status::Unused && this->filter_fn && !this->filter_fn(&
id)) {
781 ids_status_.add_overwrite(&
id, status);
802 id->tag |= this->id_tag;
804 (*this->num_total)[id_type_index]++;
807 (*this->num_linked)[id_type_index]++;
811 (*this->num_local)[id_type_index]++;
815 id->tag &= ~this->id_tag;
833 switch (
id.id_type()) {
863 switch (
id.id_type()) {
900 const int required_usages)
907 auto foreach_id_callback =
916 if ((foreachid_cb_data->cb_flag & ignored_usages) != 0) {
920 ID &owner_id = *foreachid_cb_data->owner_id;
921 ID *id_to = *foreachid_cb_data->id_pointer;
930 if ((foreachid_cb_data->cb_flag & required_usages) == 0 &&
939 todo_ids.
push(id_to);
944 ID *id_iter = todo_ids.
pop();
964 else if (
id->us == 0) {
1008 else if (
id->us == 0) {
1037 if (
data.do_recursive) {
1047 std::array<int, INDEX_ID_MAX> num_dummy{0};
1075 data.do_local_ids =
true;
1077 data.num_total = &num_dummy;
1080 data.num_linked = &num_dummy;
1119 bool *is_changed =
static_cast<bool *
>(cb_data->
user_data);
1155 for (
bool do_loop =
true; do_loop;) {
1170 bool do_loop =
true;
1173 int i = lb_array.size();
1177 for (
ID &
id : *lb_array[i]) {
#define BKE_LIB_FOREACHID_PROCESS_ID(data_, id_, cb_flag_)
#define FOREACH_MAIN_ID_END
#define FOREACH_MAIN_ID_BEGIN(_bmain, _id)
BLI_LINKSTACK_*** wrapper macros for using a LinkNode to store a stack of pointers,...
#define BLI_LINKSTACK_PUSH(var, ptr)
#define BLI_LINKSTACK_FREE(var)
#define BLI_LINKSTACK_INIT(var)
#define BLI_LINKSTACK_POP(var)
#define ID_FAKE_USERS(id)
#define ID_IS_OVERRIDE_LIBRARY_REAL(_id)
#define ID_IS_LINKED(_id)
#define BLI_assert_unreachable()
#define UNUSED_VARS_NDEBUG(...)
#define BLI_assert_msg(a, msg)
void push(const T &value)
FunctionRef< bool(ID *id)> filter_fn
void set_id_status(ID &id, Status status)
void reset(const bool do_local_ids, const bool do_linked_ids, const bool do_recursive, std::array< int, INDEX_ID_MAX > &num_total, std::array< int, INDEX_ID_MAX > &num_local, std::array< int, INDEX_ID_MAX > &num_linked)
Status get_id_status(ID &id) const
std::array< int, INDEX_ID_MAX > * num_total
std::array< int, INDEX_ID_MAX > * num_local
std::array< int, INDEX_ID_MAX > * num_linked
UnusedIDsData(Main *bmain, const int id_tag, LibQueryUnusedIDsData ¶meters)
#define CALLBACK_INVOKE(check_id_super, cb_flag)
#define CALLBACK_INVOKE_ID(check_id, cb_flag)
bNodeTree * node_tree_from_id(ID *id)
void BKE_main_relations_free(Main *bmain)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
std::array< ListBaseT< ID > *, INDEX_ID_MAX - 1 > MainListsArray
uint64_t BKE_idtype_idcode_to_idfilter(short idcode)
unsigned __int64 uint64_t
Main * BKE_lib_query_foreachid_process_main_get(const LibraryForeachIDData *data)
void BKE_lib_query_unused_ids_tag(Main *bmain, int tag, LibQueryUnusedIDsData ¶meters)
bool BKE_library_id_can_use_idtype(ID *owner_id, short id_type_used)
static int foreach_libblock_used_linked_data_tag_clear_cb(LibraryIDLinkCallbackData *cb_data)
static void library_foreach_ID_data_cleanup(LibraryForeachIDData *data)
@ IDWALK_NO_ORIG_POINTERS_ACCESS
@ IDWALK_IGNORE_EMBEDDED_ID
@ IDWALK_DO_INTERNAL_RUNTIME_POINTERS
@ IDWALK_DO_LIBRARY_POINTER
@ IDWALK_DO_DEPRECATED_POINTERS
@ IDWALK_IGNORE_MISSING_OWNER_ID
void IDP_foreach_property(IDProperty *id_property_root, int type_filter, FunctionRef< void(IDProperty *id_property)> callback)
MainListsArray BKE_main_lists_get(Main &bmain)
static void lib_query_unused_ids_direct_tag(UnusedIDsData &data)
LibraryForeachIDFlag BKE_lib_query_foreachid_process_flags_get(const LibraryForeachIDData *data)
static void lib_query_unused_ids_find_used_dependencies(ID &id, UnusedIDsData &data, const int required_usages)
@ MAINIDRELATIONS_INCLUDE_UI
void BKE_lib_query_foreachid_process(LibraryForeachIDData *data, ID **id_pp, LibraryForeachIDCallbackFlag cb_flag)
void BKE_library_ID_test_usages(Main *bmain, void *idv, bool *r_is_used_local, bool *r_is_used_linked)
AnimData * BKE_animdata_from_id(const ID *id)
static bool library_ID_is_used(Main *bmain, void *idv, const bool check_linked)
static bool id_is_used_dependency_exception(ID &id)
const IDTypeInfo * BKE_idtype_get_info_from_id(const ID *id)
void BKE_lib_query_unused_ids_amounts(Main *bmain, LibQueryUnusedIDsData ¶meters)
void BKE_library_foreach_subdata_id(Main *bmain, ID *owner_id, ID *self_id, FunctionRef< void(LibraryForeachIDData *data)> subdata_foreach_id, FunctionRef< LibraryIDLinkCallback > callback, void *user_data, const LibraryForeachIDFlag flag)
int BKE_lib_query_foreachid_process_callback_flag_override(LibraryForeachIDData *data, LibraryForeachIDCallbackFlag cb_flag, bool do_replace)
@ IDP_FLAG_OVERRIDABLE_LIBRARY
bool BKE_library_ID_is_locally_used(Main *bmain, void *idv)
static bool id_is_enforced_used(ID &id, UnusedIDsData &data)
BMesh const char void * data
void BKE_library_foreach_ID_embedded(LibraryForeachIDData *data, ID **id_pp)
int BKE_idtype_idcode_to_index(short idcode)
void BKE_animdata_foreach_id(AnimData *adt, LibraryForeachIDData *data)
void BKE_library_unused_linked_data_set_tag(Main *bmain, bool do_init_tag)
void BKE_main_relations_create(Main *bmain, short flag)
static bool library_foreach_ID_link(Main *bmain, ID *owner_id, ID *id, FunctionRef< LibraryIDLinkCallback > callback, void *user_data, LibraryForeachIDFlag flag, LibraryForeachIDData *inherit_data)
bool BKE_lib_query_foreachid_iter_stop(const LibraryForeachIDData *data)
void id_us_ensure_real(ID *id)
@ IDWALK_RET_STOP_RECURSION
uint64_t BKE_library_id_can_use_filter_id(const ID *owner_id, const bool include_ui, const IDTypeInfo *owner_id_type=nullptr)
void BKE_library_update_ID_link_user(ID *id_dst, ID *id_src, int cb_flag)
@ ID_TAG_NO_USER_REFCOUNT
ID * BKE_id_owner_get(ID *id, const bool debug_relationship_assert=true)
static int foreach_libblock_id_users_callback(LibraryIDLinkCallbackData *cb_data)
bool BKE_library_ID_is_indirectly_used(Main *bmain, void *idv)
LibraryForeachIDCallbackFlag
@ IDWALK_CB_DIRECT_WEAK_LINK
@ IDWALK_CB_EMBEDDED_NOT_OWNING
@ IDWALK_CB_OVERRIDE_LIBRARY_NOT_OVERRIDABLE
@ IDWALK_CB_OVERRIDE_LIBRARY_HIERARCHY_ROOT
@ IDWALK_CB_OVERRIDE_LIBRARY_REFERENCE
@ IDWALK_CB_INDIRECT_USAGE
static void lib_query_unused_ids_recursive_tag(UnusedIDsData &data)
int BKE_library_ID_use_ID(ID *id_user, ID *id_used)
static void lib_query_unused_ids_tag(UnusedIDsData &data)
void BKE_lib_query_idpropertiesForeachIDLink_callback(IDProperty *id_prop, void *user_data)
void BKE_library_foreach_ID_link(Main *bmain, ID *id, FunctionRef< LibraryIDLinkCallback > callback, void *user_data, LibraryForeachIDFlag flag)
void BKE_library_indirectly_used_data_tag_clear(Main *bmain)
@ IDTYPE_FLAGS_NEVER_UNUSED
struct ID * subitem_local_id
struct ID * subitem_reference_id
ListBaseT< IDOverrideLibraryPropertyOperation > operations
IDTypeForeachIDFunction foreach_id
uint64_t dependencies_id_types
IDProperty * system_properties
std::array< int, INDEX_ID_MAX > num_linked
std::array< int, INDEX_ID_MAX > num_total
std::array< int, INDEX_ID_MAX > num_local
LibraryForeachIDFlag flag
LibraryForeachIDCallbackFlag cb_flag
FunctionRef< LibraryIDLinkCallback > callback
LibraryForeachIDCallbackFlag cb_flag_clear
BLI_LINKSTACK_DECLARE(ids_todo, ID *)
Set< ID * > * ids_handled
LibraryForeachIDCallbackFlag cb_flag
MainIDRelationsEntryItem * next
MainIDRelationsEntryItem * to_ids
Map< const ID *, MainIDRelationsEntry * > * relations_from_pointers
MainIDRelations * relations